diff options
| author | Alexander Moisseev <moiseev@mezonplus.ru> | 2017-06-27 10:44:19 +0300 |
|---|---|---|
| committer | Alexander Moisseev <moiseev@mezonplus.ru> | 2017-06-27 10:44:19 +0300 |
| commit | bb5a9f8e451bc206e78c9d4d03eb4cbdbef260b3 (patch) | |
| tree | ec38b50c99765caed67aaf23db308b17cc407d5f /contrib/lpeg | |
| parent | 146886df6d250a376b92d1bb615cb93679a7d6e8 (diff) | |
| download | rspamd-bb5a9f8e451bc206e78c9d4d03eb4cbdbef260b3.tar.gz rspamd-bb5a9f8e451bc206e78c9d4d03eb4cbdbef260b3.zip | |
[Minor] Massive spelling correction
by a bot https://github.com/ka7/misspell_fixer
Diffstat (limited to 'contrib/lpeg')
| -rw-r--r-- | contrib/lpeg/lpcode.c | 8 | ||||
| -rw-r--r-- | contrib/lpeg/lptree.c | 6 |
2 files changed, 7 insertions, 7 deletions
diff --git a/contrib/lpeg/lpcode.c b/contrib/lpeg/lpcode.c index fbf44feb1..6feefeb43 100644 --- a/contrib/lpeg/lpcode.c +++ b/contrib/lpeg/lpcode.c @@ -248,7 +248,7 @@ int fixedlenx (TTree *tree, int count, int len) { /* ** Computes the 'first set' of a pattern. -** The result is a conservative aproximation: +** The result is a conservative approximation: ** match p ax -> x (for some x) ==> a belongs to first(p) ** or ** a not in first(p) ==> match p ax -> fail (for all x) @@ -737,13 +737,13 @@ static void coderuntime (CompileState *compst, TTree *tree, int tt) { /* -** Repetion; optimizations: +** Repetition; optimizations: ** When pattern is a charset, can use special instruction ISpan. ** When pattern is head fail, or if it starts with characters that ** are disjoint from what follows the repetions, a simple test ** is enough (a fail inside the repetition would backtrack to fail ** again in the following pattern, so there is no need for a choice). -** When 'opt' is true, the repetion can reuse the Choice already +** When 'opt' is true, the repetition can reuse the Choice already ** active in the stack. */ static void coderep (CompileState *compst, TTree *tree, int opt, @@ -884,7 +884,7 @@ static int codeseq1 (CompileState *compst, TTree *p1, TTree *p2, /* -** Main code-generation function: dispatch to auxiliar functions +** Main code-generation function: dispatch to auxiliary functions ** according to kind of tree. ('needfollow' should return true ** only for consructions that use 'fl'.) */ diff --git a/contrib/lpeg/lptree.c b/contrib/lpeg/lptree.c index bc82ae8da..f1016c3db 100644 --- a/contrib/lpeg/lptree.c +++ b/contrib/lpeg/lptree.c @@ -186,7 +186,7 @@ static int ktablelen (lua_State *L, int idx) { /* -** Concatentate the contents of table 'idx1' into table 'idx2'. +** Concatenate the contents of table 'idx1' into table 'idx2'. ** (Assume that both indices are negative.) ** Return the original length of table 'idx2' (or 0, if no ** element was added, as there is no need to correct any index). @@ -484,7 +484,7 @@ static TTree *getpatt (lua_State *L, int idx, int *len) { /* -** create a new tree, whith a new root and one sibling. +** create a new tree, with a new root and one sibling. ** Sibling must be on the Lua stack, at index 1. */ static TTree *newroot1sib (lua_State *L, int tag) { @@ -499,7 +499,7 @@ static TTree *newroot1sib (lua_State *L, int tag) { /* -** create a new tree, whith a new root and 2 siblings. +** create a new tree, with a new root and 2 siblings. ** Siblings must be on the Lua stack, first one at index 1. */ static TTree *newroot2sib (lua_State *L, int tag) { |