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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
/**
* Copyright (c) 2022, Timothy Stack
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * 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.
*
* 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;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef lnav_itertools_similar_hh
#define lnav_itertools_similar_hh
#include <queue>
#include <string>
#include "base/itertools.hh"
#include "fts_fuzzy_match.hh"
namespace lnav {
namespace itertools {
namespace details {
template<typename F>
struct similar_to {
nonstd::optional<F> st_mapper;
std::string st_pattern;
size_t st_count{5};
};
struct identity {
template<typename U>
constexpr auto operator()(U&& v) const noexcept
-> decltype(std::forward<U>(v))
{
return std::forward<U>(v);
}
};
} // namespace details
template<typename F>
inline details::similar_to<F>
similar_to(F mapper, std::string pattern, size_t count = 5)
{
return lnav::itertools::details::similar_to<F>{
mapper, std::move(pattern), count};
}
inline auto
similar_to(std::string pattern, size_t count = 5)
{
return similar_to(details::identity{}, std::move(pattern), count);
}
} // namespace itertools
} // namespace lnav
template<typename T, typename F>
std::vector<typename T::value_type>
operator|(const T& in, const lnav::itertools::details::similar_to<F>& st)
{
using score_pair = std::pair<int, typename T::value_type>;
struct score_cmp {
bool operator()(const score_pair& lhs, const score_pair& rhs)
{
return lhs.first > rhs.first;
}
};
std::vector<std::remove_const_t<typename T::value_type>> retval;
if (st.st_pattern.empty()) {
retval.insert(retval.begin(), in.begin(), in.end());
if (retval.size() > st.st_count) {
retval.resize(st.st_count);
}
return retval;
}
std::priority_queue<score_pair, std::vector<score_pair>, score_cmp> pq;
for (const auto& elem : in) {
int score = 0;
if (!fts::fuzzy_match(
st.st_pattern.c_str(),
lnav::func::invoke(st.st_mapper.value(), elem).c_str(),
score))
{
continue;
}
if (score <= 0) {
continue;
}
pq.push(std::make_pair(score, elem));
if (pq.size() > st.st_count) {
pq.pop();
}
}
while (!pq.empty()) {
retval.template emplace_back(pq.top().second);
pq.pop();
}
std::reverse(retval.begin(), retval.end());
return retval;
}
#endif
|
