blob: 69ff6fd46ffff7ecd9d5e2ed6bc8e7bb049d7870 (
plain)
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
|
/* -------------------------------------------
Copyright (C) 2025 Amlal EL Mahrouss, all rights reserved
------------------------------------------- */
#include <LibCompiler/Frontend.h>
namespace LibCompiler {
/// find the perfect matching word in a haystack.
/// \param haystack base string
/// \param needle the string we search for.
/// \return if we found it or not.
bool find_word(std::string haystack, std::string needle) noexcept {
auto index = haystack.find(needle);
// check for needle validity.
if (index == std::string::npos) return false;
// declare lambda
auto not_part_of_word = [&](int index) {
if (std::isspace(haystack[index]) || std::ispunct(haystack[index])) return true;
if (index <= 0 || index >= haystack.size()) return true;
return false;
};
return not_part_of_word(index - 1) && not_part_of_word(index + needle.size());
}
/// find a word within strict conditions and returns a range of it.
/// \param haystack
/// \param needle
/// \return position of needle.
std::size_t find_word_range(std::string haystack, std::string needle) noexcept {
auto index = haystack.find(needle);
// check for needle validity.
if (index == std::string::npos) return false;
if (!isalnum((haystack[index + needle.size() + 1])) &&
!isdigit(haystack[index + needle.size() + 1]) &&
!isalnum((haystack[index - needle.size() - 1])) &&
!isdigit(haystack[index - needle.size() - 1])) {
return index;
}
return std::string::npos;
}
} // namespace LibCompiler
|
