bitfields alternatives and similar shards

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

crystalline

9.0 2.8 bitfields VS crystalline

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

8.8 0.0 bitfields VS radix

Radix Tree implementation for Crystal

Stream - Scalable APIs for Chat, Feeds, Moderation, & Video.

Stream helps developers build engaging apps that scale to millions with performant and flexible Chat, Feeds, Moderation, and Video APIs and SDKs powered by a global edge network and enterprise-grade infrastructure.

Promo getstream.io

CrOTP

8.0 0.0 bitfields VS CrOTP

CrOTP - One Time Passwords for Crystal
fzy

6.9 5.6 bitfields VS fzy

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

6.7 0.0 bitfields VS crystalg

Algorithm Library for Crystal
crystaledge

5.9 0.0 bitfields VS crystaledge

A pure Crystal Vector Math library
blurhash.cr

5.6 5.7 bitfields VS blurhash.cr

A pure Crystal implementation of BlurHash algorithm
Goban

5.6 4.2 bitfields VS Goban

A fast and efficient QR/Micro QR/rMQR Code implementation in Crystal lang
qr-code

5.1 3.5 bitfields VS qr-code

a QR Code implementation written in crystal lang
graphlb

4.6 0.0 bitfields VS graphlb

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

4.5 7.4 bitfields VS kd_tree

Crystal implementation of "K-Dimensional Tree" and "N-Nearest Neighbors"
markov

4.3 0.0 bitfields VS markov

⛓ A Crystal library for building Markov Chains and running Markov Processes.
crystal-linked-list

4.3 0.0 bitfields VS crystal-linked-list

Simple linked list implementation in Crystal
splay_tree_map

4.0 2.2 bitfields 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.
csuuid

3.9 3.8 bitfields VS csuuid

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

3.9 0.0 bitfields VS crie

Compile-time Trie in Crystal
text

3.8 0.0 bitfields VS text

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

3.7 3.2 bitfields VS ksuid.cr

Crystal implementation of K-Sortable Globally Unique IDs
haversine

3.6 7.4 bitfields VS haversine

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

3.3 0.0 bitfields VS delimiter_tree

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

3.2 3.2 bitfields VS edits.cr

Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment
secure-remote-password

3.1 3.2 bitfields VS secure-remote-password

Crystal implementation of the Secure Remote Password protocol (SRP-6a)
ternary_search_tree

3.0 0.0 bitfields VS ternary_search_tree

A Crystal implementation of a Ternary Search Tree
murmur3

2.9 0.0 bitfields VS murmur3

Crystal implementation of Murmur3 hash algorithm used by Cassandra
bisect

2.8 0.0 bitfields VS bisect

Library for maintaining sorted Arrays
hash_ring

2.5 0.0 bitfields VS hash_ring

Implementation of Consistent Hash Ring for Crystal
ranger

2.3 0.0 bitfields VS ranger

Range object operation in Crystal
heap.cr

2.0 0.0 bitfields VS heap.cr

data structure heap for crystal-lang
aho_corasick

1.9 0.0 bitfields VS aho_corasick

aho_corasick for crystal-lang
multiset.cr

1.6 0.0 bitfields VS multiset.cr

Multiset (bag) implementation in Crystal
miller_rabin

1.5 0.0 bitfields VS miller_rabin

Miller-Rabin algorithm for prime checking
primes

1.1 0.0 bitfields VS primes

Library for testing primality and factoring integers in Crystal
s2_cells

1.1 5.5 bitfields VS s2_cells

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

0.8 5.3 bitfields VS big-types

Drop-in replacements for Array, Set, and Hash in Crystal, but not limited to 32-bit indexes.
HKDF

0.8 5.0 bitfields VS HKDF

HMAC-based Extract-and-Expand Key Derivation Function (HKDF) for crystal lang
SPAKE2+

0.7 4.9 bitfields VS SPAKE2+

a crystal lang implementation of SPAKE2+, a Password Authenticated Key Exchange (PAKE) protocol
verhoeff

0.6 4.6 bitfields VS verhoeff

implementation of the Verhoeff checksum algorithm in crystal lang
named_information

0.6 5.8 bitfields VS named_information

A crystal lang implementation of rfc6920 (Naming Things with Hashes)

Do you think we are missing an alternative of bitfields or a related project?

Add another 'Algorithms and Data structures' Shard

Popular Comparisons

README

Bit Fields for Crystal-Lang

Pure Crystal implementation of Bit Fields. Handles encoding/decoding of bytes.

Installation

Add the dependency to your shard.yml: yaml dependencies: bitfields: github: elorest/bitfields
Run shards install

Usage

require "bitfields"

class CrossBit < BitFields
  bf rpms : UInt32, 32
  bf temp : UInt8, 4 
  bf psi : UInt16, 9 
  bf power : UInt8, 1 
  bf lights : UInt8, 2 
end

crossbit = CrossBit.new(Bytes[109, 121, 110, 97, 109, 245])
crossbit.temp          #=> 13_u8
crossbit.psi           #=> 342_u16
crossbit.power         #=> 1_u8
crossbit.lights        #=> 3_u8
crossbit.to_slice      #=> Bytes[109, 121, 110, 97, 109, 245]
crossbit.to_s          #=> |lights|power|psi|temp|rpms|
                       #=> |11|1|101010110|1101|01100001011011100111100101101101|
crossbit.power = 0     #=> 0_u8
crossbit.to_slice      #=> Bytes[109, 121, 110, 97, 109, 213]