diff --git a/d2/d90/namespacegreedy__algorithms.html b/d2/d90/namespacegreedy__algorithms.html index c8cd8629b..0f431119f 100644 --- a/d2/d90/namespacegreedy__algorithms.html +++ b/d2/d90/namespacegreedy__algorithms.html @@ -125,19 +125,19 @@ Functions bool can_jump (const std::vector< int > &nums)  Checks whether the given element (default is 1) can jump to the last index.
  -template<typename T > -void findMinimumEdge (const int &infinity, const std::array< std::array< T, 6 >, 6 > &graph) - Finds the minimum edge of the given graph.
-  +template<typename T , std::size_t N, std::size_t M> +void findMinimumEdge (const T &infinity, const std::array< std::array< T, N >, M > &graph) + Finds the minimum edge of the given graph.
+ 

Detailed Description

for std::vector

-

for IO operations

+

for uint32_t

for assert for INT_MAX for IO operations

Greedy Algorithms

for assert for std::cout

Greedy Algorithms

-

for array

+

for array for IO operations for numeric limits

Greedy Algorithms

Function Documentation

@@ -183,23 +183,23 @@ Here is the call graph for this function: - -

◆ findMinimumEdge()

+ +

◆ findMinimumEdge()

-template<typename T >
+template<typename T , std::size_t N, std::size_t M>
- + - +
void greedy_algorithms::findMinimumEdge (const int & infinity, const T & infinity,
const std::array< std::array< T, 6 >, 6 > & graph )const std::array< std::array< T, N >, M > & graph )
@@ -213,20 +213,25 @@ template<typename T >
Returns
void
-
37 {
-
38 for (int i = 0; i < graph.size(); i++) {
-
39 int min = infinity;
-
40 int minIndex = 0;
-
41 for (int j = 0; j < graph.size(); j++) {
-
42 if (graph[i][j] != 0 && graph[i][j] < min) {
-
43 min = graph[i][j];
-
44 minIndex = j;
-
45 }
-
46 }
-
47 std::cout << i << " - " << minIndex << "\t" << graph[i][minIndex]
-
48 << "\n";
-
49 }
-
50}
+
39 {
+
40 if (N != M) {
+
41 std::cout << "\nWrong input passed. Provided array has dimensions " << N
+
42 << "x" << M << ". Please provide a square matrix.\n";
+
43 return;
+
44 }
+
45 for (int i = 0; i < graph.size(); i++) {
+
46 int min = infinity;
+
47 int minIndex = 0;
+
48 for (int j = 0; j < graph.size(); j++) {
+
49 if (i != j && graph[i][j] != 0 && graph[i][j] < min) {
+
50 min = graph[i][j];
+
51 minIndex = j;
+
52 }
+
53 }
+
54 std::cout << i << " - " << minIndex << "\t" << graph[i][minIndex]
+
55 << "\n";
+
56 }
+
57}
graph
Graph Algorithms.
diff --git a/d2/d90/namespacegreedy__algorithms.js b/d2/d90/namespacegreedy__algorithms.js index 8127b22da..26286de02 100644 --- a/d2/d90/namespacegreedy__algorithms.js +++ b/d2/d90/namespacegreedy__algorithms.js @@ -2,5 +2,5 @@ var namespacegreedy__algorithms = [ [ "dijkstra", "d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html", "d2/d2f/namespacegreedy__algorithms_1_1dijkstra" ], [ "can_jump", "d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502", null ], - [ "findMinimumEdge", "d2/d90/namespacegreedy__algorithms.html#a127ce4403660032f53ae2e6467e5427d", null ] + [ "findMinimumEdge", "d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098", null ] ]; \ No newline at end of file diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html b/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html index 766d9d9bc..329c58988 100644 --- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html +++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html @@ -115,10 +115,12 @@ $(function(){initNavTree('d8/d7d/kruskals__minimum__spanning__tree_8cpp.html','. More...

#include <array>
#include <iostream>
+#include <limits>
+#include <cstdint>
Include dependency graph for kruskals_minimum_spanning_tree.cpp:
-
+

@@ -129,10 +131,13 @@ Namespaces

- - - - + + + + + + + @@ -160,26 +165,167 @@ Functions

Main function.

Returns
0 on exit
-
57 {
-
58 constexpr int INFINITY = 99999;
-
59 std::array<std::array<int, 6>, 6> graph{
-
60 0, 4, 1, 4, INFINITY, INFINITY,
-
61 4, 0, 3, 8, 3, INFINITY,
-
62 1, 3, 0, INFINITY, 1, INFINITY,
-
63 4, 8, INFINITY, 0, 5, 7,
-
64 INFINITY, 3, 1, 5, 0, INFINITY,
-
65 INFINITY, INFINITY, INFINITY, 7, INFINITY, 0};
-
66
-
67 greedy_algorithms::findMinimumEdge(INFINITY, graph);
-
68 return 0;
-
69}
- -
graph
Graph Algorithms.
-
greedy_algorithms::findMinimumEdge
void findMinimumEdge(const int &infinity, const std::array< std::array< T, 6 >, 6 > &graph)
Finds the minimum edge of the given graph.
Definition kruskals_minimum_spanning_tree.cpp:36
+
184 {
+
185 test(); // run Self-test implementation
+
186 return 0;
+
187}
+
test
static void test()
Self-test implementations.
Definition kruskals_minimum_spanning_tree.cpp:64
Here is the call graph for this function:
-
+
+
+ +
+ + +

◆ test()

+ +
+
+

Functions

template<typename T >
void greedy_algorithms::findMinimumEdge (const int &infinity, const std::array< std::array< T, 6 >, 6 > &graph)
 Finds the minimum edge of the given graph.
 
template<typename T , std::size_t N, std::size_t M>
void greedy_algorithms::findMinimumEdge (const T &infinity, const std::array< std::array< T, N >, M > &graph)
 Finds the minimum edge of the given graph.
 
static void test ()
 Self-test implementations.
 
int main ()
 Main function.
 
+ + + + +
+ + + + + + + +
static void test ()
+ 		+static
+
+ +

Self-test implementations.

+
Returns
void
+

define a large value for int define a large value for float define a large value for double define a large value for uint32_t

+
64 {
+
65 /**
+
66 * define a large value for int
+
67 * define a large value for float
+
68 * define a large value for double
+
69 * define a large value for uint32_t
+
70 */
+
71 constexpr int INFINITY_INT = std::numeric_limits<int>::max();
+
72 constexpr float INFINITY_FLOAT = std::numeric_limits<float>::max();
+
73 constexpr double INFINITY_DOUBLE = std::numeric_limits<double>::max();
+
74 constexpr uint32_t INFINITY_UINT32 = UINT32_MAX;
+
75
+
76 // Test case with integer values
+
77 std::cout << "\nTest Case 1 :\n";
+
78 std::array<std::array<int, 6>, 6> graph1{
+
79 0, 4, 1, 4, INFINITY_INT, INFINITY_INT,
+
80 4, 0, 3, 8, 3, INFINITY_INT,
+
81 1, 3, 0, INFINITY_INT, 1, INFINITY_INT,
+
82 4, 8, INFINITY_INT, 0, 5, 7,
+
83 INFINITY_INT, 3, 1, 5, 0, INFINITY_INT,
+
84 INFINITY_INT, INFINITY_INT, INFINITY_INT, 7, INFINITY_INT, 0};
+
85 greedy_algorithms::findMinimumEdge(INFINITY_INT, graph1);
+
86
+
87 // Test case with floating values
+
88 std::cout << "\nTest Case 2 :\n";
+
89 std::array<std::array<float, 3>, 3> graph2{
+
90 0.0f, 2.5f, INFINITY_FLOAT,
+
91 2.5f, 0.0f, 3.2f,
+
92 INFINITY_FLOAT, 3.2f, 0.0f};
+
93 greedy_algorithms::findMinimumEdge(INFINITY_FLOAT, graph2);
+
94
+
95 // Test case with double values
+
96 std::cout << "\nTest Case 3 :\n";
+
97 std::array<std::array<double, 5>, 5> graph3{
+
98 0.0, 10.5, INFINITY_DOUBLE, 6.7, 3.3,
+
99 10.5, 0.0, 8.1, 15.4, INFINITY_DOUBLE,
+
100 INFINITY_DOUBLE, 8.1, 0.0, INFINITY_DOUBLE, 7.8,
+
101 6.7, 15.4, INFINITY_DOUBLE, 0.0, 9.9,
+
102 3.3, INFINITY_DOUBLE, 7.8, 9.9, 0.0};
+
103 greedy_algorithms::findMinimumEdge(INFINITY_DOUBLE, graph3);
+
104
+
105 // Test Case with negative weights
+
106 std::cout << "\nTest Case 4 :\n";
+
107 std::array<std::array<int, 3>, 3> graph_neg{
+
108 0, -2, 4,
+
109 -2, 0, 3,
+
110 4, 3, 0};
+
111 greedy_algorithms::findMinimumEdge(INFINITY_INT, graph_neg);
+
112
+
113 // Test Case with Self-Loops
+
114 std::cout << "\nTest Case 5 :\n";
+
115 std::array<std::array<int, 3>, 3> graph_self_loop{
+
116 2, 1, INFINITY_INT,
+
117 INFINITY_INT, 0, 4,
+
118 INFINITY_INT, 4, 0};
+
119 greedy_algorithms::findMinimumEdge(INFINITY_INT, graph_self_loop);
+
120
+
121 // Test Case with no edges
+
122 std::cout << "\nTest Case 6 :\n";
+
123 std::array<std::array<int, 4>, 4> no_edges{
+
124 0, INFINITY_INT, INFINITY_INT, INFINITY_INT,
+
125 INFINITY_INT, 0, INFINITY_INT, INFINITY_INT,
+
126 INFINITY_INT, INFINITY_INT, 0, INFINITY_INT,
+
127 INFINITY_INT, INFINITY_INT, INFINITY_INT, 0};
+
128 greedy_algorithms::findMinimumEdge(INFINITY_INT, no_edges);
+
129
+
130 // Test Case with a non-connected graph
+
131 std::cout << "\nTest Case 7:\n";
+
132 std::array<std::array<int, 4>, 4> partial_graph{
+
133 0, 2, INFINITY_INT, 6,
+
134 2, 0, 3, INFINITY_INT,
+
135 INFINITY_INT, 3, 0, 4,
+
136 6, INFINITY_INT, 4, 0};
+
137 greedy_algorithms::findMinimumEdge(INFINITY_INT, partial_graph);
+
138
+
139 // Test Case with Directed weighted graph. The Krushkal algorithm does not give
+
140 // optimal answer
+
141 std::cout << "\nTest Case 8:\n";
+
142 std::array<std::array<int, 4>, 4> directed_graph{
+
143 0, 3, 7, INFINITY_INT, // Vertex 0 has edges to Vertex 1 and Vertex 2
+
144 INFINITY_INT, 0, 2, 5, // Vertex 1 has edges to Vertex 2 and Vertex 3
+
145 INFINITY_INT, INFINITY_INT, 0, 1, // Vertex 2 has an edge to Vertex 3
+
146 INFINITY_INT, INFINITY_INT, INFINITY_INT, 0}; // Vertex 3 has no outgoing edges
+
147 greedy_algorithms::findMinimumEdge(INFINITY_INT, directed_graph);
+
148
+
149 // Test case with wrong input passed
+
150 std::cout << "\nTest Case 9:\n";
+
151 std::array<std::array<int, 4>, 3> graph9{
+
152 0, 5, 5, 5,
+
153 5, 0, 5, 5,
+
154 5, 5, 5, 5};
+
155 greedy_algorithms::findMinimumEdge(INFINITY_INT, graph9);
+
156
+
157 // Test case with all the same values between every edge
+
158 std::cout << "\nTest Case 10:\n";
+
159 std::array<std::array<int, 5>, 5> graph10{
+
160 0, 5, 5, 5, 5,
+
161 5, 0, 5, 5, 5,
+
162 5, 5, 0, 5, 5,
+
163 5, 5, 5, 0, 5,
+
164 5, 5, 5, 5, 0};
+
165 greedy_algorithms::findMinimumEdge(INFINITY_INT, graph10);
+
166
+
167 // Test Case with uint32_t values
+
168 std::cout << "\nTest Case 11 :\n";
+
169 std::array<std::array<uint32_t, 4>, 4> graph_uint32{
+
170 0, 5, INFINITY_UINT32, 9,
+
171 5, 0, 2, INFINITY_UINT32,
+
172 INFINITY_UINT32, 2, 0, 6,
+
173 9, INFINITY_UINT32, 6, 0};
+
174 greedy_algorithms::findMinimumEdge(INFINITY_UINT32, graph_uint32);
+
175
+
176 std::cout << "\nAll tests have successfully passed!\n";
+
177}
+ + +
std::numeric_limits::max
T max(T... args)
+
greedy_algorithms::findMinimumEdge
void findMinimumEdge(const T &infinity, const std::array< std::array< T, N >, M > &graph)
Finds the minimum edge of the given graph.
Definition kruskals_minimum_spanning_tree.cpp:38
+
+Here is the call graph for this function:
+
+
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp.js b/d8/d7d/kruskals__minimum__spanning__tree_8cpp.js index b10509fb3..662e1e232 100644 --- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp.js +++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp.js @@ -1,5 +1,6 @@ var kruskals__minimum__spanning__tree_8cpp = [ - [ "findMinimumEdge", "d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#a127ce4403660032f53ae2e6467e5427d", null ], - [ "main", "d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] + [ "findMinimumEdge", "d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#a349e4ab9a97532c3931a2bd2a19c0098", null ], + [ "main", "d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "test", "d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] ]; \ No newline at end of file diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map new file mode 100644 index 000000000..5ecbd6dc0 --- /dev/null +++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 new file mode 100644 index 000000000..14d19066b --- /dev/null +++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -0,0 +1 @@ +0b48f8523e7ef0e20c0494ac07eac7ff \ No newline at end of file diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg new file mode 100644 index 000000000..94cbe74a5 --- /dev/null +++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -0,0 +1,84 @@ + + + + + + + + + + + + +test + + +Node1 + + +test + + + + + +Node2 + + +greedy_algorithms:: +findMinimumEdge + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::numeric_limits::max + + + + + +Node1->Node3 + + + + + + + + + + + + + diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg new file mode 100644 index 000000000..4f5935e69 --- /dev/null +++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -0,0 +1,58 @@ + + + + + + +test + + +Node1 + + +test + + + + + +Node2 + + +greedy_algorithms:: +findMinimumEdge + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::numeric_limits::max + + + + + +Node1->Node3 + + + + + + + + diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 89d358e02..39602a91c 100644 --- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,5 +1,9 @@ - - - + + + + + + + diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 2c730e20b..ac79134c3 100644 --- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -e559ad5213eded0387c51a80dd5d5a2c \ No newline at end of file +44496dfb9d279bfd79c2badbf1ee48f4 \ No newline at end of file diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 7cdf5ea66..77f1e3633 100644 --- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,8 +4,8 @@ - + @@ -17,24 +17,23 @@ ]]> - + main Node1 - -main + +main Node2 - - -greedy_algorithms:: -findMinimumEdge + + +test @@ -42,8 +41,45 @@ Node1->Node2 - - + + + + + + + +Node3 + + +greedy_algorithms:: +findMinimumEdge + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +std::numeric_limits::max + + + + + +Node2->Node4 + + + diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 7ef39c7dd..ee7f65e01 100644 --- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -4,26 +4,25 @@ - - + + main Node1 - -main + +main Node2 - - -greedy_algorithms:: -findMinimumEdge + + +test @@ -31,8 +30,45 @@ Node1->Node2 - - + + + + + + + +Node3 + + +greedy_algorithms:: +findMinimumEdge + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +std::numeric_limits::max + + + + + +Node2->Node4 + + + diff --git a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.map b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.map index 0085b6636..b439ca028 100644 --- a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.map +++ b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.map @@ -1,7 +1,11 @@ - - - - - + + + + + + + + + diff --git a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.md5 b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.md5 index 87774ddb0..dd167c4ee 100644 --- a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.md5 +++ b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.md5 @@ -1 +1 @@ -68a97a0bb478e42de426b4b2bbfcef2a \ No newline at end of file +a32e0fa6af6218b64925c386895517d6 \ No newline at end of file diff --git a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg index f4ef37de5..c0a095b0b 100644 --- a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg +++ b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg @@ -4,8 +4,8 @@ - + @@ -23,9 +23,9 @@ Node1 - -greedy_algorithms/kruskals -_minimum_spanning_tree.cpp + +greedy_algorithms/kruskals +_minimum_spanning_tree.cpp @@ -33,8 +33,8 @@ Node2 - -array + +array @@ -42,8 +42,8 @@ Node1->Node2 - - + + @@ -51,8 +51,8 @@ Node3 - -iostream + +iostream @@ -60,8 +60,44 @@ Node1->Node3 - - + + + + + + + +Node4 + + +limits + + + + + +Node1->Node4 + + + + + + + + +Node5 + + +cstdint + + + + + +Node1->Node5 + + + diff --git a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl_org.svg b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl_org.svg index 6b5b157a8..836f1474e 100644 --- a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl_org.svg +++ b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl_org.svg @@ -4,17 +4,17 @@ - + greedy_algorithms/kruskals_minimum_spanning_tree.cpp Node1 - -greedy_algorithms/kruskals -_minimum_spanning_tree.cpp + +greedy_algorithms/kruskals +_minimum_spanning_tree.cpp @@ -22,8 +22,8 @@ Node2 - -array + +array @@ -31,8 +31,8 @@ Node1->Node2 - - + + @@ -40,8 +40,8 @@ Node3 - -iostream + +iostream @@ -49,8 +49,44 @@ Node1->Node3 - - + + + + + + + +Node4 + + +limits + + + + + +Node1->Node4 + + + + + + + + +Node5 + + +cstdint + + + + + +Node1->Node5 + + + diff --git a/doxygen_crawl.html b/doxygen_crawl.html index ab5365338..c2f353b08 100644 --- a/doxygen_crawl.html +++ b/doxygen_crawl.html @@ -1358,8 +1358,8 @@ - + @@ -2488,7 +2488,8 @@ - + + diff --git a/globals_func_t.html b/globals_func_t.html index b99fbb16d..54d9d55c0 100644 --- a/globals_func_t.html +++ b/globals_func_t.html @@ -108,7 +108,7 @@ $(function(){initNavTree('globals_func_t.html',''); initResizable(true); });

- t -

diff --git a/navtreedata.js b/navtreedata.js index bc0a1f4e8..9fea34506 100644 --- a/navtreedata.js +++ b/navtreedata.js @@ -145,12 +145,12 @@ var NAVTREEINDEX = "d5/d89/namespacepalindrome__partitioning.html", "d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f", "d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3", -"d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", -"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3", -"db/d8b/struct_node.html", -"dc/dd9/strand__sort_8cpp.html", -"dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91", -"df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7" +"d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8", +"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039", +"db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a", +"dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119", +"dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69", +"df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179" ]; var SYNCONMSG = 'click to disable panel synchronisation'; diff --git a/navtreeindex10.js b/navtreeindex10.js index 44e90af85..e4cea1287 100644 --- a/navtreeindex10.js +++ b/navtreeindex10.js @@ -1,5 +1,6 @@ var NAVTREEINDEX10 = { +"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039":[10,0,2,3,0,0], "da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3":[10,0,2,3,0,2], "da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e":[10,0,2,3,0,1], "da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81":[10,0,2,3,0,4], @@ -248,6 +249,5 @@ var NAVTREEINDEX10 = "db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46":[10,0,36,16], "db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93":[10,0,36,7], "db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac":[10,0,36,5], -"db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57":[10,0,36,19], -"db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a":[10,0,36,1] +"db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57":[10,0,36,19] }; diff --git a/navtreeindex11.js b/navtreeindex11.js index 1d01ce96e..ac7c55dcd 100644 --- a/navtreeindex11.js +++ b/navtreeindex11.js @@ -1,5 +1,6 @@ var NAVTREEINDEX11 = { +"db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a":[10,0,36,1], "db/d8b/struct_node.html":[10,0,43], "db/d93/check__prime_8cpp.html":[11,0,14,7], "db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,7,2], @@ -248,6 +249,5 @@ var NAVTREEINDEX11 = "dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[10,0,2,9,1], "dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a":[9,0,20,2,0], "dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a":[10,0,2,9,0], -"dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119":[9,0,20,2,4], -"dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119":[10,0,2,9,4] +"dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119":[9,0,20,2,4] }; diff --git a/navtreeindex12.js b/navtreeindex12.js index 44d5e1e59..9fc351bb8 100644 --- a/navtreeindex12.js +++ b/navtreeindex12.js @@ -1,5 +1,6 @@ var NAVTREEINDEX12 = { +"dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119":[10,0,2,9,4], "dc/dd9/strand__sort_8cpp.html":[11,0,22,24], "dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd":[11,0,22,24,1], "dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,24,2], @@ -248,6 +249,5 @@ var NAVTREEINDEX12 = "dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778":[10,0,21,0,0], "dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788":[10,0,21,0,1], "dd/dba/namespacedivide__and__conquer.html":[9,0,23], -"dd/dca/class_f_c_f_s.html":[10,0,32], -"dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69":[10,0,32,0] +"dd/dca/class_f_c_f_s.html":[10,0,32] }; diff --git a/navtreeindex13.js b/navtreeindex13.js index a985f9125..274d006e6 100644 --- a/navtreeindex13.js +++ b/navtreeindex13.js @@ -1,5 +1,6 @@ var NAVTREEINDEX13 = { +"dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69":[10,0,32,0], "dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91":[10,0,32,2], "dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793":[10,0,32,1], "dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46":[10,0,32,3], @@ -248,6 +249,5 @@ var NAVTREEINDEX13 = "df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf":[9,0,12,0,2], "df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#af0a6e3521629c25c2b5d620f26429830":[9,0,12,0,1], "df/d72/modular__division_8cpp.html":[11,0,14,35], -"df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,14,35,0], -"df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179":[11,0,14,35,2] +"df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,14,35,0] }; diff --git a/navtreeindex14.js b/navtreeindex14.js index 48efe9856..9dd078fea 100644 --- a/navtreeindex14.js +++ b/navtreeindex14.js @@ -1,5 +1,6 @@ var NAVTREEINDEX14 = { +"df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179":[11,0,14,35,2], "df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7":[11,0,14,35,1], "df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,35,3], "df/d74/namespacesubarray__sum.html":[9,0,116], diff --git a/navtreeindex3.js b/navtreeindex3.js index 38643ba26..f2113d66f 100644 --- a/navtreeindex3.js +++ b/navtreeindex3.js @@ -214,8 +214,8 @@ var NAVTREEINDEX3 = "d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828":[10,0,16,0,0,5], "d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8":[10,0,16,0,0,2], "d2/d90/namespacegreedy__algorithms.html":[9,0,37], -"d2/d90/namespacegreedy__algorithms.html#a127ce4403660032f53ae2e6467e5427d":[9,0,37,2], "d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502":[9,0,37,1], +"d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098":[9,0,37,2], "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html":[10,0,13,0,1], "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e":[10,0,13,0,1,1], "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f":[10,0,13,0,1,0], diff --git a/navtreeindex8.js b/navtreeindex8.js index 2f13eb10b..7a5d9ccaf 100644 --- a/navtreeindex8.js +++ b/navtreeindex8.js @@ -122,7 +122,8 @@ var NAVTREEINDEX8 = "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592":[10,0,12,0,0,10], "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d":[10,0,12,0,0,5], "d8/d7d/kruskals__minimum__spanning__tree_8cpp.html":[11,0,11,3], -"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#a127ce4403660032f53ae2e6467e5427d":[11,0,11,3,0], +"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#a349e4ab9a97532c3931a2bd2a19c0098":[11,0,11,3,0], +"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,11,3,2], "d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,3,1], "d8/d88/namespaceset_kth_bit.html":[9,0,102], "d8/d89/namespacelinear__probing.html":[8,0,1], @@ -248,6 +249,5 @@ var NAVTREEINDEX8 = "d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59":[11,0,4,1,8], "d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83":[11,0,4,1,5], "d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,1,9], -"d8/df0/queue__using__array_8cpp.html":[11,0,4,14], -"d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8":[11,0,4,14,2] +"d8/df0/queue__using__array_8cpp.html":[11,0,4,14] }; diff --git a/navtreeindex9.js b/navtreeindex9.js index a4f7329b6..219b564bd 100644 --- a/navtreeindex9.js +++ b/navtreeindex9.js @@ -1,5 +1,6 @@ var NAVTREEINDEX9 = { +"d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8":[11,0,4,14,2], "d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,14,1], "d8/dfa/median__search2_8cpp.html":[11,0,21,8], "d8/dfa/median__search2_8cpp.html#a5fefe132a0c3ee780ebc703f37ebce6a":[11,0,21,8,2], @@ -248,6 +249,5 @@ var NAVTREEINDEX9 = "da/d24/sqrt__double_8cpp.html":[11,0,14,52], "da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc":[11,0,14,52,1], "da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,52,0], -"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html":[10,0,2,3,0], -"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039":[10,0,2,3,0,0] +"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html":[10,0,2,3,0] }; diff --git a/search/all_19.js b/search/all_19.js index 63e6fca7f..c2dd162a0 100644 --- a/search/all_19.js +++ b/search/all_19.js @@ -22,7 +22,7 @@ var searchData= ['ternary_5fsearch_19',['ternary_search',['../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8',1,'ternary_search.cpp']]], ['ternary_5fsearch_2ecpp_20',['ternary_search.cpp',['../dc/dfe/ternary__search_8cpp.html',1,'']]], ['test_21',['Test',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29',1,'']]], - ['test_22',['test',['http://en.cppreference.com/w/cpp/utility/bitset/test.html',0,'std::bitset::test()'],['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): generate_parentheses.cpp'],['../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subarray_sum.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_bits_flip.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): elliptic_curve_key_exchange.cpp'],['../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fcfs_scheduling.cpp'],['../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): list_array.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segment_tree.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): treap.cpp'],['../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): abbreviation.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): house_robber.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): shortest_common_supersequence.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trapped_rainwater.cpp'],['../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): word_break.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jarvis_algorithm.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): connected_components_with_dsu.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): is_graph_bipartite.cpp'],['../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99',1,'spirograph::test()'],['../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jump_game.cpp'],['../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): md5.cpp'],['../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sha1.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): k_nearest_neighbors.cpp'],['../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): neural_network.cpp'],['../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): aliquot_sum.cpp'],['../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): area.cpp'],['../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981',1,'test(uint64_t n, uint64_t expected): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eulers_totient_function.cpp'],['../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci_sum.cpp'],['../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): iterative_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lcm_sum.cpp'],['../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_exponentiation.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_choose_r.cpp'],['../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): perimeter.cpp'],['../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_two.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): quadratic_equations_complex_numbers.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): babylonian_method.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): composite_simpson_rule.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inverse_fast_fourier_transform.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): midpoint_integral_method.cpp'],['../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rungekutta.cpp'],['../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): union_of_two_arrays.cpp'],['../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kadanes3.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): smallest_circle.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): ground_to_ground_projectile_motion.cpp'],['../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): geometric_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601',1,'test(const std::vector< int > &vals, int windowSize): windowed_median.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segtree.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): floyd_cycle_detection_algo.cpp'],['../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sublist_search.cpp'],['../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): bogo_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): heap_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): merge_insertion_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): pancake_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): selection_sort_recursive.cpp'],['../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wave_sort.cpp'],['../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test(): wiggle_sort.cpp'],['../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): manacher_algorithm.cpp'],['../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): z_function.cpp']]], + ['test_22',['test',['http://en.cppreference.com/w/cpp/utility/bitset/test.html',0,'std::bitset::test()'],['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): generate_parentheses.cpp'],['../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subarray_sum.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_bits_flip.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): elliptic_curve_key_exchange.cpp'],['../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fcfs_scheduling.cpp'],['../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): list_array.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segment_tree.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): treap.cpp'],['../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): abbreviation.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): house_robber.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): shortest_common_supersequence.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trapped_rainwater.cpp'],['../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): word_break.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jarvis_algorithm.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): connected_components_with_dsu.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): is_graph_bipartite.cpp'],['../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99',1,'spirograph::test()'],['../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kruskals_minimum_spanning_tree.cpp'],['../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): md5.cpp'],['../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sha1.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): k_nearest_neighbors.cpp'],['../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): neural_network.cpp'],['../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): aliquot_sum.cpp'],['../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): area.cpp'],['../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981',1,'test(uint64_t n, uint64_t expected): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eulers_totient_function.cpp'],['../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci_sum.cpp'],['../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): iterative_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lcm_sum.cpp'],['../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_exponentiation.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_choose_r.cpp'],['../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): perimeter.cpp'],['../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_two.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): quadratic_equations_complex_numbers.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): babylonian_method.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): composite_simpson_rule.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inverse_fast_fourier_transform.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): midpoint_integral_method.cpp'],['../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rungekutta.cpp'],['../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): union_of_two_arrays.cpp'],['../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kadanes3.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): smallest_circle.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): ground_to_ground_projectile_motion.cpp'],['../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): geometric_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601',1,'test(const std::vector< int > &vals, int windowSize): windowed_median.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segtree.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): floyd_cycle_detection_algo.cpp'],['../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sublist_search.cpp'],['../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): bogo_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): heap_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): merge_insertion_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): pancake_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): selection_sort_recursive.cpp'],['../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wave_sort.cpp'],['../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test(): wiggle_sort.cpp'],['../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): manacher_algorithm.cpp'],['../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): z_function.cpp']]], ['test_20examples_23',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]], ['test1_24',['test1',['../d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b',1,'test1(const std::string &text): hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499',1,'test1(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8',1,'test1(): large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5',1,'tests::test1()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a21d922dbb5905993960c6a7f0ba71ac0',1,'test1(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root): iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): recursive_tree_traversal.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): stooge_sort.cpp']]], ['test2_25',['test2',['../d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712',1,'test2(const std::string &text): hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2(): dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342',1,'test2(int64_t n): tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2(): hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82',1,'test2(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa',1,'test2(): large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669',1,'tests::test2()'],['../d8/d90/iterative__tree__traversals_8cpp.html#ac35ae2868441f8a11c965b87b2494f21',1,'test2(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root): iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): smallest_circle.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): stooge_sort.cpp']]], diff --git a/search/all_b.js b/search/all_b.js index 266443964..58a0eb128 100644 --- a/search/all_b.js +++ b/search/all_b.js @@ -93,7 +93,7 @@ var searchData= ['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_90',['finding_number_of_digits_in_a_number',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1',1,'finding_number_of_digits_in_a_number.cpp']]], ['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_2ecpp_91',['finding_number_of_digits_in_a_number.cpp',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html',1,'']]], ['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_5fusing_5flog_92',['finding_number_of_digits_in_a_number_using_log',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49',1,'finding_number_of_digits_in_a_number.cpp']]], - ['findminimumedge_93',['findMinimumEdge',['../d2/d90/namespacegreedy__algorithms.html#a127ce4403660032f53ae2e6467e5427d',1,'greedy_algorithms']]], + ['findminimumedge_93',['findMinimumEdge',['../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098',1,'greedy_algorithms']]], ['findminindex_94',['findMinIndex',['../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834',1,'sorting::selection_sort_recursive']]], ['findminnode_95',['findMinNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db',1,'operations_on_datastructures::inorder_traversal_of_bst']]], ['findnextgap_96',['FindNextGap',['../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5',1,'comb_sort.cpp']]], diff --git a/search/functions_14.js b/search/functions_14.js index c38241e00..9238d6ee0 100644 --- a/search/functions_14.js +++ b/search/functions_14.js @@ -9,7 +9,7 @@ var searchData= ['tellp_6',['tellp',['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::fstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_fstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::iostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::stringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::strstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_stringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wiostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostrstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wfstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_iostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wstringstream::tellp()']]], ['terminate_7',['terminate',['http://en.cppreference.com/w/cpp/error/terminate.html',0,'std']]], ['ternary_5fsearch_8',['ternary_search',['../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8',1,'ternary_search.cpp']]], - ['test_9',['test',['http://en.cppreference.com/w/cpp/utility/bitset/test.html',0,'std::bitset::test()'],['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): generate_parentheses.cpp'],['../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subarray_sum.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_bits_flip.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): elliptic_curve_key_exchange.cpp'],['../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fcfs_scheduling.cpp'],['../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): list_array.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segment_tree.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): treap.cpp'],['../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): abbreviation.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): house_robber.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): shortest_common_supersequence.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trapped_rainwater.cpp'],['../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): word_break.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jarvis_algorithm.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): connected_components_with_dsu.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): is_graph_bipartite.cpp'],['../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99',1,'spirograph::test()'],['../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jump_game.cpp'],['../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): md5.cpp'],['../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sha1.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): k_nearest_neighbors.cpp'],['../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): neural_network.cpp'],['../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): aliquot_sum.cpp'],['../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): area.cpp'],['../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981',1,'test(uint64_t n, uint64_t expected): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eulers_totient_function.cpp'],['../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci_sum.cpp'],['../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): iterative_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lcm_sum.cpp'],['../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_exponentiation.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_choose_r.cpp'],['../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): perimeter.cpp'],['../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_two.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): quadratic_equations_complex_numbers.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): babylonian_method.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): composite_simpson_rule.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inverse_fast_fourier_transform.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): midpoint_integral_method.cpp'],['../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rungekutta.cpp'],['../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): union_of_two_arrays.cpp'],['../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kadanes3.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): smallest_circle.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): ground_to_ground_projectile_motion.cpp'],['../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): geometric_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601',1,'test(const std::vector< int > &vals, int windowSize): windowed_median.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segtree.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): floyd_cycle_detection_algo.cpp'],['../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sublist_search.cpp'],['../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): bogo_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): heap_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): merge_insertion_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): pancake_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): selection_sort_recursive.cpp'],['../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wave_sort.cpp'],['../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test(): wiggle_sort.cpp'],['../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): manacher_algorithm.cpp'],['../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): z_function.cpp']]], + ['test_9',['test',['http://en.cppreference.com/w/cpp/utility/bitset/test.html',0,'std::bitset::test()'],['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): generate_parentheses.cpp'],['../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subarray_sum.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_bits_flip.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): elliptic_curve_key_exchange.cpp'],['../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fcfs_scheduling.cpp'],['../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): list_array.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segment_tree.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): treap.cpp'],['../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): abbreviation.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): house_robber.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): shortest_common_supersequence.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trapped_rainwater.cpp'],['../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): word_break.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jarvis_algorithm.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): connected_components_with_dsu.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): is_graph_bipartite.cpp'],['../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99',1,'spirograph::test()'],['../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kruskals_minimum_spanning_tree.cpp'],['../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): md5.cpp'],['../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sha1.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): k_nearest_neighbors.cpp'],['../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): neural_network.cpp'],['../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): aliquot_sum.cpp'],['../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): area.cpp'],['../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981',1,'test(uint64_t n, uint64_t expected): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eulers_totient_function.cpp'],['../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci_sum.cpp'],['../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): iterative_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lcm_sum.cpp'],['../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_exponentiation.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_choose_r.cpp'],['../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): perimeter.cpp'],['../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_two.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): quadratic_equations_complex_numbers.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): babylonian_method.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): composite_simpson_rule.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inverse_fast_fourier_transform.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): midpoint_integral_method.cpp'],['../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rungekutta.cpp'],['../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): union_of_two_arrays.cpp'],['../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kadanes3.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): smallest_circle.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): ground_to_ground_projectile_motion.cpp'],['../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): geometric_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601',1,'test(const std::vector< int > &vals, int windowSize): windowed_median.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segtree.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): floyd_cycle_detection_algo.cpp'],['../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sublist_search.cpp'],['../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): bogo_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): heap_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): merge_insertion_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): pancake_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): selection_sort_recursive.cpp'],['../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wave_sort.cpp'],['../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test(): wiggle_sort.cpp'],['../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): manacher_algorithm.cpp'],['../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): z_function.cpp']]], ['test1_10',['test1',['../d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b',1,'test1(const std::string &text): hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499',1,'test1(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8',1,'test1(): large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5',1,'tests::test1()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a21d922dbb5905993960c6a7f0ba71ac0',1,'test1(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root): iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): recursive_tree_traversal.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): stooge_sort.cpp']]], ['test2_11',['test2',['../d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712',1,'test2(const std::string &text): hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2(): dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342',1,'test2(int64_t n): tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2(): hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82',1,'test2(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa',1,'test2(): large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669',1,'tests::test2()'],['../d8/d90/iterative__tree__traversals_8cpp.html#ac35ae2868441f8a11c965b87b2494f21',1,'test2(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root): iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): smallest_circle.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): stooge_sort.cpp']]], ['test3_12',['test3',['../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299',1,'test3(): hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9',1,'test3(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_trace.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): golden_search_extrema.cpp'],['../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76',1,'tests::test3()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a425c4c8520991999ee6dbe13d99b87f4',1,'test3(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root): iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): smallest_circle.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): stooge_sort.cpp']]], diff --git a/search/functions_6.js b/search/functions_6.js index 1bc744d56..66cb2f37e 100644 --- a/search/functions_6.js +++ b/search/functions_6.js @@ -66,7 +66,7 @@ var searchData= ['find_5fzero_63',['find_zero',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3',1,'machine_learning::aystar_search::EightPuzzle']]], ['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_64',['finding_number_of_digits_in_a_number',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1',1,'finding_number_of_digits_in_a_number.cpp']]], ['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_5fusing_5flog_65',['finding_number_of_digits_in_a_number_using_log',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49',1,'finding_number_of_digits_in_a_number.cpp']]], - ['findminimumedge_66',['findMinimumEdge',['../d2/d90/namespacegreedy__algorithms.html#a127ce4403660032f53ae2e6467e5427d',1,'greedy_algorithms']]], + ['findminimumedge_66',['findMinimumEdge',['../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098',1,'greedy_algorithms']]], ['findminindex_67',['findMinIndex',['../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834',1,'sorting::selection_sort_recursive']]], ['findminnode_68',['findMinNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db',1,'operations_on_datastructures::inorder_traversal_of_bst']]], ['findnextgap_69',['FindNextGap',['../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5',1,'comb_sort.cpp']]],