minmaxlist alternatives and similar packages
Based on the "Algorithms and Data structures" category.
Alternatively, view minmaxlist 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" -
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 -
MapDiff
Calculates the difference between two (nested) maps, and returns a map representing the patch of changes. -
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) -
DeepMerge
Deep (recursive) merge for maps, keywords and others in Elixir -
dataframe
Package providing functionality similar to Python's Pandas or R's data.frame() -
ecto_materialized_path
Tree structure & hierarchy for ecto models -
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. -
Mappable
Simple module that provides unified, simple interface for converting between different dictionary-like data types in Elixir. -
combination
A simple combinatorics library providing combination and permutation.
Clean code begins in your IDE with SonarLint
* 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 minmaxlist or a related project?
README
Minmaxlist
Elixir library extending Enum.min_by/2
, Enum.max_by/2
and Enum.min_max_by/2
to return a list of results instead of just one.
This enables searching for all matching results based multiple min/max value criteria. See Examples.
Documentation
API documentation is available at http://hexdocs.pm/minmaxlist
Adding Minmaxlist To Your Project
To use Minmaxlist with your projects, edit your mix.exs
file and add it as a dependency:
defp deps do
[
{:minmaxlist, "~> x.x.x"},
]
end
Examples
Minmaxlist is designed to assist in filtering result sets by min/max value while returning list of results that matches the requirement. This is especially useful for example,
Find the youngest people with highest income.
import Minmaxlist
[
%{name: "A", age: 24, income: 4000},
%{name: "B", age: 22, income: 3300},
%{name: "C", age: 22, income: 2800},
%{name: "D", age: 25, income: 5000},
%{name: "E", age: 22, income: 3300},
%{name: "F", age: 25, income: 5500},
%{name: "G", age: 24, income: 4500},
] |> min_list_by(&(&1.age)) |> max_list_by(&(&1.income))
# => [%{name: "B", age: 22, income: 3300}, %{name: "E", age: 22, income: 3300}]
Find the youngest and oldest people,
import Minmaxlist
[
%{name: "A", age: 24, income: 4000},
%{name: "B", age: 22, income: 3300},
%{name: "C", age: 22, income: 2800},
%{name: "D", age: 25, income: 5000},
%{name: "E", age: 22, income: 3300},
%{name: "F", age: 25, income: 5500},
%{name: "G", age: 24, income: 4500},
] |> min_max_list_by(&(&1.age))
# => {
# [%{name: "B", age: 22, income: 3300}, %{name: "C", age: 22, income: 2800}, %{name: "E", age: 22, income: 3300}],
# [%{name: "D", age: 25, income: 5000}, %{name: "F", age: 25, income: 5500}]
# }
LICENSE
This software is licensed under [MIT License](LICENSE.md).
*Note that all licence references and agreements mentioned in the minmaxlist README section above
are relevant to that project's source code only.