aho_corasick Alternatives - Crystal Algorithms and Data structures

Popularity

2.4

Declining

Activity

0.0

Stable

Stars 5

Watchers 1

Forks 1

Last Commit over 4 years ago

Programming language: Crystal

License: MIT License

Tags: Algorithms And Data Structures

aho_corasick alternatives and similar shards

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

crystalline

9.2 0.0 aho_corasick VS crystalline

A collection of containers and algorithms
radix

8.6 0.0 aho_corasick VS radix

Radix Tree implementation
CrOTP

7.7 0.0 aho_corasick VS CrOTP

HOTP and TOTP implementation for two factor authentication

Get performance insights in less than 4 minutes.

Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.

Promoted scoutapm.com

crystalg

6.6 6.4 aho_corasick VS crystalg

A Generic Algorithm Library
crystaledge

6.0 0.1 aho_corasick VS crystaledge

A pure Vector Math library
bitfields

5.8 1.5 aho_corasick VS bitfields

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

5.5 0.0 aho_corasick VS graphlb

Collection of graph datastructure and algorithms
fzy

5.4 3.1 aho_corasick VS fzy

A Crystal port of awesome Fzy project fuzzy finder algorithm
markov

4.9 0.0 aho_corasick VS markov

Build Markov Chains and run Markov Processes
text

4.7 0.0 aho_corasick VS text

A collection of phonetic algorithms
crystal-linked-list

4.6 0.4 aho_corasick VS crystal-linked-list

Implementation of Linked List
blurhash.cr

4.6 2.7 aho_corasick VS blurhash.cr

BlurHash implementation
delimiter_tree

4.1 0.0 aho_corasick VS delimiter_tree

A tree structure that is built using a delimiter
haversine

3.8 2.3 aho_corasick VS haversine

An Implementation of the Haversine formula
kd_tree

3.8 3.1 aho_corasick VS kd_tree

An implementation of "K-Dimensional Tree" and "N-Nearest Neighbors"
edits.cr

3.7 2.6 aho_corasick VS edits.cr

Collection of edit distance algorithms
ternary_search_tree

3.4 0.0 aho_corasick VS ternary_search_tree

Ternary Search Tree
murmur3

3.4 0.0 aho_corasick VS murmur3

Implementation of Murmur3 hash algorithm used by Cassandra
qr-code

3.2 3.3 aho_corasick VS qr-code

QR Code generator
ksuid.cr

3.2 1.9 aho_corasick VS ksuid.cr

K-Sortable Globally Unique IDs
bisect

2.9 0.0 aho_corasick VS bisect

Inserting values into a sorted array
hash_ring

2.6 0.0 aho_corasick VS hash_ring

An Implementation of Consistent Hash Ring
crie

2.4 0.0 aho_corasick VS crie

Compile-time Trie
miller_rabin

2.4 0.0 aho_corasick VS miller_rabin

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

2.4 0.0 aho_corasick VS ranger

Range object operation library
heap.cr

2.0 0.0 aho_corasick VS heap.cr

Implementation of heap data structure
primes

1.6 0.0 aho_corasick VS primes

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

1.6 0.9 aho_corasick VS multiset.cr

Implementation of a multiset

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

Add another 'Algorithms and Data structures' Shard

Popular Comparisons

README

aho_corasick

AhoCorasick algorithm for crystal-lang

Installation

Add this to your application's shard.yml:

dependencies:
  aho_corasick:
    github: chenkovsky/aho_corasick

Usage

require "aho_corasick"
matcher = AhoCorasick.new %w(a ab bc)
matched = [] of Tuple(Int32, Int32)
matcher.match("abcde") do |last_pos, pat_idx|
  matched << ({last_pos, pat_idx})
end
matched.should eq([{0, 0}, {1, 1}, {2, 2}])

Contributing

Fork it ( https://github.com/chenkovsky/aho_corasick/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

chenkovsky chenkovsky - creator, maintainer