zipper_tree alternatives and similar packages
Based on the "Algorithms and Data structures" category.
Alternatively, view zipper_tree alternatives based on common mentions on social networks and blogs.
-
-
-
matrex
A blazing fast matrix library for Elixir/Erlang with C implementation using CBLAS. -
simple_bayes
A Naive Bayes machine learning implementation in Elixir. -
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. -
parallel_stream
A parallelized stream implementation for Elixir -
merkle_tree
:evergreen_tree: Merkle Tree implementation in pure Elixir -
bloomex
:hibiscus: A pure Elixir implementation of Scalable Bloom Filters -
aja
Extension of the Elixir standard library focused on data stuctures, data manipulation and performance -
DeepMerge
Deep (recursive) merge for maps, keywords and others in Elixir -
exmatrix
Elixir library implementing a parallel matrix multiplication algorithm and other utilities for working with matrices. Used for benchmarking computationally intensive concurrent code. -
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) -
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 -
paratize
Elixir library providing some handy parallel processing facilities that supports configuring number of workers and timeout. -
Closure Table
Closure Table for Elixir - a simple solution for storing and manipulating complex hierarchies. It provides in-memory and Ecto adapters.
Access the most powerful time series database as a service
* 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 zipper_tree or a related project?
|
Clean code begins in your IDE with SonarLint
sponsored
www.sonarlint.org
|
Popular Comparisons
-
zipper_treevserlang-algorithms
-
zipper_treevswitchcraft
-
zipper_treevscuid
-
zipper_treevscuckoo
-
zipper_treevsmerkle_tree
|
SaaSHub - Software Alternatives and Reviews
sponsored
www.saashub.com
|
README
ZipperTree
Provides traversal and modification methods for variadic arity tree's. All methods maintain an active 'cursor' or focus in the tree. The methods will also technically work for lists too - I guess, if you're into that sorta thing.
All traversal and insertion methods happen in constant time with exception to up, which is porportional to how many nodes were junior to the current subtree.
This is an implementation of Gérard Huet's tree with a zipper (originally published in Functional Pearl: The Zipper), essentially a direct conversion of the published oocaml code to elixir.
WTF is a Zipper
A zipper is a novel method for encoding a focus, or position state of a collection in purely functional languages. The zipper is an analogy for the process of moving up and down the structure and how it can be thought of as opening and closing a zipper. For a better description of the data structure I recommend you read the paper linked above, although usage does not necessarily require you understand it's implementation.
Usage
Just add {:zipper_tree, "~> 0.1.1"} to your dependencies.
The implementation provided works for trees of variadic arity, simply define a tree using nested lists
iex(3)> import ZipperTree
iex(4)> tree = [
1,
2,
[
3,
4
]
]
[1, 2, [3, 4]]
iex(5)> tree
|> nth(3)
%ZipperTree.Loc{loc: [3, 4],
path: %ZipperTree.Node{left: [2, 1], right: [], up: Top}}
iex(6)> tree
|> nth(3)
|> right
{:error, "right of last"}
iex(7)> tree
|> nth(3)
|> down
%ZipperTree.Loc{loc: 3,
path: %ZipperTree.Node{left: [], right: [4],
up: %ZipperTree.Node{left: [2, 1], right: [], up: Top}}}
iex(8)> tree
|> nth(3)
|> down
|> right
%ZipperTree.Loc{loc: 4,
path: %ZipperTree.Node{left: [3], right: [],
up: %ZipperTree.Node{left: [2, 1], right: [], up: Top}}}
iex(9)> tree
|> nth(3)
|> down
|> right
|> top
%ZipperTree.Loc{loc: [1, 2, [3, 4]], path: Top}
iex(10)> tree
|> nth(3)
|> down
|> right
|> change(:sup)
|> top
%ZipperTree.Loc{loc: [1, 2, [3, :sup]], path: Top}
iex(11)> tree
|> nth(3)
|> down
|> right
|> insert_left(:over_here_now)
|> top
%ZipperTree.Loc{loc: [1, 2, [3, :over_here_now, 4]], path: Top}
Then move around the tree using down, left, right, up, nth, top and
make modifications with change, insert_down, insert_left, insert_right.
For specific method examples check the tests.
Road map
- [x] traversal
- [x] modification and insertion
- [ ] implement protocols (Enum, etc.)
- [ ] various search strategies
- [ ] ???