JSVerbalExpressions
ck
JSVerbalExpressions | ck | |
---|---|---|
4 | 7 | |
12,168 | 2,295 | |
0.1% | 0.4% | |
7.8 | 6.9 | |
6 days ago | 19 days ago | |
JavaScript | C | |
MIT License | GNU General Public License v3.0 or later |
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.
JSVerbalExpressions
-
A portable, modern regular expression language
I agree with you. I got tired of fighting with regex where I got to the point of simply not using it if at all possible.
A comment further up offered a very promising alternative.
https://github.com/VerbalExpressions/JSVerbalExpressions#tes...
It's a bit verbose, but I don't care anymore, I am too much a veteran to care about my code being sleek, I want it readable and workable.
-
Melody - A language that compiles to regular expressions and aims to be more easily readable and maintainable
There is also VerbalExpressions with a somewhat similar idea
-
Regular expressions vs Me
JSVerbalExpressions — construct regular expressions with natural language terms
-
Super-expressive – Write regex in natural language
https://github.com/VerbalExpressions/JSVerbalExpressions
ck
-
Falsehoods programmers believe about undefined behavior
Maybe I'm missing something, but x is not volatile and the compiler is free to assume that it is not modified concurrently outside the bounds of C's memory model. Compilers can and do hoist out loop invariants, and https://github.com/concurrencykit/ck/commit/b54ae5c4ace9b94442bbb46858449069f566d269 seems like an example of compilers doing what you say they don't. What am I missing?
- Concurrency Kit
-
A portable, license-free, lock-free data structure library written in C.
Recommend checking out http://concurrencykit.org instead.
-
Does a thread have a better chance of acquiring a mutex if it's just in time? Or if it's been in the queue? Neither?
If you're interested in how other approaches work, or how one achieves concurrency on shared mutable state without mutual exclusion, would recommend checking out concurrency kit.
-
Libdill: Structured Concurrency for C (2016)
There are plenty of practical solutions to the safe memory reclamation problem in C. The language just doesn't force one on you.
From epoch-based reclamation (https://github.com/concurrencykit/ck/blob/master/include/ck_..., especially with the multiplexing extension to Fraser's classic scheme), to quiescence schemes (https://liburcu.org/), or hazard pointers (https://github.com/facebook/folly/blob/master/folly/synchron..., or https://pvk.ca/Blog/2020/07/07/flatter-wait-free-hazard-poin...)... or even simple using a type-stable (https://www.usenix.org/legacy/publications/library/proceedin...) memory allocator.
In my experience, it's easier to write code that is resilient to hiccups in C than in Java. Solving SMR with GC only offers something close to lock-freedom when you can guarantee global GC pauses are short enough... and common techniques to bound pauses, like explicitly managed freelists land you back in the same problem space as C.
-
C Deep
ck - Concurrency primitives, safe memory reclamation mechanisms and non-blocking data structures. BSD-2-Clause
-
Super-expressive – Write regex in natural language
Indeed they do, https://github.com/concurrencykit/ck
What are some alternatives?
melody - Melody is a language that compiles to regular expressions and aims to be more readable and maintainable
libcds - A C++ library of Concurrent Data Structures
super-expressive - 🦜 Super Expressive is a zero-dependency JavaScript library for building regular expressions in (almost) natural language
libdill - Structured concurrency in C
logstash-patterns - Grok patterns for parsing and structuring log messages with logstash
moodycamel - A fast multi-producer, multi-consumer lock-free concurrent queue for C++11
ocaml-re - Pure OCaml regular expressions, with support for Perl and POSIX-style strings
Thrust - [ARCHIVED] The C++ parallel algorithms library. See https://github.com/NVIDIA/cccl
fluent-plugin-grok-parser - Fluentd's Grok parser
HPX - The C++ Standard Library for Parallelism and Concurrency
regex - Regex to parse translator
CUB - THIS REPOSITORY HAS MOVED TO github.com/nvidia/cub, WHICH IS AUTOMATICALLY MIRRORED HERE.