Popularity

6.0

Growing

Activity

0.0

Declining

Stars 24

Watchers 2

Forks 6

Last Commit about 1 year ago

Programming language: Crystal

License: MIT License

Tags: Algorithms And Data Structures

Latest version: v0.31.1

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.1 0.0 bitfields VS crystalline

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

8.7 3.6 bitfields VS radix

Radix Tree implementation for Crystal

Run Linux Software Faster and Safer than Linux with Unikernels

Promo github.com/nanovms

CrOTP

7.8 3.2 bitfields VS CrOTP

CrOTP - One Time Passwords for Crystal
crystalg

6.5 3.0 bitfields VS crystalg

Algorithm Library for Crystal
crystaledge

5.9 0.0 bitfields VS crystaledge

A pure Crystal Vector Math library
fzy

5.7 2.4 bitfields VS fzy

A Crystal port of awesome Fzy project fuzzy finder algorithm.
graphlb

5.0 0.5 bitfields VS graphlb

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

4.6 0.8 bitfields VS markov

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

4.5 0.0 bitfields VS text

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

4.4 1.2 bitfields VS blurhash.cr

A pure Crystal implementation of BlurHash algorithm
crystal-linked-list

4.4 0.0 bitfields VS crystal-linked-list

Simple linked list implementation in Crystal
qr-code

4.2 2.4 bitfields VS qr-code

a QR Code implementation written in crystal lang
crie

4.1 2.4 bitfields VS crie

Compile-time Trie in Crystal
kd_tree

4.1 0.4 bitfields VS kd_tree

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

4.0 0.4 bitfields VS haversine

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

3.8 0.0 bitfields VS ksuid.cr

Crystal implementation of K-Sortable Globally Unique IDs
delimiter_tree

3.8 0.0 bitfields VS delimiter_tree

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

3.7 0.0 bitfields VS murmur3

Crystal implementation of Murmur3 hash algorithm used by Cassandra
edits.cr

3.5 6.0 bitfields VS edits.cr

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

3.1 0.0 bitfields VS ternary_search_tree

A Crystal implementation of a Ternary Search Tree
bisect

3.0 0.0 bitfields VS bisect

Library for maintaining sorted Arrays
splay_tree_map

2.7 5.7 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.
hash_ring

2.7 0.0 bitfields VS hash_ring

Implementation of Consistent Hash Ring for Crystal
miller_rabin

2.6 0.0 bitfields VS miller_rabin

Miller-Rabin algorithm for prime checking
ranger

2.1 0.0 bitfields VS ranger

Range object operation in Crystal
aho_corasick

2.1 0.0 bitfields VS aho_corasick

aho_corasick for crystal-lang
multiset.cr

1.9 5.4 bitfields VS multiset.cr

Multiset (bag) implementation in Crystal
s2_cells

1.9 0.8 bitfields VS s2_cells

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

1.7 0.0 bitfields VS heap.cr

data structure heap for crystal-lang
primes

1.5 0.0 bitfields VS primes

Library for testing primality and factoring integers in Crystal

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]

Contributing

Fork it (https://github.com/elorest/bitfields/fork)
Create your feature branch (git checkout -b my-new-feature)
Commit your changes (git commit -am 'Add some feature')
Push to the branch (git push origin my-new-feature)
Create a new Pull Request

Contributors

Isaac Sloan - creator and maintainer

bitfields

Bit Fields for Crystal Language