rregex 1.11.0 → 1.13.0

package/lib/standalone.d.ts

@@ -61,54 +61,6 @@ declare namespace wasm_bindgen {
 	  value: string
 	}
 	
-	/**
-	 * Represents the capture groups for a single match.
-	 *
-	 * Capture groups refer to parts of a regex enclosed in parentheses. They can
-	 * be optionally named. The purpose of capture groups is to be able to
-	 * reference different parts of a match based on the original pattern. For
-	 * example, say you want to match the individual letters in a 5-letter word:
-	 *
-	 * ```text
-	 * (?<first>\w)(\w)(?:\w)\w(?<last>\w)
-	 * ```
-	 *
-	 * This regex has 4 capture groups:
-	 *
-	 * * The group at index `0` corresponds to the overall match. It is always
-	 * present in every match and never has a name.
-	 * * The group at index `1` with name `first` corresponding to the first
-	 * letter.
-	 * * The group at index `2` with no name corresponding to the second letter.
-	 * * The group at index `3` with name `last` corresponding to the fifth and
-	 * last letter.
-	 *
-	 * Notice that `(?:\w)` was not listed above as a capture group despite it
-	 * being enclosed in parentheses. That's because `(?:pattern)` is a special
-	 * syntax that permits grouping but *without* capturing. The reason for not
-	 * treating it as a capture is that tracking and reporting capture groups
-	 * requires additional state that may lead to slower searches. So using as few
-	 * capture groups as possible can help performance. (Although the difference
-	 * in performance of a couple of capture groups is likely immaterial.)
-	 *
-	 * # Example
-	 *
-	 * ```typescript
-	 * import { RRegex } from "rregex"
-	 *
-	 * const re = new RRegex("(?<first>\\w)(\\w)(?:\\w)\\w(?<last>\\w)");
-	 * const caps = re.captures("toady");
-	 * expect(caps.get[0].value).toBe("toady");
-	 * expect(caps.name["first"].value).toBe("t");
-	 * expect(caps.get[2].value).toBe("o");
-	 * expect(caps.name["last"].value).toBe("y");
-	 * ```
-	 */
-	export type Captures = {
-	  get: Match[]
-	  name: Record<string, Match>
-	}
-	
 	/**
 	 * A high-level intermediate representation (HIR) for a regular expression.
 	 */
@@ -634,6 +586,54 @@ declare namespace wasm_bindgen {
 	  sub: Hir
 	}
 	
