lnav/src/sequence_matcher.hh

103 lines
3.1 KiB
C++
Raw Normal View History

2013-05-03 06:02:03 +00:00
/**
* Copyright (c) 2007-2012, Timothy Stack
*
* All rights reserved.
2013-05-28 04:35:00 +00:00
*
2013-05-03 06:02:03 +00:00
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
2013-05-28 04:35:00 +00:00
*
2013-05-03 06:02:03 +00:00
* * Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* * Neither the name of Timothy Stack nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
2013-05-28 04:35:00 +00:00
*
2013-05-03 06:02:03 +00:00
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ''AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
2022-03-16 22:38:08 +00:00
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2013-05-03 06:02:03 +00:00
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
2011-06-06 02:05:46 +00:00
#ifndef sequence_matcher_hh
#define sequence_matcher_hh
2011-06-06 02:05:46 +00:00
#include <list>
#include <string>
#include <vector>
#include "byte_array.hh"
class sequence_matcher {
public:
typedef std::vector<std::string> field_row_t;
2022-03-16 22:38:08 +00:00
typedef std::list<field_row_t> field_col_t;
2013-05-28 04:35:00 +00:00
2022-03-16 22:38:08 +00:00
typedef byte_array<2, uint64_t> id_t;
2011-06-06 02:05:46 +00:00
enum field_type_t {
2013-05-28 04:35:00 +00:00
FT_VARIABLE,
FT_CONSTANT,
2011-06-06 02:05:46 +00:00
};
struct field {
2022-03-16 22:38:08 +00:00
field() : sf_type(FT_VARIABLE){};
2011-06-06 02:05:46 +00:00
2013-05-28 04:35:00 +00:00
field_type_t sf_type;
2022-03-16 22:38:08 +00:00
field_row_t sf_value;
2011-06-06 02:05:46 +00:00
};
2022-03-16 22:38:08 +00:00
sequence_matcher(field_col_t& example);
2011-06-06 02:05:46 +00:00
2022-03-16 22:38:08 +00:00
void identity(const std::vector<std::string>& values, id_t& id_out);
2011-06-06 02:05:46 +00:00
template<typename T>
2022-03-16 22:38:08 +00:00
bool match(const std::vector<std::string>& values,
std::vector<T>& state,
2013-05-28 04:35:00 +00:00
T index)
{
bool index_match = true;
2022-03-16 22:38:08 +00:00
int lpc = 0;
2013-05-28 04:35:00 +00:00
2022-03-16 22:38:08 +00:00
retry:
2013-05-28 04:35:00 +00:00
for (std::list<field>::iterator iter = this->sm_fields.begin();
iter != this->sm_fields.end();
2022-03-16 22:38:08 +00:00
++iter, lpc++)
{
2013-05-28 04:35:00 +00:00
if (iter->sf_type != sequence_matcher::FT_CONSTANT) {
continue;
}
if (iter->sf_value[state.size()] != values[lpc]) {
if (!state.empty()) {
state.clear();
lpc = 0;
goto retry;
2022-03-16 22:38:08 +00:00
} else {
2013-05-28 04:35:00 +00:00
index_match = false;
break;
}
}
}
if (index_match) {
state.push_back(index);
}
2022-03-16 22:38:08 +00:00
return (size_t) this->sm_count == state.size();
2011-06-06 02:05:46 +00:00
};
private:
int sm_count;
std::list<field> sm_fields;
};
#endif