News for hackers. Stuff that matters.
Re:Optimizing Hash-Array Mapped Tries for Fast Immutable JVM... by FreakLegion on Saturday August 05, 2017 @10:17PM (#14939296)
Depending on the use case, of course. Sometimes you need a structure that's both associative and ordered, for example, in which case std::map is handy.
Re:Optimizing Hash-Array Mapped Tries for Fast Immutable JVM... by masklinn on Sunday August 06, 2017 @04:34AM (#14940425)
HAMT are not intrinsically ordered or sorted.
Re:Optimizing Hash-Array Mapped Tries for Fast Immutable JVM... by FreakLegion on Sunday August 06, 2017 @03:31PM (#14943011)
The comment obviously refers to std::map, which it mentions explicitly and which guarantees ordering.
Re:Optimizing Hash-Array Mapped Tries for Fast Immutable JVM... by masklinn on Monday August 07, 2017 @03:35AM (#14945893)
But the entire discussion is about HAMT not std::map, the parent comment only talks about std::map as an example of performance issues in tree-based maps in asking how that relates to HAMT, it doesn't actually care a whit about std::map.