1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
<?php
/*
** Copyright (C) 2001-2025 Zabbix SIA
**
** This program is free software: you can redistribute it and/or modify it under the terms of
** the GNU Affero General Public License as published by the Free Software Foundation, version 3.
**
** This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
** without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
** See the GNU Affero General Public License for more details.
**
** You should have received a copy of the GNU Affero General Public License along with this program.
** If not, see <https://www.gnu.org/licenses/>.
**/
class CSetParser extends CParser {
/**
* Array of string to search for with strings as keys.
*
* @var array
*/
private $needles = [];
/**
* Array of chars that are used in the given strings with chars as keys.
*
* @var array
*/
private $chars = [];
/**
* Array of strings to search for.
*
* @param array $needles
*/
public function __construct(array $needles) {
$this->needles = array_flip($needles);
$this->chars = array_flip(str_split(implode($needles)));
}
/**
* Find one of the given strings at the given position.
*
* The parser implements a greedy algorithm, i.e., looks for the longest match.
*/
public function parse($source, $pos = 0) {
$this->length = 0;
$this->match = '';
$length = 0;
$match = null;
$token = '';
for ($p = $pos; isset($source[$p]) && isset($this->chars[$source[$p]]); $p++) {
$token .= $source[$p];
// when we found a match, keep looking to see of there may be a longer match
if (isset($this->needles[$token])) {
$length = $p - $pos + 1;
$match = $token;
}
}
if ($match === null) {
return self::PARSE_FAIL;
}
$this->length = $length;
$this->match = $match;
return (isset($source[$pos + $this->length]) ? self::PARSE_SUCCESS_CONT : self::PARSE_SUCCESS);
}
}
|