+	/**
+	 * Represents the capture groups for a single match.
+	 *
+	 * Capture groups refer to parts of a regex enclosed in parentheses. They can
+	 * be optionally named. The purpose of capture groups is to be able to
+	 * reference different parts of a match based on the original pattern. For
+	 * example, say you want to match the individual letters in a 5-letter word:
+	 *
+	 * ```text
+	 * (?<first>\w)(\w)(?:\w)\w(?<last>\w)
+	 * ```
+	 *
+	 * This regex has 4 capture groups:
+	 *
+	 * * The group at index `0` corresponds to the overall match. It is always
+	 * present in every match and never has a name.
+	 * * The group at index `1` with name `first` corresponding to the first
+	 * letter.
+	 * * The group at index `2` with no name corresponding to the second letter.
+	 * * The group at index `3` with name `last` corresponding to the fifth and
+	 * last letter.
+	 *
+	 * Notice that `(?:\w)` was not listed above as a capture group despite it
+	 * being enclosed in parentheses. That's because `(?:pattern)` is a special
+	 * syntax that permits grouping but *without* capturing. The reason for not
+	 * treating it as a capture is that tracking and reporting capture groups
+	 * requires additional state that may lead to slower searches. So using as few
+	 * capture groups as possible can help performance. (Although the difference
+	 * in performance of a couple of capture groups is likely immaterial.)
+	 *
+	 * # Example
+	 *
+	 * ```typescript
+	 * import { RRegex } from "rregex"
+	 *
+	 * const re = new RRegex("(?<first>\\w)(\\w)(?:\\w)\\w(?<last>\\w)");
+	 * const caps = re.captures("toady");
+	 * expect(caps.get[0].value).toBe("toady");
+	 * expect(caps.name["first"].value).toBe("t");
+	 * expect(caps.get[2].value).toBe("o");
+	 * expect(caps.name["last"].value).toBe("y");
+	 * ```
+	 */
+	export type Captures = {
+	  get: Match[]
+	  name: Record<string, Match>
+	}
+	
 	/**
 	 * The high-level intermediate representation for a capturing group.
 	 *
@@ -701,38 +701,6 @@ declare namespace wasm_bindgen {
 	 */
 	export class RRegex {
 	  free(): void;
-	  /**
-	   * Compiles a regular expression. Once compiled, it can be used repeatedly
-	   * to search, split or replace text in a string.
-	   *
-	   * If an invalid expression is given, then an error is returned.
-	   */
-	  constructor(re: string);
-	  /**
-	   * Returns true if and only if there is a match for the regex in the
-	   * string given.
-	   *
-	   * It is recommended to use this method if all you need to do is test
-	   * a match, since the underlying matching engine may be able to do less
-	   * work.
-	   *
-	   * # Example
-	   *
-	   * Test if some text contains at least one word with exactly 13
-	   * Unicode word characters:
-	   *
-	   * ```typescript
-	   * import { RRegex } from "rregex"
-	   *
-	   * const text = "I categorically deny having triskaidekaphobia."
-	   * expect(new RRegex("\\b\\w{13}\\b").is_match(text)).toBe(true)
-	   * ```
-	   *
-	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.is_match
-	   * @param {string} text - The string against which to match the regular expression
-	   * @return {boolean}
-	   */
-	  isMatch(text: string): boolean;
 	  /**
 	   * Returns the same as is_match, but starts the search at the given offset.
 	   * The significance of the starting point is that it takes the surrounding
@@ -746,121 +714,20 @@ declare namespace wasm_bindgen {
 	   */
 	  isMatchAt(text: string, start: number): boolean;
 	  /**
-	   * Returns the start and end byte range of the leftmost-first match in
-	   * `text`. If no match exists, then `undefined` is returned.
-	   *
-	   * Note that this should only be used if you want to discover the position
-	   * of the match. Testing the existence of a match is faster if you use
-	   * `isMatch`.
-	   *
-	   * # Example
-	   *
-	   * Find the start and end location of the first word with exactly 13
-	   * Unicode word characters:
-	   *
-	   * ```typescript
-	   * import { RRegex } from "rregex"
-	   *
-	   * const text = "I categorically deny having triskaidekaphobia."
-	   * const m = new RRegex("\\b\\w{13}\\b").find(text)
-	   * expect(m.start).toBe(2)
-	   * expect(m.end).toBe(15)
-	   * ```
-	   *
-	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.find
-	   * @param {string} text - The string against which to match the regular expression
-	   * @return {Match}
-	   */
-	  find(text: string): Match | undefined;
-	  /**
-	   * Returns the same as find, but starts the search at the given
-	   * offset.
-	   *
-	   * The significance of the starting point is that it takes the surrounding
-	   * context into consideration. For example, the `\A` anchor can only
-	   * match when `start == 0`.
-	   *
-	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.find_at
-	   * @param {string} text - The string against which to match the regular expression
-	   * @param {number} start - Zero-based index at which to start matching
-	   * @returns {Match}
-	   */
-	  findAt(text: string, start: number): Match | undefined;
-	  /**
-	   * Returns an array for each successive non-overlapping match in `text``,
-	   * returning the start and end byte indices with respect to `text`.
-	   *
-	   * # Example
-	   *
-	   * Find the start and end location of every word with exactly 13 Unicode
-	   * word characters:
-	   *
-	   * ```typescript
-	   * import { RRegex } from "rregex"
-	   *
-	   * const text = "Retroactively relinquishing remunerations is reprehensible."
-	   * const matches = new RRegex("\\b\\w{13}\\b").findAll(text)
-	   * ```
-	   *
-	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.find_iter
-	   * @param {string} text - The string against which to match the regular expression
-	   * @returns {Match}
-	   */
-	  findAll(text: string): Match[];
-	  /**
-	   * Returns a list of the capture names in this regex.
-	   *
-	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.capture_names
-	   */
-	  captureNames(): (string | null)[];
-	  /**
-	   * Returns the capture groups corresponding to the leftmost-first
-	   * match in `text`. Capture group `0` always corresponds to the entire
-	   * match. If no match is found, then `undefined` is returned.
-	   *
-	   * You should only use `captures` if you need access to the location of
-	   * capturing group matches. Otherwise, `find` is faster for discovering
-	   * the location of the overall match.
-	   *
-	   * # Examples
-	   *
-	   * Say you have some text with movie names and their release years,
-	   * like "'Citizen Kane' (1941)". It'd be nice if we could search for text
-	   * looking like that, while also extracting the movie name and its release
-	   * year separately.
-	   *
-	   * ```typescript
-	   * import { RRegex } from "rregex"
-	   *
-	   * const re = new RRegex("'([^']+)'\\s+\\((\\d{4})\)")
-	   * const text = "Not my favorite movie: 'Citizen Kane' (1941)."
-	   * const caps = re.captures(text)
-	   * expect(caps.get[1].value).toBe("Citizen Kane")
-	   * expect(caps.get[2].value).toBe("1941")
-	   * expect(caps.get[0].value).toBe("'Citizen Kane' (1941)")
-	   * ```
-	   *
-	   * Note that the full match is at capture group `0`. Each subsequent
-	   * capture group is indexed by the order of its opening `(`.
-	   *
-	   * We can make this example a bit clearer by using *named* capture groups:
-	   *
-	   * ```typescript
-	   * import { RRegex } from "rregex"
+	   * Replaces all non-overlapping matches in `text` with the replacement
+	   * provided. This is the same as calling `replacen` with `limit` set to
+	   * `0`.
 	   *
-	   * const re = new RRegex("'(?P<title>[^']+)'\\s+\\((?P<year>\\d{4})\)")
-	   * const text = "Not my favorite movie: 'Citizen Kane' (1941)."
-	   * const caps = re.captures(text)
-	   * expect(caps.name["title"].value).toBe("Citizen Kane")
-	   * expect(caps.name["year"].value).toBe("1941")
-	   * expect(caps.get[0].value).toBe("'Citizen Kane' (1941)")
-	   * ```
+	   * See the documentation for `replace` for details on how to access
+	   * capturing group matches in the replacement string.
 	   *
-	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.captures
+	   * See the documentation for `replace` for details on how to access capturing group matches in the replacement string.
+	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.replace_all
 	   * @param {string} text - The string against which to match the regular expression
-	   * @returns {Captures|undefined}
+	   * @param {string} rep - It's a string, it will replace the substring matched by `pattern`.
+	   * @returns {string}
 	   */
-	  captures(text: string): Captures | undefined;
+	  replaceAll(text: string, rep: string): string;
 	  /**
 	   * Returns a list with all the non-overlapping capture groups matched
 	   * in `text`. This is operationally the same as `findAll`, except it
@@ -927,12 +794,168 @@ declare namespace wasm_bindgen {
 	   */
 	  capturesLength(): number;
 	  /**
-	   * Replaces the leftmost-first match with the replacement provided.
-	   * The replacement can be a regular string (where `$N` and `$name` are
-	   * expanded to match capture groups) or a function that takes the matches'
-	   * `Captures` and returns the replaced string.
-	   *
-	   * If no match is found, then a copy of the string is returned unchanged.
+	   * Returns a list of the capture names in this regex.
+	   *
+	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.capture_names
+	   */
+	  captureNames(): (string | null)[];
+	  /**
+	   * Returns the end location of a match in the text given.
+	   *
+	   * This method may have the same performance characteristics as
+	   * `isMatch`, except it provides an end location for a match. In
+	   * particular, the location returned *may be shorter* than the proper end
+	   * of the leftmost-first match that you would find via `Regex.find`.
+	   *
+	   * Note that it is not guaranteed that this routine finds the shortest or
+	   * "earliest" possible match. Instead, the main idea of this API is that
+	   * it returns the offset at the point at which the internal regex engine
+	   * has determined that a match has occurred. This may vary depending on
+	   * which internal regex engine is used, and thus, the offset itself may
+	   * change.
+	   *
+	   * # Example
+	   *
+	   * Typically, `a+` would match the entire first sequence of `a` in some
+	   * text, but `shortest_match` can give up as soon as it sees the first
+	   * `a`.
+	   *
+	   * ```typescript
+	   * import { RRegex } from "rregex"
+	   *
+	   * const text = "aaaaa"
+	   * const = new RRegex("a+").shortest_match(text)
+	   * expect(pos).toBe(1)
+	   * ```
+	   *
+	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.shortest_match
+	   * @param {string} text - The string against which to match the regular expression
+	   * @returns {number|undefined}
+	   */
+	  shortestMatch(text: string): number | undefined;
+	  /**
+	   * Returns the same as `shortest_match`, but starts the search at the
+	   * given offset.
+	   *
+	   * The significance of the starting point is that it takes the surrounding
+	   * context into consideration. For example, the `\A` anchor can only match
+	   * when `start == 0`.
+	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.shortest_match_at
+	   * @param {string} text - The string against which to match the regular expression
+	   * @param {number} start - Zero-based index at which to start matching
+	   * @returns {number|undefined}
+	   */
+	  shortestMatchAt(text: string, start: number): number | undefined;
+	  /**
+	   * Compiles a regular expression. Once compiled, it can be used repeatedly
+	   * to search, split or replace text in a string.
+	   *
+	   * If an invalid expression is given, then an error is returned.
+	   */
+	  constructor(re: string);
+	  /**
+	   * Returns the start and end byte range of the leftmost-first match in
+	   * `text`. If no match exists, then `undefined` is returned.
+	   *
+	   * Note that this should only be used if you want to discover the position
+	   * of the match. Testing the existence of a match is faster if you use
+	   * `isMatch`.
+	   *
+	   * # Example
+	   *
+	   * Find the start and end location of the first word with exactly 13
+	   * Unicode word characters:
+	   *
+	   * ```typescript
+	   * import { RRegex } from "rregex"
+	   *
+	   * const text = "I categorically deny having triskaidekaphobia."
+	   * const m = new RRegex("\\b\\w{13}\\b").find(text)
+	   * expect(m.start).toBe(2)
+	   * expect(m.end).toBe(15)
+	   * ```
+	   *
+	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.find
+	   * @param {string} text - The string against which to match the regular expression
+	   * @return {Match}
+	   */
+	  find(text: string): Match | undefined;
+	  /**
+	   * Returns an iterator of substrings of `text` delimited by a match of the
+	   * regular expression. Namely, each element of the iterator corresponds to
+	   * text that *isn't* matched by the regular expression.
+	   *
+	   * This method will *not* copy the text given.
+	   *
+	   * # Example
+	   *
+	   * To split a string delimited by arbitrary amounts of spaces or tabs:
+	   *
+	   * ```typescript
+	   * import { RRegex } from "rregex"
+	   *
+	   * const re = new RRegex(r"[ \\t]+")
+	   * const fields = re.split("a b \t  c\td    e")
+	   * expect(fields).toEqual(["a", "b", "c", "d", "e"])
+	   * ```
+	   *
+	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.split
+	   * @param {string} text - The string against which to match the regular expression
+	   * @returns {string[]}
+	   */
+	  split(text: string): string[];
+	  /**
+	   * Returns an iterator of at most `limit` substrings of `text` delimited
+	   * by a match of the regular expression. (A `limit` of `0` will return no
+	   * substrings.) Namely, each element of the iterator corresponds to text
+	   * that *isn't* matched by the regular expression. The remainder of the
+	   * string that is not split will be the last element in the iterator.
+	   *
+	   * This method will *not* copy the text given.
+	   *
+	   * # Example
+	   *
+	   * Get the first two words in some text:
+	   *
+	   * ```typescript
+	   * import { RRegex } from "rregex"
+	   *
+	   * const re = new RRegex(r"\\W+")
+	   * const fields = re.splitn("Hey! How are you?", 3)
+	   * expect(fields).toEqual(["Hey", "How", "are you?"])
+	   * ```
+	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.splitn
+	   * @param {string} text - The string against which to match the regular expression
+	   * @param {number} limit - Max number result elements
+	   * @returns {string[]}
+	   */
+	  splitn(text: string, limit: number): string[];
+	  /**
+	   * Returns the regular expression into a high level intermediate
+	   * representation.
+	   */
+	  syntax(): Hir;
+	  /**
+	   * Returns the same as find, but starts the search at the given
+	   * offset.
+	   *
+	   * The significance of the starting point is that it takes the surrounding
+	   * context into consideration. For example, the `\A` anchor can only
+	   * match when `start == 0`.
+	   *
+	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.find_at
+	   * @param {string} text - The string against which to match the regular expression
+	   * @param {number} start - Zero-based index at which to start matching
+	   * @returns {Match}
+	   */
+	  findAt(text: string, start: number): Match | undefined;
+	  /**
+	   * Replaces the leftmost-first match with the replacement provided.
+	   * The replacement can be a regular string (where `$N` and `$name` are
+	   * expanded to match capture groups) or a function that takes the matches'
+	   * `Captures` and returns the replaced string.
+	   *
+	   * If no match is found, then a copy of the string is returned unchanged.
 	   *
 	   * # Replacement string syntax
 	   *
@@ -1003,137 +1026,114 @@ declare namespace wasm_bindgen {
 	   */
 	  replace(text: string, rep: string): string;
 	  /**
-	   * Replaces at most `limit` non-overlapping matches in `text` with the
-	   * replacement provided. If `limit` is 0, then all non-overlapping matches
-	   * are replaced.
+	   * Returns the capture groups corresponding to the leftmost-first
+	   * match in `text`. Capture group `0` always corresponds to the entire
+	   * match. If no match is found, then `undefined` is returned.
 	   *
-	   * See the documentation for `replace` for details on how to access
-	   * capturing group matches in the replacement string.
+	   * You should only use `captures` if you need access to the location of
+	   * capturing group matches. Otherwise, `find` is faster for discovering
+	   * the location of the overall match.
 	   *
-	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.replacen
-	   * @param {string} text - The string against which to match the regular expression
-	   * @param {number} limit - Max number of replacement
-	   * @param {string} rep - It's a string, it will replace the substring matched by `pattern`.
-	   * @returns {string}
-	   */
-	  replacen(text: string, limit: number, rep: string): string;
-	  /**
-	   * Replaces all non-overlapping matches in `text` with the replacement
-	   * provided. This is the same as calling `replacen` with `limit` set to
-	   * `0`.
+	   * # Examples
 	   *
-	   * See the documentation for `replace` for details on how to access
-	   * capturing group matches in the replacement string.
+	   * Say you have some text with movie names and their release years,
+	   * like "'Citizen Kane' (1941)". It'd be nice if we could search for text
+	   * looking like that, while also extracting the movie name and its release
+	   * year separately.
 	   *
-	   * See the documentation for `replace` for details on how to access capturing group matches in the replacement string.
-	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.replace_all
-	   * @param {string} text - The string against which to match the regular expression
-	   * @param {string} rep - It's a string, it will replace the substring matched by `pattern`.
-	   * @returns {string}
-	   */
-	  replaceAll(text: string, rep: string): string;
-	  /**
-	   * Returns an iterator of substrings of `text` delimited by a match of the
-	   * regular expression. Namely, each element of the iterator corresponds to
-	   * text that *isn't* matched by the regular expression.
+	   * ```typescript
+	   * import { RRegex } from "rregex"
 	   *
-	   * This method will *not* copy the text given.
+	   * const re = new RRegex("'([^']+)'\\s+\\((\\d{4})\)")
+	   * const text = "Not my favorite movie: 'Citizen Kane' (1941)."
+	   * const caps = re.captures(text)
+	   * expect(caps.get[1].value).toBe("Citizen Kane")
+	   * expect(caps.get[2].value).toBe("1941")
+	   * expect(caps.get[0].value).toBe("'Citizen Kane' (1941)")
+	   * ```
 	   *
-	   * # Example
+	   * Note that the full match is at capture group `0`. Each subsequent
+	   * capture group is indexed by the order of its opening `(`.
 	   *
-	   * To split a string delimited by arbitrary amounts of spaces or tabs:
+	   * We can make this example a bit clearer by using *named* capture groups:
 	   *
 	   * ```typescript
 	   * import { RRegex } from "rregex"
 	   *
-	   * const re = new RRegex(r"[ \\t]+")
-	   * const fields = re.split("a b \t  c\td    e")
-	   * expect(fields).toEqual(["a", "b", "c", "d", "e"])
+	   * const re = new RRegex("'(?P<title>[^']+)'\\s+\\((?P<year>\\d{4})\)")
+	   * const text = "Not my favorite movie: 'Citizen Kane' (1941)."
+	   * const caps = re.captures(text)
+	   * expect(caps.name["title"].value).toBe("Citizen Kane")
+	   * expect(caps.name["year"].value).toBe("1941")
+	   * expect(caps.get[0].value).toBe("'Citizen Kane' (1941)")
 	   * ```
 	   *
-	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.split
+	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.captures
 	   * @param {string} text - The string against which to match the regular expression
-	   * @returns {string[]}
+	   * @returns {Captures|undefined}
 	   */
-	  split(text: string): (string)[];
+	  captures(text: string): Captures | undefined;
 	  /**
-	   * Returns an iterator of at most `limit` substrings of `text` delimited
-	   * by a match of the regular expression. (A `limit` of `0` will return no
-	   * substrings.) Namely, each element of the iterator corresponds to text
-	   * that *isn't* matched by the regular expression. The remainder of the
-	   * string that is not split will be the last element in the iterator.
-	   *
-	   * This method will *not* copy the text given.
+	   * Returns an array for each successive non-overlapping match in `text``,
+	   * returning the start and end byte indices with respect to `text`.
 	   *
 	   * # Example
 	   *
-	   * Get the first two words in some text:
+	   * Find the start and end location of every word with exactly 13 Unicode
+	   * word characters:
 	   *
 	   * ```typescript
 	   * import { RRegex } from "rregex"
 	   *
-	   * const re = new RRegex(r"\\W+")
-	   * const fields = re.splitn("Hey! How are you?", 3)
-	   * expect(fields).toEqual(["Hey", "How", "are you?"])
+	   * const text = "Retroactively relinquishing remunerations is reprehensible."
+	   * const matches = new RRegex("\\b\\w{13}\\b").findAll(text)
 	   * ```
-	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.splitn
+	   *
+	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.find_iter
 	   * @param {string} text - The string against which to match the regular expression
-	   * @param {number} limit - Max number result elements
-	   * @returns {string[]}
+	   * @returns {Match}
 	   */
-	  splitn(text: string, limit: number): (string)[];
+	  findAll(text: string): Match[];
 	  /**
-	   * Returns the end location of a match in the text given.
-	   *
-	   * This method may have the same performance characteristics as
-	   * `isMatch`, except it provides an end location for a match. In
-	   * particular, the location returned *may be shorter* than the proper end
-	   * of the leftmost-first match that you would find via `Regex.find`.
+	   * Returns true if and only if there is a match for the regex in the
+	   * string given.
 	   *
-	   * Note that it is not guaranteed that this routine finds the shortest or
-	   * "earliest" possible match. Instead, the main idea of this API is that
-	   * it returns the offset at the point at which the internal regex engine
-	   * has determined that a match has occurred. This may vary depending on
-	   * which internal regex engine is used, and thus, the offset itself may
-	   * change.
+	   * It is recommended to use this method if all you need to do is test
+	   * a match, since the underlying matching engine may be able to do less
+	   * work.
 	   *
 	   * # Example
 	   *
-	   * Typically, `a+` would match the entire first sequence of `a` in some
-	   * text, but `shortest_match` can give up as soon as it sees the first
-	   * `a`.
+	   * Test if some text contains at least one word with exactly 13
+	   * Unicode word characters:
 	   *
 	   * ```typescript
 	   * import { RRegex } from "rregex"
 	   *
-	   * const text = "aaaaa"
-	   * const = new RRegex("a+").shortest_match(text)
-	   * expect(pos).toBe(1)
+	   * const text = "I categorically deny having triskaidekaphobia."
+	   * expect(new RRegex("\\b\\w{13}\\b").is_match(text)).toBe(true)
 	   * ```
 	   *
-	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.shortest_match
+	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.is_match
 	   * @param {string} text - The string against which to match the regular expression
-	   * @returns {number|undefined}
+	   * @return {boolean}
 	   */
-	  shortestMatch(text: string): number | undefined;
+	  isMatch(text: string): boolean;
 	  /**
-	   * Returns the same as `shortest_match`, but starts the search at the
-	   * given offset.
+	   * Replaces at most `limit` non-overlapping matches in `text` with the
+	   * replacement provided. If `limit` is 0, then all non-overlapping matches
+	   * are replaced.
 	   *
-	   * The significance of the starting point is that it takes the surrounding
-	   * context into consideration. For example, the `\A` anchor can only match
-	   * when `start == 0`.
-	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.shortest_match_at
+	   * See the documentation for `replace` for details on how to access
+	   * capturing group matches in the replacement string.
+	   *
+	   * @see https://docs.rs/regex/latest/regex/struct.Regex.html#method.replacen
 	   * @param {string} text - The string against which to match the regular expression
-	   * @param {number} start - Zero-based index at which to start matching
-	   * @returns {number|undefined}
-	   */
-	  shortestMatchAt(text: string, start: number): number | undefined;
-	  /**
-	   * Returns the regular expression into a high level intermediate
-	   * representation.
+	   * @param {number} limit - Max number of replacement
+	   * @param {string} rep - It's a string, it will replace the substring matched by `pattern`.
+	   * @returns {string}
 	   */
-	  syntax(): Hir;
+	  replacen(text: string, limit: number, rep: string): string;
 	  /**
 	   * Returns a string representing the regular expression
 	   */
@@ -1171,38 +1171,6 @@ declare namespace wasm_bindgen {
 	   * ```
 	   */
 	  constructor(list: Array<any>);
-	  /**
-	   * Returns true if and only if one of the regexes in this set matches
-	   * the text given.
-	   *
-	   * This method should be preferred if you only need to test whether any
-	   * of the regexes in the set should match, but don't care about *which*
-	   * regexes matched. This is because the underlying matching engine will
-	   * quit immediately after seeing the first match instead of continuing to
-	   * find all matches.
-	   *
-	   * Note that as with searches using `Regex`, the expression is unanchored
-	   * by default. That is, if the regex does not start with `^` or `\A`, or
-	   * end with `$` or `\z`, then it is permitted to match anywhere in the
-	   * text.
-	   *
-	   * # Example
-	   *
-	   * Tests whether a set matches some text:
-	   *
-	   * ```typescript
-	   * import { RegexSet } from "rregex"
-	   *
-	   * const set = new RegexSet(["\\w+", "\\d+"])
-	   * expect(set.is_match("foo")).toBe(true)
-	   * expect(!set.is_match("☃")).toBe(false)
-	   * ```
-	   *
-	   * @see https://docs.rs/regex/latest/regex/struct.RegexSet.html#method.is_match
-	   * @param {string} text - The string against which to match the regular expression
-	   * @return {boolean}
-	   */
-	  isMatch(text: string): boolean;
 	  /**
 	   * Returns the set of regular expressions that match in the given text.
 	   *
@@ -1242,6 +1210,38 @@ declare namespace wasm_bindgen {
 	   * @return {number[]}
 	   */
 	  matches(text: string): number[];
+	  /**
+	   * Returns true if and only if one of the regexes in this set matches
+	   * the text given.
+	   *
+	   * This method should be preferred if you only need to test whether any
+	   * of the regexes in the set should match, but don't care about *which*
+	   * regexes matched. This is because the underlying matching engine will
+	   * quit immediately after seeing the first match instead of continuing to
+	   * find all matches.
+	   *
+	   * Note that as with searches using `Regex`, the expression is unanchored
+	   * by default. That is, if the regex does not start with `^` or `\A`, or
+	   * end with `$` or `\z`, then it is permitted to match anywhere in the
+	   * text.
+	   *
+	   * # Example
+	   *
+	   * Tests whether a set matches some text:
+	   *
+	   * ```typescript
+	   * import { RegexSet } from "rregex"
+	   *
+	   * const set = new RegexSet(["\\w+", "\\d+"])
+	   * expect(set.is_match("foo")).toBe(true)
+	   * expect(!set.is_match("☃")).toBe(false)
+	   * ```
+	   *
+	   * @see https://docs.rs/regex/latest/regex/struct.RegexSet.html#method.is_match
+	   * @param {string} text - The string against which to match the regular expression
+	   * @return {boolean}
+	   */
+	  isMatch(text: string): boolean;
 	}
 	
 }
@@ -1251,38 +1251,38 @@ declare type InitInput = RequestInfo | URL | Response | BufferSource | WebAssemb
 declare interface InitOutput {
   readonly memory: WebAssembly.Memory;
   readonly __wbg_rregex_free: (a: number, b: number) => void;
-  readonly rregex_new: (a: number, b: number) => [number, number, number];
-  readonly rregex_isMatch: (a: number, b: number, c: number) => number;
-  readonly rregex_isMatchAt: (a: number, b: number, c: number, d: number) => number;
-  readonly rregex_find: (a: number, b: number, c: number) => [number, number, number];
-  readonly rregex_findAt: (a: number, b: number, c: number, d: number) => [number, number, number];
-  readonly rregex_findAll: (a: number, b: number, c: number) => [number, number, number];
   readonly rregex_captureNames: (a: number) => [number, number];
   readonly rregex_captures: (a: number, b: number, c: number) => [number, number, number];
   readonly rregex_capturesAll: (a: number, b: number, c: number) => [number, number, number];
   readonly rregex_capturesLength: (a: number) => number;
+  readonly rregex_find: (a: number, b: number, c: number) => [number, number, number];
+  readonly rregex_findAll: (a: number, b: number, c: number) => [number, number, number];
+  readonly rregex_findAt: (a: number, b: number, c: number, d: number) => [number, number, number];
+  readonly rregex_isMatch: (a: number, b: number, c: number) => number;
+  readonly rregex_isMatchAt: (a: number, b: number, c: number, d: number) => number;
+  readonly rregex_new: (a: number, b: number) => [number, number, number];
   readonly rregex_replace: (a: number, b: number, c: number, d: number, e: number) => [number, number];
-  readonly rregex_replacen: (a: number, b: number, c: number, d: number, e: number, f: number) => [number, number];
   readonly rregex_replaceAll: (a: number, b: number, c: number, d: number, e: number) => [number, number];
-  readonly rregex_split: (a: number, b: number, c: number) => [number, number];
-  readonly rregex_splitn: (a: number, b: number, c: number, d: number) => [number, number];
+  readonly rregex_replacen: (a: number, b: number, c: number, d: number, e: number, f: number) => [number, number];
   readonly rregex_shortestMatch: (a: number, b: number, c: number) => number;
   readonly rregex_shortestMatchAt: (a: number, b: number, c: number, d: number) => number;
+  readonly rregex_split: (a: number, b: number, c: number) => [number, number];
+  readonly rregex_splitn: (a: number, b: number, c: number, d: number) => [number, number];
   readonly rregex_syntax: (a: number) => [number, number, number];
   readonly rregex_toString: (a: number) => [number, number];
   readonly __wbg_rregexset_free: (a: number, b: number) => void;
-  readonly rregexset_new: (a: any) => [number, number, number];
+  readonly escape: (a: number, b: number) => [number, number];
   readonly rregexset_isMatch: (a: number, b: number, c: number) => number;
   readonly rregexset_matches: (a: number, b: number, c: number) => [number, number];
-  readonly escape: (a: number, b: number) => [number, number];
+  readonly rregexset_new: (a: any) => [number, number, number];
   readonly __wbindgen_exn_store: (a: number) => void;
   readonly __externref_table_alloc: () => number;
   readonly __wbindgen_export_2: WebAssembly.Table;
   readonly __wbindgen_malloc: (a: number, b: number) => number;
   readonly __wbindgen_realloc: (a: number, b: number, c: number, d: number) => number;
+  readonly __wbindgen_free: (a: number, b: number, c: number) => void;
   readonly __externref_table_dealloc: (a: number) => void;
   readonly __externref_drop_slice: (a: number, b: number) => void;
-  readonly __wbindgen_free: (a: number, b: number, c: number) => void;
   readonly __wbindgen_start: () => void;
 }
 
@@ -1305,6 +1305,6 @@ export const metadata: {
   ],
   "homepage": "http://rregex.dev",
   "repository": "https://github.com/2fd/rregex",
-  "regex": "1.11.1",
-  "regex-syntax": "0.8.5"
+  "regex": "1.13.1",
+  "regex-syntax": "0.8.11"
 }