The cl-string-match Reference Manual

This is the cl-string-match Reference Manual, version 2018.1.2, generated automatically by Declt version 4.0 beta 2 "William Riker" on Wed May 15 04:32:08 2024 GMT+0.

Table of Contents


1 Introduction


2 Systems

The main system appears first, followed by any subsystem dependency.


2.1 cl-string-match

Provides implementations of the standard sub-string search (string matching) algorithms: brute-force, Boyer-Moore, Rabin-Karp, etc.

Author

Vityok https://bitbucket.org/vityok

Home Page

https://bitbucket.org/vityok/cl-string-match

License

BSD

Version

2018.1.2

Dependencies
  • alexandria (system).
  • ascii-strings (system).
  • yacc (system).
  • jpl-queues (system).
  • iterate (system).
  • mgl-pax/document (system).
Source

cl-string-match.asd.

Child Component

src (module).


2.2 ascii-strings

Operations on ASCII strings. Essentially this can be any kind of single-byte encoded strings.

Author

Vityok https://bitbucket.org/vityok

License

BSD

Version

2015.9.16

Dependencies
  • alexandria (system).
  • babel (system).
Source

ascii-strings.asd.

Child Component

contrib (module).


3 Modules

Modules are listed depth-first from the system components tree.


3.1 cl-string-match/src

Source

cl-string-match.asd.

Parent Component

cl-string-match (system).

Child Components

3.2 ascii-strings/contrib

Source

ascii-strings.asd.

Parent Component

ascii-strings (system).

Child Component

ascii-strings.lisp (file).


4 Files

Files are sorted by type and then listed depth-first from the systems components trees.


4.1 Lisp


4.1.1 cl-string-match/cl-string-match.asd

Source

cl-string-match.asd.

Parent Component

cl-string-match (system).

ASDF Systems

cl-string-match.

Packages

clstringmatch.system.


4.1.2 ascii-strings/ascii-strings.asd

Source

ascii-strings.asd.

Parent Component

ascii-strings (system).

ASDF Systems

ascii-strings.

Packages

ascii-strings.system.


4.1.3 cl-string-match/src/package.lisp

Source

cl-string-match.asd.

Parent Component

src (module).

Packages

cl-string-match.

Internals

4.1.4 cl-string-match/src/utils.lisp

Dependency

package.lisp (file).

Source

cl-string-match.asd.

Parent Component

src (module).

Public Interface

4.1.5 cl-string-match/src/brute-force.lisp

Dependency

utils.lisp (file).

Source

cl-string-match.asd.

Parent Component

src (module).

Public Interface
Internals

@brute-force-section (special variable).


4.1.6 cl-string-match/src/boyer-moore.lisp

Dependency

brute-force.lisp (file).

Source

cl-string-match.asd.

Parent Component

src (module).

Public Interface
Internals

4.1.7 cl-string-match/src/boyer-moore-horspool.lisp

Dependency

boyer-moore.lisp (file).

Source

cl-string-match.asd.

Parent Component

src (module).

Public Interface
Internals

4.1.8 cl-string-match/src/rabin-karp.lisp

Dependency

boyer-moore-horspool.lisp (file).

Source

cl-string-match.asd.

Parent Component

src (module).

Public Interface
Internals

4.1.9 cl-string-match/src/knuth-morris-pratt.lisp

Dependency

rabin-karp.lisp (file).

Source

cl-string-match.asd.

Parent Component

src (module).

Public Interface
Internals

4.1.10 cl-string-match/src/shift-or.lisp

Dependency

knuth-morris-pratt.lisp (file).

Source

cl-string-match.asd.

Parent Component

src (module).

Public Interface
Internals

4.1.11 cl-string-match/src/aho-corasick.lisp

Dependency

shift-or.lisp (file).

Source

cl-string-match.asd.

Parent Component

src (module).

Public Interface
Internals

4.1.12 cl-string-match/src/compiled-aho-corasick.lisp

Dependency

aho-corasick.lisp (file).

Source

cl-string-match.asd.

Parent Component

src (module).

Public Interface
Internals

make-lambda-ac (function).


4.1.13 cl-string-match/src/suffix-tree.lisp

Dependency

compiled-aho-corasick.lisp (file).

Source

cl-string-match.asd.

Parent Component

src (module).

Public Interface
Internals

4.1.14 cl-string-match/src/pre.lisp

Dependency

suffix-tree.lisp (file).

Source

cl-string-match.asd.

Parent Component

src (module).

Public Interface
Internals

4.1.15 cl-string-match/src/doc.lisp

Dependency

pre.lisp (file).

Source

cl-string-match.asd.

Parent Component

src (module).

Internals

4.1.16 ascii-strings/contrib/ascii-strings.lisp

Source

ascii-strings.asd.

Parent Component

contrib (module).

Packages

ascii-strings.

Public Interface
Internals

5 Packages

Packages are listed by definition order.


5.1 ascii-strings

This library implements functions and data types
similar to the standard Common Lisp functions and types but prefixed with ub- to avoid naming conflicts.

This package aims at providing single-byte strings functionality for Unicode-enabled Common Lisp implementations. Another aim is to reduce memory footprint and boost performance of the string-processing algorithms.

There are similar libraries/packages with slight differences. Check, for instance, com.informatimago.common-lisp.cesarum.ascii.

This package also provides a faster alternative to the standard read-line function. A line reader is created by the make-ub-line-reader function, an ub-string is read by the ub-read-line, and a standard line can be read by the ub-read-line-string.

Please note, that while ASCII uses 7-bits per character, this library works with octets, using 8-bits per character.

Source

ascii-strings.lisp.

Nickname

ascii

Use List
  • alexandria.
  • common-lisp.
Used By List

cl-string-match.

Public Interface
Internals

5.2 clstringmatch.system

Source

cl-string-match.asd.

Use List
  • asdf/interface.
  • common-lisp.

5.3 cl-string-match

String matching functions and methods.

Source

package.lisp.

Nickname

sm

Use List
Public Interface
Internals

5.4 ascii-strings.system

Source

ascii-strings.asd.

Use List
  • asdf/interface.
  • common-lisp.

6 Definitions

Definitions are sorted by export status, category, package, and then by lexicographic order.


6.1 Public Interface


6.1.1 Constants

Constant: +infinity+
Package

cl-string-match.

Source

suffix-tree.lisp.

Constant: ub-char-code-limit

Maximum number of UB-CHARs is limited by a single byte. That is: just 256 characters are possible.

Package

ascii-strings.

Source

ascii-strings.lisp.


6.1.2 Macros

Macro: define-bmh-matcher (variant-tag &key key-get key-code key-cmp= empty-pat alphabet-size data-type)
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Macro: define-brute-matcher (variant-tag &key key-get key-cmp/= data-type)
Package

cl-string-match.

Source

brute-force.lisp.

Macro: with-re ((re pattern) &body body)

Compile pattern if it’s not a RE object and execute body.

Package

cl-string-match.

Source

pre.lisp.

Macro: with-re-match ((match match-expr &key no-match) &body body)

Intern match symbols to execute a body.

Package

cl-string-match.

Source

pre.lisp.


6.1.3 Ordinary functions

Function: ascii-char-code (char)

This is like the standard CHAR-CODE but returns an octet.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: bmh8-p (object)
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Reader: bmh8-pat (instance)
Writer: (setf bmh8-pat) (instance)
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Target Slot

pat.

Function: build-suffix-tree-simple (str)

Build a Suffix tree for the given string STR using naive (brute-force) algorithm.

Naive algorithm takes O(m²) time to build a suffix tree where m is the
given string length.

Essentially it operates as follows:

while suffices remain:
add next shortest suffix to the tree

Algorithm first ads a suffix Str[1..m] (entire string) to the
tree. Then it proceeds adding suffices Str[i..m] (i=2..m) to the tree.

Package

cl-string-match.

Source

suffix-tree.lisp.

Function: build-suffix-tree-ukkonen (str)

Build a Suffix tree for the given string STR using Ukkonen’s algorithm.

Ukkonen’s algorithm takes O(m) time to build a suffix tree where m is the given string length.

Ukkonen’s algorithm is an on-line algorithm and can operate on a stream of characters, adding one character at a time.

Package

cl-string-match.

Source

suffix-tree.lisp.

Function: compile-re (pattern)

Create a regular expression from a pattern string.

Package

cl-string-match.

Source

pre.lisp.

Function: empty-trie ()

Creates a new instance and returns an empty trie.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: find-re (pattern s &key start end offset all)

Find a regexp pattern match somewhere in a string. Run from an offset.

Package

cl-string-match.

Source

pre.lisp.

Function: initialize-ac (patterns)

Returns a Trie that is used to look for the given patterns in the text. It can deal either with a single pattern or a list of patterns.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: initialize-bm (pat)
Package

cl-string-match.

Source

boyer-moore.lisp.

Function: initialize-bmh (pat)

Preprocess the needle.
Initialize the table to default value.

Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Function: initialize-bmh8 (pat)

Preprocess the needle.
Initialize the table to default value.

Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Function: initialize-kmp (pat)
Package

cl-string-match.

Source

knuth-morris-pratt.lisp.

Function: initialize-rk (pat)
Package

cl-string-match.

Source

rabin-karp.lisp.

Function: initialize-sor (pat)
Package

cl-string-match.

Source

shift-or.lisp.

Function: initialize-tabac (patterns)

Returns a tabular FDA that is used to look for the given patterns in the text. It can deal either with a single pattern or a list of patterns.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: make-substitution-table (subst)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: make-suffix-node (&key start end parent children id)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: make-suffix-tree (&key str root nodes-count)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: make-ub-buffer (size)

Allocate an ub-buffer of the given size.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: make-ub-line-reader (&key stream buffer fill pos eof)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: make-ub-string (size)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: make-ukk-node (&key start end parent children id suffix)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: match-re (pattern s &key start end offset exact)

Test a pattern re against a string.

Package

cl-string-match.

Source

pre.lisp.

Function: octets-to-ub (vec)

Convert a simple vector into an octets vector (ub-string).

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: prefixed-with (txt pref)

Returns T if the given string ‘TXT‘ is prefixed (starts with) the given prefix ‘PREF‘.

Package

cl-string-match.

Source

utils.lisp.

Function: replace-re (pattern with s &key start end offset all)

Replace patterns found within a string with a new value.

Package

cl-string-match.

Source

pre.lisp.

Function: search-ac (trie txt &key greedy)

Looks for patterns that are indexed in the given trie and returns two values: start position of the first matching pattern and its index.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: search-bm (idx txt)

Search for pattern bm in txt.

Package

cl-string-match.

Source

boyer-moore.lisp.

Function: search-bmh (idx txt &key start2 end2)

Search for pattern defined in the IDX in TXT.

Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Function: search-bmh8 (idx txt &key start2 end2)

Search for pattern defined in the IDX in TXT.

Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Function: search-compiled-ac (search-function txt)
Package

cl-string-match.

Source

compiled-aho-corasick.lisp.

Function: search-kmp (idx txt)
Package

cl-string-match.

Source

knuth-morris-pratt.lisp.

Function: search-rk (idx txt-s)

Implementation of the Rabin-Karp substring search algorithm.

Package

cl-string-match.

Source

rabin-karp.lisp.

Function: search-sor (idx txt &key start2 end2)
Package

cl-string-match.

Source

shift-or.lisp.

Function: search-tabac (idx txt)
Package

cl-string-match.

Source

aho-corasick.lisp.

Function: split-re (pattern s &key start end offset all coalesce-seps)

Split a string into one or more strings by pattern match.

Package

cl-string-match.

Source

pre.lisp.

Function: string-contains-ac (pat txt)

Looks for the given pattern in the text and returns index of the first occurence.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: string-contains-bm (pat txt)
Package

cl-string-match.

Source

boyer-moore.lisp.

