adoptium.net VS amber-docs

1.18 requires Java 17. (Java link if you need it)

Note: In order for JarFix to work, you needed add all options when installing Java (Picture).

Did you actually install a Java Development Kit? Because this sounds like you only installed a text editor. You can download it here: https://adoptium.net/ (download the latest version for your OS and install it)

Try this https://adoptium.net/

Make sure you have Java fully installed (select all components when installing). Link to Java download if you need it: (Link)

if you downloaded Java from adoptopenjdk/adoptium/temurin/whatever they call it now, you do have it.

I had the same issue and I fixed it with downloading openjdk 17. you can download it here https://adoptium.net/

Which was recently rebranded as Eclipse Temurin

if they are using Windows, have them reinstall java https://adoptium.net/

e.g https://adoptium.net/

Record patterns are one step on the path to general pattern matching utility. The bigger building block is general deconstructors. I recommend reading Functional Transformation of Immutable Objects by Brian Goetz. The idea of "withers" shown there requires deconstructors:

https://github.com/openjdk/amber-docs/blob/master/eg-drafts/...

This is the vague plan.

You may be joking but...

Here is the much more detailed version: https://github.com/openjdk/amber-docs/blob/master/eg-drafts/reconstruction-records-and-classes.md

This kind of pattern matching is discussed in the design notes: https://github.com/openjdk/amber-docs/blob/master/site/design-notes/patterns/pattern-match-object-model.md

True, but that only pushes the question of value down the line.

I'm curious about lenses because Java did have a serious problem that required a solution: working with "simple" data correctly was difficult. The chosen solution was ADTs, so we did buy into that. But the approach being explored for transforming records (https://github.com/openjdk/amber-docs/blob/master/eg-drafts/...) only works one level at a time rather than for an entire path. So I wonder how valuable it would be to have a solution for paths. If the answer is that it's mostly valuable for an approach we haven't bought into yet, then we might not need to consider it just yet.

Just a heads up, something like that spread operator is actually coming sooner or later to java: https://github.com/openjdk/amber-docs/blob/master/eg-drafts/...

Pattern matching (for records) is already a preview feature.