primes alternatives and similar shards

Based on the "Algorithms and Data structures" category.
Alternatively, view primes alternatives based on common mentions on social networks and blogs.

crystalline

9.1 0.0 primes VS crystalline

A collection of containers & algorithms for the Crystal programming language
radix

8.7 0.0 primes VS radix

Radix Tree implementation for Crystal

Collect and Analyze Billions of Data Points in Real Time

Manage all types of time series data in a single, purpose-built database. Run at any scale in any environment in the cloud, on-premises, or at the edge.

Promo www.influxdata.com

CrOTP

8.0 1.6 primes VS CrOTP

CrOTP - One Time Passwords for Crystal
fzy

6.6 0.0 primes VS fzy

A Crystal port of awesome Fzy project, a fuzzy finder algorithm.
crystalg

6.5 0.0 primes VS crystalg

Algorithm Library for Crystal
bitfields

6.1 0.0 primes VS bitfields

Bit Fields for Crystal Language
crystaledge

6.0 0.0 primes VS crystaledge

A pure Crystal Vector Math library
blurhash.cr

5.3 0.0 primes VS blurhash.cr

A pure Crystal implementation of BlurHash algorithm
qr-code

4.7 0.0 primes VS qr-code

a QR Code implementation written in crystal lang
graphlb

4.7 0.0 primes VS graphlb

graphlb is a crystal library which contains all the graph Data-Structures and Algorithms implemented in crystal-lang.
markov

4.5 0.0 primes VS markov

⛓ A Crystal library for building Markov Chains and running Markov Processes.
kd_tree

4.4 0.0 primes VS kd_tree

Crystal implementation of "K-Dimensional Tree" and "N-Nearest Neighbors"
crystal-linked-list

4.4 0.0 primes VS crystal-linked-list

Simple linked list implementation in Crystal
Goban

4.3 10.0 primes VS Goban

A fast and efficient QR/Micro QR/rMQR Code implementation in Crystal lang
text

4.1 0.0 primes VS text

A collection of phonetic algorithms for Crystal. Including; Porter-Stemmer, Soundex, Metaphone, Double Metaphone & White Similarity
crie

4.1 0.0 primes VS crie

Compile-time Trie in Crystal
splay_tree_map

4.0 0.0 primes VS splay_tree_map

This is a Crystal implementation of a Splay Tree; which is a type of binary search tree that is semi-balanced and that tends to self-optimize so that the most accessed items are the fastest to retrieve.
ksuid.cr

4.0 0.0 primes VS ksuid.cr

Crystal implementation of K-Sortable Globally Unique IDs
haversine

3.9 0.0 primes VS haversine

Crystal implementation of the Haversine formula to calculate distances between two points given their latitudes and longitudes
delimiter_tree

3.9 0.0 primes VS delimiter_tree

A crystal-lang tree structure that is built using a delimiter.
edits.cr

3.7 0.0 primes VS edits.cr

Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment
csuuid

3.7 0.0 primes VS csuuid

This is a small UUID library that implements a chronologically sortable UUID.
murmur3

3.5 0.0 primes VS murmur3

Crystal implementation of Murmur3 hash algorithm used by Cassandra
ternary_search_tree

3.4 0.0 primes VS ternary_search_tree

A Crystal implementation of a Ternary Search Tree
bisect

3.0 0.0 primes VS bisect

Library for maintaining sorted Arrays
ranger

2.6 0.0 primes VS ranger

Range object operation in Crystal
miller_rabin

2.4 0.0 primes VS miller_rabin

Miller-Rabin algorithm for prime checking
heap.cr

2.3 0.0 primes VS heap.cr

data structure heap for crystal-lang
hash_ring

2.3 0.0 primes VS hash_ring

Implementation of Consistent Hash Ring for Crystal
aho_corasick

2.2 0.0 primes VS aho_corasick

aho_corasick for crystal-lang
secure-remote-password

2.1 3.5 primes VS secure-remote-password

Crystal implementation of the Secure Remote Password protocol (SRP-6a)
multiset.cr

2.0 0.0 primes VS multiset.cr

Multiset (bag) implementation in Crystal
s2_cells

1.4 0.0 primes VS s2_cells

maps latitude and longitude to S2 Cells https://s2geometry.io/