Transform simple string patterns to React components
User-friendly glob matching
Extends `minimatch.match()` with support for multiple patterns
Extended glob support for JavaScript. Adds (almost) the expressive power of regular expressions to glob patterns.
It's a very fast and efficient glob library for Node.js
Transform GLOB patterns to JavaScript regular expressions for fast file path matching.
ByteStream is a library making possible to manipulates single bytes and bits on pure JavaScript
No description provided.
Parse a glob pattern into an object of tokens.
the most correct and second fastest glob implementation in JavaScript
A drop-in replacement for new RegExp() with types
Matches strings against configurable strings, globs, regular expressions, and/or functions
a glob matcher in javascript
json-pointer utilities for querying and transforming data
vite-plugin-istanbul ==========================
Find the first file matching a given pattern in the current directory or the nearest ancestor directory.
Returns `true` if the given string looks like a glob pattern or an extglob pattern. This makes it easy to create code that only uses external modules like node-glob when necessary, resulting in much faster code execution and initialization time, and a bet
Taxbit Utilities
Info about node `exports` field support: version ranges, categories, etc.
Parse a .gitignore or .npmignore file into an array of patterns.
Core package of Faro.
An easy-to-use wildcard globbing library.
Match human-quality input to potential matches by edit distance.
Provides Vue 3 JSX & TSX support with HMR.
Makes it easier to match, split and extract strings in Rust without regular expressions. The parallel string-patterns crate provides extensions to work with regular expressions via the Regex library
Makes it easier to work with common string patterns and regular expressions in Rust, adding convenient regex match and replace methods (pattern_match and pattern_replace) to the standard String type as well to vectors of strings
This crate provides developer-friendly methods to manipulate strings with character indices.
Use wildcard placeholders to find string matches as well as using ! as a negative matcher
Excise is a Ruby port of extract-values
Easily generate strings supplying a very simple pattern. '10-20:Xn/x/'.generate #>qBstvc6JN8ra. Generate random strings using a regular expression (Regexp): /[a-z0-9]{2,5}w+/.gen . Also generate words in English or Spanish. Perfect to be used in test data factories. Also, validate if a text fulfills a specific pattern or even generate a string following a pattern and returning the wrong length, value... for testing your applications.
Replace complex regex patterns with simple, readable methods for string validation and manipulation
Makes complex patterns easier to read and write! Combine regexes, plain strings and powerful new primitive match functions! Makes capturing match results easy! Allows recursive patterns! Complete SNOBOL4 + SPITBOL extensions! Based on the well documented, proven SNOBOL4 language! Simple syntax looks great alongside ruby!
Barcode1D is a pure Ruby gem for handling many kinds of 1-dimensional barcodes. Implemented are Code 128, Code 3 of 9, Code 93, Code 11, Codabar, Interleaved 2 of 5, COOP 2 of 5, Matrix 2 of 5, Industrial 2 of 5, IATA 2 of 5, PostNet, Plessey, MSI (Modified Plessey), EAN-13, EAN-8, UPC-A, UPC-E, UPC Supplemental 2, and UPC Supplemental 5. Patterns are created in either a simple format of bars and spaces or as a run-length encoded string. This only generates and decodes the patterns; actual display or reading from a device must be implemented by the programmer.
Pegarus is, broadly, an implementation of LPEG on Rubinius. LPEG implements a Parsing Expression Grammar using a parsing machine rather than the Packrat algorithm. (See "A Text Pattern-Matching Tool based on Parsing Expression Grammars" by Roberto Ierusalimschy.) Pegarus actually implements an abstract syntax tree (AST) for the PEG. There are various options to execute the AST against a subject string. One option is a simple AST-walking evaluator. A second option is an implementation of the LPEG parsing machine. A third option is a compiler that targets Rubinius bytecode.
No description provided.
No description provided.