goban VS primes

Compare goban vs primes and see what are their differences.

primes

Library for testing primality and factoring integers in Crystal (by dkhofer)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
goban primes
1 -
23 2
- -
7.9 0.0
3 months ago over 7 years ago
Crystal Crystal
MIT License MIT License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

goban

Posts with mentions or reviews of goban. We have used some of these posts to build our list of alternatives and similar projects.

primes

Posts with mentions or reviews of primes. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning primes yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing goban and primes you can also consider the following projects:

radix - Radix Tree implementation for Crystal

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

csuuid.cr - This is a small UUID library that implements a chronologically sortable UUID.

murmur3 - Crystal implementation of Murmur3 hash algorithm used by Cassandra

multiset.cr - Multiset (bag) implementation in Crystal

crystalline - A collection of containers & algorithms for the Crystal programming language

CrOTP - CrOTP - One Time Passwords for Crystal

crystalg - Algorithm Library for Crystal

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

miller_rabin - Miller-Rabin algorithm for prime checking

splay_tree_map.cr - 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.