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
134
|
/**
* 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_breadcrumb_hh
#define lnav_breadcrumb_hh
#include <string>
#include "base/attr_line.hh"
#include "fmt/format.h"
#include "mapbox/variant.hpp"
namespace breadcrumb {
struct possibility {
possibility(std::string key, attr_line_t value)
: p_key(std::move(key)), p_display_value(std::move(value))
{
}
explicit possibility(std::string key) : p_key(key), p_display_value(key) {}
possibility() = default;
bool operator<(const possibility& rhs) const { return p_key < rhs.p_key; }
bool operator>(const possibility& rhs) const { return rhs < *this; }
bool operator<=(const possibility& rhs) const { return !(rhs < *this); }
bool operator>=(const possibility& rhs) const { return !(*this < rhs); }
std::string p_key;
attr_line_t p_display_value;
};
using crumb_possibilities = std::function<std::vector<possibility>()>;
struct crumb {
using key_t = mapbox::util::variant<std::string, size_t>;
using perform = std::function<void(const key_t& key)>;
crumb(std::string key,
attr_line_t al,
crumb_possibilities cp,
perform performer)
: c_key(std::move(key)), c_display_value(std::move(al)),
c_possibility_provider(std::move(cp)),
c_performer(std::move(performer))
{
}
crumb(std::string key, crumb_possibilities cp, perform performer)
: c_key(key), c_display_value(key),
c_possibility_provider(std::move(cp)),
c_performer(std::move(performer))
{
}
explicit crumb(size_t index, crumb_possibilities cp, perform performer)
: c_key(index), c_display_value(fmt::format(FMT_STRING("[{}]"), index)),
c_possibility_provider(std::move(cp)),
c_performer(std::move(performer))
{
}
explicit crumb(key_t key, crumb_possibilities cp, perform performer)
: c_key(key), c_display_value(key.match(
[](std::string str) { return str; },
[](size_t index) {
return fmt::format(FMT_STRING("[{}]"), index);
})),
c_possibility_provider(std::move(cp)),
c_performer(std::move(performer))
{
}
crumb& with_possible_range(size_t count)
{
this->c_possible_range = count;
if (count == 0) {
this->c_search_placeholder = "(Array is empty)";
} else if (count == 1) {
this->c_search_placeholder = "(Array contains a single element)";
} else {
this->c_search_placeholder = fmt::format(
FMT_STRING("(Enter a number from 0 to {})"), count - 1);
}
return *this;
}
enum class expected_input_t {
exact,
index,
index_or_exact,
anything,
};
key_t c_key;
attr_line_t c_display_value;
crumb_possibilities c_possibility_provider;
perform c_performer;
nonstd::optional<size_t> c_possible_range;
expected_input_t c_expected_input{expected_input_t::exact};
std::string c_search_placeholder;
};
} // namespace breadcrumb
#endif
|
