string packages

Escape RegExp special characters

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

Convert a dash/dot/underscore/space separated string to camelCase or PascalCase: `foo-bar` → `fooBar`

Indent each line in a string

Determine the East Asian Width of a Unicode character

Convert a camelized string into a lowercased one with a custom separator: unicornRainbow → unicorn_rainbow

A robust polyfill for the `CSS.escape` utility method as defined in CSSOM.

Functions for dealing with a PostgreSQL connection string

Parse and stringify URL query strings

Split a string on the first occurance of a given separator

Strip UTF-8 byte order mark (BOM) from a string

Modify strings, generate sourcemaps

Parse JSON with more helpful errors

Given some data, jsesc returns the shortest possible stringified & ASCII-safe representation of that data.

An error subclass for wrapping non-error values

Convert a string index to its line and column position

Math and string formula parser.

Parse String to Number based on configuration

Strip leading whitespace from each line in a string

Strip redundant indentation and indent the string

Matches strings against configurable strings, globs, regular expressions, and/or functions

Get the real length of a string - by correctly counting astral symbols and ignoring ansi escape codes

Efficient implementation of Levenshtein algorithm with locale-specific collator support.

Get the line and column number of a specific character in a string

Returns true if a string has an extglob.

Compare strings containing a mix of letters and numbers in the way a human being would in sort order.

prelude.ls is a functionally oriented utility library. It is powerful and flexible. Almost all of its functions are curried. It is written in, and is the recommended base library for, LiveScript.

Measure the difference between two strings using the Levenshtein distance algorithm

Get the visual width of a string - the number of columns required to display it

Fastest Levenshtein distance implementation in JS.