diff --git a/annotated.html b/annotated.html index 9facaca36..810efb7f0 100644 --- a/annotated.html +++ b/annotated.html @@ -222,47 +222,50 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();  Cis_integral< uint256_t >  Cis_unsigned< uint128_t >  Cis_unsigned< uint256_t > - ►Cbinary_search_treeThe Binary Search Tree class - Cbst_nodeA struct to represent a node in the Binary Search Tree - CBtree - Ccll - Ccompare - CCompareComparator class for priority queue - CComplexClass Complex to represent complex numbers as a field - CCycleCheck - Cdouble_linked_list - CdsuDisjoint sets union data structure, class based representation - CEasterYearMonthDayFor IO operations - CEdge - CFCFSClass which implements the FCFS scheduling algorithm - CFenwickTree - CGraph - Chash_chainChain class with a given modulus - CItem - Clarge_number - Clinkedlist - Clist - CListNodeFor IO operations - CMinHeap - CMinHeapNode - Cmst - Cnode - CNode - CPoint - Cquery - Cqueue + ►NstringsAlgorithms with strings + ►Nboyer_moore + CpatternA structure representing all the data we need to search the preprocessed pattern in text + ►Cbinary_search_treeThe Binary Search Tree class + Cbst_nodeA struct to represent a node in the Binary Search Tree + CBtree + Ccll + Ccompare + CCompareComparator class for priority queue + CComplexClass Complex to represent complex numbers as a field + CCycleCheck + Cdouble_linked_list + CdsuDisjoint sets union data structure, class based representation + CEasterYearMonthDayFor IO operations + CEdge + CFCFSClass which implements the FCFS scheduling algorithm + CFenwickTree + CGraph + Chash_chainChain class with a given modulus + CItem + Clarge_number + Clinkedlist + Clist + CListNodeFor IO operations + CMinHeap + CMinHeapNode + Cmst + Cnode + CNode + CPoint + Cquery  CQueue - CRBtree - CSegmentIntersection - CSolution - CstackFor std::invalid_argument - Cstack_linkedList - CTestCasesClass encapsulating the necessary test cases - Ctower - ►CTrie - CTrieNode - Cuint128_tClass for 128-bit unsigned integer - Cuint256_tClass for 256-bit unsigned integer + Cqueue + CRBtree + CSegmentIntersection + CSolution + CstackFor std::invalid_argument + Cstack_linkedList + CTestCasesClass encapsulating the necessary test cases + Ctower + ►CTrie + CTrieNode + Cuint128_tClass for 128-bit unsigned integer + Cuint256_tClass for 256-bit unsigned integer diff --git a/annotated_dup.js b/annotated_dup.js index 56fa9fbd3..21072ac4d 100644 --- a/annotated_dup.js +++ b/annotated_dup.js @@ -165,6 +165,11 @@ var annotated_dup = [ "is_unsigned< uint128_t >", "d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html", null ], [ "is_unsigned< uint256_t >", "df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html", null ] ] ], + [ "strings", "df/dcb/namespacestrings.html", [ + [ "boyer_moore", null, [ + [ "pattern", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern" ] + ] ] + ] ], [ "binary_search_tree", "d9/dde/classbinary__search__tree.html", "d9/dde/classbinary__search__tree" ], [ "Btree", "d9/d90/struct_btree.html", null ], [ "cll", "d5/d15/classcll.html", null ], @@ -192,8 +197,8 @@ var annotated_dup = [ "Node", "db/d8b/struct_node.html", null ], [ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ], [ "query", "dd/d1b/structquery.html", null ], - [ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ], [ "Queue", "dc/db5/struct_queue.html", null ], + [ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ], [ "RBtree", "d8/d72/class_r_btree.html", null ], [ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ], [ "Solution", "dd/d4f/class_solution.html", null ], diff --git a/classes.html b/classes.html index 8776d977c..d9ef0646d 100644 --- a/classes.html +++ b/classes.html @@ -143,10 +143,10 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
NCRModuloP (math::ncr_modulo_p)
NeuralNetwork (machine_learning::neural_network)
Node (data_structures::linked_list)
Node (data_structures)
Node (data_structures::tree_234)
Trie::Node (data_structures::trie_using_hashmap)
node
Node
Node (operations_on_datastructures::circular_linked_list)
Node (operations_on_datastructures::inorder_traversal_of_bst)
Node (operations_on_datastructures::reverse_binary_tree)
Node (others::iterative_tree_traversals)
Node (others::recursive_tree_traversals)
perSegTree::Node (range_queries)
Node (search::sublist_search)
P
-
perSegTree (range_queries)
Point (ciphers::elliptic_curve_key_exchange)
Point (geometry::grahamscan)
Point (geometry::jarvis)
Point (math)
Point
+
pattern (strings::boyer_moore)
perSegTree (range_queries)
Point (ciphers::elliptic_curve_key_exchange)
Point (geometry::grahamscan)
Point (geometry::jarvis)
Point (math)
Point
Q
-
query
queue
Queue
Queue_Array (data_structures::queue_using_array)
+
query
Queue
queue
Queue_Array (data_structures::queue_using_array)
R
RBtree
RootedTree (graph)
diff --git a/d1/db6/boyer__moore_8cpp__incl.map b/d1/db6/boyer__moore_8cpp__incl.map new file mode 100644 index 000000000..cddbc7be5 --- /dev/null +++ b/d1/db6/boyer__moore_8cpp__incl.map @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + diff --git a/d1/db6/boyer__moore_8cpp__incl.md5 b/d1/db6/boyer__moore_8cpp__incl.md5 new file mode 100644 index 000000000..47a2d82ed --- /dev/null +++ b/d1/db6/boyer__moore_8cpp__incl.md5 @@ -0,0 +1 @@ +56e0959d91df519c0f74c7b52d594910 \ No newline at end of file diff --git a/d1/db6/boyer__moore_8cpp__incl.svg b/d1/db6/boyer__moore_8cpp__incl.svg new file mode 100644 index 000000000..f2ff63f23 --- /dev/null +++ b/d1/db6/boyer__moore_8cpp__incl.svg @@ -0,0 +1,154 @@ + + + + + + + + + + + +strings/boyer_moore.cpp + + +Node1 + + +strings/boyer_moore.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +climits + + + + + +Node1->Node3 + + + + + + + + +Node4 + + +cstring + + + + + +Node1->Node4 + + + + + + + + +Node5 + + +iostream + + + + + +Node1->Node5 + + + + + + + + +Node6 + + +string + + + + + +Node1->Node6 + + + + + + + + +Node7 + + +vector + + + + + +Node1->Node7 + + + + + + + + + + + + + diff --git a/d1/db6/boyer__moore_8cpp__incl_org.svg b/d1/db6/boyer__moore_8cpp__incl_org.svg new file mode 100644 index 000000000..410d7f4cb --- /dev/null +++ b/d1/db6/boyer__moore_8cpp__incl_org.svg @@ -0,0 +1,129 @@ + + + + + + +strings/boyer_moore.cpp + + +Node1 + + +strings/boyer_moore.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +climits + + + + + +Node1->Node3 + + + + + + + + +Node4 + + +cstring + + + + + +Node1->Node4 + + + + + + + + +Node5 + + +iostream + + + + + +Node1->Node5 + + + + + + + + +Node6 + + +string + + + + + +Node1->Node6 + + + + + + + + +Node7 + + +vector + + + + + +Node1->Node7 + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp.html b/d3/db2/boyer__moore_8cpp.html new file mode 100644 index 000000000..5fb059117 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp.html @@ -0,0 +1,702 @@ + + + + + + + +Algorithms_in_C++: strings/boyer_moore.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ 1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+
+Classes | +Namespaces | +Macros | +Functions
+
boyer_moore.cpp File Reference
+
+
+ +

The Boyer–Moore algorithm searches for occurrences of pattern P in text T by performing explicit character comparisons at different alignments. Instead of a brute-force search of all alignments (of which there are n - m + 1), Boyer–Moore uses information gained by preprocessing P to skip as many alignments as possible. +More...

+
#include <cassert>
+#include <climits>
+#include <cstring>
+#include <iostream>
+#include <string>
+#include <vector>
+
+Include dependency graph for boyer_moore.cpp:
+
+
+
+
+ + + + +

+Classes

struct  strings::boyer_moore::pattern
 A structure representing all the data we need to search the preprocessed pattern in text. More...
 
+ + + + +

+Namespaces

namespace  strings
 Algorithms with strings.
 
+ + + + +

+Macros

#define APLHABET_SIZE   CHAR_MAX
 number of symbols in the alphabet we use
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

void strings::boyer_moore::init_good_suffix (const std::string &str, std::vector< size_t > &arg)
 A function that preprocess the good suffix thable.
 
void strings::boyer_moore::init_bad_char (const std::string &str, std::vector< size_t > &arg)
 A function that preprocess the bad char table.
 
void strings::boyer_moore::init_pattern (const std::string &str, pattern &arg)
 A function that initializes pattern.
 
std::vector< size_t > strings::boyer_moore::search (const std::string &str, const pattern &arg)
 A function that implements Boyer-Moore's algorithm.
 
bool strings::boyer_moore::is_prefix (const char *str, const char *pat, size_t len)
 Check if pat is prefix of str.
 
void and_test (const char *text)
 A test case in which we search for every appearance of the word 'and'.
 
void pat_test (const char *text)
 A test case in which we search for every appearance of the word 'pat'.
 
static void tests ()
 Self-test implementations.
 
int main ()
 Main function.
 
+

Detailed Description

+

The Boyer–Moore algorithm searches for occurrences of pattern P in text T by performing explicit character comparisons at different alignments. Instead of a brute-force search of all alignments (of which there are n - m + 1), Boyer–Moore uses information gained by preprocessing P to skip as many alignments as possible.

+

The key insight in this algorithm is that if the end of the pattern is compared to the text, then jumps along the text can be made rather than checking every character of the text. The reason that this works is that in lining up the pattern against the text, the last character of the pattern is compared to the character in the text.

+

If the characters do not match, there is no need to continue searching backwards along the text. This leaves us with two cases.

+

Case 1: If the character in the text does not match any of the characters in the pattern, then the next character in the text to check is located m characters farther along the text, where m is the length of the pattern.

+

Case 2: If the character in the text is in the pattern, then a partial shift of the pattern along the text is done to line up along the matching character and the process is repeated.

+

There are two shift rules:

+

[The bad character rule] (https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm#The_bad_character_rule)

+

[The good suffix rule] (https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm#The_good_suffix_rule)

+

The shift rules are implemented as constant-time table lookups, using tables generated during the preprocessing of P.

Author
Stoycho Kyosev
+

Macro Definition Documentation

+ +

◆ APLHABET_SIZE

+ +
+
+ + + + +
#define APLHABET_SIZE   CHAR_MAX
+
+ +

number of symbols in the alphabet we use

+

for assert for CHAR_MAX macro for strlen for IO operations for std::string for std::vector

+ +
+
+

Function Documentation

+ +

◆ and_test()

+ +
+
+ + + + + + + + +
void and_test (const char * text)
+
+ +

A test case in which we search for every appearance of the word 'and'.

+
Parameters
+ + +
textThe text in which we search for appearance of the word 'and'
+
+
+
Returns
void
+
218 {
+
219 strings::boyer_moore::pattern ands;
+
220 strings::boyer_moore::init_pattern("and", ands);
+
221 std::vector<size_t> indexes = strings::boyer_moore::search(text, ands);
+
222
+
223 assert(indexes.size() == 2);
+
224 assert(strings::boyer_moore::is_prefix(text + indexes[0], "and", 3));
+
225 assert(strings::boyer_moore::is_prefix(text + indexes[1], "and", 3));
+
226}
+
strings::boyer_moore::init_pattern
void init_pattern(const std::string &str, pattern &arg)
A function that initializes pattern.
Definition boyer_moore.cpp:151
+
strings::boyer_moore::search
std::vector< size_t > search(const std::string &str, const pattern &arg)
A function that implements Boyer-Moore's algorithm.
Definition boyer_moore.cpp:163
+
std::vector::size
T size(T... args)
+
strings::boyer_moore::pattern
A structure representing all the data we need to search the preprocessed pattern in text.
Definition boyer_moore.cpp:68
+ +
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ init_bad_char()

+ +
+
+ + + + + + + + + + + + + + + + + + +
void strings::boyer_moore::init_bad_char (const std::string & str,
std::vector< size_t > & arg 
)
+
+ +

A function that preprocess the bad char table.

+
Parameters
+ + + +
strThe string being preprocessed
argThe bad char table
+
+
+
Returns
void
+
136 {
+
137 arg.resize(APLHABET_SIZE, str.length());
+
138
+
139 for (size_t i = 0; i < str.length(); i++) {
+
140 arg[str[i]] = str.length() - i - 1;
+
141 }
+
142}
+
APLHABET_SIZE
#define APLHABET_SIZE
number of symbols in the alphabet we use
Definition boyer_moore.cpp:50
+
std::vector::resize
T resize(T... args)
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ init_good_suffix()

+ +
+
+ + + + + + + + + + + + + + + + + + +
void strings::boyer_moore::init_good_suffix (const std::string & str,
std::vector< size_t > & arg 
)
+
+ +

A function that preprocess the good suffix thable.

+
Parameters
+ + + +
strThe string being preprocessed
argThe good suffix table
+
+
+
Returns
void
+
87 {
+
88 arg.resize(str.size() + 1, 0);
+
89
+
90 // border_pos[i] - the index of the longest proper suffix of str[i..] which
+
91 // is also a proper prefix.
+
92 std::vector<size_t> border_pos(str.size() + 1, 0);
+
93
+
94 size_t current_char = str.length();
+
95
+
96 size_t border_index = str.length() + 1;
+
97
+
98 border_pos[current_char] = border_index;
+
99
+
100 while (current_char > 0) {
+
101 while (border_index <= str.length() &&
+
102 str[current_char - 1] != str[border_index - 1]) {
+
103 if (arg[border_index] == 0) {
+
104 arg[border_index] = border_index - current_char;
+
105 }
+
106
+
107 border_index = border_pos[border_index];
+
108 }
+
109
+
110 current_char--;
+
111 border_index--;
+
112 border_pos[current_char] = border_index;
+
113 }
+
114
+
115 size_t largest_border_index = border_pos[0];
+
116
+
117 for (size_t i = 0; i < str.size(); i++) {
+
118 if (arg[i] == 0) {
+
119 arg[i] = largest_border_index;
+
120 }
+
121
+
122 // If we go pass the largest border we find the next one as we iterate
+
123 if (i == largest_border_index) {
+
124 largest_border_index = border_pos[largest_border_index];
+
125 }
+
126 }
+
127}
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ init_pattern()

+ +
+
+ + + + + + + + + + + + + + + + + + +
void strings::boyer_moore::init_pattern (const std::string & str,
pattern & arg 
)
+
+ +

A function that initializes pattern.

+
Parameters
+ + + +
strText used for initialization
argInitialized structure
+
+
+
Returns
void
+
151 {
+
152 arg.pat = str;
+
153 init_bad_char(str, arg.bad_char);
+
154 init_good_suffix(str, arg.good_suffix);
+
155}
+
strings::boyer_moore::init_bad_char
void init_bad_char(const std::string &str, std::vector< size_t > &arg)
A function that preprocess the bad char table.
Definition boyer_moore.cpp:136
+
strings::boyer_moore::init_good_suffix
void init_good_suffix(const std::string &str, std::vector< size_t > &arg)
A function that preprocess the good suffix thable.
Definition boyer_moore.cpp:87
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ is_prefix()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool strings::boyer_moore::is_prefix (const char * str,
const char * pat,
size_t len 
)
+
+ +

Check if pat is prefix of str.

+
Parameters
+ + + + +
strpointer to some part of the input text.
patthe searched pattern.
lenlength of the searched pattern
+
+
+
Returns
true if pat IS prefix of str.
+
+false if pat is NOT a prefix of str.
+
198 {
+
199 if (strlen(str) < len) {
+
200 return false;
+
201 }
+
202
+
203 for (size_t i = 0; i < len; i++) {
+
204 if (str[i] != pat[i]) {
+
205 return false;
+
206 }
+
207 }
+
208
+
209 return true;
+
210}
+
std::strlen
T strlen(T... args)
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ main()

+ +
+
+ + + + + + + + +
int main (void )
+
+ +

Main function.

+
Returns
0 on exit
+
267 {
+
268 tests(); // run self-test implementations
+
269 return 0;
+
270}
+
tests
static void tests()
Self-test implementations.
Definition boyer_moore.cpp:248
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ pat_test()

+ +
+
+ + + + + + + + +
void pat_test (const char * text)
+
+ +

A test case in which we search for every appearance of the word 'pat'.

+
Parameters
+ + +
textThe text in which we search for appearance of the word 'pat'
+
+
+
Returns
void
+
233 {
+
234 strings::boyer_moore::pattern pat;
+
235 strings::boyer_moore::init_pattern("pat", pat);
+
236 std::vector<size_t> indexes = strings::boyer_moore::search(text, pat);
+
237
+
238 assert(indexes.size() == 6);
+
239
+
240 for (const auto& currentIndex : indexes) {
+
241 assert(strings::boyer_moore::is_prefix(text + currentIndex, "pat", 3));
+
242 }
+
243}
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ search()

+ +
+
+ + + + + + + + + + + + + + + + + + +
std::vector< size_t > strings::boyer_moore::search (const std::string & str,
const pattern & arg 
)
+
+ +

A function that implements Boyer-Moore's algorithm.

+
Parameters
+ + + +
strText we are seatching in.
argpattern structure containing the preprocessed pattern
+
+
+
Returns
Vector of indexes of the occurrences of pattern in text
+
163 {
+
164 size_t index_position = arg.pat.size() - 1;
+
165 std::vector<size_t> index_storage;
+
166
+
167 while (index_position < str.length()) {
+
168 size_t index_string = index_position;
+
169 int index_pattern = static_cast<int>(arg.pat.size()) - 1;
+
170
+
171 while (index_pattern >= 0 &&
+
172 str[index_string] == arg.pat[index_pattern]) {
+
173 --index_pattern;
+
174 --index_string;
+
175 }
+
176
+
177 if (index_pattern < 0) {
+
178 index_storage.push_back(index_position - arg.pat.length() + 1);
+
179 index_position += arg.good_suffix[0];
+
180 } else {
+
181 index_position += std::max(arg.bad_char[str[index_string]],
+
182 arg.good_suffix[index_pattern + 1]);
+
183 }
+
184 }
+
185
+
186 return index_storage;
+
187}
+
std::max
T max(T... args)
+
std::vector::push_back
T push_back(T... args)
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ tests()

+ +
+
+ + + + + +
+ + + + + + + +
static void tests ()
+ 		+static
+
+ +

Self-test implementations.

+
Returns
void
+
248 {
+
249 const char* text =
+
250 "When pat Mr. and Mrs. pat Dursley woke up on the dull, gray \
+
251 Tuesday our story starts, \
+
252 there was nothing about pat the cloudy sky outside to pat suggest that\
+
253 strange and \
+
254 mysterious things would pat soon be happening all pat over the \
+
255 country.";
+
256
+
257 and_test(text);
+
258 pat_test(text);
+
259
+
260 std::cout << "All tests have successfully passed!\n";
+
261}
+ +
pat_test
void pat_test(const char *text)
A test case in which we search for every appearance of the word 'pat'.
Definition boyer_moore.cpp:233
+
and_test
void and_test(const char *text)
A test case in which we search for every appearance of the word 'and'.
Definition boyer_moore.cpp:218
+
+Here is the call graph for this function:
+
+
+
+ +
+
+
+
+ + + + diff --git a/d3/db2/boyer__moore_8cpp.js b/d3/db2/boyer__moore_8cpp.js new file mode 100644 index 000000000..bb99af030 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp.js @@ -0,0 +1,14 @@ +var boyer__moore_8cpp = +[ + [ "strings::boyer_moore::pattern", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern" ], + [ "APLHABET_SIZE", "d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd", null ], + [ "and_test", "d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9", null ], + [ "init_bad_char", "d3/db2/boyer__moore_8cpp.html#a2f6688c9bb3e692297a3aa09cebc1c00", null ], + [ "init_good_suffix", "d3/db2/boyer__moore_8cpp.html#aa709cf7fca02b7d3e1888423d5f739a1", null ], + [ "init_pattern", "d3/db2/boyer__moore_8cpp.html#a0b165af1dc341289fd705be4c67728f8", null ], + [ "is_prefix", "d3/db2/boyer__moore_8cpp.html#a056122c8fe8fb0f5fca6428d3f7b5c3a", null ], + [ "main", "d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "pat_test", "d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2", null ], + [ "search", "d3/db2/boyer__moore_8cpp.html#a15703b553faed0d28202c10808cf9738", null ], + [ "tests", "d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ] +]; \ No newline at end of file diff --git a/d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph.map b/d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph.map new file mode 100644 index 000000000..7dfa83901 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph.md5 b/d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph.md5 new file mode 100644 index 000000000..96c13c1c0 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph.md5 @@ -0,0 +1 @@ +2150952876937ec74c8f1cdcf011c50c \ No newline at end of file diff --git a/d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph.svg b/d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph.svg new file mode 100644 index 000000000..c72311fe4 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph.svg @@ -0,0 +1,56 @@ + + + + + + + + + + + +strings::boyer_moore::is_prefix + + +Node1 + + +strings::boyer_moore +::is_prefix + + + + + +Node1->Node1 + + + + + + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph_org.svg b/d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph_org.svg new file mode 100644 index 000000000..8821dcd1c --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph_org.svg @@ -0,0 +1,31 @@ + + + + + + +strings::boyer_moore::is_prefix + + +Node1 + + +strings::boyer_moore +::is_prefix + + + + + +Node1->Node1 + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.map b/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.map new file mode 100644 index 000000000..a55fee8a5 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.map @@ -0,0 +1,17 @@ + + + + + + + + + + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.md5 b/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.md5 new file mode 100644 index 000000000..48be5f8c0 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.md5 @@ -0,0 +1 @@ +304c1d6bc9e25fd666861b19017f9ea7 \ No newline at end of file diff --git a/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.svg b/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.svg new file mode 100644 index 000000000..845dbaf53 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.svg @@ -0,0 +1,175 @@ + + + + + + + + + + + +strings::boyer_moore::init_pattern + + +Node1 + + +strings::boyer_moore +::init_pattern + + + + + +Node1->Node1 + + + + + + + + +Node2 + + +strings::boyer_moore +::init_bad_char + + + + + +Node1->Node2 + + + + + + + + +Node5 + + +strings::boyer_moore +::init_good_suffix + + + + + +Node1->Node5 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::string::length + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +std::vector::resize + + + + + +Node2->Node4 + + + + + + + + +Node5->Node3 + + + + + + + + +Node5->Node3 + + + + + + + + +Node5->Node4 + + + + + + + + +Node5->Node5 + + + + + + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph_org.svg b/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph_org.svg new file mode 100644 index 000000000..2e7d9ef1d --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph_org.svg @@ -0,0 +1,150 @@ + + + + + + +strings::boyer_moore::init_pattern + + +Node1 + + +strings::boyer_moore +::init_pattern + + + + + +Node1->Node1 + + + + + + + + +Node2 + + +strings::boyer_moore +::init_bad_char + + + + + +Node1->Node2 + + + + + + + + +Node5 + + +strings::boyer_moore +::init_good_suffix + + + + + +Node1->Node5 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::string::length + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +std::vector::resize + + + + + +Node2->Node4 + + + + + + + + +Node5->Node3 + + + + + + + + +Node5->Node3 + + + + + + + + +Node5->Node4 + + + + + + + + +Node5->Node5 + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.map b/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.map new file mode 100644 index 000000000..8da7f06b1 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.md5 b/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.md5 new file mode 100644 index 000000000..3088d7dc3 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.md5 @@ -0,0 +1 @@ +5b5eb95061452a40148727ff87187858 \ No newline at end of file diff --git a/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.svg b/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.svg new file mode 100644 index 000000000..62d77cb02 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.svg @@ -0,0 +1,110 @@ + + + + + + + + + + + +strings::boyer_moore::search + + +Node1 + + +strings::boyer_moore +::search + + + + + +Node2 + + +std::string::length + + + + + +Node1->Node2 + + + + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node1->Node3 + + + + + + + + +Node4 + + +std::vector::push_back + + + + + +Node1->Node4 + + + + + + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph_org.svg b/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph_org.svg new file mode 100644 index 000000000..d4ac60598 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph_org.svg @@ -0,0 +1,85 @@ + + + + + + +strings::boyer_moore::search + + +Node1 + + +strings::boyer_moore +::search + + + + + +Node2 + + +std::string::length + + + + + +Node1->Node2 + + + + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node1->Node3 + + + + + + + + +Node4 + + +std::vector::push_back + + + + + +Node1->Node4 + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.map b/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.map new file mode 100644 index 000000000..ad9107848 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.md5 b/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.md5 new file mode 100644 index 000000000..6c3ea024d --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.md5 @@ -0,0 +1 @@ +2974149438887cb82d1c50b12d09ffa5 \ No newline at end of file diff --git a/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.svg b/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.svg new file mode 100644 index 000000000..41cc4435d --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.svg @@ -0,0 +1,92 @@ + + + + + + + + + + + +strings::boyer_moore::init_bad_char + + +Node1 + + +strings::boyer_moore +::init_bad_char + + + + + +Node1->Node1 + + + + + + + + +Node2 + + +std::string::length + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::vector::resize + + + + + +Node1->Node3 + + + + + + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph_org.svg b/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph_org.svg new file mode 100644 index 000000000..265b73e21 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph_org.svg @@ -0,0 +1,67 @@ + + + + + + +strings::boyer_moore::init_bad_char + + +Node1 + + +strings::boyer_moore +::init_bad_char + + + + + +Node1->Node1 + + + + + + + + +Node2 + + +std::string::length + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::vector::resize + + + + + +Node1->Node3 + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map new file mode 100644 index 000000000..54ba23f3d --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 new file mode 100644 index 000000000..824c933e3 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 @@ -0,0 +1 @@ +1d1e002573401f45a6341389936a84c1 \ No newline at end of file diff --git a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg new file mode 100644 index 000000000..3f9023ae2 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg @@ -0,0 +1,109 @@ + + + + + + + + + + + +tests + + +Node1 + + +tests + + + + + +Node2 + + +and_test + + + + + +Node1->Node2 + + + + + + + + +Node4 + + +pat_test + + + + + +Node1->Node4 + + + + + + + + +Node3 + + +std::vector::size + + + + + +Node2->Node3 + + + + + + + + +Node4->Node3 + + + + + + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg new file mode 100644 index 000000000..d21af443e --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg @@ -0,0 +1,84 @@ + + + + + + +tests + + +Node1 + + +tests + + + + + +Node2 + + +and_test + + + + + +Node1->Node2 + + + + + + + + +Node4 + + +pat_test + + + + + +Node1->Node4 + + + + + + + + +Node3 + + +std::vector::size + + + + + +Node2->Node3 + + + + + + + + +Node4->Node3 + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.map b/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.map new file mode 100644 index 000000000..cc056c4f5 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.md5 b/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.md5 new file mode 100644 index 000000000..32ec7b2b5 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.md5 @@ -0,0 +1 @@ +3dffba6d7561d4af1425319ca8997972 \ No newline at end of file diff --git a/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.svg b/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.svg new file mode 100644 index 000000000..6318e620f --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.svg @@ -0,0 +1,101 @@ + + + + + + + + + + + +strings::boyer_moore::init_good_suffix + + +Node1 + + +strings::boyer_moore +::init_good_suffix + + + + + +Node1->Node1 + + + + + + + + +Node2 + + +std::string::length + + + + + +Node1->Node2 + + + + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::vector::resize + + + + + +Node1->Node3 + + + + + + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph_org.svg b/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph_org.svg new file mode 100644 index 000000000..02fab82b5 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph_org.svg @@ -0,0 +1,76 @@ + + + + + + +strings::boyer_moore::init_good_suffix + + +Node1 + + +strings::boyer_moore +::init_good_suffix + + + + + +Node1->Node1 + + + + + + + + +Node2 + + +std::string::length + + + + + +Node1->Node2 + + + + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::vector::resize + + + + + +Node1->Node3 + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.map b/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.map new file mode 100644 index 000000000..dc3dbe23d --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.md5 b/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.md5 new file mode 100644 index 000000000..4ad27c2ef --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.md5 @@ -0,0 +1 @@ +dda68a9a39c5b58786d161f8af005f2e \ No newline at end of file diff --git a/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.svg b/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.svg new file mode 100644 index 000000000..3f64058c6 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.svg @@ -0,0 +1,64 @@ + + + + + + + + + + + +pat_test + + +Node1 + + +pat_test + + + + + +Node2 + + +std::vector::size + + + + + +Node1->Node2 + + + + + + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph_org.svg b/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph_org.svg new file mode 100644 index 000000000..6ffa914bd --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph_org.svg @@ -0,0 +1,39 @@ + + + + + + +pat_test + + +Node1 + + +pat_test + + + + + +Node2 + + +std::vector::size + + + + + +Node1->Node2 + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.map b/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.map new file mode 100644 index 000000000..0b5b8fd19 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.md5 b/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.md5 new file mode 100644 index 000000000..7405abeb1 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.md5 @@ -0,0 +1 @@ +9af08864580148e1f5c31673cb9d7e16 \ No newline at end of file diff --git a/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.svg b/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.svg new file mode 100644 index 000000000..37511f8b6 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.svg @@ -0,0 +1,64 @@ + + + + + + + + + + + +and_test + + +Node1 + + +and_test + + + + + +Node2 + + +std::vector::size + + + + + +Node1->Node2 + + + + + + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph_org.svg b/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph_org.svg new file mode 100644 index 000000000..aebcbf1dc --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph_org.svg @@ -0,0 +1,39 @@ + + + + + + +and_test + + +Node1 + + +and_test + + + + + +Node2 + + +std::vector::size + + + + + +Node1->Node2 + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..90dd53aa2 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,12 @@ + + + + + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..9d5021e65 --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +bc05f58de143f7b367ebe87747376ab5 \ No newline at end of file diff --git a/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..f8c9ad53c --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,127 @@ + + + + + + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +tests + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +and_test + + + + + +Node2->Node3 + + + + + + + + +Node5 + + +pat_test + + + + + +Node2->Node5 + + + + + + + + +Node4 + + +std::vector::size + + + + + +Node3->Node4 + + + + + + + + +Node5->Node4 + + + + + + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg new file mode 100644 index 000000000..d662cf17e --- /dev/null +++ b/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -0,0 +1,102 @@ + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +tests + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +and_test + + + + + +Node2->Node3 + + + + + + + + +Node5 + + +pat_test + + + + + +Node2->Node5 + + + + + + + + +Node4 + + +std::vector::size + + + + + +Node3->Node4 + + + + + + + + +Node5->Node4 + + + + + + + + diff --git a/d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html b/d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html new file mode 100644 index 000000000..9a4e4503a --- /dev/null +++ b/d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html @@ -0,0 +1,118 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ 1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+
strings::boyer_moore::pattern Member List
+
+
+ +

This is the complete list of members for strings::boyer_moore::pattern, including all inherited members.

+ + + + +
bad_charstrings::boyer_moore::pattern
good_suffixstrings::boyer_moore::pattern
pat (defined in strings::boyer_moore::pattern)strings::boyer_moore::pattern
+
+ + + + diff --git a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.map b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.map new file mode 100644 index 000000000..0a4507bdb --- /dev/null +++ b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.md5 b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.md5 new file mode 100644 index 000000000..ace466e06 --- /dev/null +++ b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.md5 @@ -0,0 +1 @@ +a8a3d83907b4a330504f55723ba112d4 \ No newline at end of file diff --git a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg new file mode 100644 index 000000000..1c89dd8cd --- /dev/null +++ b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg @@ -0,0 +1,124 @@ + + + + + + + + + + + +strings::boyer_moore::pattern + + +Node1 + + +strings::boyer_moore +::pattern + + + + + +Node2 + + +std::string + + + + + +Node2->Node1 + + + + + + pat + + + +Node3 + + +std::basic_string< + Char > + + + + + +Node3->Node2 + + + + + + + + +Node4 + + +std::vector< size_t > + + + + + +Node4->Node1 + + + + + + bad_char +good_suffix + + + +Node5 + + +std::size_t + + + + + +Node5->Node4 + + + + + + elements + + + + + + + + diff --git a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph_org.svg b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph_org.svg new file mode 100644 index 000000000..383a09834 --- /dev/null +++ b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph_org.svg @@ -0,0 +1,99 @@ + + + + + + +strings::boyer_moore::pattern + + +Node1 + + +strings::boyer_moore +::pattern + + + + + +Node2 + + +std::string + + + + + +Node2->Node1 + + + + + + pat + + + +Node3 + + +std::basic_string< + Char > + + + + + +Node3->Node2 + + + + + + + + +Node4 + + +std::vector< size_t > + + + + + +Node4->Node1 + + + + + + bad_char +good_suffix + + + +Node5 + + +std::size_t + + + + + +Node5->Node4 + + + + + + elements + + + diff --git a/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html b/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html new file mode 100644 index 000000000..db24aaf98 --- /dev/null +++ b/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html @@ -0,0 +1,171 @@ + + + + + + + +Algorithms_in_C++: strings::boyer_moore::pattern Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ 1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+
+Public Attributes | +List of all members
+
strings::boyer_moore::pattern Struct Reference
+
+
+ +

A structure representing all the data we need to search the preprocessed pattern in text. + More...

+
+Collaboration diagram for strings::boyer_moore::pattern:
+
+
+
[legend]
+ + + + + + + + +

+Public Attributes

+std::string pat
 
std::vector< size_t > bad_char
 
std::vector< size_t > good_suffix
 
+

Detailed Description

+

A structure representing all the data we need to search the preprocessed pattern in text.

+

Member Data Documentation

+ +

◆ bad_char

+ +
+
+ + + + +
std::vector<size_t> strings::boyer_moore::pattern::bad_char
+
+

bad char table used in Bad Character Heuristic

+ +
+
+ +

◆ good_suffix

+ +
+
+ + + + +
std::vector<size_t> strings::boyer_moore::pattern::good_suffix
+
+

good suffix table used for Good Suffix heuristic

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+ + + + diff --git a/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.js b/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.js new file mode 100644 index 000000000..c97ea638f --- /dev/null +++ b/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.js @@ -0,0 +1,5 @@ +var structstrings_1_1boyer__moore_1_1pattern = +[ + [ "bad_char", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645", null ], + [ "good_suffix", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e", null ] +]; \ No newline at end of file diff --git a/dir_73a3cc5065b223eb41b02873c0e19f0e.html b/dir_73a3cc5065b223eb41b02873c0e19f0e.html index b4d5fc2fc..2b79af930 100644 --- a/dir_73a3cc5065b223eb41b02873c0e19f0e.html +++ b/dir_73a3cc5065b223eb41b02873c0e19f0e.html @@ -103,6 +103,9 @@ $(document).ready(function(){initNavTree('dir_73a3cc5065b223eb41b02873c0e19f0e.h + + + diff --git a/dir_73a3cc5065b223eb41b02873c0e19f0e.js b/dir_73a3cc5065b223eb41b02873c0e19f0e.js index 0592ca415..c41a774ef 100644 --- a/dir_73a3cc5065b223eb41b02873c0e19f0e.js +++ b/dir_73a3cc5065b223eb41b02873c0e19f0e.js @@ -1,5 +1,6 @@ var dir_73a3cc5065b223eb41b02873c0e19f0e = [ + [ "boyer_moore.cpp", "d3/db2/boyer__moore_8cpp.html", "d3/db2/boyer__moore_8cpp" ], [ "brute_force_string_searching.cpp", "d3/d7d/brute__force__string__searching_8cpp.html", "d3/d7d/brute__force__string__searching_8cpp" ], [ "horspool.cpp", "d3/dfe/horspool_8cpp.html", "d3/dfe/horspool_8cpp" ], [ "knuth_morris_pratt.cpp", "de/d6a/knuth__morris__pratt_8cpp.html", "de/d6a/knuth__morris__pratt_8cpp" ], diff --git a/files.html b/files.html index e82947ea2..ebd9ece99 100644 --- a/files.html +++ b/files.html @@ -399,12 +399,13 @@ N)\) time, with precision fixed using

Files

 boyer_moore.cpp
 The Boyer–Moore algorithm searches for occurrences of pattern P in text T by performing explicit character comparisons at different alignments. Instead of a brute-force search of all alignments (of which there are n - m + 1), Boyer–Moore uses information gained by preprocessing P to skip as many alignments as possible.
 
 brute_force_string_searching.cpp
 String pattern search - brute force.
 
 wave_sort.cppImplementation of the Wave sort algorithm
 ► strings

- b -

diff --git a/functions_i.html b/functions_i.html index 8a85b5365..312ce5943 100644 --- a/functions_i.html +++ b/functions_i.html @@ -107,8 +107,8 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
  • init() : range_queries::heavy_light_decomposition::HLD< X >, range_queries::heavy_light_decomposition::Tree< X >
  • inOrderIterative() : others::iterative_tree_traversals::BinaryTree
  • insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list< N >
    • -
  • Insert() : data_structures::tree_234::Tree234
    • -
  • insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie, operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
    • +
  • Insert() : data_structures::tree_234::Tree234
    • +
  • insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie, operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
  • Insert() : operations_on_datastructures::trie_operations::Tnode
  • insert() : probability::windowed_median::WindowedMedian, Trie
  • insertElement() : data_structures::SkipList
    • diff --git a/functions_u.html b/functions_u.html index 45c38a7db..9457113a5 100644 --- a/functions_u.html +++ b/functions_u.html @@ -102,8 +102,8 @@ $(document).ready(function(){initNavTree('functions_u.html',''); initResizable()

    - u -

    +

    - g -

    + +

    - h -

    diff --git a/globals_func_m.html b/globals_func_m.html index 3e7963e42..20f880c1c 100644 --- a/globals_func_m.html +++ b/globals_func_m.html @@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
    Here is a list of all documented functions with links to the documentation:

    - m -