documentation
regex
documentation | regex | |
---|---|---|
14 | 91 | |
1,006 | 3,355 | |
0.6% | 1.4% | |
4.7 | 8.9 | |
2 months ago | 16 days ago | |
Rust | ||
GNU General Public License v3.0 or later | Apache License 2.0 |
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.
documentation
- Currying
-
How do product and record types work in your language?
The example from the PureScript documentation is:
-
PureScript in Production
Filippo: With Haskell knowledge, reading PureScript documentation was enough.
-
Anyone know what is wrong with my Vector3 Traversable instance?
See https://github.com/purescript/documentation/blob/master/errors/TypesDoNotUnify.md for more information, or to contribute content related to this error.
- [Help] Not able to import Math module. But able to find purescript-math module under bower_components
-
[Help] Basic argonaut-codecs example
[1 of 1] Compiling Main Error found: in module Main at src/Main.purs:40:35 - 40:39 (line 40, column 35 - line 40, column 39) Could not match type { age :: Maybe Int , name :: String , team :: Maybe String} with type Json while checking that type t0 is at least as general as type Json while checking that expression user has type Json in value declaration main where t0 is an unknown type See https://github.com/purescript/documentation/blob/master/errors/TypesDoNotUnify.md for more information, or to contribute content related to this error. [error] Failed to build.)
-
Kind system
I'm trying to get a better grasp on the type system of purescript. One thing I'm struggling to fully understand is how the so-called "kind system" works. The language reference is very brief about it.
-
Elegant fix to this broken intuition, wrt subtract/minus-sign operator syntax, in partial application of infix operators?
purescript uses (_ - 5) for that operator section, which i'm not a total fan of, but it's at least unambiguous; agda would write it as _- 5
-
Helix: a post-modern text editor
The one page you should add to the documentation is "differences from Vim".
For example, https://github.com/purescript/documentation/blob/master/lang... makes picking up PureScript as a Haskell programmer much easier than having to read all of the documentation and do the diff yourself.
-
Coming from Haskell... Starting pains. How do you load your source intro repl?
More info can be found here: https://github.com/purescript/documentation/blob/master/guides/Getting-Started.md
regex
-
Zed is now open source
The homepage has a benchmark that compares Zed's "insertion latency" to other editors, and this is the description:
> Open input.rs at the end of line 21 in rust-lang/regex. Type z 10 times, measure how long it takes for each z to display since hitting the z key.
Could someone clarify what that means? My interpretation of that was to go to https://github.com/rust-lang/regex/blob/master/regex-cli/arg... and start typing 'z' at the end of line 21, but that doesn't seem to make any sense. I guess that repo got refactored and those instructions are out of date?
-
CryptoFlow: Building a secure and scalable system with Axum and SvelteKit - Part 3
We also used the avenue to sluggify the question title. We used regex to fish out and replace all occurrences of punctuation and symbol characters with an empty string and using the itertools crate, we joined the words back together into a single string, where each word is separated by a hyphen ("-").
-
Command Line Rust is a great book
Command-Line Rust taught me how to use crates like clap, assert_cmd, and regex. I felt lost before because I didn't know about Rust's ecosystem--which is arguably as important as the language itself. Also, looking up and comparing libraries is a tiring task! blessed.rs is nice but Command-Line Rust really saved me from analysis paralysis.
-
Common Rust Lifetime Misconceptions
burntsushi actually regrets making regex replace return a Cow: https://github.com/rust-lang/regex/issues/676#issuecomment-6.... I’m glad it does, and wish it took an impl Into> there, for the reasons discussed in the issue, but burntsushi has a lot more experience of the practical outcomes of this. Just something more to think about.
-
Advent of Code 2023 is nigh
I'm not familiar with the AoC problem. You might be able to. But RegexSet doesn't give you match offsets.
You can drop down to regex-automata, which does let you do multi-regex search and it will tell you which patterns match[1]. The docs have an example of a simple lexer[2]. But... that will only give you non-overlapping matches.
You can drop down to an even lower level of abstraction and get multi-pattern overlapping matches[3], but it's awkward. The comment there explains that I had initially tried to provide a higher level API for it, but was unsure of what the semantics should be. Getting the starting position in particular is a bit of a wrinkle.
[1]: https://docs.rs/regex-automata/latest/regex_automata/meta/in...
[2]: https://docs.rs/regex-automata/latest/regex_automata/meta/st...
[3]: https://github.com/rust-lang/regex/blob/837fd85e79fac2a4ea64...
-
Text Showdown: Gap Buffers vs. Ropes
It’s not quite that simple, but folks are working on it.
https://github.com/rust-lang/regex/issues/425#issuecomment-1...
https://github.com/helix-editor/helix/pull/211#issuecomment-...
- Please ask questions (rust-lang/regex)
-
ScripterC - Rust-lang set
Dependencies used: - regex - unicode_reader - rust decimal - tokio
-
Regex Engine Internals as a Library
https://www.cs.princeton.edu/courses/archive/fall19/cos226/l... and https://kean.blog/post/lets-build-regex are excellent introductions to implementing a (very) simplified regex engine: construct a nondetermistic finite state automaton for the regex, then perform a graph search on the resulting digraph; if the vertex corresponding to your end state is reachable, you have a match.
I think this exercise is valuable for anyone writing regexes to not only understand that there's less magic than one might think, but also to visualize a bunch of balls bouncing along an NFA - that bug you inevitably hit in production due to catastrophic backtracking now takes on a physical meaning!
Separately re: the OP, https://github.com/rust-lang/regex/issues/822 (and specifically BurntSushi's comment at the very end of the issue) adds really useful context to the paragraph in the OP about niche APIs: https://blog.burntsushi.net/regex-internals/#problem-request... - searching with multiple regexes simultaneously against a text is both incredibly complex and incredibly useful, and I can't wait to see what the community comes up with for this pattern!
What are some alternatives?
helix - A post-modern modal text editor.
re2 - modern regular expression syntax everywhere with a painless upgrade path [Moved to: https://github.com/SonOfLilit/kleenexp]
package-sets - PureScript packages for Spago and Psc-Package
node-re2 - node.js bindings for RE2: fast, safe alternative to backtracking regular expression engines.
haddock-cheatsheet - A documentation-only package exemplifying haddock markup features
zig - General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.
saka-key - A keyboard interface to the web
ngrams - (Read-only) Generate n-grams
LunarVim - 🌙 LunarVim is an IDE layer for Neovim. Completely free and community driven.
regex-benchmark - It's just a simple regex benchmark of different programming languages.
kakoune - mawww's experiment for a better code editor
whatlang-rs - Natural language detection library for Rust. Try demo online: https://whatlang.org/