Popularity
0.7
Growing
Activity
5.3
-
1
1
0
Description
Provides data structures that serve as drop-in replacements for Array, Hash, and Set.
Unlike the standard types, these structures support sizes that exceed 32-bit indices.
The implementation is based on the Crystal standard library, with 32-bit integers
replaced by 64-bit integers.
Programming language: Crystal
License: MIT License
Tags:
Algorithms And Data Structures
Data Structures
Big Data
big-types alternatives and similar shards
Based on the "Algorithms and Data structures" category.
Alternatively, view big-types.cr alternatives based on common mentions on social networks and blogs.
-
graphlb
graphlb is a crystal library which contains all the graph Data-Structures and Algorithms implemented in crystal-lang. -
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. -
text
A collection of phonetic algorithms for Crystal. Including; Porter-Stemmer, Soundex, Metaphone, Double Metaphone & White Similarity -
haversine
Crystal implementation of the Haversine formula to calculate distances between two points given their latitudes and longitudes -
SPAKE2+
a crystal lang implementation of SPAKE2+, a Password Authenticated Key Exchange (PAKE) protocol
InfluxDB high-performance time series database
Collect, organize, and act on massive volumes of high-resolution data to power real-time intelligent systems.
Promo
influxdata.com

Do you think we are missing an alternative of big-types or a related project?