Function: string-contains-bmh (pat txt &key start2 end2)
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Function: string-contains-bmh8 (pat txt &key start2 end2)
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Function: string-contains-brute (pat txt &key start1 end1 start2 end2)

A Brute-force substring search implementation.

Brute-force substring search requires O(N x M) character compares to search for a pattern of length M in a text of length N, in the worst case.

Algorithm described in: Chapter 5, p. 760 in
’Algorithms’, Robert Sedgewick and Kevin Wayne. 4th

Package

cl-string-match.

Source

brute-force.lisp.

Function: string-contains-brute-ub (pat txt &key start1 end1 start2 end2)

A Brute-force substring search implementation.

Brute-force substring search requires O(N x M) character compares to search for a pattern of length M in a text of length N, in the worst case.

Algorithm described in: Chapter 5, p. 760 in
’Algorithms’, Robert Sedgewick and Kevin Wayne. 4th

Package

cl-string-match.

Source

brute-force.lisp.

Function: string-contains-kmp (pat txt)
Package

cl-string-match.

Source

knuth-morris-pratt.lisp.

Function: string-contains-rk (pat txt)
Package

cl-string-match.

Source

rabin-karp.lisp.

Function: string-contains-sor (pat txt)
Package

cl-string-match.

Source

shift-or.lisp.

Function: string-contains-tabac (pat txt)

Looks for the given pattern in the text and returns index of the first occurence.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: string-to-ub (str)

Convert a standard Lisp String into an octets vector.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: suffix-node-add-child (tree node start end)

Adds a child node to the given NODE. Depending on the type of the given node creates either Ukkonens suffix tree or simple suffix tree node.

Package

cl-string-match.

Source

suffix-tree.lisp.

