inverting a linkedhashmap

[leaden lichen]

how do I invert the order of a linkedhashmap so that the newer entries are the first?

[waxen jay]

<@&987246399047479336> please have a look, thanks.

[waxen jay]

While you are waiting for getting help, here are some tips to improve your experience:

Code is much easier to read if posted with syntax highlighting and proper formatting.

If nobody is calling back, that usually means that your question was not well asked and hence nobody feels confident enough answering. Try to use your time to elaborate, provide details, context, more code, examples and maybe some screenshots. With enough info, someone knows the answer for sure.

Don't forget to close your thread using the command </help-thread close:1027500463647621170> when your question has been answered, thanks.

[wicked narwhal]

why are you trying to do that ?

[leaden lichen]

i'm iterating trough a keyset and i need an inversed insertion order

[wicked narwhal]

You can't really do that currently afaik, unless maybe you create a class with logic which does that 🤔
But note that soon java will have such a thing, but it's not ready yet

[leaden lichen]

i used collections.reverse and turned the keyset in a list

[wicked narwhal]

well, if you do a copy, yes it works, but you don't want to copy it each time do you ?

[leaden lichen]

i made it outside of the for loop

and then i iterate inside it in the for

[wicked narwhal]

yes you can do that

but that's not a good solution

and there is no real good solution currently in java

either you make a complex class

or you do a copy each time

[leaden lichen]

i'll stick to the bad solution since it'd take too much to write my own logic

[wicked narwhal]

you can also do that btw

or this if you prefer

@leaden lichen