bitfields Alternatives - Crystal Algorithms and Data structures

Popularity

5.7

Growing

Activity

2.1

Declining

Stars 20

Watchers 1

Forks 4

Last Commit

Programming language: Crystal

Tags: Algorithms And Data Structures

Latest version: v0.31.1

bitfields alternatives and similar shards

Based on the "Algorithms and Data structures" category

crystalline

9.1 0.6 bitfields VS crystalline

A collection of containers and algorithms
radix

8.8 0.0 bitfields VS radix

Radix Tree implementation
CrOTP

7.5 4.2 bitfields VS CrOTP

HOTP and TOTP implementation for two factor authentication
crystaledge

6.2 1.6 bitfields VS crystaledge

A pure Vector Math library
crystalg

5.6 3.9 bitfields VS crystalg

A Generic Algorithm Library
text

4.9 0.0 bitfields VS text

A collection of phonetic algorithms
markov

4.7 0.2 bitfields VS markov

Build Markov Chains and run Markov Processes
fzy

4.6 6.3 bitfields VS fzy

A Crystal port of awesome Fzy project fuzzy finder algorithm
delimiter_tree

4.2 0.0 bitfields VS delimiter_tree

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

4.1 4.6 bitfields VS edits.cr

Collection of edit distance algorithms
murmur3

4.1 0.0 bitfields VS murmur3

Implementation of Murmur3 hash algorithm used by Cassandra
blurhash.cr

4.0 3.4 bitfields VS blurhash.cr

BlurHash implementation
crystal-linked-list

4.0 3.0 bitfields VS crystal-linked-list

Implementation of Linked List
graphlb

3.8 1.3 bitfields VS graphlb

Collection of graph datastructure and algorithms
kd_tree

3.7 2.5 bitfields VS kd_tree

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

3.6 4.2 bitfields VS haversine

An Implementation of the Haversine formula
ksuid.cr

3.4 3.4 bitfields VS ksuid.cr

K-Sortable Globally Unique IDs
ternary_search_tree

3.0 0.0 bitfields VS ternary_search_tree

Ternary Search Tree
miller_rabin

3.0 0.0 bitfields VS miller_rabin

Implements Miller-Rabin algorithm to check if a number is prime
bisect

2.8 1.7 bitfields VS bisect

Inserting values into a sorted array
hash_ring

2.5 0.0 bitfields VS hash_ring

An Implementation of Consistent Hash Ring
ranger

2.5 0.0 bitfields VS ranger

Range object operation library
crie

2.5 3.5 bitfields VS crie

Compile-time Trie
aho_corasick

2.5 0.0 bitfields VS aho_corasick

AhoCorasick algorithm
primes

1.8 0.0 bitfields VS primes

Library for testing if a number is prime and finding its prime factorization
heap.cr

1.8 0.0 bitfields VS heap.cr

Implementation of heap data structure
multiset.cr

1.2 3.1 bitfields VS multiset.cr

Implementation of a multiset

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

Pure Crystal implementation of BitFields. Handles encoding/decoding of bytes.