aboutsummaryrefslogtreecommitdiff
path: root/src/regex/regex_internal.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/regex/regex_internal.c')
-rw-r--r--src/regex/regex_internal.c10
1 files changed, 5 insertions, 5 deletions
diff --git a/src/regex/regex_internal.c b/src/regex/regex_internal.c
index cd33281e2..aa40851a9 100644
--- a/src/regex/regex_internal.c
+++ b/src/regex/regex_internal.c
@@ -1562,7 +1562,7 @@ automaton_create_proofs_simplify (const struct StringBuffer *R_last_ij,
1562 1562
1563/** 1563/**
1564 * Create proofs for all states in the given automaton. Implementation of the 1564 * Create proofs for all states in the given automaton. Implementation of the
1565 * algorithm descriped in chapter 3.2.1 of "Automata Theory, Languages, and 1565 * algorithm described in chapter 3.2.1 of "Automata Theory, Languages, and
1566 * Computation 3rd Edition" by Hopcroft, Motwani and Ullman. 1566 * Computation 3rd Edition" by Hopcroft, Motwani and Ullman.
1567 * 1567 *
1568 * Each state in the automaton gets assigned 'proof' and 'hash' (hash of the 1568 * Each state in the automaton gets assigned 'proof' and 'hash' (hash of the
@@ -1796,7 +1796,7 @@ dfa_state_create (struct REGEX_INTERNAL_Context *ctx,
1796 1796
1797/** 1797/**
1798 * Move from the given state 's' to the next state on transition 'str'. Consumes 1798 * Move from the given state 's' to the next state on transition 'str'. Consumes
1799 * as much of the given 'str' as possible (usefull for strided DFAs). On return 1799 * as much of the given 'str' as possible (useful for strided DFAs). On return
1800 * 's' will point to the next state, and the length of the substring used for 1800 * 's' will point to the next state, and the length of the substring used for
1801 * this transition will be returned. If no transition possible 0 is returned and 1801 * this transition will be returned. If no transition possible 0 is returned and
1802 * 's' points to NULL. 1802 * 's' points to NULL.
@@ -1805,7 +1805,7 @@ dfa_state_create (struct REGEX_INTERNAL_Context *ctx,
1805 * transition possible) 1805 * transition possible)
1806 * @param str edge label to follow (will match longest common prefix) 1806 * @param str edge label to follow (will match longest common prefix)
1807 * 1807 *
1808 * @return length of the substring comsumed from 'str' 1808 * @return length of the substring consumed from 'str'
1809 */ 1809 */
1810static unsigned int 1810static unsigned int
1811dfa_move (struct REGEX_INTERNAL_State **s, const char *str) 1811dfa_move (struct REGEX_INTERNAL_State **s, const char *str)
@@ -3055,7 +3055,7 @@ construct_dfa_states (struct REGEX_INTERNAL_Context *ctx,
3055 * @param len length of the regular expression. 3055 * @param len length of the regular expression.
3056 * @param max_path_len limit the path compression length to the 3056 * @param max_path_len limit the path compression length to the
3057 * given value. If set to 1, no path compression is applied. Set to 0 for 3057 * given value. If set to 1, no path compression is applied. Set to 0 for
3058 * maximal possible path compression (generally not desireable). 3058 * maximal possible path compression (generally not desirable).
3059 * @return DFA, needs to be freed using REGEX_INTERNAL_automaton_destroy. 3059 * @return DFA, needs to be freed using REGEX_INTERNAL_automaton_destroy.
3060 */ 3060 */
3061struct REGEX_INTERNAL_Automaton * 3061struct REGEX_INTERNAL_Automaton *
@@ -3525,7 +3525,7 @@ REGEX_INTERNAL_iterate_all_edges (struct REGEX_INTERNAL_Automaton *a,
3525/** 3525/**
3526 * Struct to hold all the relevant state information in the HashMap. 3526 * Struct to hold all the relevant state information in the HashMap.
3527 * 3527 *
3528 * Contains the same info as the Regex Iterator parametes except the key, 3528 * Contains the same info as the Regex Iterator parameters except the key,
3529 * which comes directly from the HashMap iterator. 3529 * which comes directly from the HashMap iterator.
3530 */ 3530 */
3531struct temporal_state_store 3531struct temporal_state_store