From 28b10c4f64f40d6019f2aec67c7e1437bc7919fc Mon Sep 17 00:00:00 2001 From: Jesper Dangaard Brouer Date: Mon, 24 Jan 2011 02:41:37 +0000 Subject: [PATCH] --- yaml --- r: 232463 b: refs/heads/master c: de0368d5fec7b9ef95228510f2edb79610beb448 h: refs/heads/master i: 232461: 3d0709aa8e678bc520e2004282575e3ff24e779b 232459: 8f94d5bfb7bfd7b7918d8eab1544c417ad29a4ac 232455: 5ed7db1b433289ca5ee3c79717897d569798c039 232447: c9e3efae039dad850c8117e4999ba1bb8fc467e6 v: v3 --- [refs] | 2 +- trunk/lib/textsearch.c | 10 +++++----- 2 files changed, 6 insertions(+), 6 deletions(-) diff --git a/[refs] b/[refs] index 73bccf39f4ab..b3245a4ebcb8 100644 --- a/[refs] +++ b/[refs] @@ -1,2 +1,2 @@ --- -refs/heads/master: 986e3f6e2b4582d9a7e61de5090042d5af85da44 +refs/heads/master: de0368d5fec7b9ef95228510f2edb79610beb448 diff --git a/trunk/lib/textsearch.c b/trunk/lib/textsearch.c index d608331b3e47..e0cc0146ae62 100644 --- a/trunk/lib/textsearch.c +++ b/trunk/lib/textsearch.c @@ -13,7 +13,7 @@ * * INTRODUCTION * - * The textsearch infrastructure provides text searching facitilies for + * The textsearch infrastructure provides text searching facilities for * both linear and non-linear data. Individual search algorithms are * implemented in modules and chosen by the user. * @@ -43,7 +43,7 @@ * to the algorithm to store persistent variables. * (4) Core eventually resets the search offset and forwards the find() * request to the algorithm. - * (5) Algorithm calls get_next_block() provided by the user continously + * (5) Algorithm calls get_next_block() provided by the user continuously * to fetch the data to be searched in block by block. * (6) Algorithm invokes finish() after the last call to get_next_block * to clean up any leftovers from get_next_block. (Optional) @@ -58,15 +58,15 @@ * the pattern to look for and flags. As a flag, you can set TS_IGNORECASE * to perform case insensitive matching. But it might slow down * performance of algorithm, so you should use it at own your risk. - * The returned configuration may then be used for an arbitary + * The returned configuration may then be used for an arbitrary * amount of times and even in parallel as long as a separate struct * ts_state variable is provided to every instance. * * The actual search is performed by either calling textsearch_find_- * continuous() for linear data or by providing an own get_next_block() * implementation and calling textsearch_find(). Both functions return - * the position of the first occurrence of the patern or UINT_MAX if - * no match was found. Subsequent occurences can be found by calling + * the position of the first occurrence of the pattern or UINT_MAX if + * no match was found. Subsequent occurrences can be found by calling * textsearch_next() regardless of the linearity of the data. * * Once you're done using a configuration it must be given back via