You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
81 lines
2.0 KiB
81 lines
2.0 KiB
1 year ago
|
<?php
|
||
|
/*
|
||
|
** Zabbix
|
||
|
** Copyright (C) 2001-2023 Zabbix SIA
|
||
|
**
|
||
|
** This program is free software; you can redistribute it and/or modify
|
||
|
** it under the terms of the GNU General Public License as published by
|
||
|
** the Free Software Foundation; either version 2 of the License, or
|
||
|
** (at your option) any later version.
|
||
|
**
|
||
|
** 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 General Public License for more details.
|
||
|
**
|
||
|
** You should have received a copy of the GNU General Public License
|
||
|
** along with this program; if not, write to the Free Software
|
||
|
** Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
||
|
**/
|
||
|
|
||
|
|
||
|
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);
|
||
|
}
|
||
|
}
|