Reader: suffix-node-children (instance)
Writer: (setf suffix-node-children) (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Target Slot

children.

Reader: suffix-node-end (instance)
Writer: (setf suffix-node-end) (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Target Slot

end.

Function: suffix-node-equals (node-a node-b)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: suffix-node-leafp (node)

Retruns T is the given node is a leaf (has no children), return NIL otherwise.

Package

cl-string-match.

Source

suffix-tree.lisp.

Function: suffix-node-map-over-children (node function)

Applies the given function to every child of the given node.

Package

cl-string-match.

Source

suffix-tree.lisp.

Reader: suffix-node-start (instance)
Writer: (setf suffix-node-start) (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Target Slot

start.

Function: suffix-node-str (tree node)

Returns the string that corresponds to the edge pointing to this node.

Package

cl-string-match.

Source

suffix-tree.lisp.

Function: suffix-tree-build-from-sexp (str sexp)

Build the suffix tree from the given sexp representation. Sexp is in form (begin end (children)).

Package

cl-string-match.

Source

suffix-tree.lisp.

Function: suffix-tree-char (tree i)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: suffix-tree-equals (tree-a tree-b)

Checks all the nodes in the given trees and returns T if trees are equal or NIL otherwise.

Package

cl-string-match.

Source

suffix-tree.lisp.

Reader: suffix-tree-root (instance)
Writer: (setf suffix-tree-root) (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Target Slot

root.

Reader: suffix-tree-str (instance)
Writer: (setf suffix-tree-str) (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Target Slot

str.

Function: suffix-tree-walk (tree function)

Applies the given FUNCTION to every node in the given TREE.

Package

cl-string-match.

Source

suffix-tree.lisp.

Function: suffixed-with (txt suff)

Returns T if the given string ‘TXT‘ is suffixed (ends with) the given suffix ‘SUFF‘.

Package

cl-string-match.

Source

utils.lisp.

Function: trie->compiled-ac (trie)

Returns a compiled function for the given Aho-Corasick trie.

Package

cl-string-match.

Source

compiled-aho-corasick.lisp.

Function: trie->tabular-ac (trie)

Given an Aho-Corasick trie and transforms it into a table-based DFA for the Aho-Corasick automata.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: trie-add-keyword (trie kw idx &key constructor)

Starting at the root, follow the path labeled by chars of Pi

If the path ends before Pi, continue it by adding new edges and nodes for the remaining characters of Pi.

Store identifier i of Pi at the terminal node of the path.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: trie-build (patterns &key constructor)

Builds a Trie based on the given list of patterns.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: trie-contains (trie s)

Returns T if the given TRIE contains the given string S.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: trie-contains-prefix (trie s)

Checks if the given TRIE contains some prefix of the given string S.

Returns the length of the matched prefix.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: trie-pprint (trie &key padding root stream)

Traverse the given trie and pretty-print it to the given stream.

ROOT is the root node (optional).

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: trie-traverse-bfo (trie handler)

Traverse the trie in the Breadth-First-Order and call the given handler function on each node..

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: trie-traverse-dfo (trie handler)

Traverse the trie in the Depth-First-Order and call the given handler function on each node.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: ub-alpha-char-p (c)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-alphanumericp (c)

Returns true if character is an alphabetic character or a numeric character; otherwise, returns false.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-both-case-p ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char (string index)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char-code (char)

Returns a code of the ub-char. Since ub-char is a number (an octet), it is essentially an identity function.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char-downcase (c)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char-equal ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char-greaterp ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char-int (char)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char-lessp ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char-name ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char-not-equal ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char-not-greaterp ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char-not-lessp ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char-upcase (c)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char/= (c1 c2)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char< (c1 c2)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char<= (c1 c2)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char= (c1 c2)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char> (c1 c2)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-char>= (c1 c2)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-code-char ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-digit-char ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-digit-char-p (c &optional r)

Tests whether char is a digit in the specified radix (i.e., with a weight less than radix). If it is a digit in that radix, its weight is returned as an integer; otherwise nil is returned.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-graphic-char-p ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-line-reader-close (reader)

Mimics a standard close function: closes the underlying stream and resets the reader to its initial state.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-line-reader-file-position (reader &optional position)

Returns the current position within the stream according to the amount of information really read.

When the buffer caches more information than was really read by one of UB-READ-LINE function the standard FILE-POSITION function will return position of the buffer that is larger than the position that was read by the user.

Returned number can be used by the standard FILE-POSITION function to adjust the position within a stream.

When optional argument POSITION is supplied, the file position is adjusted accordingly in the underlying stream. The buffer is flushed.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-lower-case-p (c)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-name-char ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-nstring-capitalize ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-nstring-downcase ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-nstring-upcase ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-read-line (reader)

Reads data into a pre-allocated buffer in the reader structure and returns an array displaced to the contents of the next line in that buffer.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-read-line-raw (reader)

Reads data into the pre-allocated buffer in the READER structure and returns two values: start and end positions of the line within the buffer that can be used to extract this line contents from the buffer.

Please note, that unlike the standard read-line or the liberal-read-line by jasonmelbye this function works with the Unix-type of lines - sequence of characters delimited by the Newline symbol.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-read-line-string (reader)

Reads data into a pre-allocated buffer in the reader structure and returns a standard Lisp string.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-standard-char-p ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string-capitalize ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string-downcase ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string-equal ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string-greaterp ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string-left-trim ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string-lessp ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string-not-equal ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string-not-greaterp ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string-not-lessp ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string-right-trim ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string-trim ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string-upcase ()
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string/= (string1 string2 &key start1 end1 start2 end2)

Returns true if the supplied substrings are different; otherwise it is false.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string< (string1 string2 &key start1 end1 start2 end2)

Returns true if substring1 is less than substring2; otherwise it is false.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string<= (string1 string2 &key start1 end1 start2 end2)

Returns true if substring1 is less than or equal to substring2; otherwise it is false.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string= (string1 string2 &key start1 end1 start2 end2)

Returns true if the supplied substrings are of the same length and contain the same characters in corresponding positions; otherwise it returns false.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string> (string1 string2 &key start1 end1 start2 end2)

Returns true if substring1 is greater than substring2; otherwise it is false.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-string>= (string1 string2 &key start1 end1 start2 end2)

Returns true if substring1 is greater than or equal to substring2; otherwise it is false.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-subseq (sequence start &optional end)

Returns either the SEQUENCE itself, or a dispaced array to the SEQUENCE. This is meant as a memory-efficient replacement for the ordinary SUBSEQ that allocates a new sequence.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-to-string (ustr &key start end subst)

Converts either an UB-STRING or UB-BUFFER into a standard Common Lisp string.

START, END the start and end offsets within the given USTR to translate into a standard string.

Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ub-upper-case-p (c)
Package

ascii-strings.

Source

ascii-strings.lisp.

Reader: ukk-node-suffix (instance)
Writer: (setf ukk-node-suffix) (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Target Slot

suffix.


6.1.4 Generic functions

Generic Reader: match-groups (object)
Package

cl-string-match.

Methods
Reader Method: match-groups ((re-match re-match))

automatically generated reader method

Source

pre.lisp.

Target Slot

groups.

Generic Reader: match-pos-end (object)
Package

cl-string-match.

Methods
Reader Method: match-pos-end ((re-match re-match))

automatically generated reader method

Source

pre.lisp.

Target Slot

end-pos.

Generic Reader: match-pos-start (object)
Package

cl-string-match.

Methods
Reader Method: match-pos-start ((re-match re-match))

automatically generated reader method

Source

pre.lisp.

Target Slot

start-pos.

Generic Reader: match-string (object)
Package

cl-string-match.

Methods
Reader Method: match-string ((re-match re-match))

automatically generated reader method

Source

pre.lisp.

Target Slot

match.


6.1.5 Standalone methods

Method: make-load-form ((re re) &optional env)

Tell the system how to save and load a regular expression to a FASL.

Source

pre.lisp.

Method: print-object ((object trie-node) stream)
Source

aho-corasick.lisp.

Method: print-object ((object suffix-tree) stream)
Source

suffix-tree.lisp.

Method: print-object ((object suffix-node) stream)
Source

suffix-tree.lisp.

Method: print-object ((match re-match) s)

Output a regular expression match to a stream.

Source

pre.lisp.

Method: print-object ((re re) s)

Output a regular expression to a stream.

Source

pre.lisp.

Method: print-object ((object sor) stream)
Source

shift-or.lisp.


6.1.6 Structures

Structure: bmh8
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: bad-char-skip
Type

(simple-array fixnum (*))

Initform

#()

Readers

bmh8-bad-char-skip.

Writers

(setf bmh8-bad-char-skip).

Slot: pat
Type

simple-string

Initform

""

Readers

bmh8-pat.

Writers

(setf bmh8-pat).

Slot: pat-len
Type

fixnum

Initform

0

Readers

bmh8-pat-len.

Writers

(setf bmh8-pat-len).

Structure: suffix-node

Documentation

Package

cl-string-match.

Source

suffix-tree.lisp.

Direct superclasses

structure-object.

Direct subclasses

ukk-node.

Direct methods

print-object.

Direct slots
Slot: start
Type

fixnum

Initform

0

Readers

suffix-node-start.

Writers

(setf suffix-node-start).

Slot: end
Type

fixnum

Initform

0

Readers

suffix-node-end.

Writers

(setf suffix-node-end).

Slot: parent
Readers

suffix-node-parent.

Writers

(setf suffix-node-parent).

Slot: children
Readers

suffix-node-children.

Writers

(setf suffix-node-children).

Slot: id
Type

fixnum

Initform

0

Readers

suffix-node-id.

Writers

(setf suffix-node-id).

Structure: suffix-tree

ROOT is a SUFFIX-NODE with default values. It is intended to keep references to its children. ROOT is just a simple placeholder for the actual nodes as its children.

Package

cl-string-match.

Source

suffix-tree.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots
Slot: str
Type

simple-string

Initform

""

Readers

suffix-tree-str.

Writers

(setf suffix-tree-str).

Slot: root
Readers

suffix-tree-root.

Writers

(setf suffix-tree-root).

Slot: nodes-count
Type

fixnum

Initform

0

Readers

suffix-tree-nodes-count.

Writers

(setf suffix-tree-nodes-count).

Structure: trie-node

Each node of a trie contains a list of child nodes, a label (the letter) and a mark (some value attributed to the matching string).

Trie root node is like all other nodes but its ‘ID‘ is used as an increment to create ids for new nodes.

Slots:

* ‘id‘ - unique node identifier, root node has the largest id.
* ‘children‘ - a hash table with labels as keys, ‘trie-node‘ as values.
* ‘mark‘ - output function, when not null marks the last character of a keyword and is returned as the search result.
* ‘fail‘ - fail transition to another node.
* ‘depth‘ - number of nodes from the root node to this node.

Package

cl-string-match.

Source

aho-corasick.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots
Slot: id
Type

fixnum

Initform

0

Readers

trie-node-id.

Writers

(setf trie-node-id).

Slot: children
Readers

trie-node-children.

Writers

(setf trie-node-children).

Slot: label
Readers

trie-node-label.

Writers

(setf trie-node-label).

Slot: mark
Readers

trie-node-mark.

Writers

(setf trie-node-mark).

Slot: fail
Type

(or null cl-string-match:trie-node)

Readers

trie-node-fail.

Writers

(setf trie-node-fail).

Slot: depth
Type

fixnum

Initform

0

Readers

trie-node-depth.

Writers

(setf trie-node-depth).

Structure: ukk-node

Ukkonen’s algorithm relies on the suffix link technique. Some other algorithms might also rely on it but the naive suffix tree algorithm does not require it.

This structure extends the standard suffix tree node structure with the suffix link slot.

Package

cl-string-match.

Source

suffix-tree.lisp.

Direct superclasses

suffix-node.

Direct slots
Slot: suffix
Readers

ukk-node-suffix.

Writers

(setf ukk-node-suffix).


6.1.7 Classes

Class: re

Regular expression.

Package

cl-string-match.

Source

pre.lisp.

Direct methods
Direct slots
Slot: pattern
Initargs

:pattern

Readers

re-pattern.

Writers

This slot is read-only.

Slot: expr
Initargs

:expression

Readers

re-expression.

Writers

This slot is read-only.

Class: re-match

Matched pattern.

Package

cl-string-match.

Source

pre.lisp.

Direct methods
Direct slots
Slot: match
Initargs

:match

Readers

match-string.

Writers

This slot is read-only.

Slot: groups
Initargs

:groups

Readers

match-groups.

Writers

This slot is read-only.

Slot: start-pos
Initargs

:start-pos

Readers

match-pos-start.

Writers

This slot is read-only.

Slot: end-pos
Initargs

:end-pos

Readers

match-pos-end.

Writers

This slot is read-only.


6.1.8 Types

Type: ub-buffer ()

Buffer of octets is a simple array to allow compiler optimizations.

Package

ascii-strings.

Source

ascii-strings.lisp.

Type: ub-char ()

An octet. A number equal to the char code.

Package

ascii-strings.

Source

ascii-strings.lisp.

Type: ub-string ()

Strings must be vectors to allow for fill pointers and displacement. However, SBCL does a better job on optimizations when it deals with simple arrays.

Package

ascii-strings.

Source

ascii-strings.lisp.


6.2 Internals


6.2.1 Constants

Constant: +ac-alphabet+
Package

cl-string-match.

Source

aho-corasick.lisp.

Constant: +alph-size+
Package

cl-string-match.

Source

rabin-karp.lisp.

Constant: +big-prime+
Package

cl-string-match.

Source

rabin-karp.lisp.

Constant: +newline+
Package

ascii-strings.

Source

ascii-strings.lisp.

Constant: +sor-alphabet+

Size of the alphabet for the Shift-OR algorithm implementation.

Package

cl-string-match.

Source

shift-or.lisp.

Constant: +ub-line-reader-buffer-size+

Defines the size of the buffer used by the line reader in bytes.

Package

ascii-strings.

Source

ascii-strings.lisp.


6.2.2 Special variables

Special Variable: *default-substitution-table*

Substitution table used to convert ub-strings to the standard strings by default. Since character with code 0 is not very welcome in the world of C, we are converting it to an ordinary character.

Package

ascii-strings.

Source

ascii-strings.lisp.

Special Variable: *expression-parser*
Package

cl-string-match.

Source

pre.lisp.

Special Variable: *set-parser*
Package

cl-string-match.

Source

pre.lisp.

Special Variable: *standard-debug-settings*

The standard debug settings to be used in functions under development.

Package

cl-string-match.

Source

package.lisp.

Special Variable: *standard-optimize-settings*

The standard optimize settings used by most declaration expressions. Tuned for best performance by default, but when the SM-DEBUG-ENABLED keyword is present in the *FEATURES* list, makes debug and safety its priority at the expense of everything else.

Package

cl-string-match.

Source

package.lisp.

Special Variable: @aho-corasick-section
Package

cl-string-match.

Source

aho-corasick.lisp.

Special Variable: @boyer-moore-horspool-section
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Special Variable: @boyer-moore-section
Package

cl-string-match.

Source

boyer-moore.lisp.

Special Variable: @brute-force-section
Package

cl-string-match.

Source

brute-force.lisp.

Special Variable: @cl-string-match-manual
Package

cl-string-match.

Source

doc.lisp.

Special Variable: @knuth-morris-pratt-section
Package

cl-string-match.

Source

knuth-morris-pratt.lisp.

Special Variable: @multi-pattern-search
Package

cl-string-match.

Source

doc.lisp.

Special Variable: @pre-basic-matching-section
Package

cl-string-match.

Source

pre.lisp.

Special Variable: @pre-compiling-patterns-section
Package

cl-string-match.

Source

pre.lisp.

Special Variable: @pre-groups-section
Package

cl-string-match.

Source

pre.lisp.

Special Variable: @pre-pattern-replacing-section
Package

cl-string-match.

Source

pre.lisp.

Special Variable: @pre-pattern-scanning-section
Package

cl-string-match.

Source

pre.lisp.

Special Variable: @pre-pattern-splitting-section
Package

cl-string-match.

Source

pre.lisp.

Special Variable: @pre-regexp-section
Package

cl-string-match.

Source

pre.lisp.

Special Variable: @pre-with-re-match-section
Package

cl-string-match.

Source

pre.lisp.

Special Variable: @rabin-karp-section
Package

cl-string-match.

Source

rabin-karp.lisp.

Special Variable: @regexp-pattern-search
Package

cl-string-match.

Source

doc.lisp.

Special Variable: @shift-or-section
Package

cl-string-match.

Source

shift-or.lisp.

Special Variable: @single-pattern-search
Package

cl-string-match.

Source

doc.lisp.


6.2.3 Macros

Macro: map-trie-children ((parent child) &body body)

Perform the given BODY on the children of the given PARENT. The child node is bound to the CHILD variable.

Example:

(map-trie-children (node child)
(push child stack))

Package

cl-string-match.

Source

aho-corasick.lisp.

Macro: ub-string<>=*-body (lessp equalp)

Makes a body of the string comparison functions. Borrowed from the string.lisp file of the SBCL sources.

Package

ascii-strings.

Source

ascii-strings.lisp.


6.2.4 Ordinary functions

Function: %ub-string-compare (string1 start1 end1 string2 start2 end2)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: add-suffix-simple (tree start end)

Adds a suffix of a string STR designated by its START and END to the suffix tree TREE.

Package

cl-string-match.

Source

suffix-tree.lisp.

Reader: bm-bad-char (instance)
Writer: (setf bm-bad-char) (instance)
Package

cl-string-match.

Source

boyer-moore.lisp.

Target Slot

bad-char.

Reader: bm-good-suffix (instance)
Writer: (setf bm-good-suffix) (instance)
Package

cl-string-match.

Source

boyer-moore.lisp.

Target Slot

good-suffix.

Function: bm-p (object)
Package

cl-string-match.

Source

boyer-moore.lisp.

Reader: bm-pat (instance)
Writer: (setf bm-pat) (instance)
Package

cl-string-match.

Source

boyer-moore.lisp.

Target Slot

pat.

Function: bm-suffixes (pat suffixes)
Package

cl-string-match.

Source

boyer-moore.lisp.

Reader: bmh-bad-char-skip (instance)
Writer: (setf bmh-bad-char-skip) (instance)
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Target Slot

bad-char-skip.

Function: bmh-p (object)
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Reader: bmh-pat (instance)
Writer: (setf bmh-pat) (instance)
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Target Slot

pat.

Reader: bmh-pat-len (instance)
Writer: (setf bmh-pat-len) (instance)
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Target Slot

pat-len.

Reader: bmh8-bad-char-skip (instance)
Writer: (setf bmh8-bad-char-skip) (instance)
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Target Slot

bad-char-skip.

Reader: bmh8-pat-len (instance)
Writer: (setf bmh8-pat-len) (instance)
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Target Slot

pat-len.

Function: branch (tree node l r c)

Function branch is used to test if a position is the end point and turn the implicit node to explicit node if necessary. Because sentinel node is not used, the special case is handled in the first if-clause.

Package

cl-string-match.

Source

suffix-tree.lisp.

Function: build-suffix-tree-mccreight (str)

Build a Suffix tree for the given string STR using McCreight’s algorithm.

McCreight’s algorithm takes O(n) time to build a suffix tree where n is the given string length.

TODO

Package

cl-string-match.

Source

suffix-tree.lisp.

Function: canonize (tree node l r)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: check-rk-lv (idx txt i)

Las Vegas version: does pat[] match txt[i..i-M+1] ?

Package

cl-string-match.

Source

rabin-karp.lisp.

Function: check-rk-mk (i)

Monte Carlo version: always return true

Package

cl-string-match.

Source

rabin-karp.lisp.

Function: compile-set (s)

Create a single satisfy predicate for a character set.

Package

cl-string-match.

Source

pre.lisp.

Function: compute-failure-function (trie)

Given a trie calculate failure transitions for its nodes.

Modifies nodes.

Traverses the trie in the breadth-first-order (BFO)

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: copy-bm (instance)
Package

cl-string-match.

Source

boyer-moore.lisp.

Function: copy-bmh (instance)
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Function: copy-bmh8 (instance)
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Function: copy-kmp (instance)
Package

cl-string-match.

Source

knuth-morris-pratt.lisp.

Function: copy-re-thread (instance)
Package

cl-string-match.

Source

pre.lisp.

Function: copy-rk (instance)
Package

cl-string-match.

Source

rabin-karp.lisp.

Function: copy-sor (instance)
Package

cl-string-match.

Source

shift-or.lisp.

Function: copy-suffix-node (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: copy-suffix-tree (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: copy-tabac (instance)
Package

cl-string-match.

Source

aho-corasick.lisp.

Function: copy-trie-node (instance)
Package

cl-string-match.

Source

aho-corasick.lisp.

Function: copy-ub-line-reader (instance)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: copy-ukk-node (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: escape (c)

Return the test and predicate for an escaped character.

Package

cl-string-match.

Source

pre.lisp.

Function: format-name (format &rest args)
Package

cl-string-match.

Source

package.lisp.

Function: hash-bm (order)
Package

cl-string-match.

Source

boyer-moore.lisp.

Function: hex-char-p (c)

T if c is a hexadecimal character.

Package

cl-string-match.

Source

pre.lisp.

Function: horner-hash (key end)

Horner hashing function implementation.

Computes the hash function for an END-digit base- +ALPH-SIZE+ number represented as a char array in time proportional to END. (We pass END as an argument so that we can use the function for both the pattern and the text.)

Package

cl-string-match.

Source

rabin-karp.lisp.

Function: initialize-bad-char (idx)

Initialize the bad character skip for the Boyer-Moore algorithm.

Package

cl-string-match.

Source

boyer-moore.lisp.

Function: initialize-good-suffix (idx)

Initialize the good suffix skip function table for the Boyer-Moore algorithm.

Package

cl-string-match.

Source

boyer-moore.lisp.

Function: kmp-p (object)
Package

cl-string-match.

Source

knuth-morris-pratt.lisp.

Reader: kmp-pat (instance)
Writer: (setf kmp-pat) (instance)
Package

cl-string-match.

Source

knuth-morris-pratt.lisp.

Target Slot

pat.

Reader: kmp-pat-len (instance)
Writer: (setf kmp-pat-len) (instance)
Package

cl-string-match.

Source

knuth-morris-pratt.lisp.

Target Slot

pat-len.

Reader: kmp-table (instance)
Writer: (setf kmp-table) (instance)
Package

cl-string-match.

Source

knuth-morris-pratt.lisp.

Target Slot

table.

Function: make-bm (&key bad-char good-suffix pat)
Package

cl-string-match.

Source

boyer-moore.lisp.

Function: make-bmh (&key bad-char-skip pat pat-len)
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Function: make-bmh8 (&key bad-char-skip pat pat-len)
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Function: make-kmp (&key pat pat-len table)
Package

cl-string-match.

Source

knuth-morris-pratt.lisp.

Function: make-lambda-ac (trie)

Writes lambda function performing search over the given trie.

That function can later be compiled into native code and funcall-ed. The generated function accepts a single string and returns matching mark from the given trie.

Generated function is essentially a giant tagbody with jumps dispatched in case forms depending on the current character.

Package

cl-string-match.

Source

compiled-aho-corasick.lisp.

Function: make-re-thread (pc sp groups stack)
Package

cl-string-match.

Source

pre.lisp.

Function: make-rk (&key pat pat-hash pat-len alph-size rm)
Package

cl-string-match.

Source

rabin-karp.lisp.

Function: make-sor (&key cidx lim pat-len)
Package

cl-string-match.

Source

shift-or.lisp.

Function: make-tabac (&key start trans final match-len)
Package

cl-string-match.

Source

aho-corasick.lisp.

Function: make-trie-node (&key id children label mark fail depth)
Package

cl-string-match.

Source

aho-corasick.lisp.

Function: newline-p (c)

T if c is a newline character.

Package

cl-string-match.

Source

pre.lisp.

Function: print-markdown-footer (stream)
Package

cl-string-match.

Source

doc.lisp.

Function: print-suffix-tree-for-gv (tree &key stream label)

Print the given suffix TREE for the Graphviz visualization in the dot format.

Package

cl-string-match.

Source

suffix-tree.lisp.

Function: print-suffix-tree-for-gv-pretty (tree &key stream label)

Alternative representation of the suffix tree. Based on java implementation from: http://pastie.org/5925812

Package

cl-string-match.

Source

suffix-tree.lisp.

Function: print-suffix-tree-in-file (tree fname &optional label)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: punctuation-p (c)

T if c is a punctuation character.

Package

cl-string-match.

Source

pre.lisp.

Reader: re-thread-groups (instance)
Writer: (setf re-thread-groups) (instance)
Package

cl-string-match.

Source

pre.lisp.

Target Slot

groups.

Function: re-thread-p (object)
Package

cl-string-match.

Source

pre.lisp.

Reader: re-thread-pc (instance)
Writer: (setf re-thread-pc) (instance)
Package

cl-string-match.

Source

pre.lisp.

Target Slot

pc.

Reader: re-thread-sp (instance)
Writer: (setf re-thread-sp) (instance)
Package

cl-string-match.

Source

pre.lisp.

Target Slot

sp.

Reader: re-thread-stack (instance)
Writer: (setf re-thread-stack) (instance)
Package

cl-string-match.

Source

pre.lisp.

Target Slot

stack.

Function: ref-length (l r)
Package

cl-string-match.

Source

suffix-tree.lisp.

Reader: rk-alph-size (instance)
Writer: (setf rk-alph-size) (instance)
Package

cl-string-match.

Source

rabin-karp.lisp.

Target Slot

alph-size.

Function: rk-p (object)
Package

cl-string-match.

Source

rabin-karp.lisp.

Reader: rk-pat (instance)
Writer: (setf rk-pat) (instance)
Package

cl-string-match.

Source

rabin-karp.lisp.

Target Slot

pat.

Reader: rk-pat-hash (instance)
Writer: (setf rk-pat-hash) (instance)
Package

cl-string-match.

Source

rabin-karp.lisp.

Target Slot

pat-hash.

Reader: rk-pat-len (instance)
Writer: (setf rk-pat-len) (instance)
Package

cl-string-match.

Source

rabin-karp.lisp.

Target Slot

pat-len.

Reader: rk-rm (instance)
Writer: (setf rk-rm) (instance)
Package

cl-string-match.

Source

rabin-karp.lisp.

Target Slot

rm.

Function: run (expression s &optional pc start end offset)

Execute a regular expression program.

Package

cl-string-match.

Source

pre.lisp.

Reader: sor-cidx (instance)
Writer: (setf sor-cidx) (instance)
Package

cl-string-match.

Source

shift-or.lisp.

Target Slot

cidx.

Reader: sor-lim (instance)
Writer: (setf sor-lim) (instance)
Package

cl-string-match.

Source

shift-or.lisp.

Target Slot

lim.

Function: sor-p (object)
Package

cl-string-match.

Source

shift-or.lisp.

Reader: sor-pat-len (instance)
Writer: (setf sor-pat-len) (instance)
Package

cl-string-match.

Source

shift-or.lisp.

Target Slot

pat-len.

Function: sor-printer (obj stream depth)

Make dump of the SOR structure more human-readable: in the CIDX print characters and their positions, decipher LIM.

Package

cl-string-match.

Source

shift-or.lisp.

Function: space-p (c)

T if c is a whitespace character.

Package

cl-string-match.

Source

pre.lisp.

Function: split-node (tree old-node start end pos)

Split the given NODE at position POS within the node.

Package

cl-string-match.

Source

suffix-tree.lisp.

Function: stbstr (str l r)

The +infinity+ is defined as the largest number (standard constant MOST-POSITIVE-FIXNUM), if the right index exceed to the length of the list, the result is from left to the end of the list.

Package

cl-string-match.

Source

suffix-tree.lisp.

Function: str-length (node)

Length of the substring in the arc.

Package

cl-string-match.

Source

suffix-tree.lisp.

Function: suffix-node-get-child (tree node c)

Given the NODE lookup a child node that starts with the given char C in the given suffix tree TREE.

Package

cl-string-match.

Source

suffix-tree.lisp.

Reader: suffix-node-id (instance)
Writer: (setf suffix-node-id) (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Target Slot

id.

Function: suffix-node-insert-child (tree node child-node)

Adds a child node to the given NODE.

Package

cl-string-match.

Source

suffix-tree.lisp.

Function: suffix-node-p (object)
Package

cl-string-match.

Source

suffix-tree.lisp.

Reader: suffix-node-parent (instance)
Writer: (setf suffix-node-parent) (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Target Slot

parent.

Function: suffix-node-printer (obj stream depth)
Package

cl-string-match.

Source

suffix-tree.lisp.

Reader: suffix-tree-nodes-count (instance)
Writer: (setf suffix-tree-nodes-count) (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Target Slot

nodes-count.

Function: suffix-tree-p (object)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: suffix-tree-printer (obj stream depth)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: tab-p (c)

T if c is a tab character.

Package

cl-string-match.

Source

pre.lisp.

Reader: tabac-final (instance)
Writer: (setf tabac-final) (instance)
Package

cl-string-match.

Source

aho-corasick.lisp.

Target Slot

final.

Reader: tabac-match-len (instance)
Writer: (setf tabac-match-len) (instance)
Package

cl-string-match.

Source

aho-corasick.lisp.

Target Slot

match-len.

Function: tabac-p (object)
Package

cl-string-match.

Source

aho-corasick.lisp.

Reader: tabac-start (instance)
Writer: (setf tabac-start) (instance)
Package

cl-string-match.

Source

aho-corasick.lisp.

Target Slot

start.

Reader: tabac-trans (instance)
Writer: (setf tabac-trans) (instance)
Package

cl-string-match.

Source

aho-corasick.lisp.

Target Slot

trans.

Function: tabac-transition (idx state c)

Returns a new state based on the given char from the current state.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: trie-add-child (trie label mark &key id constructor)

Add a child node to the given node with the given label and mark.

Constructor can be either ‘MAKE-TRIE-NODE‘ or any other structure constructor derieved from the ‘TRIE-NODE‘ struct.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: trie-dump-dot (trie &key stream)

Dumps a textual representation of the Trie useful for making a graphical plot with Graphviz to the given stream.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: trie-dump-dot-file (trie fname)

Dumps output of the TRIE-DUMP-DOT function to the file with the specified file name.

Package

cl-string-match.

Source

aho-corasick.lisp.

Function: trie-find-child (trie label)

Looks for a child of the given node trie with the given label.

Package

cl-string-match.

Source

aho-corasick.lisp.

Reader: trie-node-children (instance)
Writer: (setf trie-node-children) (instance)
Package

cl-string-match.

Source

aho-corasick.lisp.

Target Slot

children.

Reader: trie-node-depth (instance)
Writer: (setf trie-node-depth) (instance)
Package

cl-string-match.

Source

aho-corasick.lisp.

Target Slot

depth.

Reader: trie-node-fail (instance)
Writer: (setf trie-node-fail) (instance)
Package

cl-string-match.

Source

aho-corasick.lisp.

Target Slot

fail.

Reader: trie-node-id (instance)
Writer: (setf trie-node-id) (instance)
Package

cl-string-match.

Source

aho-corasick.lisp.

Target Slot

id.

Reader: trie-node-label (instance)
Writer: (setf trie-node-label) (instance)
Package

cl-string-match.

Source

aho-corasick.lisp.

Target Slot

label.

Reader: trie-node-mark (instance)
Writer: (setf trie-node-mark) (instance)
Package

cl-string-match.

Source

aho-corasick.lisp.

Target Slot

mark.

Function: trie-node-p (object)
Package

cl-string-match.

Source

aho-corasick.lisp.

Function: trie-node-printer (obj stream depth)

We have to avoid standard Lisp printer because of the FAIL links that turn our tree into a network with cycles, throwing the default printer into an infinite loop.

Package

cl-string-match.

Source

aho-corasick.lisp.

Reader: ub-line-reader-buffer (instance)
Writer: (setf ub-line-reader-buffer) (instance)
Package

ascii-strings.

Source

ascii-strings.lisp.

Target Slot

buffer.

Reader: ub-line-reader-eof (instance)
Writer: (setf ub-line-reader-eof) (instance)
Package

ascii-strings.

Source

ascii-strings.lisp.

Target Slot

eof.

Reader: ub-line-reader-fill (instance)
Writer: (setf ub-line-reader-fill) (instance)
Package

ascii-strings.

Source

ascii-strings.lisp.

Target Slot

fill.

Function: ub-line-reader-p (object)
Package

ascii-strings.

Source

ascii-strings.lisp.

Reader: ub-line-reader-pos (instance)
Writer: (setf ub-line-reader-pos) (instance)
Package

ascii-strings.

Source

ascii-strings.lisp.

Target Slot

pos.

Reader: ub-line-reader-stream (instance)
Writer: (setf ub-line-reader-stream) (instance)
Package

ascii-strings.

Source

ascii-strings.lisp.

Target Slot

stream.

Function: ub-schar (string index)
Package

ascii-strings.

Source

ascii-strings.lisp.

Function: ukk-node-children (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: (setf ukk-node-children) (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: ukk-node-end (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: (setf ukk-node-end) (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: ukk-node-id (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: (setf ukk-node-id) (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: ukk-node-p (object)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: ukk-node-parent (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: (setf ukk-node-parent) (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: ukk-node-start (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: (setf ukk-node-start) (instance)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: ukkonen-update (tree node l i)
Package

cl-string-match.

Source

suffix-tree.lisp.

Function: update-md ()
Package

cl-string-match.

Source

doc.lisp.

Function: word-char-p (c)

T if is alphanumeric or an underscore.

Package

cl-string-match.

Source

pre.lisp.


6.2.5 Generic functions

Generic Reader: re-expression (object)
Package

cl-string-match.

Methods
Reader Method: re-expression ((re re))

automatically generated reader method

Source

pre.lisp.

Target Slot

expr.

Generic Reader: re-pattern (object)
Package

cl-string-match.

Methods
Reader Method: re-pattern ((re re))

automatically generated reader method

Source

pre.lisp.

Target Slot

pattern.


6.2.6 Structures

Structure: bm
Package

cl-string-match.

Source

boyer-moore.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: bad-char
Type

(simple-array fixnum)

Initform

(make-array 0 :element-type (quote fixnum))

Readers

bm-bad-char.

Writers

(setf bm-bad-char).

Slot: good-suffix
Type

(simple-array fixnum)

Initform

(make-array 0 :element-type (quote fixnum))

Readers

bm-good-suffix.

Writers

(setf bm-good-suffix).

Slot: pat
Type

simple-string

Initform

""

Readers

bm-pat.

Writers

(setf bm-pat).

Structure: bmh
Package

cl-string-match.

Source

boyer-moore-horspool.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: bad-char-skip
Type

(simple-array fixnum (*))

Initform

#()

Readers

bmh-bad-char-skip.

Writers

(setf bmh-bad-char-skip).

Slot: pat
Type

simple-string

Initform

""

Readers

bmh-pat.

Writers

(setf bmh-pat).

Slot: pat-len
Type

fixnum

Initform

0

Readers

bmh-pat-len.

Writers

(setf bmh-pat-len).

Structure: kmp
Package

cl-string-match.

Source

knuth-morris-pratt.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: pat
Type

simple-string

Initform

""

Readers

kmp-pat.

Writers

(setf kmp-pat).

Slot: pat-len
Type

fixnum

Initform

0

Readers

kmp-pat-len.

Writers

(setf kmp-pat-len).

Slot: table
Type

(simple-array fixnum)

Initform

(make-array 0 :element-type (quote fixnum))

Readers

kmp-table.

Writers

(setf kmp-table).

Structure: re-thread
Package

cl-string-match.

Source

pre.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: pc
Readers

re-thread-pc.

Writers

(setf re-thread-pc).

Slot: sp
Readers

re-thread-sp.

Writers

(setf re-thread-sp).

Slot: groups
Readers

re-thread-groups.

Writers

(setf re-thread-groups).

Slot: stack
Readers

re-thread-stack.

Writers

(setf re-thread-stack).

Structure: rk
Package

cl-string-match.

Source

rabin-karp.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: pat
Type

simple-string

Initform

""

Readers

rk-pat.

Writers

(setf rk-pat).

Slot: pat-hash
Type

cl-string-match::rk-ub32

Initform

0

Readers

rk-pat-hash.

Writers

(setf rk-pat-hash).

Slot: pat-len
Type

cl-string-match::rk-ub32

Initform

0

Readers

rk-pat-len.

Writers

(setf rk-pat-len).

Slot: alph-size
Type

cl-string-match::rk-ub32

Initform

cl-string-match::+alph-size+

Readers

rk-alph-size.

Writers

(setf rk-alph-size).

Slot: rm
Type

cl-string-match::rk-ub32

Initform

1

Readers

rk-rm.

Writers

(setf rk-rm).

Structure: sor

Index for the Shift-OR search operation.

Package

cl-string-match.

Source

shift-or.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots
Slot: cidx
Readers

sor-cidx.

Writers

(setf sor-cidx).

Slot: lim
Type

cl-string-match::sor-ub32

Initform

0

Readers

sor-lim.

Writers

(setf sor-lim).

Slot: pat-len
Type

fixnum

Initform

0

Readers

sor-pat-len.

Writers

(setf sor-pat-len).

Structure: tabac

Defines an Aho-Corasick DFA based on tables.

Slots:

* ‘start‘ - initial state
* ‘trans‘ - a table of transition tables
* ‘final‘ - marks final states
* ‘match-len‘ - stores length of the keyword corresponding to the final state

Package

cl-string-match.

Source

aho-corasick.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: start
Type

fixnum

Initform

-1

Readers

tabac-start.

Writers

(setf tabac-start).

Slot: trans
Type

(or null (simple-array (or null (simple-array fixnum))))

Readers

tabac-trans.

Writers

(setf tabac-trans).

Slot: final
Type

(simple-array fixnum)

Initform

(make-array 0 :element-type (quote fixnum))

Readers

tabac-final.

Writers

(setf tabac-final).

Slot: match-len
Type

(simple-array fixnum)

Initform

(make-array 0 :element-type (quote fixnum))

Readers

tabac-match-len.

Writers

(setf tabac-match-len).

Structure: ub-line-reader

Encapsulates a buffer and the state of the line reader. Created by the make-ub-line-reader function, and the every next line is obtained by one of the ub-read-line-* functions.

You should not forget to close the underlying stream using either a standard close function or the ub-line-reader-close function.

It is anticipated that the underlying stream is an input stream with element-type set to ub-char.

Package

ascii-strings.

Source

ascii-strings.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: stream
Package

common-lisp.

Type

(or null stream)

Readers

ub-line-reader-stream.

Writers

(setf ub-line-reader-stream).

Slot: buffer
Type

ascii-strings:ub-buffer

Initform

(make-array ascii-strings::+ub-line-reader-buffer-size+ :element-type (quote ascii-strings:ub-char))

Readers

ub-line-reader-buffer.

Writers

(setf ub-line-reader-buffer).

Slot: fill
Package

common-lisp.

Type

fixnum

Initform

0

Readers

ub-line-reader-fill.

Writers

(setf ub-line-reader-fill).

Slot: pos
Type

fixnum

Initform

0

Readers

ub-line-reader-pos.

Writers

(setf ub-line-reader-pos).

Slot: eof
Type

boolean

Readers

ub-line-reader-eof.

Writers

(setf ub-line-reader-eof).


6.2.7 Types

Type: rk-ub32 ()
Package

cl-string-match.

Source

rabin-karp.lisp.

Type: sor-ub32 ()
Package

cl-string-match.

Source

shift-or.lisp.


Appendix A Indexes


A.1 Concepts


A.2 Functions

Jump to:   %   (  
A   B   C   D   E   F   G   H   I   K   M   N   O   P   R   S   T   U   W  
Index Entry  Section

%
%ub-string-compare: Private ordinary functions

(
(setf bm-bad-char): Private ordinary functions
(setf bm-good-suffix): Private ordinary functions
(setf bm-pat): Private ordinary functions
(setf bmh-bad-char-skip): Private ordinary functions
(setf bmh-pat): Private ordinary functions
(setf bmh-pat-len): Private ordinary functions
(setf bmh8-bad-char-skip): Private ordinary functions
(setf bmh8-pat): Public ordinary functions
(setf bmh8-pat-len): Private ordinary functions
(setf kmp-pat): Private ordinary functions
(setf kmp-pat-len): Private ordinary functions
(setf kmp-table): Private ordinary functions
(setf re-thread-groups): Private ordinary functions
(setf re-thread-pc): Private ordinary functions
(setf re-thread-sp): Private ordinary functions
(setf re-thread-stack): Private ordinary functions
(setf rk-alph-size): Private ordinary functions
(setf rk-pat): Private ordinary functions
(setf rk-pat-hash): Private ordinary functions
(setf rk-pat-len): Private ordinary functions
(setf rk-rm): Private ordinary functions
(setf sor-cidx): Private ordinary functions
(setf sor-lim): Private ordinary functions
(setf sor-pat-len): Private ordinary functions
(setf suffix-node-children): Public ordinary functions
(setf suffix-node-end): Public ordinary functions
(setf suffix-node-id): Private ordinary functions
(setf suffix-node-parent): Private ordinary functions
(setf suffix-node-start): Public ordinary functions
(setf suffix-tree-nodes-count): Private ordinary functions
(setf suffix-tree-root): Public ordinary functions
(setf suffix-tree-str): Public ordinary functions
(setf tabac-final): Private ordinary functions
(setf tabac-match-len): Private ordinary functions
(setf tabac-start): Private ordinary functions
(setf tabac-trans): Private ordinary functions
(setf trie-node-children): Private ordinary functions
(setf trie-node-depth): Private ordinary functions
(setf trie-node-fail): Private ordinary functions
(setf trie-node-id): Private ordinary functions
(setf trie-node-label): Private ordinary functions
(setf trie-node-mark): Private ordinary functions
(setf ub-line-reader-buffer): Private ordinary functions
(setf ub-line-reader-eof): Private ordinary functions
(setf ub-line-reader-fill): Private ordinary functions
(setf ub-line-reader-pos): Private ordinary functions
(setf ub-line-reader-stream): Private ordinary functions
(setf ukk-node-children): Private ordinary functions
(setf ukk-node-end): Private ordinary functions
(setf ukk-node-id): Private ordinary functions
(setf ukk-node-parent): Private ordinary functions
(setf ukk-node-start): Private ordinary functions
(setf ukk-node-suffix): Public ordinary functions

A
add-suffix-simple: Private ordinary functions
ascii-char-code: Public ordinary functions

B
bm-bad-char: Private ordinary functions
bm-good-suffix: Private ordinary functions
bm-p: Private ordinary functions
bm-pat: Private ordinary functions
bm-suffixes: Private ordinary functions
bmh-bad-char-skip: Private ordinary functions
bmh-p: Private ordinary functions
bmh-pat: Private ordinary functions
bmh-pat-len: Private ordinary functions
bmh8-bad-char-skip: Private ordinary functions
bmh8-p: Public ordinary functions
bmh8-pat: Public ordinary functions
bmh8-pat-len: Private ordinary functions
branch: Private ordinary functions
build-suffix-tree-mccreight: Private ordinary functions
build-suffix-tree-simple: Public ordinary functions
build-suffix-tree-ukkonen: Public ordinary functions

C
canonize: Private ordinary functions
check-rk-lv: Private ordinary functions
check-rk-mk: Private ordinary functions
compile-re: Public ordinary functions
compile-set: Private ordinary functions
compute-failure-function: Private ordinary functions
copy-bm: Private ordinary functions
copy-bmh: Private ordinary functions
copy-bmh8: Private ordinary functions
copy-kmp: Private ordinary functions
copy-re-thread: Private ordinary functions
copy-rk: Private ordinary functions
copy-sor: Private ordinary functions
copy-suffix-node: Private ordinary functions
copy-suffix-tree: Private ordinary functions
copy-tabac: Private ordinary functions
copy-trie-node: Private ordinary functions
copy-ub-line-reader: Private ordinary functions
copy-ukk-node: Private ordinary functions

D
define-bmh-matcher: Public macros
define-brute-matcher: Public macros

E
empty-trie: Public ordinary functions
escape: Private ordinary functions

F
find-re: Public ordinary functions
format-name: Private ordinary functions
Function, %ub-string-compare: Private ordinary functions
Function, (setf bm-bad-char): Private ordinary functions
Function, (setf bm-good-suffix): Private ordinary functions
Function, (setf bm-pat): Private ordinary functions
Function, (setf bmh-bad-char-skip): Private ordinary functions
Function, (setf bmh-pat): Private ordinary functions
Function, (setf bmh-pat-len): Private ordinary functions
Function, (setf bmh8-bad-char-skip): Private ordinary functions
Function, (setf bmh8-pat): Public ordinary functions
Function, (setf bmh8-pat-len): Private ordinary functions
Function, (setf kmp-pat): Private ordinary functions
Function, (setf kmp-pat-len): Private ordinary functions
Function, (setf kmp-table): Private ordinary functions
Function, (setf re-thread-groups): Private ordinary functions
Function, (setf re-thread-pc): Private ordinary functions
Function, (setf re-thread-sp): Private ordinary functions
Function, (setf re-thread-stack): Private ordinary functions
Function, (setf rk-alph-size): Private ordinary functions
Function, (setf rk-pat): Private ordinary functions
Function, (setf rk-pat-hash): Private ordinary functions
Function, (setf rk-pat-len): Private ordinary functions
Function, (setf rk-rm): Private ordinary functions
Function, (setf sor-cidx): Private ordinary functions
Function, (setf sor-lim): Private ordinary functions
Function, (setf sor-pat-len): Private ordinary functions
Function, (setf suffix-node-children): Public ordinary functions
Function, (setf suffix-node-end): Public ordinary functions
Function, (setf suffix-node-id): Private ordinary functions
Function, (setf suffix-node-parent): Private ordinary functions
Function, (setf suffix-node-start): Public ordinary functions
Function, (setf suffix-tree-nodes-count): Private ordinary functions
Function, (setf suffix-tree-root): Public ordinary functions
Function, (setf suffix-tree-str): Public ordinary functions
Function, (setf tabac-final): Private ordinary functions
Function, (setf tabac-match-len): Private ordinary functions
Function, (setf tabac-start): Private ordinary functions
Function, (setf tabac-trans): Private ordinary functions
Function, (setf trie-node-children): Private ordinary functions
Function, (setf trie-node-depth): Private ordinary functions
Function, (setf trie-node-fail): Private ordinary functions
Function, (setf trie-node-id): Private ordinary functions
Function, (setf trie-node-label): Private ordinary functions
Function, (setf trie-node-mark): Private ordinary functions
Function, (setf ub-line-reader-buffer): Private ordinary functions
Function, (setf ub-line-reader-eof): Private ordinary functions
Function, (setf ub-line-reader-fill): Private ordinary functions
Function, (setf ub-line-reader-pos): Private ordinary functions
Function, (setf ub-line-reader-stream): Private ordinary functions
Function, (setf ukk-node-children): Private ordinary functions
Function, (setf ukk-node-end): Private ordinary functions
Function, (setf ukk-node-id): Private ordinary functions
Function, (setf ukk-node-parent): Private ordinary functions
Function, (setf ukk-node-start): Private ordinary functions
Function, (setf ukk-node-suffix): Public ordinary functions
Function, add-suffix-simple: Private ordinary functions
Function, ascii-char-code: Public ordinary functions
Function, bm-bad-char: Private ordinary functions
Function, bm-good-suffix: Private ordinary functions
Function, bm-p: Private ordinary functions
Function, bm-pat: Private ordinary functions
Function, bm-suffixes: Private ordinary functions
Function, bmh-bad-char-skip: Private ordinary functions
Function, bmh-p: Private ordinary functions
Function, bmh-pat: Private ordinary functions
Function, bmh-pat-len: Private ordinary functions
Function, bmh8-bad-char-skip: Private ordinary functions
Function, bmh8-p: Public ordinary functions
Function, bmh8-pat: Public ordinary functions
Function, bmh8-pat-len: Private ordinary functions
Function, branch: Private ordinary functions
Function, build-suffix-tree-mccreight: Private ordinary functions
Function, build-suffix-tree-simple: Public ordinary functions
Function, build-suffix-tree-ukkonen: Public ordinary functions
Function, canonize: Private ordinary functions
Function, check-rk-lv: Private ordinary functions
Function, check-rk-mk: Private ordinary functions
Function, compile-re: Public ordinary functions
Function, compile-set: Private ordinary functions
Function, compute-failure-function: Private ordinary functions
Function, copy-bm: Private ordinary functions
Function, copy-bmh: Private ordinary functions
Function, copy-bmh8: Private ordinary functions
Function, copy-kmp: Private ordinary functions
Function, copy-re-thread: Private ordinary functions
Function, copy-rk: Private ordinary functions
Function, copy-sor: Private ordinary functions
Function, copy-suffix-node: Private ordinary functions
Function, copy-suffix-tree: Private ordinary functions
Function, copy-tabac: Private ordinary functions
Function, copy-trie-node: Private ordinary functions
Function, copy-ub-line-reader: Private ordinary functions
Function, copy-ukk-node: Private ordinary functions
Function, empty-trie: Public ordinary functions
Function, escape: Private ordinary functions
Function, find-re: Public ordinary functions
Function, format-name: Private ordinary functions
Function, hash-bm: Private ordinary functions
Function, hex-char-p: Private ordinary functions
Function, horner-hash: Private ordinary functions
Function, initialize-ac: Public ordinary functions
Function, initialize-bad-char: Private ordinary functions
Function, initialize-bm: Public ordinary functions
Function, initialize-bmh: Public ordinary functions
Function, initialize-bmh8: Public ordinary functions
Function, initialize-good-suffix: Private ordinary functions
Function, initialize-kmp: Public ordinary functions
Function, initialize-rk: Public ordinary functions
Function, initialize-sor: Public ordinary functions
Function, initialize-tabac: Public ordinary functions
Function, kmp-p: Private ordinary functions
Function, kmp-pat: Private ordinary functions
Function, kmp-pat-len: Private ordinary functions
Function, kmp-table: Private ordinary functions
Function, make-bm: Private ordinary functions
Function, make-bmh: Private ordinary functions
Function, make-bmh8: Private ordinary functions
Function, make-kmp: Private ordinary functions
Function, make-lambda-ac: Private ordinary functions
Function, make-re-thread: Private ordinary functions
Function, make-rk: Private ordinary functions
Function, make-sor: Private ordinary functions
Function, make-substitution-table: Public ordinary functions
Function, make-suffix-node: Public ordinary functions
Function, make-suffix-tree: Public ordinary functions
Function, make-tabac: Private ordinary functions
Function, make-trie-node: Private ordinary functions
Function, make-ub-buffer: Public ordinary functions
Function, make-ub-line-reader: Public ordinary functions
Function, make-ub-string: Public ordinary functions
Function, make-ukk-node: Public ordinary functions
Function, match-re: Public ordinary functions
Function, newline-p: Private ordinary functions
Function, octets-to-ub: Public ordinary functions
Function, prefixed-with: Public ordinary functions
Function, print-markdown-footer: Private ordinary functions
Function, print-suffix-tree-for-gv: Private ordinary functions
Function, print-suffix-tree-for-gv-pretty: Private ordinary functions
Function, print-suffix-tree-in-file: Private ordinary functions
Function, punctuation-p: Private ordinary functions
Function, re-thread-groups: Private ordinary functions
Function, re-thread-p: Private ordinary functions
Function, re-thread-pc: Private ordinary functions
Function, re-thread-sp: Private ordinary functions
Function, re-thread-stack: Private ordinary functions
Function, ref-length: Private ordinary functions
Function, replace-re: Public ordinary functions
Function, rk-alph-size: Private ordinary functions
Function, rk-p: Private ordinary functions
Function, rk-pat: Private ordinary functions
Function, rk-pat-hash: Private ordinary functions
Function, rk-pat-len: Private ordinary functions
Function, rk-rm: Private ordinary functions
Function, run: Private ordinary functions
Function, search-ac: Public ordinary functions
Function, search-bm: Public ordinary functions
Function, search-bmh: Public ordinary functions
Function, search-bmh8: Public ordinary functions
Function, search-compiled-ac: Public ordinary functions
Function, search-kmp: Public ordinary functions
Function, search-rk: Public ordinary functions
Function, search-sor: Public ordinary functions
Function, search-tabac: Public ordinary functions
Function, sor-cidx: Private ordinary functions
Function, sor-lim: Private ordinary functions
Function, sor-p: Private ordinary functions
Function, sor-pat-len: Private ordinary functions
Function, sor-printer: Private ordinary functions
Function, space-p: Private ordinary functions
Function, split-node: Private ordinary functions
Function, split-re: Public ordinary functions
Function, stbstr: Private ordinary functions
Function, str-length: Private ordinary functions
Function, string-contains-ac: Public ordinary functions
Function, string-contains-bm: Public ordinary functions
Function, string-contains-bmh: Public ordinary functions
Function, string-contains-bmh8: Public ordinary functions
Function, string-contains-brute: Public ordinary functions
Function, string-contains-brute-ub: Public ordinary functions
Function, string-contains-kmp: Public ordinary functions
Function, string-contains-rk: Public ordinary functions
Function, string-contains-sor: Public ordinary functions
Function, string-contains-tabac: Public ordinary functions
Function, string-to-ub: Public ordinary functions
Function, suffix-node-add-child: Public ordinary functions
Function, suffix-node-children: Public ordinary functions
Function, suffix-node-end: Public ordinary functions
Function, suffix-node-equals: Public ordinary functions
Function, suffix-node-get-child: Private ordinary functions
Function, suffix-node-id: Private ordinary functions
Function, suffix-node-insert-child: Private ordinary functions
Function, suffix-node-leafp: Public ordinary functions
Function, suffix-node-map-over-children: Public ordinary functions
Function, suffix-node-p: Private ordinary functions
Function, suffix-node-parent: Private ordinary functions
Function, suffix-node-printer: Private ordinary functions
Function, suffix-node-start: Public ordinary functions
Function, suffix-node-str: Public ordinary functions
Function, suffix-tree-build-from-sexp: Public ordinary functions
Function, suffix-tree-char: Public ordinary functions
Function, suffix-tree-equals: Public ordinary functions
Function, suffix-tree-nodes-count: Private ordinary functions
Function, suffix-tree-p: Private ordinary functions
Function, suffix-tree-printer: Private ordinary functions
Function, suffix-tree-root: Public ordinary functions
Function, suffix-tree-str: Public ordinary functions
Function, suffix-tree-walk: Public ordinary functions
Function, suffixed-with: Public ordinary functions
Function, tab-p: Private ordinary functions
Function, tabac-final: Private ordinary functions
Function, tabac-match-len: Private ordinary functions
Function, tabac-p: Private ordinary functions
Function, tabac-start: Private ordinary functions
Function, tabac-trans: Private ordinary functions
Function, tabac-transition: Private ordinary functions
Function, trie->compiled-ac: Public ordinary functions
Function, trie->tabular-ac: Public ordinary functions
Function, trie-add-child: Private ordinary functions
Function, trie-add-keyword: Public ordinary functions
Function, trie-build: Public ordinary functions
Function, trie-contains: Public ordinary functions
Function, trie-contains-prefix: Public ordinary functions
Function, trie-dump-dot: Private ordinary functions
Function, trie-dump-dot-file: Private ordinary functions
Function, trie-find-child: Private ordinary functions
Function, trie-node-children: Private ordinary functions
Function, trie-node-depth: Private ordinary functions
Function, trie-node-fail: Private ordinary functions
Function, trie-node-id: Private ordinary functions
Function, trie-node-label: Private ordinary functions
Function, trie-node-mark: Private ordinary functions
Function, trie-node-p: Private ordinary functions
Function, trie-node-printer: Private ordinary functions
Function, trie-pprint: Public ordinary functions
Function, trie-traverse-bfo: Public ordinary functions
Function, trie-traverse-dfo: Public ordinary functions
Function, ub-alpha-char-p: Public ordinary functions
Function, ub-alphanumericp: Public ordinary functions
Function, ub-both-case-p: Public ordinary functions
Function, ub-char: Public ordinary functions
Function, ub-char-code: Public ordinary functions
Function, ub-char-downcase: Public ordinary functions
Function, ub-char-equal: Public ordinary functions
Function, ub-char-greaterp: Public ordinary functions
Function, ub-char-int: Public ordinary functions
Function, ub-char-lessp: Public ordinary functions
Function, ub-char-name: Public ordinary functions
Function, ub-char-not-equal: Public ordinary functions
Function, ub-char-not-greaterp: Public ordinary functions
Function, ub-char-not-lessp: Public ordinary functions
Function, ub-char-upcase: Public ordinary functions
Function, ub-char/=: Public ordinary functions
Function, ub-char<: Public ordinary functions
Function, ub-char<=: Public ordinary functions
Function, ub-char=: Public ordinary functions
Function, ub-char>: Public ordinary functions
Function, ub-char>=: Public ordinary functions
Function, ub-code-char: Public ordinary functions
Function, ub-digit-char: Public ordinary functions
Function, ub-digit-char-p: Public ordinary functions
Function, ub-graphic-char-p: Public ordinary functions
Function, ub-line-reader-buffer: Private ordinary functions
Function, ub-line-reader-close: Public ordinary functions
Function, ub-line-reader-eof: Private ordinary functions
Function, ub-line-reader-file-position: Public ordinary functions
Function, ub-line-reader-fill: Private ordinary functions
Function, ub-line-reader-p: Private ordinary functions
Function, ub-line-reader-pos: Private ordinary functions
Function, ub-line-reader-stream: Private ordinary functions
Function, ub-lower-case-p: Public ordinary functions
Function, ub-name-char: Public ordinary functions
Function, ub-nstring-capitalize: Public ordinary functions
Function, ub-nstring-downcase: Public ordinary functions
Function, ub-nstring-upcase: Public ordinary functions
Function, ub-read-line: Public ordinary functions
Function, ub-read-line-raw: Public ordinary functions
Function, ub-read-line-string: Public ordinary functions
Function, ub-schar: Private ordinary functions
Function, ub-standard-char-p: Public ordinary functions
Function, ub-string-capitalize: Public ordinary functions
Function, ub-string-downcase: Public ordinary functions
Function, ub-string-equal: Public ordinary functions
Function, ub-string-greaterp: Public ordinary functions
Function, ub-string-left-trim: Public ordinary functions
Function, ub-string-lessp: Public ordinary functions
Function, ub-string-not-equal: Public ordinary functions
Function, ub-string-not-greaterp: Public ordinary functions
Function, ub-string-not-lessp: Public ordinary functions
Function, ub-string-right-trim: Public ordinary functions
Function, ub-string-trim: Public ordinary functions
Function, ub-string-upcase: Public ordinary functions
Function, ub-string/=: Public ordinary functions
Function, ub-string<: Public ordinary functions
Function, ub-string<=: Public ordinary functions
Function, ub-string=: Public ordinary functions
Function, ub-string>: Public ordinary functions
Function, ub-string>=: Public ordinary functions
Function, ub-subseq: Public ordinary functions
Function, ub-to-string: Public ordinary functions
Function, ub-upper-case-p: Public ordinary functions
Function, ukk-node-children: Private ordinary functions
Function, ukk-node-end: Private ordinary functions
Function, ukk-node-id: Private ordinary functions
Function, ukk-node-p: Private ordinary functions
Function, ukk-node-parent: Private ordinary functions
Function, ukk-node-start: Private ordinary functions
Function, ukk-node-suffix: Public ordinary functions
Function, ukkonen-update: Private ordinary functions
Function, update-md: Private ordinary functions
Function, word-char-p: Private ordinary functions

G
Generic Function, match-groups: Public generic functions
Generic Function, match-pos-end: Public generic functions
Generic Function, match-pos-start: Public generic functions
Generic Function, match-string: Public generic functions
Generic Function, re-expression: Private generic functions
Generic Function, re-pattern: Private generic functions

H
hash-bm: Private ordinary functions
hex-char-p: Private ordinary functions
horner-hash: Private ordinary functions

I
initialize-ac: Public ordinary functions
initialize-bad-char: Private ordinary functions
initialize-bm: Public ordinary functions
initialize-bmh: Public ordinary functions
initialize-bmh8: Public ordinary functions
initialize-good-suffix: Private ordinary functions
initialize-kmp: Public ordinary functions
initialize-rk: Public ordinary functions
initialize-sor: Public ordinary functions
initialize-tabac: Public ordinary functions

K
kmp-p: Private ordinary functions
kmp-pat: Private ordinary functions
kmp-pat-len: Private ordinary functions
kmp-table: Private ordinary functions

M
Macro, define-bmh-matcher: Public macros
Macro, define-brute-matcher: Public macros
Macro, map-trie-children: Private macros
Macro, ub-string<>=*-body: Private macros
Macro, with-re: Public macros
Macro, with-re-match: Public macros
make-bm: Private ordinary functions
make-bmh: Private ordinary functions
make-bmh8: Private ordinary functions
make-kmp: Private ordinary functions
make-lambda-ac: Private ordinary functions
make-load-form: Public standalone methods
make-re-thread: Private ordinary functions
make-rk: Private ordinary functions
make-sor: Private ordinary functions
make-substitution-table: Public ordinary functions
make-suffix-node: Public ordinary functions
make-suffix-tree: Public ordinary functions
make-tabac: Private ordinary functions
make-trie-node: Private ordinary functions
make-ub-buffer: Public ordinary functions
make-ub-line-reader: Public ordinary functions
make-ub-string: Public ordinary functions
make-ukk-node: Public ordinary functions
map-trie-children: Private macros
match-groups: Public generic functions
match-groups: Public generic functions
match-pos-end: Public generic functions
match-pos-end: Public generic functions
match-pos-start: Public generic functions
match-pos-start: Public generic functions
match-re: Public ordinary functions
match-string: Public generic functions
match-string: Public generic functions
Method, make-load-form: Public standalone methods
Method, match-groups: Public generic functions
Method, match-pos-end: Public generic functions
Method, match-pos-start: Public generic functions
Method, match-string: Public generic functions
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, re-expression: Private generic functions
Method, re-pattern: Private generic functions

N
newline-p: Private ordinary functions

O
octets-to-ub: Public ordinary functions

P
prefixed-with: Public ordinary functions
print-markdown-footer: Private ordinary functions
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods
print-suffix-tree-for-gv: Private ordinary functions
print-suffix-tree-for-gv-pretty: Private ordinary functions
print-suffix-tree-in-file: Private ordinary functions
punctuation-p: Private ordinary functions

R
re-expression: Private generic functions
re-expression: Private generic functions
re-pattern: Private generic functions
re-pattern: Private generic functions
re-thread-groups: Private ordinary functions
re-thread-p: Private ordinary functions
re-thread-pc: Private ordinary functions
re-thread-sp: Private ordinary functions
re-thread-stack: Private ordinary functions
ref-length: Private ordinary functions
replace-re: Public ordinary functions
rk-alph-size: Private ordinary functions
rk-p: Private ordinary functions
rk-pat: Private ordinary functions
rk-pat-hash: Private ordinary functions
rk-pat-len: Private ordinary functions
rk-rm: Private ordinary functions
run: Private ordinary functions

S
search-ac: Public ordinary functions
search-bm: Public ordinary functions
search-bmh: Public ordinary functions
search-bmh8: Public ordinary functions
search-compiled-ac: Public ordinary functions
search-kmp: Public ordinary functions
search-rk: Public ordinary functions
search-sor: Public ordinary functions
search-tabac: Public ordinary functions
sor-cidx: Private ordinary functions
sor-lim: Private ordinary functions
sor-p: Private ordinary functions
sor-pat-len: Private ordinary functions
sor-printer: Private ordinary functions
space-p: Private ordinary functions
split-node: Private ordinary functions
split-re: Public ordinary functions
stbstr: Private ordinary functions
str-length: Private ordinary functions
string-contains-ac: Public ordinary functions
string-contains-bm: Public ordinary functions
string-contains-bmh: Public ordinary functions
string-contains-bmh8: Public ordinary functions
string-contains-brute: Public ordinary functions
string-contains-brute-ub: Public ordinary functions
string-contains-kmp: Public ordinary functions
string-contains-rk: Public ordinary functions
string-contains-sor: Public ordinary functions
string-contains-tabac: Public ordinary functions
string-to-ub: Public ordinary functions
suffix-node-add-child: Public ordinary functions
suffix-node-children: Public ordinary functions
suffix-node-end: Public ordinary functions
suffix-node-equals: Public ordinary functions
suffix-node-get-child: Private ordinary functions
suffix-node-id: Private ordinary functions
suffix-node-insert-child: Private ordinary functions
suffix-node-leafp: Public ordinary functions
suffix-node-map-over-children: Public ordinary functions
suffix-node-p: Private ordinary functions
suffix-node-parent: Private ordinary functions
suffix-node-printer: Private ordinary functions
suffix-node-start: Public ordinary functions
suffix-node-str: Public ordinary functions
suffix-tree-build-from-sexp: Public ordinary functions
suffix-tree-char: Public ordinary functions
suffix-tree-equals: Public ordinary functions
suffix-tree-nodes-count: Private ordinary functions
suffix-tree-p: Private ordinary functions
suffix-tree-printer: Private ordinary functions
suffix-tree-root: Public ordinary functions
suffix-tree-str: Public ordinary functions
suffix-tree-walk: Public ordinary functions
suffixed-with: Public ordinary functions

T
tab-p: Private ordinary functions
tabac-final: Private ordinary functions
tabac-match-len: Private ordinary functions
tabac-p: Private ordinary functions
tabac-start: Private ordinary functions
tabac-trans: Private ordinary functions
tabac-transition: Private ordinary functions
trie->compiled-ac: Public ordinary functions
trie->tabular-ac: Public ordinary functions
trie-add-child: Private ordinary functions
trie-add-keyword: Public ordinary functions
trie-build: Public ordinary functions
trie-contains: Public ordinary functions
trie-contains-prefix: Public ordinary functions
trie-dump-dot: Private ordinary functions
trie-dump-dot-file: Private ordinary functions
trie-find-child: Private ordinary functions
trie-node-children: Private ordinary functions
trie-node-depth: Private ordinary functions
trie-node-fail: Private ordinary functions
trie-node-id: Private ordinary functions
trie-node-label: Private ordinary functions
trie-node-mark: Private ordinary functions
trie-node-p: Private ordinary functions
trie-node-printer: Private ordinary functions
trie-pprint: Public ordinary functions
trie-traverse-bfo: Public ordinary functions
trie-traverse-dfo: Public ordinary functions

U
ub-alpha-char-p: Public ordinary functions
ub-alphanumericp: Public ordinary functions
ub-both-case-p: Public ordinary functions
ub-char: Public ordinary functions
ub-char-code: Public ordinary functions
ub-char-downcase: Public ordinary functions
ub-char-equal: Public ordinary functions
ub-char-greaterp: Public ordinary functions
ub-char-int: Public ordinary functions
ub-char-lessp: Public ordinary functions
ub-char-name: Public ordinary functions
ub-char-not-equal: Public ordinary functions
ub-char-not-greaterp: Public ordinary functions
ub-char-not-lessp: Public ordinary functions
ub-char-upcase: Public ordinary functions
ub-char/=: Public ordinary functions
ub-char<: Public ordinary functions
ub-char<=: Public ordinary functions
ub-char=: Public ordinary functions
ub-char>: Public ordinary functions
ub-char>=: Public ordinary functions
ub-code-char: Public ordinary functions
ub-digit-char: Public ordinary functions
ub-digit-char-p: Public ordinary functions
ub-graphic-char-p: Public ordinary functions
ub-line-reader-buffer: Private ordinary functions
ub-line-reader-close: Public ordinary functions
ub-line-reader-eof: Private ordinary functions
ub-line-reader-file-position: Public ordinary functions
ub-line-reader-fill: Private ordinary functions
ub-line-reader-p: Private ordinary functions
ub-line-reader-pos: Private ordinary functions
ub-line-reader-stream: Private ordinary functions
ub-lower-case-p: Public ordinary functions
ub-name-char: Public ordinary functions
ub-nstring-capitalize: Public ordinary functions
ub-nstring-downcase: Public ordinary functions
ub-nstring-upcase: Public ordinary functions
ub-read-line: Public ordinary functions
ub-read-line-raw: Public ordinary functions
ub-read-line-string: Public ordinary functions
ub-schar: Private ordinary functions
ub-standard-char-p: Public ordinary functions
ub-string-capitalize: Public ordinary functions
ub-string-downcase: Public ordinary functions
ub-string-equal: Public ordinary functions
ub-string-greaterp: Public ordinary functions
ub-string-left-trim: Public ordinary functions
ub-string-lessp: Public ordinary functions
ub-string-not-equal: Public ordinary functions
ub-string-not-greaterp: Public ordinary functions
ub-string-not-lessp: Public ordinary functions
ub-string-right-trim: Public ordinary functions
ub-string-trim: Public ordinary functions
ub-string-upcase: Public ordinary functions
ub-string/=: Public ordinary functions
ub-string<: Public ordinary functions
ub-string<=: Public ordinary functions
ub-string<>=*-body: Private macros
ub-string=: Public ordinary functions
ub-string>: Public ordinary functions
ub-string>=: Public ordinary functions
ub-subseq: Public ordinary functions
ub-to-string: Public ordinary functions
ub-upper-case-p: Public ordinary functions
ukk-node-children: Private ordinary functions
ukk-node-end: Private ordinary functions
ukk-node-id: Private ordinary functions
ukk-node-p: Private ordinary functions
ukk-node-parent: Private ordinary functions
ukk-node-start: Private ordinary functions
ukk-node-suffix: Public ordinary functions
ukkonen-update: Private ordinary functions
update-md: Private ordinary functions

W
with-re: Public macros
with-re-match: Public macros
word-char-p: Private ordinary functions


A.3 Variables

Jump to:   *   +   @  
A   B   C   D   E   F   G   I   L   M   N   P   R   S   T   U  
Index Entry  Section

*
*default-substitution-table*: Private special variables
*expression-parser*: Private special variables
*set-parser*: Private special variables
*standard-debug-settings*: Private special variables
*standard-optimize-settings*: Private special variables

+
+ac-alphabet+: Private constants
+alph-size+: Private constants
+big-prime+: Private constants
+infinity+: Public constants
+newline+: Private constants
+sor-alphabet+: Private constants
+ub-line-reader-buffer-size+: Private constants

@
@aho-corasick-section: Private special variables
@boyer-moore-horspool-section: Private special variables
@boyer-moore-section: Private special variables
@brute-force-section: Private special variables
@cl-string-match-manual: Private special variables
@knuth-morris-pratt-section: Private special variables
@multi-pattern-search: Private special variables
@pre-basic-matching-section: Private special variables
@pre-compiling-patterns-section: Private special variables
@pre-groups-section: Private special variables
@pre-pattern-replacing-section: Private special variables
@pre-pattern-scanning-section: Private special variables
@pre-pattern-splitting-section: Private special variables
@pre-regexp-section: Private special variables
@pre-with-re-match-section: Private special variables
@rabin-karp-section: Private special variables
@regexp-pattern-search: Private special variables
@shift-or-section: Private special variables
@single-pattern-search: Private special variables

A
alph-size: Private structures

B
bad-char: Private structures
bad-char-skip: Public structures
bad-char-skip: Private structures
buffer: Private structures

C
children: Public structures
children: Public structures
cidx: Private structures
Constant, +ac-alphabet+: Private constants
Constant, +alph-size+: Private constants
Constant, +big-prime+: Private constants
Constant, +infinity+: Public constants
Constant, +newline+: Private constants
Constant, +sor-alphabet+: Private constants
Constant, +ub-line-reader-buffer-size+: Private constants
Constant, ub-char-code-limit: Public constants

D
depth: Public structures

E
end: Public structures
end-pos: Public classes
eof: Private structures
expr: Public classes

F
fail: Public structures
fill: Private structures
final: Private structures

G
good-suffix: Private structures
groups: Public classes
groups: Private structures

I
id: Public structures
id: Public structures

L
label: Public structures
lim: Private structures

M
mark: Public structures
match: Public classes
match-len: Private structures

N
nodes-count: Public structures

P
parent: Public structures
pat: Public structures
pat: Private structures
pat: Private structures
pat: Private structures
pat: Private structures
pat-hash: Private structures
pat-len: Public structures
pat-len: Private structures
pat-len: Private structures
pat-len: Private structures
pat-len: Private structures
pattern: Public classes
pc: Private structures
pos: Private structures

R
rm: Private structures
root: Public structures

S
Slot, alph-size: Private structures
Slot, bad-char: Private structures
Slot, bad-char-skip: Public structures
Slot, bad-char-skip: Private structures
Slot, buffer: Private structures
Slot, children: Public structures
Slot, children: Public structures
Slot, cidx: Private structures
Slot, depth: Public structures
Slot, end: Public structures
Slot, end-pos: Public classes
Slot, eof: Private structures
Slot, expr: Public classes
Slot, fail: Public structures
Slot, fill: Private structures
Slot, final: Private structures
Slot, good-suffix: Private structures
Slot, groups: Public classes
Slot, groups: Private structures
Slot, id: Public structures
Slot, id: Public structures
Slot, label: Public structures
Slot, lim: Private structures
Slot, mark: Public structures
Slot, match: Public classes
Slot, match-len: Private structures
Slot, nodes-count: Public structures
Slot, parent: Public structures
Slot, pat: Public structures
Slot, pat: Private structures
Slot, pat: Private structures
Slot, pat: Private structures
Slot, pat: Private structures
Slot, pat-hash: Private structures
Slot, pat-len: Public structures
Slot, pat-len: Private structures
Slot, pat-len: Private structures
Slot, pat-len: Private structures
Slot, pat-len: Private structures
Slot, pattern: Public classes
Slot, pc: Private structures
Slot, pos: Private structures
Slot, rm: Private structures
Slot, root: Public structures
Slot, sp: Private structures
Slot, stack: Private structures
Slot, start: Public structures
Slot, start: Private structures
Slot, start-pos: Public classes
Slot, str: Public structures
Slot, stream: Private structures
Slot, suffix: Public structures
Slot, table: Private structures
Slot, trans: Private structures
sp: Private structures
Special Variable, *default-substitution-table*: Private special variables
Special Variable, *expression-parser*: Private special variables
Special Variable, *set-parser*: Private special variables
Special Variable, *standard-debug-settings*: Private special variables
Special Variable, *standard-optimize-settings*: Private special variables
Special Variable, @aho-corasick-section: Private special variables
Special Variable, @boyer-moore-horspool-section: Private special variables
Special Variable, @boyer-moore-section: Private special variables
Special Variable, @brute-force-section: Private special variables
Special Variable, @cl-string-match-manual: Private special variables
Special Variable, @knuth-morris-pratt-section: Private special variables
Special Variable, @multi-pattern-search: Private special variables
Special Variable, @pre-basic-matching-section: Private special variables
Special Variable, @pre-compiling-patterns-section: Private special variables
Special Variable, @pre-groups-section: Private special variables
Special Variable, @pre-pattern-replacing-section: Private special variables
Special Variable, @pre-pattern-scanning-section: Private special variables
Special Variable, @pre-pattern-splitting-section: Private special variables
Special Variable, @pre-regexp-section: Private special variables
Special Variable, @pre-with-re-match-section: Private special variables
Special Variable, @rabin-karp-section: Private special variables
Special Variable, @regexp-pattern-search: Private special variables
Special Variable, @shift-or-section: Private special variables
Special Variable, @single-pattern-search: Private special variables
stack: Private structures
start: Public structures
start: Private structures
start-pos: Public classes
str: Public structures
stream: Private structures
suffix: Public structures

T
table: Private structures
trans: Private structures

U
ub-char-code-limit: Public constants


A.4 Data types

Jump to:   A   B   C   D   F   K   M   P   R   S   T   U  
Index Entry  Section

A
aho-corasick.lisp: The cl-string-match/src/aho-corasick․lisp file
ascii-strings: The ascii-strings system
ascii-strings: The ascii-strings package
ascii-strings.asd: The ascii-strings/ascii-strings․asd file
ascii-strings.lisp: The ascii-strings/contrib/ascii-strings․lisp file
ascii-strings.system: The ascii-strings․system package

B
bm: Private structures
bmh: Private structures
bmh8: Public structures
boyer-moore-horspool.lisp: The cl-string-match/src/boyer-moore-horspool․lisp file
boyer-moore.lisp: The cl-string-match/src/boyer-moore․lisp file
brute-force.lisp: The cl-string-match/src/brute-force․lisp file

C
cl-string-match: The cl-string-match system
cl-string-match: The cl-string-match package
cl-string-match.asd: The cl-string-match/cl-string-match․asd file
Class, re: Public classes
Class, re-match: Public classes
clstringmatch.system: The clstringmatch․system package
compiled-aho-corasick.lisp: The cl-string-match/src/compiled-aho-corasick․lisp file
contrib: The ascii-strings/contrib module

D
doc.lisp: The cl-string-match/src/doc․lisp file

F
File, aho-corasick.lisp: The cl-string-match/src/aho-corasick․lisp file
File, ascii-strings.asd: The ascii-strings/ascii-strings․asd file
File, ascii-strings.lisp: The ascii-strings/contrib/ascii-strings․lisp file
File, boyer-moore-horspool.lisp: The cl-string-match/src/boyer-moore-horspool․lisp file
File, boyer-moore.lisp: The cl-string-match/src/boyer-moore․lisp file
File, brute-force.lisp: The cl-string-match/src/brute-force․lisp file
File, cl-string-match.asd: The cl-string-match/cl-string-match․asd file
File, compiled-aho-corasick.lisp: The cl-string-match/src/compiled-aho-corasick․lisp file
File, doc.lisp: The cl-string-match/src/doc․lisp file
File, knuth-morris-pratt.lisp: The cl-string-match/src/knuth-morris-pratt․lisp file
File, package.lisp: The cl-string-match/src/package․lisp file
File, pre.lisp: The cl-string-match/src/pre․lisp file
File, rabin-karp.lisp: The cl-string-match/src/rabin-karp․lisp file
File, shift-or.lisp: The cl-string-match/src/shift-or․lisp file
File, suffix-tree.lisp: The cl-string-match/src/suffix-tree․lisp file
File, utils.lisp: The cl-string-match/src/utils․lisp file

K
kmp: Private structures
knuth-morris-pratt.lisp: The cl-string-match/src/knuth-morris-pratt․lisp file

M
Module, contrib: The ascii-strings/contrib module
Module, src: The cl-string-match/src module

P
Package, ascii-strings: The ascii-strings package
Package, ascii-strings.system: The ascii-strings․system package
Package, cl-string-match: The cl-string-match package
Package, clstringmatch.system: The clstringmatch․system package
package.lisp: The cl-string-match/src/package․lisp file
pre.lisp: The cl-string-match/src/pre․lisp file

R
rabin-karp.lisp: The cl-string-match/src/rabin-karp․lisp file
re: Public classes
re-match: Public classes
re-thread: Private structures
rk: Private structures
rk-ub32: Private types

S
shift-or.lisp: The cl-string-match/src/shift-or․lisp file
sor: Private structures
sor-ub32: Private types
src: The cl-string-match/src module
Structure, bm: Private structures
Structure, bmh: Private structures
Structure, bmh8: Public structures
Structure, kmp: Private structures
Structure, re-thread: Private structures
Structure, rk: Private structures
Structure, sor: Private structures
Structure, suffix-node: Public structures
Structure, suffix-tree: Public structures
Structure, tabac: Private structures
Structure, trie-node: Public structures
Structure, ub-line-reader: Private structures
Structure, ukk-node: Public structures
suffix-node: Public structures
suffix-tree: Public structures
suffix-tree.lisp: The cl-string-match/src/suffix-tree․lisp file
System, ascii-strings: The ascii-strings system
System, cl-string-match: The cl-string-match system

T
tabac: Private structures
trie-node: Public structures
Type, rk-ub32: Private types
Type, sor-ub32: Private types
Type, ub-buffer: Public types
Type, ub-char: Public types
Type, ub-string: Public types

U
ub-buffer: Public types
ub-char: Public types
ub-line-reader: Private structures
ub-string: Public types
ukk-node: Public structures
utils.lisp: The cl-string-match/src/utils․lisp file