Andy Kopra
ef77f03584
The @@@klammerset system command formally declares a klammerset — a named, logically related group of klammer definitions — with an operative, idempotent declaration (:requires and :files load in order at the declaration point, relative to the declaring file). A bare symbol given to ktext -k, kdesc --input, or :requires resolves to x/x.k on the search path: the document's directory, then KLAMMERTEXT_KLAMMERSETS, then KLAMMERTEXT_HOME; kdesc --klammerset lists the available sets. sks/sks.k is the first declared klammerset, so `-k sks` loads the SKS by name. The engine's lookup classes were renamed *_set → *_registry to keep the two concepts apart, and the whole C++ tree now follows standard const-correctness conventions. tst/ gains klammerset_test.sh (18 cases). (from dev 64b1abf23e56)
109 lines
4.4 KiB
C++
109 lines
4.4 KiB
C++
#pragma once
|
|
#include <vector>
|
|
#include <string>
|
|
#include <regex>
|
|
#include <mutex>
|
|
#include <map>
|
|
#include <memory>
|
|
#include <functional>
|
|
#include <tuple>
|
|
#include <utility>
|
|
#include <algorithm>
|
|
|
|
inline std::mutex env_mutex;
|
|
|
|
class Katom;
|
|
|
|
using strings_t = std::vector<std::string>;
|
|
using string_pairs = std::vector<std::pair<std::string, std::string>>;
|
|
using string_map = std::map<std::string, std::string>;
|
|
|
|
using katom_ptr = std::shared_ptr<Katom>;
|
|
using katom_list = std::vector<Katom>;
|
|
using katom_lists = std::vector<katom_list>;
|
|
using katom_list_map = std::map<std::string, katom_list>;
|
|
using katom_iter = katom_list::iterator;
|
|
using spans_t = std::vector<std::pair<Katom, Katom>>;
|
|
using argument_value_map = std::map<std::string, std::string>;
|
|
|
|
std::string trim_left(const std::string& s);
|
|
std::string trim_right(const std::string& s);
|
|
std::string trim(std::string s);
|
|
std::string trim_char_left(std::string s, char remove);
|
|
std::string trim_char_right(std::string s, char remove);
|
|
std::string trim_char(std::string s, char remove);
|
|
std::string string_replace(const std::string& source, const std::string& old_str, const std::string& new_str);
|
|
std::string regex_escape(const std::string& s);
|
|
bool contains(const std::string& str, const std::string& substr);
|
|
bool contains(const std::vector<std::string>& strings, const std::string& element);
|
|
std::vector<std::string> regex_split(const std::string& s, const std::regex& re, bool trim_parts=true);
|
|
std::vector<std::string> word_split(const std::string& s);
|
|
bool is_in(const std::string& s, const std::vector<std::string>& v);
|
|
bool is_not_in(const std::string& s, const std::vector<std::string>& v);
|
|
std::vector<std::string> find_all(const std::string& str, const std::regex& pattern, int match_group=0);
|
|
std::vector<std::string> find_all(const std::string& str, const std::string& pattern, int match_group=0);
|
|
std::string add_margin(const std::string& s, unsigned int margin_size);
|
|
std::string justify(const std::string& input_text, unsigned int text_width=80, unsigned int margin_width=0);
|
|
std::string join(const std::vector<std::string>& ss, const std::string& separator = " ");
|
|
std::string join(int argc, char* array[], const std::string& separator = " ");
|
|
std::string argv_to_string(int argc, char* argv[]);
|
|
std::string plural(const std::string& word, int count);
|
|
std::string plural(const std::string& word, const std::vector<std::string>& things);
|
|
std::string to_be(int count, bool present = true);
|
|
int max_length(const std::vector<std::string>& ss);
|
|
std::vector<std::pair<std::string, std::string>> environment_variables(bool allow_empty_definitions=true);
|
|
std::string replace_environment_variables(const std::string& str);
|
|
std::string abbrev(const std::string& s, unsigned int max_length=65, bool remove_newlines=true);
|
|
void remove_element(std::vector<std::string>& ss, const std::string& removed);
|
|
void remove_duplicates(std::vector<std::string>& ss);
|
|
std::string display_string(const std::string& s, unsigned int width=40, bool replace_newlines=true);
|
|
std::pair<std::string,std::string> extract_parameter_type(const std::string& parameter_name);
|
|
std::tuple<std::string, std::string, bool> regex_split_prefix(const std::regex& pattern, const std::string& text);
|
|
std::vector<std::string> dlist_split(const std::string& s);
|
|
std::string get_env_var(const std::string& var);
|
|
std::string freplace(const std::string& src, const std::regex& pattern,
|
|
const std::function<std::string(std::smatch)>& func);
|
|
std::string exec(const char* cmd);
|
|
|
|
inline std::string q_(const std::string& s)
|
|
{
|
|
return "\"" + s + "\"";
|
|
}
|
|
|
|
inline std::string qq_(const std::string& s)
|
|
{
|
|
if (s.find('\n') == std::string::npos) {
|
|
return "\"" + s + "\"";
|
|
} else {
|
|
return "\"\"\"" + s + "\"\"\"";
|
|
}
|
|
}
|
|
|
|
|
|
template <typename T, typename Pred>
|
|
std::vector<T> collect_if(const std::vector<T>& xs, Pred pred) {
|
|
std::vector<T> out;
|
|
out.reserve(xs.size());
|
|
for (const auto& v : xs) {
|
|
if (pred(v)) out.push_back(v);
|
|
}
|
|
out.shrink_to_fit();
|
|
return out;
|
|
}
|
|
|
|
template <typename T>
|
|
bool all_equal(const std::vector<T>& v) {
|
|
if (v.size() < 2) return true;
|
|
return std::adjacent_find(v.begin(), v.end(), std::not_equal_to<T>{}) == v.end();
|
|
}
|
|
|
|
template <typename T>
|
|
int max_key_length(const std::map<std::string, T>& map)
|
|
{
|
|
size_t result = 0;
|
|
for_each(map.begin(), map.end(),
|
|
[&result](const auto& item) { result = std::max(result, item.first.size()); });
|
|
return result;
|
|
}
|
|
|