dlist alternatives and similar packages
Based on the "Algorithms and Data structures" category.
Alternatively, view dlist alternatives based on common mentions on social networks and blogs.
-
matrex
A blazing fast matrix library for Elixir/Erlang with C implementation using CBLAS. -
exconstructor
An Elixir library for generating struct constructors that handle external data with ease. -
erlang-algorithms
Implementations of popular data structures and algorithms -
remodel
:necktie: An Elixir presenter package used to transform map structures. "ActiveModel::Serializer for Elixir" -
MapDiff
Calculates the difference between two (nested) maps, and returns a map representing the patch of changes. -
aja
Extension of the Elixir standard library focused on data stuctures, data manipulation and performance -
the_fuzz
String metrics and phonetic algorithms for Elixir (e.g. Dice/Sorensen, Hamming, Jaccard, Jaro, Jaro-Winkler, Levenshtein, Metaphone, N-Gram, NYSIIS, Overlap, Ratcliff/Obershelp, Refined NYSIIS, Refined Soundex, Soundex, Weighted Levenshtein) -
exmatrix
Elixir library implementing a parallel matrix multiplication algorithm and other utilities for working with matrices. Used for benchmarking computationally intensive concurrent code. -
ecto_materialized_path
Tree structure & hierarchy for ecto models -
dataframe
Package providing functionality similar to Python's Pandas or R's data.frame() -
Conrex
An Elixir implementation of the CONREC algorithm for topographic or isochrone maps. -
murmur
:speech_balloon: An implementation of the non-cryptographic hash Murmur3 -
bitmap
Bitmap implementation in Elixir using binaries and integers. Fast space efficient data structure for lookups -
Closure Table
Closure Table for Elixir - a simple solution for storing and manipulating complex hierarchies. -
paratize
Elixir library providing some handy parallel processing facilities that supports configuring number of workers and timeout.
Collect and Analyze Billions of Data Points in Real Time
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of dlist or a related project?
Popular Comparisons
README
Dlist
An elixir library containing two Deque implementations.
API documentation is available at http://hexdocs.pm/dlist
Add as dependency
{:dlist, "~> 0.0.1"}
Libraries
Dlist.Deque
This implementation is a two list solution.
This supports fast inserts done in constant time. The first
and last
operations are worst case O(n). to_list
is also O(n) worst case.
alias Dlist.Deque
deque = Deque.new
deque = Deque.append(deque, 2)
deque = Deque.append(deque, 3)
deque = Deque.prepend(deque, 1)
deque = Deque.prepend(deque, 0)
IO.puts inspect Deque.to_list(deque)
# ==> [0, 1, 2, 3]
Dlist.DoublyLinkedList
This implementation uses a gen_server and therefore is mutable. This is similar to your standard doubly linked list in imperative languages.
It supports fast inserts in constant time. first
and last
operations are also done in constant time. to_list
, is always O(n) since it must traverse all nodes to build the list.
Be sure to destory the list when you're finished using it.
alias Dlist.DoublyLinkedList, as: DLL
{:ok, dll} = DLL.new
DLL.append(dll, 2)
DLL.append(dll, 3)
DLL.prepend(dll, 1)
DLL.prepend(dll, 0)
IO.puts inspect DLL.to_list(dll)
# ==> [0, 1, 2, 3]
DLL.destroy(dll)
Benchmarks
The two list Deque
implementation is much faster than the gen_server DoublyLinkedList
for the sample code above. The benchmarking script can be found in benchmarks.exs
.
$ mix run benchmarks.exs
*** &DlistBenchmark.deque_append_prepend_to_list/0 ***
1.2 sec 2M iterations 0.6 μs/op
*** &DlistBenchmark.dll_append_prepend_to_list/0 ***
1.2 sec 8K iterations 157.36 μs/op