A sorted set library for Elixir. Implements the Set protocol.
Add the following to deps section of your mix.exs:
{:sorted_set, "~> 1.0"}
and then mix deps.get. That's it!
Generate the documentation with mix docs.
Sorted sets are backed by a red-black tree, providing lookup in O(log(n)). Size is tracked automatically, resulting in O(1) performance.
SortedSet implements the Set behaviour, Enumerable, and Collectable.
SortedSet.new()
|> Set.put(5)
|> Set.put(1)
|> Set.put(3)
|> Enum.reduce([], fn (element, acc) -> [element*2|acc] end)
|> Enum.reverse
# [2, 6, 10]