Wizium
reng
Wizium | reng | |
---|---|---|
1 | 1 | |
51 | 5 | |
- | - | |
2.3 | 3.6 | |
about 2 months ago | over 2 years ago | |
C++ | Java | |
GNU General Public License v3.0 only | - |
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.
Wizium
-
Creating crossword puzzle generator given a list of worlds as input?
Hello guys, im trying to create something like this: https://github.com/jsgonsette/Wizium OR THIS: https://github.com/jsgonsette/Wizium
reng
-
Let's Build a Regex Engine
So it be, I have also build a simplistic regex engine:
- http://blog.marcinchwedczuk.pl/matching-regexes-using-backtr...
- https://github.com/marcin-chwedczuk/reng/blob/master/src/pl/...
I was learning about continuations in LISP and how you can use them to get rid of the call stack and implement pseudo-concurrency. After reading some articles I realised that the same approach can be used to implement a backtracking regex engine in just few lines of code.
I was reading about LISP, but the code is in Java. Don't judge me.
What are some alternatives?
quackle - Quackle crossword game artificial intelligence and analysis tool
caniuse - Raw browser/feature support data from caniuse.com
blacksquare - A Python package for crossword creators.
zorex - Zorex: the omnipotent regex engine
BitsPlease-solutions - Solutions For Problems uploaded in
safe-regex-rs
exolve - Online interactive crossword software in JavaScript
regex - An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
AlgorithmsAndDataStructure - Algorithms And DataStructure Implemented In Python, Java & CPP, Give a Star 🌟If it helps you
Scala.js - Scala.js, the Scala to JavaScript compiler
SubsetSum-BacktrackAlgorithm - Solving the popular NP problem, The Subset Sum Problem, with an Amortized O(n) algorithm based on Recursive Backtracking. The Algorithm stood second fastest in the organized Intra-University competition.
re2 - modern regular expression syntax everywhere with a painless upgrade path [Moved to: https://github.com/SonOfLilit/kleenexp]