Popularity
0.4
Stable
Activity
0.0
Stable
2
1
0
Monthly Downloads: 6
Programming language: Elixir
License: MIT License
spacesaving alternatives and similar packages
Based on the "Algorithms and Data structures" category.
Alternatively, view spacesaving 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. -
merkle_tree
:evergreen_tree: Merkle Tree implementation in pure Elixir -
parallel_stream
A parallelized stream implementation for Elixir -
aja
Extension of the Elixir standard library focused on data stuctures, data manipulation and performance -
bloomex
:hibiscus: A pure Elixir implementation of Scalable Bloom Filters -
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 -
combination
A simple combinatorics library providing combination and permutation. -
paratize
Elixir library providing some handy parallel processing facilities that supports configuring number of workers and timeout.
Elixir and Phoenix Application Security Platform
Replace Snyk, reCaptcha, and Cloudflare bot defense with the only application security platform built for Elixir and Phoenix.
Promo
paraxial.io
* 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 spacesaving or a related project?
|
Learn Elixir in as little as 12 Weeks
sponsored
learn-elixir.dev
|
Popular Comparisons
-
spacesavingvsminmaxlist
-
spacesavingvshypex
-
spacesavingvsbitmap
-
spacesavingvsbloomex
-
spacesavingvsblocking_queue
|
Clean code begins in your IDE with SonarLint
sponsored
www.sonarlint.org
|
README
Spacesaving
Simple algorithm to estimate distinct elements in an unbounded stream using bounded space. The estimate is the upper bound on the element's actual count.
Usage
Add it to you mix.exs deps
{:spacesaving, "~> 0.0.2"}
Init with 3 spaces, so we track 3 elements
import Spacesaving
state = init(3)
Push some elements
state = state
|> push(:foo) |> push(:foo) |> push(:foo) |> push(:foo)
|> push(:bar) |> push(:bar) |> push(:bar)
|> push(:baz) |> push(:baz)
|> push(:buzz)
Get the top k elements
top(state, 2) # This will be [foo: 4, bar: 3]
top(state, 3) # This will be [foo: 4, bar: 3, buzz: 3], so the inaccuracy starts to come into play when an element is kicked out, and the estimate is the upper bound
Merge two states
left = init(4) |> push(:foo) |> push(:bar)
right = init(4) |> push(:foo) |> push(:baz)
merge(left, right)
|> top(3) # Would be [foo: 2, bar: 1, baz: 1]