20 points habedi0 | 1 comments | 28 Oct 25 05:26 UTC | HN request time: 0s | source

I made an early version of a sorted collection library for Zig. Sorted collections are data structures that maintain the data in sorted order. Examples of these data structures are `java.util.TreeMap` in Java and `std::map` in C++. These data structures are mainly used for fast lookups (point search) and fast range searches.

The library is available on GitHub: https://github.com/CogitatorTech/ordered

Show context

masklinn ◴[28 Oct 25 07:19 UTC] No.45729981[source]▶

>>45729457 (OP) #

… why are you calling it ordered when it’s sorted rather than, well, ordered?

replies(3): >>45730075 #>>45730682 #>>45734693 #

1. habedi0 ◴[28 Oct 25 07:38 UTC] No.45730075[source]▶

>>45729981 #

I picked that name (`ordered`, as in `put into and kept in an arrangement`) when I started the project a few months ago and decided to keep it.

↑

Show HN: Ordered – A sorted collection library for Zig