sorted_set alternatives and similar packages
Based on the "Algorithms and Data structures" category
-
datastructures
A collection of protocols, implementations and wrappers to work with data structures. -
exconstructor
An Elixir library for generating struct constructors that handle external data with ease. -
exmatrix
ExMatrix is a small library for working with matrices, originally developed for testing matrix multiplication in parallel. -
parex
Parallel Execute (Parex) is an Elixir module for executing multiple (slow) processes in parallel. -
blocking_queue
BlockingQueue is a simple queue implemented as a GenServer. It has a fixed maximum length established when it is created. -
ecto_materialized_path
Tree structure, hierarchy and ancestry for the ecto models. -
MapDiff
Calculates the difference between two (nested) maps, and returns a map representing the patch of changes. -
cuid
Collision-resistant ids optimized for horizontal scaling and sequential lookup performance, written in Elixir. -
ratio
Adds Rational Numbers and allows them to be used in common arithmatic operations. Also supports conversion between Floats and Rational Numbers. -
paratize
Elixir library providing some handy parallel processing (execution) facilities that support configuring number of workers and timeout.
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest. Visit our partner's website for more details.
Do you think we are missing an alternative of sorted_set or a related project?
Popular Comparisons
|
SaaSHub - Software Alternatives and Reviews
View more from us
|
README
SortedSet
A sorted set library for Elixir. Implements the Set protocol.
Installation
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.
About
Sorted sets are backed by a red-black tree, providing lookup in O(log(n)). Size is tracked automatically, resulting in O(1) performance.
Basic Usage
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]
Custom Comparison
Sorted Set can also take a custom :comparator function to determine ordering. The
function should accept two terms and
- return
0if they are considered equal - return
-1if the first is considered less than or before the second - return
1if the first is considered greater than or after the second
This function is passed on to the underlying red-black tree implementation implemetation. Otherwise, the default Erlang term comparison is used (with an extra bit to handle edgecases — see note in RedBlackTree README.)
SortedSet.new([:a, :b, :c], comparator: fn (term1, term2) ->
RedBlackTree.compare_terms(term1, term2) * -1
end)
# => #SortedSet<[:c, :b, :a]>