lnav/src/sequence_matcher.cc

80 lines
2.8 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
2022-03-16 22:38:08 +00:00
#include "sequence_matcher.hh"
2011-06-06 02:05:46 +00:00
2022-03-16 22:38:08 +00:00
#include "config.h"
#include "spookyhash/SpookyV2.h"
2011-06-06 02:05:46 +00:00
2022-03-16 22:38:08 +00:00
sequence_matcher::sequence_matcher(field_col_t& example)
2011-06-06 02:05:46 +00:00
{
for (field_col_t::iterator col_iter = example.begin();
2013-05-28 04:35:00 +00:00
col_iter != example.end();
2022-03-16 22:38:08 +00:00
++col_iter)
{
2013-05-28 04:35:00 +00:00
std::string first_value;
2022-03-16 22:38:08 +00:00
field sf;
2013-05-28 04:35:00 +00:00
sf.sf_value = *col_iter;
for (field_row_t::iterator row_iter = (*col_iter).begin();
row_iter != (*col_iter).end();
2022-03-16 22:38:08 +00:00
++row_iter)
{
2013-05-28 04:35:00 +00:00
if (row_iter == (*col_iter).begin()) {
first_value = *row_iter;
2022-03-16 22:38:08 +00:00
} else if (first_value != *row_iter) {
2013-05-28 04:35:00 +00:00
sf.sf_type = FT_CONSTANT;
}
}
if (sf.sf_type == FT_VARIABLE) {
sf.sf_value.clear();
}
this->sm_fields.push_back(sf);
}
this->sm_count = example.front().size();
2011-06-06 02:05:46 +00:00
}
2022-03-16 22:38:08 +00:00
void
2022-03-31 15:59:19 +00:00
sequence_matcher::identity(const std::vector<std::string>& values, id_t& id_out)
2011-06-06 02:05:46 +00:00
{
SpookyHash context;
2022-03-16 22:38:08 +00:00
int lpc = 0;
2013-05-28 04:35:00 +00:00
context.Init(0, 0);
2011-06-06 02:05:46 +00:00
for (std::list<field>::iterator iter = sm_fields.begin();
2013-05-28 04:35:00 +00:00
iter != 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 == FT_VARIABLE) {
2022-03-16 22:38:08 +00:00
context.Update(values[lpc].c_str(), values[lpc].length() + 1);
2013-05-28 04:35:00 +00:00
}
2011-06-06 02:05:46 +00:00
}
context.Final(id_out.out(0), id_out.out(1));
2011-06-06 02:05:46 +00:00
}