Donate to e Foundation | Murena handsets with /e/OS | Own a part of Murena! Learn more

Commit 7433a8d6 authored by Randy Dunlap's avatar Randy Dunlap Committed by David S. Miller
Browse files

textsearch: fix typos in library helpers



Fix spellos (typos) in textsearch library helpers.

Signed-off-by: default avatarRandy Dunlap <rdunlap@infradead.org>
Signed-off-by: default avatarDavid S. Miller <davem@davemloft.net>
parent 6cb3ece9
Loading
Loading
Loading
Loading
+1 −1
Original line number Diff line number Diff line
@@ -11,7 +11,7 @@
 * ==========================================================================
 *
 *   A finite state machine consists of n states (struct ts_fsm_token)
 *   representing the pattern as a finite automation. The data is read
 *   representing the pattern as a finite automaton. The data is read
 *   sequentially on an octet basis. Every state token specifies the number
 *   of recurrences and the type of value accepted which can be either a
 *   specific character or ctype based set of characters. The available
+1 −1
Original line number Diff line number Diff line
@@ -27,7 +27,7 @@
 *
 *   [1] Cormen, Leiserson, Rivest, Stein
 *       Introdcution to Algorithms, 2nd Edition, MIT Press
 *   [2] See finite automation theory
 *   [2] See finite automaton theory
 */

#include <linux/module.h>