diff --git a/annotated.html b/annotated.html index 1f3ca79a9..b34bb7447 100644 --- a/annotated.html +++ b/annotated.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -101,33 +103,33 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
Here are the classes, structs, unions and interfaces with brief descriptions:
-
[detail level 1234]
- +
[detail level 1234]
 ►NbacktrackingFor vector container
+ - - + + - - + + - + - + - + - + - + - + - - + + @@ -135,102 +137,102 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable(); - - + + - + - - + + - + - - + + - - + + - - + + - + - - - + + + - + - - + + - - + + - - + + - + - + - + - - + + - + - + - + - - + + - + - + - - + + - + - - + + - + - + - - + + - + @@ -257,8 +259,8 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable(); - - + + @@ -267,7 +269,7 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable(); - + @@ -278,7 +280,7 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable(); diff --git a/annotated_dup.js b/annotated_dup.js index 7ba91508f..1c25f351e 100644 --- a/annotated_dup.js +++ b/annotated_dup.js @@ -204,8 +204,8 @@ var annotated_dup = [ "Node", "db/d8b/struct_node.html", null ], [ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ], [ "query", "dd/d1b/structquery.html", null ], - [ "Queue", "dc/db5/struct_queue.html", null ], [ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ], + [ "Queue", "dc/db5/struct_queue.html", null ], [ "RBtree", "d8/d72/class_r_btree.html", null ], [ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ], [ "Solution", "dd/d4f/class_solution.html", null ], diff --git a/classes.html b/classes.html index 085b95a2e..c3461be29 100644 --- a/classes.html +++ b/classes.html @@ -3,16 +3,18 @@ - +Algorithms_in_C++: Class Index + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
 ►NbacktrackingFor vector container
 ►NciphersAlgorithms for encryption and decryption
 ►NciphersAlgorithms for encryption and decryption
 ►Ndata_structuresFor IO operations
 ►Ndata_structuresFor IO operations
 ►Ndivide_and_conquerFor std::vector
 ►Ndivide_and_conquerFor std::vector
 ►Ndouble_hashingAn implementation of hash table using double hashing algorithm
 ►Ndouble_hashingAn implementation of hash table using double hashing algorithm
 ►NgeometryFor std::vector
 ►NgeometryFor std::vector
 ►NgraphGraph Algorithms
 ►NgraphGraph Algorithms
 ►Ngreedy_algorithmsFor std::vector
 ►Ngreedy_algorithmsFor std::vector
 ►NhashingHashing algorithms
 ►NhashingHashing algorithms
 ►Nlinear_probingAn implementation of hash table using linear probing algorithm
 ►Nlinear_probingAn implementation of hash table using linear probing algorithm
 ►Nmachine_learningA* search algorithm
 ►Nmachine_learningA* search algorithm
 ►NmathFor IO operations
 ►NmathFor IO operations
 ►Noperations_on_datastructuresFor std::vector
 ►Noperations_on_datastructuresFor std::vector
 ►NothersFor vector
 ►NothersFor vector
 ►NprobabilityProbability algorithms
 ►NprobabilityProbability algorithms
 ►Nquadratic_probingAn implementation of hash table using quadratic probing algorithm
 ►Nquadratic_probingAn implementation of hash table using quadratic probing algorithm
 ►Nrange_queriesAlgorithms and Data Structures that support range queries and updates
 ►Nrange_queriesAlgorithms and Data Structures that support range queries and updates
 ►NsearchFor std::vector
 ►NsearchFor std::vector
 ►NstatisticsStatistical algorithms
 ►NstatisticsStatistical algorithms
 ►NstdSTL namespace
 ►NstdSTL namespace
 ►NstringsAlgorithms with strings
 ►NstringsAlgorithms with strings
 ►Cbinary_search_treeThe Binary Search Tree class
 ►Cbinary_search_treeThe Binary Search Tree class
 CBtree
 Ccll
 CNode
 CPoint
 Cquery
 CQueue
 Cqueue
 Cqueue
 CQueue
 CRBtree
 CSegmentIntersection
 CSolution
 CTestCaseSingle example inputs and expected output of the function longest_common_string_length
 CTestCasesClass encapsulating the necessary test cases
 Ctower
 ►CTrie
 ►CTrie
 Cuint128_tClass for 128-bit unsigned integer
 Cuint256_tClass for 256-bit unsigned integer
- + @@ -71,7 +73,7 @@ $(function() {
@@ -146,7 +148,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
pattern (strings::boyer_moore)
perSegTree (range_queries)
Point (ciphers::elliptic_curve_key_exchange)
Point (geometry::grahamscan)
Point (geometry::jarvis)
Point
Q
-
query
Queue
queue
Queue_Array (data_structures::queue_using_array)
+
query
queue
Queue
Queue_Array (data_structures::queue_using_array)
R
RBtree
RootedTree (graph)
@@ -168,7 +170,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); }) diff --git a/clipboard.js b/clipboard.js new file mode 100644 index 000000000..42c1fb0e0 --- /dev/null +++ b/clipboard.js @@ -0,0 +1,61 @@ +/** + +The code below is based on the Doxygen Awesome project, see +https://github.com/jothepro/doxygen-awesome-css + +MIT License + +Copyright (c) 2021 - 2022 jothepro + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in all +copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE +SOFTWARE. + +*/ + +let clipboard_title = "Copy to clipboard" +let clipboard_icon = `` +let clipboard_successIcon = `` +let clipboard_successDuration = 1000 + +$(function() { + if(navigator.clipboard) { + const fragments = document.getElementsByClassName("fragment") + for(const fragment of fragments) { + const clipboard_div = document.createElement("div") + clipboard_div.classList.add("clipboard") + clipboard_div.innerHTML = clipboard_icon + clipboard_div.title = clipboard_title + $(clipboard_div).click(function() { + const content = this.parentNode.cloneNode(true) + // filter out line number and folded fragments from file listings + content.querySelectorAll(".lineno, .ttc, .foldclosed").forEach((node) => { node.remove() }) + let text = content.textContent + // remove trailing newlines and trailing spaces from empty lines + text = text.replace(/^\s*\n/gm,'\n').replace(/\n*$/,'') + navigator.clipboard.writeText(text); + this.classList.add("success") + this.innerHTML = clipboard_successIcon + window.setTimeout(() => { // switch back to normal icon after timeout + this.classList.remove("success") + this.innerHTML = clipboard_icon + }, clipboard_successDuration); + }) + fragment.insertBefore(clipboard_div, fragment.firstChild) + } + } +}) diff --git a/cookie.js b/cookie.js new file mode 100644 index 000000000..53ad21d98 --- /dev/null +++ b/cookie.js @@ -0,0 +1,58 @@ +/*! + Cookie helper functions + Copyright (c) 2023 Dimitri van Heesch + Released under MIT license. +*/ +let Cookie = { + cookie_namespace: 'doxygen_', + + readSetting(cookie,defVal) { + if (window.chrome) { + const val = localStorage.getItem(this.cookie_namespace+cookie) || + sessionStorage.getItem(this.cookie_namespace+cookie); + if (val) return val; + } else { + let myCookie = this.cookie_namespace+cookie+"="; + if (document.cookie) { + const index = document.cookie.indexOf(myCookie); + if (index != -1) { + const valStart = index + myCookie.length; + let valEnd = document.cookie.indexOf(";", valStart); + if (valEnd == -1) { + valEnd = document.cookie.length; + } + return document.cookie.substring(valStart, valEnd); + } + } + } + return defVal; + }, + + writeSetting(cookie,val,days=10*365) { // default days='forever', 0=session cookie, -1=delete + if (window.chrome) { + if (days==0) { + sessionStorage.setItem(this.cookie_namespace+cookie,val); + } else { + localStorage.setItem(this.cookie_namespace+cookie,val); + } + } else { + let date = new Date(); + date.setTime(date.getTime()+(days*24*60*60*1000)); + const expiration = days!=0 ? "expires="+date.toGMTString()+";" : ""; + document.cookie = this.cookie_namespace + cookie + "=" + + val + "; SameSite=Lax;" + expiration + "path=/"; + } + }, + + eraseSetting(cookie) { + if (window.chrome) { + if (localStorage.getItem(this.cookie_namespace+cookie)) { + localStorage.removeItem(this.cookie_namespace+cookie); + } else if (sessionStorage.getItem(this.cookie_namespace+cookie)) { + sessionStorage.removeItem(this.cookie_namespace+cookie); + } + } else { + this.writeSetting(cookie,'',-1); + } + }, +} diff --git a/d0/d01/smallest__circle_8cpp.html b/d0/d01/smallest__circle_8cpp.html index 145c92a17..7df31e0b3 100644 --- a/d0/d01/smallest__circle_8cpp.html +++ b/d0/d01/smallest__circle_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/smallest_circle.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -122,21 +124,21 @@ Classes - + - + - + - + - + - + - + - +

Functions

double LenghtLine (const Point &A, const Point &B)
double LenghtLine (const Point &A, const Point &B)
 
double TriangleArea (const Point &A, const Point &B, const Point &C)
double TriangleArea (const Point &A, const Point &B, const Point &C)
 
bool PointInCircle (const std::vector< Point > &P, const Point &Center, double R)
bool PointInCircle (const std::vector< Point > &P, const Point &Center, double R)
 
double circle (const std::vector< Point > &P)
double circle (const std::vector< Point > &P)
 
void test ()
void test ()
 
void test2 ()
void test2 ()
 
void test3 ()
void test3 ()
 
int main ()
int main ()
 

Detailed Description

@@ -152,8 +154,7 @@ Functions double circle ( - const std::vector< Point > &  - P) + const std::vector< Point > & P) @@ -200,10 +201,10 @@ The function returns the radius of the circle and prints the coordinated of the
118 (P[i].x * (P[j].y - P[k].y) +
119 P[j].x * (P[k].y - P[i].y) +
120 P[k].x * (P[i].y - P[j].y)));
-
121 R = (LenghtLine(P[i], P[j]) * LenghtLine(P[j], P[k]) *
-
122 LenghtLine(P[k], P[i])) /
-
123 (4 * TriangleArea(P[i], P[j], P[k]));
-
124 if (!PointInCircle(P, C, R)) {
+
121 R = (LenghtLine(P[i], P[j]) * LenghtLine(P[j], P[k]) *
+
122 LenghtLine(P[k], P[i])) /
+
123 (4 * TriangleArea(P[i], P[j], P[k]));
+
124 if (!PointInCircle(P, C, R)) {
125 continue;
126 }
127 if (R <= minR) {
@@ -219,8 +220,8 @@ The function returns the radius of the circle and prints the coordinated of the
137 // check for diameterically opposite points
138 C.x = (P[i].x + P[j].x) / 2;
139 C.y = (P[i].y + P[j].y) / 2;
-
140 R = LenghtLine(C, P[i]);
-
141 if (!PointInCircle(P, C, R)) {
+
140 R = LenghtLine(C, P[i]);
+
141 if (!PointInCircle(P, C, R)) {
142 continue;
143 }
144 if (R <= minR) {
@@ -235,9 +236,9 @@ The function returns the radius of the circle and prints the coordinated of the
numerical_methods::simpson_method::k
double k(double x)
Another test function.
Definition composite_simpson_rule.cpp:117
std::endl
T endl(T... args)
std::vector::size
T size(T... args)
-
LenghtLine
double LenghtLine(const Point &A, const Point &B)
Definition smallest_circle.cpp:37
-
TriangleArea
double TriangleArea(const Point &A, const Point &B, const Point &C)
Definition smallest_circle.cpp:54
-
PointInCircle
bool PointInCircle(const std::vector< Point > &P, const Point &Center, double R)
Definition smallest_circle.cpp:72
+
LenghtLine
double LenghtLine(const Point &A, const Point &B)
Definition smallest_circle.cpp:37
+
TriangleArea
double TriangleArea(const Point &A, const Point &B, const Point &C)
Definition smallest_circle.cpp:54
+
PointInCircle
bool PointInCircle(const std::vector< Point > &P, const Point &Center, double R)
Definition smallest_circle.cpp:72
Point
Definition line_segment_intersection.cpp:12
Point::y
int y
Point respect to x coordinate.
Definition line_segment_intersection.cpp:14
@@ -257,19 +258,12 @@ Here is the call graph for this function:
double LenghtLine ( - const Point &  - A, + const Point & A, - const Point &  - B  - - - - ) - + const Point & B )
@@ -307,24 +301,23 @@ Here is the call graph for this function:
int main ( - void  - ) + void )

Main program

198 {
-
199 test();
+
199 test();
200 std::cout << std::endl;
-
201 test2();
+
201 test2();
202 std::cout << std::endl;
-
203 test3();
+
203 test3();
204 return 0;
205}
-
test2
void test2()
Definition smallest_circle.cpp:173
-
test3
void test3()
Definition smallest_circle.cpp:188
-
test
void test()
Definition smallest_circle.cpp:158
+
test2
void test2()
Definition smallest_circle.cpp:173
+
test3
void test3()
Definition smallest_circle.cpp:188
+
test
void test()
Definition smallest_circle.cpp:158
Here is the call graph for this function:
@@ -342,25 +335,17 @@ Here is the call graph for this function:
bool PointInCircle ( - const std::vector< Point > &  - P, + const std::vector< Point > & P, - const Point &  - Center, + const Point & Center, - double  - R  - - - - ) - + double R )
@@ -377,7 +362,7 @@ Here is the call graph for this function:
False if P lies outside the circle
72 {
73 for (size_t i = 0; i < P.size(); i++) {
-
74 if (LenghtLine(P[i], Center) > R)
+
74 if (LenghtLine(P[i], Center) > R)
75 return false;
76 }
77 return true;
@@ -399,7 +384,7 @@ Here is the call graph for this function:
void test ( - ) + ) @@ -415,10 +400,10 @@ Here is the call graph for this function:
162 Pv.push_back(Point(1, 3));
163 Pv.push_back(Point(4, 1));
164 Pv.push_back(Point(3, -2));
-
165 std::cout << circle(Pv) << std::endl;
+
165 std::cout << circle(Pv) << std::endl;
166}
std::vector::push_back
T push_back(T... args)
-
circle
double circle(const std::vector< Point > &P)
Definition smallest_circle.cpp:87
+
circle
double circle(const std::vector< Point > &P)
Definition smallest_circle.cpp:87
std::vector
Here is the call graph for this function:
@@ -437,7 +422,7 @@ Here is the call graph for this function: void test2 ( - ) + ) @@ -452,7 +437,7 @@ Here is the call graph for this function:
176 Pv.push_back(Point(0, 2));
177 Pv.push_back(Point(2, 2));
178 Pv.push_back(Point(2, 0));
-
179 std::cout << circle(Pv) << std::endl;
+
179 std::cout << circle(Pv) << std::endl;
180}
Here is the call graph for this function:
@@ -471,7 +456,7 @@ Here is the call graph for this function: void test3 ( - ) + ) @@ -479,14 +464,14 @@ Here is the call graph for this function:

Test case: result should be:
Circle with
radius 1.821078397711709
- centre at (2.142857142857143, 1.7857142857142856)

Todo:
This test fails
+ centre at (2.142857142857143, 1.7857142857142856)

Todo
This test fails
188 {
189 std::vector<Point> Pv;
190 Pv.push_back(Point(0.5, 1));
191 Pv.push_back(Point(3.5, 3));
192 Pv.push_back(Point(2.5, 0));
193 Pv.push_back(Point(2, 1.5));
-
194 std::cout << circle(Pv) << std::endl;
+
194 std::cout << circle(Pv) << std::endl;
195}
Here is the call graph for this function:
@@ -505,25 +490,17 @@ Here is the call graph for this function: double TriangleArea ( - const Point &  - A, + const Point & A, - const Point &  - B, + const Point & B, - const Point &  - C  - - - - ) - + const Point & C )
@@ -540,9 +517,9 @@ Here is the call graph for this function:
Returns
area of triangle
54 {
-
55 double a = LenghtLine(A, B);
-
56 double b = LenghtLine(B, C);
-
57 double c = LenghtLine(C, A);
+
55 double a = LenghtLine(A, B);
+
56 double b = LenghtLine(B, C);
+
57 double c = LenghtLine(C, A);
58 double p = (a + b + c) / 2;
59 return std::sqrt(p * (p - a) * (p - b) * (p - c));
60}
@@ -560,7 +537,7 @@ Here is the call graph for this function:
diff --git a/d0/d08/realtime__stats_8cpp.html b/d0/d08/realtime__stats_8cpp.html index a4ef59852..2b7a1606a 100644 --- a/d0/d08/realtime__stats_8cpp.html +++ b/d0/d08/realtime__stats_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/realtime_stats.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -131,9 +133,9 @@ Namespaces - + - +

Functions

void test_function (const float *test_data, const int number_of_samples)
void test_function (const float *test_data, const int number_of_samples)
 
int main (int argc, char **argv)
int main (int argc, char **argv)
 

Detailed Description

@@ -149,26 +151,19 @@ Functions int main ( - int  - argc, + int argc, - char **  - argv  - - - - ) - + char ** argv )

Main function

158 {
159 const float test_data1[] = {3, 4, 5, -1.4, -3.6, 1.9, 1.};
-
160 test_function(test_data1, sizeof(test_data1) / sizeof(test_data1[0]));
+
160 test_function(test_data1, sizeof(test_data1) / sizeof(test_data1[0]));
161
162 std::cout
163 << "Enter data. Any non-numeric data will terminate the data input."
@@ -215,7 +210,7 @@ Functions
statistics::stats_computer2::new_val
void new_val(T x)
Definition realtime_stats.cpp:77
statistics::stats_computer2::variance
double variance() const
Definition realtime_stats.cpp:89
std::endl
T endl(T... args)
-
test_function
void test_function(const float *test_data, const int number_of_samples)
Definition realtime_stats.cpp:118
+
test_function
void test_function(const float *test_data, const int number_of_samples)
Definition realtime_stats.cpp:118
Here is the call graph for this function:
@@ -233,19 +228,12 @@ Here is the call graph for this function:
void test_function ( - const float *  - test_data, + const float * test_data, - const int  - number_of_samples  - - - - ) - + const int number_of_samples )
@@ -307,7 +295,7 @@ Here is the call graph for this function:
diff --git a/d0/d0d/structmst-members.html b/d0/d0d/structmst-members.html index f84a5a216..2cc0183bd 100644 --- a/d0/d0d/structmst-members.html +++ b/d0/d0d/structmst-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d1/d77/structmst.html','../../'); init diff --git a/d0/d20/namespaceground__to__ground__projectile__motion.html b/d0/d20/namespaceground__to__ground__projectile__motion.html index 3231c0cc0..87a74803d 100644 --- a/d0/d20/namespaceground__to__ground__projectile__motion.html +++ b/d0/d20/namespaceground__to__ground__projectile__motion.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ground_to_ground_projectile_motion Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d0/d20/namespaceground__to__ground__pr

Functions for the Ground to ground projectile motion equation. -More...

+More...

Detailed Description

Functions for the Ground to ground projectile motion equation.

@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d0/d20/namespaceground__to__ground__pr diff --git a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map index 8d62ceeb6..8843b9629 100644 --- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map +++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map @@ -1,13 +1,13 @@ - - - - - + + + + + - - - - - + + + + + diff --git a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5 b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5 index b59483ff6..5de27528d 100644 --- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5 +++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5 @@ -1 +1 @@ -050eb78f2fe068cc94e311fbe15511ee \ No newline at end of file +c3f294eaa860a6b1bc98890ece84713d \ No newline at end of file diff --git a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg index 4a51bf710..de7852d47 100644 --- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg +++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg @@ -4,8 +4,8 @@ - + - + graph::RootedTree @@ -69,8 +69,8 @@ Node4 - -T + +T @@ -78,11 +78,12 @@ Node4->Node3 - - + + - keys + elements +keys diff --git a/d0/d24/classgraph_1_1_rooted_tree__coll__graph_org.svg b/d0/d24/classgraph_1_1_rooted_tree__coll__graph_org.svg index fec82f223..bd985190b 100644 --- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph_org.svg +++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph_org.svg @@ -4,9 +4,9 @@ - - + + graph::RootedTree @@ -59,8 +59,8 @@ Node4 - -T + +T @@ -68,11 +68,12 @@ Node4->Node3 - - + + - keys + elements +keys diff --git a/d0/d2b/namespacequick__sort.html b/d0/d2b/namespacequick__sort.html index a54326308..337edb836 100644 --- a/d0/d2b/namespacequick__sort.html +++ b/d0/d2b/namespacequick__sort.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: quick_sort Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d0/d2b/namespacequick__sort.html','../

Functions for the Quick sort implementation in C++. -More...

+More...

Detailed Description

Functions for the Quick sort implementation in C++.

@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d0/d2b/namespacequick__sort.html','../ diff --git a/d0/d2e/namespaceneural__network.html b/d0/d2e/namespaceneural__network.html index 54657d708..10c433b12 100644 --- a/d0/d2e/namespaceneural__network.html +++ b/d0/d2e/namespaceneural__network.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: neural_network Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d0/d2e/namespaceneural__network.html',

Neural Network or Multilayer Perceptron. -More...

+More...

Detailed Description

Neural Network or Multilayer Perceptron.

@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d0/d2e/namespaceneural__network.html', diff --git a/d0/d3e/classdata__structures_1_1trie.html b/d0/d3e/classdata__structures_1_1trie.html index 9cd5312d2..c460ae238 100644 --- a/d0/d3e/classdata__structures_1_1trie.html +++ b/d0/d3e/classdata__structures_1_1trie.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures::trie Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -108,7 +110,7 @@ $(document).ready(function(){initNavTree('d0/d3e/classdata__structures_1_1trie.h

Trie implementation for small-case English alphabets a-z - More...

+ More...

@@ -116,25 +118,25 @@ Public Member Functions   - + - + - +

Public Member Functions

trie ()=default
 Class default constructor.
 
void insert (const std::string &str)
void insert (const std::string &str)
 
bool search (const std::string &str, int index)
bool search (const std::string &str, int index)
 
bool deleteString (const std::string &str, int index)
bool deleteString (const std::string &str, int index)
 
- + - +

Private Member Functions

uint8_t char_to_int (const char &ch) const
uint8_t char_to_int (const char &ch) const
 Convert a character to integer for indexing.
 
bool search (const std::shared_ptr< trie > &root, const std::string &str, int index)
bool search (const std::shared_ptr< trie > &root, const std::string &str, int index)
 
+std::array< std::shared_ptr< trie >, NUM_CHARS<< 1 >  - - +

Private Attributes

-std::array< std::shared_ptr< trie >, NUM_CHARS<< 1 > arr
arr
 Recursive tree nodes as an array of shared-pointers.
 
@@ -164,8 +166,7 @@ static constexpr uint8_t N
uint8_t data_structures::trie::char_to_int (const char & ch)const char & ch) const
@@ -188,7 +189,7 @@ static constexpr uint8_t N
39 if (ch >= 'A' && ch <= 'Z') {
40 return ch - 'A';
41 } else if (ch >= 'a' && ch <= 'z') {
-
42 return ch - 'a' + NUM_CHARS;
+
42 return ch - 'a' + NUM_CHARS;
43 }
44
45 std::cerr << "Invalid character present. Exiting...";
@@ -196,7 +197,7 @@ static constexpr uint8_t N
47 return 0;
48 }
-
data_structures::trie::NUM_CHARS
static constexpr uint8_t NUM_CHARS
Number of alphabets.
Definition trie_tree.cpp:27
+
data_structures::trie::NUM_CHARS
static constexpr uint8_t NUM_CHARS
Number of alphabets.
Definition trie_tree.cpp:27
std::exit
T exit(T... args)
Here is the call graph for this function:
@@ -218,19 +219,12 @@ Here is the call graph for this function:
bool data_structures::trie::deleteString ( - const std::string &  - str, + const std::string & str, - int  - index  - - - - ) - + int index ) @@ -240,7 +234,7 @@ Here is the call graph for this function:

removes the string if it is not a prefix of any other string, if it is then just sets the ::data_structure::trie::isEndofWord to false, else removes the given string

Note
the function ::data_structure::trie::deleteString might be erroneous
-
Todo:
review the function ::data_structure::trie::deleteString and the commented lines
+
Todo
review the function ::data_structure::trie::deleteString and the commented lines
Parameters
@@ -253,29 +247,29 @@ Here is the call graph for this function:false if unsuccessful
134 {
135 if (index == str.length()) {
-
136 if (!isEndofWord) {
+
136 if (!isEndofWord) {
137 return false;
138 }
-
139 isEndofWord = false;
+
139 isEndofWord = false;
140 // following lines - possible source of error?
141 // for (int i = 0; i < NUM_CHARS; i++)
142 // if (!arr[i])
143 // return false;
144 return true;
145 }
-
146 int j = char_to_int(str[index]);
-
147 if (!arr[j]) {
+
146 int j = char_to_int(str[index]);
+
147 if (!arr[j]) {
148 return false;
149 }
-
150 bool var = deleteString(str, index + 1);
+
150 bool var = deleteString(str, index + 1);
151 if (var) {
-
152 arr[j].reset();
-
153 if (isEndofWord) {
+
152 arr[j].reset();
+
153 if (isEndofWord) {
154 return false;
155 } else {
156 int i = 0;
-
157 for (i = 0; i < NUM_CHARS; i++) {
-
158 if (arr[i]) {
+
157 for (i = 0; i < NUM_CHARS; i++) {
+
158 if (arr[i]) {
159 return false;
160 }
161 }
@@ -288,10 +282,10 @@ Here is the call graph for this function:
168 << "Should not reach this line\n";
169 return false;
170 }
-
data_structures::trie::arr
std::array< std::shared_ptr< trie >, NUM_CHARS<< 1 > arr
Recursive tree nodes as an array of shared-pointers.
Definition trie_tree.cpp:29
-
data_structures::trie::isEndofWord
bool isEndofWord
identifier if a node is terminal node
Definition trie_tree.cpp:30
-
data_structures::trie::char_to_int
uint8_t char_to_int(const char &ch) const
Convert a character to integer for indexing.
Definition trie_tree.cpp:38
-
data_structures::trie::deleteString
bool deleteString(const std::string &str, int index)
Definition trie_tree.cpp:134
+
data_structures::trie::arr
std::array< std::shared_ptr< trie >, NUM_CHARS<< 1 > arr
Recursive tree nodes as an array of shared-pointers.
Definition trie_tree.cpp:29
+
data_structures::trie::isEndofWord
bool isEndofWord
identifier if a node is terminal node
Definition trie_tree.cpp:30
+
data_structures::trie::char_to_int
uint8_t char_to_int(const char &ch) const
Convert a character to integer for indexing.
Definition trie_tree.cpp:38
+
data_structures::trie::deleteString
bool deleteString(const std::string &str, int index)
Definition trie_tree.cpp:134
std::string::length
T length(T... args)
Here is the call graph for this function:
@@ -313,8 +307,7 @@ Here is the call graph for this function: - - +
strstring to remove
void data_structures::trie::insert (const std::string & str)const std::string & str)
@@ -334,26 +327,26 @@ Here is the call graph for this function:
78 std::shared_ptr<trie> root(nullptr);
79
80 for (const char& ch : str) {
-
81 int j = char_to_int(ch);
+
81 int j = char_to_int(ch);
82 if (root) {
83 if (root->arr[j]) {
84 root = root->arr[j];
85 } else {
-
86 std::shared_ptr<trie> temp(new trie());
+
86 std::shared_ptr<trie> temp(new trie());
87 root->arr[j] = temp;
88 root = temp;
89 }
-
90 } else if (arr[j]) {
-
91 root = arr[j];
+
90 } else if (arr[j]) {
+
91 root = arr[j];
92 } else {
-
93 std::shared_ptr<trie> temp(new trie());
-
94 arr[j] = temp;
+
93 std::shared_ptr<trie> temp(new trie());
+
94 arr[j] = temp;
95 root = temp;
96 }
97 }
98 root->isEndofWord = true;
99 }
-
data_structures::trie::trie
trie()=default
Class default constructor.
+
data_structures::trie::trie
trie()=default
Class default constructor.
Here is the call graph for this function:
@@ -375,25 +368,17 @@ Here is the call graph for this function: bool data_structures::trie::search ( - const std::shared_ptr< trie > &  - root, + const std::shared_ptr< trie > & root, - const std::string &  - str, + const std::string & str, - int  - index  - - - - ) - + int index ) @@ -419,7 +404,7 @@ Here is the call graph for this function:
61 }
62 return true;
63 }
-
64 int j = char_to_int(str[index]);
+
64 int j = char_to_int(str[index]);
65 if (!root->arr[j]) {
66 return false;
67 }
@@ -446,19 +431,12 @@ Here is the call graph for this function: bool data_structures::trie::search ( - const std::string &  - str, + const std::string & str, - int  - index  - - - - ) - + int index ) @@ -479,16 +457,16 @@ Here is the call graph for this function: false if not found
107 {
108 if (index == str.length()) {
-
109 if (!isEndofWord) {
+
109 if (!isEndofWord) {
110 return false;
111 }
112 return true;
113 }
-
114 int j = char_to_int(str[index]);
-
115 if (!arr[j]) {
+
114 int j = char_to_int(str[index]);
+
115 if (!arr[j]) {
116 return false;
117 }
-
118 return search(arr[j], str, index + 1);
+
118 return search(arr[j], str, index + 1);
119 }
Here is the call graph for this function:
@@ -507,7 +485,7 @@ Here is the call graph for this function: diff --git a/d0/d46/finding__number__of__digits__in__a__number_8cpp.html b/d0/d46/finding__number__of__digits__in__a__number_8cpp.html index 111fb2daf..0c2826377 100644 --- a/d0/d46/finding__number__of__digits__in__a__number_8cpp.html +++ b/d0/d46/finding__number__of__digits__in__a__number_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/finding_number_of_digits_in_a_number.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -116,18 +118,18 @@ Include dependency graph for finding_number_of_digits_in_a_number.cpp:
- + - + - + - + - +

Functions

uint64_t finding_number_of_digits_in_a_number (uint64_t n)
uint64_t finding_number_of_digits_in_a_number (uint64_t n)
 for IO operations
 
double finding_number_of_digits_in_a_number_using_log (double n)
double finding_number_of_digits_in_a_number_using_log (double n)
 This function finds the number of digits in constant time using logarithmic function TC: O(1)
 
static void first_test ()
static void first_test ()
 Self-test implementations.
 
static void second_test ()
static void second_test ()
 
int main ()
int main ()
 Main function.
 
@@ -146,8 +148,7 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation uint64_t finding_number_of_digits_in_a_number ( - uint64_t  - n) + uint64_t n) @@ -190,8 +191,7 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation double finding_number_of_digits_in_a_number_using_log ( - double  - n) + double n) @@ -237,7 +237,7 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation static void first_test ( - ) + ) @@ -251,15 +251,15 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation

Self-test implementations.

Returns
void
73 {
-
74 assert(finding_number_of_digits_in_a_number(5492) == 4);
-
75 assert(finding_number_of_digits_in_a_number(-0) == 0);
-
76 assert(finding_number_of_digits_in_a_number(10000) == 5);
-
77 assert(finding_number_of_digits_in_a_number(9) == 1);
-
78 assert(finding_number_of_digits_in_a_number(100000) == 6);
-
79 assert(finding_number_of_digits_in_a_number(13) == 2);
-
80 assert(finding_number_of_digits_in_a_number(564) == 3);
+
74 assert(finding_number_of_digits_in_a_number(5492) == 4);
+
75 assert(finding_number_of_digits_in_a_number(-0) == 0);
+
76 assert(finding_number_of_digits_in_a_number(10000) == 5);
+
77 assert(finding_number_of_digits_in_a_number(9) == 1);
+
78 assert(finding_number_of_digits_in_a_number(100000) == 6);
+
79 assert(finding_number_of_digits_in_a_number(13) == 2);
+
80 assert(finding_number_of_digits_in_a_number(564) == 3);
81}
-
finding_number_of_digits_in_a_number
uint64_t finding_number_of_digits_in_a_number(uint64_t n)
for IO operations
Definition finding_number_of_digits_in_a_number.cpp:30
+
finding_number_of_digits_in_a_number
uint64_t finding_number_of_digits_in_a_number(uint64_t n)
for IO operations
Definition finding_number_of_digits_in_a_number.cpp:30
Here is the call graph for this function:
@@ -277,8 +277,7 @@ Here is the call graph for this function:
int main ( - void  - ) + void ) @@ -288,13 +287,13 @@ Here is the call graph for this function:
Returns
0 on exit
96 {
97 // run self-test implementations
-
98 first_test();
+
98 first_test();
99 second_test();
100 std::cout << "All tests have successfully passed!\n";
101 return 0;
102}
-
first_test
static void first_test()
Self-test implementations.
Definition finding_number_of_digits_in_a_number.cpp:73
+
first_test
static void first_test()
Self-test implementations.
Definition finding_number_of_digits_in_a_number.cpp:73
Here is the call graph for this function:
@@ -315,7 +314,7 @@ Here is the call graph for this function:
static void second_test ( - ) + ) @@ -326,15 +325,15 @@ Here is the call graph for this function:
83 {
-
84 assert(finding_number_of_digits_in_a_number_using_log(5492) == 4);
-
85 assert(finding_number_of_digits_in_a_number_using_log(-0) == 0);
-
86 assert(finding_number_of_digits_in_a_number_using_log(10000) == 5);
-
87 assert(finding_number_of_digits_in_a_number_using_log(9) == 1);
-
88 assert(finding_number_of_digits_in_a_number_using_log(100000) == 6);
-
89 assert(finding_number_of_digits_in_a_number_using_log(13) == 2);
-
90 assert(finding_number_of_digits_in_a_number_using_log(564) == 3);
+
84 assert(finding_number_of_digits_in_a_number_using_log(5492) == 4);
+
85 assert(finding_number_of_digits_in_a_number_using_log(-0) == 0);
+
86 assert(finding_number_of_digits_in_a_number_using_log(10000) == 5);
+
87 assert(finding_number_of_digits_in_a_number_using_log(9) == 1);
+
88 assert(finding_number_of_digits_in_a_number_using_log(100000) == 6);
+
89 assert(finding_number_of_digits_in_a_number_using_log(13) == 2);
+
90 assert(finding_number_of_digits_in_a_number_using_log(564) == 3);
91}
-
finding_number_of_digits_in_a_number_using_log
double finding_number_of_digits_in_a_number_using_log(double n)
This function finds the number of digits in constant time using logarithmic function TC: O(1)
Definition finding_number_of_digits_in_a_number.cpp:53
+
finding_number_of_digits_in_a_number_using_log
double finding_number_of_digits_in_a_number_using_log(double n)
This function finds the number of digits in constant time using logarithmic function TC: O(1)
Definition finding_number_of_digits_in_a_number.cpp:53
@@ -344,7 +343,7 @@ Here is the call graph for this function: diff --git a/d0/d51/approximate__pi_8cpp.html b/d0/d51/approximate__pi_8cpp.html index 3ad7e3dc1..5406a4f16 100644 --- a/d0/d51/approximate__pi_8cpp.html +++ b/d0/d51/approximate__pi_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/approximate_pi.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -100,8 +102,7 @@ $(document).ready(function(){initNavTree('d0/d51/approximate__pi_8cpp.html','../
Namespaces | Typedefs | -Functions | -Variables
+Functions
approximate_pi.cpp File Reference
@@ -126,28 +127,21 @@ Namespaces - - - + + +

Typedefs

-using math::Point = { double x
 structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1.
 
using math::Point
 structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1.
 
- + - + - + -

Functions

double math::approximate_pi (const std::vector< Point > &pts)
double math::approximate_pi (const std::vector< Point > &pts)
 This function uses the points in a given vector 'pts' (drawn at random) to return an approximation of the number π.
 
static void tests ()
static void tests ()
 Self-test implementations.
 
int main ()
int main ()
 Main function.
 
- - -

-Variables

-double math::y
 

Detailed Description

Implementation to calculate an estimate of the number π (Pi).

@@ -163,8 +157,7 @@ double math::y int main ( - void  - ) + void ) @@ -173,10 +166,10 @@ double math::yMain function.

Returns
0 on exit
80 {
-
81 tests(); // run self-test implementations
+
81 tests(); // run self-test implementations
82 return 0;
83}
-
tests
static void tests()
Self-test implementations.
Definition approximate_pi.cpp:62
+
tests
static void tests()
Self-test implementations.
Definition approximate_pi.cpp:62
Here is the call graph for this function:
@@ -197,7 +190,7 @@ Here is the call graph for this function:
static void tests ( - ) + ) @@ -213,9 +206,9 @@ Here is the call graph for this function:
62 {
63 std::vector<math::Point> rands;
64 for (std::size_t i = 0; i < 100000; i++) {
-
65 math::Point p;
-
66 p.x = rand() / static_cast<double>(RAND_MAX); // 0 <= x <= 1
-
67 p.y = rand() / static_cast<double>(RAND_MAX); // 0 <= y <= 1
+
65 math::Point p;
+
66 p.x = rand() / static_cast<double>(RAND_MAX); // 0 <= x <= 1
+
67 p.y = rand() / static_cast<double>(RAND_MAX); // 0 <= y <= 1
68 rands.push_back(p);
69 }
70 assert(math::approximate_pi(rands) > 3.135);
@@ -225,10 +218,9 @@ Here is the call graph for this function:
74}
std::endl
T endl(T... args)
-
math::Point
{ double x Point
structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1.
Definition approximate_pi.cpp:36
+
math::Point
struct { double x; double y;} Point
structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1.
Definition approximate_pi.cpp:35
math::approximate_pi
double approximate_pi(const std::vector< Point > &pts)
This function uses the points in a given vector 'pts' (drawn at random) to return an approximation of...
Definition approximate_pi.cpp:47
std::vector::push_back
T push_back(T... args)
-
std::rand
T rand(T... args)
@@ -245,7 +237,7 @@ Here is the call graph for this function:
diff --git a/d0/d51/approximate__pi_8cpp.js b/d0/d51/approximate__pi_8cpp.js index c85844089..b457e0450 100644 --- a/d0/d51/approximate__pi_8cpp.js +++ b/d0/d51/approximate__pi_8cpp.js @@ -1,6 +1,6 @@ var approximate__pi_8cpp = [ - [ "Point", "d0/d51/approximate__pi_8cpp.html#a937dc0c826acf3e6c0d2785527f7e9d7", null ], + [ "Point", "d0/d51/approximate__pi_8cpp.html#a006c8ebd11bb1e035815dc835a1a7a85", null ], [ "approximate_pi", "d0/d51/approximate__pi_8cpp.html#abf7f2a6d91f1ca6c89698792aea3f188", null ], [ "main", "d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "tests", "d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ] diff --git a/d0/d52/namespacewiggle__sort.html b/d0/d52/namespacewiggle__sort.html index 826ebd87b..d708b4ccd 100644 --- a/d0/d52/namespacewiggle__sort.html +++ b/d0/d52/namespacewiggle__sort.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: wiggle_sort Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d0/d52/namespacewiggle__sort.html','..

Functions for Wiggle Sort algorithm. -More...

+More...

Detailed Description

Functions for Wiggle Sort algorithm.

@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d0/d52/namespacewiggle__sort.html','.. diff --git a/d0/d55/classcll-members.html b/d0/d55/classcll-members.html index 50e791777..d1d5665d7 100644 --- a/d0/d55/classcll-members.html +++ b/d0/d55/classcll-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -119,7 +121,7 @@ $(document).ready(function(){initNavTree('d5/d15/classcll.html','../../'); initR diff --git a/d0/d58/classgraph_1_1_rooted_tree.html b/d0/d58/classgraph_1_1_rooted_tree.html index f97e61a1e..4edb6e6ca 100644 --- a/d0/d58/classgraph_1_1_rooted_tree.html +++ b/d0/d58/classgraph_1_1_rooted_tree.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph::RootedTree Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -113,15 +115,15 @@ Inheritance diagram for graph::RootedTree:
Collaboration diagram for graph::RootedTree:
-
+
[legend]
- + - + @@ -146,7 +148,7 @@ Public Attributes int  - + @@ -154,7 +156,7 @@ int 

Public Member Functions

 RootedTree (const std::vector< std::pair< int, int > > &undirected_edges, int root_)
 RootedTree (const std::vector< std::pair< int, int > > &undirected_edges, int root_)
 Constructs the tree by calculating parent for every vertex. Assumes a valid description of a tree is provided.
 
- Public Member Functions inherited from graph::Graph< T >
- Public Member Functions inherited from graph::Graph< T >
void add_edge (T u, T v, bool bidir=true)
 
std::map< T, bool > breadth_first_search (T src)
root
 Index of the root vertex.
 
- Public Attributes inherited from graph::Graph< T >
- Public Attributes inherited from graph::Graph< T >
std::vector< std::vector< int > > neighbors
 for each vertex it stores a list indicies of its neighbors
root
- +

Protected Member Functions

void populate_parents ()
void populate_parents ()
 Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm starting from the root vertex searching the entire tree and labeling parents for all vertices.
 
@@ -173,19 +175,12 @@ Protected Member Functions graph::RootedTree::RootedTree ( - const std::vector< std::pair< int, int > > &  - undirected_edges, + const std::vector< std::pair< int, int > > & undirected_edges, - int  - root_  - - - - ) - + int root_ ) @@ -203,12 +198,12 @@ Protected Member Functions -
95 : Graph(undirected_edges.size() + 1, undirected_edges), root(root_) {
-
96 populate_parents();
+
95 : Graph(undirected_edges.size() + 1, undirected_edges), root(root_) {
+
96 populate_parents();
97 }
Graph
Definition bellman_ford.cpp:13
-
graph::RootedTree::root
int root
Index of the root vertex.
Definition lowest_common_ancestor.cpp:108
-
graph::RootedTree::populate_parents
void populate_parents()
Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...
Definition lowest_common_ancestor.cpp:117
+
graph::RootedTree::root
int root
Index of the root vertex.
Definition lowest_common_ancestor.cpp:108
+
graph::RootedTree::populate_parents
void populate_parents()
Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...
Definition lowest_common_ancestor.cpp:117
std::vector::size
T size(T... args)
Here is the call graph for this function:
@@ -231,7 +226,7 @@ Here is the call graph for this function:
void graph::RootedTree::populate_parents ( - ) + ) @@ -247,20 +242,20 @@ Here is the call graph for this function:
117 {
118 // Initialize the vector with -1 which indicates the vertex
119 // wasn't yet visited.
-
120 parent = std::vector<int>(number_of_vertices(), -1);
-
121 level = std::vector<int>(number_of_vertices());
-
122 parent[root] = root;
-
123 level[root] = 0;
+
120 parent = std::vector<int>(number_of_vertices(), -1);
+
121 level = std::vector<int>(number_of_vertices());
+
122 parent[root] = root;
+
123 level[root] = 0;
124 std::queue<int> queue_of_vertices;
-
125 queue_of_vertices.push(root);
+
125 queue_of_vertices.push(root);
126 while (!queue_of_vertices.empty()) {
127 int vertex = queue_of_vertices.front();
128 queue_of_vertices.pop();
129 for (int neighbor : neighbors[vertex]) {
130 // As long as the vertex was not yet visited.
-
131 if (parent[neighbor] == -1) {
-
132 parent[neighbor] = vertex;
-
133 level[neighbor] = level[vertex] + 1;
+
131 if (parent[neighbor] == -1) {
+
132 parent[neighbor] = vertex;
+
133 level[neighbor] = level[vertex] + 1;
134 queue_of_vertices.push(neighbor);
135 }
136 }
@@ -268,8 +263,8 @@ Here is the call graph for this function:
138 }
graph::Graph::neighbors
std::vector< std::vector< int > > neighbors
for each vertex it stores a list indicies of its neighbors
Definition lowest_common_ancestor.cpp:77
graph::Graph::number_of_vertices
int number_of_vertices() const
Definition lowest_common_ancestor.cpp:74
-
graph::RootedTree::level
std::vector< int > level
Stores the distance from the root.
Definition lowest_common_ancestor.cpp:106
-
graph::RootedTree::parent
std::vector< int > parent
Stores parent of every vertex and for root its own index. The root is technically not its own parent,...
Definition lowest_common_ancestor.cpp:104
+
graph::RootedTree::level
std::vector< int > level
Stores the distance from the root.
Definition lowest_common_ancestor.cpp:106
+
graph::RootedTree::parent
std::vector< int > parent
Stores parent of every vertex and for root its own index. The root is technically not its own parent,...
Definition lowest_common_ancestor.cpp:104
std::queue::empty
T empty(T... args)
std::queue::front
T front(T... args)
std::queue::pop
T pop(T... args)
@@ -293,7 +288,7 @@ Here is the call graph for this function: diff --git a/d0/d5a/skip__list_8cpp.html b/d0/d5a/skip__list_8cpp.html index 33cb988f6..60e0cb222 100644 --- a/d0/d5a/skip__list_8cpp.html +++ b/d0/d5a/skip__list_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/skip_list.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -135,7 +137,7 @@ Namespaces - +

Functions

int main ()
int main ()
 
- - +

@@ -165,8 +167,7 @@ constexpr float 

data_struc
int main (void )void )
@@ -208,7 +209,7 @@ Here is the call graph for this function:
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html index f4b0eb13c..ec4d190a5 100644 --- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html +++ b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: operations_on_datastructures::trie_operations::Tnode Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('d0/d5f/classoperations__on__datastruct

Class defining the structure of trie node and containing the methods to perform operations on them. - More...

+ More...

Collaboration diagram for operations_on_datastructures::trie_operations::Tnode:
@@ -116,7 +118,7 @@ Collaboration diagram for operations_on_datastructures::trie_operations::Tnode:< - + @@ -127,34 +129,34 @@ Public Member Functions - + - + - + - + - + - + - + - + - + - +

Public Member Functions

 Tnode (const Tnode &node)
 Tnode (const Tnode &node)
 
Tnode & operator= (const Tnode &node)=default
Tnode & operator= (Tnode &&)=default
 
uint8_t numberOfChildren (Tnode *node)
uint8_t numberOfChildren (Tnode *node)
 Function to count the number of children a node in the trie has.
 
void Insert (const std::string &entry)
void Insert (const std::string &entry)
 Function to insert a word in the trie.
 
void Delete (std::string entry)
void Delete (std::string entry)
 Function to verify presence and hence delete an entry from the trie.
 
void DeleteFrom (Tnode *delete_from, std::string delete_string, int remove_index)
void DeleteFrom (Tnode *delete_from, std::string delete_string, int remove_index)
 Function recursively deletes the substring character by character iterating through the string to be deleted. It traverses till the end of word in a recursive fashion, from there it deletes characters one by one till it reaches back to the initial call.
 
bool SearchPresence (const std::string &key)
bool SearchPresence (const std::string &key)
 Function to check a word's presence in the trie (Basic)
 
void SuggestAutocomplete (Tnode *new_root, const std::string &prefix)
void SuggestAutocomplete (Tnode *new_root, const std::string &prefix)
 Recursive function to suggest all the entries of trie which have a given common prefix.
 
void SearchSuggestions (const std::string &key)
void SearchSuggestions (const std::string &key)
 Lists out all the words in trie with the longest prefix of the search key that is present in the trie. For example - if trie contains "abc", "abcde", "abcdefg", "abcddef" and if the search key is "abcdezz", then the longest common prefix is "abcde" and hence search results will be "abcde", "abcdefg".
 
void SuggestFreqAutocomplete (Tnode *new_root, const std::string &prefix, std::priority_queue< std::pair< int, std::string > > *suggestions)
void SuggestFreqAutocomplete (Tnode *new_root, const std::string &prefix, std::priority_queue< std::pair< int, std::string > > *suggestions)
 Recursive function to suggest most frequently searched entries of trie which have a given common prefix.
 
void SearchFreqSuggestions (const std::string &key)
void SearchFreqSuggestions (const std::string &key)
 Lists out the most frequent words in trie with the longest prefix of the search key that is present in the trie. For example - if trie contains "abc", "abcde", "abcdefg", "abcddef" and they have been previously searched for 3, 1, 2, 4 times respectively, if the search key is "ab", then the longest common prefix is "ab" and only the top 3 frequencies among the matches would be displayed viz. "abcddef", "abc", "abcdefg".
 
void SelectionTop_3 (std::priority_queue< std::pair< int, std::string > > *suggestions)
void SelectionTop_3 (std::priority_queue< std::pair< int, std::string > > *suggestions)
 Function to display the 3 suggestions with highest frequency of search hits.
 
@@ -191,7 +193,7 @@ static constexpr uint8_t  - +
E
operations_on_datastructures::trie_operations::Tnode::Tnode ())
@@ -221,8 +223,7 @@ static constexpr uint8_t E operations_on_datastructures::trie_operations::Tnode::Tnode ( - const Tnode &  - node) + const Tnode & node) @@ -253,7 +254,7 @@ static constexpr uint8_t E operations_on_datastructures::trie_operations::Tnode::~Tnode ( - ) + ) @@ -284,8 +285,7 @@ static constexpr uint8_t E void operations_on_datastructures::trie_operations::Tnode::Delete ( - std::string  - entry) + std::string entry) @@ -315,7 +315,7 @@ static constexpr uint8_t E
164 // If the current node is end of word for the current prefix or if it
165 // has 2 or more branches It cannot be deleted while deleting the
166 // required entry.
-
167 if (numberOfChildren(cur_pos) > 1 || cur_pos->endOfWord) {
+
167 if (numberOfChildren(cur_pos) > 1 || cur_pos->endOfWord) {
168 delete_from = cur_pos; // denotes the beginning of the shortest
169 // suffix that is allowed to be deleted
170 delete_from_index = i - 1; // Beginning index of the suffix
@@ -335,7 +335,7 @@ static constexpr uint8_t E
184
185 // If cur_pos is not a leaf node, unmark end of word and assign 0 to it's
186 // frequency for deletion
-
187 if (numberOfChildren(cur_pos)) {
+
187 if (numberOfChildren(cur_pos)) {
188 cur_pos->endOfWord = false;
189 cur_pos->frequency = 0;
190 return;
@@ -351,7 +351,7 @@ static constexpr uint8_t E
200 // If number of characters in the suffix are more than 1, recursively delete
201 // each character starting from cur_pos using the helper function
202 if (n > delete_from_index + 2) {
-
203 DeleteFrom(cur_pos, entry, delete_from_index + 2);
+
203 DeleteFrom(cur_pos, entry, delete_from_index + 2);
204 }
205 // If the suffix is only 1 char in length
206 else {
@@ -359,8 +359,8 @@ static constexpr uint8_t E
208 }
209}
-
operations_on_datastructures::trie_operations::Tnode::DeleteFrom
void DeleteFrom(Tnode *delete_from, std::string delete_string, int remove_index)
Function recursively deletes the substring character by character iterating through the string to be ...
Definition trie_multiple_search.cpp:134
-
operations_on_datastructures::trie_operations::Tnode::numberOfChildren
uint8_t numberOfChildren(Tnode *node)
Function to count the number of children a node in the trie has.
Definition trie_multiple_search.cpp:69
+
operations_on_datastructures::trie_operations::Tnode::DeleteFrom
void DeleteFrom(Tnode *delete_from, std::string delete_string, int remove_index)
Function recursively deletes the substring character by character iterating through the string to be ...
Definition trie_multiple_search.cpp:134
+
operations_on_datastructures::trie_operations::Tnode::numberOfChildren
uint8_t numberOfChildren(Tnode *node)
Function to count the number of children a node in the trie has.
Definition trie_multiple_search.cpp:69
std::endl
T endl(T... args)
std::string::size
T size(T... args)
std::tolower
T tolower(T... args)
@@ -381,25 +381,17 @@ Here is the call graph for this function:
void operations_on_datastructures::trie_operations::Tnode::DeleteFrom ( - Tnode *  - delete_from, + Tnode * delete_from, - std::string  - delete_string, + std::string delete_string, - int  - remove_index  - - - - ) - + int remove_index )
@@ -417,7 +409,7 @@ Here is the call graph for this function:
136 if (delete_string.size() == remove_index) {
137 int letter_index = tolower(delete_string[remove_index]) - 97;
138
-
139 DeleteFrom(delete_from->english[letter_index], delete_string,
+
139 DeleteFrom(delete_from->english[letter_index], delete_string,
140 remove_index + 1);
141
142 delete delete_from;
@@ -440,8 +432,7 @@ Here is the call graph for this function:
void operations_on_datastructures::trie_operations::Tnode::Insert ( - const std::string &  - entry) + const std::string & entry) @@ -488,8 +479,7 @@ Here is the call graph for this function: uint8_t operations_on_datastructures::trie_operations::Tnode::numberOfChildren ( - Tnode *  - node) + Tnode * node) @@ -530,8 +520,7 @@ Here is the call graph for this function: void operations_on_datastructures::trie_operations::Tnode::SearchFreqSuggestions ( - const std::string &  - key) + const std::string & key) @@ -565,9 +554,9 @@ Here is the call graph for this function:
383 // When the node for the character does not exist, longest prefix has
384 // been determined and SuggestFreqAutocomplete is called
385 if (cur_pos->english[letter_index] == nullptr) {
-
386 SuggestFreqAutocomplete(prev_pos, prefix, Suggestions);
+
386 SuggestFreqAutocomplete(prev_pos, prefix, Suggestions);
387 // To display the top 3 results
-
388 SelectionTop_3(Suggestions);
+
388 SelectionTop_3(Suggestions);
389 std::cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - "
390 << std::endl;
391 return;
@@ -586,17 +575,17 @@ Here is the call graph for this function:
404
405 // Call for Suggestions when the search key is present as an entry/a prefix
406 // in the trie
-
407 SuggestFreqAutocomplete(cur_pos, prefix, Suggestions);
+
407 SuggestFreqAutocomplete(cur_pos, prefix, Suggestions);
408 // Display the top 3 results
-
409 SelectionTop_3(Suggestions);
+
409 SelectionTop_3(Suggestions);
410
411 std::cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - "
412 << std::endl;
413 return;
414}
-
operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete
void SuggestFreqAutocomplete(Tnode *new_root, const std::string &prefix, std::priority_queue< std::pair< int, std::string > > *suggestions)
Recursive function to suggest most frequently searched entries of trie which have a given common pref...
Definition trie_multiple_search.cpp:337
-
operations_on_datastructures::trie_operations::Tnode::SelectionTop_3
void SelectionTop_3(std::priority_queue< std::pair< int, std::string > > *suggestions)
Function to display the 3 suggestions with highest frequency of search hits.
Definition trie_multiple_search.cpp:317
+
operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete
void SuggestFreqAutocomplete(Tnode *new_root, const std::string &prefix, std::priority_queue< std::pair< int, std::string > > *suggestions)
Recursive function to suggest most frequently searched entries of trie which have a given common pref...
Definition trie_multiple_search.cpp:337
+
operations_on_datastructures::trie_operations::Tnode::SelectionTop_3
void SelectionTop_3(std::priority_queue< std::pair< int, std::string > > *suggestions)
Function to display the 3 suggestions with highest frequency of search hits.
Definition trie_multiple_search.cpp:317
Here is the call graph for this function:
@@ -615,8 +604,7 @@ Here is the call graph for this function: bool operations_on_datastructures::trie_operations::Tnode::SearchPresence ( - const std::string &  - key) + const std::string & key) @@ -665,8 +653,7 @@ false if the key is not found void operations_on_datastructures::trie_operations::Tnode::SearchSuggestions ( - const std::string &  - key) + const std::string & key) @@ -694,7 +681,7 @@ false if the key is not found
283 // When the node for the character does not exist, longest prefix has
284 // been determined and SuggestAutocomplete is called
285 if (cur_pos->english[letter_index] == nullptr) {
-
286 SuggestAutocomplete(prev_pos, prefix);
+
286 SuggestAutocomplete(prev_pos, prefix);
287 std::cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - "
288 << std::endl;
289 return;
@@ -713,12 +700,12 @@ false if the key is not found
302
303 // Call for suggestions when the search key is present as an entry/a prefix
304 // in the trie
-
305 SuggestAutocomplete(cur_pos, prefix);
+
305 SuggestAutocomplete(cur_pos, prefix);
306 std::cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - "
307 << std::endl;
308 return;
309}
-
operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete
void SuggestAutocomplete(Tnode *new_root, const std::string &prefix)
Recursive function to suggest all the entries of trie which have a given common prefix.
Definition trie_multiple_search.cpp:246
+
operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete
void SuggestAutocomplete(Tnode *new_root, const std::string &prefix)
Recursive function to suggest all the entries of trie which have a given common prefix.
Definition trie_multiple_search.cpp:246
Here is the call graph for this function:
@@ -736,8 +723,7 @@ Here is the call graph for this function:
void operations_on_datastructures::trie_operations::Tnode::SelectionTop_3 ( - std::priority_queue< std::pair< int, std::string > > *  - suggestions) + std::priority_queue< std::pair< int, std::string > > * suggestions) @@ -778,19 +764,12 @@ Here is the call graph for this function: void operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete ( - Tnode *  - new_root, + Tnode * new_root, - const std::string &  - prefix  - - - - ) - + const std::string & prefix )
@@ -815,7 +794,7 @@ Here is the call graph for this function:
255 std::cout << prefix + char(i + 97) << std::endl;
256 }
257
-
258 SuggestAutocomplete(new_root->english[i], prefix + char(i + 97));
+
258 SuggestAutocomplete(new_root->english[i], prefix + char(i + 97));
259 }
260 }
261}
@@ -836,25 +815,17 @@ Here is the call graph for this function: void operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete ( - Tnode *  - new_root, + Tnode * new_root, - const std::string &  - prefix, + const std::string & prefix, - std::priority_queue< std::pair< int, std::string > > *  - suggestions  - - - - ) - + std::priority_queue< std::pair< int, std::string > > * suggestions )
@@ -879,7 +850,7 @@ Here is the call graph for this function:
347 new_root->english[i]->frequency, prefix + char(i + 97)));
348 }
349
-
350 SuggestFreqAutocomplete(new_root->english[i], prefix + char(i + 97),
+
350 SuggestFreqAutocomplete(new_root->english[i], prefix + char(i + 97),
351 suggestions);
352 }
353 }
@@ -903,7 +874,7 @@ Here is the call graph for this function: diff --git a/d0/d62/struct_queue-members.html b/d0/d62/struct_queue-members.html index d2e3ed965..0c76be7d5 100644 --- a/d0/d62/struct_queue-members.html +++ b/d0/d62/struct_queue-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -118,7 +120,7 @@ $(document).ready(function(){initNavTree('dc/db5/struct_queue.html','../../'); i diff --git a/d0/d65/namespacedouble__hashing.html b/d0/d65/namespacedouble__hashing.html index d2392c388..878a44b12 100644 --- a/d0/d65/namespacedouble__hashing.html +++ b/d0/d65/namespacedouble__hashing.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: double_hashing Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('d0/d65/namespacedouble__hashing.html',

An implementation of hash table using double hashing algorithm. -More...

+More...

@@ -116,36 +118,36 @@ Classes

Classes

- - + +

Typedefs

-using Entry = Entry
 
+using Entry = struct Entry
 
- + - + - + - + - + - + - + - + - + - + - +

Functions

bool putProber (const Entry &entry, int key)
bool putProber (const Entry &entry, int key)
 
bool searchingProber (const Entry &entry, int key)
bool searchingProber (const Entry &entry, int key)
 
void add (int key)
void add (int key)
 
size_t hashFxn (int key)
size_t hashFxn (int key)
 Hash a key. Uses the STL library's std::hash() function.
 
size_t otherHashFxn (int key)
size_t otherHashFxn (int key)
 Used for second hash function.
 
int doubleHash (int key, bool searching)
int doubleHash (int key, bool searching)
 Performs double hashing to resolve collisions.
 
void display ()
void display ()
 
void rehash ()
void rehash ()
 
void remove (int key)
void remove (int key)
 
void addInfo (int key)
void addInfo (int key)
 
void removalInfo (int key)
void removalInfo (int key)
 
- - +

@@ -181,8 +183,7 @@ bool 

rehashing void double_hashing::add (int key)int key)
@@ -196,15 +197,15 @@ bool rehashing
185 {
186 // auto* entry = new Entry();
187 // entry->key = key;
-
188 int index = doubleHash(key, false);
+
188 int index = doubleHash(key, false);
189 table[index].key = key;
190 // Load factor greater than 0.5 causes resizing
191 if (++size / static_cast<double>(totalSize) >= 0.5) {
-
192 rehash();
+
192 rehash();
193 }
194}
-
double_hashing::doubleHash
int doubleHash(int key, bool searching)
Performs double hashing to resolve collisions.
Definition double_hash_hash_table.cpp:71
-
double_hashing::rehash
void rehash()
Definition double_hash_hash_table.cpp:161
+
double_hashing::doubleHash
int doubleHash(int key, bool searching)
Performs double hashing to resolve collisions.
Definition double_hash_hash_table.cpp:71
+
double_hashing::rehash
void rehash()
Definition double_hash_hash_table.cpp:161
Here is the call graph for this function:
@@ -222,8 +223,7 @@ Here is the call graph for this function:
void double_hashing::addInfo ( - int  - key) + int key) @@ -238,8 +238,8 @@ Here is the call graph for this function:
213 std::cout << "Initial table: ";
214 display();
215 std::cout << std::endl;
-
216 std::cout << "hash of " << key << " is " << hashFxn(key) << " % "
-
217 << totalSize << " == " << hashFxn(key) % totalSize;
+
216 std::cout << "hash of " << key << " is " << hashFxn(key) << " % "
+
217 << totalSize << " == " << hashFxn(key) % totalSize;
218 std::cout << std::endl;
219 add(key);
220 std::cout << "New table: ";
@@ -247,7 +247,7 @@ Here is the call graph for this function:
222}
std::endl
T endl(T... args)
-
double_hashing::hashFxn
size_t hashFxn(int key)
Hash a key. Uses the STL library's std::hash() function.
Definition double_hash_hash_table.cpp:47
+
double_hashing::hashFxn
size_t hashFxn(int key)
Hash a key. Uses the STL library's std::hash() function.
Definition double_hash_hash_table.cpp:47
add
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:37
Here is the call graph for this function:
@@ -266,7 +266,7 @@ Here is the call graph for this function: void double_hashing::display ( - ) + ) @@ -303,19 +303,12 @@ Here is the call graph for this function: int double_hashing::doubleHash ( - int  - key, + int key, - bool  - searching  - - - - ) - + bool searching )
@@ -332,12 +325,12 @@ Here is the call graph for this function:
new hash if no conflicts present
71 {
-
72 int hash = static_cast<int>(hashFxn(key));
+
72 int hash = static_cast<int>(hashFxn(key));
73 int i = 0;
74 Entry entry;
75 do {
76 int index =
-
77 static_cast<int>(hash + (i * otherHashFxn(key))) % totalSize;
+
77 static_cast<int>(hash + (i * otherHashFxn(key))) % totalSize;
78 entry = table[index];
79 if (searching) {
80 if (entry.key == notPresent) {
@@ -351,7 +344,7 @@ new hash if no conflicts present
88 << std::endl;
89 i++;
90 } else {
-
91 if (putProber(entry, key)) {
+
91 if (putProber(entry, key)) {
92 if (!rehashing) {
93 std::cout << "Spot found!" << std::endl;
94 }
@@ -360,7 +353,7 @@ new hash if no conflicts present
97 if (!rehashing) {
98 std::cout << "Spot taken, looking at next (next index:"
99 << " "
-
100 << static_cast<int>(hash + (i * otherHashFxn(key))) %
+
100 << static_cast<int>(hash + (i * otherHashFxn(key))) %
101 totalSize
102 << ")" << std::endl;
103 }
@@ -374,8 +367,8 @@ new hash if no conflicts present
111 return notPresent;
112}
hashing::md5::hash
void * hash(const std::string &message)
Converts the string to bytestring and calls the main algorithm.
Definition md5.cpp:287
-
double_hashing::otherHashFxn
size_t otherHashFxn(int key)
Used for second hash function.
Definition double_hash_hash_table.cpp:58
-
double_hashing::putProber
bool putProber(const Entry &entry, int key)
Definition double_hash_hash_table.cpp:120
+
double_hashing::otherHashFxn
size_t otherHashFxn(int key)
Used for second hash function.
Definition double_hash_hash_table.cpp:58
+
double_hashing::putProber
bool putProber(const Entry &entry, int key)
Definition double_hash_hash_table.cpp:120
double_hashing::Entry
Definition double_hash_hash_table.cpp:36
double_hashing::Entry::key
int key
key value
Definition double_hash_hash_table.cpp:38
@@ -395,8 +388,7 @@ Here is the call graph for this function:
size_t double_hashing::hashFxn ( - int  - key) + int key) @@ -427,8 +419,7 @@ Here is the call graph for this function: size_t double_hashing::otherHashFxn ( - int  - key) + int key) @@ -458,19 +449,12 @@ Here is the call graph for this function: bool double_hashing::putProber ( - const Entry &  - entry, + const Entry & entry, - int  - key  - - - - ) - + int key )
@@ -502,7 +486,7 @@ Here is the call graph for this function:
void double_hashing::rehash ( - ) + ) @@ -546,8 +530,7 @@ Here is the call graph for this function: void double_hashing::removalInfo ( - int  - key) + int key) @@ -562,8 +545,8 @@ Here is the call graph for this function:
228 std::cout << "Initial table: ";
229 display();
230 std::cout << std::endl;
-
231 std::cout << "hash of " << key << " is " << hashFxn(key) << " % "
-
232 << totalSize << " == " << hashFxn(key) % totalSize;
+
231 std::cout << "hash of " << key << " is " << hashFxn(key) << " % "
+
232 << totalSize << " == " << hashFxn(key) % totalSize;
233 std::cout << std::endl;
234 remove(key);
235 std::cout << "New table: ";
@@ -586,8 +569,7 @@ Here is the call graph for this function: void double_hashing::remove ( - int  - key) + int key) @@ -599,7 +581,7 @@ Here is the call graph for this function:
199 {
-
200 int index = doubleHash(key, true);
+
200 int index = doubleHash(key, true);
201 if (index == notPresent) {
202 std::cout << "key not found" << std::endl;
203 }
@@ -624,19 +606,12 @@ Here is the call graph for this function:
bool double_hashing::searchingProber ( - const Entry &  - entry, + const Entry & entry, - int  - key  - - - - ) - + int key )
@@ -665,7 +640,7 @@ Here is the call graph for this function:
diff --git a/d0/d6d/modular__exponentiation_8cpp.html b/d0/d6d/modular__exponentiation_8cpp.html index adc6a2384..3fadf225a 100644 --- a/d0/d6d/modular__exponentiation_8cpp.html +++ b/d0/d6d/modular__exponentiation_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/modular_exponentiation.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -125,9 +127,9 @@ Functions uint64_t math::power (uint64_t a, uint64_t b, uint64_t c)  This function calculates a raised to exponent b under modulo c using modular exponentiation.
  -static void test () +static void test ()   -int main () +int main ()  Main function.
  @@ -146,8 +148,7 @@ Functions int main ( - void  - ) + void ) @@ -156,10 +157,10 @@ Functions

Main function.

Returns
0 on exit
86 {
-
87 test(); // execute the tests
+
87 test(); // execute the tests
88 return 0;
89}
-
test
static void test()
Definition modular_exponentiation.cpp:60
+
test
static void test()
Definition modular_exponentiation.cpp:60
Here is the call graph for this function:
@@ -180,7 +181,7 @@ Here is the call graph for this function:
static void test ( - ) + ) @@ -229,7 +230,7 @@ Here is the call graph for this function:
diff --git a/d0/d6f/namespaceothers.html b/d0/d6f/namespaceothers.html index 5b2fac7a6..b9e82afc6 100644 --- a/d0/d6f/namespaceothers.html +++ b/d0/d6f/namespaceothers.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -104,14 +106,14 @@ $(document).ready(function(){initNavTree('d0/d6f/namespaceothers.html','../../')

for vector -More...

+More...

- + - +

Functions

bool are_almost_equal (double a, double b, double absolute_tolerance=0.0001)
bool are_almost_equal (double a, double b, double absolute_tolerance=0.0001)
 Compare two floating point numbers with a certain tolerance. This is needed as with some values, the result (e.g.: -196.15) might be a bit lower (in this case, -196.499999...).
 
double kelvin_to_celsius (double temperature_in_k)
double kelvin_to_celsius (double temperature_in_k)
 Conversion from Kelvin to Celsius algorithm.
 
@@ -136,25 +138,17 @@ Functions bool others::are_almost_equal ( - double  - a, + double a, - double  - b, + double b, - double  - absolute_tolerance = 0.0001  - - - - ) - + double absolute_tolerance = 0.0001 )
@@ -186,8 +180,7 @@ false if the numbers are NOT equal within the given tolerance otherwise double others::kelvin_to_celsius ( - double  - temperature_in_k) + double temperature_in_k) @@ -218,7 +211,7 @@ false if the numbers are NOT equal within the given tolerance otherwise
  • others
    • -
  • Generated by doxygen 1.9.8
    • +
  • Generated by doxygen 1.10.0
diff --git a/d0/d77/longest__palindromic__subsequence_8cpp.html b/d0/d77/longest__palindromic__subsequence_8cpp.html index b8404f0e3..1e05d5e81 100644 --- a/d0/d77/longest__palindromic__subsequence_8cpp.html +++ b/d0/d77/longest__palindromic__subsequence_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/longest_palindromic_subsequence.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -126,10 +128,10 @@ Functions std::string dynamic_programming::lps (const std::string &a)  Function that returns the longest palindromic subsequence of a string.
  -static void test () +static void test ()  Self-test implementations.
  -int main () +int main ()  Main Function.
  @@ -147,8 +149,7 @@ Functions int main ( - void  - ) + void ) @@ -157,10 +158,10 @@ Functions

Main Function.

Returns
0 on exit
97 {
-
98 test(); // execute the tests
+
98 test(); // execute the tests
99 return 0;
100}
-
test
static void test()
Self-test implementations.
Definition longest_palindromic_subsequence.cpp:86
+
test
static void test()
Self-test implementations.
Definition longest_palindromic_subsequence.cpp:86
Here is the call graph for this function:
@@ -181,7 +182,7 @@ Here is the call graph for this function:
static void test ( - ) + ) @@ -215,7 +216,7 @@ Here is the call graph for this function:
diff --git a/d0/d78/classstatistics_1_1stats__computer1-members.html b/d0/d78/classstatistics_1_1stats__computer1-members.html index d0b918d5b..65ae66216 100644 --- a/d0/d78/classstatistics_1_1stats__computer1-members.html +++ b/d0/d78/classstatistics_1_1stats__computer1-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -117,7 +119,7 @@ $(document).ready(function(){initNavTree('d7/d7c/classstatistics_1_1stats__compu diff --git a/d0/d8b/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node-members.html b/d0/d8b/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node-members.html index 700a43035..f2e401b59 100644 --- a/d0/d8b/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node-members.html +++ b/d0/d8b/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('d8/dfd/structoperations__on__datastruc diff --git a/d0/da2/number__of__positive__divisors_8cpp.html b/d0/da2/number__of__positive__divisors_8cpp.html index 7e1fddf9a..bb7c48491 100644 --- a/d0/da2/number__of__positive__divisors_8cpp.html +++ b/d0/da2/number__of__positive__divisors_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/number_of_positive_divisors.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -115,11 +117,11 @@ Include dependency graph for number_of_positive_divisors.cpp:
- + - + - +

Functions

int number_of_positive_divisors (int n)
int number_of_positive_divisors (int n)
 
void tests ()
void tests ()
 
int main ()
int main ()
 

Detailed Description

@@ -143,30 +145,29 @@ list of positive divisors of 36 = 1, 2, 3, 4, 6, 9, 12, 18, 36.

int main ( - void  - ) + void )

Main function

81 {
-
82 tests();
+
82 tests();
83 int n;
84 std::cin >> n;
85 if (n == 0) {
86 std::cout << "All non-zero numbers are divisors of 0 !" << std::endl;
87 } else {
88 std::cout << "Number of positive divisors is : ";
-
89 std::cout << number_of_positive_divisors(n) << std::endl;
+
89 std::cout << number_of_positive_divisors(n) << std::endl;
90 }
91 return 0;
92}
std::endl
T endl(T... args)
-
tests
void tests()
Definition number_of_positive_divisors.cpp:70
-
number_of_positive_divisors
int number_of_positive_divisors(int n)
Definition number_of_positive_divisors.cpp:33
+
tests
void tests()
Definition number_of_positive_divisors.cpp:70
+
number_of_positive_divisors
int number_of_positive_divisors(int n)
Definition number_of_positive_divisors.cpp:33
Here is the call graph for this function:
@@ -184,8 +185,7 @@ Here is the call graph for this function:
int number_of_positive_divisors ( - int  - n) + int n) @@ -242,18 +242,18 @@ Here is the call graph for this function:
void tests ( - ) + )

Test implementations

70 {
-
71 assert(number_of_positive_divisors(36) == 9);
-
72 assert(number_of_positive_divisors(-36) == 9);
-
73 assert(number_of_positive_divisors(1) == 1);
-
74 assert(number_of_positive_divisors(2011) == 2); // 2011 is a prime
-
75 assert(number_of_positive_divisors(756) == 24); // 756 = 2^2 * 3^3 * 7
+
71 assert(number_of_positive_divisors(36) == 9);
+
72 assert(number_of_positive_divisors(-36) == 9);
+
73 assert(number_of_positive_divisors(1) == 1);
+
74 assert(number_of_positive_divisors(2011) == 2); // 2011 is a prime
+
75 assert(number_of_positive_divisors(756) == 24); // 756 = 2^2 * 3^3 * 7
76}
Here is the call graph for this function:
@@ -269,7 +269,7 @@ Here is the call graph for this function:
diff --git a/d0/da4/namespacemonte__carlo.html b/d0/da4/namespacemonte__carlo.html index 3a6205365..9d9ddecdc 100644 --- a/d0/da4/namespacemonte__carlo.html +++ b/d0/da4/namespacemonte__carlo.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: monte_carlo Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d0/da4/namespacemonte__carlo.html','..

Functions for the Monte Carlo Integration implementation. -More...

+More...

Detailed Description

Functions for the Monte Carlo Integration implementation.

@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d0/da4/namespacemonte__carlo.html','.. diff --git a/d0/db6/non__recursive__merge__sort_8cpp.html b/d0/db6/non__recursive__merge__sort_8cpp.html index 1103bf35f..bd310f237 100644 --- a/d0/db6/non__recursive__merge__sort_8cpp.html +++ b/d0/db6/non__recursive__merge__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/non_recursive_merge_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -136,7 +138,7 @@ Functions void sorting::non_recursive_merge_sort (const Iterator first, const Iterator last)  bottom-up merge sort which sorts elements in a non-decreasing order
  -int main (int argc, char **argv) +int main (int argc, char **argv)  

Detailed Description

@@ -152,19 +154,12 @@ Functions int main ( - int  - argc, + int argc, - char **  - argv  - - - - ) - + char ** argv )
@@ -177,7 +172,7 @@ Functions
100 std::cout << "arr[" << i << "] = ";
101 std::cin >> arr[i];
102 }
-
103 non_recursive_merge_sort(arr, size);
+
103 non_recursive_merge_sort(arr, size);
104 std::cout << "Sorted array\n";
105 for (int i = 0; i < size; ++i)
106 std::cout << "arr[" << i << "] = " << arr[i] << '\n';
@@ -186,7 +181,6 @@ Functions
109}
-
sorting::non_recursive_merge_sort
void non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)
bottom-up merge sort which sorts elements in a non-decreasing order
Definition non_recursive_merge_sort.cpp:25
@@ -196,7 +190,7 @@ Functions diff --git a/d0/dc4/struct_point-members.html b/d0/dc4/struct_point-members.html index 0c108b151..1a7283c10 100644 --- a/d0/dc4/struct_point-members.html +++ b/d0/dc4/struct_point-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -113,7 +115,7 @@ $(document).ready(function(){initNavTree('d8/dc8/struct_point.html','../../'); i diff --git a/d0/dc9/classrange__queries_1_1fenwick__tree-members.html b/d0/dc9/classrange__queries_1_1fenwick__tree-members.html index aa95f666b..8147a053b 100644 --- a/d0/dc9/classrange__queries_1_1fenwick__tree-members.html +++ b/d0/dc9/classrange__queries_1_1fenwick__tree-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -116,7 +118,7 @@ $(document).ready(function(){initNavTree('de/d0d/classrange__queries_1_1fenwick_ diff --git a/d0/dcb/classdsu-members.html b/d0/dcb/classdsu-members.html index 5c914c053..40ec51057 100644 --- a/d0/dcb/classdsu-members.html +++ b/d0/dcb/classdsu-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -126,7 +128,7 @@ $(document).ready(function(){initNavTree('dd/d1f/classdsu.html','../../'); initR diff --git a/d0/dd2/treap_8cpp.html b/d0/dd2/treap_8cpp.html index c03a2ebd3..3970fbccd 100644 --- a/d0/dd2/treap_8cpp.html +++ b/d0/dd2/treap_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/treap.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -131,10 +133,10 @@ Namespaces - + - +

Functions

static void test ()
static void test ()
 Self-test implementations.
 
int main ()
int main ()
 Main function.
 
@@ -161,8 +163,7 @@ const int  - - +
data_structures:
int main (void )void )
@@ -171,10 +172,10 @@ const int data_structures:

Main function.

Returns
0 on exit
256 {
-
257 test(); // run self-test implementations
+
257 test(); // run self-test implementations
258 return 0;
259}
-
test
static void test()
Self-test implementations.
Definition treap.cpp:230
+
test
static void test()
Self-test implementations.
Definition treap.cpp:230
Here is the call graph for this function:
@@ -195,7 +196,7 @@ Here is the call graph for this function:
static void test ( - ) + ) @@ -253,7 +254,7 @@ Here is the call graph for this function:
diff --git a/d0/dd5/classciphers_1_1_hill_cipher-members.html b/d0/dd5/classciphers_1_1_hill_cipher-members.html index 341b030a8..6a426313f 100644 --- a/d0/dd5/classciphers_1_1_hill_cipher-members.html +++ b/d0/dd5/classciphers_1_1_hill_cipher-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -122,7 +124,7 @@ $(document).ready(function(){initNavTree('d6/d26/classciphers_1_1_hill_cipher.ht diff --git a/d0/dda/namespacesaddleback.html b/d0/dda/namespacesaddleback.html index 4f0f90efc..c0088060c 100644 --- a/d0/dda/namespacesaddleback.html +++ b/d0/dda/namespacesaddleback.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: saddleback Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d0/dda/namespacesaddleback.html','../.

Function for implementing Saddleback Algorithm. -More...

+More...

Detailed Description

Function for implementing Saddleback Algorithm.

@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d0/dda/namespacesaddleback.html','../. diff --git a/d0/de2/gaussian__elimination_8cpp.html b/d0/de2/gaussian__elimination_8cpp.html index 5c3d60663..86934e3c5 100644 --- a/d0/de2/gaussian__elimination_8cpp.html +++ b/d0/de2/gaussian__elimination_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/gaussian_elimination.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -114,7 +116,7 @@ Include dependency graph for gaussian_elimination.cpp:
- +

Functions

int main ()
int main ()
 

Detailed Description

@@ -129,8 +131,7 @@ Functions int main ( - void  - ) + void ) @@ -223,7 +224,7 @@ Here is the call graph for this function: diff --git a/d0/df8/namespaceabbreviation.html b/d0/df8/namespaceabbreviation.html index c76db73f7..6aa52d722 100644 --- a/d0/df8/namespaceabbreviation.html +++ b/d0/df8/namespaceabbreviation.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: abbreviation Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d0/df8/namespaceabbreviation.html','..

Functions for Abbreviation implementation. -More...

+More...

Detailed Description

Functions for Abbreviation implementation.

@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d0/df8/namespaceabbreviation.html','.. diff --git a/d0/dfe/backtracking_2subset__sum_8cpp.html b/d0/dfe/backtracking_2subset__sum_8cpp.html index a46af747a..8c87f7c79 100644 --- a/d0/dfe/backtracking_2subset__sum_8cpp.html +++ b/d0/dfe/backtracking_2subset__sum_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: backtracking/subset_sum.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -126,13 +128,13 @@ Namespaces - + - + - +

Functions

uint64_t backtracking::subset_sum::number_of_subsets (int32_t sum, const std::vector< int32_t > &in_arr)
uint64_t backtracking::subset_sum::number_of_subsets (int32_t sum, const std::vector< int32_t > &in_arr)
 The main function implements count of subsets.
 
static void test ()
static void test ()
 Test implementations.
 
int main ()
int main ()
 Main function.
 
@@ -149,8 +151,7 @@ Functions int main ( - void  - ) + void ) @@ -159,10 +160,10 @@ Functions

Main function.

Returns
0 on exit
103 {
-
104 test(); // run self-test implementations
+
104 test(); // run self-test implementations
105 return 0;
106}
-
test
static void test()
Test implementations.
Definition subset_sum.cpp:57
+
test
static void test()
Test implementations.
Definition subset_sum.cpp:57
Here is the call graph for this function:
@@ -180,19 +181,12 @@ Here is the call graph for this function:
uint64_t backtracking::subset_sum::number_of_subsets ( - int32_t  - sum, + int32_t sum, - const std::vector< int32_t > &  - in_arr  - - - - ) - + const std::vector< int32_t > & in_arr )
@@ -245,7 +239,7 @@ Here is the call graph for this function:
static void test ( - ) + ) @@ -316,7 +310,7 @@ Here is the call graph for this function: diff --git a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.map b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.map index c1b3bb6d3..35404df22 100644 --- a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.map +++ b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.map @@ -1,9 +1,11 @@ - - - - - - - + + + + + + + + + diff --git a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.md5 b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.md5 index 09d84d07c..ab70a89fe 100644 --- a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.md5 +++ b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.md5 @@ -1 +1 @@ -efdc2070005fea936f2ff1ade3b7aa6d \ No newline at end of file +b610af580288d32f551d2dbb9542c0b1 \ No newline at end of file diff --git a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg index c67b0df11..b2465f51c 100644 --- a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg +++ b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg @@ -4,8 +4,7 @@ - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + - + machine_learning::aystar_search::EightPuzzle< N > Node1 - -machine_learning::aystar -_search::EightPuzzle< N > + +machine_learning::aystar +_search::EightPuzzle< N > @@ -32,9 +68,9 @@ Node2 - -std::array< std::array -< uint32_t, 3 >, 3 > + +std::array< std::array +< uint32_t, 3 >, 3 > @@ -42,19 +78,19 @@ Node2->Node1 - - + + - board + board Node3 - -std::vector< std::pair -< int8_t, int8_t > > + +std::vector< std::pair +< int8_t, int8_t > > @@ -62,19 +98,19 @@ Node3->Node1 - - + + - moves + moves Node4 - -std::pair< int8_t, - int8_t > + +std::pair< int8_t, + int8_t > @@ -82,14 +118,55 @@ Node4->Node3 - - + + - elements + elements + + + +Node5 + + +std::int8_t + + + + + +Node5->Node4 + + + + + + first_type +second_type + + + + + + + + + + + + + + + + + + - + Algorithms_in_C++: linkedlist Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -127,7 +129,7 @@ int data diff --git a/d1/d07/class_solution-members.html b/d1/d07/class_solution-members.html index 57a3ced7f..c7a518ab1 100644 --- a/d1/d07/class_solution-members.html +++ b/d1/d07/class_solution-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -116,7 +118,7 @@ $(document).ready(function(){initNavTree('dd/d4f/class_solution.html','../../'); diff --git a/d1/d11/gcd__of__n__numbers_8cpp.html b/d1/d11/gcd__of__n__numbers_8cpp.html index 21b12bfb6..c4aef409b 100644 --- a/d1/d11/gcd__of__n__numbers_8cpp.html +++ b/d1/d11/gcd__of__n__numbers_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/gcd_of_n_numbers.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -114,9 +116,9 @@ Include dependency graph for gcd_of_n_numbers.cpp:
- + - +

Functions

int gcd (int *a, int n)
int gcd (int *a, int n)
 
int main ()
int main ()
 

Detailed Description

@@ -132,19 +134,12 @@ Functions int gcd ( - int *  - a, + int * a, - int  - n  - - - - ) - + int n )
@@ -158,16 +153,16 @@ Functions
15 {
16 int j = 1; // to access all elements of the array starting from 1
-
17 int gcd = a[0];
+
17 int gcd = a[0];
18 while (j < n) {
-
19 if (a[j] % gcd == 0) // value of gcd is as needed so far
+
19 if (a[j] % gcd == 0) // value of gcd is as needed so far
20 j++; // so we check for next element
21 else
-
22 gcd = a[j] % gcd; // calculating GCD by division method
+
22 gcd = a[j] % gcd; // calculating GCD by division method
23 }
-
24 return gcd;
+
24 return gcd;
25}
-
gcd
int gcd(int *a, int n)
Definition gcd_of_n_numbers.cpp:15
+
gcd
int gcd(int *a, int n)
Definition gcd_of_n_numbers.cpp:15
Here is the call graph for this function:
@@ -185,8 +180,7 @@ Here is the call graph for this function:
int main ( - void  - ) + void ) @@ -201,7 +195,7 @@ Here is the call graph for this function:
34 std::cout << "Enter the n numbers:" << std::endl;
35 for (i = 0; i < n; i++) std::cin >> a[i];
36
-
37 std::cout << "GCD of entered n numbers:" << gcd(a, n) << std::endl;
+
37 std::cout << "GCD of entered n numbers:" << gcd(a, n) << std::endl;
38
39 delete[] a;
40 return 0;
@@ -223,7 +217,7 @@ Here is the call graph for this function: diff --git a/d1/d1d/class_graph-members.html b/d1/d1d/class_graph-members.html index adaa98c9e..7289d739f 100644 --- a/d1/d1d/class_graph-members.html +++ b/d1/d1d/class_graph-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -147,7 +149,7 @@ $(document).ready(function(){initNavTree('da/d9a/class_graph.html','../../'); in diff --git a/d1/d1e/classoperations__on__datastructures_1_1trie__operations_1_1_tnode-members.html b/d1/d1e/classoperations__on__datastructures_1_1trie__operations_1_1_tnode-members.html index dcf1058f1..0da1204f3 100644 --- a/d1/d1e/classoperations__on__datastructures_1_1trie__operations_1_1_tnode-members.html +++ b/d1/d1e/classoperations__on__datastructures_1_1trie__operations_1_1_tnode-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -128,7 +130,7 @@ $(document).ready(function(){initNavTree('d0/d5f/classoperations__on__datastruct diff --git a/d1/d21/quick__sort_8cpp.html b/d1/d21/quick__sort_8cpp.html index 550cfa1b0..68f93e4bc 100644 --- a/d1/d21/quick__sort_8cpp.html +++ b/d1/d21/quick__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/quick_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -129,25 +131,25 @@ Namespaces

Functions

template<typename T > -int sorting::quick_sort::partition (std::vector< T > *arr, const int &low, const int &high) +int sorting::quick_sort::partition (std::vector< T > *arr, const int &low, const int &high)  Sorts the array taking the last element as pivot.
  template<typename T > -void sorting::quick_sort::quick_sort (std::vector< T > *arr, const int &low, const int &high) +void sorting::quick_sort::quick_sort (std::vector< T > *arr, const int &low, const int &high)  the main function that implements Quick Sort.
  template<typename T > -std::vector< T > sorting::quick_sort::quick_sort (std::vector< T > arr, const int &low, const int &high) +std::vector< T > sorting::quick_sort::quick_sort (std::vector< T > arr, const int &low, const int &high)  the main function that implements Quick Sort.
  template<typename T > -void sorting::quick_sort::show (const std::vector< T > &arr, const int &size) +void sorting::quick_sort::show (const std::vector< T > &arr, const int &size)  Utility function to print the array contents.
  -static void tests () +static void tests ()  Self-test implementations.
  -int main () +int main ()  Main function.
  @@ -176,8 +178,7 @@ Functions int main ( - void  - ) + void ) @@ -202,7 +203,7 @@ Functions
215
216 if (choice == 1) {
217 std::srand(std::time(nullptr));
-
218 tests(); // run self-test implementations
+
218 tests(); // run self-test implementations
219 } else if (choice == 2) {
220 int size = 0;
221 std::cout << "\nEnter the number of elements: ";
@@ -217,17 +218,17 @@ Functions
230 std::cout << "\n";
231 std::cin >> arr[i];
232 }
-
233 sorting::quick_sort::quick_sort(&arr, 0, size - 1);
+
233 sorting::quick_sort::quick_sort(&arr, 0, size - 1);
234 std::cout << "\nSorted array: \n";
-
235 sorting::quick_sort::show(arr, size);
+
235 sorting::quick_sort::show(arr, size);
236 }
237 return 0;
238}
-
tests
static void tests()
Self-test implementations.
Definition quick_sort.cpp:135
-
sorting::quick_sort::quick_sort
void quick_sort(std::vector< T > *arr, const int &low, const int &high)
the main function that implements Quick Sort.
Definition quick_sort.cpp:86
-
sorting::quick_sort::show
void show(const std::vector< T > &arr, const int &size)
Utility function to print the array contents.
Definition quick_sort.cpp:123
+
tests
static void tests()
Self-test implementations.
Definition quick_sort.cpp:135
+
sorting::quick_sort::quick_sort
void quick_sort(std::vector< T > *arr, const int &low, const int &high)
the main function that implements Quick Sort.
Definition quick_sort.cpp:86
+
sorting::quick_sort::show
void show(const std::vector< T > &arr, const int &size)
Utility function to print the array contents.
Definition quick_sort.cpp:123
std::srand
T srand(T... args)
std::time
T time(T... args)
@@ -250,25 +251,17 @@ template<typename T >
int sorting::quick_sort::partition ( - std::vector< T > *  - arr, + std::vector< T > * arr, - const int &  - low, + const int & low, - const int &  - high  - - - - ) - + const int & high )
@@ -325,25 +318,17 @@ template<typename T >
void sorting::quick_sort::quick_sort ( - std::vector< T > *  - arr, + std::vector< T > * arr, - const int &  - low, + const int & low, - const int &  - high  - - - - ) - + const int & high )
@@ -387,25 +372,17 @@ template<typename T >
std::vector< T > sorting::quick_sort::quick_sort ( - std::vector< T >  - arr, + std::vector< T > arr, - const int &  - low, + const int & low, - const int &  - high  - - - - ) - + const int & high )
@@ -448,19 +425,12 @@ template<typename T >
void sorting::quick_sort::show ( - const std::vector< T > &  - arr, + const std::vector< T > & arr, - const int &  - size  - - - - ) - + const int & size )
@@ -493,7 +463,7 @@ template<typename T >
static void tests ( - ) + ) @@ -509,7 +479,7 @@ template<typename T >
135 {
136 // 1st test (normal numbers)
137 std::vector<uint64_t> arr = {5, 3, 8, 12, 14, 16, 28, 96, 2, 5977};
-
138 std::vector<uint64_t> arr_sorted = sorting::quick_sort::quick_sort(
+
138 std::vector<uint64_t> arr_sorted = sorting::quick_sort::quick_sort(
139 arr, 0, int(std::end(arr) - std::begin(arr)) - 1);
140
141 assert(std::is_sorted(std::begin(arr_sorted), std::end(arr_sorted)));
@@ -518,7 +488,7 @@ template<typename T >
144 // 2nd test (normal and negative numbers)
145 std::vector<int64_t> arr2 = {9, 15, 28, 96, 500, -4, -58,
146 -977, -238, -800, -21, -53, -55};
-
147 std::vector<int64_t> arr_sorted2 = sorting::quick_sort::quick_sort(
+
147 std::vector<int64_t> arr_sorted2 = sorting::quick_sort::quick_sort(
148 arr2, 0, std::end(arr2) - std::begin(arr2));
149
150 assert(std::is_sorted(std::begin(arr_sorted2), std::end(arr_sorted2)));
@@ -527,7 +497,7 @@ template<typename T >
153 // 3rd test (decimal and normal numbers)
154 std::vector<double> arr3 = {29, 36, 1100, 0, 77, 1,
155 6.7, 8.97, 1.74, 950.10, -329.65};
-
156 std::vector<double> arr_sorted3 = sorting::quick_sort::quick_sort(
+
156 std::vector<double> arr_sorted3 = sorting::quick_sort::quick_sort(
157 arr3, 0, int(std::end(arr3) - std::begin(arr3)) - 1);
158
159 assert(std::is_sorted(std::begin(arr_sorted3), std::end(arr_sorted3)));
@@ -543,7 +513,7 @@ template<typename T >
169 250;
170 }
171
-
172 std::vector<float> arr4_sorted = sorting::quick_sort::quick_sort(
+
172 std::vector<float> arr4_sorted = sorting::quick_sort::quick_sort(
173 arr4, 0, int(std::end(arr4) - std::begin(arr4)) - 1);
174 assert(std::is_sorted(std::begin(arr4_sorted), std::end(arr4_sorted)));
175
@@ -553,17 +523,17 @@ template<typename T >
179 std::cout << "\n\tPrinting all sorted arrays:\t\n";
180
181 std::cout << "1st array:\n";
-
182 sorting::quick_sort::show(arr_sorted, std::end(arr) - std::begin(arr));
+
182 sorting::quick_sort::show(arr_sorted, std::end(arr) - std::begin(arr));
183 std::cout << std::endl;
184 std::cout << "2nd array:\n";
-
185 sorting::quick_sort::show(arr_sorted2, std::end(arr2) - std::begin(arr2));
+
185 sorting::quick_sort::show(arr_sorted2, std::end(arr2) - std::begin(arr2));
186 std::cout << std::endl;
187 std::cout << "3rd array:\n";
-
188 sorting::quick_sort::show(arr_sorted3,
+
188 sorting::quick_sort::show(arr_sorted3,
189 int(std::end(arr3) - std::begin(arr3)) - 1);
190 std::cout << std::endl;
191 std::cout << "Start: 4th array:\n\n";
-
192 sorting::quick_sort::show(
+
192 sorting::quick_sort::show(
193 arr4_sorted, int(std::end(arr4_sorted) - std::begin(arr4_sorted)) - 1);
194 std::cout << "\nEnd: 4th array.\n";
195}
@@ -586,7 +556,7 @@ Here is the call graph for this function: diff --git a/d1/d2a/knight__tour_8cpp.html b/d1/d2a/knight__tour_8cpp.html index 46abdd4b0..255698b65 100644 --- a/d1/d2a/knight__tour_8cpp.html +++ b/d1/d2a/knight__tour_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: backtracking/knight_tour.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -126,12 +128,12 @@ Namespaces

Functions

template<size_t V> -bool backtracking::knight_tour::issafe (int x, int y, const std::array< std::array< int, V >, V > &sol) +bool backtracking::knight_tour::issafe (int x, int y, const std::array< std::array< int, V >, V > &sol)   template<size_t V> -bool backtracking::knight_tour::solve (int x, int y, int mov, std::array< std::array< int, V >, V > &sol, const std::array< int, V > &xmov, std::array< int, V > &ymov) +bool backtracking::knight_tour::solve (int x, int y, int mov, std::array< std::array< int, V >, V > &sol, const std::array< int, V > &xmov, std::array< int, V > &ymov)   -int main () +int main ()  Main function.
  @@ -153,25 +155,17 @@ template<size_t V>
bool backtracking::knight_tour::issafe ( - int  - x, + int x, - int  - y, + int y, - const std::array< std::array< int, V >, V > &  - sol  - - - - ) - + const std::array< std::array< int, V >, V > & sol )
@@ -212,8 +206,7 @@ Here is the call graph for this function:
int main ( - void  - ) + void ) @@ -266,43 +259,32 @@ template<size_t V> bool backtracking::knight_tour::solve ( - int  - x, + int x, - int  - y, + int y, - int  - mov, + int mov, - std::array< std::array< int, V >, V > &  - sol, + std::array< std::array< int, V >, V > & sol, - const std::array< int, V > &  - xmov, + const std::array< int, V > & xmov, - std::array< int, V > &  - ymov  - - - - ) - + std::array< int, V > & ymov )
@@ -365,7 +347,7 @@ Here is the call graph for this function:
diff --git a/d1/d47/classprobability_1_1windowed__median_1_1_windowed_median-members.html b/d1/d47/classprobability_1_1windowed__median_1_1_windowed_median-members.html index ed440ab74..f7b652354 100644 --- a/d1/d47/classprobability_1_1windowed__median_1_1_windowed_median-members.html +++ b/d1/d47/classprobability_1_1windowed__median_1_1_windowed_median-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -118,7 +120,7 @@ $(document).ready(function(){initNavTree('df/d34/classprobability_1_1windowed__m diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html index 69d405e1a..d69f6b4a3 100644 --- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html +++ b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: range_queries::heavy_light_decomposition::Tree< X > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -108,7 +110,7 @@ $(document).ready(function(){initNavTree('d1/d51/classrange__queries_1_1heavy__l

A Basic Tree, which supports binary lifting. - More...

+ More...

Inheritance diagram for range_queries::heavy_light_decomposition::Tree< X >:
@@ -122,37 +124,37 @@ Collaboration diagram for range_queries::heavy_light_decomposition::Tree< X & - + - + - + - + - + - + - + - +

Public Member Functions

 Tree (int nodes)
 Tree (int nodes)
 Class parameterized constructor, resizes the and initializes the data members.
 
void add_edge (const int u, const int v)
void add_edge (const int u, const int v)
 Adds an undirected edge from node u to node v in the tree.
 
void change_root (int new_root)
void change_root (int new_root)
 Set the root for the tree.
 
void set_node_val (const std::vector< X > &node_val)
void set_node_val (const std::vector< X > &node_val)
 Set the values for all the nodes.
 
void init ()
void init ()
 This function must be called after the tree adjacency list and node values are populated The function initializes the required parameters, and populates the segment tree.
 
void lift (int *const p, int dist)
void lift (int *const p, int dist)
 The function lifts a node, k units up the tree. The lifting is done in place, and the result is stored in the address pointed by p.
 
int kth_ancestor (int p, const int &dist)
int kth_ancestor (int p, const int &dist)
 The function returns the kth ancestor of a node.
 
int lca (int a, int b)
int lca (int a, int b)
 The function returns the least common ancestor of two nodes.
 
- + - +

Private Member Functions

void dfs_size (int u, int p=-1)
void dfs_size (int u, int p=-1)
 Utility function to compute sub-tree sizes.
 
void dfs_lca (int u, int p=-1)
void dfs_lca (int u, int p=-1)
 Utility function to populate the t_par vector.
 
@@ -223,8 +225,7 @@ template<typename X > - - +
range_queries::heavy_light_decomposition::Tree< X >::Tree (int nodes)int nodes)
@@ -242,24 +243,24 @@ template<typename X >
-
141 : t_nodes(nodes), t_maxlift(static_cast<int>(floor(log2(nodes))) + 1) {
+
141 : t_nodes(nodes), t_maxlift(static_cast<int>(floor(log2(nodes))) + 1) {
142 /* Initialize and resize all the vectors */
-
143 t_root = 0; /* Default */
-
144 t_adj.resize(t_nodes);
-
145 t_par.assign(t_nodes, std::vector<int>(t_maxlift, -1));
-
146 t_depth.assign(t_nodes, 0);
-
147 t_size.assign(t_nodes, 1);
-
148 t_val.resize(t_nodes);
+
143 t_root = 0; /* Default */
+
144 t_adj.resize(t_nodes);
+
145 t_par.assign(t_nodes, std::vector<int>(t_maxlift, -1));
+
146 t_depth.assign(t_nodes, 0);
+
147 t_size.assign(t_nodes, 1);
+
148 t_val.resize(t_nodes);
149 }
std::vector::assign
T assign(T... args)
-
range_queries::heavy_light_decomposition::Tree::t_depth
std::vector< int > t_depth
a vector to store the depth of a node,
Definition heavy_light_decomposition.cpp:88
-
range_queries::heavy_light_decomposition::Tree::t_val
std::vector< X > t_val
values of nodes
Definition heavy_light_decomposition.cpp:92
-
range_queries::heavy_light_decomposition::Tree::t_par
std::vector< std::vector< int > > t_par
a matrix to store every node's 2^kth parent
Definition heavy_light_decomposition.cpp:87
-
range_queries::heavy_light_decomposition::Tree::t_root
int t_root
the root of the tree
Definition heavy_light_decomposition.cpp:91
-
range_queries::heavy_light_decomposition::Tree::t_adj
std::vector< std::list< int > > t_adj
an adjacency list to stores the tree edges
Definition heavy_light_decomposition.cpp:83
-
range_queries::heavy_light_decomposition::Tree::t_maxlift
const int t_maxlift
maximum possible height of the tree
Definition heavy_light_decomposition.cpp:85
-
range_queries::heavy_light_decomposition::Tree::t_size
std::vector< int > t_size
a vector to store the subtree size rooted at node
Definition heavy_light_decomposition.cpp:89
-
range_queries::heavy_light_decomposition::Tree::t_nodes
const int t_nodes
number of nodes
Definition heavy_light_decomposition.cpp:84
+
range_queries::heavy_light_decomposition::Tree::t_depth
std::vector< int > t_depth
a vector to store the depth of a node,
Definition heavy_light_decomposition.cpp:88
+
range_queries::heavy_light_decomposition::Tree::t_val
std::vector< X > t_val
values of nodes
Definition heavy_light_decomposition.cpp:92
+
range_queries::heavy_light_decomposition::Tree::t_par
std::vector< std::vector< int > > t_par
a matrix to store every node's 2^kth parent
Definition heavy_light_decomposition.cpp:87
+
range_queries::heavy_light_decomposition::Tree::t_root
int t_root
the root of the tree
Definition heavy_light_decomposition.cpp:91
+
range_queries::heavy_light_decomposition::Tree::t_adj
std::vector< std::list< int > > t_adj
an adjacency list to stores the tree edges
Definition heavy_light_decomposition.cpp:83
+
range_queries::heavy_light_decomposition::Tree::t_maxlift
const int t_maxlift
maximum possible height of the tree
Definition heavy_light_decomposition.cpp:85
+
range_queries::heavy_light_decomposition::Tree::t_size
std::vector< int > t_size
a vector to store the subtree size rooted at node
Definition heavy_light_decomposition.cpp:89
+
range_queries::heavy_light_decomposition::Tree::t_nodes
const int t_nodes
number of nodes
Definition heavy_light_decomposition.cpp:84
std::floor
T floor(T... args)
std::vector::resize
T resize(T... args)
@@ -286,19 +287,12 @@ template<typename X >
void range_queries::heavy_light_decomposition::Tree< X >::add_edge ( - const int  - u, + const int u, - const int  - v  - - - - ) - + const int v ) @@ -318,8 +312,8 @@ template<typename X >
Returns
void
157 {
-
158 t_adj[u].push_back(v);
-
159 t_adj[v].push_back(u);
+
158 t_adj[u].push_back(v);
+
159 t_adj[v].push_back(u);
160 }
std::vector::push_back
T push_back(T... args)
@@ -344,8 +338,7 @@ template<typename X >
void range_queries::heavy_light_decomposition::Tree< X >::change_root ( - int  - new_root) + int new_root) @@ -364,7 +357,7 @@ template<typename X >
Returns
void
-
167{ t_root = new_root; }
+
167{ t_root = new_root; }
@@ -382,19 +375,12 @@ template<typename X > void range_queries::heavy_light_decomposition::Tree< X >::dfs_lca ( - int  - u, + int u, - int  - p = -1  - - - - ) - + int p = -1 ) @@ -414,23 +400,23 @@ template<typename X >
Returns
void
116 {
-
117 t_par[u][0] = p;
+
117 t_par[u][0] = p;
118 if (p != -1) {
-
119 t_depth[u] = 1 + t_depth[p];
+
119 t_depth[u] = 1 + t_depth[p];
120 }
-
121 for (int k = 1; k < t_maxlift; k++) {
-
122 if (t_par[u][k - 1] != -1) {
-
123 t_par[u][k] = t_par[t_par[u][k - 1]][k - 1];
+
121 for (int k = 1; k < t_maxlift; k++) {
+
122 if (t_par[u][k - 1] != -1) {
+
123 t_par[u][k] = t_par[t_par[u][k - 1]][k - 1];
124 }
125 }
126
-
127 for (const int &v : t_adj[u]) {
+
127 for (const int &v : t_adj[u]) {
128 if (v ^ p) {
-
129 dfs_lca(v, u);
+
129 dfs_lca(v, u);
130 }
131 }
132 }
-
range_queries::heavy_light_decomposition::Tree::dfs_lca
void dfs_lca(int u, int p=-1)
Utility function to populate the t_par vector.
Definition heavy_light_decomposition.cpp:116
+
range_queries::heavy_light_decomposition::Tree::dfs_lca
void dfs_lca(int u, int p=-1)
Utility function to populate the t_par vector.
Definition heavy_light_decomposition.cpp:116
numerical_methods::simpson_method::k
double k(double x)
Another test function.
Definition composite_simpson_rule.cpp:117
Here is the call graph for this function:
@@ -454,19 +440,12 @@ template<typename X > void range_queries::heavy_light_decomposition::Tree< X >::dfs_size ( - int  - u, + int u, - int  - p = -1  - - - - ) - + int p = -1 ) @@ -487,14 +466,14 @@ template<typename X >
Returns
void
101 {
-
102 for (const int &v : t_adj[u]) {
+
102 for (const int &v : t_adj[u]) {
103 if (v ^ p) {
-
104 dfs_size(v, u);
-
105 t_size[u] += t_size[v];
+
104 dfs_size(v, u);
+
105 t_size[u] += t_size[v];
106 }
107 }
108 }
-
range_queries::heavy_light_decomposition::Tree::dfs_size
void dfs_size(int u, int p=-1)
Utility function to compute sub-tree sizes.
Definition heavy_light_decomposition.cpp:101
+
range_queries::heavy_light_decomposition::Tree::dfs_size
void dfs_size(int u, int p=-1)
Utility function to compute sub-tree sizes.
Definition heavy_light_decomposition.cpp:101
Here is the call graph for this function:
@@ -517,7 +496,7 @@ template<typename X >
void range_queries::heavy_light_decomposition::Tree< X >::init ( - ) + ) @@ -531,9 +510,9 @@ template<typename X >

This function must be called after the tree adjacency list and node values are populated The function initializes the required parameters, and populates the segment tree.

Returns
void
186 {
-
187 assert(t_nodes > 0);
-
188 dfs_size(t_root);
-
189 dfs_lca(t_root);
+
187 assert(t_nodes > 0);
+
188 dfs_size(t_root);
+
189 dfs_lca(t_root);
190 }
Here is the call graph for this function:
@@ -557,19 +536,12 @@ template<typename X > int range_queries::heavy_light_decomposition::Tree< X >::kth_ancestor ( - int  - p, + int p, - const int &  - dist  - - - - ) - + const int & dist ) @@ -589,10 +561,10 @@ template<typename X >
Returns
the kth ancestor of node
218 {
-
219 lift(&p, dist);
+
219 lift(&p, dist);
220 return p;
221 }
-
range_queries::heavy_light_decomposition::Tree::lift
void lift(int *const p, int dist)
The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...
Definition heavy_light_decomposition.cpp:200
+
range_queries::heavy_light_decomposition::Tree::lift
void lift(int *const p, int dist)
The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...
Definition heavy_light_decomposition.cpp:200
Here is the call graph for this function:
@@ -615,19 +587,12 @@ template<typename X >
int range_queries::heavy_light_decomposition::Tree< X >::lca ( - int  - a, + int a, - int  - b  - - - - ) - + int b ) @@ -647,23 +612,23 @@ template<typename X >
Returns
the least common ancestor of node a, and node b
229 {
-
230 assert(a >= 0 and b >= 0 and a < t_nodes and b < t_nodes);
-
231 if (t_depth[a] > t_depth[b]) {
-
232 lift(&a, t_depth[a] - t_depth[b]);
+
230 assert(a >= 0 and b >= 0 and a < t_nodes and b < t_nodes);
+
231 if (t_depth[a] > t_depth[b]) {
+
232 lift(&a, t_depth[a] - t_depth[b]);
233 }
-
234 if (t_depth[b] > t_depth[a]) {
-
235 lift(&b, t_depth[b] - t_depth[a]);
+
234 if (t_depth[b] > t_depth[a]) {
+
235 lift(&b, t_depth[b] - t_depth[a]);
236 }
237 if (a == b) {
238 return a;
239 }
-
240 for (int k = t_maxlift - 1; k >= 0; k--) {
-
241 if (t_par[a][k] != t_par[b][k]) {
-
242 a = t_par[a][k];
-
243 b = t_par[b][k];
+
240 for (int k = t_maxlift - 1; k >= 0; k--) {
+
241 if (t_par[a][k] != t_par[b][k]) {
+
242 a = t_par[a][k];
+
243 b = t_par[b][k];
244 }
245 }
-
246 return t_par[a][0];
+
246 return t_par[a][0];
247 }
Here is the call graph for this function:
@@ -687,19 +652,12 @@ template<typename X > void range_queries::heavy_light_decomposition::Tree< X >::lift ( - int *const  - p, + int *const p, - int  - dist  - - - - ) - + int dist ) @@ -719,12 +677,12 @@ template<typename X >
Returns
void
200 {
-
201 for (int k = 0; k < t_maxlift; k++) {
+
201 for (int k = 0; k < t_maxlift; k++) {
202 if (*p == -1) {
203 return;
204 }
205 if (dist & 1) {
-
206 *p = t_par[*p][k];
+
206 *p = t_par[*p][k];
207 }
208 dist >>= 1;
209 }
@@ -746,8 +704,7 @@ template<typename X >
void range_queries::heavy_light_decomposition::Tree< X >::set_node_val ( - const std::vector< X > &  - node_val) + const std::vector< X > & node_val) @@ -767,8 +724,8 @@ template<typename X >
Returns
void
175 {
-
176 assert(static_cast<int>(node_val.size()) == t_nodes);
-
177 t_val = node_val;
+
176 assert(static_cast<int>(node_val.size()) == t_nodes);
+
177 t_val = node_val;
178 }
std::vector::size
T size(T... args)
@@ -788,7 +745,7 @@ Here is the call graph for this function:
diff --git a/d1/d64/namespaceinterpolation__search.html b/d1/d64/namespaceinterpolation__search.html index c746dfeeb..9df4d9fd1 100644 --- a/d1/d64/namespaceinterpolation__search.html +++ b/d1/d64/namespaceinterpolation__search.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: interpolation_search Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d1/d64/namespaceinterpolation__search.

Functions for the Recursive version of Inorder, Preorder, and Postorder Traversal of the Tree algorithm implementation. -More...

+More...

Detailed Description

Functions for the Recursive version of Inorder, Preorder, and Postorder Traversal of the Tree algorithm implementation.

@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d1/d64/namespaceinterpolation__search. diff --git a/d1/d64/namespacemodular__division.html b/d1/d64/namespacemodular__division.html index 4e6a90d55..4b02864f5 100644 --- a/d1/d64/namespacemodular__division.html +++ b/d1/d64/namespacemodular__division.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: modular_division Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d1/d64/namespacemodular__division.html

Functions for Modular Division implementation. -More...

+More...

Detailed Description

Functions for Modular Division implementation.

@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d1/d64/namespacemodular__division.html diff --git a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.map b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.map index f078c722b..d44df0032 100644 --- a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.map +++ b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.map @@ -1,16 +1,16 @@ - - - - - - - + + + + + + + - - - - - - + + + + + + diff --git a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.md5 b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.md5 index cad3d0264..512699606 100644 --- a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.md5 +++ b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.md5 @@ -1 +1 @@ -352f6a1cabbe0f9d00e20598c2e59887 \ No newline at end of file +dcc9b37a10516be7cfc90a73f44223f4 \ No newline at end of file diff --git a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg index 545c3ef94..a3a1bd6a2 100644 --- a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg +++ b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg @@ -4,8 +4,8 @@ - + - + graph::LowestCommonAncestor @@ -88,8 +88,8 @@ Node5 - -T + +T @@ -97,11 +97,12 @@ Node5->Node4 - - + + - keys + elements +keys diff --git a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph_org.svg b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph_org.svg index 6448d1a5a..a81a260aa 100644 --- a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph_org.svg +++ b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph_org.svg @@ -4,9 +4,9 @@ - - + + graph::LowestCommonAncestor @@ -78,8 +78,8 @@ Node5 - -T + +T @@ -87,11 +87,12 @@ Node5->Node4 - - + + - keys + elements +keys diff --git a/d1/d76/buzz__number_8cpp.html b/d1/d76/buzz__number_8cpp.html index d41162c57..966444959 100644 --- a/d1/d76/buzz__number_8cpp.html +++ b/d1/d76/buzz__number_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/buzz_number.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -114,7 +116,7 @@ Include dependency graph for buzz_number.cpp:
- +

Functions

int main ()
int main ()
 

Detailed Description

@@ -129,8 +131,7 @@ Functions int main ( - void  - ) + void ) @@ -165,7 +166,7 @@ Here is the call graph for this function: diff --git a/d1/d77/structmst.html b/d1/d77/structmst.html index a2eff288d..6ad4f515b 100644 --- a/d1/d77/structmst.html +++ b/d1/d77/structmst.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: mst Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -125,7 +127,7 @@ int near diff --git a/d1/d83/classuint256__t.html b/d1/d83/classuint256__t.html index 6cd37c89f..e1b0d2171 100644 --- a/d1/d83/classuint256__t.html +++ b/d1/d83/classuint256__t.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: uint256_t Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -108,7 +110,7 @@ $(document).ready(function(){initNavTree('d1/d83/classuint256__t.html','../../')

class for 256-bit unsigned integer - More...

+ More...

#include <uint256_t.hpp>

@@ -120,58 +122,58 @@ Collaboration diagram for uint256_t:

Public Member Functions

template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> - uint256_t (T low) + uint256_t (T low)  Parameterized constructor.
  - uint256_t (const std::string &str) + uint256_t (const std::string &str)  Parameterized constructor.
  - uint256_t (const uint256_t &num)=default + uint256_t (const uint256_t &num)=default  Copy constructor.
  - uint256_t (uint256_t &&num) noexcept + uint256_t (uint256_t &&num) noexcept  Move constructor.
  - uint256_t (uint128_t high, uint128_t low) + uint256_t (uint128_t high, uint128_t low)  Parameterized constructor.
  - uint256_t (const uint64_t high, const uint64_t low) + uint256_t (const uint64_t high, const uint64_t low)  Parameterized constructor.
   ~uint256_t ()=default  Destructor for uint256_t.
  -uint32_t _lez () +uint32_t _lez ()  Leading zeroes in binary.
  -uint32_t _trz () +uint32_t _trz ()  Trailing zeroes in binary.
  - operator bool () const + operator bool () const  casting operator to boolean value
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> - operator T () const + operator T () const  casting operator to any integer value
  - operator uint128_t () const + operator uint128_t () const  casting operator to uint128_t
  -uint128_t lower () const +uint128_t lower () const  returns lower 128-bit integer part
  -uint128_t upper () const +uint128_t upper () const  returns upper 128-bit integer part
  -uint256_t & operator= (const uint256_t &p)=default +uint256_t & operator= (const uint256_t &p)=default  operator = for uint256_t
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t & operator= (const T &p) +uint256_t & operator= (const T &p)  operator = for other types
  -uint256_t & operator= (const std::string &p) +uint256_t & operator= (const std::string &p)  operator = for type string
  @@ -179,233 +181,233 @@ Public Member Functions  Move assignment operator.
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t operator+ (const T &p) +uint256_t operator+ (const T &p)  operator + for uint256_t and other integer types.
  -uint256_t operator+ (const uint256_t &p) +uint256_t operator+ (const uint256_t &p)  operator + for uint256_t and other integer types.
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t & operator+= (const T &p) +uint256_t & operator+= (const T &p)  operator += for uint256_t and other integer types.
  -uint256_t & operator+= (const uint256_t &p) +uint256_t & operator+= (const uint256_t &p)  operator += for uint256_t
  -uint256_t & operator++ () +uint256_t & operator++ ()  pre-increment operator
  -uint256_t operator++ (int) +uint256_t operator++ (int)  post-increment operator
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t operator- (const T &p) +uint256_t operator- (const T &p)  operator - for uint256_t and other integer types.
  -uint256_t operator- (const uint256_t &p) +uint256_t operator- (const uint256_t &p)  operator - for uint256_t
  -uint256_t operator- () +uint256_t operator- ()  operator - using twos complement
  -uint256_t & operator-- () +uint256_t & operator-- ()  operator – (pre-decrement)
  -uint256_t operator-- (int p) +uint256_t operator-- (int p)  operator – (post-decrement)
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t operator-= (const T p) +uint256_t operator-= (const T p)  operator -= for uint256_t and other integer types.
  -uint256_t & operator-= (const uint256_t &p) +uint256_t & operator-= (const uint256_t &p)  operator -= for uint256_t
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t operator* (const T &p) +uint256_t operator* (const T &p)  operator * for uint256_t and other integer types.
  -uint256_t operator* (const uint256_t &p) +uint256_t operator* (const uint256_t &p)  operator * for uint256_t and other integer types.
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t & operator*= (const T &p) +uint256_t & operator*= (const T &p)  operator *= for uint256_t and other integer types.
  -uint256_t & operator*= (const uint256_t &p) +uint256_t & operator*= (const uint256_t &p)  operator *= for uint256_t and other integer types.
  -std::pair< uint256_t, uint256_t > divide (const uint256_t &p) +std::pair< uint256_t, uint256_t > divide (const uint256_t &p)  divide function for uint256_t and other integer types.
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t operator/ (const T &p) +uint256_t operator/ (const T &p)  operator / for uint256_t and other integer types.
  -uint256_t operator/ (const uint256_t &p) +uint256_t operator/ (const uint256_t &p)  operator / for uint256_t and other integer types.
  -uint256_t & operator/= (const uint256_t &p) +uint256_t & operator/= (const uint256_t &p)  operator /= for uint256_t
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t & operator/= (const T &p) +uint256_t & operator/= (const T &p)  operator /= for uint256_t and other integer types.
  -uint256_t operator% (const uint256_t &p) +uint256_t operator% (const uint256_t &p)  operator % for uint256_t
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t operator% (const T &p) +uint256_t operator% (const T &p)  operator % for uint256_t and other integer types.
  -uint256_t & operator%= (const uint256_t &p) +uint256_t & operator%= (const uint256_t &p)  operator %= for uint256_t
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t & operator%= (const T &p) +uint256_t & operator%= (const T &p)  operator %= for uint256_t
  -bool operator< (const uint256_t &other) +bool operator< (const uint256_t &other)  operator < for uint256_t
  -bool operator<= (const uint256_t &other) +bool operator<= (const uint256_t &other)  operator <= for uint256_t
  -bool operator> (const uint256_t &other) +bool operator> (const uint256_t &other)  operator > for uint256_t
  -bool operator>= (const uint256_t &other) +bool operator>= (const uint256_t &other)  operator >= for uint256_t
  -bool operator== (const uint256_t &other) +bool operator== (const uint256_t &other)  operator == for uint256_t
  -bool operator!= (const uint256_t &other) +bool operator!= (const uint256_t &other)  operator != for uint256_t
  -bool operator! () +bool operator! ()  operator ! for uint256_t
  -bool operator&& (const uint256_t &b) +bool operator&& (const uint256_t &b)  operator && for uint256_t
  -bool operator|| (const uint256_t &b) +bool operator|| (const uint256_t &b)  operator || for uint256_t
  -bool operator() () +bool operator() ()  operator () for uint256_t
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -bool operator< (const T &other) +bool operator< (const T &other)  operator < for other types
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -bool operator<= (const T &other) +bool operator<= (const T &other)  operator <= for other types
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -bool operator> (const T &other) +bool operator> (const T &other)  operator > for other types
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -bool operator>= (const T &other) +bool operator>= (const T &other)  operator >= for other types
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -bool operator== (const T &other) +bool operator== (const T &other)  operator == for other types
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -bool operator!= (const T &other) +bool operator!= (const T &other)  operator != for other types
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -bool operator&& (const T &b) +bool operator&& (const T &b)  operator && for other types
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -bool operator|| (const T &b) +bool operator|| (const T &b)  operator || for other types
  -uint256_t operator~ () +uint256_t operator~ ()  operator ~ for uint256_t
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t operator<< (const T &p) +uint256_t operator<< (const T &p)  operator << for uint256_t
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t & operator<<= (const T &p) +uint256_t & operator<<= (const T &p)  operator <<= for uint256_t
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t operator>> (const T &p) +uint256_t operator>> (const T &p)  operator >> for uint256_t
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t & operator>>= (const T &p) +uint256_t & operator>>= (const T &p)  operator >>= for uint256_t
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t operator& (const T &p) +uint256_t operator& (const T &p)  operator & for other types (bitwise operator)
  -uint256_t operator& (const uint256_t &p) +uint256_t operator& (const uint256_t &p)  operator & for uint256_t (bitwise operator)
  -uint256_t & operator&= (const uint256_t &p) +uint256_t & operator&= (const uint256_t &p)  operator &= for uint256_t (bitwise operator)
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t & operator&= (const T p) +uint256_t & operator&= (const T p)  operator &= for other types (bitwise operator)
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t operator| (const T &p) +uint256_t operator| (const T &p)  operator | for other types (bitwise operator)
  -uint256_t operator| (const uint256_t &p) +uint256_t operator| (const uint256_t &p)  operator | for uint256_t (bitwise operator)
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t & operator|= (const T &p) +uint256_t & operator|= (const T &p)  operator |= for other types (bitwise operator)
  -uint256_t & operator|= (const uint256_t &p) +uint256_t & operator|= (const uint256_t &p)  operator |= for uint256_t (bitwise operator)
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t operator^ (const T &p) +uint256_t operator^ (const T &p)  operator ^ for other types (bitwise operator)
  -uint256_t operator^ (const uint256_t &p) +uint256_t operator^ (const uint256_t &p)  operator ^ for uint256_t (bitwise operator)
  -uint256_t & operator^= (const uint256_t &p) +uint256_t & operator^= (const uint256_t &p)  operator ^= for uint256_t (bitwise operator)
  template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type> -uint256_t & operator^= (const T &p) +uint256_t & operator^= (const T &p)  operator ^= for other types (bitwise operator)
  - +

Private Member Functions

void __get_integer_from_string (const std::string &str)
void __get_integer_from_string (const std::string &str)
 First and second half of 256 bit number.
 
- + - +

Private Attributes

uint128_t f {}
uint128_t f {}
 
uint128_t s {}
uint128_t s {}
 
- +

Friends

std::ostream & operator<< (std::ostream &op, uint256_t p)
std::ostream & operator<< (std::ostream &op, uint256_t p)
 operator << for printing uint256_t integer
 
@@ -426,8 +428,7 @@ template<typename T , typename = typename std::enable_if< uint256_t::uint256_t ( - T  - low) + T low) @@ -467,8 +468,7 @@ template<typename T , typename = typename std::enable_if< uint256_t::uint256_t ( - const std::string &  - str) + const std::string & str) @@ -487,9 +487,9 @@ template<typename T , typename = typename std::enable_if<
81 {
-
82 __get_integer_from_string(str);
+
82 __get_integer_from_string(str);
83 }
-
uint256_t::__get_integer_from_string
void __get_integer_from_string(const std::string &str)
First and second half of 256 bit number.
Definition uint256_t.hpp:43
+
uint256_t::__get_integer_from_string
void __get_integer_from_string(const std::string &str)
First and second half of 256 bit number.
Definition uint256_t.hpp:43
Here is the call graph for this function:
@@ -510,8 +510,7 @@ Here is the call graph for this function:
uint256_t::uint256_t ( - const uint256_t &  - num) + const uint256_t & num) @@ -544,8 +543,7 @@ Here is the call graph for this function:
uint256_t::uint256_t ( - uint256_t &&  - num) + uint256_t && num) @@ -580,19 +578,12 @@ Here is the call graph for this function:
uint256_t::uint256_t ( - uint128_t  - high, + uint128_t high, - uint128_t  - low  - - - - ) - + uint128_t low ) @@ -626,19 +617,12 @@ Here is the call graph for this function: uint256_t::uint256_t ( - const uint64_t  - high, + const uint64_t high, - const uint64_t  - low  - - - - ) - + const uint64_t low ) @@ -673,8 +657,7 @@ Here is the call graph for this function: void uint256_t::__get_integer_from_string ( - const std::string &  - str) + const std::string & str) @@ -736,7 +719,7 @@ Here is the call graph for this function: uint32_t uint256_t::_lez ( - ) + ) @@ -776,7 +759,7 @@ Here is the call graph for this function: uint32_t uint256_t::_trz ( - ) + ) @@ -816,8 +799,7 @@ Here is the call graph for this function: std::pair< uint256_t, uint256_t > uint256_t::divide ( - const uint256_t &  - p) + const uint256_t & p) @@ -843,12 +825,12 @@ Here is the call graph for this function:
425 return {uint256_t(1), uint256_t(0)};
426 }
427 uint256_t tmp = p, tmp2 = *this;
-
428 uint16_t left = tmp._lez() - _lez();
+
428 uint16_t left = tmp._lez() - _lez();
429 tmp <<= left;
430 uint256_t quotient(0);
431 uint256_t zero(0);
432 while (tmp2 >= p) {
-
433 uint16_t shf = tmp2._lez() - tmp._lez();
+
433 uint16_t shf = tmp2._lez() - tmp._lez();
434 if (shf) {
435 tmp >>= shf;
436 quotient <<= shf;
@@ -865,7 +847,7 @@ Here is the call graph for this function:
447 return {quotient << left, tmp2};
448 }
uint256_t
class for 256-bit unsigned integer
Definition uint256_t.hpp:33
-
uint256_t::_lez
uint32_t _lez()
Leading zeroes in binary.
Definition uint256_t.hpp:123
+
uint256_t::_lez
uint32_t _lez()
Leading zeroes in binary.
Definition uint256_t.hpp:123
Here is the call graph for this function:
@@ -886,7 +868,7 @@ Here is the call graph for this function:
uint128_t uint256_t::lower ( - ) + ) const @@ -915,7 +897,7 @@ Here is the call graph for this function: uint256_t::operator bool ( - ) + ) const @@ -946,7 +928,7 @@ template<typename T , typename = typename std::enable_if< uint256_t::operator T ( - ) + ) const @@ -983,7 +965,7 @@ template<typename T , typename = typename std::enable_if< uint256_t::operator uint128_t ( - ) + ) const @@ -1012,7 +994,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator! ( - ) + ) @@ -1041,10 +1023,9 @@ template<typename T , typename = typename std::enable_if< - + - - +
bool uint256_t::operator!= bool uint256_t::operator!= (const T & other)const T & other)
@@ -1085,10 +1066,9 @@ template<typename T , typename = typename std::enable_if< - + - - +
bool uint256_t::operator!= bool uint256_t::operator!= (const uint256_t & other)const uint256_t & other)
@@ -1127,8 +1107,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator% ( - const T &  - p) + const T & p) @@ -1173,8 +1152,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator% ( - const uint256_t &  - p) + const uint256_t & p) @@ -1193,8 +1171,8 @@ template<typename T , typename = typename std::enable_if<
Returns
unsigned 256-bit remainder.
-
499{ return divide(p).second; }
-
uint256_t::divide
std::pair< uint256_t, uint256_t > divide(const uint256_t &p)
divide function for uint256_t and other integer types.
Definition uint256_t.hpp:421
+
499{ return divide(p).second; }
+
uint256_t::divide
std::pair< uint256_t, uint256_t > divide(const uint256_t &p)
divide function for uint256_t and other integer types.
Definition uint256_t.hpp:421
Here is the call graph for this function:
@@ -1217,8 +1195,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator%= ( - const T &  - p) + const T & p) @@ -1262,8 +1239,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator%= ( - const uint256_t &  - p) + const uint256_t & p) @@ -1283,7 +1259,7 @@ template<typename T , typename = typename std::enable_if<
Returns
this set as unsigned 256-bit remainder.
520 {
-
521 *this = divide(p).second;
+
521 *this = divide(p).second;
522 return *this;
523 }
@@ -1308,8 +1284,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator& ( - const T &  - p) + const T & p) @@ -1352,8 +1327,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator& ( - const uint256_t &  - p) + const uint256_t & p) @@ -1392,8 +1366,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator&& ( - const T &  - b) + const T & b) @@ -1436,8 +1409,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator&& ( - const uint256_t &  - b) + const uint256_t & b) @@ -1476,8 +1448,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator&= ( - const T  - p) + const T p) @@ -1521,8 +1492,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator&= ( - const uint256_t &  - p) + const uint256_t & p) @@ -1561,7 +1531,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator() ( - ) + ) @@ -1592,8 +1562,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator* ( - const T &  - p) + const T & p) @@ -1636,8 +1605,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator* ( - const uint256_t &  - p) + const uint256_t & p) @@ -1692,8 +1660,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator*= ( - const T &  - p) + const T & p) @@ -1736,8 +1703,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator*= ( - const uint256_t &  - p) + const uint256_t & p) @@ -1791,8 +1757,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator+ ( - const T &  - p) + const T & p) @@ -1836,8 +1801,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator+ ( - const uint256_t &  - p) + const uint256_t & p) @@ -1875,7 +1839,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator++ ( - ) + ) @@ -1907,8 +1871,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator++ ( - int  - ) + int ) @@ -1942,8 +1905,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator+= ( - const T &  - p) + const T & p) @@ -1989,8 +1951,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator+= ( - const uint256_t &  - p) + const uint256_t & p) @@ -2030,7 +1991,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator- ( - ) + ) @@ -2061,8 +2022,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator- ( - const T &  - p) + const T & p) @@ -2106,8 +2066,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator- ( - const uint256_t &  - p) + const uint256_t & p) @@ -2145,7 +2104,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator-- ( - ) + ) @@ -2177,8 +2136,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator-- ( - int  - p) + int p) @@ -2212,8 +2170,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator-= ( - const T  - p) + const T p) @@ -2259,8 +2216,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator-= ( - const uint256_t &  - p) + const uint256_t & p) @@ -2302,8 +2258,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator/ ( - const T &  - p) + const T & p) @@ -2348,8 +2303,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator/ ( - const uint256_t &  - p) + const uint256_t & p) @@ -2368,7 +2322,7 @@ template<typename T , typename = typename std::enable_if<
Returns
unsigned 256-bit quotient.
-
469{ return divide(p).first; }
+
469{ return divide(p).first; }
Here is the call graph for this function:
@@ -2391,8 +2345,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator/= ( - const T &  - p) + const T & p) @@ -2436,8 +2389,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator/= ( - const uint256_t &  - p) + const uint256_t & p) @@ -2457,7 +2409,7 @@ template<typename T , typename = typename std::enable_if<
Returns
this set as unsigned 256-bit quotient.
476 {
-
477 *this = divide(p).first;
+
477 *this = divide(p).first;
478 return *this;
479 }
@@ -2482,8 +2434,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator< ( - const T &  - other) + const T & other) @@ -2526,8 +2477,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator< ( - const uint256_t &  - other) + const uint256_t & other) @@ -2566,8 +2516,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator<< ( - const T &  - p) + const T & p) @@ -2618,8 +2567,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator<<= ( - const T &  - p) + const T & p) @@ -2673,8 +2621,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator<= ( - const T &  - other) + const T & other) @@ -2717,8 +2664,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator<= ( - const uint256_t &  - other) + const uint256_t & other) @@ -2755,8 +2701,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator= ( - const std::string &  - p) + const std::string & p) @@ -2776,7 +2721,7 @@ template<typename T , typename = typename std::enable_if<
Returns
this pointer with it's value equal to p
202 {
-
203 __get_integer_from_string(p);
+
203 __get_integer_from_string(p);
204 return *this;
205 }
@@ -2801,8 +2746,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator= ( - const T &  - p) + const T & p) @@ -2846,8 +2790,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator= ( - const uint256_t &  - p) + const uint256_t & p) @@ -2883,8 +2826,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator== ( - const T &  - other) + const T & other) @@ -2927,8 +2869,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator== ( - const uint256_t &  - other) + const uint256_t & other) @@ -2967,8 +2908,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator> ( - const T &  - other) + const T & other) @@ -3011,8 +2951,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator> ( - const uint256_t &  - other) + const uint256_t & other) @@ -3051,8 +2990,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator>= ( - const T &  - other) + const T & other) @@ -3095,8 +3033,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator>= ( - const uint256_t &  - other) + const uint256_t & other) @@ -3135,8 +3072,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator>> ( - const T &  - p) + const T & p) @@ -3187,8 +3123,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator>>= ( - const T &  - p) + const T & p) @@ -3242,8 +3177,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator^ ( - const T &  - p) + const T & p) @@ -3286,8 +3220,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator^ ( - const uint256_t &  - p) + const uint256_t & p) @@ -3326,8 +3259,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator^= ( - const T &  - p) + const T & p) @@ -3371,8 +3303,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator^= ( - const uint256_t &  - p) + const uint256_t & p) @@ -3413,8 +3344,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator| ( - const T &  - p) + const T & p) @@ -3457,8 +3387,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator| ( - const uint256_t &  - p) + const uint256_t & p) @@ -3497,8 +3426,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator|= ( - const T &  - p) + const T & p) @@ -3542,8 +3470,7 @@ template<typename T , typename = typename std::enable_if< uint256_t & uint256_t::operator|= ( - const uint256_t &  - p) + const uint256_t & p) @@ -3584,8 +3511,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator|| ( - const T &  - b) + const T & b) @@ -3628,8 +3554,7 @@ template<typename T , typename = typename std::enable_if< bool uint256_t::operator|| ( - const uint256_t &  - b) + const uint256_t & b) @@ -3666,7 +3591,7 @@ template<typename T , typename = typename std::enable_if< uint256_t uint256_t::operator~ ( - ) + ) @@ -3695,7 +3620,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint256_t::upper ( - ) + ) const @@ -3725,19 +3650,12 @@ template<typename T , typename = typename std::enable_if< std::ostream & operator<< ( - std::ostream &  - op, + std::ostream & op, - uint256_t  - p  - - - - ) - + uint256_t p ) @@ -3843,7 +3761,7 @@ template<typename T , typename = typename std::enable_if< diff --git a/d1/d90/classdata__structures_1_1trie-members.html b/d1/d90/classdata__structures_1_1trie-members.html index 234680ab6..615e1c407 100644 --- a/d1/d90/classdata__structures_1_1trie-members.html +++ b/d1/d90/classdata__structures_1_1trie-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -117,7 +119,7 @@ $(document).ready(function(){initNavTree('d0/d3e/classdata__structures_1_1trie.h diff --git a/d1/d9a/hopcroft__karp_8cpp.html b/d1/d9a/hopcroft__karp_8cpp.html index 6d67b3a87..f9987a558 100644 --- a/d1/d9a/hopcroft__karp_8cpp.html +++ b/d1/d9a/hopcroft__karp_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph/hopcroft_karp.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -134,9 +136,9 @@ Namespaces - + - +

Functions

void tests ()
void tests ()
 
int main ()
int main ()
 Main function.
 
@@ -172,8 +174,7 @@ Algorithm int main ( - void  - ) + void ) @@ -182,7 +183,7 @@ Algorithm

Main function.

Returns
0 on exit
307{
-
308 tests(); // perform self-tests
+
308 tests(); // perform self-tests
309
310 int v1 = 0, v2 = 0, e = 0;
311 std::cin >> v1 >> v2 >> e; // vertices of left side, right side and edges
@@ -204,7 +205,7 @@ Algorithm
graph::HKGraph
Represents Bipartite graph for Hopcroft Karp implementation.
Definition hopcroft_karp.cpp:67
numerical_methods::simpson_method::g
double g(double x)
Another test function.
Definition composite_simpson_rule.cpp:115
-
tests
void tests()
Definition hopcroft_karp.cpp:255
+
tests
void tests()
Definition hopcroft_karp.cpp:255
Here is the call graph for this function:
@@ -222,7 +223,7 @@ Here is the call graph for this function:
void tests ( - ) + ) @@ -288,7 +289,7 @@ Here is the call graph for this function:
diff --git a/d1/d9e/prefix__sum__array_8cpp.html b/d1/d9e/prefix__sum__array_8cpp.html index 842ba8080..4477b74b4 100644 --- a/d1/d9e/prefix__sum__array_8cpp.html +++ b/d1/d9e/prefix__sum__array_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: range_queries/prefix_sum_array.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -127,16 +129,16 @@ Namespaces - + - + - + - +

Functions

void range_queries::prefix_sum_array::build (std::vector< int64_t > original_array)
void range_queries::prefix_sum_array::build (std::vector< int64_t > original_array)
 function that builds the PSA
 
int64_t range_queries::prefix_sum_array::query (int64_t beg, int64_t end)
int64_t range_queries::prefix_sum_array::query (int64_t beg, int64_t end)
 query function
 
static void test ()
static void test ()
 Self-test implementations.
 
int main ()
int main ()
 Main function.
 
@@ -168,8 +170,7 @@ Variables - - +
void range_queries::prefix_sum_array::build (std::vector< int64_t > original_array)std::vector< int64_t > original_array)
@@ -207,8 +208,7 @@ Here is the call graph for this function:
int main ( - void  - ) + void ) @@ -217,10 +217,10 @@ Here is the call graph for this function:

Main function.

Returns
0 on exit
80 {
-
81 test(); // run self-test implementations
+
81 test(); // run self-test implementations
82 return 0;
83}
-
test
static void test()
Self-test implementations.
Definition prefix_sum_array.cpp:61
+
test
static void test()
Self-test implementations.
Definition prefix_sum_array.cpp:61
Here is the call graph for this function:
@@ -238,19 +238,12 @@ Here is the call graph for this function:
int64_t range_queries::prefix_sum_array::query ( - int64_t  - beg, + int64_t beg, - int64_t  - end  - - - - ) - + int64_t end )
@@ -281,7 +274,7 @@ Here is the call graph for this function:
static void test ( - ) + ) @@ -298,7 +291,7 @@ Here is the call graph for this function:
62 std::vector<int64_t> values{0, 123, 0, 2, -2, 5,
63 24, 0, 23, -1, -1}; // original array
64
-
65 range_queries::prefix_sum_array::build(values);
+
65 range_queries::prefix_sum_array::build(values);
66 // queries are of the type: sum of the range [a, b] = psa[b] - psa[a-1]
67
68 assert(range_queries::prefix_sum_array::query(1, 10) ==
@@ -308,7 +301,7 @@ Here is the call graph for this function:
72 assert(range_queries::prefix_sum_array::query(5, 9) ==
73 51); // the sum of the interval [5, 9]
74}
-
range_queries::prefix_sum_array::build
void build(std::vector< int64_t > original_array)
function that builds the PSA
Definition prefix_sum_array.cpp:41
+
range_queries::prefix_sum_array::build
void build(std::vector< int64_t > original_array)
function that builds the PSA
Definition prefix_sum_array.cpp:41
@@ -319,7 +312,7 @@ Here is the call graph for this function: diff --git a/d1/da6/rungekutta_8cpp.html b/d1/da6/rungekutta_8cpp.html index dac11cdb6..8de5184dd 100644 --- a/d1/da6/rungekutta_8cpp.html +++ b/d1/da6/rungekutta_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/rungekutta.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -126,17 +128,17 @@ Namespaces - + - + - + - +

Functions

double numerical_methods::runge_kutta::rungeKutta (double init_x, const double &init_y, const double &x, const double &h)
double numerical_methods::runge_kutta::rungeKutta (double init_x, const double &init_y, const double &x, const double &h)
 the Runge Kutta method finds the value of integration of a function in the given limits. the lower limit of integration as the initial value and the upper limit is the given x
 
static double change (double x, double y)
static double change (double x, double y)
 for using the vector container
 
static void test ()
static void test ()
 Tests to check algorithm implementation.
 
int main ()
int main ()
 Main function.
 
@@ -157,19 +159,12 @@ Functions static double change ( - double  - x, + double x, - double  - y  - - - - ) - + double y ) @@ -181,7 +176,7 @@ Functions

for using the vector container

asserting the test functions for io operations

-

The change() function is used to return the updated iterative value corresponding to the given function

Parameters
+

The change() function is used to return the updated iterative value corresponding to the given function

Parameters
@@ -204,8 +199,7 @@ Functions - - +
xis the value corresponding to the x coordinate
yis the value corresponding to the y coordinate
int main (void )void )
@@ -214,10 +208,10 @@ Functions

Main function.

Returns
0 on exit
130 {
-
131 test(); // Execute the tests
+
131 test(); // Execute the tests
132 return 0;
133}
-
test
static void test()
Tests to check algorithm implementation.
Definition rungekutta.cpp:100
+
test
static void test()
Tests to check algorithm implementation.
Definition rungekutta.cpp:100
Here is the call graph for this function:
@@ -235,31 +229,22 @@ Here is the call graph for this function:
double numerical_methods::runge_kutta::rungeKutta ( - double  - init_x, + double init_x, - const double &  - init_y, + const double & init_y, - const double &  - x, + const double & x, - const double &  - h  - - - - ) - + const double & h )
@@ -296,10 +281,10 @@ Here is the call graph for this function:
74 for (int i = 1; i <= n; ++i) {
75 // Apply Runge Kutta Formulas
76 // to find next value of y
-
77 k[0] = h * change(init_x, y);
-
78 k[1] = h * change(init_x + 0.5 * h, y + 0.5 * k[0]);
-
79 k[2] = h * change(init_x + 0.5 * h, y + 0.5 * k[1]);
-
80 k[3] = h * change(init_x + h, y + k[2]);
+
77 k[0] = h * change(init_x, y);
+
78 k[1] = h * change(init_x + 0.5 * h, y + 0.5 * k[0]);
+
79 k[2] = h * change(init_x + 0.5 * h, y + 0.5 * k[1]);
+
80 k[3] = h * change(init_x + h, y + k[2]);
81
82 // Update next value of y
83
@@ -314,7 +299,7 @@ Here is the call graph for this function:
92}
numerical_methods::simpson_method::k
double k(double x)
Another test function.
Definition composite_simpson_rule.cpp:117
h
int h(int key)
Definition hash_search.cpp:45
-
change
static double change(double x, double y)
for using the vector container
Definition rungekutta.cpp:33
+
change
static double change(double x, double y)
for using the vector container
Definition rungekutta.cpp:33
Here is the call graph for this function:
@@ -336,7 +321,7 @@ Here is the call graph for this function: static void test ( - ) + ) @@ -355,27 +340,27 @@ Here is the call graph for this function:
103
104 std::cout << "Test 1...."
105 << "\n";
-
106 double valfirst = numerical_methods::runge_kutta::rungeKutta(
+
106 double valfirst = numerical_methods::runge_kutta::rungeKutta(
107 2, 3, 4, 0.2); // Tests the function with pre calculated values
108 assert(valfirst == 3.10363932323749570);
109 std::cout << "Passed Test 1\n";
110
111 std::cout << "Test 2...."
112 << "\n";
-
113 double valsec = numerical_methods::runge_kutta::rungeKutta(
+
113 double valsec = numerical_methods::runge_kutta::rungeKutta(
114 1, 2, 5, 0.1); // The value of step changed
115 assert(valsec == 3.40600589380261409);
116 std::cout << "Passed Test 2\n";
117
118 std::cout << "Test 3...."
119 << "\n";
-
120 double valthird = numerical_methods::runge_kutta::rungeKutta(
+
120 double valthird = numerical_methods::runge_kutta::rungeKutta(
121 -1, 3, 4, 0.1); // Tested with negative value
122 assert(valthird == 2.49251005860244268);
123 std::cout << "Passed Test 3\n";
124}
-
numerical_methods::runge_kutta::rungeKutta
double rungeKutta(double init_x, const double &init_y, const double &x, const double &h)
the Runge Kutta method finds the value of integration of a function in the given limits....
Definition rungekutta.cpp:57
+
numerical_methods::runge_kutta::rungeKutta
double rungeKutta(double init_x, const double &init_y, const double &x, const double &h)
the Runge Kutta method finds the value of integration of a function in the given limits....
Definition rungekutta.cpp:57
@@ -385,7 +370,7 @@ Here is the call graph for this function: diff --git a/d1/daa/random__pivot__quick__sort_8cpp.html b/d1/daa/random__pivot__quick__sort_8cpp.html index 3195de8b4..664bfce39 100644 --- a/d1/daa/random__pivot__quick__sort_8cpp.html +++ b/d1/daa/random__pivot__quick__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/random_pivot_quick_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -137,28 +139,28 @@ Namespaces

Functions

template<size_t T> -void sorting::random_pivot_quick_sort::showArray (std::array< int64_t, T > arr) +void sorting::random_pivot_quick_sort::showArray (std::array< int64_t, T > arr)  Utility function to print the array.
  -int64_t sorting::random_pivot_quick_sort::getRandomIndex (int64_t start, int64_t end) +int64_t sorting::random_pivot_quick_sort::getRandomIndex (int64_t start, int64_t end)  Takes the start and end indices of an array and returns a random int64_teger between the range of those two for selecting pivot element.
  template<size_t size> -std::tuple< int64_t, std::array< int64_t, size > > sorting::random_pivot_quick_sort::partition (std::array< int64_t, size > arr, int64_t start, int64_t end) +std::tuple< int64_t, std::array< int64_t, size > > sorting::random_pivot_quick_sort::partition (std::array< int64_t, size > arr, int64_t start, int64_t end)  A partition function which handles the partition logic of quick sort.
  template<size_t size> -std::array< int64_t, size > sorting::random_pivot_quick_sort::quickSortRP (std::array< int64_t, size > arr, int64_t start, int64_t end) +std::array< int64_t, size > sorting::random_pivot_quick_sort::quickSortRP (std::array< int64_t, size > arr, int64_t start, int64_t end)  Random pivot quick sort function. This function is the starting point of the algorithm.
  template<size_t size> -std::array< int64_t, size > sorting::random_pivot_quick_sort::generateUnsortedArray (int64_t from, int64_t to) +std::array< int64_t, size > sorting::random_pivot_quick_sort::generateUnsortedArray (int64_t from, int64_t to)  A function utility to generate unsorted array of given size and range.
  -static void test () +static void test ()  Self-test implementations.
  -int main (int argc, char *argv[]) +int main (int argc, char *argv[])  Main function.
  @@ -201,19 +203,12 @@ template<size_t size>
std::array< int64_t, size > sorting::random_pivot_quick_sort::generateUnsortedArray ( - int64_t  - from, + int64_t from, - int64_t  - to  - - - - ) - + int64_t to )
@@ -234,12 +229,12 @@ template<size_t size>
Returns
std::array<int64_t , size> Unsorted array of specified size.
160 {
-
161 srand(time(nullptr));
+
161 srand(time(nullptr));
162 std::array<int64_t, size> unsortedArray{};
163 assert(from < to);
164 int64_t i = 0;
165 while (i < size) {
-
166 int64_t randomNum = from + rand() % (to - from + 1);
+
166 int64_t randomNum = from + rand() % (to - from + 1);
167 if (randomNum) {
168 unsortedArray[i] = randomNum;
169 i++;
@@ -248,8 +243,6 @@ template<size_t size>
172 return unsortedArray;
173}
-
std::rand
T rand(T... args)
-
std::srand
T srand(T... args)
std::time
T time(T... args)
Here is the call graph for this function:
@@ -268,19 +261,12 @@ Here is the call graph for this function: int64_t sorting::random_pivot_quick_sort::getRandomIndex ( - int64_t  - start, + int64_t start, - int64_t  - end  - - - - ) - + int64_t end )
@@ -295,8 +281,8 @@ Here is the call graph for this function:
Returns
int64_t A random number between start and end index.
88 {
-
89 srand(time(nullptr)); // Initialize random number generator.
-
90 int64_t randomPivotIndex = start + rand() % (end - start + 1);
+
89 srand(time(nullptr)); // Initialize random number generator.
+
90 int64_t randomPivotIndex = start + rand() % (end - start + 1);
91 return randomPivotIndex;
92}
std::end
T end(T... args)
@@ -317,19 +303,12 @@ Here is the call graph for this function:
int main ( - int  - argc, + int argc, - char *  - argv[]  - - - - ) - + char * argv[] )
@@ -344,27 +323,27 @@ Here is the call graph for this function:
Returns
0 on exit
323 {
-
324 test(); // Executes various test cases.
+
324 test(); // Executes various test cases.
325
326 const int64_t inputSize = 10;
327 std::array<int64_t, inputSize> unsorted_array =
328 sorting::random_pivot_quick_sort::generateUnsortedArray<inputSize>(
329 50, 1000);
330 std::cout << "Unsorted array is : " << std::endl;
-
331 sorting::random_pivot_quick_sort::showArray(unsorted_array);
+
331 sorting::random_pivot_quick_sort::showArray(unsorted_array);
332
333 std::array<int64_t, inputSize> sorted_array =
-
334 sorting::random_pivot_quick_sort::quickSortRP(
+
334 sorting::random_pivot_quick_sort::quickSortRP(
335 unsorted_array, 0, unsorted_array.size() - 1);
336 std::cout << "Sorted array is : " << std::endl;
-
337 sorting::random_pivot_quick_sort::showArray(sorted_array);
+
337 sorting::random_pivot_quick_sort::showArray(sorted_array);
338 return 0;
339}
std::endl
T endl(T... args)
-
sorting::random_pivot_quick_sort::quickSortRP
std::array< int64_t, size > quickSortRP(std::array< int64_t, size > arr, int64_t start, int64_t end)
Random pivot quick sort function. This function is the starting point of the algorithm.
Definition random_pivot_quick_sort.cpp:130
-
test
static void test()
Self-test implementations.
Definition random_pivot_quick_sort.cpp:312
-
sorting::random_pivot_quick_sort::showArray
void showArray(std::array< int64_t, T > arr)
Utility function to print the array.
Definition random_pivot_quick_sort.cpp:73
+
sorting::random_pivot_quick_sort::quickSortRP
std::array< int64_t, size > quickSortRP(std::array< int64_t, size > arr, int64_t start, int64_t end)
Random pivot quick sort function. This function is the starting point of the algorithm.
Definition random_pivot_quick_sort.cpp:130
+
test
static void test()
Self-test implementations.
Definition random_pivot_quick_sort.cpp:312
+
sorting::random_pivot_quick_sort::showArray
void showArray(std::array< int64_t, T > arr)
Utility function to print the array.
Definition random_pivot_quick_sort.cpp:73
std::array::size
T size(T... args)
Here is the call graph for this function:
@@ -385,25 +364,17 @@ template<size_t size> std::tuple< int64_t, std::array< int64_t, size > > sorting::random_pivot_quick_sort::partition ( - std::array< int64_t, size >  - arr, + std::array< int64_t, size > arr, - int64_t  - start, + int64_t start, - int64_t  - end  - - - - ) - + int64_t end )
@@ -460,25 +431,17 @@ template<size_t size>
std::array< int64_t, size > sorting::random_pivot_quick_sort::quickSortRP ( - std::array< int64_t, size >  - arr, + std::array< int64_t, size > arr, - int64_t  - start, + int64_t start, - int64_t  - end  - - - - ) - + int64_t end )
@@ -500,7 +463,7 @@ template<size_t size>
Returns
std::array<int64_t , size> A fully sorted array in ascending order.
131 {
132 if (start < end) {
-
133 int64_t randomIndex = getRandomIndex(start, end);
+
133 int64_t randomIndex = getRandomIndex(start, end);
134
135 // switching the pivot with right most bound.
136 std::swap(arr[end], arr[randomIndex]);
@@ -511,15 +474,15 @@ template<size_t size>
141
142 // Recursively calling
143 std::array<int64_t, arr.size()> rightSortingLeft =
-
144 quickSortRP(arr, start, pivotIndex - 1);
+
144 quickSortRP(arr, start, pivotIndex - 1);
145 std::array<int64_t, arr.size()> full_sorted =
-
146 quickSortRP(rightSortingLeft, pivotIndex + 1, end);
+
146 quickSortRP(rightSortingLeft, pivotIndex + 1, end);
147 arr = full_sorted;
148 }
149 return arr;
150}
std::partition
T partition(T... args)
-
sorting::random_pivot_quick_sort::getRandomIndex
int64_t getRandomIndex(int64_t start, int64_t end)
Takes the start and end indices of an array and returns a random int64_teger between the range of tho...
Definition random_pivot_quick_sort.cpp:88
+
sorting::random_pivot_quick_sort::getRandomIndex
int64_t getRandomIndex(int64_t start, int64_t end)
Takes the start and end indices of an array and returns a random int64_teger between the range of tho...
Definition random_pivot_quick_sort.cpp:88
std::tie
T tie(T... args)
Here is the call graph for this function:
@@ -540,8 +503,7 @@ template<size_t T> void sorting::random_pivot_quick_sort::showArray ( - std::array< int64_t, T >  - arr) + std::array< int64_t, T > arr) @@ -587,7 +549,7 @@ Here is the call graph for this function: static void test ( - ) + ) @@ -620,7 +582,7 @@ Here is the call graph for this function: diff --git a/d1/db3/structcompare.html b/d1/db3/structcompare.html index 9da16483d..782b9757a 100644 --- a/d1/db3/structcompare.html +++ b/d1/db3/structcompare.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: compare Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d1/db3/structcompare.html','../../'); - +

Public Member Functions

bool operator() (MinHeapNode *l, MinHeapNode *r)
bool operator() (MinHeapNode *l, MinHeapNode *r)
 

Member Function Documentation

@@ -122,19 +124,12 @@ Public Member Functions bool compare::operator() ( - MinHeapNode *  - l, + MinHeapNode * l, - MinHeapNode *  - r  - - - - ) - + MinHeapNode * r ) @@ -159,7 +154,7 @@ Public Member Functions diff --git a/d1/db6/namespaceknight__tour.html b/d1/db6/namespaceknight__tour.html index 2e8285fd0..9ab13b64a 100644 --- a/d1/db6/namespaceknight__tour.html +++ b/d1/db6/namespaceknight__tour.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: knight_tour Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d1/db6/namespaceknight__tour.html','..

Functions for the Knight's tour algorithm. -More...

+More...

Detailed Description

Functions for the Knight's tour algorithm.

@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d1/db6/namespaceknight__tour.html','.. diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp.html b/d1/db7/dynamic__programming_2armstrong__number_8cpp.html index acbe394ac..b3483441a 100644 --- a/d1/db7/dynamic__programming_2armstrong__number_8cpp.html +++ b/d1/db7/dynamic__programming_2armstrong__number_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/armstrong_number.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -127,10 +129,10 @@ Functions bool dynamic_programming::is_armstrong (const T &number)  Checks if the given number is armstrong or not.
  -static void tests () +static void tests ()  Self-test implementations.
  -int main () +int main ()  Main function.
  @@ -152,8 +154,7 @@ Functions int main ( - void  - ) + void ) @@ -162,10 +163,10 @@ Functions

Main function.

Returns
0 on exit
90 {
-
91 tests(); // run self-test implementations
+
91 tests(); // run self-test implementations
92 return 0;
93}
-
tests
static void tests()
Self-test implementations.
Definition armstrong_number.cpp:71
+
tests
static void tests()
Self-test implementations.
Definition armstrong_number.cpp:71
Here is the call graph for this function:
@@ -186,7 +187,7 @@ Here is the call graph for this function:
static void tests ( - ) + ) @@ -229,7 +230,7 @@ Here is the call graph for this function:
diff --git a/d1/dbb/n__choose__r_8cpp.html b/d1/dbb/n__choose__r_8cpp.html index d2789560c..ba0047bfa 100644 --- a/d1/dbb/n__choose__r_8cpp.html +++ b/d1/dbb/n__choose__r_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/n_choose_r.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -126,10 +128,10 @@ Functions T math::n_choose_r (T n, T r)  This is the function implementation of \( \binom{n}{r} \).
  -static void test () +static void test ()  Test implementations.
  -int main (int argc, char *argv[]) +int main (int argc, char *argv[])  Main function.
  @@ -147,19 +149,12 @@ Functions int main ( - int  - argc, + int argc, - char *  - argv[]  - - - - ) - + char * argv[] )
@@ -174,10 +169,10 @@ Functions
Returns
0 on exit
80 {
-
81 test(); // executing tests
+
81 test(); // executing tests
82 return 0;
83}
-
test
static void test()
Test implementations.
Definition n_choose_r.cpp:52
+
test
static void test()
Test implementations.
Definition n_choose_r.cpp:52
Here is the call graph for this function:
@@ -198,7 +193,7 @@ Here is the call graph for this function:
static void test ( - ) + ) @@ -249,7 +244,7 @@ Here is the call graph for this function:
diff --git a/d1/dbe/lu__decomposition_8h.html b/d1/dbe/lu__decomposition_8h.html index d0c84eb3f..a27ebf981 100644 --- a/d1/dbe/lu__decomposition_8h.html +++ b/d1/dbe/lu__decomposition_8h.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/lu_decomposition.h File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -124,25 +126,25 @@ This graph shows which files directly or indirectly include this file:
- - - + + +

Typedefs

template<typename T >
using matrix = std::vector< std::valarray< T > >
 
template<typename T >
using matrix = std::vector<std::valarray<T>>
 
- + - +

Functions

template<typename T >
int lu_decomposition (const matrix< T > &A, matrix< double > *L, matrix< double > *U)
int lu_decomposition (const matrix< T > &A, matrix< double > *L, matrix< double > *U)
 
template<typename T >
double determinant_lu (const matrix< T > &A)
double determinant_lu (const matrix< T > &A)
 

Detailed Description

Functions associated with LU Decomposition of a square matrix.

Author
Krishna Vedala

Typedef Documentation

- -

◆ matrix

+ +

◆ matrix

@@ -150,7 +152,7 @@ Functions template<typename T >
- +
using matrix = std::vector<std::valarray<T> >using matrix = std::vector<std::valarray<T>>
@@ -170,8 +172,7 @@ template<typename T >
double determinant_lu ( - const matrix< T > &  - A) + const matrix< T > & A) @@ -194,7 +195,7 @@ template<typename T >
91 matrix<double> L(A.size(), std::valarray<double>(A.size()));
92 matrix<double> U(A.size(), std::valarray<double>(A.size()));
93
-
94 if (lu_decomposition(A, &L, &U) < 0)
+
94 if (lu_decomposition(A, &L, &U) < 0)
95 return 0;
96
97 double result = 1.f;
@@ -204,7 +205,7 @@ template<typename T >
101 return result;
102}
math::fibonacci_sum::result
uint64_t result(uint64_t n)
Definition fibonacci_sum.cpp:76
-
lu_decomposition
int lu_decomposition(const matrix< T > &A, matrix< double > *L, matrix< double > *U)
Definition lu_decomposition.h:29
+
lu_decomposition
int lu_decomposition(const matrix< T > &A, matrix< double > *L, matrix< double > *U)
Definition lu_decomposition.h:29
std::vector::size
T size(T... args)
@@ -227,25 +228,17 @@ template<typename T > int lu_decomposition ( - const matrix< T > &  - A, + const matrix< T > & A, - matrix< double > *  - L, + matrix< double > * L, - matrix< double > *  - U  - - - - ) - + matrix< double > * U )
@@ -326,7 +319,7 @@ Here is the call graph for this function:
diff --git a/d1/dbe/lu__decomposition_8h.js b/d1/dbe/lu__decomposition_8h.js index e5734e378..4d85bf3e0 100644 --- a/d1/dbe/lu__decomposition_8h.js +++ b/d1/dbe/lu__decomposition_8h.js @@ -1,6 +1,6 @@ var lu__decomposition_8h = [ - [ "matrix", "d1/dbe/lu__decomposition_8h.html#aed8766713ee9b561a4acdcdff5f90ea5", null ], + [ "matrix", "d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4", null ], [ "determinant_lu", "d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f", null ], [ "lu_decomposition", "d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509", null ] ]; \ No newline at end of file diff --git a/d1/dbe/lu__decomposition_8h_source.html b/d1/dbe/lu__decomposition_8h_source.html index c74880cf1..9a6e5a35a 100644 --- a/d1/dbe/lu__decomposition_8h_source.html +++ b/d1/dbe/lu__decomposition_8h_source.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/lu_decomposition.h Source File + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -76,7 +78,7 @@ $(document).ready(function() { init_codefold(1); });
@@ -123,7 +125,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
16
17/** Define matrix type as a `std::vector` of `std::valarray` */
18template <typename T>
-
19using matrix = std::vector<std::valarray<T>>;
+
19using matrix = std::vector<std::valarray<T>>;
20
21/** Perform LU decomposition on matrix
22 * \param[in] A matrix to decompose
@@ -224,7 +226,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm diff --git a/d1/dc0/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node-members.html b/d1/dc0/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node-members.html index 0fc04c653..38a5abaa8 100644 --- a/d1/dc0/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node-members.html +++ b/d1/dc0/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d5/db5/classoperations__on__datastruct diff --git a/d1/dc2/classstack.html b/d1/dc2/classstack.html index b32728e10..5099a494f 100644 --- a/d1/dc2/classstack.html +++ b/d1/dc2/classstack.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: stack< ValueType > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -108,7 +110,7 @@ $(document).ready(function(){initNavTree('d1/dc2/classstack.html','../../'); ini

for std::invalid_argument - More...

+ More...

#include <stack.hpp>

@@ -125,29 +127,29 @@ using value_type = Val - + - + - + - + - + - + - +

Public Member Functions

void display () const
void display () const
 
std::vector< value_type > toVector () const
std::vector< value_type > toVector () const
 
bool isEmptyStack () const
bool isEmptyStack () const
 
void push (const value_type &item)
void push (const value_type &item)
 
value_type top () const
value_type top () const
 
void pop ()
void pop ()
 
void clear ()
void clear ()
 
- +

Private Member Functions

void ensureNotEmpty () const
void ensureNotEmpty () const
 
- + @@ -178,7 +180,7 @@ template<class ValueType > - +

Private Attributes

std::shared_ptr< Node< value_type > > stackTop
std::shared_ptr< Node< value_type > > stackTop
 
std::size_t size = 0
void stack< ValueType >::clear ())
@@ -190,11 +192,11 @@ template<class ValueType >

Clear stack

69 {
-
70 stackTop = nullptr;
-
71 size = 0;
+
70 stackTop = nullptr;
+
71 size = 0;
72 }
-
stack::size
std::size_t size
size of stack
Definition stack.hpp:77
-
stack::stackTop
std::shared_ptr< Node< value_type > > stackTop
Definition stack.hpp:75
+
stack::size
std::size_t size
size of stack
Definition stack.hpp:77
+
stack::stackTop
std::shared_ptr< Node< value_type > > stackTop
Definition stack.hpp:75
@@ -212,7 +214,7 @@ template<class ValueType > void stack< ValueType >::display ( - ) + ) const @@ -225,9 +227,9 @@ template<class ValueType >

Show stack

24 {
25 std::cout << "Top --> ";
-
26 display_all(this->stackTop.get());
+
26 display_all(this->stackTop.get());
27 std::cout << '\n';
-
28 std::cout << "Size of stack: " << size << std::endl;
+
28 std::cout << "Size of stack: " << size << std::endl;
29 }
std::endl
T endl(T... args)
@@ -254,7 +256,7 @@ template<class ValueType >
void stack< ValueType >::ensureNotEmpty ( - ) + ) const @@ -265,11 +267,11 @@ template<class ValueType >
36 {
-
37 if (isEmptyStack()) {
+
37 if (isEmptyStack()) {
38 throw std::invalid_argument("Stack is empty.");
39 }
40 }
-
stack::isEmptyStack
bool isEmptyStack() const
Definition stack.hpp:44
+
stack::isEmptyStack
bool isEmptyStack() const
Definition stack.hpp:44
@@ -288,7 +290,7 @@ template<class ValueType > bool stack< ValueType >::isEmptyStack ( - ) + ) const @@ -299,7 +301,7 @@ template<class ValueType >

Determine whether the stack is empty

-
44{ return (stackTop == nullptr); }
+
44{ return (stackTop == nullptr); }
@@ -317,7 +319,7 @@ template<class ValueType > void stack< ValueType >::pop ( - ) + ) @@ -330,8 +332,8 @@ template<class ValueType >

Remove the top element of the stack

62 {
63 ensureNotEmpty();
-
64 stackTop = stackTop->next;
-
65 size--;
+
64 stackTop = stackTop->next;
+
65 size--;
66 }
@@ -350,8 +352,7 @@ template<class ValueType > void stack< ValueType >::push ( - const value_type &  - item) + const value_type & item) @@ -365,9 +366,9 @@ template<class ValueType >
47 {
48 auto newNode = std::make_shared<Node<value_type>>();
49 newNode->data = item;
-
50 newNode->next = stackTop;
-
51 stackTop = newNode;
-
52 size++;
+
50 newNode->next = stackTop;
+
51 stackTop = newNode;
+
52 size++;
53 }
@@ -386,7 +387,7 @@ template<class ValueType > value_type stack< ValueType >::top ( - ) + ) const @@ -399,7 +400,7 @@ template<class ValueType >

Return the top element of the stack

56 {
57 ensureNotEmpty();
-
58 return stackTop->data;
+
58 return stackTop->data;
59 }
@@ -418,7 +419,7 @@ template<class ValueType > std::vector< value_type > stack< ValueType >::toVector ( - ) + ) const @@ -429,7 +430,7 @@ template<class ValueType >
31 {
-
32 return push_all_to_vector(this->stackTop.get(), this->size);
+
32 return push_all_to_vector(this->stackTop.get(), this->size);
33 }
@@ -472,7 +473,7 @@ template<class ValueType > diff --git a/d1/dc7/linear__probing__hash__table_8cpp.html b/d1/dc7/linear__probing__hash__table_8cpp.html index 201a00653..e5fb4d2b3 100644 --- a/d1/dc7/linear__probing__hash__table_8cpp.html +++ b/d1/dc7/linear__probing__hash__table_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: hashing/linear_probing_hash_table.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -130,9 +132,9 @@ Namespaces - - + +

Typedefs

-using linear_probing::Entry = Entry
 
+using linear_probing::Entry = struct Entry
 
@@ -157,7 +159,7 @@ Functions - +

Functions

 
void linear_probing::removalInfo (int key)
 
int main ()
int main ()
 
- - +

@@ -197,8 +199,7 @@ bool 

linear_probing::rehas
int main (void )void )
@@ -284,7 +285,7 @@ Here is the call graph for this function:
diff --git a/d1/dcc/wiggle__sort_8cpp.html b/d1/dcc/wiggle__sort_8cpp.html index a4b590139..d214eb4ed 100644 --- a/d1/dcc/wiggle__sort_8cpp.html +++ b/d1/dcc/wiggle__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/wiggle_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -129,7 +131,7 @@ Namespaces

Functions

template<typename T > -std::vector< T > sorting::wiggle_sort::wiggleSort (const std::vector< T > &arr) +std::vector< T > sorting::wiggle_sort::wiggleSort (const std::vector< T > &arr)  Function used for sorting the elements in wave form.
  template<typename T > @@ -157,8 +159,7 @@ template<typename T >
std::vector< T > sorting::wiggle_sort::wiggleSort ( - const std::vector< T > &  - arr) + const std::vector< T > & arr) @@ -210,7 +211,7 @@ Here is the call graph for this function: diff --git a/d1/de0/namespacenumerical__methods.html b/d1/de0/namespacenumerical__methods.html index 5f2594532..055c43f3c 100644 --- a/d1/de0/namespacenumerical__methods.html +++ b/d1/de0/namespacenumerical__methods.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -104,17 +106,17 @@ $(document).ready(function(){initNavTree('d1/de0/namespacenumerical__methods.htm

for assert -More...

+More...

- + - + - +

Functions

double babylonian_method (double radicand)
double babylonian_method (double radicand)
 Babylonian methods is an iterative function which returns square root of radicand.
 
std::complex< double > * FastFourierTransform (std::complex< double > *p, uint8_t n)
std::complex< double > * FastFourierTransform (std::complex< double > *p, uint8_t n)
 FastFourierTransform is a recursive function which returns list of complex numbers.
 
std::complex< double > * InverseFastFourierTransform (std::complex< double > *p, uint8_t n)
std::complex< double > * InverseFastFourierTransform (std::complex< double > *p, uint8_t n)
 InverseFastFourierTransform is a recursive function which returns list of complex numbers.
 
@@ -147,8 +149,7 @@ Functions double numerical_methods::babylonian_method ( - double  - radicand) + double radicand) @@ -210,19 +211,12 @@ Here is the call graph for this function:
std::complex< double > * numerical_methods::FastFourierTransform ( - std::complex< double > *  - p, + std::complex< double > * p, - uint8_t  - n  - - - - ) - + uint8_t n )
@@ -277,10 +271,10 @@ y if n!=1
63 }
64
65 std::complex<double> *ye =
-
66 FastFourierTransform(pe, n / 2); /// Recursive Call
+
66 FastFourierTransform(pe, n / 2); /// Recursive Call
67
68 std::complex<double> *yo =
-
69 FastFourierTransform(po, n / 2); /// Recursive Call
+
69 FastFourierTransform(po, n / 2); /// Recursive Call
70
71 auto *y = new std::complex<double>[n]; /// Final value representation list
72
@@ -306,7 +300,7 @@ y if n!=1
92 return y;
93}
-
numerical_methods::FastFourierTransform
std::complex< double > * FastFourierTransform(std::complex< double > *p, uint8_t n)
FastFourierTransform is a recursive function which returns list of complex numbers.
Definition fast_fourier_transform.cpp:41
+
numerical_methods::FastFourierTransform
std::complex< double > * FastFourierTransform(std::complex< double > *p, uint8_t n)
FastFourierTransform is a recursive function which returns list of complex numbers.
Definition fast_fourier_transform.cpp:41
std::pow
T pow(T... args)
Here is the call graph for this function:
@@ -325,19 +319,12 @@ Here is the call graph for this function: std::complex< double > * numerical_methods::InverseFastFourierTransform ( - std::complex< double > *  - p, + std::complex< double > * p, - uint8_t  - n  - - - - ) - + uint8_t n )
@@ -397,10 +384,10 @@ y if n!=1
59 }
60
61 std::complex<double> *ye =
-
62 InverseFastFourierTransform(pe, n / 2); /// Recursive Call
+
62 InverseFastFourierTransform(pe, n / 2); /// Recursive Call
63
64 std::complex<double> *yo =
-
65 InverseFastFourierTransform(po, n / 2); /// Recursive Call
+
65 InverseFastFourierTransform(po, n / 2); /// Recursive Call
66
67 auto *y = new std::complex<double>[n]; /// Final value representation list
68
@@ -426,7 +413,7 @@ y if n!=1
88 return y;
89}
std::complex::imag
T imag(T... args)
-
numerical_methods::InverseFastFourierTransform
std::complex< double > * InverseFastFourierTransform(std::complex< double > *p, uint8_t n)
InverseFastFourierTransform is a recursive function which returns list of complex numbers.
Definition inverse_fast_fourier_transform.cpp:33
+
numerical_methods::InverseFastFourierTransform
std::complex< double > * InverseFastFourierTransform(std::complex< double > *p, uint8_t n)
InverseFastFourierTransform is a recursive function which returns list of complex numbers.
Definition inverse_fast_fourier_transform.cpp:33
std::complex::real
T real(T... args)
Here is the call graph for this function:
@@ -442,7 +429,7 @@ Here is the call graph for this function: diff --git a/d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html b/d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html index 2347cdaa9..9b07bbe2d 100644 --- a/d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html +++ b/d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -113,7 +115,7 @@ $(document).ready(function(){initNavTree('d4/dde/classgeometry_1_1jarvis_1_1_con diff --git a/d1/de9/integral__approximation_8cpp.html b/d1/de9/integral__approximation_8cpp.html index a8c1efc3d..d63e31d5a 100644 --- a/d1/de9/integral__approximation_8cpp.html +++ b/d1/de9/integral__approximation_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/integral_approximation.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -130,9 +132,9 @@ Functions void math::test_eval (double approx, double expected, double threshold)  Wrapper to evaluate if the approximated value is within .XX% threshold of the exact value.
  -static void test () +static void test ()   -int main () +int main ()  Main function.
  @@ -151,8 +153,7 @@ Functions int main ( - void  - ) + void ) @@ -185,7 +186,7 @@ Here is the call graph for this function:
static void test ( - ) + ) @@ -268,7 +269,7 @@ Here is the call graph for this function: diff --git a/d1/deb/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node-members.html b/d1/deb/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node-members.html index afd7bf8d7..9fb92a907 100644 --- a/d1/deb/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node-members.html +++ b/d1/deb/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -110,7 +112,7 @@ $(document).ready(function(){initNavTree('d5/d12/structdata__structures_1_1trie_ diff --git a/d1/ded/windowed__median_8cpp.html b/d1/ded/windowed__median_8cpp.html index e2578dfd0..3c4eec550 100644 --- a/d1/ded/windowed__median_8cpp.html +++ b/d1/ded/windowed__median_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: probability/windowed_median.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -137,19 +139,19 @@ Namespaces - - - + + - +

Typedefs

-using probability::windowed_median::Window = std::list< int >
 
+
+using probability::windowed_median::Window = std::list<int>
 
using probability::windowed_median::size_type = Window::size_type
 
 
- + - +

Functions

static void test (const std::vector< int > &vals, int windowSize)
static void test (const std::vector< int > &vals, int windowSize)
 Self-test implementations.
 
int main (int argc, const char *argv[])
int main (int argc, const char *argv[])
 Main function.
 
@@ -170,19 +172,12 @@ Algorithm int main ( - int  - argc, + int argc, - const char *  - argv[]  - - - - ) - + const char * argv[] )
@@ -242,7 +237,7 @@ Algorithm
228 vals.reserve(n);
229 for (int i = 0; i < n; i++) {
230 vals.push_back(
-
231 rand() - RAND_MAX); /// Random array values (positive/negative)
+
231 rand() - RAND_MAX); /// Random array values (positive/negative)
232 }
233 test(vals, windowSize); /// Testing randomized test
234 }
@@ -276,19 +271,12 @@ Here is the call graph for this function:
static void test ( - const std::vector< int > &  - vals, + const std::vector< int > & vals, - int  - windowSize  - - - - ) - + int windowSize ) @@ -331,7 +319,7 @@ Here is the call graph for this function: diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list.html b/d1/def/classdata__structures_1_1linked__list_1_1list.html index 23f41f3b2..24ed69c90 100644 --- a/d1/def/classdata__structures_1_1linked__list_1_1list.html +++ b/d1/def/classdata__structures_1_1linked__list_1_1list.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures::linked_list::list Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -113,57 +115,57 @@ Collaboration diagram for data_structures::linked_list::list:
- + - + - + - + - + - + - + - + - + - + - + - + - + - +

Public Member Functions

 list ()
 list ()
 
bool isEmpty ()
bool isEmpty ()
 
void push_back (int new_elem)
void push_back (int new_elem)
 
void push_front (int new_elem)
void push_front (int new_elem)
 
void erase (int old_elem)
void erase (int old_elem)
 
void display ()
void display ()
 
std::shared_ptr< link > search (int find_elem)
std::shared_ptr< link > search (int find_elem)
 
void reverse ()
 
bool isEmpty () const
bool isEmpty () const
 Utility function that checks if the list is empty.
 
void insert (int32_t new_elem)
void insert (int32_t new_elem)
 Utility function that adds a new element at the end of the list.
 
void reverseList ()
void reverseList ()
 Utility function for reversing a list.
 
void display () const
 
int32_t top () const
int32_t top () const
 Utility function to find the top element of the list.
 
int32_t last () const
 
int32_t traverse (int32_t index) const
int32_t traverse (int32_t index) const
 Utility function to find the i th element of the list.
 
 list (const list &other)
 list (const list &other)
 copy constructor creating a deep copy of every node of the input
 
list & operator= (const list &other)
list & operator= (const list &other)
 assignment operator creating a deep copy of every node of the input
 
- + - +

Private Member Functions

void delete_all_nodes ()
void delete_all_nodes ()
 calls delete operator on every node in the represented list
 
void copy_all_nodes_from_list (const list &other)
void copy_all_nodes_from_list (const list &other)
 
std::shared_ptr< link >  - + - +

@@ -172,7 +174,7 @@ Private Attributes

first
 link before the actual first element
 
std::shared_ptr< link > last
std::shared_ptr< link > last
 last link on the list
 
@@ -194,7 +196,7 @@ Private Attributes
data_structures::linked_list::list::list ())
@@ -207,12 +209,12 @@ Private Attributes

List constructor. Initializes the first and last link.

89 {
90 // Initialize the first link
-
91 first = std::make_shared<link>();
+
91 first = std::make_shared<link>();
92 // Initialize the last link with the first link
-
93 last = nullptr;
+
93 last = nullptr;
94 }
-
data_structures::linked_list::list::first
std::shared_ptr< link > first
link before the actual first element
Definition linked_list.cpp:83
-
data_structures::linked_list::list::last
std::shared_ptr< link > last
last link on the list
Definition linked_list.cpp:84
+
data_structures::linked_list::list::first
std::shared_ptr< link > first
link before the actual first element
Definition linked_list.cpp:83
+
data_structures::linked_list::list::last
std::shared_ptr< link > last
last link on the list
Definition linked_list.cpp:84
@@ -225,13 +227,13 @@ Private Attributes list::~list ( - ) + )
-
196{ delete_all_nodes(); }
-
data_structures::linked_list::list::delete_all_nodes
void delete_all_nodes()
calls delete operator on every node in the represented list
Definition reverse_a_linked_list.cpp:188
+
196{ delete_all_nodes(); }
+
data_structures::linked_list::list::delete_all_nodes
void delete_all_nodes()
calls delete operator on every node in the represented list
Definition reverse_a_linked_list.cpp:188
@@ -244,8 +246,7 @@ Private Attributes list::list ( - const list &  - other) + const list & other) @@ -269,8 +270,7 @@ Private Attributes void list::copy_all_nodes_from_list ( - const list &  - other) + const list & other) @@ -281,10 +281,10 @@ Private Attributes
198 {
-
199 assert(isEmpty());
+
199 assert(isEmpty());
200 head = copy_all_nodes(other.head);
201}
-
data_structures::linked_list::list::isEmpty
bool isEmpty()
Definition linked_list.cpp:111
+
data_structures::linked_list::list::isEmpty
bool isEmpty()
Definition linked_list.cpp:111
data_structures::linked_list::copy_all_nodes
Node * copy_all_nodes(const Node *const node)
creates a deep copy of a list starting at the input node
Definition reverse_a_linked_list.cpp:53
@@ -301,7 +301,7 @@ Private Attributes void list::delete_all_nodes ( - ) + ) @@ -333,18 +333,18 @@ Private Attributes void list::display ( - ) + )

function displays all the elements in the list

Returns
'void'
181 {
-
182 if (isEmpty()) {
+
182 if (isEmpty()) {
183 std::cout << "List is Empty!";
184 return;
185 }
-
186 std::shared_ptr<link> t = first;
+
186 std::shared_ptr<link> t = first;
187 while (t->succ() != nullptr) {
188 std::cout << t->succ()->val() << "\t";
189 t = t->succ();
@@ -369,8 +369,7 @@ Here is the call graph for this function:
void list::erase ( - int  - old_elem) + int old_elem) @@ -382,16 +381,16 @@ Here is the call graph for this function:
152 {
-
153 if (isEmpty()) {
+
153 if (isEmpty()) {
154 std::cout << "List is Empty!";
155 return;
156 }
-
157 std::shared_ptr<link> t = first;
+
157 std::shared_ptr<link> t = first;
158 std::shared_ptr<link> to_be_removed = nullptr;
-
159 while (t != last && t->succ()->val() != old_elem) {
+
159 while (t != last && t->succ()->val() != old_elem) {
160 t = t->succ();
161 }
-
162 if (t == last) {
+
162 if (t == last) {
163 std::cout << "Element not found\n";
164 return;
165 }
@@ -399,10 +398,10 @@ Here is the call graph for this function:
167 t->succ() = t->succ()->succ();
168 to_be_removed.reset();
169 if (t->succ() == nullptr) {
-
170 last = t;
+
170 last = t;
171 }
-
172 if (first == last){
-
173 last = nullptr;
+
172 if (first == last){
+
173 last = nullptr;
174 }
175}
std::shared_ptr::reset
T reset(T... args)
@@ -423,8 +422,7 @@ Here is the call graph for this function: void list::insert ( - int32_t  - n) + int32_t n) @@ -444,7 +442,7 @@ Here is the call graph for this function:
103 Node* temp = nullptr;
104 new_node->val = n;
105 new_node->next = nullptr;
-
106 if (isEmpty()) {
+
106 if (isEmpty()) {
107 head = new_node;
108 } else {
109 temp = head;
@@ -477,7 +475,7 @@ Here is the call graph for this function: bool list::isEmpty ( - ) + ) @@ -486,7 +484,7 @@ Here is the call graph for this function:
false if list is not empty
111 {
-
112 if (last == nullptr) {
+
112 if (last == nullptr) {
113 return true;
114 } else {
115 return false;
@@ -504,7 +502,7 @@ false if list is not empty bool list::isEmpty ( - ) + ) const @@ -527,8 +525,7 @@ false if the list is not empty list & list::operator= ( - const list &  - other) + const list & other) @@ -539,7 +536,7 @@ false if the list is not empty
212 if (this == &other) {
213 return *this;
214 }
-
215 delete_all_nodes();
+
215 delete_all_nodes();
216
217 copy_all_nodes_from_list(other);
218 return *this;
@@ -561,8 +558,7 @@ Here is the call graph for this function:
void list::push_back ( - int  - new_elem) + int new_elem) @@ -574,12 +570,12 @@ Here is the call graph for this function:
123 {
-
124 if (isEmpty()) {
-
125 first->succ() = std::make_shared<link>(new_elem);
-
126 last = first->succ();
+
124 if (isEmpty()) {
+
125 first->succ() = std::make_shared<link>(new_elem);
+
126 last = first->succ();
127 } else {
-
128 last->succ() = std::make_shared<link>(new_elem);
-
129 last = last->succ();
+
128 last->succ() = std::make_shared<link>(new_elem);
+
129 last = last->succ();
130 }
131}
@@ -599,8 +595,7 @@ Here is the call graph for this function:
void list::push_front ( - int  - new_elem) + int new_elem) @@ -612,13 +607,13 @@ Here is the call graph for this function:
137 {
-
138 if (isEmpty()) {
-
139 first->succ() = std::make_shared<link>(new_elem);
-
140 last = first->succ();
+
138 if (isEmpty()) {
+
139 first->succ() = std::make_shared<link>(new_elem);
+
140 last = first->succ();
141 } else {
142 std::shared_ptr<link> t = std::make_shared<link>(new_elem);
-
143 t->succ() = first->succ();
-
144 first->succ() = t;
+
143 t->succ() = first->succ();
+
144 first->succ() = t;
145 }
146}
@@ -638,7 +633,7 @@ Here is the call graph for this function:
void list::reverseList ( - ) + ) @@ -671,8 +666,7 @@ Here is the call graph for this function: std::shared_ptr< link > list::search ( - int  - find_elem) + int find_elem) @@ -685,15 +679,15 @@ Here is the call graph for this function:
197 {
-
198 if (isEmpty()) {
+
198 if (isEmpty()) {
199 std::cout << "List is Empty!";
200 return nullptr;
201 }
-
202 std::shared_ptr<link> t = first;
-
203 while (t != last && t->succ()->val() != find_elem) {
+
202 std::shared_ptr<link> t = first;
+
203 while (t != last && t->succ()->val() != find_elem) {
204 t = t->succ();
205 }
-
206 if (t == last) {
+
206 if (t == last) {
207 std::cout << "Element not found\n";
208 return nullptr;
209 }
@@ -717,7 +711,7 @@ Here is the call graph for this function:
int32_t list::top ( - ) + ) const @@ -726,7 +720,7 @@ Here is the call graph for this function:

Utility function to find the top element of the list.

Returns
the top element of the list
142 {
-
143 if (!isEmpty()) {
+
143 if (!isEmpty()) {
144 return head->val;
145 } else {
146 throw std::logic_error("List is empty");
@@ -750,8 +744,7 @@ Here is the call graph for this function:
int32_t list::traverse ( - int32_t  - index) + int32_t index) const @@ -816,7 +809,7 @@ Here is the call graph for this function: diff --git a/d1/df2/structnode-members.html b/d1/df2/structnode-members.html index 8f58e8967..0154f3607 100644 --- a/d1/df2/structnode-members.html +++ b/d1/df2/structnode-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -120,7 +122,7 @@ $(document).ready(function(){initNavTree('d5/da1/structnode.html','../../'); ini diff --git a/d1/df3/hash__search_8cpp.html b/d1/df3/hash__search_8cpp.html index 48a96160a..989d29393 100644 --- a/d1/df3/hash__search_8cpp.html +++ b/d1/df3/hash__search_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: search/hash_search.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -135,7 +137,7 @@ Macros - + @@ -144,22 +146,22 @@ typedef struct list * 

Typedefs

typedef struct list node
typedef struct list node
 
typedef struct list * link
- + - + - + - +

Functions

int h (int key)
int h (int key)
 
void create_list (int key)
void create_list (int key)
 
int hash_search (int key, int *counter)
int hash_search (int key, int *counter)
 
int main ()
int main ()
 
- + +node 

Variables

int data [MAX] = {1, 10, 15, 5, 8, 7}
int data [MAX] = {1, 10, 15, 5, 8, 7}
 test data
 
-node hashtab [HASHMAX]
hashtab [HASHMAX]
 array of nodes
 
@@ -168,7 +170,7 @@ Variables
Copyright
2020 Arctic2333

In this algorithm, we use the method of division and reservation remainder to construct the hash function, and use the method of chain address to solve the conflict, that is, we link a chain list after the data, and store all the records whose keywords are synonyms in the same linear chain list.

Warning
This program is only for educational purposes. It has serious flaws in implementation with regards to memory management resulting in large amounts of memory leaks.
-
Todo:
fix the program for memory leaks and better structure in C++ and not C fashion
+
Todo
fix the program for memory leaks and better structure in C++ and not C fashion

Typedef Documentation

◆ node

@@ -177,7 +179,7 @@ Variables
- +
typedef struct list nodetypedef struct list node
@@ -195,8 +197,7 @@ Variables void create_list ( - int  - key) + int key) @@ -208,25 +209,25 @@ Variables
Warning
dynamic memory allocated to n never gets freed.
-
Todo:
fix memory leak
+
Todo
fix memory leak
55 { // Construct hash table
56 link p, n;
57 int index;
-
58 n = (link)malloc(sizeof(node));
+
58 n = (link)malloc(sizeof(node));
59 n->key = key;
60 n->next = NULL;
-
61 index = h(key);
-
62 p = hashtab[index].next;
+
61 index = h(key);
+
62 p = hashtab[index].next;
63 if (p != NULL) {
64 n->next = p;
-
65 hashtab[index].next = n;
+
65 hashtab[index].next = n;
66 } else {
-
67 hashtab[index].next = n;
+
67 hashtab[index].next = n;
68 }
69}
-
h
int h(int key)
Definition hash_search.cpp:45
-
link
struct list * link
pointer to nodes
-
hashtab
node hashtab[HASHMAX]
array of nodes
Definition hash_search.cpp:35
+
h
int h(int key)
Definition hash_search.cpp:45
+
link
struct list * link
pointer to nodes
+
hashtab
node hashtab[HASHMAX]
array of nodes
Definition hash_search.cpp:35
std::malloc
T malloc(T... args)
node
Definition binary_search_tree.cpp:11
@@ -247,8 +248,7 @@ Here is the call graph for this function:
int h ( - int  - key) + int key) @@ -262,8 +262,8 @@ Here is the call graph for this function:
Returns
hash value for key
Examples
/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp.
-
45{ return key % HASHMAX; }
-
HASHMAX
#define HASHMAX
Determines the length of the hash table.
Definition hash_search.cpp:22
+
45{ return key % HASHMAX; }
+
HASHMAX
#define HASHMAX
Determines the length of the hash table.
Definition hash_search.cpp:22
@@ -276,19 +276,12 @@ Here is the call graph for this function: int hash_search ( - int  - key, + int key, - int *  - counter  - - - - ) - + int * counter )
@@ -300,8 +293,8 @@ Here is the call graph for this function:
78 int index;
79
80 *counter = 0;
-
81 index = h(key);
-
82 pointer = hashtab[index].next;
+
81 index = h(key);
+
82 pointer = hashtab[index].next;
83
84 std::cout << "data[" << index << "]:";
85
@@ -334,8 +327,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -347,15 +339,15 @@ Here is the call graph for this function:
102 index = 0;
103
104 // You can write the input mode here
-
105 while (index < MAX) { // Construct hash table
-
106 create_list(data[index]);
+
105 while (index < MAX) { // Construct hash table
+
106 create_list(data[index]);
107 index++;
108 }
109
-
110 for (i = 0; i < HASHMAX; i++) { // Output hash table
+
110 for (i = 0; i < HASHMAX; i++) { // Output hash table
111 std::cout << "hashtab [" << i << "]\n";
112
-
113 p = hashtab[i].next;
+
113 p = hashtab[i].next;
114
115 while (p != NULL) {
116 std::cout << "please int key:";
@@ -370,7 +362,7 @@ Here is the call graph for this function:
125 // You can write the input mode here
126 // test key = 10
127 key = 10;
-
128 if (hash_search(key, &counter))
+
128 if (hash_search(key, &counter))
129 std::cout << "search time = " << counter << std::endl;
130 else
131 std::cout << "no found!\n";
@@ -383,10 +375,10 @@ Here is the call graph for this function:
138 return 0;
139}
std::endl
T endl(T... args)
-
hash_search
int hash_search(int key, int *counter)
Definition hash_search.cpp:76
-
MAX
#define MAX
Determines how much data.
Definition hash_search.cpp:21
-
data
int data[MAX]
test data
Definition hash_search.cpp:24
-
create_list
void create_list(int key)
Definition hash_search.cpp:55
+
hash_search
int hash_search(int key, int *counter)
Definition hash_search.cpp:76
+
MAX
#define MAX
Determines how much data.
Definition hash_search.cpp:21
+
data
int data[MAX]
test data
Definition hash_search.cpp:24
+
create_list
void create_list(int key)
Definition hash_search.cpp:55
Here is the call graph for this function:
@@ -419,7 +411,7 @@ Here is the call graph for this function:
diff --git a/d1/df6/class_easter_year_month_day.html b/d1/df6/class_easter_year_month_day.html index b415f28ae..7a7a061b1 100644 --- a/d1/df6/class_easter_year_month_day.html +++ b/d1/df6/class_easter_year_month_day.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: EasterYearMonthDay Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -106,11 +108,11 @@ $(document).ready(function(){initNavTree('d1/df6/class_easter_year_month_day.htm

for IO operations - More...

+ More...

- +

Public Member Functions

 EasterYearMonthDay (uint64_t newYear, uint64_t newMonth, uint64_t newDay)
 EasterYearMonthDay (uint64_t newYear, uint64_t newMonth, uint64_t newDay)
 
- - + - - + - - - - - - - +

@@ -144,25 +146,17 @@ uint64_t 

day
EasterYearMonthDay::EasterYearMonthDay (uint64_t newYear, uint64_t newYear,
uint64_t newMonth, uint64_t newMonth,
uint64_t newDay 
)uint64_t newDay )
@@ -172,13 +166,13 @@ uint64_t day
32 {
-
33 year = newYear; // Assigns year to class
-
34 month = newMonth;
-
35 day = newDay;
+
33 year = newYear; // Assigns year to class
+
34 month = newMonth;
+
35 day = newDay;
36 }
-
EasterYearMonthDay::month
uint64_t month
month Easter is on
Definition easter.cpp:29
-
EasterYearMonthDay::year
uint64_t year
year Easter is on
Definition easter.cpp:28
-
EasterYearMonthDay::day
uint64_t day
day Easter is on
Definition easter.cpp:30
+
EasterYearMonthDay::month
uint64_t month
month Easter is on
Definition easter.cpp:29
+
EasterYearMonthDay::year
uint64_t year
year Easter is on
Definition easter.cpp:28
+
EasterYearMonthDay::day
uint64_t day
day Easter is on
Definition easter.cpp:30
@@ -191,7 +185,7 @@ uint64_t day diff --git a/d2/d05/class_min_heap.html b/d2/d05/class_min_heap.html index 8c47ad9ea..e704881fb 100644 --- a/d2/d05/class_min_heap.html +++ b/d2/d05/class_min_heap.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: MinHeap Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -107,25 +109,25 @@ $(document).ready(function(){initNavTree('d2/d05/class_min_heap.html','../../'); - + - + - + - + - + - + - + - + - + - +

Public Member Functions

 MinHeap (int cap)
 MinHeap (int cap)
 
void MinHeapify (int)
void MinHeapify (int)
 
int parent (int i)
int parent (int i)
 
int left (int i)
int left (int i)
 
int right (int i)
int right (int i)
 
int extractMin ()
int extractMin ()
 
void decreaseKey (int i, int new_val)
void decreaseKey (int i, int new_val)
 
int getMin ()
int getMin ()
 
void deleteKey (int i)
void deleteKey (int i)
 
void insertKey (int k)
void insertKey (int k)
 
- - +

@@ -158,8 +160,7 @@ int 

heap_size
MinHeap::MinHeap (int cap)int cap)
@@ -176,13 +177,13 @@ int heap_size
19 {
-
20 heap_size = 0;
-
21 capacity = cap;
-
22 harr = new int[cap];
+
20 heap_size = 0;
+
21 capacity = cap;
+
22 harr = new int[cap];
23 }
-
MinHeap::harr
int * harr
pointer to array of elements in heap
Definition binaryheap.cpp:11
-
MinHeap::capacity
int capacity
maximum possible size of min heap
Definition binaryheap.cpp:12
-
MinHeap::heap_size
int heap_size
Current number of elements in min heap.
Definition binaryheap.cpp:13
+
MinHeap::harr
int * harr
pointer to array of elements in heap
Definition binaryheap.cpp:11
+
MinHeap::capacity
int capacity
maximum possible size of min heap
Definition binaryheap.cpp:12
+
MinHeap::heap_size
int heap_size
Current number of elements in min heap.
Definition binaryheap.cpp:13
@@ -198,7 +199,7 @@ int heap_size MinHeap::~MinHeap ( - ) + ) @@ -208,7 +209,7 @@ int heap_size
-
51{ delete[] harr; }
+
51{ delete[] harr; }
@@ -222,28 +223,21 @@ int heap_size void MinHeap::decreaseKey ( - int  - i, + int i, - int  - new_val  - - - - ) - + int new_val )

Decreases key value of key at index i to new_val

Decreases value of key at index 'i' to new_val. It is assumed that new_val is smaller than harr[i].

76 {
-
77 harr[i] = new_val;
-
78 while (i != 0 && harr[parent(i)] > harr[i]) {
-
79 std::swap(harr[i], harr[parent(i)]);
+
77 harr[i] = new_val;
+
78 while (i != 0 && harr[parent(i)] > harr[i]) {
+
79 std::swap(harr[i], harr[parent(i)]);
80 i = parent(i);
81 }
82}
@@ -265,20 +259,19 @@ Here is the call graph for this function:
void MinHeap::deleteKey ( - int  - i) + int i)

Deletes a key stored at index i

-

This function deletes key at index i. It first reduced value to minus infinite, then calls extractMin()

+

This function deletes key at index i. It first reduced value to minus infinite, then calls extractMin()

105 {
-
106 decreaseKey(i, INT_MIN);
-
107 extractMin();
+
106 decreaseKey(i, INT_MIN);
+
107 extractMin();
108}
-
MinHeap::extractMin
int extractMin()
Definition binaryheap.cpp:85
-
MinHeap::decreaseKey
void decreaseKey(int i, int new_val)
Definition binaryheap.cpp:76
+
MinHeap::extractMin
int extractMin()
Definition binaryheap.cpp:85
+
MinHeap::decreaseKey
void decreaseKey(int i, int new_val)
Definition binaryheap.cpp:76
Here is the call graph for this function:
@@ -296,29 +289,29 @@ Here is the call graph for this function:
int MinHeap::extractMin ( - ) + )

to extract the root which is the minimum element

85 {
-
86 if (heap_size <= 0)
+
86 if (heap_size <= 0)
87 return INT_MAX;
-
88 if (heap_size == 1) {
-
89 heap_size--;
-
90 return harr[0];
+
88 if (heap_size == 1) {
+
89 heap_size--;
+
90 return harr[0];
91 }
92
93 // Store the minimum value, and remove it from heap
-
94 int root = harr[0];
-
95 harr[0] = harr[heap_size - 1];
-
96 heap_size--;
-
97 MinHeapify(0);
+
94 int root = harr[0];
+
95 harr[0] = harr[heap_size - 1];
+
96 heap_size--;
+
97 MinHeapify(0);
98
99 return root;
100}
-
MinHeap::MinHeapify
void MinHeapify(int)
Definition binaryheap.cpp:113
+
MinHeap::MinHeapify
void MinHeapify(int)
Definition binaryheap.cpp:113
Here is the call graph for this function:
@@ -339,7 +332,7 @@ Here is the call graph for this function:
int MinHeap::getMin ( - ) + ) @@ -350,7 +343,7 @@ Here is the call graph for this function:

Returns the minimum key (key at root) from min heap

-
43{ return harr[0]; }
+
43{ return harr[0]; }
@@ -363,27 +356,26 @@ Here is the call graph for this function: void MinHeap::insertKey ( - int  - k) + int k)

Inserts a new key 'k'

55 {
-
56 if (heap_size == capacity) {
+
56 if (heap_size == capacity) {
57 std::cout << "\nOverflow: Could not insertKey\n";
58 return;
59 }
60
61 // First insert the new key at the end
-
62 heap_size++;
-
63 int i = heap_size - 1;
-
64 harr[i] = k;
+
62 heap_size++;
+
63 int i = heap_size - 1;
+
64 harr[i] = k;
65
66 // Fix the min heap property if it is violated
-
67 while (i != 0 && harr[parent(i)] > harr[i]) {
-
68 std::swap(harr[i], harr[parent(i)]);
+
67 while (i != 0 && harr[parent(i)] > harr[i]) {
+
68 std::swap(harr[i], harr[parent(i)]);
69 i = parent(i);
70 }
71}
@@ -409,8 +401,7 @@ Here is the call graph for this function:
int MinHeap::left ( - int  - i) + int i) @@ -434,8 +425,7 @@ Here is the call graph for this function:
void MinHeap::MinHeapify ( - int  - i) + int i) @@ -443,20 +433,20 @@ Here is the call graph for this function:

to heapify a subtree with the root at given index

A recursive method to heapify a subtree with the root at given index This method assumes that the subtrees are already heapified

113 {
-
114 int l = left(i);
-
115 int r = right(i);
+
114 int l = left(i);
+
115 int r = right(i);
116 int smallest = i;
-
117 if (l < heap_size && harr[l] < harr[i])
+
117 if (l < heap_size && harr[l] < harr[i])
118 smallest = l;
-
119 if (r < heap_size && harr[r] < harr[smallest])
+
119 if (r < heap_size && harr[r] < harr[smallest])
120 smallest = r;
121 if (smallest != i) {
-
122 std::swap(harr[i], harr[smallest]);
-
123 MinHeapify(smallest);
+
122 std::swap(harr[i], harr[smallest]);
+
123 MinHeapify(smallest);
124 }
125}
-
MinHeap::left
int left(int i)
Definition binaryheap.cpp:31
-
MinHeap::right
int right(int i)
Definition binaryheap.cpp:34
+
MinHeap::left
int left(int i)
Definition binaryheap.cpp:31
+
MinHeap::right
int right(int i)
Definition binaryheap.cpp:34
numerical_methods::simpson_method::l
double l(double x)
Another test function.
Definition composite_simpson_rule.cpp:119
Here is the call graph for this function:
@@ -478,8 +468,7 @@ Here is the call graph for this function: int MinHeap::parent ( - int  - i) + int i) @@ -505,8 +494,7 @@ Here is the call graph for this function: int MinHeap::right ( - int  - i) + int i) @@ -530,7 +518,7 @@ Here is the call graph for this function: diff --git a/d2/d0b/fast__power_8cpp.html b/d2/d0b/fast__power_8cpp.html index 4183e3423..2a98d325f 100644 --- a/d2/d0b/fast__power_8cpp.html +++ b/d2/d0b/fast__power_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/fast_power.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -120,12 +122,12 @@ Include dependency graph for fast_power.cpp:

Functions

template<typename T > -double fast_power_recursive (T a, T b) +double fast_power_recursive (T a, T b)   template<typename T > -double fast_power_linear (T a, T b) +double fast_power_linear (T a, T b)   -int main () +int main ()  

Detailed Description

@@ -148,19 +150,12 @@ template<typename T > double fast_power_linear ( - T  - a, + T a, - T  - b  - - - - ) - + T b )
@@ -168,7 +163,7 @@ template<typename T >
50 {
51 // negative power. a^b = 1 / (a^-b)
52 if (b < 0)
-
53 return 1.0 / fast_power_linear(a, -b);
+
53 return 1.0 / fast_power_linear(a, -b);
54
55 double result = 1;
56 while (b) {
@@ -179,7 +174,7 @@ template<typename T >
61 }
62 return result;
63}
-
fast_power_linear
double fast_power_linear(T a, T b)
Definition fast_power.cpp:50
+
fast_power_linear
double fast_power_linear(T a, T b)
Definition fast_power.cpp:50
math::fibonacci_sum::result
uint64_t result(uint64_t n)
Definition fibonacci_sum.cpp:76
Here is the call graph for this function:
@@ -200,19 +195,12 @@ template<typename T > double fast_power_recursive ( - T  - a, + T a, - T  - b  - - - - ) - + T b )
@@ -220,11 +208,11 @@ template<typename T >
26 {
27 // negative power. a^b = 1 / (a^-b)
28 if (b < 0)
-
29 return 1.0 / fast_power_recursive(a, -b);
+
29 return 1.0 / fast_power_recursive(a, -b);
30
31 if (b == 0)
32 return 1;
-
33 T bottom = fast_power_recursive(a, b >> 1);
+
33 T bottom = fast_power_recursive(a, b >> 1);
34 // Since it is integer division b/2 = (b-1)/2 where b is odd.
35 // Therefore, case2 is easily solved by integer division.
36
@@ -235,7 +223,7 @@ template<typename T >
41 result = bottom * bottom * a;
42 return result;
43}
-
fast_power_recursive
double fast_power_recursive(T a, T b)
Definition fast_power.cpp:26
+
fast_power_recursive
double fast_power_recursive(T a, T b)
Definition fast_power.cpp:26
Here is the call graph for this function:
@@ -253,8 +241,7 @@ Here is the call graph for this function:
int main ( - void  - ) + void ) @@ -269,20 +256,20 @@ Here is the call graph for this function:
74 int a = std::rand() % 20 - 10;
75 int b = std::rand() % 20 - 10;
76 std::cout << std::endl << "Calculating " << a << "^" << b << std::endl;
-
77 assert(fast_power_recursive(a, b) == std::pow(a, b));
-
78 assert(fast_power_linear(a, b) == std::pow(a, b));
+
77 assert(fast_power_recursive(a, b) == std::pow(a, b));
+
78 assert(fast_power_linear(a, b) == std::pow(a, b));
79
80 std::cout << "------ " << a << "^" << b << " = "
-
81 << fast_power_recursive(a, b) << std::endl;
+
81 << fast_power_recursive(a, b) << std::endl;
82 }
83
84 int64_t a, b;
85 std::cin >> a >> b;
86
-
87 std::cout << a << "^" << b << " = " << fast_power_recursive(a, b)
+
87 std::cout << a << "^" << b << " = " << fast_power_recursive(a, b)
88 << std::endl;
89
-
90 std::cout << a << "^" << b << " = " << fast_power_linear(a, b) << std::endl;
+
90 std::cout << a << "^" << b << " = " << fast_power_linear(a, b) << std::endl;
91
92 return 0;
93}
@@ -308,7 +295,7 @@ Here is the call graph for this function: diff --git a/d2/d21/gnome__sort_8cpp.html b/d2/d21/gnome__sort_8cpp.html index 55ef83a90..be6a9d6f7 100644 --- a/d2/d21/gnome__sort_8cpp.html +++ b/d2/d21/gnome__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/gnome_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -130,9 +132,9 @@ Functions template<typename T , size_t size> std::array< T, size > sorting::gnomeSort (std::array< T, size > arr)   -static void test () +static void test ()   -int main () +int main ()  

Detailed Description

@@ -152,18 +154,17 @@ Functions int main ( - void  - ) + void )

Our main function with example of sort method.

130 {
-
131 test();
+
131 test();
132 return 0;
133}
-
test
static void test()
Definition gnome_sort.cpp:85
+
test
static void test()
Definition gnome_sort.cpp:85
Here is the call graph for this function:
@@ -184,7 +185,7 @@ Here is the call graph for this function:
static void test ( - ) + ) @@ -259,7 +260,7 @@ Here is the call graph for this function:
diff --git a/d2/d22/jump__search_8cpp.html b/d2/d22/jump__search_8cpp.html index fdf1b3b45..159068f49 100644 --- a/d2/d22/jump__search_8cpp.html +++ b/d2/d22/jump__search_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: search/jump_search.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -116,9 +118,9 @@ Include dependency graph for jump_search.cpp:
- + - +

Functions

int jumpSearch (int arr[], int x, int n)
int jumpSearch (int arr[], int x, int n)
 
int main ()
int main ()
 

Detailed Description

@@ -133,25 +135,17 @@ Functions int jumpSearch ( - int  - arr[], + int arr[], - int  - x, + int x, - int  - n  - - - - ) - + int n )
@@ -206,8 +200,7 @@ Here is the call graph for this function:
int main ( - void  - ) + void ) @@ -218,14 +211,14 @@ Here is the call graph for this function:
47 int n = sizeof(arr) / sizeof(arr[0]);
48
49 // Find the index of 'x' using Jump Search
-
50 int index = jumpSearch(arr, x, n);
+
50 int index = jumpSearch(arr, x, n);
51
52 // Print the index where 'x' is located
53 std::cout << "\nNumber " << x << " is at index " << index;
54 return 0;
55}
-
jumpSearch
int jumpSearch(int arr[], int x, int n)
Definition jump_search.cpp:12
+
jumpSearch
int jumpSearch(int arr[], int x, int n)
Definition jump_search.cpp:12
@@ -235,7 +228,7 @@ Here is the call graph for this function: diff --git a/d2/d26/count__inversions_8cpp.html b/d2/d26/count__inversions_8cpp.html index 40b78b08f..648b3be8d 100644 --- a/d2/d26/count__inversions_8cpp.html +++ b/d2/d26/count__inversions_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/count_inversions.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -128,25 +130,25 @@ Namespaces

Functions

template<typename T > -uint32_t sorting::inversion::merge (T *arr, T *temp, uint32_t left, uint32_t mid, uint32_t right) +uint32_t sorting::inversion::merge (T *arr, T *temp, uint32_t left, uint32_t mid, uint32_t right)  Function to merge two sub-arrays.
  template<typename T > -uint32_t sorting::inversion::mergeSort (T *arr, T *temp, uint32_t left, uint32_t right) +uint32_t sorting::inversion::mergeSort (T *arr, T *temp, uint32_t left, uint32_t right)  Implement merge Sort and count inverions while merging.
  template<class T > -uint32_t sorting::inversion::countInversion (T *arr, const uint32_t size) - Function countInversion() returns the number of inversion present in the input array. Inversions are an estimate of how close or far off the array is to being sorted.
+uint32_t sorting::inversion::countInversion (T *arr, const uint32_t size) + Function countInversion() returns the number of inversion present in the input array. Inversions are an estimate of how close or far off the array is to being sorted.
  template<typename T > -void sorting::inversion::show (T *arr, const uint32_t array_size) +void sorting::inversion::show (T *arr, const uint32_t array_size)  UTILITY function to print array.
  -static void test () +static void test ()  Test implementations.
  -int main () +int main ()  Main function.
  @@ -179,19 +181,12 @@ template<class T >
uint32_t sorting::inversion::countInversion ( - T *  - arr, + T * arr, - const uint32_t  - size  - - - - ) - + const uint32_t size )
@@ -234,8 +229,7 @@ Here is the call graph for this function:
int main ( - void  - ) + void ) @@ -244,11 +238,11 @@ Here is the call graph for this function:

Main function.

Returns
0 on exit
271 {
-
272 test(); // Run test implementations
+
272 test(); // Run test implementations
273 // body(); // test your own array
274 return 0;
275}
-
test
static void test()
Test implementations.
Definition count_inversions.cpp:194
+
test
static void test()
Test implementations.
Definition count_inversions.cpp:194
Here is the call graph for this function:
@@ -268,37 +262,27 @@ template<typename T >
uint32_t sorting::inversion::merge ( - T *  - arr, + T * arr, - T *  - temp, + T * temp, - uint32_t  - left, + uint32_t left, - uint32_t  - mid, + uint32_t mid, - uint32_t  - right  - - - - ) - + uint32_t right )
@@ -341,12 +325,13 @@ template<typename T >
106 temp[k++] = arr[j++];
107 }
108 // Copy temp[] to arr[]
-
109 for (k = left; k <= right; k++) {
+
109 for (k = left; k <= right; k++) {
110 arr[k] = temp[k];
111 }
112 return inv_count;
113}
numerical_methods::simpson_method::k
double k(double x)
Another test function.
Definition composite_simpson_rule.cpp:117
+
std::right
T right(T... args)
@@ -361,31 +346,22 @@ template<typename T > uint32_t sorting::inversion::mergeSort ( - T *  - arr, + T * arr, - T *  - temp, + T * temp, - uint32_t  - left, + uint32_t left, - uint32_t  - right  - - - - ) - + uint32_t right )
@@ -406,7 +382,7 @@ template<typename T >
133 uint32_t mid = 0, inv_count = 0;
134 if (right > left) {
135 // midpoint to split the array
-
136 mid = (right + left) / 2;
+
136 mid = (right + left) / 2;
137 // Add inversions in left and right sub-arrays
138 inv_count += mergeSort(arr, temp, left, mid); // left sub-array
139 inv_count += mergeSort(arr, temp, mid + 1, right);
@@ -436,19 +412,12 @@ template<typename T > void sorting::inversion::show ( - T *  - arr, + T * arr, - const uint32_t  - array_size  - - - - ) - + const uint32_t array_size )
@@ -485,7 +454,7 @@ template<typename T >
static void test ( - ) + ) @@ -509,29 +478,29 @@ template<typename T >
202 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
203 uint32_t size1 = arr1.size();
204 uint32_t inv_count1 = 4950;
-
205 uint32_t result1 = sorting::inversion::countInversion(arr1.data(), size1);
+
205 uint32_t result1 = sorting::inversion::countInversion(arr1.data(), size1);
206 assert(inv_count1 == result1);
207 // Test 2
208 std::vector<int> arr2 = {22, 66, 75, 23, 11, 87, 2, 44, 98, 43};
209 uint32_t size2 = arr2.size();
210 uint32_t inv_count2 = 20;
-
211 uint32_t result2 = sorting::inversion::countInversion(arr2.data(), size2);
+
211 uint32_t result2 = sorting::inversion::countInversion(arr2.data(), size2);
212 assert(inv_count2 == result2);
213 // Test 3
214 std::vector<double> arr3 = {33.1, 45.2, 65.4, 76.5, 1.0,
215 2.9, 5.4, 7.7, 88.9, 12.4};
216 uint32_t size3 = arr3.size();
217 uint32_t inv_count3 = 21;
-
218 uint32_t result3 = sorting::inversion::countInversion(arr3.data(), size3);
+
218 uint32_t result3 = sorting::inversion::countInversion(arr3.data(), size3);
219 assert(inv_count3 == result3);
220 // Test 4
221 std::vector<char> arr4 = {'a', 'b', 'c', 'd', 'e'};
222 uint32_t size4 = arr4.size();
223 uint32_t inv_count4 = 0;
-
224 uint32_t result4 = sorting::inversion::countInversion(arr4.data(), size4);
+
224 uint32_t result4 = sorting::inversion::countInversion(arr4.data(), size4);
225 assert(inv_count4 == result4);
226}
-
sorting::inversion::countInversion
uint32_t countInversion(T *arr, const uint32_t size)
Function countInversion() returns the number of inversion present in the input array....
Definition count_inversions.cpp:164
+
sorting::inversion::countInversion
uint32_t countInversion(T *arr, const uint32_t size)
Function countInversion() returns the number of inversion present in the input array....
Definition count_inversions.cpp:164
std::vector::size
T size(T... args)
Here is the call graph for this function:
@@ -547,7 +516,7 @@ Here is the call graph for this function: diff --git a/d2/d2c/structtower.html b/d2/d2c/structtower.html index 3bfdbf74c..9e0ee0347 100644 --- a/d2/d2c/structtower.html +++ b/d2/d2c/structtower.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: tower Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -126,7 +128,7 @@ int top diff --git a/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html b/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html index 5cfa7601d..0175d227d 100644 --- a/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html +++ b/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -110,7 +112,7 @@ $(document).ready(function(){initNavTree('d9/d5a/structgeometry_1_1jarvis_1_1_po diff --git a/d2/d3b/namespaceqr__algorithm.html b/d2/d3b/namespaceqr__algorithm.html index fbc7311a3..5c8fd149c 100644 --- a/d2/d3b/namespaceqr__algorithm.html +++ b/d2/d3b/namespaceqr__algorithm.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: qr_algorithm Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -104,29 +106,29 @@ $(document).ready(function(){initNavTree('d2/d3b/namespaceqr__algorithm.html','.

Functions to compute QR decomposition of any rectangular matrix. -More...

+More...

- + - + - + - + - + - + - +

Functions

template<typename T >
std::ostream & operator<< (std::ostream &out, std::valarray< std::valarray< T > > const &v)
std::ostream & operator<< (std::ostream &out, std::valarray< std::valarray< T > > const &v)
 
template<typename T >
std::ostream & operator<< (std::ostream &out, std::valarray< T > const &v)
std::ostream & operator<< (std::ostream &out, std::valarray< T > const &v)
 
template<typename T >
double vector_dot (const std::valarray< T > &a, const std::valarray< T > &b)
double vector_dot (const std::valarray< T > &a, const std::valarray< T > &b)
 
template<typename T >
double vector_mag (const std::valarray< T > &a)
double vector_mag (const std::valarray< T > &a)
 
template<typename T >
std::valarray< T > vector_proj (const std::valarray< T > &a, const std::valarray< T > &b)
std::valarray< T > vector_proj (const std::valarray< T > &a, const std::valarray< T > &b)
 
template<typename T >
void qr_decompose (const std::valarray< std::valarray< T > > &A, std::valarray< std::valarray< T > > *Q, std::valarray< std::valarray< T > > *R)
void qr_decompose (const std::valarray< std::valarray< T > > &A, std::valarray< std::valarray< T > > *Q, std::valarray< std::valarray< T > > *R)
 
std::valarray< double > eigen_values (std::valarray< std::valarray< double > > *A, bool print_intermediates=false)
std::valarray< double > eigen_values (std::valarray< std::valarray< double > > *A, bool print_intermediates=false)
 

Detailed Description

@@ -141,19 +143,12 @@ Functions std::valarray< double > qr_algorithm::eigen_values ( - std::valarray< std::valarray< double > > *  - A, + std::valarray< std::valarray< double > > * A, - bool  - print_intermediates = false  - - - - ) - + bool print_intermediates = false )
@@ -210,7 +205,7 @@ Functions
123 A[0][i][i] -= last_eig; /* A - cI */
124 }
125
-
126 qr_decompose(*A, &Q, &R);
+
126 qr_decompose(*A, &Q, &R);
127
128 if (print_intermediates) {
129 std::cout << *A << "\n";
@@ -252,14 +247,13 @@ Functions
165}
std::printf
T printf(T... args)
-
qr_algorithm::qr_decompose
void qr_decompose(const std::valarray< std::valarray< T > > &A, std::valarray< std::valarray< T > > *Q, std::valarray< std::valarray< T > > *R)
Definition qr_decompose.h:146
mat_mul
void mat_mul(const std::valarray< std::valarray< double > > &A, const std::valarray< std::valarray< double > > &B, std::valarray< std::valarray< double > > *OUT)
Definition qr_eigen_values.cpp:54
Here is the call graph for this function:
-
+
@@ -275,19 +269,12 @@ template<typename T > std::ostream & qr_algorithm::operator<< ( - std::ostream &  - out, + std::ostream & out, - std::valarray< std::valarray< T > > const &  - v  - - - - ) - + std::valarray< std::valarray< T > > const & v )
@@ -314,7 +301,7 @@ template<typename T >
Here is the call graph for this function:
-
+
@@ -330,19 +317,12 @@ template<typename T > std::ostream & qr_algorithm::operator<< ( - std::ostream &  - out, + std::ostream & out, - std::valarray< T > const &  - v  - - - - ) - + std::valarray< T > const & v )
@@ -362,7 +342,7 @@ template<typename T >
Here is the call graph for this function:
-
+
@@ -378,25 +358,17 @@ template<typename T > void qr_algorithm::qr_decompose ( - const std::valarray< std::valarray< T > > &  - A, + const std::valarray< std::valarray< T > > & A, - std::valarray< std::valarray< T > > *  - Q, + std::valarray< std::valarray< T > > * Q, - std::valarray< std::valarray< T > > *  - R  - - - - ) - + std::valarray< std::valarray< T > > * R )
@@ -456,11 +428,11 @@ template<typename T >
172 for (int k = 0; k < ROWS; k++) {
173 col_vector2[k] = Q[0][k][j];
174 }
-
175 col_vector2 = vector_proj(col_vector, col_vector2);
+
175 col_vector2 = vector_proj(col_vector, col_vector2);
176 tmp_vector -= col_vector2;
177 }
178
-
179 double mag = vector_mag(tmp_vector);
+
179 double mag = vector_mag(tmp_vector);
180
181#ifdef _OPENMP
182// parallelize on threads
@@ -491,8 +463,8 @@ template<typename T >
207}
numerical_methods::simpson_method::k
double k(double x)
Another test function.
Definition composite_simpson_rule.cpp:117
machine_learning::sum
T sum(const std::vector< std::valarray< T > > &A)
Definition vector_ops.hpp:232
-
qr_algorithm::vector_proj
std::valarray< T > vector_proj(const std::valarray< T > &a, const std::valarray< T > &b)
Definition qr_decompose.h:104
-
qr_algorithm::vector_mag
double vector_mag(const std::valarray< T > &a)
Definition qr_decompose.h:92
+
qr_algorithm::vector_proj
std::valarray< T > vector_proj(const std::valarray< T > &a, const std::valarray< T > &b)
Definition qr_decompose.h:104
+
qr_algorithm::vector_mag
double vector_mag(const std::valarray< T > &a)
Definition qr_decompose.h:92
math::vector_cross::mag
double mag(const std::array< double, 3 > &vec)
Calculates the magnitude of the mathematical vector from it's direction ratios.
Definition vector_cross_product.cpp:83
@@ -517,19 +489,12 @@ template<typename T >
double qr_algorithm::vector_dot ( - const std::valarray< T > &  - a, + const std::valarray< T > & a, - const std::valarray< T > &  - b  - - - - ) - + const std::valarray< T > & b ) @@ -564,8 +529,7 @@ template<typename T > double qr_algorithm::vector_mag ( - const std::valarray< T > &  - a) + const std::valarray< T > & a) @@ -579,10 +543,10 @@ template<typename T >

If \(\vec{a}=\left[a_0,a_1,a_2,...,a_L\right]\) then \(\left|\vec{a}\right|=\sqrt{\displaystyle\sum_{i=0}^L a_i^2}\)

Returns
\(\left|\vec{a}\right|\)
92 {
-
93 double dot = vector_dot(a, a);
+
93 double dot = vector_dot(a, a);
94 return std::sqrt(dot);
95}
-
qr_algorithm::vector_dot
double vector_dot(const std::valarray< T > &a, const std::valarray< T > &b)
Definition qr_decompose.h:76
+
qr_algorithm::vector_dot
double vector_dot(const std::valarray< T > &a, const std::valarray< T > &b)
Definition qr_decompose.h:76
std::sqrt
T sqrt(T... args)
Here is the call graph for this function:
@@ -603,19 +567,12 @@ template<typename T > std::valarray< T > qr_algorithm::vector_proj ( - const std::valarray< T > &  - a, + const std::valarray< T > & a, - const std::valarray< T > &  - b  - - - - ) - + const std::valarray< T > & b )
@@ -625,8 +582,8 @@ template<typename T >
Returns
NULL if error, otherwise pointer to output

check for division by zero using machine epsilon

105 {
-
106 double num = vector_dot(a, b);
-
107 double deno = vector_dot(b, b);
+
106 double num = vector_dot(a, b);
+
107 double deno = vector_dot(b, b);
108
109 /*! check for division by zero using machine epsilon */
110 if (deno <= std::numeric_limits<double>::epsilon()) {
@@ -652,7 +609,7 @@ Here is the call graph for this function:
diff --git a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.map b/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.map index 67c5def62..88b4690df 100644 --- a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.map +++ b/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.map @@ -1,19 +1,11 @@ - - - - - - - - - - - - - - - - - + + + + + + + + + diff --git a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.md5 index 5d1449a38..d9892e55d 100644 --- a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.md5 +++ b/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.md5 @@ -1 +1 @@ -c0a5251fd854dc039dab4704747e5311 \ No newline at end of file +23e4e78cf3f136e0ea4329cf6536e0d7 \ No newline at end of file diff --git a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.svg b/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.svg index 985136003..935eff778 100644 --- a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.svg +++ b/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.svg @@ -4,8 +4,8 @@ - + - + qr_algorithm::operator<< Node1 - -qr_algorithm::operator<< + +qr_algorithm::operator<< Node2 - - -operator<< + + +std::ostream::precision @@ -40,134 +40,62 @@ Node1->Node2 - - - - - - - -Node4 - - -std::left - - - - - -Node1->Node4 - - - - - - - - -Node5 - - -std::setfill - - - - - -Node1->Node5 - - - - - - - - -Node6 - - -std::setw - - - - - -Node1->Node6 - - - - - - - - -Node7 - - -std::ostream::precision - - - - - -Node1->Node7 - - - - - - - - -Node2->Node2 - - - + + Node3 - - -std::endl + + +std::right - - -Node2->Node3 - - - + + +Node1->Node3 + + + - - -Node2->Node4 - - - + + +Node4 + + +std::setfill - - -Node2->Node5 - - - + + +Node1->Node4 + + + - - -Node2->Node6 - - - + + +Node5 + + +std::setw + + + + + +Node1->Node5 + + + diff --git a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph_org.svg b/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph_org.svg index a787c5eea..f8e923827 100644 --- a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph_org.svg +++ b/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph_org.svg @@ -4,25 +4,25 @@ - - + + qr_algorithm::operator<< Node1 - -qr_algorithm::operator<< + +qr_algorithm::operator<< Node2 - - -operator<< + + +std::ostream::precision @@ -30,134 +30,62 @@ Node1->Node2 - - - - - - - -Node4 - - -std::left - - - - - -Node1->Node4 - - - - - - - - -Node5 - - -std::setfill - - - - - -Node1->Node5 - - - - - - - - -Node6 - - -std::setw - - - - - -Node1->Node6 - - - - - - - - -Node7 - - -std::ostream::precision - - - - - -Node1->Node7 - - - - - - - - -Node2->Node2 - - - + + Node3 - - -std::endl + + +std::right - - -Node2->Node3 - - - + + +Node1->Node3 + + + - - -Node2->Node4 - - - + + +Node4 + + +std::setfill - - -Node2->Node5 - - - + + +Node1->Node4 + + + - - -Node2->Node6 - - - + + +Node5 + + +std::setw + + + + + +Node1->Node5 + + + diff --git a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.map b/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.map index 55af80a9a..727a19451 100644 --- a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.map +++ b/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.map @@ -1,17 +1,16 @@ - + - - - - - - - - - - - - - + + + + + + + + + + + + diff --git a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.md5 index 2c867732d..34100262b 100644 --- a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.md5 +++ b/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.md5 @@ -1 +1 @@ -8c1a705996301e438608783bdd815d9c \ No newline at end of file +835c4d7ef55d24567988a9cb0e874083 \ No newline at end of file diff --git a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.svg b/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.svg index ab5d18b7a..165c0b211 100644 --- a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.svg +++ b/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.svg @@ -4,7 +4,7 @@ - + - + qr_algorithm::operator<< Node1 - -qr_algorithm::operator<< + +qr_algorithm::operator<< @@ -31,8 +31,8 @@ Node2 - -std::endl + +std::endl @@ -40,17 +40,17 @@ Node1->Node2 - - + + Node3 - - -operator<< + + +std::ostream::precision @@ -58,8 +58,8 @@ Node1->Node3 - - + + @@ -67,17 +67,17 @@ Node4 - -std::left + +std::right - + Node1->Node4 - - - + + + @@ -85,17 +85,17 @@ Node5 - -std::setfill + +std::setfill - + Node1->Node5 - - - + + + @@ -103,80 +103,17 @@ Node6 - -std::setw + +std::setw - + Node1->Node6 - - - - - - - - -Node7 - - -std::ostream::precision - - - - - -Node1->Node7 - - - - - - - - -Node3->Node2 - - - - - - - - -Node3->Node3 - - - - - - - - -Node3->Node4 - - - - - - - - -Node3->Node5 - - - - - - - - -Node3->Node6 - - - + + + diff --git a/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph_org.svg b/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph_org.svg index 2de045749..2574e8e80 100644 --- a/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph_org.svg +++ b/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + qr_algorithm::operator<< Node1 - -qr_algorithm::operator<< + +qr_algorithm::operator<< @@ -21,8 +21,8 @@ Node2 - -std::endl + +std::endl @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node3 - - -operator<< + + +std::ostream::precision @@ -48,8 +48,8 @@ Node1->Node3 - - + + @@ -57,17 +57,17 @@ Node4 - -std::left + +std::right - + Node1->Node4 - - - + + + @@ -75,17 +75,17 @@ Node5 - -std::setfill + +std::setfill - + Node1->Node5 - - - + + + @@ -93,80 +93,17 @@ Node6 - -std::setw + +std::setw - + Node1->Node6 - - - - - - - - -Node7 - - -std::ostream::precision - - - - - -Node1->Node7 - - - - - - - - -Node3->Node2 - - - - - - - - -Node3->Node3 - - - - - - - - -Node3->Node4 - - - - - - - - -Node3->Node5 - - - - - - - - -Node3->Node6 - - - + + + diff --git a/d2/d45/segtree_8cpp.html b/d2/d45/segtree_8cpp.html index 34aaf85b0..2e297caf1 100644 --- a/d2/d45/segtree_8cpp.html +++ b/d2/d45/segtree_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: range_queries/segtree.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -117,19 +119,19 @@ Include dependency graph for segtree.cpp:
- + - + - + - + - +

Functions

void ConsTree (const std::vector< int64_t > &arr, std::vector< int64_t > *segtree, uint64_t low, uint64_t high, uint64_t pos)
void ConsTree (const std::vector< int64_t > &arr, std::vector< int64_t > *segtree, uint64_t low, uint64_t high, uint64_t pos)
 for std::vector
 
int64_t query (std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos)
int64_t query (std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos)
 Returns the sum of all elements in a range.
 
void update (std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)
void update (std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)
 Updates a range of the segment tree.
 
static void test ()
static void test ()
 Self-test implementation.
 
int main ()
int main ()
 Main function.
 
@@ -157,37 +159,27 @@ Functions void ConsTree ( - const std::vector< int64_t > &  - arr, + const std::vector< int64_t > & arr, - std::vector< int64_t > *  - segtree, + std::vector< int64_t > * segtree, - uint64_t  - low, + uint64_t low, - uint64_t  - high, + uint64_t high, - uint64_t  - pos  - - - - ) - + uint64_t pos )
@@ -213,11 +205,11 @@ Functions
42 }
43
44 uint64_t mid = (low + high) / 2;
-
45 ConsTree(arr, segtree, low, mid, 2 * pos + 1);
-
46 ConsTree(arr, segtree, mid + 1, high, 2 * pos + 2);
+
45 ConsTree(arr, segtree, low, mid, 2 * pos + 1);
+
46 ConsTree(arr, segtree, mid + 1, high, 2 * pos + 2);
47 (*segtree)[pos] = (*segtree)[2 * pos + 1] + (*segtree)[2 * pos + 2];
48}
-
ConsTree
void ConsTree(const std::vector< int64_t > &arr, std::vector< int64_t > *segtree, uint64_t low, uint64_t high, uint64_t pos)
for std::vector
Definition segtree.cpp:37
+
ConsTree
void ConsTree(const std::vector< int64_t > &arr, std::vector< int64_t > *segtree, uint64_t low, uint64_t high, uint64_t pos)
for std::vector
Definition segtree.cpp:37
Here is the call graph for this function:
@@ -235,8 +227,7 @@ Here is the call graph for this function:
int main ( - void  - ) + void ) @@ -245,7 +236,7 @@ Here is the call graph for this function:

Main function.

Returns
0 on exit
167 {
-
168 test(); // run self-test implementations
+
168 test(); // run self-test implementations
169
170 std::cout << "Enter number of elements: ";
171
@@ -269,7 +260,7 @@ Here is the call graph for this function:
189 }
190 }
191
-
192 ConsTree(arr, &segtree, 0, n - 1, 0);
+
192 ConsTree(arr, &segtree, 0, n - 1, 0);
193
194 do {
195 std::cout << "\nMake your choice:\n"
@@ -283,13 +274,13 @@ Here is the call graph for this function:
203
204 uint64_t p = 1, q = 1, v = 0;
205 std::cin >> p >> q >> v;
-
206 update(&segtree, &lazy, p - 1, q - 1, v, 0, n - 1, 0);
+
206 update(&segtree, &lazy, p - 1, q - 1, v, 0, n - 1, 0);
207 } else if (choice == 2) {
208 std::cout << "Enter 1-indexed lower bound & upper bound:\n";
209
210 uint64_t p = 1, q = 1;
211 std::cin >> p >> q;
-
212 std::cout << query(&segtree, &lazy, p - 1, q - 1, 0, n - 1, 0);
+
212 std::cout << query(&segtree, &lazy, p - 1, q - 1, 0, n - 1, 0);
213 std::cout << "\n";
214 }
215 } while (choice > 0);
@@ -301,14 +292,14 @@ Here is the call graph for this function:
std::ceil
T ceil(T... args)
std::max
T max(T... args)
std::pow
T pow(T... args)
-
test
static void test()
Self-test implementation.
Definition segtree.cpp:146
-
update
void update(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)
Updates a range of the segment tree.
Definition segtree.cpp:102
-
query
Definition mo.cpp:6
+
query
int64_t query(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos)
Returns the sum of all elements in a range.
Definition segtree.cpp:62
+
test
static void test()
Self-test implementation.
Definition segtree.cpp:146
+
update
void update(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)
Updates a range of the segment tree.
Definition segtree.cpp:102
Here is the call graph for this function:
-
+
@@ -320,51 +311,39 @@ Here is the call graph for this function:
- + - - + - - + - - + - - + - - + - - + - - - - - - - +
int64_t query int64_t query (std::vector< int64_t > * segtree, std::vector< int64_t > * segtree,
std::vector< int64_t > * lazy, std::vector< int64_t > * lazy,
uint64_t qlow, uint64_t qlow,
uint64_t qhigh, uint64_t qhigh,
uint64_t low, uint64_t low,
uint64_t high, uint64_t high,
uint64_t pos 
)uint64_t pos )
@@ -404,10 +383,15 @@ Here is the call graph for this function:
82
83 uint64_t mid = (low + high) / 2;
84
-
85 return query(segtree, lazy, qlow, qhigh, low, mid, 2 * pos + 1) +
-
86 query(segtree, lazy, qlow, qhigh, mid + 1, high, 2 * pos + 2);
+
85 return query(segtree, lazy, qlow, qhigh, low, mid, 2 * pos + 1) +
+
86 query(segtree, lazy, qlow, qhigh, mid + 1, high, 2 * pos + 2);
87}
- +
+Here is the call graph for this function:
+
+
+
+ @@ -422,7 +406,7 @@ Here is the call graph for this function: static void test ( - ) + ) @@ -440,20 +424,20 @@ Here is the call graph for this function:
148 assert(max == 15);
149
150 std::vector<int64_t> arr{1, 2, 3, 4, 5, 6, 7}, lazy(max), segtree(max);
-
151 ConsTree(arr, &segtree, 0, 7 - 1, 0);
+
151 ConsTree(arr, &segtree, 0, 7 - 1, 0);
152
-
153 assert(query(&segtree, &lazy, 1, 5, 0, 7 - 1, 0) == 2 + 3 + 4 + 5 + 6);
+
153 assert(query(&segtree, &lazy, 1, 5, 0, 7 - 1, 0) == 2 + 3 + 4 + 5 + 6);
154
-
155 update(&segtree, &lazy, 2, 4, 1, 0, 7 - 1, 0);
-
156 assert(query(&segtree, &lazy, 1, 5, 0, 7 - 1, 0) == 2 + 4 + 5 + 6 + 6);
+
155 update(&segtree, &lazy, 2, 4, 1, 0, 7 - 1, 0);
+
156 assert(query(&segtree, &lazy, 1, 5, 0, 7 - 1, 0) == 2 + 4 + 5 + 6 + 6);
157
-
158 update(&segtree, &lazy, 0, 6, -2, 0, 7 - 1, 0);
-
159 assert(query(&segtree, &lazy, 0, 4, 0, 7 - 1, 0) == -1 + 0 + 2 + 3 + 4);
+
158 update(&segtree, &lazy, 0, 6, -2, 0, 7 - 1, 0);
+
159 assert(query(&segtree, &lazy, 0, 4, 0, 7 - 1, 0) == -1 + 0 + 2 + 3 + 4);
160}
Here is the call graph for this function:
-
+
@@ -467,55 +451,42 @@ Here is the call graph for this function: void update ( - std::vector< int64_t > *  - segtree, + std::vector< int64_t > * segtree, - std::vector< int64_t > *  - lazy, + std::vector< int64_t > * lazy, - int64_t  - start, + int64_t start, - int64_t  - end, + int64_t end, - int64_t  - delta, + int64_t delta, - uint64_t  - low, + uint64_t low, - uint64_t  - high, + uint64_t high, - uint64_t  - pos  - - - - ) - + uint64_t pos )
@@ -567,8 +538,8 @@ Here is the call graph for this function:
133
134 uint64_t mid = (low + high) / 2;
135
-
136 update(segtree, lazy, start, end, delta, low, mid, 2 * pos + 1);
-
137 update(segtree, lazy, start, end, delta, mid + 1, high, 2 * pos + 2);
+
136 update(segtree, lazy, start, end, delta, low, mid, 2 * pos + 1);
+
137 update(segtree, lazy, start, end, delta, mid + 1, high, 2 * pos + 2);
138 (*segtree)[pos] = (*segtree)[2 * pos + 1] + (*segtree)[2 * pos + 2];
139}
@@ -585,7 +556,7 @@ Here is the call graph for this function:
diff --git a/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.map b/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.map new file mode 100644 index 000000000..bacea79c8 --- /dev/null +++ b/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.md5 b/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.md5 new file mode 100644 index 000000000..5f3b146db --- /dev/null +++ b/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.md5 @@ -0,0 +1 @@ +4beb5565895e9cc3a907595a928822dd \ No newline at end of file diff --git a/d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph.svg b/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.svg similarity index 65% rename from d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph.svg rename to d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.svg index 1066c4db4..b30d4d96a 100644 --- a/d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph.svg +++ b/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.svg @@ -3,9 +3,9 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - - + + - + test Node1 - -test + +test @@ -31,8 +31,8 @@ Node2 - -ConsTree + +ConsTree @@ -40,17 +40,17 @@ Node1->Node2 - - + + Node3 - - -update + + +query @@ -58,8 +58,26 @@ Node1->Node3 - - + + + + + + + +Node4 + + +update + + + + + +Node1->Node4 + + + @@ -67,8 +85,8 @@ Node2->Node2 - - + + @@ -76,6 +94,15 @@ Node3->Node3 + + + + + + + +Node4->Node4 + diff --git a/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index 97698f1cc..19db9e874 100644 --- a/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + test Node1 - -test + +test @@ -21,8 +21,8 @@ Node2 - -ConsTree + +ConsTree @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node3 - - -update + + +query @@ -48,8 +48,26 @@ Node1->Node3 - - + + + + + + + +Node4 + + +update + + + + + +Node1->Node4 + + + @@ -57,8 +75,8 @@ Node2->Node2 - - + + @@ -66,6 +84,15 @@ Node3->Node3 + + + + + + + +Node4->Node4 + diff --git a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index da9b7e373..8141b746c 100644 --- a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,13 +1,17 @@ - + - - - - - + + + + + + + - - - + + + + + diff --git a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 0eb70d8ab..3ab386bf6 100644 --- a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -e2abbfa1176db3ff5ce33f26fbe6318b \ No newline at end of file +67332d76b842788ad2c01c9d0b1410a8 \ No newline at end of file diff --git a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 131660d6d..f41d532c3 100644 --- a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,8 +4,8 @@ - + - + main Node1 - -main + +main @@ -31,8 +31,8 @@ Node2 - -ConsTree + +ConsTree @@ -40,17 +40,17 @@ Node1->Node2 - - + + Node3 - - -test + + +query @@ -58,26 +58,44 @@ Node1->Node3 - - + + Node4 - + + +test + + + + + +Node1->Node4 + + + + + + + + +Node5 + update - - -Node1->Node4 - - - + + +Node1->Node5 + + + @@ -85,33 +103,51 @@ Node2->Node2 - - + + - - -Node3->Node2 - - - + + +Node3->Node3 + + + - - -Node3->Node4 - - - + + +Node4->Node2 + + + - - -Node4->Node4 - + + +Node4->Node3 + + + + + + + + +Node4->Node5 + + + + + + + + +Node5->Node5 + diff --git a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 6f14863c6..ccfee2c08 100644 --- a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + main Node1 - -main + +main @@ -21,8 +21,8 @@ Node2 - -ConsTree + +ConsTree @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node3 - - -test + + +query @@ -48,26 +48,44 @@ Node1->Node3 - - + + Node4 - + + +test + + + + + +Node1->Node4 + + + + + + + + +Node5 + update - - -Node1->Node4 - - - + + +Node1->Node5 + + + @@ -75,33 +93,51 @@ Node2->Node2 - - + + - - -Node3->Node2 - - - + + +Node3->Node3 + + + - - -Node3->Node4 - - - + + +Node4->Node2 + + + - - -Node4->Node4 - + + +Node4->Node3 + + + + + + + + +Node4->Node5 + + + + + + + + +Node5->Node5 + diff --git a/d2/d52/heap__sort_8cpp.html b/d2/d52/heap__sort_8cpp.html index 8a3259021..1153caa5e 100644 --- a/d2/d52/heap__sort_8cpp.html +++ b/d2/d52/heap__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/heap_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -117,7 +119,7 @@ Include dependency graph for heap_sort.cpp:

Functions

template<typename T > -void printArray (T *arr, int sz) +void printArray (T *arr, int sz)   template<typename T > void heapify (T *arr, int n, int i) @@ -125,9 +127,9 @@ Functions template<typename T > void heapSort (T *arr, int n)   -void test () +void test ()   -int main () +int main ()  

Detailed Description

@@ -145,18 +147,17 @@ Functions int main ( - void  - ) + void )

Main function

120 {
-
121 test();
+
121 test();
122 return 0;
123}
-
test
void test()
Definition heap_sort.cpp:99
+
test
void test()
Definition heap_sort.cpp:99
Here is the call graph for this function:
@@ -176,19 +177,12 @@ template<typename T >
void printArray ( - T *  - arr, + T * arr, - int  - sz  - - - - ) - + int sz )
@@ -217,7 +211,7 @@ template<typename T >
void test ( - ) + ) @@ -227,23 +221,23 @@ template<typename T >
100 std::cout << "Test 1\n";
101 int arr[] = {-10, 78, -1, -6, 7, 4, 94, 5, 99, 0};
102 int sz = sizeof(arr) / sizeof(arr[0]); // sz - size of array
-
103 printArray(arr, sz); // displaying the array before sorting
+
103 printArray(arr, sz); // displaying the array before sorting
104 heapSort(arr, sz); // calling heapsort to sort the array
-
105 printArray(arr, sz); // display array after sorting
+
105 printArray(arr, sz); // display array after sorting
106 assert(std::is_sorted(arr, arr + sz));
107 std::cout << "Test 1 Passed\n========================\n";
108
109 std::cout << "Test 2\n";
110 double arr2[] = {4.5, -3.6, 7.6, 0, 12.9};
111 sz = sizeof(arr2) / sizeof(arr2[0]);
-
112 printArray(arr2, sz);
+
112 printArray(arr2, sz);
113 heapSort(arr2, sz);
-
114 printArray(arr2, sz);
+
114 printArray(arr2, sz);
115 assert(std::is_sorted(arr2, arr2 + sz));
116 std::cout << "Test 2 passed\n";
117}
heapSort
void heapSort(T *arr, int n)
Definition heap_sort.cpp:84
-
printArray
void printArray(T *arr, int sz)
Definition heap_sort.cpp:37
+
printArray
void printArray(T *arr, int sz)
Definition heap_sort.cpp:37
std::is_sorted
T is_sorted(T... args)
Here is the call graph for this function:
@@ -259,7 +253,7 @@ Here is the call graph for this function: diff --git a/d2/d58/neural__network_8cpp.html b/d2/d58/neural__network_8cpp.html index c718e0f24..7101ea674 100644 --- a/d2/d58/neural__network_8cpp.html +++ b/d2/d58/neural__network_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: machine_learning/neural_network.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -151,25 +153,25 @@ Namespaces - + - + - + - + - + - + - + - + - + - +

Functions

double machine_learning::neural_network::activations::sigmoid (const double &x)
double machine_learning::neural_network::activations::sigmoid (const double &x)
 
double machine_learning::neural_network::activations::dsigmoid (const double &x)
double machine_learning::neural_network::activations::dsigmoid (const double &x)
 
double machine_learning::neural_network::activations::relu (const double &x)
double machine_learning::neural_network::activations::relu (const double &x)
 
double machine_learning::neural_network::activations::drelu (const double &x)
double machine_learning::neural_network::activations::drelu (const double &x)
 
double machine_learning::neural_network::activations::tanh (const double &x)
double machine_learning::neural_network::activations::tanh (const double &x)
 
double machine_learning::neural_network::activations::dtanh (const double &x)
double machine_learning::neural_network::activations::dtanh (const double &x)
 
double machine_learning::neural_network::util_functions::square (const double &x)
double machine_learning::neural_network::util_functions::square (const double &x)
 
double machine_learning::neural_network::util_functions::identity_function (const double &x)
double machine_learning::neural_network::util_functions::identity_function (const double &x)
 
static void test ()
static void test ()
 
int main ()
int main ()
 Main function.
 
@@ -190,8 +192,7 @@ Functions double machine_learning::neural_network::activations::drelu ( - const double &  - x) + const double & x) @@ -221,8 +222,7 @@ Here is the call graph for this function:
double machine_learning::neural_network::activations::dsigmoid ( - const double &  - x) + const double & x) @@ -252,8 +252,7 @@ Here is the call graph for this function: double machine_learning::neural_network::activations::dtanh ( - const double &  - x) + const double & x) @@ -283,8 +282,7 @@ Here is the call graph for this function: double machine_learning::neural_network::util_functions::identity_function ( - const double &  - x) + const double & x) @@ -314,8 +312,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -325,10 +322,10 @@ Here is the call graph for this function:
Returns
0 on exit
833 {
834 // Testing
-
835 test();
+
835 test();
836 return 0;
837}
-
test
static void test()
Definition neural_network.cpp:805
+
test
static void test()
Definition neural_network.cpp:805
Here is the call graph for this function:
@@ -346,8 +343,7 @@ Here is the call graph for this function:
double machine_learning::neural_network::activations::relu ( - const double &  - x) + const double & x) @@ -378,8 +374,7 @@ Here is the call graph for this function: double machine_learning::neural_network::activations::sigmoid ( - const double &  - x) + const double & x) @@ -410,8 +405,7 @@ Here is the call graph for this function: double machine_learning::neural_network::util_functions::square ( - const double &  - x) + const double & x) @@ -441,8 +435,7 @@ Here is the call graph for this function: double machine_learning::neural_network::activations::tanh ( - const double &  - x) + const double & x) @@ -475,7 +468,7 @@ Here is the call graph for this function: static void test ( - ) + ) @@ -528,7 +521,7 @@ Here is the call graph for this function: diff --git a/d2/d84/classprobability_1_1geometric__dist_1_1geometric__distribution-members.html b/d2/d84/classprobability_1_1geometric__dist_1_1geometric__distribution-members.html index d0debf9f3..fd34d57c7 100644 --- a/d2/d84/classprobability_1_1geometric__dist_1_1geometric__distribution-members.html +++ b/d2/d84/classprobability_1_1geometric__dist_1_1geometric__distribution-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -118,7 +120,7 @@ $(document).ready(function(){initNavTree('da/d19/classprobability_1_1geometric__ diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html index 2d08f68c5..a88b890bd 100644 --- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html +++ b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: range_queries::heavy_light_decomposition::HLD< X > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('d2/d8a/classrange__queries_1_1heavy__l

The Heavy-Light Decomposition class. - More...

+ More...

Inheritance diagram for range_queries::heavy_light_decomposition::HLD< X >:
@@ -121,19 +123,19 @@ Collaboration diagram for range_queries::heavy_light_decomposition::HLD< X &g - + - + - + - + - + @@ -161,16 +163,16 @@ Public Member Functions

Public Member Functions

 HLD (int nodes)
 HLD (int nodes)
 Class parameterized constructor. Resizes the and initilizes the data members.
 
void init ()
void init ()
 This function must be called after the tree adjacency list and node values are populated The function initializes the required parametes, and populates the segment tree.
 
void update (int node, X val)
void update (int node, X val)
 This function updates the value at node with val.
 
X query (int a, int b)
X query (int a, int b)
 This function returns the sum of node values in the simple path from from node_1 to node_2.
 
- Public Member Functions inherited from range_queries::heavy_light_decomposition::Tree< X >
- Public Member Functions inherited from range_queries::heavy_light_decomposition::Tree< X >
 Tree (int nodes)
 Class parameterized constructor, resizes the and initializes the data members.
 
- + - + - + - +

Private Member Functions

void dfs_hc (int u, int p=-1)
void dfs_hc (int u, int p=-1)
 Utility function to assign heavy child to each node (-1 for a leaf node)
 
void dfs_par (int u, int p=-1)
void dfs_par (int u, int p=-1)
 Utility function to assign highest parent that can be reached though heavy chains.
 
void dfs_labels (int u, int p=-1)
void dfs_labels (int u, int p=-1)
 Utility function to lable the nodes so that heavy chains have a contigous lable.
 
X chain_query (int a, int b)
X chain_query (int a, int b)
 Utility function to break down a path query into two chain queries.
 
@@ -178,7 +180,7 @@ Private Member Functions Private Attributes - + @@ -217,8 +219,7 @@ template<typename X > - - +
int label
 utility member to assign labels in dfs_labels()
 utility member to assign labels in dfs_labels()
 
std::vector< int > h_label
range_queries::heavy_light_decomposition::HLD< X >::HLD (int nodes)int nodes)
@@ -238,18 +239,18 @@ template<typename X >
435 : Tree<X>(nodes), SG<X>(nodes) {
436 /* Initialization and resize vectors */
-
437 label = 0;
-
438 h_label.assign(Tree<X>::t_nodes, -1);
-
439 h_heavychlid.assign(Tree<X>::t_nodes, -1);
-
440 h_parent.resize(Tree<X>::t_nodes);
-
441 iota(h_parent.begin(), h_parent.end(), 0);
+
437 label = 0;
+
438 h_label.assign(Tree<X>::t_nodes, -1);
+
439 h_heavychlid.assign(Tree<X>::t_nodes, -1);
+
440 h_parent.resize(Tree<X>::t_nodes);
+
441 iota(h_parent.begin(), h_parent.end(), 0);
442 }
std::vector::assign
T assign(T... args)
std::vector::begin
T begin(T... args)
-
range_queries::heavy_light_decomposition::HLD::h_parent
std::vector< int > h_parent
stores the top of the heavy chain from a node
Definition heavy_light_decomposition.cpp:341
-
range_queries::heavy_light_decomposition::HLD::label
int label
utility member to assign labels in dfs_labels()
Definition heavy_light_decomposition.cpp:338
-
range_queries::heavy_light_decomposition::HLD::h_heavychlid
std::vector< int > h_heavychlid
stores the heavy child of a node
Definition heavy_light_decomposition.cpp:340
-
range_queries::heavy_light_decomposition::HLD::h_label
std::vector< int > h_label
stores the label of a node
Definition heavy_light_decomposition.cpp:339
+
range_queries::heavy_light_decomposition::HLD::h_parent
std::vector< int > h_parent
stores the top of the heavy chain from a node
Definition heavy_light_decomposition.cpp:341
+
range_queries::heavy_light_decomposition::HLD::label
int label
utility member to assign labels in dfs_labels()
Definition heavy_light_decomposition.cpp:338
+
range_queries::heavy_light_decomposition::HLD::h_heavychlid
std::vector< int > h_heavychlid
stores the heavy child of a node
Definition heavy_light_decomposition.cpp:340
+
range_queries::heavy_light_decomposition::HLD::h_label
std::vector< int > h_label
stores the label of a node
Definition heavy_light_decomposition.cpp:339
range_queries::heavy_light_decomposition::Tree::t_nodes
const int t_nodes
number of nodes
Definition heavy_light_decomposition.cpp:84
std::vector::end
T end(T... args)
std::iota
T iota(T... args)
@@ -272,19 +273,12 @@ template<typename X >
X range_queries::heavy_light_decomposition::HLD< X >::chain_query ( - int  - a, + int a, - int  - b  - - - - ) - + int b ) @@ -309,13 +303,13 @@ template<typename X >
412 std::swap(a, b);
413 }
414 while (Tree<X>::t_depth[a] >= Tree<X>::t_depth[b]) {
-
415 int l = h_label[h_parent[a]];
-
416 int r = h_label[a];
-
417 if (Tree<X>::t_depth[h_parent[a]] < Tree<X>::t_depth[b]) {
-
418 l += Tree<X>::t_depth[b] - Tree<X>::t_depth[h_parent[a]];
+
415 int l = h_label[h_parent[a]];
+
416 int r = h_label[a];
+
417 if (Tree<X>::t_depth[h_parent[a]] < Tree<X>::t_depth[b]) {
+
418 l += Tree<X>::t_depth[b] - Tree<X>::t_depth[h_parent[a]];
419 }
420 ret = SG<X>::combine(ret, SG<X>::query(l, r));
-
421 a = Tree<X>::t_par[h_parent[a]][0];
+
421 a = Tree<X>::t_par[h_parent[a]][0];
422 if (a == -1) {
423 break;
424 }
@@ -351,19 +345,12 @@ template<typename X >
void range_queries::heavy_light_decomposition::HLD< X >::dfs_hc ( - int  - u, + int u, - int  - p = -1  - - - - ) - + int p = -1 ) @@ -386,16 +373,16 @@ template<typename X >
351 int hc_size = -1, hc_id = -1;
352 for (const int &v : Tree<X>::t_adj[u]) {
353 if (v ^ p) {
-
354 dfs_hc(v, u);
+
354 dfs_hc(v, u);
355 if (Tree<X>::t_size[v] > hc_size) {
356 hc_size = Tree<X>::t_size[v];
357 hc_id = v;
358 }
359 }
360 }
-
361 h_heavychlid[u] = hc_id;
+
361 h_heavychlid[u] = hc_id;
362 }
-
range_queries::heavy_light_decomposition::HLD::dfs_hc
void dfs_hc(int u, int p=-1)
Utility function to assign heavy child to each node (-1 for a leaf node)
Definition heavy_light_decomposition.cpp:350
+
range_queries::heavy_light_decomposition::HLD::dfs_hc
void dfs_hc(int u, int p=-1)
Utility function to assign heavy child to each node (-1 for a leaf node)
Definition heavy_light_decomposition.cpp:350
range_queries::heavy_light_decomposition::Tree::Tree
Tree(int nodes)
Class parameterized constructor, resizes the and initializes the data members.
Definition heavy_light_decomposition.cpp:140
range_queries::heavy_light_decomposition::Tree::t_adj
std::vector< std::list< int > > t_adj
an adjacency list to stores the tree edges
Definition heavy_light_decomposition.cpp:83
range_queries::heavy_light_decomposition::Tree::t_size
std::vector< int > t_size
a vector to store the subtree size rooted at node
Definition heavy_light_decomposition.cpp:89
@@ -421,19 +408,12 @@ template<typename X > void range_queries::heavy_light_decomposition::HLD< X >::dfs_labels ( - int  - u, + int u, - int  - p = -1  - - - - ) - + int p = -1 ) @@ -453,17 +433,17 @@ template<typename X >
Returns
void
390 {
-
391 h_label[u] = label++;
-
392 if (h_heavychlid[u] != -1) {
-
393 dfs_labels(h_heavychlid[u], u);
+
391 h_label[u] = label++;
+
392 if (h_heavychlid[u] != -1) {
+
393 dfs_labels(h_heavychlid[u], u);
394 }
395 for (const int &v : Tree<X>::t_adj[u]) {
-
396 if (v ^ p and v ^ h_heavychlid[u]) {
-
397 dfs_labels(v, u);
+
396 if (v ^ p and v ^ h_heavychlid[u]) {
+
397 dfs_labels(v, u);
398 }
399 }
400 }
-
range_queries::heavy_light_decomposition::HLD::dfs_labels
void dfs_labels(int u, int p=-1)
Utility function to lable the nodes so that heavy chains have a contigous lable.
Definition heavy_light_decomposition.cpp:390
+
range_queries::heavy_light_decomposition::HLD::dfs_labels
void dfs_labels(int u, int p=-1)
Utility function to lable the nodes so that heavy chains have a contigous lable.
Definition heavy_light_decomposition.cpp:390
Here is the call graph for this function:
@@ -486,19 +466,12 @@ template<typename X >
void range_queries::heavy_light_decomposition::HLD< X >::dfs_par ( - int  - u, + int u, - int  - p = -1  - - - - ) - + int p = -1 ) @@ -518,17 +491,17 @@ template<typename X >
Returns
void
371 {
-
372 if (h_heavychlid[u] != -1) {
-
373 h_parent[h_heavychlid[u]] = h_parent[u];
-
374 dfs_par(h_heavychlid[u], u);
+
372 if (h_heavychlid[u] != -1) {
+
373 h_parent[h_heavychlid[u]] = h_parent[u];
+
374 dfs_par(h_heavychlid[u], u);
375 }
376 for (const int &v : Tree<X>::t_adj[u]) {
-
377 if (v ^ p and v ^ h_heavychlid[u]) {
-
378 dfs_par(v, u);
+
377 if (v ^ p and v ^ h_heavychlid[u]) {
+
378 dfs_par(v, u);
379 }
380 }
381 }
-
range_queries::heavy_light_decomposition::HLD::dfs_par
void dfs_par(int u, int p=-1)
Utility function to assign highest parent that can be reached though heavy chains.
Definition heavy_light_decomposition.cpp:371
+
range_queries::heavy_light_decomposition::HLD::dfs_par
void dfs_par(int u, int p=-1)
Utility function to assign highest parent that can be reached though heavy chains.
Definition heavy_light_decomposition.cpp:371
Here is the call graph for this function:
@@ -551,7 +524,7 @@ template<typename X >
void range_queries::heavy_light_decomposition::HLD< X >::init ( - ) + ) @@ -568,14 +541,14 @@ template<typename X >
451 Tree<X>::init();
452
453 // Fill the heavy child, greatest parent, and labels
-
454 label = 0;
-
455 dfs_hc(Tree<X>::t_root);
-
456 dfs_par(Tree<X>::t_root);
-
457 dfs_labels(Tree<X>::t_root);
+
454 label = 0;
+
455 dfs_hc(Tree<X>::t_root);
+
456 dfs_par(Tree<X>::t_root);
+
457 dfs_labels(Tree<X>::t_root);
458
459 // Segment Tree Initialization
460 for (int i = 0; i < Tree<X>::t_nodes; i++) {
-
461 SG<X>::s_tree[h_label[i] + Tree<X>::t_nodes] = Tree<X>::t_val[i];
+
461 SG<X>::s_tree[h_label[i] + Tree<X>::t_nodes] = Tree<X>::t_val[i];
462 }
463 for (int i = Tree<X>::t_nodes - 1; i > 0; i--) {
464 SG<X>::s_tree[i] =
@@ -608,19 +581,12 @@ template<typename X > X range_queries::heavy_light_decomposition::HLD< X >::query ( - int  - a, + int a, - int  - b  - - - - ) - + int b ) @@ -643,11 +609,11 @@ template<typename X >
490 int lc = Tree<X>::lca(a, b);
491 X ret = SG<X>::sret_init;
492 assert(lc != -1);
-
493 ret += chain_query(a, lc);
-
494 ret += chain_query(b, lc);
+
493 ret += chain_query(a, lc);
+
494 ret += chain_query(b, lc);
495 return ret - Tree<X>::t_val[lc];
496 }
-
range_queries::heavy_light_decomposition::HLD::chain_query
X chain_query(int a, int b)
Utility function to break down a path query into two chain queries.
Definition heavy_light_decomposition.cpp:409
+
range_queries::heavy_light_decomposition::HLD::chain_query
X chain_query(int a, int b)
Utility function to break down a path query into two chain queries.
Definition heavy_light_decomposition.cpp:409
range_queries::heavy_light_decomposition::Tree::lca
int lca(int a, int b)
The function returns the least common ancestor of two nodes.
Definition heavy_light_decomposition.cpp:229
Here is the call graph for this function:
@@ -671,19 +637,12 @@ template<typename X > void range_queries::heavy_light_decomposition::HLD< X >::update ( - int  - node, + int node, - X  - val  - - - - ) - + X val ) @@ -703,10 +662,11 @@ template<typename X >
Returns
void
475 {
-
476 X diff = val - Tree<X>::t_val[node];
-
477 SG<X>::update(h_label[node], diff);
-
478 Tree<X>::t_val[node] = val;
+
476 X diff = val - Tree<X>::t_val[node];
+
477 SG<X>::update(h_label[node], diff);
+
478 Tree<X>::t_val[node] = val;
479 }
+
node
struct node { int data; int height; struct node *left; struct node *right;} node
for std::queue
Definition avltree.cpp:13
range_queries::heavy_light_decomposition::SG::update
void update(int p, X v)
Update the value at a node.
Definition heavy_light_decomposition.cpp:293
node
Definition binary_search_tree.cpp:11
@@ -726,7 +686,7 @@ Here is the call graph for this function:
diff --git a/d2/d90/namespacegreedy__algorithms.html b/d2/d90/namespacegreedy__algorithms.html index 043e46762..6b2ba7518 100644 --- a/d2/d90/namespacegreedy__algorithms.html +++ b/d2/d90/namespacegreedy__algorithms.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: greedy_algorithms Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -104,12 +106,12 @@ $(document).ready(function(){initNavTree('d2/d90/namespacegreedy__algorithms.htm

for std::vector -More...

+More...

- +

Functions

template<typename T >
void findMinimumEdge (const int &infinity, const std::array< std::array< T, 6 >, 6 > &graph)
void findMinimumEdge (const int &infinity, const std::array< std::array< T, 6 >, 6 > &graph)
 Finds the minimum edge of the given graph.
 
@@ -129,19 +131,12 @@ template<typename T >
void greedy_algorithms::findMinimumEdge ( - const int &  - infinity, + const int & infinity, - const std::array< std::array< T, 6 >, 6 > &  - graph  - - - - ) - + const std::array< std::array< T, 6 >, 6 > & graph )
@@ -180,7 +175,7 @@ template<typename T >
diff --git a/d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html b/d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html index 554653a46..52f42e13a 100644 --- a/d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html +++ b/d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others::iterative_tree_traversals::Node Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -105,7 +107,7 @@ $(document).ready(function(){initNavTree('d2/d9a/structothers_1_1iterative__tree

defines the structure of a node of the tree - More...

+ More...

Collaboration diagram for others::iterative_tree_traversals::Node:
@@ -118,10 +120,10 @@ Public Attributes int64_t data = 0  The value/key of the node.
  -struct Node * left {} +struct Node * left {}  struct pointer to left subtree.
  -struct Node * right {} +struct Node * right {}  struct pointer to right subtree.
  @@ -171,7 +173,7 @@ int64_t data = 0< diff --git a/d2/da7/namespacefind__non__repeating__integer.html b/d2/da7/namespacefind__non__repeating__integer.html index bc150d717..78566f068 100644 --- a/d2/da7/namespacefind__non__repeating__integer.html +++ b/d2/da7/namespacefind__non__repeating__integer.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: find_non_repeating_integer Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d2/da7/namespacefind__non__repeating__

Functions to find the non repeating integer in an array of repeating integers. Single Number -More...

+More...

Detailed Description

Functions to find the non repeating integer in an array of repeating integers. Single Number

@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d2/da7/namespacefind__non__repeating__ diff --git a/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html b/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html index f461a22b8..f51a10f83 100644 --- a/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html +++ b/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: greedy_algorithms::dijkstra::Graph Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d2/daa/classgreedy__algorithms_1_1dijk

Wrapper class for storing a graph. - More...

+ More...

Collaboration diagram for greedy_algorithms::dijkstra::Graph:
@@ -115,10 +117,10 @@ Collaboration diagram for greedy_algorithms::dijkstra::Graph:
- + - +

Public Member Functions

 Graph (const int V)
 Graph (const int V)
 Constructs a graph.
 
void add_edge (int src, int dst, int weight)
void add_edge (int src, int dst, int weight)
 Adds an edge to the graph.
 
@@ -127,7 +129,7 @@ Public Attributes - +
int vertexNum = 0
 
std::vector< std::vector< int > > edges {}
std::vector< std::vector< int > > edges {}
 

Detailed Description

@@ -145,8 +147,7 @@ int vertexNum = 0 greedy_algorithms::dijkstra::Graph::Graph ( - const int  - V) + const int V) @@ -197,25 +198,17 @@ int vertexNum = 0 void greedy_algorithms::dijkstra::Graph::add_edge ( - int  - src, + int src, - int  - dst, + int dst, - int  - weight  - - - - ) - + int weight ) @@ -266,7 +259,7 @@ int vertexNum = 0 diff --git a/d2/dc4/classstack__linked_list.html b/d2/dc4/classstack__linked_list.html index 4cfc283e7..c8e4d8473 100644 --- a/d2/dc4/classstack__linked_list.html +++ b/d2/dc4/classstack__linked_list.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: stack_linkedList Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -112,11 +114,11 @@ Collaboration diagram for stack_linkedList:
- + - + - +

Public Member Functions

void enqueue (int)
void enqueue (int)
 
int dequeue ()
int dequeue ()
 
void display ()
void display ()
 
- +

@@ -141,7 +143,7 @@ Public Attributes

stack_linkedList::stack_linkedList ())
@@ -165,7 +167,7 @@ Public Attributes int stack_linkedList::dequeue ( - ) + ) @@ -199,7 +201,7 @@ Public Attributes void stack_linkedList::display ( - ) + ) @@ -229,8 +231,7 @@ Public Attributes void stack_linkedList::enqueue ( - int  - ele) + int ele) @@ -259,7 +260,7 @@ Public Attributes diff --git a/d2/dce/classothers_1_1iterative__tree__traversals_1_1_binary_tree-members.html b/d2/dce/classothers_1_1iterative__tree__traversals_1_1_binary_tree-members.html index 6d6a22cf5..daa14d8a6 100644 --- a/d2/dce/classothers_1_1iterative__tree__traversals_1_1_binary_tree-members.html +++ b/d2/dce/classothers_1_1iterative__tree__traversals_1_1_binary_tree-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('d9/d12/classothers_1_1iterative__tree_ diff --git a/d2/dcf/namespacestatistics.html b/d2/dcf/namespacestatistics.html index d11cdbb3b..5557eb739 100644 --- a/d2/dcf/namespacestatistics.html +++ b/d2/dcf/namespacestatistics.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: statistics Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -104,7 +106,7 @@ $(document).ready(function(){initNavTree('d2/dcf/namespacestatistics.html','../.

Statistical algorithms. -More...

+More...

@@ -121,7 +123,7 @@ Classes diff --git a/d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html b/d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html index 2629e25f2..e9f4ad24c 100644 --- a/d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html +++ b/d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html @@ -3,16 +3,18 @@ - +Algorithms_in_C++: std::is_integral< uint128_t > Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({

Classes

- + @@ -71,7 +73,7 @@ $(function() {
@@ -119,7 +121,7 @@ Collaboration diagram for std::is_integral< uint128_t >:
diff --git a/d2/de1/namespacehouse__robber.html b/d2/de1/namespacehouse__robber.html index dccca8be8..05b9adf35 100644 --- a/d2/de1/namespacehouse__robber.html +++ b/d2/de1/namespacehouse__robber.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: house_robber Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d2/de1/namespacehouse__robber.html','.

Functions for the House Robber algorithm. -More...

+More...

Detailed Description

Functions for the House Robber algorithm.

@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d2/de1/namespacehouse__robber.html','. diff --git a/d2/de3/structlinear__probing_1_1_entry-members.html b/d2/de3/structlinear__probing_1_1_entry-members.html index 4dd21dfb0..85929b91d 100644 --- a/d2/de3/structlinear__probing_1_1_entry-members.html +++ b/d2/de3/structlinear__probing_1_1_entry-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -110,7 +112,7 @@ $(document).ready(function(){initNavTree('db/d19/structlinear__probing_1_1_entry diff --git a/d2/de7/namespacerunge__kutta.html b/d2/de7/namespacerunge__kutta.html index 6d3db8a6e..3549a009a 100644 --- a/d2/de7/namespacerunge__kutta.html +++ b/d2/de7/namespacerunge__kutta.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: runge_kutta Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d2/de7/namespacerunge__kutta.html','..

Functions for Runge Kutta fourth order method. -More...

+More...

Detailed Description

Functions for Runge Kutta fourth order method.

@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d2/de7/namespacerunge__kutta.html','.. diff --git a/d2/de9/heavy__light__decomposition_8cpp.html b/d2/de9/heavy__light__decomposition_8cpp.html index 75d244ad2..989ec17a6 100644 --- a/d2/de9/heavy__light__decomposition_8cpp.html +++ b/d2/de9/heavy__light__decomposition_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: range_queries/heavy_light_decomposition.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
- + @@ -71,7 +73,7 @@ $(function() {
@@ -145,13 +147,13 @@ Namespaces - + - + - + - +

Functions

static void test_1 ()
static void test_1 ()
 
static void test_2 ()
static void test_2 ()
 
static void test_3 ()
static void test_3 ()
 
int main ()
int main ()
 

Detailed Description

@@ -172,7 +174,7 @@ Functions
  • Call obj.update(node, new_val), to update the value at index 'node' to the new value. Note: node must be 0 indexed
  • Call obj.query(a, b) to get the (sum) of node values in the simple path from a to b. Note: a and b, must be 0 indexed.
    • -

    Sample I/O at the bottom.

    Todo:
    Support edge weight queries, by storing the edge weight value in it's child algorithm verified by testing in CSES path queries: https://cses.fi/problemset/task/1138
    +

    Sample I/O at the bottom.

    Todo
    Support edge weight queries, by storing the edge weight value in it's child algorithm verified by testing in CSES path queries: https://cses.fi/problemset/task/1138

    Function Documentation

    ◆ main()

    @@ -183,22 +185,21 @@ Functions int main ( - void  - ) + void )

    Main function

    634 {
    -
    635 test_1();
    -
    636 test_2();
    -
    637 test_3();
    +
    635 test_1();
    +
    636 test_2();
    +
    637 test_3();
    638 return 0;
    639}
    -
    test_1
    static void test_1()
    Definition heavy_light_decomposition.cpp:505
    -
    test_2
    static void test_2()
    Definition heavy_light_decomposition.cpp:549
    -
    test_3
    static void test_3()
    Definition heavy_light_decomposition.cpp:592
    +
    test_1
    static void test_1()
    Definition heavy_light_decomposition.cpp:505
    +
    test_2
    static void test_2()
    Definition heavy_light_decomposition.cpp:549
    +
    test_3
    static void test_3()
    Definition heavy_light_decomposition.cpp:592
    Here is the call graph for this function:
    @@ -219,7 +220,7 @@ Here is the call graph for this function:
    static void test_1 ( - ) + ) @@ -294,7 +295,7 @@ Here is the call graph for this function:
    static void test_2 ( - ) + ) @@ -363,7 +364,7 @@ Here is the call graph for this function: static void test_3 ( - ) + ) @@ -426,7 +427,7 @@ Here is the call graph for this function: diff --git a/d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html b/d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html index fa9644d5c..9d018a744 100644 --- a/d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html +++ b/d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: std::is_arithmetic< uint128_t > Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -119,7 +121,7 @@ Collaboration diagram for std::is_arithmetic< uint128_t >:
    diff --git a/d3/d05/classbinary__search__tree-members.html b/d3/d05/classbinary__search__tree-members.html index 7e16d4051..69f91f99c 100644 --- a/d3/d05/classbinary__search__tree-members.html +++ b/d3/d05/classbinary__search__tree-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,7 +130,7 @@ $(document).ready(function(){initNavTree('d9/dde/classbinary__search__tree.html' diff --git a/d3/d05/sudoku__solver_8cpp.html b/d3/d05/sudoku__solver_8cpp.html index 7b256c7bb..bcd42854a 100644 --- a/d3/d05/sudoku__solver_8cpp.html +++ b/d3/d05/sudoku__solver_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: backtracking/sudoku_solver.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,18 +128,18 @@ Namespaces

    Functions

    template<size_t V> -bool backtracking::sudoku_solver::isPossible (const std::array< std::array< int, V >, V > &mat, int i, int j, int no, int n) +bool backtracking::sudoku_solver::isPossible (const std::array< std::array< int, V >, V > &mat, int i, int j, int no, int n)  Check if it's possible to place a number (no parameter)
      template<size_t V> -void backtracking::sudoku_solver::printMat (const std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int n) +void backtracking::sudoku_solver::printMat (const std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int n)  Utility function to print the matrix.
      template<size_t V> -bool backtracking::sudoku_solver::solveSudoku (std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int i, int j) +bool backtracking::sudoku_solver::solveSudoku (std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int i, int j)  Main function to implement the Sudoku algorithm.
      -int main () +int main ()  Main function.
      @@ -159,37 +161,27 @@ template<size_t V>
    bool backtracking::sudoku_solver::isPossible ( - const std::array< std::array< int, V >, V > &  - mat, + const std::array< std::array< int, V >, V > & mat, - int  - i, + int i, - int  - j, + int j, - int  - no, + int no, - int  - n  - - - - ) - + int n )
    @@ -255,8 +247,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -306,25 +297,17 @@ template<size_t V> void backtracking::sudoku_solver::printMat ( - const std::array< std::array< int, V >, V > &  - mat, + const std::array< std::array< int, V >, V > & mat, - const std::array< std::array< int, V >, V > &  - starting_mat, + const std::array< std::array< int, V >, V > & starting_mat, - int  - n  - - - - ) - + int n )
    @@ -383,31 +366,22 @@ template<size_t V>
    bool backtracking::sudoku_solver::solveSudoku ( - std::array< std::array< int, V >, V > &  - mat, + std::array< std::array< int, V >, V > & mat, - const std::array< std::array< int, V >, V > &  - starting_mat, + const std::array< std::array< int, V >, V > & starting_mat, - int  - i, + int i, - int  - j  - - - - ) - + int j )
    @@ -488,7 +462,7 @@ Here is the call graph for this function:
    diff --git a/d3/d06/ode__semi__implicit__euler_8cpp.html b/d3/d06/ode__semi__implicit__euler_8cpp.html index c4c91511b..3055061ba 100644 --- a/d3/d06/ode__semi__implicit__euler_8cpp.html +++ b/d3/d06/ode__semi__implicit__euler_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/ode_semi_implicit_euler.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -118,10 +120,10 @@ Include dependency graph for ode_semi_implicit_euler.cpp:
    - + - + @@ -130,9 +132,9 @@ Functions - + - +

    Functions

    void problem (const double &x, std::valarray< double > *y, std::valarray< double > *dy)
    void problem (const double &x, std::valarray< double > *y, std::valarray< double > *dy)
     Problem statement for a system with first-order differential equations. Updates the system differential variables.
     
    void exact_solution (const double &x, std::valarray< double > *y)
    void exact_solution (const double &x, std::valarray< double > *y)
     Exact solution of the problem. Used for solution comparison.
     
    void semi_implicit_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
    double semi_implicit_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
     Compute approximation using the semi-implicit-Euler method in the given limits.
     
    void save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
    void save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
     
    int main (int argc, char *argv[])
    int main (int argc, char *argv[])
     

    Detailed Description

    @@ -153,7 +155,7 @@ v(x) &=& -\sin(x)\\ \end{eqnarray*}

    The computation results are stored to a text file semi_implicit_euler.csv and the exact soltuion results in exact.csv for comparison. Implementation solution

    -

    To implement Van der Pol oscillator, change the problem function to:

    const double mu = 2.0;
    +

    To implement Van der Pol oscillator, change the problem function to:

    const double mu = 2.0;
    dy[0] = y[1];
    dy[1] = mu * (1.f - y[0] * y[0]) * y[1] - y[0];
    See also
    ode_midpoint_euler.cpp, ode_forward_euler.cpp
    @@ -167,19 +169,12 @@ v(x) &=& -\sin(x)\\ void exact_solution ( - const double &  - x, + const double & x, - std::valarray< double > *  - y  - - - - ) - + std::valarray< double > * y )
    @@ -215,19 +210,12 @@ Here is the call graph for this function:
    int main ( - int  - argc, + int argc, - char *  - argv[]  - - - - ) - + char * argv[] )
    @@ -251,7 +239,7 @@ Here is the call graph for this function:
    205 std::cout << "\tTime = " << total_time << " ms\n";
    206
    207 /* compute exact solution for comparion */
    -
    208 save_exact_solution(X0, X_MAX, step_size, Y0);
    +
    208 save_exact_solution(X0, X_MAX, step_size, Y0);
    209
    210 return 0;
    211}
    @@ -259,7 +247,7 @@ Here is the call graph for this function:
    semi_implicit_euler
    double semi_implicit_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
    Compute approximation using the semi-implicit-Euler method in the given limits.
    Definition ode_semi_implicit_euler.cpp:103
    -
    save_exact_solution
    void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
    Definition ode_semi_implicit_euler.cpp:153
    +
    save_exact_solution
    void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
    Definition ode_semi_implicit_euler.cpp:153
    Here is the call graph for this function:
    @@ -278,25 +266,17 @@ Here is the call graph for this function: void problem ( - const double &  - x, + const double & x, - std::valarray< double > *  - y, + std::valarray< double > * y, - std::valarray< double > *  - dy  - - - - ) - + std::valarray< double > * dy )
    @@ -328,31 +308,22 @@ Here is the call graph for this function:
    void save_exact_solution ( - const double &  - X0, + const double & X0, - const double &  - X_MAX, + const double & X_MAX, - const double &  - step_size, + const double & step_size, - const std::valarray< double > &  - Y0  - - - - ) - + const std::valarray< double > & Y0 )
    @@ -385,7 +356,7 @@ Here is the call graph for this function:
    171 }
    172 fp << y[y.size() - 1] << "\n";
    173
    -
    174 exact_solution(x, &y);
    +
    174 exact_solution(x, &y);
    175
    176 x += step_size;
    177 } while (x <= X_MAX);
    @@ -399,7 +370,7 @@ Here is the call graph for this function:
    std::clock
    T clock(T... args)
    -
    exact_solution
    void exact_solution(const double &x, std::valarray< double > *y)
    Exact solution of the problem. Used for solution comparison.
    Definition ode_semi_implicit_euler.cpp:66
    +
    exact_solution
    void exact_solution(const double &x, std::valarray< double > *y)
    Exact solution of the problem. Used for solution comparison.
    Definition ode_semi_implicit_euler.cpp:66
    std::perror
    T perror(T... args)
    Here is the call graph for this function:
    @@ -415,7 +386,7 @@ Here is the call graph for this function: diff --git a/d3/d09/node_8hpp.html b/d3/d09/node_8hpp.html index 59187f1ff..c1bf268ca 100644 --- a/d3/d09/node_8hpp.html +++ b/d3/d09/node_8hpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/node.hpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -130,13 +132,13 @@ Classes

    Functions

    template<typename Node , typename Action > -void traverse (const Node *const inNode, const Action &action) +void traverse (const Node *const inNode, const Action &action)   template<typename Node > -void display_all (const Node *const inNode) +void display_all (const Node *const inNode)   template<typename Node > -std::vector< typename Node::value_type > push_all_to_vector (const Node *const inNode, const std::size_t expected_size=0) +std::vector< typename Node::value_type > push_all_to_vector (const Node *const inNode, const std::size_t expected_size=0)  

    Detailed Description

    @@ -153,8 +155,7 @@ template<typename Node void display_all ( - const Node *const  - inNode) + const Node *const inNode) @@ -179,19 +180,12 @@ template<typename Node std::vector< typename Node::value_type > push_all_to_vector ( - const Node *const  - inNode, + const Node *const inNode, - const std::size_t  - expected_size = 0  - - - - ) - + const std::size_t expected_size = 0 )
    @@ -219,19 +213,12 @@ template<typename Node void traverse ( - const Node *const  - inNode, + const Node *const inNode, - const Action &  - action  - - - - ) - + const Action & action )
    @@ -250,7 +237,7 @@ template<typename Node diff --git a/d3/d09/node_8hpp_source.html b/d3/d09/node_8hpp_source.html index fe7d1ec3a..2ea682044 100644 --- a/d3/d09/node_8hpp_source.html +++ b/d3/d09/node_8hpp_source.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/node.hpp Source File + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -76,7 +78,7 @@ $(document).ready(function() { init_codefold(1); });
    @@ -164,7 +166,7 @@ $(document).ready(function(){initNavTree('d3/d09/node_8hpp_source.html','../../' diff --git a/d3/d17/namespaceutil__functions.html b/d3/d17/namespaceutil__functions.html index 93e324471..86a980a20 100644 --- a/d3/d17/namespaceutil__functions.html +++ b/d3/d17/namespaceutil__functions.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: util_functions Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d3/d17/namespaceutil__functions.html',

    Various utility functions used in Neural network. -More...

    +More...

    Detailed Description

    Various utility functions used in Neural network.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d3/d17/namespaceutil__functions.html', diff --git a/d3/d19/sparse__matrix_8cpp.html b/d3/d19/sparse__matrix_8cpp.html index 9fe8304d3..0e139b5d5 100644 --- a/d3/d19/sparse__matrix_8cpp.html +++ b/d3/d19/sparse__matrix_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/sparse_matrix.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -111,7 +113,7 @@ Include dependency graph for sparse_matrix.cpp:
    - +

    Functions

    int main ()
    int main ()
     

    Detailed Description

    @@ -126,8 +128,7 @@ Functions int main ( - void  - ) + void ) @@ -184,7 +185,7 @@ Functions diff --git a/d3/d1f/structdata__structures_1_1list__array_1_1list-members.html b/d3/d1f/structdata__structures_1_1list__array_1_1list-members.html index ea34123e5..0933b5820 100644 --- a/d3/d1f/structdata__structures_1_1list__array_1_1list-members.html +++ b/d3/d1f/structdata__structures_1_1list__array_1_1list-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -118,7 +120,7 @@ $(document).ready(function(){initNavTree('d5/dab/structdata__structures_1_1list_ diff --git a/d3/d1f/structsearch_1_1sublist__search_1_1_node-members.html b/d3/d1f/structsearch_1_1sublist__search_1_1_node-members.html index 79c4e300f..fd4301f44 100644 --- a/d3/d1f/structsearch_1_1sublist__search_1_1_node-members.html +++ b/d3/d1f/structsearch_1_1sublist__search_1_1_node-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -110,7 +112,7 @@ $(document).ready(function(){initNavTree('da/d61/structsearch_1_1sublist__search diff --git a/d3/d22/saddleback__search_8cpp.html b/d3/d22/saddleback__search_8cpp.html index 6ec942533..4897b60ed 100644 --- a/d3/d22/saddleback__search_8cpp.html +++ b/d3/d22/saddleback__search_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: search/saddleback_search.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,12 +128,12 @@ Namespaces - + - + - +

    Functions

    std::pair< uint32_t, uint32_t > search::saddleback::saddleback (std::vector< std::vector< int32_t > > matrix, int32_t element)
    std::pair< uint32_t, uint32_t > search::saddleback::saddleback (std::vector< std::vector< int32_t > > matrix, int32_t element)
     
    static void test ()
    static void test ()
     Test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -149,8 +151,7 @@ Functions int main ( - void  - ) + void ) @@ -159,10 +160,10 @@ Functions

    Main function.

    Returns
    0 on exit
    103 {
    -
    104 test(); // execute the tests
    +
    104 test(); // execute the tests
    105 return 0;
    106}
    -
    test
    static void test()
    Test implementations.
    Definition saddleback_search.cpp:70
    +
    test
    static void test()
    Test implementations.
    Definition saddleback_search.cpp:70
    Here is the call graph for this function:
    @@ -180,19 +181,12 @@ Here is the call graph for this function:
    std::pair< uint32_t, uint32_t > search::saddleback::saddleback ( - std::vector< std::vector< int32_t > >  - matrix, + std::vector< std::vector< int32_t > > matrix, - int32_t  - element  - - - - ) - + int32_t element )
    @@ -258,7 +252,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -281,26 +275,26 @@ Here is the call graph for this function:
    77 std::pair<uint32_t, uint32_t> not_found = std::make_pair(0, 0);
    78 std::pair<uint32_t, uint32_t> test_answer;
    79 // Test 1
    -
    80 std::pair<uint32_t, uint32_t> answer1 = search::saddleback::saddleback(matrix, 123);
    +
    80 std::pair<uint32_t, uint32_t> answer1 = search::saddleback::saddleback(matrix, 123);
    81 assert(not_found == answer1);
    82 // Test 2
    -
    83 answer1 = search::saddleback::saddleback(matrix, 0);
    +
    83 answer1 = search::saddleback::saddleback(matrix, 0);
    84 assert(not_found == answer1);
    85 // Test 3
    -
    86 answer1 = search::saddleback::saddleback(matrix, 1);
    +
    86 answer1 = search::saddleback::saddleback(matrix, 1);
    87 test_answer = std::make_pair(1, 1);
    88 assert(test_answer == answer1);
    89 // Test 4
    -
    90 answer1 = search::saddleback::saddleback(matrix, 50000);
    +
    90 answer1 = search::saddleback::saddleback(matrix, 50000);
    91 test_answer = std::make_pair(5, 5);
    92 assert(test_answer == answer1);
    93 // Test 5
    -
    94 answer1 = search::saddleback::saddleback(matrix, 300);
    +
    94 answer1 = search::saddleback::saddleback(matrix, 300);
    95 test_answer = std::make_pair(3, 3);
    96 assert(test_answer == answer1);
    97}
    -
    search::saddleback::saddleback
    std::pair< uint32_t, uint32_t > saddleback(std::vector< std::vector< int32_t > > matrix, int32_t element)
    Definition saddleback_search.cpp:33
    +
    search::saddleback::saddleback
    std::pair< uint32_t, uint32_t > saddleback(std::vector< std::vector< int32_t > > matrix, int32_t element)
    Definition saddleback_search.cpp:33
    Here is the call graph for this function:
    @@ -315,7 +309,7 @@ Here is the call graph for this function:
    diff --git a/d3/d24/qr__decomposition_8cpp.html b/d3/d24/qr__decomposition_8cpp.html index f8d88e7e5..a9e59f007 100644 --- a/d3/d24/qr__decomposition_8cpp.html +++ b/d3/d24/qr__decomposition_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/qr_decomposition.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -119,7 +121,7 @@ Include dependency graph for qr_decomposition.cpp:
    - +

    Functions

    int main (void)
    int main (void)
     

    Detailed Description

    @@ -135,8 +137,7 @@ Functions int main ( - void  - ) + void ) @@ -169,7 +170,7 @@ Functions
    47 std::cout << A << "\n";
    48
    49 clock_t t1 = clock();
    -
    50 qr_decompose(A, &Q, &R);
    +
    50 qr_decompose(A, &Q, &R);
    51 double dtime = static_cast<double>(clock() - t1) / CLOCKS_PER_SEC;
    52
    53 std::cout << Q << "\n";
    @@ -182,7 +183,6 @@ Functions
    std::clock
    T clock(T... args)
    std::max
    T max(T... args)
    -
    qr_algorithm::qr_decompose
    void qr_decompose(const std::valarray< std::valarray< T > > &A, std::valarray< std::valarray< T > > *Q, std::valarray< std::valarray< T > > *R)
    Definition qr_decompose.h:146
    Here is the call graph for this function:
    @@ -198,7 +198,7 @@ Here is the call graph for this function: diff --git a/d3/d26/binary__search__tree_8cpp.html b/d3/d26/binary__search__tree_8cpp.html index a562c5346..47060053f 100644 --- a/d3/d26/binary__search__tree_8cpp.html +++ b/d3/d26/binary__search__tree_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/binary_search_tree.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -123,25 +125,25 @@ Classes - + - + - + - + - + - + - + - + - + - +

    Functions

    void enqueue (node *n)
    void enqueue (node *n)
     
    node * dequeue ()
    node * dequeue ()
     
    void Insert (node *n, int x)
    void Insert (node *n, int x)
     
    int findMaxInLeftST (node *n)
    int findMaxInLeftST (node *n)
     
    void Remove (node *p, node *n, int x)
    void Remove (node *p, node *n, int x)
     
    void BFT (node *n)
    void BFT (node *n)
     
    void Pre (node *n)
    void Pre (node *n)
     
    void In (node *n)
    void In (node *n)
     
    void Post (node *n)
    void Post (node *n)
     
    int main ()
    int main ()
     

    @@ -152,7 +154,7 @@ Variables

    Detailed Description

    A simple tree implementation using structured nodes.

    -
    Todo:
    update code to use C++ STL library features and OO structure
    +
    Todo
    update code to use C++ STL library features and OO structure
    Warning
    This program is a poor implementation - C style - and does not utilize any of the C++ STL features.

    Function Documentation

    @@ -164,8 +166,7 @@ Variables void BFT ( - node *  - n) + node * n) @@ -191,7 +192,7 @@ Variables node * dequeue ( - ) + ) @@ -211,8 +212,7 @@ Variables void enqueue ( - node *  - n) + node * n) @@ -230,8 +230,7 @@ Variables int findMaxInLeftST ( - node *  - n) + node * n) @@ -254,8 +253,7 @@ Variables void In ( - node *  - n) + node * n) @@ -279,26 +277,19 @@ Variables void Insert ( - node *  - n, + node * n, - int  - x  - - - - ) - + int x )
    29 {
    30 if (x < n->val) {
    31 if (n->left == NULL) {
    -
    32 node *temp = new node;
    +
    32 node *temp = new node;
    33 temp->val = x;
    34 temp->left = NULL;
    35 temp->right = NULL;
    @@ -308,7 +299,7 @@ Variables
    39 }
    40 } else {
    41 if (n->right == NULL) {
    -
    42 node *temp = new node;
    +
    42 node *temp = new node;
    43 temp->val = x;
    44 temp->left = NULL;
    45 temp->right = NULL;
    @@ -318,6 +309,7 @@ Variables
    49 }
    50 }
    51}
    +
    node
    struct node { int data; int height; struct node *left; struct node *right;} node
    for std::queue
    Definition avltree.cpp:13
    node
    Definition binary_search_tree.cpp:11
    @@ -331,8 +323,7 @@ Variables int main ( - void  - ) + void ) @@ -342,7 +333,7 @@ Variables
    127 queue.rear = 0;
    128 int value;
    129 int ch;
    -
    130 node *root = new node;
    +
    130 node *root = new node;
    131 std::cout << "\nEnter the value of root node :";
    132 std::cin >> value;
    133 root->val = value;
    @@ -400,8 +391,7 @@ Variables void Post ( - node *  - n) + node * n) @@ -425,8 +415,7 @@ Variables void Pre ( - node *  - n) + node * n) @@ -450,25 +439,17 @@ Variables void Remove ( - node *  - p, + node * p, - node *  - n, + node * n, - int  - x  - - - - ) - + int x )
    @@ -512,7 +493,7 @@ Variables diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html index 2e6ce08e0..e3dc65358 100644 --- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html +++ b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures::trie_using_hashmap::Trie Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('d3/d26/classdata__structures_1_1trie__

    Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix. - More...

    + More...

    Collaboration diagram for data_structures::trie_using_hashmap::Trie:
    @@ -126,28 +128,28 @@ Public Member Functions  Trie ()=default  < Constructor
      -void insert (const std::string &word) +void insert (const std::string &word)  insert the string into the trie
      -bool search (const std::string &word) +bool search (const std::string &word)  search a word/string inside the trie
      -bool startwith (const std::string &prefix) +bool startwith (const std::string &prefix)  search a word/string that starts with a given prefix
      -void delete_word (std::string word) +void delete_word (std::string word)  delete a word/string from a trie
      -std::vector< std::string > get_all_words (std::vector< std::string > results, const std::shared_ptr< Node > &element, std::string prefix) +std::vector< std::string > get_all_words (std::vector< std::string > results, const std::shared_ptr< Node > &element, std::string prefix)  helper function to predict/recommend words that starts with a given prefix from the end of prefix's node iterate through all the child nodes by recursively appending all the possible words below the trie
      -std::vector< std::string > predict_words (const std::string &prefix) +std::vector< std::string > predict_words (const std::string &prefix)  predict/recommend a word that starts with a given prefix
      - +

    Private Attributes

    std::shared_ptr< Node > root_node
    std::shared_ptr< Node > root_node
     declaring root node of trie
     
    @@ -166,8 +168,7 @@ Private Attributes void data_structures::trie_using_hashmap::Trie::delete_word ( - std::string  - word) + std::string word) @@ -186,7 +187,7 @@ Private Attributes
    122 {
    -
    123 std::shared_ptr<Node> curr = root_node;
    +
    123 std::shared_ptr<Node> curr = root_node;
    124 std::stack<std::shared_ptr<Node>> nodes;
    125 int cnt = 0;
    126 for (char ch : word) {
    @@ -214,7 +215,7 @@ Private Attributes
    148 }
    149 }
    std::string::back
    T back(T... args)
    -
    data_structures::trie_using_hashmap::Trie::root_node
    std::shared_ptr< Node > root_node
    declaring root node of trie
    Definition trie_using_hashmap.cpp:51
    +
    data_structures::trie_using_hashmap::Trie::root_node
    std::shared_ptr< Node > root_node
    declaring root node of trie
    Definition trie_using_hashmap.cpp:51
    std::string::pop_back
    T pop_back(T... args)
    std::stack::pop
    T pop(T... args)
    std::stack::push
    T push(T... args)
    @@ -241,25 +242,17 @@ Here is the call graph for this function:
    std::vector< std::string > data_structures::trie_using_hashmap::Trie::get_all_words ( - std::vector< std::string >  - results, + std::vector< std::string > results, - const std::shared_ptr< Node > &  - element, + const std::shared_ptr< Node > & element, - std::string  - prefix  - - - - ) - + std::string prefix ) @@ -292,7 +285,7 @@ Here is the call graph for this function:
    172 prefix += key;
    173
    174 results =
    -
    175 get_all_words(results, element->children[x.first], prefix);
    +
    175 get_all_words(results, element->children[x.first], prefix);
    176
    177 prefix.pop_back();
    178 }
    @@ -300,7 +293,7 @@ Here is the call graph for this function:
    180 return results;
    181 }
    -
    data_structures::trie_using_hashmap::Trie::get_all_words
    std::vector< std::string > get_all_words(std::vector< std::string > results, const std::shared_ptr< Node > &element, std::string prefix)
    helper function to predict/recommend words that starts with a given prefix from the end of prefix's n...
    Definition trie_using_hashmap.cpp:160
    +
    data_structures::trie_using_hashmap::Trie::get_all_words
    std::vector< std::string > get_all_words(std::vector< std::string > results, const std::shared_ptr< Node > &element, std::string prefix)
    helper function to predict/recommend words that starts with a given prefix from the end of prefix's n...
    Definition trie_using_hashmap.cpp:160
    std::vector::push_back
    T push_back(T... args)
    data_structures::trie_using_hashmap::Trie::Node::children
    std::unordered_map< char16_t, std::shared_ptr< Node > > children
    Definition trie_using_hashmap.cpp:46
    data_structures::trie_using_hashmap::Trie::Node::word_end
    bool word_end
    boolean variable to represent the node end
    Definition trie_using_hashmap.cpp:48
    @@ -324,8 +317,7 @@ Here is the call graph for this function:
    void data_structures::trie_using_hashmap::Trie::insert ( - const std::string &  - word) + const std::string & word) @@ -344,7 +336,7 @@ Here is the call graph for this function:
    62 {
    -
    63 std::shared_ptr<Node> curr = root_node;
    +
    63 std::shared_ptr<Node> curr = root_node;
    64 for (char ch : word) {
    65 if (curr->children.find(ch) == curr->children.end()) {
    66 curr->children[ch] = std::make_shared<Node>();
    @@ -352,7 +344,7 @@ Here is the call graph for this function:
    68 curr = curr->children[ch];
    69 }
    70
    -
    71 if (!curr->word_end && curr != root_node) {
    +
    71 if (!curr->word_end && curr != root_node) {
    72 curr->word_end = true;
    73 }
    74 }
    @@ -371,8 +363,7 @@ Here is the call graph for this function: std::vector< std::string > data_structures::trie_using_hashmap::Trie::predict_words ( - const std::string &  - prefix) + const std::string & prefix) @@ -394,7 +385,7 @@ Here is the call graph for this function:

    < iteratively and recursively get the recommended words

    188 {
    189 std::vector<std::string> result;
    -
    190 std::shared_ptr<Node> curr = root_node;
    +
    190 std::shared_ptr<Node> curr = root_node;
    191 // traversing until the end of the given prefix in trie
    192
    193 for (char ch : prefix) {
    @@ -411,7 +402,7 @@ Here is the call graph for this function:
    204 return result;
    205 }
    206
    -
    207 result = get_all_words(
    +
    207 result = get_all_words(
    208 result, curr,
    209 prefix); ///< iteratively and recursively get the recommended words
    210
    @@ -439,8 +430,7 @@ Here is the call graph for this function: bool data_structures::trie_using_hashmap::Trie::search ( - const std::string &  - word) + const std::string & word) @@ -462,7 +452,7 @@ Here is the call graph for this function:
    false if not found
    82 {
    -
    83 std::shared_ptr<Node> curr = root_node;
    +
    83 std::shared_ptr<Node> curr = root_node;
    84 for (char ch : word) {
    85 if (curr->children.find(ch) == curr->children.end()) {
    86 return false;
    @@ -494,8 +484,7 @@ Here is the call graph for this function:
    bool data_structures::trie_using_hashmap::Trie::startwith ( - const std::string &  - prefix) + const std::string & prefix) @@ -517,7 +506,7 @@ Here is the call graph for this function:
    false if not found
    107 {
    -
    108 std::shared_ptr<Node> curr = root_node;
    +
    108 std::shared_ptr<Node> curr = root_node;
    109 for (char ch : prefix) {
    110 if (curr->children.find(ch) == curr->children.end()) {
    111 return false;
    @@ -565,7 +554,7 @@ Here is the call graph for this function:
    diff --git a/d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html b/d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html index a791d5cfb..c2e762df0 100644 --- a/d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html +++ b/d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: machine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -105,11 +107,11 @@ $(document).ready(function(){initNavTree('d3/d2a/structmachine__learning_1_1ayst

    Custom comparator for open_list. - More...

    + More...

    - +

    Public Member Functions

    bool operator() (const std::shared_ptr< Info > &a, const std::shared_ptr< Info > &b) const
    bool operator() (const std::shared_ptr< Info > &a, const std::shared_ptr< Info > &b) const
     

    Detailed Description

    @@ -130,19 +132,12 @@ template<typename Puzzle >
    bool machine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator::operator() ( - const std::shared_ptr< Info > &  - a, + const std::shared_ptr< Info > & a, - const std::shared_ptr< Info > &  - b  - - - - ) - const + const std::shared_ptr< Info > & b ) const @@ -166,7 +161,7 @@ template<typename Puzzle >
    diff --git a/d3/d39/manacher__algorithm_8cpp.html b/d3/d39/manacher__algorithm_8cpp.html index 2eb804ec7..a5a27211f 100644 --- a/d3/d39/manacher__algorithm_8cpp.html +++ b/d3/d39/manacher__algorithm_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: strings/manacher_algorithm.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,13 +129,13 @@ Namespaces - + - + - +

    Functions

    std::string strings::manacher::manacher (const std::string &prototype)
    std::string strings::manacher::manacher (const std::string &prototype)
     A function that implements Manacher's algorithm.
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -150,8 +152,7 @@ Functions int main ( - void  - ) + void ) @@ -160,10 +161,10 @@ Functions

    Main function.

    Returns
    0 on exit
    171 {
    -
    172 test(); // run self-test implementations
    +
    172 test(); // run self-test implementations
    173 return 0;
    174}
    -
    test
    static void test()
    Self-test implementations.
    Definition manacher_algorithm.cpp:150
    +
    test
    static void test()
    Self-test implementations.
    Definition manacher_algorithm.cpp:150
    Here is the call graph for this function:
    @@ -181,8 +182,7 @@ Here is the call graph for this function:
    std::string strings::manacher::manacher ( - const std::string &  - prototype) + const std::string & prototype) @@ -219,7 +219,7 @@ Here is the call graph for this function:
    60 // substring which would be considered as the larger
    61 // palindrome, having symmetric halves
    62
    -
    63 uint64_t right = 0; // this is the maximum length of the palindrome
    +
    63 uint64_t right = 0; // this is the maximum length of the palindrome
    64 // from 'bigger_center' to the rightmost end
    65
    66 // i is considered as center lying within one half of the palindrone
    @@ -253,7 +253,7 @@ Here is the call graph for this function:
    94 // to center i
    95 if (i + palindrome_max_half_length[i] > right) {
    96 bigger_center = i;
    -
    97 right = i + palindrome_max_half_length[i];
    +
    97 right = i + palindrome_max_half_length[i];
    98 }
    99 }
    100
    @@ -300,6 +300,7 @@ Here is the call graph for this function:
    141}
    std::end
    T end(T... args)
    +
    std::right
    T right(T... args)
    std::min
    T min(T... args)
    std::string::size
    T size(T... args)
    @@ -323,7 +324,7 @@ Here is the call graph for this function: static void test ( - ) + ) @@ -368,7 +369,7 @@ Here is the call graph for this function: diff --git a/d3/d40/graph__coloring_8cpp.html b/d3/d40/graph__coloring_8cpp.html index 2325f6e1e..dce68027f 100644 --- a/d3/d40/graph__coloring_8cpp.html +++ b/d3/d40/graph__coloring_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: backtracking/graph_coloring.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,18 +129,18 @@ Namespaces

    Functions

    template<size_t V> -void backtracking::graph_coloring::printSolution (const std::array< int, V > &color) +void backtracking::graph_coloring::printSolution (const std::array< int, V > &color)  A utility function to print the solution.
      template<size_t V> -bool backtracking::graph_coloring::isSafe (int v, const std::array< std::array< int, V >, V > &graph, const std::array< int, V > &color, int c) +bool backtracking::graph_coloring::isSafe (int v, const std::array< std::array< int, V >, V > &graph, const std::array< int, V > &color, int c)  Utility function to check if the current color assignment is safe for vertex v.
      template<size_t V> -void backtracking::graph_coloring::graphColoring (const std::array< std::array< int, V >, V > &graph, int m, std::array< int, V > color, int v) +void backtracking::graph_coloring::graphColoring (const std::array< std::array< int, V >, V > &graph, int m, std::array< int, V > color, int v)  Recursive utility function to solve m coloring problem.
      -int main () +int main ()  Main function.
      @@ -160,31 +162,22 @@ template<size_t V>
    void backtracking::graph_coloring::graphColoring ( - const std::array< std::array< int, V >, V > &  - graph, + const std::array< std::array< int, V >, V > & graph, - int  - m, + int m, - std::array< int, V >  - color, + std::array< int, V > color, - int  - v  - - - - ) - + int v )
    @@ -247,31 +240,22 @@ template<size_t V>
    bool backtracking::graph_coloring::isSafe ( - int  - v, + int v, - const std::array< std::array< int, V >, V > &  - graph, + const std::array< std::array< int, V >, V > & graph, - const std::array< int, V > &  - color, + const std::array< int, V > & color, - int  - c  - - - - ) - + int c )
    @@ -320,8 +304,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -363,8 +346,7 @@ template<size_t V> void backtracking::graph_coloring::printSolution ( - const std::array< int, V > &  - color) + const std::array< int, V > & color) @@ -405,7 +387,7 @@ Here is the call graph for this function: diff --git a/d3/d4c/quick__sort__3_8cpp.html b/d3/d4c/quick__sort__3_8cpp.html index 351f710d7..b1bcb3b8c 100644 --- a/d3/d4c/quick__sort__3_8cpp.html +++ b/d3/d4c/quick__sort__3_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/quick_sort_3.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -131,11 +133,11 @@ Functions template<typename T > std::vector< T > sorting::quicksort (std::vector< T > arr, int32_t low, int32_t high)   -static void test_int () +static void test_int ()   -static void test_double () +static void test_double ()   -int main () +int main ()  

    Detailed Description

    @@ -153,8 +155,7 @@ Functions int main ( - void  - ) + void ) @@ -162,12 +163,12 @@ Functions

    Driver program for above functions

    184 {
    185 std::srand(std::time(nullptr));
    -
    186 test_int();
    -
    187 test_double();
    +
    186 test_int();
    +
    187 test_double();
    188 return 0;
    189}
    -
    test_int
    static void test_int()
    Definition quick_sort_3.cpp:138
    -
    test_double
    static void test_double()
    Definition quick_sort_3.cpp:160
    +
    test_int
    static void test_int()
    Definition quick_sort_3.cpp:138
    +
    test_double
    static void test_double()
    Definition quick_sort_3.cpp:160
    std::srand
    T srand(T... args)
    std::time
    T time(T... args)
    @@ -190,7 +191,7 @@ Here is the call graph for this function:
    static void test_double ( - ) + ) @@ -250,7 +251,7 @@ Here is the call graph for this function:
    static void test_int ( - ) + ) @@ -295,7 +296,7 @@ Here is the call graph for this function: diff --git a/d3/d4c/xor__cipher_8cpp.html b/d3/d4c/xor__cipher_8cpp.html index 2e15e0efe..b14a87a13 100644 --- a/d3/d4c/xor__cipher_8cpp.html +++ b/d3/d4c/xor__cipher_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ciphers/xor_cipher.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,13 +128,13 @@ Namespaces - + - + - + - +

    Functions

    std::string ciphers::XOR::encrypt (const std::string &text, const int &key)
    std::string ciphers::XOR::encrypt (const std::string &text, const int &key)
     
    std::string ciphers::XOR::decrypt (const std::string &text, const int &key)
    std::string ciphers::XOR::decrypt (const std::string &text, const int &key)
     
    void test ()
    void test ()
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -160,19 +162,12 @@ Algorithm std::string ciphers::XOR::decrypt ( - const std::string &  - text, + const std::string & text, - const int &  - key  - - - - ) - + const int & key )
    @@ -205,19 +200,12 @@ Algorithm std::string ciphers::XOR::encrypt ( - const std::string &  - text, + const std::string & text, - const int &  - key  - - - - ) - + const int & key )
    @@ -249,8 +237,7 @@ Algorithm int main ( - void  - ) + void ) @@ -258,10 +245,10 @@ Algorithm

    Driver Code

    95 {
    96 // Testing
    -
    97 test();
    +
    97 test();
    98 return 0;
    99}
    -
    test
    void test()
    Definition xor_cipher.cpp:75
    +
    test
    void test()
    Definition xor_cipher.cpp:75
    Here is the call graph for this function:
    @@ -279,7 +266,7 @@ Here is the call graph for this function:
    void test ( - ) + ) @@ -288,16 +275,16 @@ Here is the call graph for this function:
    75 {
    76 // Test 1
    77 std::string text1 = "Whipalsh! : Do watch this movie...";
    -
    78 std::string encrypted1 = ciphers::XOR::encrypt(text1, 17);
    -
    79 std::string decrypted1 = ciphers::XOR::decrypt(encrypted1, 17);
    +
    78 std::string encrypted1 = ciphers::XOR::encrypt(text1, 17);
    +
    79 std::string decrypted1 = ciphers::XOR::decrypt(encrypted1, 17);
    80 assert(text1 == decrypted1);
    81 std::cout << "Original text : " << text1;
    82 std::cout << " , Encrypted text (with key = 17) : " << encrypted1;
    83 std::cout << " , Decrypted text : "<< decrypted1 << std::endl;
    84 // Test 2
    85 std::string text2 = "->Valar M0rghulis<-";
    -
    86 std::string encrypted2 = ciphers::XOR::encrypt(text2, 29);
    -
    87 std::string decrypted2 = ciphers::XOR::decrypt(encrypted2, 29);
    +
    86 std::string encrypted2 = ciphers::XOR::encrypt(text2, 29);
    +
    87 std::string decrypted2 = ciphers::XOR::decrypt(encrypted2, 29);
    88 assert(text2 == decrypted2);
    89 std::cout << "Original text : " << text2;
    90 std::cout << " , Encrypted text (with key = 29) : " << encrypted2;
    @@ -305,8 +292,8 @@ Here is the call graph for this function:
    92}
    std::endl
    T endl(T... args)
    -
    ciphers::XOR::decrypt
    std::string decrypt(const std::string &text, const int &key)
    Definition xor_cipher.cpp:61
    -
    ciphers::XOR::encrypt
    std::string encrypt(const std::string &text, const int &key)
    Definition xor_cipher.cpp:47
    +
    ciphers::XOR::decrypt
    std::string decrypt(const std::string &text, const int &key)
    Definition xor_cipher.cpp:61
    +
    ciphers::XOR::encrypt
    std::string encrypt(const std::string &text, const int &key)
    Definition xor_cipher.cpp:47
    Here is the call graph for this function:
    @@ -321,7 +308,7 @@ Here is the call graph for this function:
    diff --git a/d3/d61/vector__important__functions_8cpp.html b/d3/d61/vector__important__functions_8cpp.html index 472ade116..a9d89ad70 100644 --- a/d3/d61/vector__important__functions_8cpp.html +++ b/d3/d61/vector__important__functions_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/vector_important_functions.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -117,7 +119,7 @@ Include dependency graph for vector_important_functions.cpp:
    - +

    Functions

    int main ()
    int main ()
     

    Detailed Description

    @@ -132,8 +134,7 @@ Functions int main ( - void  - ) + void ) @@ -193,7 +194,7 @@ Here is the call graph for this function: diff --git a/d3/d6d/namespacesimpson__method.html b/d3/d6d/namespacesimpson__method.html index e02bb2323..35ca94b8f 100644 --- a/d3/d6d/namespacesimpson__method.html +++ b/d3/d6d/namespacesimpson__method.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: simpson_method Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d3/d6d/namespacesimpson__method.html',

    Contains the Simpson's method implementation. -More...

    +More...

    Detailed Description

    Contains the Simpson's method implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d3/d6d/namespacesimpson__method.html', diff --git a/d3/d7d/brute__force__string__searching_8cpp.html b/d3/d7d/brute__force__string__searching_8cpp.html index e82e90172..d98a918fc 100644 --- a/d3/d7d/brute__force__string__searching_8cpp.html +++ b/d3/d7d/brute__force__string__searching_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: strings/brute_force_string_searching.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,12 +128,12 @@ Namespaces Functions int string_search::brute_force (const std::string &text, const std::string &pattern)   -int main () +int main ()   - +

    Variables

    const std::vector< std::vector< std::string > > test_set
    const std::vector< std::vector< std::string > > test_set
     

    Detailed Description

    @@ -146,16 +148,15 @@ Variables int main ( - void  - ) + void )

    Main function

    47 {
    -
    48 for (const auto &i : test_set) {
    -
    49 int output = brute_force(i[0], i[1]);
    +
    48 for (const auto &i : test_set) {
    +
    49 int output = brute_force(i[0], i[1]);
    50
    51 if (std::to_string(output) == i[2]) {
    52 std::cout << "success\n";
    @@ -166,8 +167,7 @@ Variables
    57 return 0;
    58}
    -
    test_set
    const std::vector< std::vector< std::string > > test_set
    Definition brute_force_string_searching.cpp:41
    -
    string_search::brute_force
    int brute_force(const std::string &text, const std::string &pattern)
    Definition brute_force_string_searching.cpp:21
    +
    test_set
    const std::vector< std::vector< std::string > > test_set
    Definition brute_force_string_searching.cpp:41
    std::to_string
    T to_string(T... args)
    Here is the call graph for this function:
    @@ -207,7 +207,7 @@ Here is the call graph for this function:
    diff --git a/d3/d80/z__function_8cpp.html b/d3/d80/z__function_8cpp.html index a88870fbb..ddd358fd9 100644 --- a/d3/d80/z__function_8cpp.html +++ b/d3/d80/z__function_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: strings/z_function.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -117,16 +119,16 @@ Include dependency graph for z_function.cpp:
    - + - + - + - +

    Functions

    std::vector< uint64_t > Z_function (const std::string &pattern)
    std::vector< uint64_t > Z_function (const std::string &pattern)
     for IO operations
     
    std::vector< uint64_t > find_pat_in_text (const std::string &pattern, const std::string &text)
    std::vector< uint64_t > find_pat_in_text (const std::string &pattern, const std::string &text)
     Using Z_function to find a pattern in a text.
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -147,19 +149,12 @@ Functions std::vector< uint64_t > find_pat_in_text ( - const std::string &  - pattern, + const std::string & pattern, - const std::string &  - text  - - - - ) - + const std::string & text )
    @@ -175,7 +170,7 @@ Functions
    Returns
    a vector of starting indexes where pattern is found in the text
    54 {
    55 uint64_t text_length = text.size(), pattern_length = pattern.size();
    -
    56 std::vector<uint64_t> z = Z_function(pattern + '#' + text);
    +
    56 std::vector<uint64_t> z = Z_function(pattern + '#' + text);
    57 std::vector<uint64_t> matching_indexes;
    58
    59 for (uint64_t i = 0; i < text_length; i++) {
    @@ -188,7 +183,7 @@ Functions
    std::vector::push_back
    T push_back(T... args)
    std::string::size
    T size(T... args)
    -
    Z_function
    std::vector< uint64_t > Z_function(const std::string &pattern)
    for IO operations
    Definition z_function.cpp:28
    +
    Z_function
    std::vector< uint64_t > Z_function(const std::string &pattern)
    for IO operations
    Definition z_function.cpp:28
    Here is the call graph for this function:
    @@ -206,8 +201,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -216,10 +210,10 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    93 {
    -
    94 test(); // run self-test implementations
    +
    94 test(); // run self-test implementations
    95 return 0;
    96}
    -
    test
    static void test()
    Self-test implementations.
    Definition z_function.cpp:71
    +
    test
    static void test()
    Self-test implementations.
    Definition z_function.cpp:71
    Here is the call graph for this function:
    @@ -240,7 +234,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -259,7 +253,7 @@ Here is the call graph for this function:
    74 std::string pattern1 = "abc";
    75
    76 // matching_indexes1 gets the indexes where pattern1 exists in text1
    -
    77 std::vector<uint64_t> matching_indexes1 = find_pat_in_text(pattern1, text1);
    +
    77 std::vector<uint64_t> matching_indexes1 = find_pat_in_text(pattern1, text1);
    78 assert((matching_indexes1 == std::vector<uint64_t>{10, 14, 18, 30, 33}));
    79
    80 // corner case
    @@ -267,11 +261,11 @@ Here is the call graph for this function:
    82 std::string pattern2 = "abc";
    83
    84 // matching_indexes2 gets the indexes where pattern2 exists in text2
    -
    85 std::vector<uint64_t> matching_indexes2 = find_pat_in_text(pattern2, text2);
    +
    85 std::vector<uint64_t> matching_indexes2 = find_pat_in_text(pattern2, text2);
    86 assert((matching_indexes2 == std::vector<uint64_t>{}));
    87}
    -
    find_pat_in_text
    std::vector< uint64_t > find_pat_in_text(const std::string &pattern, const std::string &text)
    Using Z_function to find a pattern in a text.
    Definition z_function.cpp:53
    +
    find_pat_in_text
    std::vector< uint64_t > find_pat_in_text(const std::string &pattern, const std::string &text)
    Using Z_function to find a pattern in a text.
    Definition z_function.cpp:53
    Here is the call graph for this function:
    @@ -289,8 +283,7 @@ Here is the call graph for this function:
    std::vector< uint64_t > Z_function ( - const std::string &  - pattern) + const std::string & pattern) @@ -338,7 +331,7 @@ Here is the call graph for this function: diff --git a/d3/d84/word__break_8cpp.html b/d3/d84/word__break_8cpp.html index 923ccad73..f7668d1e8 100644 --- a/d3/d84/word__break_8cpp.html +++ b/d3/d84/word__break_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/word_break.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -129,19 +131,19 @@ Namespaces - + - + - + - + - +

    Functions

    bool dynamic_programming::word_break::exists (const std::string &str, const std::unordered_set< std::string > &strSet)
    bool dynamic_programming::word_break::exists (const std::string &str, const std::unordered_set< std::string > &strSet)
     Function that checks if the string passed in param is present in the the unordered_set passed.
     
    bool dynamic_programming::word_break::check (const std::string &s, const std::unordered_set< std::string > &strSet, int pos, std::vector< int > *dp)
    bool dynamic_programming::word_break::check (const std::string &s, const std::unordered_set< std::string > &strSet, int pos, std::vector< int > *dp)
     Function that checks if the string passed in param can be segmented from position 'pos', and then correctly go on to segment the rest of the string correctly as well to reach a solution.
     
    bool dynamic_programming::word_break::wordBreak (const std::string &s, const std::vector< std::string > &wordDict)
    bool dynamic_programming::word_break::wordBreak (const std::string &s, const std::vector< std::string > &wordDict)
     Function that checks if the string passed in param can be segmented into the strings present in the vector. In others words, it checks if any permutation of strings in the vector can be concatenated to form the final string.
     
    static void test ()
    static void test ()
     Test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -164,31 +166,22 @@ pen apple". Note that you are allowed to reuse a dictionary word.

    bool dynamic_programming::word_break::check ( - const std::string &  - s, + const std::string & s, - const std::unordered_set< std::string > &  - strSet, + const std::unordered_set< std::string > & strSet, - int  - pos, + int pos, - std::vector< int > *  - dp  - - - - ) - + std::vector< int > * dp )
    @@ -233,7 +226,7 @@ pen apple". Note that you are allowed to reuse a dictionary word.

    105 // if the prefix till current position is present in the dictionary
    106 // and the remaining substring can also be segmented legally, then
    107 // set solution at position pos in the memo, and return true
    -
    108 if (exists(wordTillNow, strSet) and check(s, strSet, i + 1, dp)) {
    +
    108 if (exists(wordTillNow, strSet) and check(s, strSet, i + 1, dp)) {
    109 dp->at(pos) = 1;
    110 return true;
    111 }
    @@ -246,8 +239,8 @@ pen apple". Note that you are allowed to reuse a dictionary word.

    dp
    for std::vector
    Definition partition_problem.cpp:39
    std::string::length
    T length(T... args)
    -
    dynamic_programming::word_break::exists
    bool exists(const std::string &str, const std::unordered_set< std::string > &strSet)
    Function that checks if the string passed in param is present in the the unordered_set passed.
    Definition word_break.cpp:60
    -
    dynamic_programming::word_break::check
    bool check(const std::string &s, const std::unordered_set< std::string > &strSet, int pos, std::vector< int > *dp)
    Function that checks if the string passed in param can be segmented from position 'pos',...
    Definition word_break.cpp:80
    +
    dynamic_programming::word_break::exists
    bool exists(const std::string &str, const std::unordered_set< std::string > &strSet)
    Function that checks if the string passed in param is present in the the unordered_set passed.
    Definition word_break.cpp:60
    +
    dynamic_programming::word_break::check
    bool check(const std::string &s, const std::unordered_set< std::string > &strSet, int pos, std::vector< int > *dp)
    Function that checks if the string passed in param can be segmented from position 'pos',...
    Definition word_break.cpp:80
    Here is the call graph for this function:
    @@ -265,19 +258,12 @@ Here is the call graph for this function:
    bool dynamic_programming::word_break::exists ( - const std::string &  - str, + const std::string & str, - const std::unordered_set< std::string > &  - strSet  - - - - ) - + const std::unordered_set< std::string > & strSet )
    @@ -315,8 +301,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -325,7 +310,7 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    174 {
    -
    175 test(); // call the test function :)
    +
    175 test(); // call the test function :)
    176
    177 // the complete string
    178 const std::string s = "applepenapple";
    @@ -334,14 +319,14 @@ Here is the call graph for this function:
    181
    182 // should return true, as applepenapple can be segmented as apple + pen +
    183 // apple
    -
    184 std::cout << dynamic_programming::word_break::wordBreak(s, wordDict)
    +
    184 std::cout << dynamic_programming::word_break::wordBreak(s, wordDict)
    185 << std::endl;
    186}
    std::endl
    T endl(T... args)
    -
    test
    static void test()
    Test implementations.
    Definition word_break.cpp:156
    -
    dynamic_programming::word_break::wordBreak
    bool wordBreak(const std::string &s, const std::vector< std::string > &wordDict)
    Function that checks if the string passed in param can be segmented into the strings present in the v...
    Definition word_break.cpp:131
    +
    test
    static void test()
    Test implementations.
    Definition word_break.cpp:156
    +
    dynamic_programming::word_break::wordBreak
    bool wordBreak(const std::string &s, const std::vector< std::string > &wordDict)
    Function that checks if the string passed in param can be segmented into the strings present in the v...
    Definition word_break.cpp:131
    Here is the call graph for this function:
    @@ -362,7 +347,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -385,7 +370,7 @@ Here is the call graph for this function:
    163
    164 // should return true, as applepenapple can be segmented as apple + pen +
    165 // apple
    -
    166 std::cout << dynamic_programming::word_break::wordBreak(s, wordDict)
    +
    166 std::cout << dynamic_programming::word_break::wordBreak(s, wordDict)
    167 << std::endl;
    168 std::cout << "Test implementation passed!\n";
    169}
    @@ -406,19 +391,12 @@ Here is the call graph for this function: bool dynamic_programming::word_break::wordBreak ( - const std::string &  - s, + const std::string & s, - const std::vector< std::string > &  - wordDict  - - - - ) - + const std::vector< std::string > & wordDict )
    @@ -449,7 +427,7 @@ Here is the call graph for this function:
    143 // calling check method with position = 0, to check from left
    144 // from where can be start segmenting the complete string in correct
    145 // manner
    -
    146 return check(s, strSet, 0, &dp);
    +
    146 return check(s, strSet, 0, &dp);
    147}
    std::unordered_set::insert
    T insert(T... args)
    @@ -467,7 +445,7 @@ Here is the call graph for this function: diff --git a/d3/d91/namespacestrassens__multiplication.html b/d3/d91/namespacestrassens__multiplication.html index 10d83491e..f4bebc950 100644 --- a/d3/d91/namespacestrassens__multiplication.html +++ b/d3/d91/namespacestrassens__multiplication.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: strassens_multiplication Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d3/d91/namespacestrassens__multiplicat

    Namespace for performing strassen's multiplication. -More...

    +More...

    Detailed Description

    Namespace for performing strassen's multiplication.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d3/d91/namespacestrassens__multiplicat diff --git a/d3/d92/pancake__sort_8cpp.html b/d3/d92/pancake__sort_8cpp.html index 7aaa42c5c..d7a3be1eb 100644 --- a/d3/d92/pancake__sort_8cpp.html +++ b/d3/d92/pancake__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/pancake_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,17 +130,17 @@ Namespaces

    Functions

    template<typename T > -void sorting::pancake_sort::reverse (std::vector< T > &arr, int start, int end) +void sorting::pancake_sort::reverse (std::vector< T > &arr, int start, int end)  This implementation is for reversing elements in a a C-style array .
      template<typename T > -int sorting::pancake_sort::pancakeSort (std::vector< T > &arr, int size) +int sorting::pancake_sort::pancakeSort (std::vector< T > &arr, int size)  This implementation is for a C-style array input that gets modified in place.
      -static void test () +static void test ()  Test implementations.
      -int main () +int main ()  Main function.
      @@ -158,8 +160,7 @@ related int main ( - void  - ) + void ) @@ -168,10 +169,10 @@ related
    Returns
    0 on exit
    128 {
    -
    129 test();
    +
    129 test();
    130 return 0;
    131}
    -
    test
    static void test()
    Test implementations.
    Definition pancake_sort.cpp:86
    +
    test
    static void test()
    Test implementations.
    Definition pancake_sort.cpp:86
    Here is the call graph for this function:
    @@ -191,19 +192,12 @@ template<typename T >
    int sorting::pancake_sort::pancakeSort ( - std::vector< T > &  - arr, + std::vector< T > & arr, - int  - size  - - - - ) - + int size )
    @@ -255,25 +249,17 @@ template<typename T >
    void sorting::pancake_sort::reverse ( - std::vector< T > &  - arr, + std::vector< T > & arr, - int  - start, + int start, - int  - end  - - - - ) - + int end )
    @@ -314,7 +300,7 @@ template<typename T >
    static void test ( - ) + ) @@ -332,7 +318,7 @@ template<typename T >
    88 const int size1 = 7;
    89 std::cout << "\nTest 1- as std::vector<int>...";
    90 std::vector<int> arr1 = {23, 10, 20, 11, 12, 6, 7};
    -
    91 sorting::pancake_sort::pancakeSort(arr1, size1);
    +
    91 sorting::pancake_sort::pancakeSort(arr1, size1);
    92 assert(std::is_sorted(arr1.begin(), arr1.end()));
    93 std::cout << "Passed\n";
    94 for (int i = 0; i < size1; i++) {
    @@ -345,7 +331,7 @@ template<typename T >
    101 std::cout << "\nTest 2- as std::vector<double>...";
    102 std::vector<double> arr2 = {23.56, 10.62, 200.78, 111.484,
    103 3.9, 1.2, 61.77, 79.6};
    -
    104 sorting::pancake_sort::pancakeSort(arr2, size2);
    +
    104 sorting::pancake_sort::pancakeSort(arr2, size2);
    105 assert(std::is_sorted(arr2.begin(), arr2.end()));
    106 std::cout << "Passed\n";
    107 for (int i = 0; i < size2; i++) {
    @@ -357,7 +343,7 @@ template<typename T >
    113 const int size3 = 7;
    114 std::cout << "\nTest 3- as std::vector<float>...";
    115 std::vector<float> arr3 = {6.56, 12.62, 200.78, 768.484, 19.27, 68.87, 9.6};
    -
    116 sorting::pancake_sort::pancakeSort(arr3, size3);
    +
    116 sorting::pancake_sort::pancakeSort(arr3, size3);
    117 assert(std::is_sorted(arr3.begin(), arr3.end()));
    118 std::cout << "Passed\n";
    119 for (int i = 0; i < size3; i++) {
    @@ -369,7 +355,7 @@ template<typename T >
    std::vector::begin
    T begin(T... args)
    std::endl
    T endl(T... args)
    std::is_sorted
    T is_sorted(T... args)
    -
    sorting::pancake_sort::pancakeSort
    int pancakeSort(std::vector< T > &arr, int size)
    This implementation is for a C-style array input that gets modified in place.
    Definition pancake_sort.cpp:61
    +
    sorting::pancake_sort::pancakeSort
    int pancakeSort(std::vector< T > &arr, int size)
    This implementation is for a C-style array input that gets modified in place.
    Definition pancake_sort.cpp:61
    Here is the call graph for this function:
    @@ -385,7 +371,7 @@ Here is the call graph for this function: diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html index 2b45779cc..d7527adc1 100644 --- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html +++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures::tree_234::Tree234 Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('d3/d95/classdata__structures_1_1tree__

    2-3-4 tree class - More...

    + More...

    Collaboration diagram for data_structures::tree_234::Tree234:
    @@ -128,76 +130,76 @@ Public Member Functions Tree234 & operator= (const Tree234 &&)=delete   -void Insert (int64_t item) +void Insert (int64_t item)  Insert item to tree.
      -bool Remove (int64_t item) +bool Remove (int64_t item)  Remove item from tree.
      -void Traverse () +void Traverse ()  In-order traverse.
      -void Print (const char *file_name=nullptr) +void Print (const char *file_name=nullptr)  Print tree into a dot file.
      - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - +

    Private Member Functions

    void InsertPreSplit (int64_t item)
    void InsertPreSplit (int64_t item)
     A insert implementation of pre-split.
     
    void InsertPostMerge (int64_t item)
    void InsertPostMerge (int64_t item)
     A insert implementation of post-merge.
     
    Node * Insert (Node *tree, int64_t item)
    Node * Insert (Node *tree, int64_t item)
     A helper function used by post-merge insert.
     
    Node * MergeNode (Node *dst_node, Node *node)
    Node * MergeNode (Node *dst_node, Node *node)
     A helper function used during post-merge insert.
     
    void MergeNodeNotFull (Node *dst_node, Node *node)
    void MergeNodeNotFull (Node *dst_node, Node *node)
     Merge node to a not-full target node.
     
    Node * SplitNode (Node *node)
    Node * SplitNode (Node *node)
     Split a 4-node to 1 parent and 2 children, and return the parent node.
     
    int64_t GetTreeMaxItem (Node *tree)
    int64_t GetTreeMaxItem (Node *tree)
     Get the max item of the tree.
     
    int64_t GetTreeMinItem (Node *tree)
    int64_t GetTreeMinItem (Node *tree)
     Get the min item of the tree.
     
    bool TryLeftRotate (Node *parent, Node *to_child)
    bool TryLeftRotate (Node *parent, Node *to_child)
     A handy function to try if we can do a left rotate to the target node.
     
    bool TryRightRotate (Node *parent, Node *to_child)
    bool TryRightRotate (Node *parent, Node *to_child)
     A handy function to try if we can do a right rotate to the target node.
     
    void RightRotate (Node *parent, int8_t index)
    void RightRotate (Node *parent, int8_t index)
     Do the actual right rotate operation.
     
    void LeftRotate (Node *parent, int8_t index)
    void LeftRotate (Node *parent, int8_t index)
     Do the actual left rotate operation.
     
    bool RemovePreMerge (Node *node, int64_t item)
    bool RemovePreMerge (Node *node, int64_t item)
     Main function implement the pre-merge remove operation.
     
    Node * Merge (Node *parent, int8_t index)
    Node * Merge (Node *parent, int8_t index)
     Merge the item at index of the parent node, and its left and right child.
     
    void DeleteNode (Node *tree)
    void DeleteNode (Node *tree)
     Recursive release the tree.
     
    void Traverse (Node *tree)
    void Traverse (Node *tree)
     In-order traverse the tree, print items.
     
    void PrintNode (std::ofstream &ofs, Node *node, int64_t parent_index, int64_t index, int8_t parent_child_index)
    void PrintNode (std::ofstream &ofs, Node *node, int64_t parent_index, int64_t index, int8_t parent_child_index)
     Print the tree to a dot file. You can convert it to picture with graphviz.
     
    - +

    Private Attributes

    Node * root_ {nullptr}
    Node * root_ {nullptr}
     root node of the tree
     
    @@ -213,14 +215,14 @@ Private Attributes data_structures::tree_234::Tree234::~Tree234 ( - ) + )
    -
    541{ DeleteNode(root_); }
    -
    data_structures::tree_234::Tree234::DeleteNode
    void DeleteNode(Node *tree)
    Recursive release the tree.
    Definition tree_234.cpp:547
    -
    data_structures::tree_234::Tree234::root_
    Node * root_
    root node of the tree
    Definition tree_234.cpp:538
    +
    541{ DeleteNode(root_); }
    +
    data_structures::tree_234::Tree234::DeleteNode
    void DeleteNode(Node *tree)
    Recursive release the tree.
    Definition tree_234.cpp:547
    +
    data_structures::tree_234::Tree234::root_
    Node * root_
    root node of the tree
    Definition tree_234.cpp:538
    @@ -237,8 +239,7 @@ Private Attributes void data_structures::tree_234::Tree234::DeleteNode ( - Node *  - tree) + Node * tree) @@ -261,7 +262,7 @@ Private Attributes
    549 return;
    550 }
    551 for (int8_t i = 0; i <= tree->GetCount(); i++) {
    -
    552 DeleteNode(tree->GetChild(i));
    +
    552 DeleteNode(tree->GetChild(i));
    553 }
    554
    555 delete tree;
    @@ -286,8 +287,7 @@ Here is the call graph for this function:
    int64_t data_structures::tree_234::Tree234::GetTreeMaxItem ( - Node *  - tree) + Node * tree) @@ -338,8 +338,7 @@ Here is the call graph for this function:
    int64_t data_structures::tree_234::Tree234::GetTreeMinItem ( - Node *  - tree) + Node * tree) @@ -387,8 +386,7 @@ Here is the call graph for this function: void data_structures::tree_234::Tree234::Insert ( - int64_t  - item) + int64_t item) @@ -401,8 +399,8 @@ Here is the call graph for this function: -
    655{ InsertPreSplit(item); }
    -
    data_structures::tree_234::Tree234::InsertPreSplit
    void InsertPreSplit(int64_t item)
    A insert implementation of pre-split.
    Definition tree_234.cpp:585
    +
    655{ InsertPreSplit(item); }
    +
    data_structures::tree_234::Tree234::InsertPreSplit
    void InsertPreSplit(int64_t item)
    A insert implementation of pre-split.
    Definition tree_234.cpp:585
    Here is the call graph for this function:
    @@ -423,19 +421,12 @@ Here is the call graph for this function:
    Node * data_structures::tree_234::Tree234::Insert ( - Node *  - tree, + Node * tree, - int64_t  - item  - - - - ) - + int64_t item ) @@ -466,19 +457,19 @@ Here is the call graph for this function:
    672
    673 Node *next_node = tree->GetNextPossibleChild(item);
    674 if (next_node) {
    -
    675 split_node.reset(Insert(next_node, item));
    +
    675 split_node.reset(Insert(next_node, item));
    676 } else {
    677 split_node.reset(new Node(item));
    678 }
    679
    680 if (split_node) {
    -
    681 return MergeNode(tree, split_node.get());
    +
    681 return MergeNode(tree, split_node.get());
    682 }
    683
    684 return nullptr;
    685}
    -
    data_structures::tree_234::Tree234::MergeNode
    Node * MergeNode(Node *dst_node, Node *node)
    A helper function used during post-merge insert.
    Definition tree_234.cpp:700
    -
    data_structures::tree_234::Tree234::Insert
    void Insert(int64_t item)
    Insert item to tree.
    Definition tree_234.cpp:655
    +
    data_structures::tree_234::Tree234::MergeNode
    Node * MergeNode(Node *dst_node, Node *node)
    A helper function used during post-merge insert.
    Definition tree_234.cpp:700
    +
    data_structures::tree_234::Tree234::Insert
    void Insert(int64_t item)
    Insert item to tree.
    Definition tree_234.cpp:655
    std::unique_ptr::get
    T get(T... args)
    std::unique_ptr::reset
    T reset(T... args)
    Node
    Definition linkedlist_implentation_usingarray.cpp:14
    @@ -503,8 +494,7 @@ Here is the call graph for this function: void data_structures::tree_234::Tree234::InsertPostMerge ( - int64_t  - item) + int64_t item) @@ -523,16 +513,16 @@ Here is the call graph for this function:
    637 {
    -
    638 if (!root_) {
    -
    639 root_ = new Node(item);
    +
    638 if (!root_) {
    +
    639 root_ = new Node(item);
    640 return;
    641 }
    642
    -
    643 Node *split_node = Insert(root_, item);
    +
    643 Node *split_node = Insert(root_, item);
    644
    645 // if root has split, then update root_
    646 if (split_node) {
    -
    647 root_ = split_node;
    +
    647 root_ = split_node;
    648 }
    649}
    @@ -555,8 +545,7 @@ Here is the call graph for this function:
    void data_structures::tree_234::Tree234::InsertPreSplit ( - int64_t  - item) + int64_t item) @@ -575,18 +564,18 @@ Here is the call graph for this function:
    585 {
    -
    586 if (!root_) {
    -
    587 root_ = new Node(item);
    +
    586 if (!root_) {
    +
    587 root_ = new Node(item);
    588 return;
    589 }
    590
    591 Node *parent = nullptr;
    -
    592 Node *node = root_;
    +
    592 Node *node = root_;
    593
    594 while (true) {
    595 if (!node) {
    596 std::unique_ptr<Node> tmp(new Node(item));
    -
    597 MergeNodeNotFull(parent, tmp.get());
    +
    597 MergeNodeNotFull(parent, tmp.get());
    598 return;
    599 }
    600
    @@ -595,7 +584,7 @@ Here is the call graph for this function:
    603 }
    604
    605 if (node->IsFull()) {
    -
    606 node = SplitNode(node);
    +
    606 node = SplitNode(node);
    607
    608 Node *cur_node = nullptr;
    609
    @@ -608,21 +597,22 @@ Here is the call graph for this function:
    616 if (!parent) {
    617 // for the root node parent is nullptr, we simply assign the
    618 // split parent to root_
    -
    619 root_ = node;
    +
    619 root_ = node;
    620 } else {
    621 // merge the split parent to its origin parent
    -
    622 MergeNodeNotFull(parent, node);
    +
    622 MergeNodeNotFull(parent, node);
    623 }
    624
    625 node = cur_node;
    626 }
    627
    -
    628 parent = node;
    +
    628 parent = node;
    629 node = parent->GetNextPossibleChild(item);
    630 }
    631}
    -
    data_structures::tree_234::Tree234::SplitNode
    Node * SplitNode(Node *node)
    Split a 4-node to 1 parent and 2 children, and return the parent node.
    Definition tree_234.cpp:745
    -
    data_structures::tree_234::Tree234::MergeNodeNotFull
    void MergeNodeNotFull(Node *dst_node, Node *node)
    Merge node to a not-full target node.
    Definition tree_234.cpp:730
    +
    node
    struct node { int data; int height; struct node *left; struct node *right;} node
    for std::queue
    Definition avltree.cpp:13
    +
    data_structures::tree_234::Tree234::SplitNode
    Node * SplitNode(Node *node)
    Split a 4-node to 1 parent and 2 children, and return the parent node.
    Definition tree_234.cpp:745
    +
    data_structures::tree_234::Tree234::MergeNodeNotFull
    void MergeNodeNotFull(Node *dst_node, Node *node)
    Merge node to a not-full target node.
    Definition tree_234.cpp:730
    node
    Definition binary_search_tree.cpp:11
    Here is the call graph for this function:
    @@ -644,19 +634,12 @@ Here is the call graph for this function: void data_structures::tree_234::Tree234::LeftRotate ( - Node *  - parent, + Node * parent, - int8_t  - index  - - - - ) - + int8_t index ) @@ -667,7 +650,7 @@ Here is the call graph for this function:

    Do the actual left rotate operation.

    -

    Given parent node, and the pivot item index, the left rotate operation is uniquely identified. The function assume the requirements are fulfilled and won't do any extra check. This function is call by TryLeftRotate(), and the condition checking should be done before call it.

    +

    Given parent node, and the pivot item index, the left rotate operation is uniquely identified. The function assume the requirements are fulfilled and won't do any extra check. This function is call by TryLeftRotate(), and the condition checking should be done before call it.

    Parameters
    @@ -677,16 +660,17 @@ Here is the call graph for this function:
    869 {
    870 Node *left = parent->GetItemLeftChild(index);
    -
    871 Node *right = parent->GetItemRightChild(index);
    +
    871 Node *right = parent->GetItemRightChild(index);
    872
    -
    873 assert(right && right->Is34Node());
    +
    873 assert(right && right->Is34Node());
    874 assert(left && left->Is2Node());
    875
    876 left->InsertItemByIndex(left->GetCount(), parent->GetItem(index),
    -
    877 right->GetLeftmostChild(), false);
    -
    878 parent->SetItem(index, right->GetMinItem());
    -
    879 right->RemoveItemByIndex(0, false);
    +
    877 right->GetLeftmostChild(), false);
    +
    878 parent->SetItem(index, right->GetMinItem());
    +
    879 right->RemoveItemByIndex(0, false);
    880}
    +
    std::right
    T right(T... args)
    @@ -702,19 +686,12 @@ Here is the call graph for this function: - - + - - - - - - - +
    parentthe parent node in this right rotate operation
    Node * data_structures::tree_234::Tree234::Merge (Node * parent, Node * parent,
    int8_t index 
    )int8_t index )
    @@ -782,19 +759,12 @@ Here is the call graph for this function:
    Node * data_structures::tree_234::Tree234::MergeNode ( - Node *  - dst_node, + Node * dst_node, - Node *  - node  - - - - ) - + Node * node ) @@ -818,17 +788,17 @@ Here is the call graph for this function:
    701 assert(dst_node != nullptr && node != nullptr);
    702
    703 if (!dst_node->IsFull()) {
    -
    704 MergeNodeNotFull(dst_node, node);
    +
    704 MergeNodeNotFull(dst_node, node);
    705 return nullptr;
    706 }
    707
    -
    708 dst_node = SplitNode(dst_node);
    +
    708 dst_node = SplitNode(dst_node);
    709
    710 if (node->GetItem(0) < dst_node->GetItem(0)) {
    -
    711 MergeNodeNotFull(dst_node->GetChild(0), node);
    +
    711 MergeNodeNotFull(dst_node->GetChild(0), node);
    712
    713 } else {
    -
    714 MergeNodeNotFull(dst_node->GetChild(1), node);
    +
    714 MergeNodeNotFull(dst_node->GetChild(1), node);
    715 }
    716
    717 return dst_node;
    @@ -853,19 +823,12 @@ Here is the call graph for this function: void data_structures::tree_234::Tree234::MergeNodeNotFull ( - Node *  - dst_node, + Node * dst_node, - Node *  - node  - - - - ) - + Node * node ) @@ -909,8 +872,7 @@ Here is the call graph for this function: void data_structures::tree_234::Tree234::Print ( - const char *  - file_name = nullptr) + const char * file_name = nullptr) @@ -947,19 +909,19 @@ Here is the call graph for this function:
    1149 /** @brief This is a helper structure to do a level order traversal to print
    1150 * the tree. */
    1151 struct NodeInfo {
    -
    1152 Node *node; ///< tree node
    +
    1152 Node *node; ///< tree node
    1153 int64_t index; ///< node index of level order that used when draw the
    1154 ///< link between child and parent
    1155 };
    1156
    1157 std::queue<NodeInfo> q;
    1158
    -
    1159 if (root_) {
    +
    1159 if (root_) {
    1160 // print root node
    -
    1161 PrintNode(ofs, root_, -1, index, 0);
    +
    1161 PrintNode(ofs, root_, -1, index, 0);
    1162
    1163 NodeInfo ni{};
    -
    1164 ni.node = root_;
    +
    1164 ni.node = root_;
    1165 ni.index = index;
    1166
    1167 q.push(ni);
    @@ -972,13 +934,13 @@ Here is the call graph for this function:
    1174
    1175 if (!node_info.node->IsLeaf()) {
    1176 if (node_info.node->GetCount() > 0) {
    -
    1177 PrintNode(ofs, node_info.node->GetChild(0), node_info.index,
    +
    1177 PrintNode(ofs, node_info.node->GetChild(0), node_info.index,
    1178 ++index, 0);
    1179 ni.node = node_info.node->GetChild(0);
    1180 ni.index = index;
    1181 q.push(ni);
    1182
    -
    1183 PrintNode(ofs, node_info.node->GetChild(1), node_info.index,
    +
    1183 PrintNode(ofs, node_info.node->GetChild(1), node_info.index,
    1184 ++index, 1);
    1185 ni.node = node_info.node->GetChild(1);
    1186 ni.index = index;
    @@ -986,7 +948,7 @@ Here is the call graph for this function:
    1188 }
    1189
    1190 if (node_info.node->GetCount() > 1) {
    -
    1191 PrintNode(ofs, node_info.node->GetChild(2), node_info.index,
    +
    1191 PrintNode(ofs, node_info.node->GetChild(2), node_info.index,
    1192 ++index, 2);
    1193 ni.node = node_info.node->GetChild(2);
    1194 ni.index = index;
    @@ -994,7 +956,7 @@ Here is the call graph for this function:
    1196 }
    1197
    1198 if (node_info.node->GetCount() > 2) {
    -
    1199 PrintNode(ofs, node_info.node->GetChild(3), node_info.index,
    +
    1199 PrintNode(ofs, node_info.node->GetChild(3), node_info.index,
    1200 ++index, 3);
    1201 ni.node = node_info.node->GetChild(3);
    1202 ni.index = index;
    @@ -1009,7 +971,7 @@ Here is the call graph for this function:
    1211}
    -
    data_structures::tree_234::Tree234::PrintNode
    void PrintNode(std::ofstream &ofs, Node *node, int64_t parent_index, int64_t index, int8_t parent_child_index)
    Print the tree to a dot file. You can convert it to picture with graphviz.
    Definition tree_234.cpp:1226
    +
    data_structures::tree_234::Tree234::PrintNode
    void PrintNode(std::ofstream &ofs, Node *node, int64_t parent_index, int64_t index, int8_t parent_child_index)
    Print the tree to a dot file. You can convert it to picture with graphviz.
    Definition tree_234.cpp:1226
    std::ofstream::close
    T close(T... args)
    std::endl
    T endl(T... args)
    std::ofstream::open
    T open(T... args)
    @@ -1034,37 +996,27 @@ Here is the call graph for this function: void data_structures::tree_234::Tree234::PrintNode ( - std::ofstream &  - ofs, + std::ofstream & ofs, - Node *  - node, + Node * node, - int64_t  - parent_index, + int64_t parent_index, - int64_t  - index, + int64_t index, - int8_t  - parent_child_index  - - - - ) - + int8_t parent_child_index ) @@ -1127,8 +1079,7 @@ Here is the call graph for this function: bool data_structures::tree_234::Tree234::Remove ( - int64_t  - item) + int64_t item) @@ -1142,8 +1093,8 @@ Here is the call graph for this function:
    Returns
    true if item found and removed, false otherwise
    -
    929{ return RemovePreMerge(root_, item); }
    -
    data_structures::tree_234::Tree234::RemovePreMerge
    bool RemovePreMerge(Node *node, int64_t item)
    Main function implement the pre-merge remove operation.
    Definition tree_234.cpp:937
    +
    929{ return RemovePreMerge(root_, item); }
    +
    data_structures::tree_234::Tree234::RemovePreMerge
    bool RemovePreMerge(Node *node, int64_t item)
    Main function implement the pre-merge remove operation.
    Definition tree_234.cpp:937
    Here is the call graph for this function:
    @@ -1164,19 +1115,12 @@ Here is the call graph for this function:
    bool data_structures::tree_234::Tree234::RemovePreMerge ( - Node *  - node, + Node * node, - int64_t  - item  - - - - ) - + int64_t item ) @@ -1201,8 +1145,8 @@ Here is the call graph for this function:
    940 if (node->Contains(item)) {
    941 if (node->Is2Node()) {
    942 // node must be root
    -
    943 delete node;
    -
    944 root_ = nullptr;
    +
    943 delete node;
    +
    944 root_ = nullptr;
    945 } else {
    946 node->RemoveItemByIndex(node->GetItemIndex(item), true);
    947 }
    @@ -1250,10 +1194,10 @@ Here is the call graph for this function:
    989 // this means we can't avoid merging the target item into
    990 // next layer, and this will cause us do different process
    991 // compared with other cases
    -
    992 Node *new_root = Merge(node, index);
    -
    993 delete root_;
    -
    994 root_ = new_root;
    -
    995 node = root_;
    +
    992 Node *new_root = Merge(node, index);
    +
    993 delete root_;
    +
    994 root_ = new_root;
    +
    995 node = root_;
    996
    997 // now node point to the
    998 continue;
    @@ -1269,7 +1213,7 @@ Here is the call graph for this function:
    1008 // rotate
    1009 Node *left_sibling = node->GetItemLeftChild(index - 1);
    1010 if (left_sibling->Is34Node()) {
    -
    1011 RightRotate(node, index - 1);
    +
    1011 RightRotate(node, index - 1);
    1012 break;
    1013 }
    1014 }
    @@ -1280,7 +1224,7 @@ Here is the call graph for this function:
    1019 Node *right_sibling =
    1020 node->GetItemRightChild(index + 1);
    1021 if (right_sibling->Is34Node()) {
    -
    1022 LeftRotate(node, index + 1);
    +
    1022 LeftRotate(node, index + 1);
    1023 break;
    1024 }
    1025 }
    @@ -1288,11 +1232,11 @@ Here is the call graph for this function:
    1027 // we do a merge. We avoid merging the target item, which
    1028 // may trigger another merge in the recursion process.
    1029 if (index > 0) {
    -
    1030 Merge(node, index - 1);
    +
    1030 Merge(node, index - 1);
    1031 break;
    1032 }
    1033
    -
    1034 Merge(node, index + 1);
    +
    1034 Merge(node, index + 1);
    1035
    1036 } while (false);
    1037 }
    @@ -1303,7 +1247,7 @@ Here is the call graph for this function:
    1042 right_child = node->GetItemRightChild(index);
    1043
    1044 if (left_child->Is34Node()) {
    -
    1045 int64_t predecessor_item = GetTreeMaxItem(left_child);
    +
    1045 int64_t predecessor_item = GetTreeMaxItem(left_child);
    1046 node->SetItem(node->GetItemIndex(item), predecessor_item);
    1047
    1048 node = left_child;
    @@ -1312,7 +1256,7 @@ Here is the call graph for this function:
    1051 }
    1052
    1053 if (right_child->Is34Node()) {
    -
    1054 int64_t successor_item = GetTreeMinItem(right_child);
    +
    1054 int64_t successor_item = GetTreeMinItem(right_child);
    1055 node->SetItem(node->GetItemIndex(item), successor_item);
    1056 node = right_child;
    1057 item = successor_item;
    @@ -1327,12 +1271,12 @@ Here is the call graph for this function:
    1066 continue;
    1067 }
    1068
    -
    1069 if (TryRightRotate(node, next_node)) {
    +
    1069 if (TryRightRotate(node, next_node)) {
    1070 node = next_node;
    1071 continue;
    1072 }
    1073
    -
    1074 if (TryLeftRotate(node, next_node)) {
    +
    1074 if (TryLeftRotate(node, next_node)) {
    1075 node = next_node;
    1076 continue;
    1077 }
    @@ -1341,22 +1285,22 @@ Here is the call graph for this function:
    1080 // 2-node, so we do merge
    1081 int8_t child_index = node->GetChildIndex(next_node);
    1082 if (child_index > 0) {
    -
    1083 node = Merge(node, child_index - 1);
    +
    1083 node = Merge(node, child_index - 1);
    1084 } else {
    -
    1085 node = Merge(node, child_index);
    +
    1085 node = Merge(node, child_index);
    1086 }
    1087
    1088 } // while
    1089
    1090 return false;
    1091}
    -
    data_structures::tree_234::Tree234::Merge
    Node * Merge(Node *parent, int8_t index)
    Merge the item at index of the parent node, and its left and right child.
    Definition tree_234.cpp:895
    -
    data_structures::tree_234::Tree234::GetTreeMinItem
    int64_t GetTreeMinItem(Node *tree)
    Get the min item of the tree.
    Definition tree_234.cpp:1115
    -
    data_structures::tree_234::Tree234::TryLeftRotate
    bool TryLeftRotate(Node *parent, Node *to_child)
    A handy function to try if we can do a left rotate to the target node.
    Definition tree_234.cpp:778
    -
    data_structures::tree_234::Tree234::GetTreeMaxItem
    int64_t GetTreeMaxItem(Node *tree)
    Get the max item of the tree.
    Definition tree_234.cpp:1098
    -
    data_structures::tree_234::Tree234::LeftRotate
    void LeftRotate(Node *parent, int8_t index)
    Do the actual left rotate operation.
    Definition tree_234.cpp:869
    -
    data_structures::tree_234::Tree234::RightRotate
    void RightRotate(Node *parent, int8_t index)
    Do the actual right rotate operation.
    Definition tree_234.cpp:845
    -
    data_structures::tree_234::Tree234::TryRightRotate
    bool TryRightRotate(Node *parent, Node *to_child)
    A handy function to try if we can do a right rotate to the target node.
    Definition tree_234.cpp:813
    +
    data_structures::tree_234::Tree234::Merge
    Node * Merge(Node *parent, int8_t index)
    Merge the item at index of the parent node, and its left and right child.
    Definition tree_234.cpp:895
    +
    data_structures::tree_234::Tree234::GetTreeMinItem
    int64_t GetTreeMinItem(Node *tree)
    Get the min item of the tree.
    Definition tree_234.cpp:1115
    +
    data_structures::tree_234::Tree234::TryLeftRotate
    bool TryLeftRotate(Node *parent, Node *to_child)
    A handy function to try if we can do a left rotate to the target node.
    Definition tree_234.cpp:778
    +
    data_structures::tree_234::Tree234::GetTreeMaxItem
    int64_t GetTreeMaxItem(Node *tree)
    Get the max item of the tree.
    Definition tree_234.cpp:1098
    +
    data_structures::tree_234::Tree234::LeftRotate
    void LeftRotate(Node *parent, int8_t index)
    Do the actual left rotate operation.
    Definition tree_234.cpp:869
    +
    data_structures::tree_234::Tree234::RightRotate
    void RightRotate(Node *parent, int8_t index)
    Do the actual right rotate operation.
    Definition tree_234.cpp:845
    +
    data_structures::tree_234::Tree234::TryRightRotate
    bool TryRightRotate(Node *parent, Node *to_child)
    A handy function to try if we can do a right rotate to the target node.
    Definition tree_234.cpp:813
    Here is the call graph for this function:
    @@ -1377,19 +1321,12 @@ Here is the call graph for this function:
    void data_structures::tree_234::Tree234::RightRotate ( - Node *  - parent, + Node * parent, - int8_t  - index  - - - - ) - + int8_t index ) @@ -1400,7 +1337,7 @@ Here is the call graph for this function:

    Do the actual right rotate operation.

    -

    Given parent node, and the pivot item index, the right rotate operation is uniquely identified. The function assume the requirements are fulfilled and won't do any extra check. This function is call by TryRightRotate(), and the condition checking should be done before call it.

    +

    Given parent node, and the pivot item index, the right rotate operation is uniquely identified. The function assume the requirements are fulfilled and won't do any extra check. This function is call by TryRightRotate(), and the condition checking should be done before call it.

    Parameters
    @@ -1410,12 +1347,12 @@ Here is the call graph for this function:
    845 {
    846 Node *left = parent->GetItemLeftChild(index);
    -
    847 Node *right = parent->GetItemRightChild(index);
    +
    847 Node *right = parent->GetItemRightChild(index);
    848
    849 assert(left && left->Is34Node());
    -
    850 assert(right && right->Is2Node());
    +
    850 assert(right && right->Is2Node());
    851
    -
    852 right->InsertItemByIndex(0, parent->GetItem(index),
    +
    852 right->InsertItemByIndex(0, parent->GetItem(index),
    853 left->GetRightmostChild(), true);
    854 parent->SetItem(index, left->GetMaxItem());
    855 left->RemoveItemByIndex(left->GetCount() - 1, true);
    @@ -1435,8 +1372,7 @@ Here is the call graph for this function:
    - - +
    parentthe parent node in this right rotate operation
    Node * data_structures::tree_234::Tree234::SplitNode (Node * node)Node * node)
    @@ -1458,11 +1394,11 @@ Here is the call graph for this function:
    745 {
    746 assert(node->GetCount() == 3);
    747
    -
    748 Node *left = node;
    +
    748 Node *left = node;
    749
    -
    750 Node *right = new Node(node->GetItem(2));
    -
    751 right->SetChild(0, node->GetChild(2));
    -
    752 right->SetChild(1, node->GetChild(3));
    +
    750 Node *right = new Node(node->GetItem(2));
    +
    751 right->SetChild(0, node->GetChild(2));
    +
    752 right->SetChild(1, node->GetChild(3));
    753
    754 Node *parent = new Node(node->GetItem(1));
    755 parent->SetChild(0, left);
    @@ -1484,7 +1420,7 @@ Here is the call graph for this function:
    void data_structures::tree_234::Tree234::Traverse ( - ) + ) @@ -1499,10 +1435,10 @@ Here is the call graph for this function:
    562 {
    -
    563 Traverse(root_);
    +
    563 Traverse(root_);
    564 std::cout << std::endl;
    565}
    -
    data_structures::tree_234::Tree234::Traverse
    void Traverse()
    In-order traverse.
    Definition tree_234.cpp:562
    +
    data_structures::tree_234::Tree234::Traverse
    void Traverse()
    In-order traverse.
    Definition tree_234.cpp:562
    Here is the call graph for this function:
    @@ -1523,8 +1459,7 @@ Here is the call graph for this function:
    void data_structures::tree_234::Tree234::Traverse ( - Node *  - tree) + Node * tree) @@ -1549,11 +1484,11 @@ Here is the call graph for this function:
    571
    572 int8_t i = 0;
    573 for (i = 0; i < node->GetCount(); i++) {
    -
    574 Traverse(node->GetChild(i));
    +
    574 Traverse(node->GetChild(i));
    575 std::cout << node->GetItem(i) << ", ";
    576 }
    577
    -
    578 Traverse(node->GetChild(i));
    +
    578 Traverse(node->GetChild(i));
    579}
    Here is the call graph for this function:
    @@ -1575,19 +1510,12 @@ Here is the call graph for this function: bool data_structures::tree_234::Tree234::TryLeftRotate ( - Node *  - parent, + Node * parent, - Node *  - to_child  - - - - ) - + Node * to_child ) @@ -1622,7 +1550,7 @@ Here is the call graph for this function:
    790 return false;
    791 }
    792
    -
    793 LeftRotate(parent, to_child_index);
    +
    793 LeftRotate(parent, to_child_index);
    794
    795 return true;
    796}
    @@ -1646,19 +1574,12 @@ Here is the call graph for this function: bool data_structures::tree_234::Tree234::TryRightRotate ( - Node *  - parent, + Node * parent, - Node *  - to_child  - - - - ) - + Node * to_child ) @@ -1693,7 +1614,7 @@ Here is the call graph for this function:
    825 return false;
    826 }
    827
    -
    828 RightRotate(parent, to_child_index - 1);
    +
    828 RightRotate(parent, to_child_index - 1);
    829
    830 return true;
    831}
    @@ -1740,7 +1661,7 @@ Here is the call graph for this function: diff --git a/d3/d98/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer-members.html b/d3/d98/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer-members.html index 44cd54739..65d368468 100644 --- a/d3/d98/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer-members.html +++ b/d3/d98/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -120,7 +122,7 @@ $(document).ready(function(){initNavTree('dc/d93/classmachine__learning_1_1neura diff --git a/d3/d9f/classothers_1_1postfix__expression_1_1_stack-members.html b/d3/d9f/classothers_1_1postfix__expression_1_1_stack-members.html index 902e16a68..a64468138 100644 --- a/d3/d9f/classothers_1_1postfix__expression_1_1_stack-members.html +++ b/d3/d9f/classothers_1_1postfix__expression_1_1_stack-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -110,7 +112,7 @@ $(document).ready(function(){initNavTree('d5/d8a/classothers_1_1postfix__express diff --git a/d3/da1/namespacen__queens.html b/d3/da1/namespacen__queens.html index 1658400cb..2bbf8cd0a 100644 --- a/d3/da1/namespacen__queens.html +++ b/d3/da1/namespacen__queens.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: n_queens Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d3/da1/namespacen__queens.html','../..

    Functions for Eight Queens puzzle. -More...

    +More...

    Detailed Description

    Functions for Eight Queens puzzle.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d3/da1/namespacen__queens.html','../.. diff --git a/d3/da3/classstatistics_1_1stats__computer2-members.html b/d3/da3/classstatistics_1_1stats__computer2-members.html index 98615129b..56b0f779f 100644 --- a/d3/da3/classstatistics_1_1stats__computer2-members.html +++ b/d3/da3/classstatistics_1_1stats__computer2-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -117,7 +119,7 @@ $(document).ready(function(){initNavTree('d8/dab/classstatistics_1_1stats__compu diff --git a/d3/da3/structgeometry_1_1grahamscan_1_1_point-members.html b/d3/da3/structgeometry_1_1grahamscan_1_1_point-members.html index cc9a666a2..0fcd2a213 100644 --- a/d3/da3/structgeometry_1_1grahamscan_1_1_point-members.html +++ b/d3/da3/structgeometry_1_1grahamscan_1_1_point-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -110,7 +112,7 @@ $(document).ready(function(){initNavTree('d7/d48/structgeometry_1_1grahamscan_1_ diff --git a/d3/da6/classbinary__search__tree__coll__graph.map b/d3/da6/classbinary__search__tree__coll__graph.map index 0014a84d5..58f09622a 100644 --- a/d3/da6/classbinary__search__tree__coll__graph.map +++ b/d3/da6/classbinary__search__tree__coll__graph.map @@ -1,10 +1,12 @@ - - - - - - - - + + + + + + + + + + diff --git a/d3/da6/classbinary__search__tree__coll__graph.md5 b/d3/da6/classbinary__search__tree__coll__graph.md5 index 4e4bded5f..18afeb956 100644 --- a/d3/da6/classbinary__search__tree__coll__graph.md5 +++ b/d3/da6/classbinary__search__tree__coll__graph.md5 @@ -1 +1 @@ -c5ebc0640878b399e6d285768779ac3c \ No newline at end of file +ff3ded2dfa555ac04d4557318afe8aea \ No newline at end of file diff --git a/d3/da6/classbinary__search__tree__coll__graph.svg b/d3/da6/classbinary__search__tree__coll__graph.svg index da46d1b16..a979cfb7b 100644 --- a/d3/da6/classbinary__search__tree__coll__graph.svg +++ b/d3/da6/classbinary__search__tree__coll__graph.svg @@ -4,8 +4,8 @@ - + - + graph::Graph< T > @@ -51,8 +51,8 @@ Node3 - -T + +T @@ -60,11 +60,12 @@ Node3->Node2 - - + + - keys + elements +keys diff --git a/d5/d08/classgraph_1_1_graph__coll__graph_org.svg b/d5/d08/classgraph_1_1_graph__coll__graph_org.svg index 1af91783a..c3024430b 100644 --- a/d5/d08/classgraph_1_1_graph__coll__graph_org.svg +++ b/d5/d08/classgraph_1_1_graph__coll__graph_org.svg @@ -4,9 +4,9 @@ - - + + graph::Graph< T > @@ -41,8 +41,8 @@ Node3 - -T + +T @@ -50,11 +50,12 @@ Node3->Node2 - - + + - keys + elements +keys diff --git a/d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html b/d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html index 688dd01ed..f9ef12d50 100644 --- a/d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html +++ b/d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures::trie_using_hashmap::Trie::Node Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -105,7 +107,7 @@ $(document).ready(function(){initNavTree('d5/d12/structdata__structures_1_1trie_

    struct representing a trie node. - More...

    + More...

    Collaboration diagram for data_structures::trie_using_hashmap::Trie::Node:
    @@ -114,7 +116,7 @@ Collaboration diagram for data_structures::trie_using_hashmap::Trie::Node:
    - + @@ -148,7 +150,7 @@ bool 

    Public Attributes

    std::unordered_map< char16_t, std::shared_ptr< Node > > children
    std::unordered_map< char16_t, std::shared_ptr< Node > > children
     
    bool word_end = false
    word_end = false< diff --git a/d5/d15/classcll.html b/d5/d15/classcll.html index 3bfbf0d10..09f3b9054 100644 --- a/d5/d15/classcll.html +++ b/d5/d15/classcll.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: cll Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,19 +114,19 @@ Collaboration diagram for cll:
    - + - + - + - + - + - + - +

    Public Member Functions

    void display ()
    void display ()
     
    void insert_front (int new_data)
    void insert_front (int new_data)
     
    void insert_tail (int new_data)
    void insert_tail (int new_data)
     
    int get_size ()
    int get_size ()
     
    bool find_item (int item_to_find)
    bool find_item (int item_to_find)
     
    int operator* ()
    int operator* ()
     
    void operator++ ()
    void operator++ ()
     
    - +

    @@ -146,7 +148,7 @@ int 

    		total
    cll::cll ())
    @@ -167,7 +169,7 @@ int total cll::~cll ( - ) + ) @@ -187,7 +189,7 @@ int total void cll::display ( - ) + ) @@ -221,8 +223,7 @@ int total bool cll::find_item ( - int  - item_to_find) + int item_to_find) @@ -253,7 +254,7 @@ int total int cll::get_size ( - ) + ) @@ -271,15 +272,14 @@ int total void cll::insert_front ( - int  - new_data) + int new_data)
    33 {
    34 node *newNode;
    -
    35 newNode = new node;
    +
    35 newNode = new node;
    36 newNode->data = new_data;
    37 newNode->next = NULL;
    38 if (head == NULL) {
    @@ -296,6 +296,7 @@ int total
    49 }
    50 total++;
    51}
    +
    node
    struct node { int data; int height; struct node *left; struct node *right;} node
    for std::queue
    Definition avltree.cpp:13
    @@ -308,15 +309,14 @@ int total void cll::insert_tail ( - int  - new_data) + int new_data)
    54 {
    55 node *newNode;
    -
    56 newNode = new node;
    +
    56 newNode = new node;
    57 newNode->data = new_data;
    58 newNode->next = NULL;
    59 if (head == NULL) {
    @@ -344,7 +344,7 @@ int total int cll::operator* ( - ) + ) @@ -362,7 +362,7 @@ int total void cll::operator++ ( - ) + ) @@ -393,7 +393,7 @@ int total diff --git a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html index 2a2e22f06..228b1f54a 100644 --- a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html +++ b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: bit_manipulation/next_higher_number_with_same_number_of_set_bits.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -125,10 +127,10 @@ Functions uint64_t bit_manipulation::next_higher_number (uint64_t x)  The main function implements checking the next number.
      -static void test () +static void test ()  Self-test implementations.
      -int main () +int main ()  Main function.
      @@ -146,8 +148,7 @@ Functions int main ( - void  - ) + void ) @@ -156,10 +157,10 @@ Functions

    Main function.

    Returns
    0 on exit
    97 {
    -
    98 test(); // run self-test implementations
    +
    98 test(); // run self-test implementations
    99 return 0;
    100}
    -
    test
    static void test()
    Self-test implementations.
    Definition next_higher_number_with_same_number_of_set_bits.cpp:73
    +
    test
    static void test()
    Self-test implementations.
    Definition next_higher_number_with_same_number_of_set_bits.cpp:73
    Here is the call graph for this function:
    @@ -180,7 +181,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -230,7 +231,7 @@ Here is the call graph for this function:
    diff --git a/d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html b/d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html index 77184ead3..f415c38ef 100644 --- a/d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html +++ b/d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: std::is_unsigned< uint128_t > Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -119,7 +121,7 @@ Collaboration diagram for std::is_unsigned< uint128_t >:
    diff --git a/d5/d29/struct_min_heap_node.html b/d5/d29/struct_min_heap_node.html index 2a5111ba9..bf0145773 100644 --- a/d5/d29/struct_min_heap_node.html +++ b/d5/d29/struct_min_heap_node.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: MinHeapNode Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ Collaboration diagram for MinHeapNode:
    - +

    Public Member Functions

     MinHeapNode (char data, unsigned freq)
     MinHeapNode (char data, unsigned freq)
     
    - - + - - - - - - - +

    @@ -143,19 +145,12 @@ unsigned 

    		freq
    MinHeapNode::MinHeapNode (char data, char data,
    unsigned freq 
    )unsigned freq )
    @@ -181,7 +176,7 @@ unsigned freq
    • MinHeapNode
      • -
    • Generated by doxygen 1.9.8
      • +
    • Generated by doxygen 1.10.0
    diff --git a/d5/d2c/namespacelayers.html b/d5/d2c/namespacelayers.html index 5424989fb..ba5540335 100644 --- a/d5/d2c/namespacelayers.html +++ b/d5/d2c/namespacelayers.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: layers Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d5/d2c/namespacelayers.html','../../')

    This namespace contains layers used in MLP. -More...

    +More...

    Detailed Description

    This namespace contains layers used in MLP.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d5/d2c/namespacelayers.html','../../') diff --git a/d5/d33/gram__schmidt_8cpp.html b/d5/d33/gram__schmidt_8cpp.html index 13bea821d..3398140ae 100644 --- a/d5/d33/gram__schmidt_8cpp.html +++ b/d5/d33/gram__schmidt_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/gram_schmidt.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,17 +130,17 @@ Namespaces - + - + - + - + - + - +

    Functions

    double numerical_methods::gram_schmidt::dot_product (const std::array< double, 10 > &x, const std::array< double, 10 > &y, const int &c)
    double numerical_methods::gram_schmidt::dot_product (const std::array< double, 10 > &x, const std::array< double, 10 > &y, const int &c)
     
    double numerical_methods::gram_schmidt::projection (const std::array< double, 10 > &x, const std::array< double, 10 > &y, const int &c)
    double numerical_methods::gram_schmidt::projection (const std::array< double, 10 > &x, const std::array< double, 10 > &y, const int &c)
     
    void numerical_methods::gram_schmidt::display (const int &r, const int &c, const std::array< std::array< double, 10 >, 20 > &B)
    void numerical_methods::gram_schmidt::display (const int &r, const int &c, const std::array< std::array< double, 10 >, 20 > &B)
     
    void numerical_methods::gram_schmidt::gram_schmidt (int r, const int &c, const std::array< std::array< double, 10 >, 20 > &A, std::array< std::array< double, 10 >, 20 > B)
    void numerical_methods::gram_schmidt::gram_schmidt (int r, const int &c, const std::array< std::array< double, 10 >, 20 > &A, std::array< std::array< double, 10 >, 20 > B)
     
    static void test ()
    static void test ()
     
    int main ()
    int main ()
     Main Function.
     
    @@ -161,25 +163,17 @@ Algorithm void numerical_methods::gram_schmidt::display ( - const int &  - r, + const int & r, - const int &  - c, + const int & c, - const std::array< std::array< double, 10 >, 20 > &  - B  - - - - ) - + const std::array< std::array< double, 10 >, 20 > & B )
    @@ -215,25 +209,17 @@ Algorithm double numerical_methods::gram_schmidt::dot_product ( - const std::array< double, 10 > &  - x, + const std::array< double, 10 > & x, - const std::array< double, 10 > &  - y, + const std::array< double, 10 > & y, - const int &  - c  - - - - ) - + const int & c )
    @@ -271,31 +257,22 @@ Here is the call graph for this function:
    void numerical_methods::gram_schmidt::gram_schmidt ( - int  - r, + int r, - const int &  - c, + const int & c, - const std::array< std::array< double, 10 >, 20 > &  - A, + const std::array< std::array< double, 10 >, 20 > & A, - std::array< std::array< double, 10 >, 20 >  - B  - - - - ) - + std::array< std::array< double, 10 >, 20 > B )
    @@ -347,7 +324,7 @@ Here is the call graph for this function:
    149 temp{}; /// to store previous projected array
    150 double factor = NAN; /// to store the factor by which the
    151 /// previous array will change
    -
    152 factor = projection(A[k - 1], B[l - 1], c);
    +
    152 factor = projection(A[k - 1], B[l - 1], c);
    153 for (int i = 0; i < c; ++i) {
    154 temp[i] = B[l - 1][i] * factor; /// projected array created
    155 }
    @@ -373,7 +350,7 @@ Here is the call graph for this function:
    numerical_methods::simpson_method::k
    double k(double x)
    Another test function.
    Definition composite_simpson_rule.cpp:117
    numerical_methods::simpson_method::l
    double l(double x)
    Another test function.
    Definition composite_simpson_rule.cpp:119
    -
    numerical_methods::gram_schmidt::projection
    double projection(const std::array< double, 10 > &x, const std::array< double, 10 > &y, const int &c)
    Definition gram_schmidt.cpp:79
    +
    numerical_methods::gram_schmidt::projection
    double projection(const std::array< double, 10 > &x, const std::array< double, 10 > &y, const int &c)
    Definition gram_schmidt.cpp:79
    Here is the call graph for this function:
    @@ -391,8 +368,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -408,7 +384,7 @@ Here is the call graph for this function:

    take make the process numerically stable, upper bound for the dot product take 0.1

    248 {
    249 int r = 0, c = 0;
    -
    250 test(); // perform self tests
    +
    250 test(); // perform self tests
    251 std::cout << "Enter the dimension of your vectors\n";
    252 std::cin >> c;
    253 std::cout << "Enter the number of vectors you will enter\n";
    @@ -429,7 +405,7 @@ Here is the call graph for this function:
    268 std::cout << '\n';
    269 }
    270
    -
    271 numerical_methods::gram_schmidt::gram_schmidt(r, c, A, B);
    +
    271 numerical_methods::gram_schmidt::gram_schmidt(r, c, A, B);
    272
    273 double dot = 0;
    274 int flag = 1; /// To check whether vectors are orthogonal or not
    @@ -451,8 +427,8 @@ Here is the call graph for this function:
    290}
    std::fabs
    T fabs(T... args)
    -
    numerical_methods::gram_schmidt::gram_schmidt
    void gram_schmidt(int r, const int &c, const std::array< std::array< double, 10 >, 20 > &A, std::array< std::array< double, 10 >, 20 > B)
    Definition gram_schmidt.cpp:121
    -
    test
    static void test()
    Definition gram_schmidt.cpp:181
    +
    numerical_methods::gram_schmidt::gram_schmidt
    void gram_schmidt(int r, const int &c, const std::array< std::array< double, 10 >, 20 > &A, std::array< std::array< double, 10 >, 20 > B)
    Definition gram_schmidt.cpp:121
    +
    test
    static void test()
    Definition gram_schmidt.cpp:181
    Here is the call graph for this function:
    @@ -470,25 +446,17 @@ Here is the call graph for this function:
    double numerical_methods::gram_schmidt::projection ( - const std::array< double, 10 > &  - x, + const std::array< double, 10 > & x, - const std::array< double, 10 > &  - y, + const std::array< double, 10 > & y, - const int &  - c  - - - - ) - + const int & c )
    @@ -507,16 +475,16 @@ Here is the call graph for this function:

    multiply that factor with every element in a 3rd vector, whose initial values are same as the 2nd vector.

    80 {
    81 double dot =
    -
    82 dot_product(x, y, c); /// The dot product of two vectors is taken
    +
    82 dot_product(x, y, c); /// The dot product of two vectors is taken
    83 double anorm =
    -
    84 dot_product(y, y, c); /// The norm of the second vector is taken.
    +
    84 dot_product(y, y, c); /// The norm of the second vector is taken.
    85 double factor =
    86 dot /
    87 anorm; /// multiply that factor with every element in a 3rd vector,
    88 /// whose initial values are same as the 2nd vector.
    89 return factor;
    90}
    -
    numerical_methods::gram_schmidt::dot_product
    double dot_product(const std::array< double, 10 > &x, const std::array< double, 10 > &y, const int &c)
    Definition gram_schmidt.cpp:59
    +
    numerical_methods::gram_schmidt::dot_product
    double dot_product(const std::array< double, 10 > &x, const std::array< double, 10 > &y, const int &c)
    Definition gram_schmidt.cpp:59
    Here is the call graph for this function:
    @@ -537,7 +505,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -553,7 +521,7 @@ Here is the call graph for this function:
    183 {{1, 0, 1, 0}, {1, 1, 1, 1}, {0, 1, 2, 1}}};
    184 std::array<std::array<double, 10>, 20> b1 = {{0}};
    185 double dot1 = 0;
    -
    186 numerical_methods::gram_schmidt::gram_schmidt(3, 4, a1, b1);
    +
    186 numerical_methods::gram_schmidt::gram_schmidt(3, 4, a1, b1);
    187 int flag = 1;
    188 for (int i = 0; i < 2; ++i) {
    189 for (int j = i + 1; j < 3; ++j) {
    @@ -573,7 +541,7 @@ Here is the call graph for this function:
    203 std::array<std::array<double, 10>, 20> a2 = {{{3, 1}, {2, 2}}};
    204 std::array<std::array<double, 10>, 20> b2 = {{0}};
    205 double dot2 = 0;
    -
    206 numerical_methods::gram_schmidt::gram_schmidt(2, 2, a2, b2);
    +
    206 numerical_methods::gram_schmidt::gram_schmidt(2, 2, a2, b2);
    207 flag = 1;
    208 for (int i = 0; i < 1; ++i) {
    209 for (int j = i + 1; j < 2; ++j) {
    @@ -593,7 +561,7 @@ Here is the call graph for this function:
    223 std::array<std::array<double, 10>, 20> a3 = {{{1, 2, 2}, {-4, 3, 2}}};
    224 std::array<std::array<double, 10>, 20> b3 = {{0}};
    225 double dot3 = 0;
    -
    226 numerical_methods::gram_schmidt::gram_schmidt(2, 3, a3, b3);
    +
    226 numerical_methods::gram_schmidt::gram_schmidt(2, 3, a3, b3);
    227 flag = 1;
    228 for (int i = 0; i < 1; ++i) {
    229 for (int j = i + 1; j < 2; ++j) {
    @@ -619,7 +587,7 @@ Here is the call graph for this function: diff --git a/d5/d39/namespaceactivations.html b/d5/d39/namespaceactivations.html index faf0f445b..feae91204 100644 --- a/d5/d39/namespaceactivations.html +++ b/d5/d39/namespaceactivations.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: activations Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d5/d39/namespaceactivations.html','../

    Various activation functions used in Neural network. -More...

    +More...

    Detailed Description

    Various activation functions used in Neural network.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d5/d39/namespaceactivations.html','../ diff --git a/d5/d3c/namespacedata__structures.html b/d5/d3c/namespacedata__structures.html index 622b109a7..3b307135a 100644 --- a/d5/d3c/namespacedata__structures.html +++ b/d5/d3c/namespacedata__structures.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d5/d3c/namespacedata__structures.html'

    for IO operations -More...

    +More...

    @@ -129,16 +131,16 @@ Classes

    Classes

    - + - + - + - +

    Functions

    static std::size_t hashDJB2 (std::string const &s)
    static std::size_t hashDJB2 (std::string const &s)
     Function djb2 to get hash for the given string.
     
    static std::size_t hashStr (std::string const &s)
    static std::size_t hashStr (std::string const &s)
     Hash function, to get hash for the given string.
     
    std::size_t hashInt_1 (int x)
    std::size_t hashInt_1 (int x)
     Hash function for test
     
    std::size_t hashInt_2 (int x)
    std::size_t hashInt_2 (int x)
     Hash function for test
     
    @@ -193,8 +195,7 @@ constexpr float  - - +
    PROBABILIT
    static std::size_t data_structures::hashDJB2 (std::string const & s)std::string const & s)
    @@ -233,8 +234,7 @@ constexpr float PROBABILIT std::size_t data_structures::hashInt_1 ( - int  - x) + int x) @@ -266,8 +266,7 @@ constexpr float PROBABILIT std::size_t data_structures::hashInt_2 ( - int  - x) + int x) @@ -303,8 +302,7 @@ constexpr float PROBABILIT static std::size_t data_structures::hashStr ( - std::string const &  - s) + std::string const & s) @@ -341,7 +339,7 @@ constexpr float PROBABILIT diff --git a/d5/d45/sublist__search_8cpp.html b/d5/d45/sublist__search_8cpp.html index e9aa64354..ed9511e75 100644 --- a/d5/d45/sublist__search_8cpp.html +++ b/d5/d45/sublist__search_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: search/sublist_search.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -136,19 +138,19 @@ Namespaces - + - + - + - + - +

    Functions

    void search::sublist_search::printLinkedList (Node *start)
    void search::sublist_search::printLinkedList (Node *start)
     A simple function to print the linked list.
     
    Node * search::sublist_search::makeLinkedList (const std::vector< uint64_t > &data)
    Node * search::sublist_search::makeLinkedList (const std::vector< uint64_t > &data)
     Give a vector of data, it adds each element of vector in the linked list and return the address of head pointer.
     
    bool search::sublist_search::sublistSearch (Node *sublist, Node *mainList)
    bool search::sublist_search::sublistSearch (Node *sublist, Node *mainList)
     Main searching function.
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    int main (int argc, char *argv[])
    int main (int argc, char *argv[])
     Main function.
     
    @@ -178,19 +180,12 @@ Working int main ( - int  - argc, + int argc, - char *  - argv[]  - - - - ) - + char * argv[] )
    @@ -209,28 +204,28 @@ Working

    < Main list in which sublist is to be searched

    < boolean to check if the sublist exists or not

    339 {
    -
    340 test(); // run self-test implementations
    +
    340 test(); // run self-test implementations
    341
    342 std::vector<uint64_t> mainlistData = {
    343 2, 5, 6, 7, 8}; ///< Main list in which sublist is to be searched
    344 std::vector<uint64_t> sublistData = {6, 8}; ///< Sublist to be searched
    345
    346 search::sublist_search::Node *mainlistLL =
    -
    347 search::sublist_search::makeLinkedList(mainlistData);
    +
    347 search::sublist_search::makeLinkedList(mainlistData);
    348 search::sublist_search::Node *sublistLL =
    -
    349 search::sublist_search::makeLinkedList(
    +
    349 search::sublist_search::makeLinkedList(
    350 sublistData); ///< Main list in which sublist is to be
    351 ///< searched
    352
    -
    353 bool exists = search::sublist_search::sublistSearch(
    +
    353 bool exists = search::sublist_search::sublistSearch(
    354 sublistLL,
    355 mainlistLL); ///< boolean to check if the sublist exists or not
    356
    357 std::cout << "Sublist: " << std::endl;
    -
    358 search::sublist_search::printLinkedList(sublistLL);
    +
    358 search::sublist_search::printLinkedList(sublistLL);
    359
    360 std::cout << "Main list: " << std::endl;
    -
    361 search::sublist_search::printLinkedList(mainlistLL);
    +
    361 search::sublist_search::printLinkedList(mainlistLL);
    362 std::cout << std::endl;
    363
    364 if (exists) {
    @@ -243,10 +238,10 @@ Working
    std::endl
    T endl(T... args)
    search::sublist_search::Node
    A Node structure representing a single link Node in a linked list.
    Definition sublist_search.cpp:47
    -
    search::sublist_search::sublistSearch
    bool sublistSearch(Node *sublist, Node *mainList)
    Main searching function.
    Definition sublist_search.cpp:100
    -
    search::sublist_search::makeLinkedList
    Node * makeLinkedList(const std::vector< uint64_t > &data)
    Give a vector of data, it adds each element of vector in the linked list and return the address of he...
    Definition sublist_search.cpp:73
    -
    test
    static void test()
    Self-test implementations.
    Definition sublist_search.cpp:328
    -
    search::sublist_search::printLinkedList
    void printLinkedList(Node *start)
    A simple function to print the linked list.
    Definition sublist_search.cpp:57
    +
    search::sublist_search::sublistSearch
    bool sublistSearch(Node *sublist, Node *mainList)
    Main searching function.
    Definition sublist_search.cpp:100
    +
    search::sublist_search::makeLinkedList
    Node * makeLinkedList(const std::vector< uint64_t > &data)
    Give a vector of data, it adds each element of vector in the linked list and return the address of he...
    Definition sublist_search.cpp:73
    +
    test
    static void test()
    Self-test implementations.
    Definition sublist_search.cpp:328
    +
    search::sublist_search::printLinkedList
    void printLinkedList(Node *start)
    A simple function to print the linked list.
    Definition sublist_search.cpp:57
    dynamic_programming::word_break::exists
    bool exists(const std::string &str, const std::unordered_set< std::string > &strSet)
    Function that checks if the string passed in param is present in the the unordered_set passed.
    Definition word_break.cpp:60
    @@ -266,8 +261,7 @@ Here is the call graph for this function:
    Node * search::sublist_search::makeLinkedList ( - const std::vector< uint64_t > &  - data) + const std::vector< uint64_t > & data) @@ -292,15 +286,16 @@ Here is the call graph for this function:
    80 node->data = i;
    81 node->next = nullptr;
    82 if (head == nullptr) {
    -
    83 head = node;
    -
    84 tail = node;
    +
    83 head = node;
    +
    84 tail = node;
    85 } else {
    -
    86 tail->next = node;
    +
    86 tail->next = node;
    87 tail = tail->next;
    88 }
    89 }
    90 return head;
    91}
    +
    node
    struct node { int data; int height; struct node *left; struct node *right;} node
    for std::queue
    Definition avltree.cpp:13
    data
    int data[MAX]
    test data
    Definition hash_search.cpp:24
    Node
    Definition linkedlist_implentation_usingarray.cpp:14
    node
    Definition binary_search_tree.cpp:11
    @@ -321,8 +316,7 @@ Here is the call graph for this function: void search::sublist_search::printLinkedList ( - Node *  - start) + Node * start) @@ -360,19 +354,12 @@ Here is the call graph for this function: bool search::sublist_search::sublistSearch ( - Node *  - sublist, + Node * sublist, - Node *  - mainList  - - - - ) - + Node * mainList )
    @@ -461,7 +448,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -494,7 +481,7 @@ Here is the call graph for this function: diff --git a/d5/d46/classdata__structures_1_1trie__using__hashmap_1_1_trie-members.html b/d5/d46/classdata__structures_1_1trie__using__hashmap_1_1_trie-members.html index 1eda64e7d..f4c9b63c5 100644 --- a/d5/d46/classdata__structures_1_1trie__using__hashmap_1_1_trie-members.html +++ b/d5/d46/classdata__structures_1_1trie__using__hashmap_1_1_trie-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,7 +118,7 @@ $(document).ready(function(){initNavTree('d3/d26/classdata__structures_1_1trie__ diff --git a/d5/d4c/group__sorting.html b/d5/d4c/group__sorting.html index ba2003d26..1a7e18f09 100644 --- a/d5/d4c/group__sorting.html +++ b/d5/d4c/group__sorting.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Sorting Algorithm + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -123,24 +125,24 @@ Namespaces

    Functions

    template<typename T > -void heapify (T *arr, int n, int i) +void heapify (T *arr, int n, int i)   template<typename T > -void heapSort (T *arr, int n) +void heapSort (T *arr, int n)   -void merge (int *arr, int l, int m, int r) +void merge (int *arr, int l, int m, int r)   -void mergeSort (int *arr, int l, int r) +void mergeSort (int *arr, int l, int r)   -void show (int *arr, int size) +void show (int *arr, int size)   -int main () +int main ()   template<typename T > -static void displayElements (const std::vector< T > &arr) +static void displayElements (const std::vector< T > &arr)  Utility function used for printing the elements. Prints elements of the array after they're sorted using wiggle sort algorithm.
      -static void test () +static void test ()  

    Detailed Description

    @@ -149,7 +151,7 @@ Functions - +
    arrarray to be sorted
    nsize of array
    inode position in Binary Tress or element position in Array to be compared with it's childern
    inode position in Binary Tress or element position in Array to be compared with it's childern
    @@ -168,8 +170,7 @@ template<typename T >
    static void displayElements ( - const std::vector< T > &  - arr) + const std::vector< T > & arr) @@ -227,25 +228,17 @@ template<typename T > void heapify ( - T *  - arr, + T * arr, - int  - n, + int n, - int  - i  - - - - ) - + int i )
    @@ -280,19 +273,12 @@ template<typename T >
    void heapSort ( - T *  - arr, + T * arr, - int  - n  - - - - ) - + int n )
    @@ -329,8 +315,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -346,14 +331,14 @@ Here is the call graph for this function:
    96 for (int i = 0; i < size; ++i) {
    97 std::cin >> arr[i];
    98 }
    -
    99 mergeSort(arr, 0, size - 1);
    +
    99 mergeSort(arr, 0, size - 1);
    100 std::cout << "Sorted array : ";
    101 show(arr, size);
    102 delete[] arr;
    103 return 0;
    104}
    -
    mergeSort
    void mergeSort(int *arr, int l, int r)
    Definition merge_sort.cpp:71
    +
    mergeSort
    void mergeSort(int *arr, int l, int r)
    Definition merge_sort.cpp:71
    Here is the call graph for this function:
    @@ -371,35 +356,26 @@ Here is the call graph for this function:
    void merge ( - int *  - arr, + int * arr, - int  - l, + int l, - int  - m, + int m, - int  - r  - - - - ) - + int r )
    -

    The merge() function is used for merging two halves. The merge(arr, l, m, r) is key process that assumes that arr[l..m] and arr[m+1..r] are sorted and merges the two sorted sub-arrays into one.

    +

    The merge() function is used for merging two halves. The merge(arr, l, m, r) is key process that assumes that arr[l..m] and arr[m+1..r] are sorted and merges the two sorted sub-arrays into one.

    Parameters
    @@ -455,29 +431,21 @@ Here is the call graph for this function: - - + - - + - - - - - - - +
    arr- array with two halves arr[l...m] and arr[m+1...r]
    void mergeSort (int * arr, int * arr,
    int l, int l,
    int r 
    )int r )
    -

    Merge sort is a divide and conquer algorithm, it divides the input array into two halves and calls itself for the two halves and then calls merge() to merge the two halves

    +

    Merge sort is a divide and conquer algorithm, it divides the input array into two halves and calls itself for the two halves and then calls merge() to merge the two halves

    Parameters
    @@ -489,12 +457,12 @@ Here is the call graph for this function:
    71 {
    72 if (l < r) {
    73 int m = l + (r - l) / 2;
    -
    74 mergeSort(arr, l, m);
    -
    75 mergeSort(arr, m + 1, r);
    -
    76 merge(arr, l, m, r);
    +
    74 mergeSort(arr, l, m);
    +
    75 mergeSort(arr, m + 1, r);
    +
    76 merge(arr, l, m, r);
    77 }
    78}
    -
    merge
    void merge(int *arr, int l, int m, int r)
    Definition merge_sort.cpp:33
    +
    merge
    void merge(int *arr, int l, int m, int r)
    Definition merge_sort.cpp:33
    Here is the call graph for this function:
    @@ -512,19 +480,12 @@ Here is the call graph for this function:
    - - + - - - - - - - +
    arr- array to be sorted
    void show (int * arr, int * arr,
    int size 
    )int size )
    @@ -548,7 +509,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -569,7 +530,7 @@ Here is the call graph for this function:
    113
    114 std::vector<float> sorted = sorting::wiggle_sort::wiggleSort<float>(data1);
    115
    -
    116 displayElements(sorted);
    +
    116 displayElements(sorted);
    117
    118 for (uint32_t j = 0; j < data1.size(); j += 2) {
    119 assert(data1[j] <= data1[j + 1] &&
    @@ -578,7 +539,7 @@ Here is the call graph for this function:
    122
    123 std::cout << "Test 1 passed\n";
    124}
    -
    displayElements
    static void displayElements(const std::vector< T > &arr)
    Utility function used for printing the elements. Prints elements of the array after they're sorted us...
    Definition wiggle_sort.cpp:85
    +
    displayElements
    static void displayElements(const std::vector< T > &arr)
    Utility function used for printing the elements. Prints elements of the array after they're sorted us...
    Definition wiggle_sort.cpp:85
    std::rand
    T rand(T... args)
    std::srand
    T srand(T... args)
    std::time
    T time(T... args)
    @@ -596,7 +557,7 @@ Here is the call graph for this function: diff --git a/d5/d4d/structciphers_1_1elliptic__curve__key__exchange_1_1_point-members.html b/d5/d4d/structciphers_1_1elliptic__curve__key__exchange_1_1_point-members.html index fee646ee2..f36e32aae 100644 --- a/d5/d4d/structciphers_1_1elliptic__curve__key__exchange_1_1_point-members.html +++ b/d5/d4d/structciphers_1_1elliptic__curve__key__exchange_1_1_point-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('d6/d45/structciphers_1_1elliptic__curv diff --git a/d5/d55/classgraph_1_1_rooted_tree-members.html b/d5/d55/classgraph_1_1_rooted_tree-members.html index 46192de2a..cce5cb2a9 100644 --- a/d5/d55/classgraph_1_1_rooted_tree-members.html +++ b/d5/d55/classgraph_1_1_rooted_tree-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -120,7 +122,7 @@ $(document).ready(function(){initNavTree('d0/d58/classgraph_1_1_rooted_tree.html diff --git a/d5/d58/class_test_cases.html b/d5/d58/class_test_cases.html index 2918f1ba9..9108c456d 100644 --- a/d5/d58/class_test_cases.html +++ b/d5/d58/class_test_cases.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: TestCases Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,59 +108,59 @@ $(document).ready(function(){initNavTree('d5/d58/class_test_cases.html','../../'

    class encapsulating the necessary test cases - More...

    + More...

    - + - + - + - + - + - + - + - + - + - + - + - +

    Public Member Functions

    void runTests ()
    void runTests ()
     Executes test cases.
     
    void testCase_1 ()
    void testCase_1 ()
     A test case contains edge case, printing inorder successor of last node.
     
    void testCase_2 ()
    void testCase_2 ()
     A test case which contains main list of 100 elements and sublist of 20.
     
    void testCase_3 ()
    void testCase_3 ()
     A test case which contains main list of 50 elements and sublist of 20.
     
    void runTests ()
    void runTests ()
     Executes test cases.
     
    void testCase_1 ()
    void testCase_1 ()
     A test case contains edge case, Only contains one element.
     
    void testCase_2 ()
    void testCase_2 ()
     A test case which contains main list of 100 elements and sublist of 20.
     
    void testCase_3 ()
    void testCase_3 ()
     A test case which contains main list of 50 elements and sublist of 20.
     
    void runTests ()
    void runTests ()
     Executes test cases.
     
    void testCase_1 ()
    void testCase_1 ()
     A test case with single input.
     
    void testCase_2 ()
    void testCase_2 ()
     A test case with input array of length 500.
     
    void testCase_3 ()
    void testCase_3 ()
     A test case with array of length 1000.
     
    - + - + - +

    Private Member Functions

    template<typename T >
    void log (T msg)
    void log (T msg)
     A function to print given message on console.
     
    template<typename T >
    void log (T msg)
    void log (T msg)
     A function to print given message on console.
     
    template<typename T >
    void log (T msg)
    void log (T msg)
     A function to print64_t given message on console.
     
    @@ -180,8 +182,7 @@ template<typename T >
    void TestCases::log ( - T  - msg) + T msg) @@ -228,8 +229,7 @@ template<typename T >
    void TestCases::log ( - T  - msg) + T msg) @@ -274,8 +274,7 @@ template<typename T > void TestCases::log ( - T  - msg) + T msg) @@ -318,7 +317,7 @@ Here is the call graph for this function: void TestCases::runTests ( - ) + ) @@ -332,19 +331,19 @@ Here is the call graph for this function:

    Executes test cases.

    Returns
    void
    243 {
    -
    244 log("Running Tests...");
    +
    244 log("Running Tests...");
    245
    -
    246 testCase_1();
    -
    247 testCase_2();
    -
    248 testCase_3();
    +
    246 testCase_1();
    +
    247 testCase_2();
    +
    248 testCase_3();
    249
    -
    250 log("Test Cases over!");
    +
    250 log("Test Cases over!");
    251 std::cout << std::endl;
    252 }
    -
    TestCases::log
    void log(T msg)
    A function to print given message on console.
    Definition inorder_successor_of_bst.cpp:233
    -
    TestCases::testCase_2
    void testCase_2()
    A test case which contains main list of 100 elements and sublist of 20.
    Definition inorder_successor_of_bst.cpp:304
    -
    TestCases::testCase_1
    void testCase_1()
    A test case contains edge case, printing inorder successor of last node.
    Definition inorder_successor_of_bst.cpp:259
    -
    TestCases::testCase_3
    void testCase_3()
    A test case which contains main list of 50 elements and sublist of 20.
    Definition inorder_successor_of_bst.cpp:345
    +
    TestCases::log
    void log(T msg)
    A function to print given message on console.
    Definition inorder_successor_of_bst.cpp:233
    +
    TestCases::testCase_2
    void testCase_2()
    A test case which contains main list of 100 elements and sublist of 20.
    Definition inorder_successor_of_bst.cpp:304
    +
    TestCases::testCase_1
    void testCase_1()
    A test case contains edge case, printing inorder successor of last node.
    Definition inorder_successor_of_bst.cpp:259
    +
    TestCases::testCase_3
    void testCase_3()
    A test case which contains main list of 50 elements and sublist of 20.
    Definition inorder_successor_of_bst.cpp:345
    Here is the call graph for this function:
    @@ -365,7 +364,7 @@ Here is the call graph for this function:
    void TestCases::runTests ( - ) + ) @@ -379,13 +378,13 @@ Here is the call graph for this function:

    Executes test cases.

    Returns
    void
    171 {
    -
    172 log("Running Tests...");
    +
    172 log("Running Tests...");
    173
    -
    174 testCase_1();
    -
    175 testCase_2();
    -
    176 testCase_3();
    +
    174 testCase_1();
    +
    175 testCase_2();
    +
    176 testCase_3();
    177
    -
    178 log("Test Cases over!");
    +
    178 log("Test Cases over!");
    179 std::cout << std::endl;
    180 }
    @@ -408,7 +407,7 @@ Here is the call graph for this function:
    void TestCases::runTests ( - ) + ) @@ -422,13 +421,13 @@ Here is the call graph for this function:

    Executes test cases.

    Returns
    void
    199 {
    -
    200 log("Running Tests...");
    +
    200 log("Running Tests...");
    201
    -
    202 testCase_1();
    -
    203 testCase_2();
    -
    204 testCase_3();
    +
    202 testCase_1();
    +
    203 testCase_2();
    +
    204 testCase_3();
    205
    -
    206 log("Test Cases over!");
    +
    206 log("Test Cases over!");
    207 std::cout << std::endl;
    208 }
    @@ -451,7 +450,7 @@ Here is the call graph for this function:
    void TestCases::testCase_1 ( - ) + ) @@ -474,10 +473,10 @@ Here is the call graph for this function:
    260 const operations_on_datastructures::inorder_traversal_of_bst::Node
    261 *expectedOutput = nullptr; ///< Expected output of this test
    262
    -
    263 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
    -
    264 log("This is test case 1 : ");
    -
    265 log("Description:");
    -
    266 log(" EDGE CASE : Printing inorder successor for last node in the "
    +
    263 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
    +
    264 log("This is test case 1 : ");
    +
    265 log("Description:");
    +
    266 log(" EDGE CASE : Printing inorder successor for last node in the "
    267 "BST, Output will be nullptr.");
    268
    269 operations_on_datastructures::inorder_traversal_of_bst::Node *root =
    @@ -499,15 +498,15 @@ Here is the call graph for this function:
    285 inorder_traversal_of_bst::getInorderSuccessor(
    286 root, 78); ///< The inorder successor node for given data
    287
    -
    288 log("Checking assert expression...");
    +
    288 log("Checking assert expression...");
    289 assert(inorderSuccessor == expectedOutput);
    -
    290 log("Assertion check passed!");
    +
    290 log("Assertion check passed!");
    291
    292 operations_on_datastructures::inorder_traversal_of_bst::deallocate(
    293 root); /// memory cleanup!
    294
    -
    295 log("[PASS] : TEST CASE 1 PASS!");
    -
    296 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
    +
    295 log("[PASS] : TEST CASE 1 PASS!");
    +
    296 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
    297 }
    operations_on_datastructures::inorder_traversal_of_bst::Node
    A Node structure representing a single node in BST.
    Definition inorder_successor_of_bst.cpp:56
    operations_on_datastructures::inorder_traversal_of_bst::makeBST
    Node * makeBST(Node *root, const std::vector< int64_t > &data)
    This function is used in test cases to quickly create BST containing large data instead of hard codin...
    Definition inorder_successor_of_bst.cpp:155
    @@ -534,7 +533,7 @@ Here is the call graph for this function: void TestCases::testCase_1 ( - ) + ) @@ -556,11 +555,11 @@ Here is the call graph for this function:
    186 {
    187 const bool expectedOutput = true; ///< Expected output of this test
    188
    -
    189 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    +
    189 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    190 "~");
    -
    191 log("This is test case 1 for sublist search Algorithm : ");
    -
    192 log("Description:");
    -
    193 log(" EDGE CASE : Only contains one element");
    +
    191 log("This is test case 1 for sublist search Algorithm : ");
    +
    192 log("Description:");
    +
    193 log(" EDGE CASE : Only contains one element");
    194
    195 std::vector<uint64_t> sublistData = {
    196 6}; ///< Data to make linked list which will be the sublist
    @@ -579,12 +578,12 @@ Here is the call graph for this function:
    209 bool exists = search::sublist_search::sublistSearch(
    210 sublistLL, mainlistLL); ///< boolean, if sublist exist or not
    211
    -
    212 log("Checking assert expression...");
    +
    212 log("Checking assert expression...");
    213 assert(exists == expectedOutput);
    -
    214 log("Assertion check passed!");
    +
    214 log("Assertion check passed!");
    215
    -
    216 log("[PASS] : TEST CASE 1 PASS!");
    -
    217 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    +
    216 log("[PASS] : TEST CASE 1 PASS!");
    +
    217 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    218 "~");
    219
    220 delete (sublistLL);
    @@ -614,7 +613,7 @@ Here is the call graph for this function: void TestCases::testCase_1 ( - ) + ) @@ -629,28 +628,28 @@ Here is the call graph for this function:
    Returns
    void
    214 {
    215 const int64_t inputSize = 1;
    -
    216 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    +
    216 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    217 "~");
    -
    218 log("This is test case 1 for Random Pivot Quick Sort Algorithm : ");
    -
    219 log("Description:");
    -
    220 log(" EDGE CASE : Only contains one element");
    +
    218 log("This is test case 1 for Random Pivot Quick Sort Algorithm : ");
    +
    219 log("Description:");
    +
    220 log(" EDGE CASE : Only contains one element");
    221 std::array<int64_t, inputSize> unsorted_arr{2};
    222
    223 int64_t start = 0;
    224 int64_t end = unsorted_arr.size() - 1; // length - 1
    225
    -
    226 log("Running algorithm of data of length 50 ...");
    +
    226 log("Running algorithm of data of length 50 ...");
    227 std::array<int64_t, unsorted_arr.size()> sorted_arr =
    228 sorting::random_pivot_quick_sort::quickSortRP(unsorted_arr, start,
    229 end);
    -
    230 log("Algorithm finished!");
    +
    230 log("Algorithm finished!");
    231
    -
    232 log("Checking assert expression...");
    +
    232 log("Checking assert expression...");
    233 assert(std::is_sorted(sorted_arr.begin(), sorted_arr.end()));
    -
    234 log("Assertion check passed!");
    +
    234 log("Assertion check passed!");
    235
    -
    236 log("[PASS] : TEST CASE 1 PASS!");
    -
    237 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    +
    236 log("[PASS] : TEST CASE 1 PASS!");
    +
    237 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    238 "~");
    239 }
    @@ -678,7 +677,7 @@ Here is the call graph for this function:
    void TestCases::testCase_2 ( - ) + ) @@ -700,8 +699,8 @@ Here is the call graph for this function:
    304 {
    305 const int expectedOutput = 21; ///< Expected output of this test
    306
    -
    307 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
    -
    308 log("This is test case 2 : ");
    +
    307 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
    +
    308 log("This is test case 2 : ");
    309
    310 operations_on_datastructures::inorder_traversal_of_bst::Node *root =
    311 nullptr;
    @@ -722,15 +721,15 @@ Here is the call graph for this function:
    326 inorder_traversal_of_bst::getInorderSuccessor(
    327 root, 20); ///< The inorder successor node for given data
    328
    -
    329 log("Checking assert expression...");
    +
    329 log("Checking assert expression...");
    330 assert(inorderSuccessor->data == expectedOutput);
    -
    331 log("Assertion check passed!");
    +
    331 log("Assertion check passed!");
    332
    333 operations_on_datastructures::inorder_traversal_of_bst::deallocate(
    334 root); /// memory cleanup!
    335
    -
    336 log("[PASS] : TEST CASE 2 PASS!");
    -
    337 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
    +
    336 log("[PASS] : TEST CASE 2 PASS!");
    +
    337 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
    338 }
    operations_on_datastructures::inorder_traversal_of_bst::Node::data
    int64_t data
    The key/value of the node.
    Definition inorder_successor_of_bst.cpp:58
    @@ -753,7 +752,7 @@ Here is the call graph for this function:
    void TestCases::testCase_2 ( - ) + ) @@ -777,11 +776,11 @@ Here is the call graph for this function:
    229 {
    230 const bool expectedOutput = true; /// Expected output of this test
    231
    -
    232 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    +
    232 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    233 "~");
    -
    234 log("This is test case 2 for sublist search Algorithm : ");
    -
    235 log("Description:");
    -
    236 log(" contains main list of 100 elements and sublist of 20");
    +
    234 log("This is test case 2 for sublist search Algorithm : ");
    +
    235 log("Description:");
    +
    236 log(" contains main list of 100 elements and sublist of 20");
    237
    238 std::vector<uint64_t> sublistData(
    239 20); ///< Data to make linked list which will be the sublist
    @@ -811,12 +810,12 @@ Here is the call graph for this function:
    263 bool exists = search::sublist_search::sublistSearch(
    264 sublistLL, mainlistLL); ///< boolean, if sublist exist or not
    265
    -
    266 log("Checking assert expression...");
    +
    266 log("Checking assert expression...");
    267 assert(exists == expectedOutput);
    -
    268 log("Assertion check passed!");
    +
    268 log("Assertion check passed!");
    269
    -
    270 log("[PASS] : TEST CASE 2 PASS!");
    -
    271 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    +
    270 log("[PASS] : TEST CASE 2 PASS!");
    +
    271 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    272 "~");
    273 }
    @@ -839,7 +838,7 @@ Here is the call graph for this function:
    void TestCases::testCase_2 ( - ) + ) @@ -854,11 +853,11 @@ Here is the call graph for this function:
    Returns
    void
    245 {
    246 const int64_t inputSize = 500;
    -
    247 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    +
    247 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    248 "~");
    -
    249 log("Description:");
    -
    250 log(" BIG INPUT : Contains 500 elements and repeated elements");
    -
    251 log("This is test case 2 for Random Pivot Quick Sort Algorithm : ");
    +
    249 log("Description:");
    +
    250 log(" BIG INPUT : Contains 500 elements and repeated elements");
    +
    251 log("This is test case 2 for Random Pivot Quick Sort Algorithm : ");
    252 std::array<int64_t, inputSize> unsorted_arr =
    253 sorting::random_pivot_quick_sort::generateUnsortedArray<inputSize>(
    254 1, 10000);
    @@ -866,18 +865,18 @@ Here is the call graph for this function:
    256 int64_t start = 0;
    257 int64_t end = unsorted_arr.size() - 1; // length - 1
    258
    -
    259 log("Running algorithm of data of length 500 ...");
    +
    259 log("Running algorithm of data of length 500 ...");
    260 std::array<int64_t, unsorted_arr.size()> sorted_arr =
    261 sorting::random_pivot_quick_sort::quickSortRP(unsorted_arr, start,
    262 end);
    -
    263 log("Algorithm finished!");
    +
    263 log("Algorithm finished!");
    264
    -
    265 log("Checking assert expression...");
    +
    265 log("Checking assert expression...");
    266 assert(std::is_sorted(sorted_arr.begin(), sorted_arr.end()));
    -
    267 log("Assertion check passed!");
    +
    267 log("Assertion check passed!");
    268
    -
    269 log("[PASS] : TEST CASE 2 PASS!");
    -
    270 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    +
    269 log("[PASS] : TEST CASE 2 PASS!");
    +
    270 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    271 "~");
    272 }
    @@ -900,7 +899,7 @@ Here is the call graph for this function:
    void TestCases::testCase_3 ( - ) + ) @@ -922,8 +921,8 @@ Here is the call graph for this function:
    345 {
    346 const int expectedOutput = 110; ///< Expected output of this test
    347
    -
    348 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
    -
    349 log("This is test case 3 : ");
    +
    348 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
    +
    349 log("This is test case 3 : ");
    350
    351 operations_on_datastructures::inorder_traversal_of_bst::Node *root =
    352 nullptr;
    @@ -945,15 +944,15 @@ Here is the call graph for this function:
    368 inorder_traversal_of_bst::getInorderSuccessor(
    369 root, 90); ///< The inorder successor node for given data
    370
    -
    371 log("Checking assert expression...");
    +
    371 log("Checking assert expression...");
    372 assert(inorderSuccessor->data == expectedOutput);
    -
    373 log("Assertion check passed!");
    +
    373 log("Assertion check passed!");
    374
    375 operations_on_datastructures::inorder_traversal_of_bst::deallocate(
    376 root); /// memory cleanup!
    377
    -
    378 log("[PASS] : TEST CASE 3 PASS!");
    -
    379 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
    +
    378 log("[PASS] : TEST CASE 3 PASS!");
    +
    379 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
    380 }
    Here is the call graph for this function:
    @@ -975,7 +974,7 @@ Here is the call graph for this function: void TestCases::testCase_3 ( - ) + ) @@ -999,11 +998,11 @@ Here is the call graph for this function:
    280 {
    281 const bool expectedOutput = false; ///< Expected output of this test
    282
    -
    283 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    +
    283 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    284 "~");
    -
    285 log("This is test case 3 for sublist search Algorithm : ");
    -
    286 log("Description:");
    -
    287 log(" contains main list of 50 elements and sublist of 20");
    +
    285 log("This is test case 3 for sublist search Algorithm : ");
    +
    286 log("Description:");
    +
    287 log(" contains main list of 50 elements and sublist of 20");
    288
    289 std::vector<uint64_t> sublistData(20); ///< Sublist to be searched
    290 std::vector<uint64_t> mainlistData(
    @@ -1030,12 +1029,12 @@ Here is the call graph for this function:
    311 bool exists = search::sublist_search::sublistSearch(
    312 sublistLL, mainlistLL); ///< boolean, if sublist exist or not
    313
    -
    314 log("Checking assert expression...");
    +
    314 log("Checking assert expression...");
    315 assert(exists == expectedOutput);
    -
    316 log("Assertion check passed!");
    +
    316 log("Assertion check passed!");
    317
    -
    318 log("[PASS] : TEST CASE 3 PASS!");
    -
    319 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    +
    318 log("[PASS] : TEST CASE 3 PASS!");
    +
    319 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    320 "~");
    321 }
    @@ -1058,7 +1057,7 @@ Here is the call graph for this function:
    void TestCases::testCase_3 ( - ) + ) @@ -1073,11 +1072,11 @@ Here is the call graph for this function:
    Returns
    void
    278 {
    279 const int64_t inputSize = 1000;
    -
    280 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    +
    280 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    281 "~");
    -
    282 log("This is test case 3 for Random Pivot Quick Sort Algorithm : ");
    -
    283 log("Description:");
    -
    284 log(" LARGE INPUT : Contains 1000 elements and repeated elements");
    +
    282 log("This is test case 3 for Random Pivot Quick Sort Algorithm : ");
    +
    283 log("Description:");
    +
    284 log(" LARGE INPUT : Contains 1000 elements and repeated elements");
    285 std::array<int64_t, inputSize> unsorted_arr =
    286 sorting::random_pivot_quick_sort::generateUnsortedArray<inputSize>(
    287 1, 10000);
    @@ -1085,18 +1084,18 @@ Here is the call graph for this function:
    289 int64_t start = 0;
    290 int64_t end = unsorted_arr.size() - 1; // length - 1
    291
    -
    292 log("Running algorithm...");
    +
    292 log("Running algorithm...");
    293 std::array<int64_t, unsorted_arr.size()> sorted_arr =
    294 sorting::random_pivot_quick_sort::quickSortRP(unsorted_arr, start,
    295 end);
    -
    296 log("Algorithm finished!");
    +
    296 log("Algorithm finished!");
    297
    -
    298 log("Checking assert expression...");
    +
    298 log("Checking assert expression...");
    299 assert(std::is_sorted(sorted_arr.begin(), sorted_arr.end()));
    -
    300 log("Assertion check passed!");
    +
    300 log("Assertion check passed!");
    301
    -
    302 log("[PASS] : TEST CASE 3 PASS!");
    -
    303 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    +
    302 log("[PASS] : TEST CASE 3 PASS!");
    +
    303 log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"
    304 "~");
    305 }
    @@ -1118,7 +1117,7 @@ Here is the call graph for this function:
    diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp.html b/d5/d58/persistent__seg__tree__lazy__prop_8cpp.html index a10a122bd..1e1ac8727 100644 --- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp.html +++ b/d5/d58/persistent__seg__tree__lazy__prop_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: range_queries/persistent_seg_tree_lazy_prop.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -132,10 +134,10 @@ Namespaces - + - +

    Functions

    static void test ()
    static void test ()
     Test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -153,8 +155,7 @@ Functions int main ( - void  - ) + void ) @@ -163,14 +164,14 @@ Functions

    Main function.

    Returns
    0 on exit
    318 {
    -
    319 test(); // run self-test implementations
    +
    319 test(); // run self-test implementations
    320 return 0;
    321}
    -
    test
    static void test()
    Test implementations.
    Definition persistent_seg_tree_lazy_prop.cpp:268
    +
    test
    static void test()
    Test implementations.
    Definition persistent_seg_tree_lazy_prop.cpp:268
    Here is the call graph for this function:
    -
    +
    @@ -187,7 +188,7 @@ Here is the call graph for this function: static void test ( - ) + ) @@ -256,7 +257,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -267,7 +268,7 @@ Here is the call graph for this function: diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map index b61f7d9a3..fa53809a2 100644 --- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map +++ b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -2,21 +2,22 @@ - - + + - + - - - + + + - - - - - - - - + + + + + + + + + diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 index 90106a9f3..345050071 100644 --- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 +++ b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -1 +1 @@ -0097962e588e98b2b178345844fc506d \ No newline at end of file +4ceac9a6d05fe03748d7bde99bc85d27 \ No newline at end of file diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index edefd0f46..585f0be1b 100644 --- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -4,7 +4,7 @@ - + - + operator<< Node1 - -operator<< + +operator<< @@ -31,8 +31,8 @@ Node2 - -Complex::imag + +Complex::imag @@ -40,17 +40,17 @@ Node1->Node2 - - + + Node3 - - -operator<< + + +Complex::real @@ -58,107 +58,8 @@ Node1->Node3 - - - - - - - -Node8 - - -Complex::real - - - - - -Node1->Node8 - - - - - - - - -Node3->Node3 - - - - - - - - -Node4 - - -std::endl - - - - - -Node3->Node4 - - - - - - - - -Node5 - - -std::left - - - - - -Node3->Node5 - - - - - - - - -Node6 - - -std::setfill - - - - - -Node3->Node6 - - - - - - - - -Node7 - - -std::setw - - - - - -Node3->Node7 - - - + + diff --git a/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph_org.svg b/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph_org.svg index 94b2eccb7..cff943786 100644 --- a/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph_org.svg +++ b/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + operator<< Node1 - -operator<< + +operator<< @@ -21,8 +21,8 @@ Node2 - -Complex::imag + +Complex::imag @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node3 - - -operator<< + + +Complex::real @@ -48,107 +48,8 @@ Node1->Node3 - - - - - - - -Node8 - - -Complex::real - - - - - -Node1->Node8 - - - - - - - - -Node3->Node3 - - - - - - - - -Node4 - - -std::endl - - - - - -Node3->Node4 - - - - - - - - -Node5 - - -std::left - - - - - -Node3->Node5 - - - - - - - - -Node6 - - -std::setfill - - - - - -Node3->Node6 - - - - - - - - -Node7 - - -std::setw - - - - - -Node3->Node7 - - - + + diff --git a/d5/d7a/largest__power_8cpp.html b/d5/d7a/largest__power_8cpp.html index 1ee296c51..2a4a9cc86 100644 --- a/d5/d7a/largest__power_8cpp.html +++ b/d5/d7a/largest__power_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/largest_power.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -125,10 +127,10 @@ Functions uint64_t math::largestPower (uint32_t n, const uint16_t &p)  Function to calculate largest power.
      -static void test () +static void test ()  Function for testing largestPower function. test cases and assert statement.
      -int main () +int main ()  Main function.
      @@ -146,8 +148,7 @@ Functions int main ( - void  - ) + void ) @@ -156,10 +157,10 @@ Functions

    Main function.

    Returns
    0 on exit
    75{
    -
    76 test(); // execute the tests
    +
    76 test(); // execute the tests
    77 return 0;
    78}
    -
    test
    static void test()
    Function for testing largestPower function. test cases and assert statement.
    Definition largest_power.cpp:47
    +
    test
    static void test()
    Function for testing largestPower function. test cases and assert statement.
    Definition largest_power.cpp:47
    Here is the call graph for this function:
    @@ -180,7 +181,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -231,7 +232,7 @@ Here is the call graph for this function:
    diff --git a/d5/d83/lcm__sum_8cpp.html b/d5/d83/lcm__sum_8cpp.html index 304285c36..2227a3283 100644 --- a/d5/d83/lcm__sum_8cpp.html +++ b/d5/d83/lcm__sum_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/lcm_sum.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,9 +128,9 @@ Namespaces Functions uint64_t math::lcmSum (const uint16_t &num)   -static void test () +static void test ()   -int main () +int main ()  Main function.
      @@ -151,8 +153,7 @@ Functions int main ( - void  - ) + void ) @@ -161,10 +162,10 @@ Functions

    Main function.

    Returns
    0 on exit
    96 {
    -
    97 test(); // execute the tests
    +
    97 test(); // execute the tests
    98 return 0;
    99}
    -
    test
    static void test()
    Definition lcm_sum.cpp:65
    +
    test
    static void test()
    Definition lcm_sum.cpp:65
    Here is the call graph for this function:
    @@ -185,7 +186,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -242,7 +243,7 @@ Here is the call graph for this function:
    diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html index a08c2101b..b06a05905 100644 --- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html +++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Backtracking + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -556,7 +558,7 @@ Strings diff --git a/d5/d89/namespacepalindrome__partitioning.html b/d5/d89/namespacepalindrome__partitioning.html index 80bfad7ad..39eeee2dd 100644 --- a/d5/d89/namespacepalindrome__partitioning.html +++ b/d5/d89/namespacepalindrome__partitioning.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: palindrome_partitioning Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d5/d89/namespacepalindrome__partitioni

    Functions for Palindrome Partitioning algorithm. -More...

    +More...

    Detailed Description

    Functions for Palindrome Partitioning algorithm.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d5/d89/namespacepalindrome__partitioni diff --git a/d5/d8a/classothers_1_1postfix__expression_1_1_stack.html b/d5/d8a/classothers_1_1postfix__expression_1_1_stack.html index 72ccf9df0..c970b4711 100644 --- a/d5/d8a/classothers_1_1postfix__expression_1_1_stack.html +++ b/d5/d8a/classothers_1_1postfix__expression_1_1_stack.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others::postfix_expression::Stack Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -105,7 +107,7 @@ $(document).ready(function(){initNavTree('d5/d8a/classothers_1_1postfix__express

    Creates an array to be used as stack for storing values. - More...

    + More...

    Collaboration diagram for others::postfix_expression::Stack:
    @@ -114,7 +116,7 @@ Collaboration diagram for others::postfix_expression::Stack:
    - + diff --git a/d5/d8a/trie__using__hashmap_8cpp.html b/d5/d8a/trie__using__hashmap_8cpp.html index 17a26f01a..99402b328 100644 --- a/d5/d8a/trie__using__hashmap_8cpp.html +++ b/d5/d8a/trie__using__hashmap_8cpp.html @@ -3,16 +3,18 @@ - +Algorithms_in_C++: data_structures/trie_using_hashmap.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({

    Public Attributes

    std::array< float, 20 > stack {}
    std::array< float, 20 > stack {}
     Array which will be used to store numbers in the input.
     
    @@ -151,7 +153,7 @@ int stackTop = -1
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -139,10 +141,10 @@ Namespaces - + - +

    Functions

    static void test ()
    static void test ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -160,8 +162,7 @@ Functions int main ( - void  - ) + void ) @@ -170,10 +171,10 @@ Functions

    Main function.

    Returns
    0 on exit
    342 {
    -
    343 test(); // run self-test implementaions
    +
    343 test(); // run self-test implementaions
    344 return 0;
    345}
    -
    test
    static void test()
    Self-test implementations.
    Definition trie_using_hashmap.cpp:221
    +
    test
    static void test()
    Self-test implementations.
    Definition trie_using_hashmap.cpp:221
    Here is the call graph for this function:
    @@ -194,7 +195,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -348,7 +349,7 @@ Here is the call graph for this function:
    diff --git a/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html b/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html index 6338ae1ac..0827676c6 100644 --- a/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html +++ b/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d9/df7/structothers_1_1recursive__tree diff --git a/d5/d90/palindrome__partitioning_8cpp.html b/d5/d90/palindrome__partitioning_8cpp.html index 6432dfd12..d0e7dcbd3 100644 --- a/d5/d90/palindrome__partitioning_8cpp.html +++ b/d5/d90/palindrome__partitioning_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/palindrome_partitioning.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,12 +130,12 @@ Namespaces - + - + - +

    Functions

    int dynamic_programming::palindrome_partitioning::pal_part (const std::string &str)
    int dynamic_programming::palindrome_partitioning::pal_part (const std::string &str)
     
    static void test ()
    static void test ()
     Test Function.
     
    int main ()
    int main ()
     Main function.
     
    @@ -151,8 +153,7 @@ Functions int main ( - void  - ) + void ) @@ -161,10 +162,10 @@ Functions

    Main function.

    Returns
    0 on exit
    128 {
    -
    129 test(); // execute the test
    +
    129 test(); // execute the test
    130 return 0;
    131}
    -
    test
    static void test()
    Test Function.
    Definition palindrome_partitioning.cpp:98
    +
    test
    static void test()
    Test Function.
    Definition palindrome_partitioning.cpp:98
    Here is the call graph for this function:
    @@ -182,8 +183,7 @@ Here is the call graph for this function:
    int dynamic_programming::palindrome_partitioning::pal_part ( - const std::string &  - str) + const std::string & str) @@ -265,7 +265,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -287,7 +287,7 @@ Here is the call graph for this function:
    104
    105 for (int i = 0; i < 3; i++) {
    106 calculated_output[i] =
    -
    107 dynamic_programming::palindrome_partitioning::pal_part(
    +
    107 dynamic_programming::palindrome_partitioning::pal_part(
    108 custom_input[i]);
    109 }
    110
    @@ -304,7 +304,7 @@ Here is the call graph for this function:
    121 std::cout << "All tests passed successfully!\n";
    122}
    -
    dynamic_programming::palindrome_partitioning::pal_part
    int pal_part(const std::string &str)
    Definition palindrome_partitioning.cpp:45
    +
    dynamic_programming::palindrome_partitioning::pal_part
    int pal_part(const std::string &str)
    Definition palindrome_partitioning.cpp:45
    @@ -314,7 +314,7 @@ Here is the call graph for this function: diff --git a/d5/d91/namespacesorting.html b/d5/d91/namespacesorting.html index e50b21d02..71abba2c1 100644 --- a/d5/d91/namespacesorting.html +++ b/d5/d91/namespacesorting.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -104,76 +106,76 @@ $(document).ready(function(){initNavTree('d5/d91/namespacesorting.html','../../'

    for working with vectors -More...

    +More...

    - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - +

    Functions

    template<class T >
    int64_t binary_search (std::vector< T > &arr, T val, int64_t low, int64_t high)
    int64_t binary_search (std::vector< T > &arr, T val, int64_t low, int64_t high)
     Binary search function to find the most suitable pace for an element.
     
    template<typename T >
    void insertionSort_binsrch (std::vector< T > &arr)
    void insertionSort_binsrch (std::vector< T > &arr)
     Insertion sort function to sort the vector.
     
    template<typename T , size_t N>
    std::array< T, N > shuffle (std::array< T, N > arr)
    std::array< T, N > shuffle (std::array< T, N > arr)
     
    template<typename T , size_t N>
    std::array< T, N > randomized_bogosort (std::array< T, N > arr)
    std::array< T, N > randomized_bogosort (std::array< T, N > arr)
     
    template<typename T >
    void gnomeSort (T *arr, int size)
    void gnomeSort (T *arr, int size)
     
    template<typename T , size_t size>
    std::array< T, size > gnomeSort (std::array< T, size > arr)
    std::array< T, size > gnomeSort (std::array< T, size > arr)
     
    template<typename T >
    void insertionSort (T *arr, int n)
    void insertionSort (T *arr, int n)
     Insertion Sort Function.
     
    template<typename T >
    void insertionSort (std::vector< T > *arr)
    void insertionSort (std::vector< T > *arr)
     
    template<class Iterator >
    void merge (Iterator l, Iterator r, const Iterator e, char b[])
    void merge (Iterator l, Iterator r, const Iterator e, char b[])
     merges 2 sorted adjacent segments into a larger sorted segment
     
    template<class Iterator >
    void non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n)
    void non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n)
     bottom-up merge sort which sorts elements in a non-decreasing order
     
    template<class Iterator >
    void non_recursive_merge_sort (const Iterator first, const size_t n)
    void non_recursive_merge_sort (const Iterator first, const size_t n)
     bottom-up merge sort which sorts elements in a non-decreasing order
     
    template<class Iterator >
    void non_recursive_merge_sort (const Iterator first, const Iterator last)
    void non_recursive_merge_sort (const Iterator first, const Iterator last)
     bottom-up merge sort which sorts elements in a non-decreasing order
     
    template<std::size_t N>
    std::array< int, N > pigeonSort (std::array< int, N > arr)
    std::array< int, N > pigeonSort (std::array< int, N > arr)
     
    template<typename T >
    void quicksort (std::vector< T > *arr, int32_t low, int32_t high)
    void quicksort (std::vector< T > *arr, int32_t low, int32_t high)
     
    template<typename T >
    std::vector< T > quicksort (std::vector< T > arr, int32_t low, int32_t high)
    std::vector< T > quicksort (std::vector< T > arr, int32_t low, int32_t high)
     
    template<typename T >
    void recursive_bubble_sort (std::vector< T > *nums, uint64_t n)
    void recursive_bubble_sort (std::vector< T > *nums, uint64_t n)
     This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is then dereferenced, so that the changes are reflected in the original vector. It also accepts a second parameter of type int and name n, which is the size of the array.
     
    std::vector< uint64_t > selectionSort (const std::vector< uint64_t > &arr, uint64_t len)
    std::vector< uint64_t > selectionSort (const std::vector< uint64_t > &arr, uint64_t len)
     
    template<typename T >
    void shell_sort (T *arr, size_t LEN)
    void shell_sort (T *arr, size_t LEN)
     
    template<typename T , size_t N>
    void shell_sort (T(&arr)[N])
    void shell_sort (T(&arr)[N])
     
    template<typename T >
    void shell_sort (std::vector< T > *arr)
    void shell_sort (std::vector< T > *arr)
     

    Detailed Description

    @@ -218,31 +220,22 @@ template<class T >
    int64_t sorting::binary_search ( - std::vector< T > &  - arr, + std::vector< T > & arr, - T  - val, + T val, - int64_t  - low, + int64_t low, - int64_t  - high  - - - - ) - + int64_t high )
    @@ -297,8 +290,7 @@ template<typename T , size_t size>
    std::array< T, size > sorting::gnomeSort ( - std::array< T, size >  - arr) + std::array< T, size > arr) @@ -355,19 +347,12 @@ template<typename T > void sorting::gnomeSort ( - T *  - arr, + T * arr, - int  - size  - - - - ) - + int size )
    @@ -414,8 +399,7 @@ template<typename T >
    void sorting::insertionSort ( - std::vector< T > *  - arr) + std::vector< T > * arr) @@ -466,19 +450,12 @@ template<typename T > void sorting::insertionSort ( - T *  - arr, + T * arr, - int  - n  - - - - ) - + int n )
    @@ -522,8 +499,7 @@ template<typename T >
    void sorting::insertionSort_binsrch ( - std::vector< T > &  - arr) + std::vector< T > & arr) @@ -549,7 +525,7 @@ template<typename T >
    87 for (int64_t i = 1; i < n; i++) {
    88 T key = arr[i];
    89 int64_t j = i - 1;
    -
    90 int64_t loc = sorting::binary_search(arr, key, 0, j);
    +
    90 int64_t loc = sorting::binary_search(arr, key, 0, j);
    91 while (j >= loc) {
    92 arr[j + 1] = arr[j];
    93 j--;
    @@ -557,7 +533,7 @@ template<typename T >
    95 arr[j + 1] = key;
    96 }
    97}
    -
    sorting::binary_search
    int64_t binary_search(std::vector< T > &arr, T val, int64_t low, int64_t high)
    Binary search function to find the most suitable pace for an element.
    Definition binary_insertion_sort.cpp:63
    +
    sorting::binary_search
    int64_t binary_search(std::vector< T > &arr, T val, int64_t low, int64_t high)
    Binary search function to find the most suitable pace for an element.
    Definition binary_insertion_sort.cpp:63
    Here is the call graph for this function:
    @@ -577,31 +553,22 @@ template<class Iterator >
    void sorting::merge ( - Iterator  - l, + Iterator l, - Iterator  - r, + Iterator r, - const Iterator  - e, + const Iterator e, - char  - b[]  - - - - ) - + char b[] )
    @@ -650,19 +617,12 @@ template<class Iterator >
    void sorting::non_recursive_merge_sort ( - const Iterator  - first, + const Iterator first, - const Iterator  - last  - - - - ) - + const Iterator last )
    @@ -676,13 +636,12 @@ template<class Iterator >
    86 {
    -
    87 non_recursive_merge_sort(first, last, last - first);
    +
    87 non_recursive_merge_sort(first, last, last - first);
    88}
    -
    sorting::non_recursive_merge_sort
    void non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)
    bottom-up merge sort which sorts elements in a non-decreasing order
    Definition non_recursive_merge_sort.cpp:25
    Here is the call graph for this function:
    -
    +
    @@ -698,25 +657,17 @@ template<class Iterator > void sorting::non_recursive_merge_sort ( - const Iterator  - first, + const Iterator first, - const Iterator  - last, + const Iterator last, - const size_t  - n  - - - - ) - + const size_t n )
    @@ -756,7 +707,7 @@ template<class Iterator >
    Here is the call graph for this function:
    -
    +
    @@ -772,19 +723,12 @@ template<class Iterator > void sorting::non_recursive_merge_sort ( - const Iterator  - first, + const Iterator first, - const size_t  - n  - - - - ) - + const size_t n )
    @@ -798,12 +742,12 @@ template<class Iterator >
    77 {
    -
    78 non_recursive_merge_sort(first, first + n, n);
    +
    78 non_recursive_merge_sort(first, first + n, n);
    79}
    Here is the call graph for this function:
    -
    +
    @@ -819,8 +763,7 @@ template<std::array< int, N > sorting::pigeonSort ( - std::array< int, N >  - arr) + std::array< int, N > arr) @@ -882,25 +825,17 @@ template<typename T > void sorting::quicksort ( - std::vector< T > *  - arr, + std::vector< T > * arr, - int32_t  - low, + int32_t low, - int32_t  - high  - - - - ) - + int32_t high )
    @@ -951,25 +886,17 @@ template<typename T >
    std::vector< T > sorting::quicksort ( - std::vector< T >  - arr, + std::vector< T > arr, - int32_t  - low, + int32_t low, - int32_t  - high  - - - - ) - + int32_t high )
    @@ -1023,8 +950,7 @@ template<typename T , size_t N>
    std::array< T, N > sorting::randomized_bogosort ( - std::array< T, N >  - arr) + std::array< T, N > arr) @@ -1071,19 +997,12 @@ template<typename T > void sorting::recursive_bubble_sort ( - std::vector< T > *  - nums, + std::vector< T > * nums, - uint64_t  - n  - - - - ) - + uint64_t n )
    @@ -1118,9 +1037,9 @@ template<typename T >
    84 }
    85
    86 //!< calling the function after we have fixed the last element
    -
    87 recursive_bubble_sort(nums, n - 1);
    +
    87 recursive_bubble_sort(nums, n - 1);
    88}
    -
    sorting::recursive_bubble_sort
    void recursive_bubble_sort(std::vector< T > *nums, uint64_t n)
    This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...
    Definition recursive_bubble_sort.cpp:74
    +
    sorting::recursive_bubble_sort
    void recursive_bubble_sort(std::vector< T > *nums, uint64_t n)
    This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...
    Definition recursive_bubble_sort.cpp:74
    Here is the call graph for this function:
    @@ -1138,19 +1057,12 @@ Here is the call graph for this function:
    std::vector< uint64_t > sorting::selectionSort ( - const std::vector< uint64_t > &  - arr, + const std::vector< uint64_t > & arr, - uint64_t  - len  - - - - ) - + uint64_t len )
    @@ -1191,22 +1103,20 @@ template<typename T >
    void sorting::shell_sort ( - std::vector< T > *  - arr) + std::vector< T > * arr)

    function overload - when input array is of type std::vector, simply send the data content and the data length to the above function.

    75 {
    -
    76 shell_sort(arr->data(), arr->size());
    +
    76 shell_sort(arr->data(), arr->size());
    77}
    std::vector::data
    T data(T... args)
    -
    sorting::shell_sort
    void shell_sort(T *arr, size_t LEN)
    Definition shell_sort2.cpp:45
    Here is the call graph for this function:
    -
    +
    @@ -1222,19 +1132,12 @@ template<typename T > void sorting::shell_sort ( - T *  - arr, + T * arr, - size_t  - LEN  - - - - ) - + size_t LEN )
    @@ -1257,12 +1160,7 @@ template<typename T >
    60 }
    61 }
    62}
    -
    -Here is the call graph for this function:
    -
    -
    -
    - + @@ -1276,20 +1174,19 @@ template<typename T , size_t N> void sorting::shell_sort ( - T(&)  - arr[N]) + T(&) arr[N])

    function overload - when input array is of a known length array type

    67 {
    -
    68 shell_sort(arr, N);
    +
    68 shell_sort(arr, N);
    69}
    Here is the call graph for this function:
    -
    +
    @@ -1305,8 +1202,7 @@ template<typename T , size_t N> std::array< T, N > sorting::shuffle ( - std::array< T, N >  - arr) + std::array< T, N > arr) @@ -1347,7 +1243,7 @@ Here is the call graph for this function: diff --git a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.map b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.map index 560fac6e5..ed8867d92 100644 --- a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.map +++ b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.map @@ -1,8 +1,7 @@ - - - - - - + + + + + diff --git a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5 b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5 index 93274cdbb..1fa49c646 100644 --- a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5 +++ b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5 @@ -1 +1 @@ -19fa039014cc0372e81b3658367643c5 \ No newline at end of file +a3b514c723edd649aeae410f680d5978 \ No newline at end of file diff --git a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg index 12ec51516..806f9bc51 100644 --- a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg +++ b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg @@ -4,8 +4,8 @@ - + - + sorting::non_recursive_merge_sort @@ -28,15 +28,6 @@ - - -Node1->Node1 - - - - - - Node2 diff --git a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph_org.svg b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph_org.svg index 02dfc0398..5eb4281e0 100644 --- a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph_org.svg +++ b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph_org.svg @@ -4,9 +4,9 @@ - - + + sorting::non_recursive_merge_sort @@ -18,15 +18,6 @@ - - -Node1->Node1 - - - - - - Node2 diff --git a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map index 1b10d4703..434934064 100644 --- a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map +++ b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map @@ -1,10 +1,9 @@ - - - - - - - - + + + + + + + diff --git a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5 b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5 index a4424a52a..27c02640c 100644 --- a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5 +++ b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5 @@ -1 +1 @@ -93979b499ce8c6abd1bef1cc44c4f39e \ No newline at end of file +a19f33b868f3b01e094268cfb88500b5 \ No newline at end of file diff --git a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg index 4ce5b924e..61c78d947 100644 --- a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg +++ b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg @@ -4,8 +4,8 @@ - + - + sorting::non_recursive_merge_sort @@ -47,15 +47,6 @@ - - -Node2->Node2 - - - - - - Node3 diff --git a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph_org.svg b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph_org.svg index dc92b2425..f0787d284 100644 --- a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph_org.svg +++ b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph_org.svg @@ -4,9 +4,9 @@ - - + + sorting::non_recursive_merge_sort @@ -37,15 +37,6 @@ - - -Node2->Node2 - - - - - - Node3 diff --git a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map index a96123b1d..5c9bef932 100644 --- a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map +++ b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map @@ -1,6 +1,5 @@ - - - - + + + diff --git a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5 b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5 index 3b8cff051..97f0a159b 100644 --- a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5 +++ b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5 @@ -1 +1 @@ -48c384bacc3e00b10c23a9298b8dbf8e \ No newline at end of file +538fc8e222c1748c7c25300779c7c3dd \ No newline at end of file diff --git a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg index 765f172d3..e345c9527 100644 --- a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg +++ b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg @@ -4,8 +4,8 @@ - + - + sorting::shell_sort @@ -45,15 +45,6 @@ - - -Node2->Node2 - - - - - - diff --git a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph_org.svg b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph_org.svg index f1ebef187..795471187 100644 --- a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph_org.svg +++ b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph_org.svg @@ -4,9 +4,9 @@ - - + + sorting::shell_sort @@ -35,14 +35,5 @@ - - -Node2->Node2 - - - - - - diff --git a/d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph.map b/d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph.map deleted file mode 100644 index 88f393f2c..000000000 --- a/d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph.md5 b/d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph.md5 deleted file mode 100644 index 39bf8f655..000000000 --- a/d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -2210290cd3408146fe6e503fc1ba5e44 \ No newline at end of file diff --git a/d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph_org.svg b/d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph_org.svg deleted file mode 100644 index 2d154da31..000000000 --- a/d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph_org.svg +++ /dev/null @@ -1,30 +0,0 @@ - - - - - - -sorting::shell_sort - - -Node1 - - -sorting::shell_sort - - - - - -Node1->Node1 - - - - - - - - diff --git a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map index 1b10d4703..434934064 100644 --- a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map +++ b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map @@ -1,10 +1,9 @@ - - - - - - - - + + + + + + + diff --git a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5 b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5 index a4424a52a..27c02640c 100644 --- a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5 +++ b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5 @@ -1 +1 @@ -93979b499ce8c6abd1bef1cc44c4f39e \ No newline at end of file +a19f33b868f3b01e094268cfb88500b5 \ No newline at end of file diff --git a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg index 4ce5b924e..61c78d947 100644 --- a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg +++ b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg @@ -4,8 +4,8 @@ - + - + sorting::non_recursive_merge_sort @@ -47,15 +47,6 @@ - - -Node2->Node2 - - - - - - Node3 diff --git a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph_org.svg b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph_org.svg index dc92b2425..f0787d284 100644 --- a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph_org.svg +++ b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph_org.svg @@ -4,9 +4,9 @@ - - + + sorting::non_recursive_merge_sort @@ -37,15 +37,6 @@ - - -Node2->Node2 - - - - - - Node3 diff --git a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map index eda17710c..aa62acd95 100644 --- a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map +++ b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map @@ -1,10 +1,9 @@ - + - - - - - - + + + + + diff --git a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5 b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5 index 17386dcf0..c952f3ff0 100644 --- a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5 +++ b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5 @@ -1 +1 @@ -89f937537c49515816bb8c1e29d0314a \ No newline at end of file +f728685de3c74cdc83b5b85362c1427c \ No newline at end of file diff --git a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg index 4c0361cbe..b1d1c1a68 100644 --- a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg +++ b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg @@ -4,8 +4,8 @@ - + - + sorting::shell_sort @@ -31,8 +31,8 @@ Node2 - -std::vector::data + +std::vector::data @@ -40,8 +40,8 @@ Node1->Node2 - - + + @@ -73,23 +73,14 @@ - + Node1->Node4 - + - - -Node3->Node3 - - - - - - diff --git a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph_org.svg b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph_org.svg index c3f7898ff..d3e2e427e 100644 --- a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph_org.svg +++ b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph_org.svg @@ -4,9 +4,9 @@ - - + + sorting::shell_sort @@ -21,8 +21,8 @@ Node2 - -std::vector::data + +std::vector::data @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -63,22 +63,13 @@ - + Node1->Node4 - + - - -Node3->Node3 - - - - - - diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap.html b/d5/d95/structdata__structures_1_1treap_1_1_treap.html index 72d62044a..9d47baaa0 100644 --- a/d5/d95/structdata__structures_1_1treap_1_1_treap.html +++ b/d5/d95/structdata__structures_1_1treap_1_1_treap.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures::treap::Treap Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d5/d95/structdata__structures_1_1treap

    Struct representation of the treap. - More...

    + More...

    Collaboration diagram for data_structures::treap::Treap:
    @@ -115,43 +117,43 @@ Collaboration diagram for data_structures::treap::Treap:
    - + - + - + - + - + - + - + - + - + - + - + - + - +

    Public Member Functions

     Treap ()
     Treap ()
     Initialization.
     
    void update (int x)
    void update (int x)
     Update the subtree size of the node.
     
    void rotate (int &x, int t)
    void rotate (int &x, int t)
     Rotate without breaking the property of BST.
     
    void _insert (int &x, int k)
    void _insert (int &x, int k)
     Insert a value into the specified subtree (internal method)
     
    void _erase (int &x, int k)
    void _erase (int &x, int k)
     Erase a value from the specified subtree (internal method)
     
    int _get_k_th (int &x, int k)
    int _get_k_th (int &x, int k)
     Find the KTH largest value (internal method)
     
    int _get_rank (int x, int k)
    int _get_rank (int x, int k)
     Query the rank of specified element (internal method)
     
    int get_predecessor (int k)
    int get_predecessor (int k)
     Get the predecessor node of element k.
     
    int get_next (int k)
    int get_next (int k)
     Get the successor node of element k.
     
    void insert (int k)
    void insert (int k)
     Insert element (External method)
     
    void erase (int k)
    void erase (int k)
     Erase element (External method)
     
    int get_k_th (int k)
    int get_k_th (int k)
     Get the KTH largest value (External method)
     
    int get_rank (int k)
    int get_rank (int k)
     Get the rank of specified element (External method)
     
    @@ -165,18 +167,18 @@ int  int  - + - + - + - + - +
    root = 0
    treapCnt = 0
     Total number of current nodes in the treap.
     
    std::array< int, maxNode > key = {}
    std::array< int, maxNode > key = {}
     Node identifier.
     
    std::array< int, maxNode > priority = {}
    std::array< int, maxNode > priority = {}
     Random priority.
     
    std::array< std::array< int, 2 >, maxNode > childs
    std::array< std::array< int, 2 >, maxNode > childs
     
    std::array< int, maxNode > cnt
    std::array< int, maxNode > cnt
     Maintains the subtree size for ranking query.
     
    std::array< int, maxNode > size = {}
    std::array< int, maxNode > size = {}
     The number of copies per node.
     
    @@ -195,7 +197,7 @@ int treapCnt = 0< data_structures::treap::Treap::Treap ( - ) + ) @@ -207,13 +209,13 @@ int treapCnt = 0<

    Initialization.

    -
    54 : treapCnt(1) {
    -
    55 priority[0] = INT32_MAX;
    -
    56 size[0] = 0;
    +
    54 : treapCnt(1) {
    +
    55 priority[0] = INT32_MAX;
    +
    56 size[0] = 0;
    57 }
    -
    data_structures::treap::Treap::treapCnt
    int treapCnt
    Total number of current nodes in the treap.
    Definition treap.cpp:41
    -
    data_structures::treap::Treap::priority
    std::array< int, maxNode > priority
    Random priority.
    Definition treap.cpp:43
    -
    data_structures::treap::Treap::size
    std::array< int, maxNode > size
    The number of copies per node.
    Definition treap.cpp:50
    +
    data_structures::treap::Treap::treapCnt
    int treapCnt
    Total number of current nodes in the treap.
    Definition treap.cpp:41
    +
    data_structures::treap::Treap::priority
    std::array< int, maxNode > priority
    Random priority.
    Definition treap.cpp:43
    +
    data_structures::treap::Treap::size
    std::array< int, maxNode > size
    The number of copies per node.
    Definition treap.cpp:50
    @@ -230,19 +232,12 @@ int treapCnt = 0< void data_structures::treap::Treap::_erase ( - int &  - x, + int & x, - int  - k  - - - - ) - + int k ) @@ -261,32 +256,32 @@ int treapCnt = 0<
    111 {
    -
    112 if (key[x] == k) {
    -
    113 if (cnt[x] > 1) {
    -
    114 cnt[x]--;
    +
    112 if (key[x] == k) {
    +
    113 if (cnt[x] > 1) {
    +
    114 cnt[x]--;
    115 } // If the node has more than one copy, the number of copies --
    116 else {
    -
    117 if (childs[x][0] == 0 && childs[x][1] == 0) {
    +
    117 if (childs[x][0] == 0 && childs[x][1] == 0) {
    118 x = 0;
    119 return;
    120 } // If there are no children, delete and return
    121 // Otherwise, we need to rotate the sons and delete them
    122 // recursively
    -
    123 int t = (priority[childs[x][0]] > priority[childs[x][1]]);
    -
    124 rotate(x, t);
    -
    125 _erase(x, k);
    +
    123 int t = (priority[childs[x][0]] > priority[childs[x][1]]);
    +
    124 rotate(x, t);
    +
    125 _erase(x, k);
    126 }
    127 } else { // Find the target value based on BST properties
    -
    128 _erase(childs[x][key[x] < k], k);
    +
    128 _erase(childs[x][key[x] < k], k);
    129 }
    -
    130 update(x);
    +
    130 update(x);
    131 }
    -
    data_structures::treap::Treap::key
    std::array< int, maxNode > key
    Node identifier.
    Definition treap.cpp:42
    -
    data_structures::treap::Treap::rotate
    void rotate(int &x, int t)
    Rotate without breaking the property of BST.
    Definition treap.cpp:70
    -
    data_structures::treap::Treap::update
    void update(int x)
    Update the subtree size of the node.
    Definition treap.cpp:62
    -
    data_structures::treap::Treap::childs
    std::array< std::array< int, 2 >, maxNode > childs
    Definition treap.cpp:44
    -
    data_structures::treap::Treap::_erase
    void _erase(int &x, int k)
    Erase a value from the specified subtree (internal method)
    Definition treap.cpp:111
    -
    data_structures::treap::Treap::cnt
    std::array< int, maxNode > cnt
    Maintains the subtree size for ranking query.
    Definition treap.cpp:48
    +
    data_structures::treap::Treap::key
    std::array< int, maxNode > key
    Node identifier.
    Definition treap.cpp:42
    +
    data_structures::treap::Treap::rotate
    void rotate(int &x, int t)
    Rotate without breaking the property of BST.
    Definition treap.cpp:70
    +
    data_structures::treap::Treap::update
    void update(int x)
    Update the subtree size of the node.
    Definition treap.cpp:62
    +
    data_structures::treap::Treap::childs
    std::array< std::array< int, 2 >, maxNode > childs
    Definition treap.cpp:44
    +
    data_structures::treap::Treap::_erase
    void _erase(int &x, int k)
    Erase a value from the specified subtree (internal method)
    Definition treap.cpp:111
    +
    data_structures::treap::Treap::cnt
    std::array< int, maxNode > cnt
    Maintains the subtree size for ranking query.
    Definition treap.cpp:48
    Here is the call graph for this function:
    @@ -307,19 +302,12 @@ Here is the call graph for this function:
    int data_structures::treap::Treap::_get_k_th ( - int &  - x, + int & x, - int  - k  - - - - ) - + int k ) @@ -339,17 +327,17 @@ Here is the call graph for this function:
    Returns
    The element ranked number k
    138 {
    -
    139 if (k <= size[childs[x][0]]) {
    -
    140 return _get_k_th(childs[x][0], k);
    +
    139 if (k <= size[childs[x][0]]) {
    +
    140 return _get_k_th(childs[x][0], k);
    141 }
    -
    142 k -= size[childs[x][0]] + cnt[x];
    +
    142 k -= size[childs[x][0]] + cnt[x];
    143 if (k <= 0) {
    -
    144 return key[x];
    +
    144 return key[x];
    145 }
    -
    146 return _get_k_th(childs[x][1], k);
    +
    146 return _get_k_th(childs[x][1], k);
    147 }
    numerical_methods::simpson_method::k
    double k(double x)
    Another test function.
    Definition composite_simpson_rule.cpp:117
    -
    data_structures::treap::Treap::_get_k_th
    int _get_k_th(int &x, int k)
    Find the KTH largest value (internal method)
    Definition treap.cpp:138
    +
    data_structures::treap::Treap::_get_k_th
    int _get_k_th(int &x, int k)
    Find the KTH largest value (internal method)
    Definition treap.cpp:138
    Here is the call graph for this function:
    @@ -370,19 +358,12 @@ Here is the call graph for this function:
    int data_structures::treap::Treap::_get_rank ( - int  - x, + int x, - int  - k  - - - - ) - + int k ) @@ -405,17 +386,17 @@ Here is the call graph for this function:
    155 if (!x) {
    156 return 0;
    157 }
    -
    158 if (k == key[x]) {
    -
    159 return size[childs[x][0]] + 1;
    +
    158 if (k == key[x]) {
    +
    159 return size[childs[x][0]] + 1;
    160 }
    -
    161 else if (k < key[x]) {
    -
    162 return _get_rank(childs[x][0], k);
    +
    161 else if (k < key[x]) {
    +
    162 return _get_rank(childs[x][0], k);
    163 }
    164 else {
    -
    165 return size[childs[x][0]] + cnt[x] + _get_rank(childs[x][1], k);
    +
    165 return size[childs[x][0]] + cnt[x] + _get_rank(childs[x][1], k);
    166 }
    167 }
    -
    data_structures::treap::Treap::_get_rank
    int _get_rank(int x, int k)
    Query the rank of specified element (internal method)
    Definition treap.cpp:154
    +
    data_structures::treap::Treap::_get_rank
    int _get_rank(int x, int k)
    Query the rank of specified element (internal method)
    Definition treap.cpp:154
    Here is the call graph for this function:
    @@ -436,19 +417,12 @@ Here is the call graph for this function:
    void data_structures::treap::Treap::_insert ( - int &  - x, + int & x, - int  - k  - - - - ) - + int k ) @@ -468,28 +442,27 @@ Here is the call graph for this function:
    84 {
    85 if (x) {
    -
    86 if (key[x] == k) {
    -
    87 cnt[x]++;
    +
    86 if (key[x] == k) {
    +
    87 cnt[x]++;
    88 } // If the node already exists, the number of copies is ++
    89 else {
    -
    90 int t = (key[x] < k); // Insert according to BST properties
    -
    91 _insert(childs[x][t], k);
    +
    90 int t = (key[x] < k); // Insert according to BST properties
    +
    91 _insert(childs[x][t], k);
    92 // After insertion, the heap properties are retained by rotation
    -
    93 if (priority[childs[x][t]] < priority[x]) {
    -
    94 rotate(x, t);
    +
    93 if (priority[childs[x][t]] < priority[x]) {
    +
    94 rotate(x, t);
    95 }
    96 }
    97 } else { // Create a new node
    -
    98 x = treapCnt++;
    -
    99 key[x] = k;
    -
    100 cnt[x] = 1;
    -
    101 priority[x] = rand(); // Random priority
    -
    102 childs[x][0] = childs[x][1] = 0;
    +
    98 x = treapCnt++;
    +
    99 key[x] = k;
    +
    100 cnt[x] = 1;
    +
    101 priority[x] = rand(); // Random priority
    +
    102 childs[x][0] = childs[x][1] = 0;
    103 }
    -
    104 update(x);
    +
    104 update(x);
    105 }
    -
    std::rand
    T rand(T... args)
    -
    data_structures::treap::Treap::_insert
    void _insert(int &x, int k)
    Insert a value into the specified subtree (internal method)
    Definition treap.cpp:84
    +
    data_structures::treap::Treap::_insert
    void _insert(int &x, int k)
    Insert a value into the specified subtree (internal method)
    Definition treap.cpp:84
    Here is the call graph for this function:
    @@ -510,8 +483,7 @@ Here is the call graph for this function:
    void data_structures::treap::Treap::erase ( - int  - k) + int k) @@ -529,8 +501,8 @@ Here is the call graph for this function: -
    209{ _erase(root, k); }
    -
    data_structures::treap::Treap::root
    int root
    root of the treap
    Definition treap.cpp:40
    +
    209{ _erase(root, k); }
    +
    data_structures::treap::Treap::root
    int root
    root of the treap
    Definition treap.cpp:40
    Here is the call graph for this function:
    @@ -551,8 +523,7 @@ Here is the call graph for this function:
    int data_structures::treap::Treap::get_k_th ( - int  - k) + int k) @@ -571,7 +542,7 @@ Here is the call graph for this function:
    Returns
    The element ranked number x
    -
    215{ return _get_k_th(root, k); }
    +
    215{ return _get_k_th(root, k); }
    Here is the call graph for this function:
    @@ -592,8 +563,7 @@ Here is the call graph for this function:
    int data_structures::treap::Treap::get_next ( - int  - k) + int k) @@ -613,12 +583,12 @@ Here is the call graph for this function:
    Returns
    The successor
    189 {
    -
    190 int x = root, next = -1;
    +
    190 int x = root, next = -1;
    191 while (x) {
    -
    192 if (key[x] > k) {
    -
    193 next = key[x], x = childs[x][0];
    +
    192 if (key[x] > k) {
    +
    193 next = key[x], x = childs[x][0];
    194 } else {
    -
    195 x = childs[x][1];
    +
    195 x = childs[x][1];
    196 }
    197 }
    198 return next;
    @@ -639,8 +609,7 @@ Here is the call graph for this function:
    int data_structures::treap::Treap::get_predecessor ( - int  - k) + int k) @@ -660,12 +629,12 @@ Here is the call graph for this function:
    Returns
    The predecessor
    173 {
    -
    174 int x = root, pre = -1;
    +
    174 int x = root, pre = -1;
    175 while (x) {
    -
    176 if (key[x] < k) {
    -
    177 pre = key[x], x = childs[x][1];
    +
    176 if (key[x] < k) {
    +
    177 pre = key[x], x = childs[x][1];
    178 } else {
    -
    179 x = childs[x][0];
    +
    179 x = childs[x][0];
    180 }
    181 }
    182 return pre;
    @@ -685,8 +654,7 @@ Here is the call graph for this function:
    int data_structures::treap::Treap::get_rank ( - int  - k) + int k) @@ -705,7 +673,7 @@ Here is the call graph for this function:
    Returns
    The rank of element k
    -
    221{ return _get_rank(root, k); }
    +
    221{ return _get_rank(root, k); }
    Here is the call graph for this function:
    @@ -726,8 +694,7 @@ Here is the call graph for this function:
    void data_structures::treap::Treap::insert ( - int  - k) + int k) @@ -745,7 +712,7 @@ Here is the call graph for this function:
    -
    204{ _insert(root, k); }
    +
    204{ _insert(root, k); }
    Here is the call graph for this function:
    @@ -766,19 +733,12 @@ Here is the call graph for this function:
    void data_structures::treap::Treap::rotate ( - int &  - x, + int & x, - int  - t  - - - - ) - + int t ) @@ -797,12 +757,12 @@ Here is the call graph for this function:
    70 {
    -
    71 int y = childs[x][t];
    -
    72 childs[x][t] = childs[y][1 - t];
    -
    73 childs[y][1 - t] = x;
    +
    71 int y = childs[x][t];
    +
    72 childs[x][t] = childs[y][1 - t];
    +
    73 childs[y][1 - t] = x;
    74 // The rotation will only change itself and its son nodes
    -
    75 update(x);
    -
    76 update(y);
    +
    75 update(x);
    +
    76 update(y);
    77 x = y;
    78 }
    @@ -825,8 +785,7 @@ Here is the call graph for this function:
    void data_structures::treap::Treap::update ( - int  - x) + int x) @@ -845,7 +804,7 @@ Here is the call graph for this function:
    62 {
    -
    63 size[x] = size[childs[x][0]] + cnt[x] + size[childs[x][1]];
    +
    63 size[x] = size[childs[x][0]] + cnt[x] + size[childs[x][1]];
    64 }
    @@ -949,7 +908,7 @@ Here is the call graph for this function: diff --git a/d5/d96/md5_8cpp.html b/d5/d96/md5_8cpp.html index 3f6dbe38e..ce388e567 100644 --- a/d5/d96/md5_8cpp.html +++ b/d5/d96/md5_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: hashing/md5.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -130,34 +132,34 @@ Namespaces - + - + - + - + - + - + - + - + - + - +

    Functions

    uint32_t hashing::md5::leftRotate32bits (uint32_t n, std::size_t rotate)
    uint32_t hashing::md5::leftRotate32bits (uint32_t n, std::size_t rotate)
     Rotates the bits of a 32-bit unsigned integer.
     
    bool hashing::md5::isBigEndian ()
    bool hashing::md5::isBigEndian ()
     Checks whether integers are stored as big endian or not.
     
    uint32_t hashing::md5::toLittleEndian32 (uint32_t n)
    uint32_t hashing::md5::toLittleEndian32 (uint32_t n)
     Sets 32-bit integer to little-endian if needed.
     
    uint64_t hashing::md5::toLittleEndian64 (uint64_t n)
    uint64_t hashing::md5::toLittleEndian64 (uint64_t n)
     Sets 64-bit integer to little-endian if needed.
     
    std::string hashing::md5::sig2hex (void *sig)
    std::string hashing::md5::sig2hex (void *sig)
     Transforms the 128-bit MD5 signature into a 32 char hex string.
     
    void * hashing::md5::hash_bs (const void *input_bs, uint64_t input_size)
    void * hashing::md5::hash_bs (const void *input_bs, uint64_t input_size)
     The MD5 algorithm itself, taking in a bytestring.
     
    void * hashing::md5::hash (const std::string &message)
    void * hashing::md5::hash (const std::string &message)
     Converts the string to bytestring and calls the main algorithm.
     
    static void test ()
    static void test ()
     Self-test implementations of well-known MD5 hashes.
     
    static void interactive ()
    static void interactive ()
     Puts user in a loop where inputs can be given and MD5 hash will be computed and printed.
     
    int main ()
    int main ()
     Main function.
     
    @@ -185,8 +187,7 @@ Algorithm void * hashing::md5::hash ( - const std::string &  - message) + const std::string & message) @@ -201,9 +202,9 @@ Algorithm
    Returns
    void* Pointer to the MD5 signature
    287 {
    -
    288 return hash_bs(&message[0], message.size());
    +
    288 return hash_bs(&message[0], message.size());
    289}
    -
    hashing::md5::hash_bs
    void * hash_bs(const void *input_bs, uint64_t input_size)
    The MD5 algorithm itself, taking in a bytestring.
    Definition md5.cpp:138
    +
    hashing::md5::hash_bs
    void * hash_bs(const void *input_bs, uint64_t input_size)
    The MD5 algorithm itself, taking in a bytestring.
    Definition md5.cpp:138
    std::string::size
    T size(T... args)
    Here is the call graph for this function:
    @@ -222,19 +223,12 @@ Here is the call graph for this function:
    void * hashing::md5::hash_bs ( - const void *  - input_bs, + const void * input_bs, - uint64_t  - input_size  - - - - ) - + uint64_t input_size )
    @@ -322,7 +316,7 @@ Here is the call graph for this function:
    205 // We then have to add the 64-bit size of the message at the end
    206 // When there is a conversion from int to bytestring or vice-versa
    207 // We always need to make sure it is little endian
    -
    208 uint64_t input_bitsize_le = toLittleEndian64(input_size * 8);
    +
    208 uint64_t input_bitsize_le = toLittleEndian64(input_size * 8);
    209 for (uint8_t i = 0; i < 8; i++) {
    210 padded_message[padded_message_size - 8 + i] =
    211 (input_bitsize_le >> (56 - 8 * i)) & 0xFF;
    @@ -368,12 +362,12 @@ Here is the call graph for this function:
    251 }
    252
    253 // Update the accumulators
    -
    254 F += A + K[i] + toLittleEndian32(blocks[g]);
    +
    254 F += A + K[i] + toLittleEndian32(blocks[g]);
    255
    256 A = D;
    257 D = C;
    258 C = B;
    -
    259 B += leftRotate32bits(F, s[i]);
    +
    259 B += leftRotate32bits(F, s[i]);
    260 }
    261 // Update the state with this chunk's hash
    262 a0 += A;
    @@ -399,9 +393,9 @@ Here is the call graph for this function:
    numerical_methods::simpson_method::g
    double g(double x)
    Another test function.
    Definition composite_simpson_rule.cpp:115
    std::copy
    T copy(T... args)
    -
    hashing::md5::toLittleEndian32
    uint32_t toLittleEndian32(uint32_t n)
    Sets 32-bit integer to little-endian if needed.
    Definition md5.cpp:89
    -
    hashing::md5::toLittleEndian64
    uint64_t toLittleEndian64(uint64_t n)
    Sets 64-bit integer to little-endian if needed.
    Definition md5.cpp:102
    -
    hashing::md5::leftRotate32bits
    uint32_t leftRotate32bits(uint32_t n, std::size_t rotate)
    Rotates the bits of a 32-bit unsigned integer.
    Definition md5.cpp:66
    +
    hashing::md5::toLittleEndian32
    uint32_t toLittleEndian32(uint32_t n)
    Sets 32-bit integer to little-endian if needed.
    Definition md5.cpp:89
    +
    hashing::md5::toLittleEndian64
    uint64_t toLittleEndian64(uint64_t n)
    Sets 64-bit integer to little-endian if needed.
    Definition md5.cpp:102
    +
    hashing::md5::leftRotate32bits
    uint32_t leftRotate32bits(uint32_t n, std::size_t rotate)
    Rotates the bits of a 32-bit unsigned integer.
    Definition md5.cpp:66
    Here is the call graph for this function:
    @@ -423,7 +417,7 @@ Here is the call graph for this function: static void interactive ( - ) + ) @@ -442,8 +436,8 @@ Here is the call graph for this function:
    354 std::cout << "Enter a message to be hashed (Ctrl-C to exit): "
    355 << std::endl;
    356 std::getline(std::cin, input);
    -
    357 void* sig = hashing::md5::hash(input);
    -
    358 std::cout << "Hash is: " << hashing::md5::sig2hex(sig) << std::endl;
    +
    357 void* sig = hashing::md5::hash(input);
    +
    358 std::cout << "Hash is: " << hashing::md5::sig2hex(sig) << std::endl;
    359
    360 while (true) {
    361 std::cout << "Want to enter another message? (y/n) ";
    @@ -462,8 +456,8 @@ Here is the call graph for this function:
    std::string::compare
    T compare(T... args)
    std::endl
    T endl(T... args)
    std::getline
    T getline(T... args)
    -
    hashing::md5::hash
    void * hash(const std::string &message)
    Converts the string to bytestring and calls the main algorithm.
    Definition md5.cpp:287
    -
    hashing::md5::sig2hex
    std::string sig2hex(void *sig)
    Transforms the 128-bit MD5 signature into a 32 char hex string.
    Definition md5.cpp:122
    +
    hashing::md5::hash
    void * hash(const std::string &message)
    Converts the string to bytestring and calls the main algorithm.
    Definition md5.cpp:287
    +
    hashing::md5::sig2hex
    std::string sig2hex(void *sig)
    Transforms the 128-bit MD5 signature into a 32 char hex string.
    Definition md5.cpp:122
    Here is the call graph for this function:
    @@ -481,7 +475,7 @@ Here is the call graph for this function:
    bool hashing::md5::isBigEndian ( - ) + ) @@ -517,19 +511,12 @@ Here is the call graph for this function: uint32_t hashing::md5::leftRotate32bits ( - uint32_t  - n, + uint32_t n, - std::size_t  - rotate  - - - - ) - + std::size_t rotate )
    @@ -564,8 +551,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -574,19 +560,19 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    376 {
    -
    377 test(); // run self-test implementations
    +
    377 test(); // run self-test implementations
    378
    379 // Launch interactive mode where user can input messages and see
    380 // their hash
    -
    381 interactive();
    +
    381 interactive();
    382 return 0;
    383}
    -
    test
    static void test()
    Self-test implementations of well-known MD5 hashes.
    Definition md5.cpp:297
    -
    interactive
    static void interactive()
    Puts user in a loop where inputs can be given and MD5 hash will be computed and printed.
    Definition md5.cpp:351
    +
    test
    static void test()
    Self-test implementations of well-known MD5 hashes.
    Definition md5.cpp:297
    +
    interactive
    static void interactive()
    Puts user in a loop where inputs can be given and MD5 hash will be computed and printed.
    Definition md5.cpp:351
    Here is the call graph for this function:
    -
    +
    @@ -600,8 +586,7 @@ Here is the call graph for this function: std::string hashing::md5::sig2hex ( - void *  - sig) + void * sig) @@ -646,7 +631,7 @@ Here is the call graph for this function: static void test ( - ) + ) @@ -661,57 +646,57 @@ Here is the call graph for this function:
    Returns
    void
    297 {
    298 // Hashes empty string and stores signature
    -
    299 void* sig = hashing::md5::hash("");
    +
    299 void* sig = hashing::md5::hash("");
    300 std::cout << "Hashing empty string" << std::endl;
    301 // Prints signature hex representation
    -
    302 std::cout << hashing::md5::sig2hex(sig) << std::endl << std::endl;
    +
    302 std::cout << hashing::md5::sig2hex(sig) << std::endl << std::endl;
    303 // Test with cassert whether sig is correct from the expected value
    -
    304 assert(hashing::md5::sig2hex(sig).compare(
    +
    304 assert(hashing::md5::sig2hex(sig).compare(
    305 "d41d8cd98f00b204e9800998ecf8427e") == 0);
    306
    307 // Hashes "The quick brown fox jumps over the lazy dog" and stores signature
    308 void* sig2 =
    -
    309 hashing::md5::hash("The quick brown fox jumps over the lazy dog");
    +
    309 hashing::md5::hash("The quick brown fox jumps over the lazy dog");
    310 std::cout << "Hashing The quick brown fox jumps over the lazy dog"
    311 << std::endl;
    312 // Prints signature hex representation
    -
    313 std::cout << hashing::md5::sig2hex(sig2) << std::endl << std::endl;
    +
    313 std::cout << hashing::md5::sig2hex(sig2) << std::endl << std::endl;
    314 // Test with cassert whether sig is correct from the expected value
    -
    315 assert(hashing::md5::sig2hex(sig2).compare(
    +
    315 assert(hashing::md5::sig2hex(sig2).compare(
    316 "9e107d9d372bb6826bd81d3542a419d6") == 0);
    317
    318 // Hashes "The quick brown fox jumps over the lazy dog." (notice the
    319 // additional period) and stores signature
    320 void* sig3 =
    -
    321 hashing::md5::hash("The quick brown fox jumps over the lazy dog.");
    +
    321 hashing::md5::hash("The quick brown fox jumps over the lazy dog.");
    322 std::cout << "Hashing "
    323 "The quick brown fox jumps over the lazy dog."
    324 << std::endl;
    325 // Prints signature hex representation
    -
    326 std::cout << hashing::md5::sig2hex(sig3) << std::endl << std::endl;
    +
    326 std::cout << hashing::md5::sig2hex(sig3) << std::endl << std::endl;
    327 // Test with cassert whether sig is correct from the expected value
    -
    328 assert(hashing::md5::sig2hex(sig3).compare(
    +
    328 assert(hashing::md5::sig2hex(sig3).compare(
    329 "e4d909c290d0fb1ca068ffaddf22cbd0") == 0);
    330
    331 // Hashes "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"
    332 // and stores signature
    -
    333 void* sig4 = hashing::md5::hash(
    +
    333 void* sig4 = hashing::md5::hash(
    334 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789");
    335 std::cout
    336 << "Hashing "
    337 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"
    338 << std::endl;
    339 // Prints signature hex representation
    -
    340 std::cout << hashing::md5::sig2hex(sig4) << std::endl << std::endl;
    +
    340 std::cout << hashing::md5::sig2hex(sig4) << std::endl << std::endl;
    341 // Test with cassert whether sig is correct from the expected value
    -
    342 assert(hashing::md5::sig2hex(sig4).compare(
    +
    342 assert(hashing::md5::sig2hex(sig4).compare(
    343 "d174ab98d277d9f5a5611c2c9f419d9f") == 0);
    344}
    -
    compare
    Definition huffman.cpp:28
    +
    compare
    int compare(const void *a, const void *b)
    Definition shell_sort2.cpp:87
    Here is the call graph for this function:
    -
    +
    @@ -725,8 +710,7 @@ Here is the call graph for this function: uint32_t hashing::md5::toLittleEndian32 ( - uint32_t  - n) + uint32_t n) @@ -741,14 +725,14 @@ Here is the call graph for this function:
    Returns
    uint32_t param n with binary representation as little-endian
    89 {
    -
    90 if (!isBigEndian()) {
    +
    90 if (!isBigEndian()) {
    91 return ((n << 24) & 0xFF000000) | ((n << 8) & 0x00FF0000) |
    92 ((n >> 8) & 0x0000FF00) | ((n >> 24) & 0x000000FF);
    93 }
    94 // Machine works on little endian, no need to change anything
    95 return n;
    96}
    -
    hashing::md5::isBigEndian
    bool isBigEndian()
    Checks whether integers are stored as big endian or not.
    Definition md5.cpp:76
    +
    hashing::md5::isBigEndian
    bool isBigEndian()
    Checks whether integers are stored as big endian or not.
    Definition md5.cpp:76
    Here is the call graph for this function:
    @@ -766,8 +750,7 @@ Here is the call graph for this function:
    uint64_t hashing::md5::toLittleEndian64 ( - uint64_t  - n) + uint64_t n) @@ -782,7 +765,7 @@ Here is the call graph for this function:
    Returns
    uint64_t param n with binary representation as little-endian
    102 {
    -
    103 if (!isBigEndian()) {
    +
    103 if (!isBigEndian()) {
    104 return ((n << 56) & 0xFF00000000000000) |
    105 ((n << 40) & 0x00FF000000000000) |
    106 ((n << 24) & 0x0000FF0000000000) |
    @@ -810,7 +793,7 @@ Here is the call graph for this function:
    diff --git a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map index 900bf0933..9c39312ce 100644 --- a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map +++ b/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -1,5 +1,7 @@ - - - + + + + + diff --git a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 index 195292c16..414249b3d 100644 --- a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 +++ b/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -1 +1 @@ -0599599396fb22085f970483d20d91d7 \ No newline at end of file +9765448a7ce92ef05584fe32008f3e3a \ No newline at end of file diff --git a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 08f74de61..8378ae5d4 100644 --- a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -4,8 +4,8 @@ - + - + test Node1 - -test + +test Node2 - - -std::endl + + +compare @@ -40,8 +40,26 @@ Node1->Node2 - - + + + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + diff --git a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index 2e96cf066..996dbaf4e 100644 --- a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -4,25 +4,25 @@ - - + + test Node1 - -test + +test Node2 - - -std::endl + + +compare @@ -30,8 +30,26 @@ Node1->Node2 - - + + + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + diff --git a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 8d8f39cea..7c6befadd 100644 --- a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -10,5 +10,7 @@ - + + + diff --git a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 1e709061a..75ced1c0f 100644 --- a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -eeab4aa51b36d3583b18561e5c95b512 \ No newline at end of file +3d8b2b9cd69f1ea490052a32c17a74f8 \ No newline at end of file diff --git a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index c161cbe60..807ea22a9 100644 --- a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,8 +4,8 @@ - + - + main Node1 - -main + +main @@ -31,8 +31,8 @@ Node2 - -interactive + +interactive @@ -40,8 +40,8 @@ Node1->Node2 - - + + @@ -49,8 +49,8 @@ Node6 - -test + +test @@ -58,8 +58,8 @@ Node1->Node6 - - + + @@ -67,8 +67,8 @@ Node3 - -std::string::compare + +std::string::compare @@ -76,8 +76,8 @@ Node2->Node3 - - + + @@ -85,8 +85,8 @@ Node4 - -std::endl + +std::endl @@ -94,8 +94,8 @@ Node2->Node4 - - + + @@ -103,8 +103,8 @@ Node5 - -std::getline + +std::getline @@ -112,17 +112,35 @@ Node2->Node5 - - + + - + Node6->Node4 - - - + + + + + + + + +Node7 + + +compare + + + + + +Node6->Node7 + + + diff --git a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index ab2c31230..744132351 100644 --- a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + main Node1 - -main + +main @@ -21,8 +21,8 @@ Node2 - -interactive + +interactive @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -39,8 +39,8 @@ Node6 - -test + +test @@ -48,8 +48,8 @@ Node1->Node6 - - + + @@ -57,8 +57,8 @@ Node3 - -std::string::compare + +std::string::compare @@ -66,8 +66,8 @@ Node2->Node3 - - + + @@ -75,8 +75,8 @@ Node4 - -std::endl + +std::endl @@ -84,8 +84,8 @@ Node2->Node4 - - + + @@ -93,8 +93,8 @@ Node5 - -std::getline + +std::getline @@ -102,17 +102,35 @@ Node2->Node5 - - + + - + Node6->Node4 - - - + + + + + + + + +Node7 + + +compare + + + + + +Node6->Node7 + + + diff --git a/d5/da1/structnode.html b/d5/da1/structnode.html index 62eefb68f..81665bfbd 100644 --- a/d5/da1/structnode.html +++ b/d5/da1/structnode.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: node Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ Collaboration diagram for node:
    - +

    Public Member Functions

     node (int d)
     node (int d)
     
    - - +

    @@ -164,8 +166,7 @@ char 

    		color
    node::node (int d)int d)
    @@ -201,7 +202,7 @@ char color diff --git a/d5/da7/namespacejarvis.html b/d5/da7/namespacejarvis.html index 1e3c7766d..cf89923e6 100644 --- a/d5/da7/namespacejarvis.html +++ b/d5/da7/namespacejarvis.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: jarvis Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d5/da7/namespacejarvis.html','../../')

    Functions for Jarvis’s algorithm. -More...

    +More...

    Detailed Description

    Functions for Jarvis’s algorithm.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d5/da7/namespacejarvis.html','../../') diff --git a/d5/dab/structdata__structures_1_1list__array_1_1list.html b/d5/dab/structdata__structures_1_1list__array_1_1list.html index 0ece29f18..ca33d09dc 100644 --- a/d5/dab/structdata__structures_1_1list__array_1_1list.html +++ b/d5/dab/structdata__structures_1_1list__array_1_1list.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures::list_array::list< N > Struct Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d5/dab/structdata__structures_1_1list_

    Structure of List with supporting methods. - More...

    + More...

    Collaboration diagram for data_structures::list_array::list< N >:
    @@ -115,30 +117,30 @@ Collaboration diagram for data_structures::list_array::list< N >:
    - + - + - + - + - + - + - +

    Public Member Functions

    uint64_t BinarySearch (const std::array< uint64_t, N > &dataArr, const uint64_t &first, const uint64_t &last, const uint64_t &val)
    uint64_t BinarySearch (const std::array< uint64_t, N > &dataArr, const uint64_t &first, const uint64_t &last, const uint64_t &val)
     Search an element in the list using binarySearch.
     
    uint64_t LinearSearch (const std::array< uint64_t, N > &dataArr, const uint64_t &val) const
    uint64_t LinearSearch (const std::array< uint64_t, N > &dataArr, const uint64_t &val) const
     Search an element using linear search.
     
    uint64_t search (const uint64_t &val)
    uint64_t search (const uint64_t &val)
     
    void sort ()
    void sort ()
     Sort the list.
     
    void insert (const uint64_t &val)
    void insert (const uint64_t &val)
     Insert the new element in the list.
     
    void remove (const uint64_t &val)
    void remove (const uint64_t &val)
     To remove the element from the list.
     
    void show ()
    void show ()
     Utility function to print array.
     
    - + @@ -165,31 +167,22 @@ template<uint64_t N> - - + - - + - - + - - - - - - - +

    Public Attributes

    std::array< uint64_t, N > data {}
    std::array< uint64_t, N > data {}
     
    uint64_t top = 0
    uint64_t data_structures::list_array::list< N >::BinarySearch (const std::array< uint64_t, N > & dataArr, const std::array< uint64_t, N > & dataArr,
    const uint64_t & first, const uint64_t & first,
    const uint64_t & last, const uint64_t & last,
    const uint64_t & val 
    )const uint64_t & val )
    @@ -221,16 +214,16 @@ template<uint64_t N>
    54 return mid;
    55 // if current mid value is greater than element we have to search in first half
    56 else if (val < dataArr[mid])
    -
    57 return (BinarySearch(dataArr, first, mid - 1, val));
    +
    57 return (BinarySearch(dataArr, first, mid - 1, val));
    58 // if current mid value is greater than element we have to search in second half
    59 else if (val > dataArr[mid])
    -
    60 return (BinarySearch(dataArr, mid + 1, last, val));
    +
    60 return (BinarySearch(dataArr, mid + 1, last, val));
    61
    62 std::cerr << __func__ << ":" << __LINE__ << ": Undefined condition\n";
    63 return -1;
    64 }
    -
    data_structures::list_array::list::BinarySearch
    uint64_t BinarySearch(const std::array< uint64_t, N > &dataArr, const uint64_t &first, const uint64_t &last, const uint64_t &val)
    Search an element in the list using binarySearch.
    Definition list_array.cpp:45
    +
    data_structures::list_array::list::BinarySearch
    uint64_t BinarySearch(const std::array< uint64_t, N > &dataArr, const uint64_t &first, const uint64_t &last, const uint64_t &val)
    Search an element in the list using binarySearch.
    Definition list_array.cpp:45
    Here is the call graph for this function:
    @@ -253,8 +246,7 @@ template<uint64_t N>
    void data_structures::list_array::list< N >::insert ( - const uint64_t &  - val) + const uint64_t & val) @@ -323,19 +315,12 @@ template<uint64_t N> uint64_t data_structures::list_array::list< N >::LinearSearch ( - const std::array< uint64_t, N > &  - dataArr, + const std::array< uint64_t, N > & dataArr, - const uint64_t &  - val  - - - - ) - const + const uint64_t & val ) const @@ -381,8 +366,7 @@ template<uint64_t N> void data_structures::list_array::list< N >::remove ( - const uint64_t &  - val) + const uint64_t & val) @@ -434,8 +418,7 @@ template<uint64_t N> uint64_t data_structures::list_array::list< N >::search ( - const uint64_t &  - val) + const uint64_t & val) @@ -449,9 +432,9 @@ template<uint64_t N>
    89 uint64_t pos; // pos variable to store index value of element.
    90 // if list is sorted, binary search works efficiently else linear search is the only option
    91 if (isSorted) {
    -
    92 pos = BinarySearch(data, 0, top - 1, val);
    +
    92 pos = BinarySearch(data, 0, top - 1, val);
    93 } else {
    -
    94 pos = LinearSearch(data, val);
    +
    94 pos = LinearSearch(data, val);
    95 }
    96 // if index is equal to -1 means element does not present
    97 // else print the index of that element
    @@ -463,7 +446,7 @@ template<uint64_t N>
    103 // return the index of element or -1.
    104 return pos;
    105 }
    -
    data_structures::list_array::list::LinearSearch
    uint64_t LinearSearch(const std::array< uint64_t, N > &dataArr, const uint64_t &val) const
    Search an element using linear search.
    Definition list_array.cpp:72
    +
    data_structures::list_array::list::LinearSearch
    uint64_t LinearSearch(const std::array< uint64_t, N > &dataArr, const uint64_t &val) const
    Search an element using linear search.
    Definition list_array.cpp:72
    @@ -481,7 +464,7 @@ template<uint64_t N> void data_structures::list_array::list< N >::show ( - ) + ) @@ -518,7 +501,7 @@ template<uint64_t N> void data_structures::list_array::list< N >::sort ( - ) + ) @@ -583,7 +566,7 @@ template<uint64_t N> diff --git a/d5/db0/adaline__learning_8cpp.html b/d5/db0/adaline__learning_8cpp.html index 27c686dc2..3a7120151 100644 --- a/d5/db0/adaline__learning_8cpp.html +++ b/d5/db0/adaline__learning_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: machine_learning/adaline_learning.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -136,13 +138,13 @@ Namespaces - + - + - + - +

    Functions

    void test1 (double eta=0.01)
    void test1 (double eta=0.01)
     
    void test2 (double eta=0.01)
    void test2 (double eta=0.01)
     
    void test3 (double eta=0.01)
    void test3 (double eta=0.01)
     
    int main (int argc, char **argv)
    int main (int argc, char **argv)
     
    - - + - - - - - - - +

    @@ -170,19 +172,12 @@ Variables

    int main (int argc, int argc,
    char ** argv 
    )char ** argv )
    @@ -235,8 +230,7 @@ Here is the call graph for this function:
    void test1 ( - double  - eta = 0.01) + double eta = 0.01) @@ -298,8 +292,7 @@ Here is the call graph for this function: void test2 ( - double  - eta = 0.01) + double eta = 0.01) @@ -367,8 +360,7 @@ Here is the call graph for this function: void test3 ( - double  - eta = 0.01) + double eta = 0.01) @@ -436,7 +428,7 @@ Here is the call graph for this function: diff --git a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map index faa5f7636..687e3379a 100644 --- a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map +++ b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map @@ -1,49 +1,53 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + - - - - - - - - - + + + + + + + + + + + + + diff --git a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 index 8b286d899..c962f142e 100644 --- a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 +++ b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 @@ -1 +1 @@ -26cfac60c49e214268fcb6aee8cbc5fe \ No newline at end of file +2d746614e5391ad72fa6def9f273d066 \ No newline at end of file diff --git a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg index 13d450b3a..3626113de 100644 --- a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg +++ b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg @@ -4,7 +4,7 @@ - + - + divide_and_conquer::strassens_multiplication::Matrix< T, typename > @@ -49,6 +49,25 @@ _mat + + +Node3 + + +T + + + + + +Node3->Node2 + + + + + + elements + diff --git a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph_org.svg b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph_org.svg index 6fea5b7cf..f9ca38571 100644 --- a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph_org.svg +++ b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph_org.svg @@ -4,9 +4,9 @@ - - + + divide_and_conquer::strassens_multiplication::Matrix< T, typename > @@ -39,5 +39,24 @@ _mat + + +Node3 + + +T + + + + + +Node3->Node2 + + + + + + elements + diff --git a/d5/df4/merge__sort_8cpp.html b/d5/df4/merge__sort_8cpp.html index d55194d7d..7ec9291fc 100644 --- a/d5/df4/merge__sort_8cpp.html +++ b/d5/df4/merge__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/merge_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -133,7 +135,7 @@ Functions diff --git a/d5/df6/check__amicable__pair_8cpp.html b/d5/df6/check__amicable__pair_8cpp.html index 1f660d275..771da2b0b 100644 --- a/d5/df6/check__amicable__pair_8cpp.html +++ b/d5/df6/check__amicable__pair_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/check_amicable_pair.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,10 +130,10 @@ Functions bool math::are_amicable (int x, int y)  Function to check whether the pair is amicable or not.
      -static void tests () +static void tests ()  Self-test implementations.
      -int main () +int main ()  Main function.
      @@ -150,8 +152,7 @@ Functions int main ( - void  - ) + void ) @@ -160,10 +161,10 @@ Functions

    Main function.

    Returns
    0 on exit
    81 {
    -
    82 tests(); // perform self-tests implementations
    +
    82 tests(); // perform self-tests implementations
    83 return 0;
    84}
    -
    tests
    static void tests()
    Self-test implementations.
    Definition check_amicable_pair.cpp:67
    +
    tests
    static void tests()
    Self-test implementations.
    Definition check_amicable_pair.cpp:67
    Here is the call graph for this function:
    @@ -184,7 +185,7 @@ Here is the call graph for this function:
    static void tests ( - ) + ) @@ -223,7 +224,7 @@ Here is the call graph for this function:
    diff --git a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html index 782bde799..13601e57a 100644 --- a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html +++ b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures::queue_using_array::Queue_Array Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d6/d04/classdata__structures_1_1queue_

    Queue_Array class containing the main data and also index of head and tail of the array. - More...

    + More...

    Collaboration diagram for data_structures::queue_using_array::Queue_Array:
    @@ -115,25 +117,25 @@ Collaboration diagram for data_structures::queue_using_array::Queue_Array:
    - + - + - +

    Public Member Functions

    void enqueue (const int16_t &)
    void enqueue (const int16_t &)
     Add element to the first of the queue.
     
    int dequeue ()
    int dequeue ()
     Delete element from back of the queue.
     
    void display () const
    void display () const
     Show all saved data.
     
    - + - + - +

    Private Attributes

    int8_t front {-1}
    int8_t front {-1}
     Index of head of the array.
     
    int8_t rear {-1}
    int8_t rear {-1}
     Index of tail of the array.
     
    std::array< int16_t, max_size > arr {}
    std::array< int16_t, max_size > arr {}
     All stored data.
     
    @@ -149,7 +151,7 @@ Private Attributes int data_structures::queue_using_array::Queue_Array::dequeue ( - ) + ) @@ -160,23 +162,23 @@ Private Attributes
    Returns
    data that is deleted if queue is not empty
    75 {
    76 int8_t d{0};
    -
    77 if (front == -1) {
    +
    77 if (front == -1) {
    78 std::cout << "\nstack is empty ";
    79 return 0;
    -
    80 } else if (front == rear) {
    -
    81 d = arr.at(front);
    -
    82 front = rear = -1;
    +
    80 } else if (front == rear) {
    +
    81 d = arr.at(front);
    +
    82 front = rear = -1;
    83 } else {
    -
    84 d = arr.at(front++);
    +
    84 d = arr.at(front++);
    85 }
    86
    87 return d;
    88}
    std::array::at
    T at(T... args)
    -
    data_structures::queue_using_array::Queue_Array::front
    int8_t front
    Index of head of the array.
    Definition queue_using_array.cpp:49
    -
    data_structures::queue_using_array::Queue_Array::rear
    int8_t rear
    Index of tail of the array.
    Definition queue_using_array.cpp:50
    -
    data_structures::queue_using_array::Queue_Array::arr
    std::array< int16_t, max_size > arr
    All stored data.
    Definition queue_using_array.cpp:51
    +
    data_structures::queue_using_array::Queue_Array::front
    int8_t front
    Index of head of the array.
    Definition queue_using_array.cpp:49
    +
    data_structures::queue_using_array::Queue_Array::rear
    int8_t rear
    Index of tail of the array.
    Definition queue_using_array.cpp:50
    +
    data_structures::queue_using_array::Queue_Array::arr
    std::array< int16_t, max_size > arr
    All stored data.
    Definition queue_using_array.cpp:51
    Here is the call graph for this function:
    @@ -194,7 +196,7 @@ Here is the call graph for this function:
    void data_structures::queue_using_array::Queue_Array::display ( - ) + ) const @@ -203,10 +205,10 @@ Here is the call graph for this function:

    Show all saved data.

    Utility function to show all elements in the queue.

    93 {
    -
    94 if (front == -1) {
    +
    94 if (front == -1) {
    95 std::cout << "\nStack is empty";
    96 } else {
    -
    97 for (int16_t i{front}; i <= rear; ++i) std::cout << arr.at(i) << " ";
    +
    97 for (int16_t i{front}; i <= rear; ++i) std::cout << arr.at(i) << " ";
    98 }
    99}
    @@ -226,8 +228,7 @@ Here is the call graph for this function:
    void data_structures::queue_using_array::Queue_Array::enqueue ( - const int16_t &  - ele) + const int16_t & ele) @@ -242,15 +243,15 @@ Here is the call graph for this function:
    58 {
    -
    59 if (rear == arr.size() - 1) {
    +
    59 if (rear == arr.size() - 1) {
    60 std::cout << "\nStack is full";
    -
    61 } else if (front == -1 && rear == -1) {
    -
    62 front = 0;
    -
    63 rear = 0;
    -
    64 arr[rear] = ele;
    -
    65 } else if (rear < arr.size()) {
    -
    66 ++rear;
    -
    67 arr[rear] = ele;
    +
    61 } else if (front == -1 && rear == -1) {
    +
    62 front = 0;
    +
    63 rear = 0;
    +
    64 arr[rear] = ele;
    +
    65 } else if (rear < arr.size()) {
    +
    66 ++rear;
    +
    67 arr[rear] = ele;
    68 }
    69}
    std::array::size
    T size(T... args)
    @@ -347,7 +348,7 @@ Here is the call graph for this function:
    diff --git a/d6/d05/reverse__a__linked__list_8cpp.html b/d6/d05/reverse__a__linked__list_8cpp.html index c3a7f6198..1156e7147 100644 --- a/d6/d05/reverse__a__linked__list_8cpp.html +++ b/d6/d05/reverse__a__linked__list_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/reverse_a_linked_list.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -134,17 +136,17 @@ Namespaces - + - + - + - + - +

    Functions

    Node * data_structures::linked_list::copy_all_nodes (const Node *const node)
    Node * data_structures::linked_list::copy_all_nodes (const Node *const node)
     creates a deep copy of a list starting at the input node
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    void test_copy_constructor ()
    void test_copy_constructor ()
     
    void test_assignment_operator ()
    void test_assignment_operator ()
     
    int main ()
    int main ()
     Main function.
     
    @@ -166,8 +168,7 @@ Algorithm Node * data_structures::linked_list::copy_all_nodes ( - const Node *const  - node) + const Node *const node) @@ -186,12 +187,12 @@ Algorithm
    55 // NOLINTNEXTLINE(cppcoreguidelines-owning-memory)
    56 Node* res = new Node();
    57 res->val = node->val;
    -
    58 res->next = copy_all_nodes(node->next);
    +
    58 res->next = copy_all_nodes(node->next);
    59 return res;
    60 }
    61 return nullptr;
    62}
    -
    data_structures::linked_list::copy_all_nodes
    Node * copy_all_nodes(const Node *const node)
    creates a deep copy of a list starting at the input node
    Definition reverse_a_linked_list.cpp:53
    +
    data_structures::linked_list::copy_all_nodes
    Node * copy_all_nodes(const Node *const node)
    creates a deep copy of a list starting at the input node
    Definition reverse_a_linked_list.cpp:53
    Node
    Definition linkedlist_implentation_usingarray.cpp:14
    node
    Definition binary_search_tree.cpp:11
    @@ -211,8 +212,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -221,12 +221,12 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    301 {
    -
    302 test(); // run self-test implementations
    +
    302 test(); // run self-test implementations
    303 test_copy_constructor();
    304 test_assignment_operator();
    305 return 0;
    306}
    -
    test
    static void test()
    Self-test implementations.
    Definition reverse_a_linked_list.cpp:228
    +
    test
    static void test()
    Self-test implementations.
    Definition reverse_a_linked_list.cpp:228
    Here is the call graph for this function:
    @@ -247,7 +247,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -308,7 +308,7 @@ Here is the call graph for this function: void test_assignment_operator ( - ) + ) @@ -347,7 +347,7 @@ Here is the call graph for this function: void test_copy_constructor ( - ) + ) @@ -382,7 +382,7 @@ Here is the call graph for this function: diff --git a/d6/d0c/namespacehashing.html b/d6/d0c/namespacehashing.html index 266f9f1cc..6d41d81a1 100644 --- a/d6/d0c/namespacehashing.html +++ b/d6/d0c/namespacehashing.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: hashing Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d6/d0c/namespacehashing.html','../../'

    Hashing algorithms. -More...

    +More...

    Detailed Description

    Hashing algorithms.

    For std::vector.

    @@ -116,7 +118,7 @@ $(document).ready(function(){initNavTree('d6/d0c/namespacehashing.html','../../' diff --git a/d6/d10/cut__rod_8cpp.html b/d6/d10/cut__rod_8cpp.html index c4ed8720c..39935689f 100644 --- a/d6/d10/cut__rod_8cpp.html +++ b/d6/d10/cut__rod_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/cut_rod.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,13 +130,13 @@ Namespaces

    Functions

    template<size_t T> -int dynamic_programming::cut_rod::maxProfitByCuttingRod (const std::array< int, T > &price, const uint64_t &n) +int dynamic_programming::cut_rod::maxProfitByCuttingRod (const std::array< int, T > &price, const uint64_t &n)  Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.
      -static void test () +static void test ()  Function to test above algorithm.
      -int main () +int main ()  Main function.
      @@ -157,8 +159,7 @@ Algorithm int main ( - void  - ) + void ) @@ -168,10 +169,10 @@ Algorithm
    Returns
    0 on exit
    110 {
    111 // Testing
    -
    112 test();
    +
    112 test();
    113 return 0;
    114}
    -
    test
    static void test()
    Function to test above algorithm.
    Definition cut_rod.cpp:71
    +
    test
    static void test()
    Function to test above algorithm.
    Definition cut_rod.cpp:71
    Here is the call graph for this function:
    @@ -191,19 +192,12 @@ template<size_t T>
    int dynamic_programming::cut_rod::maxProfitByCuttingRod ( - const std::array< int, T > &  - price, + const std::array< int, T > & price, - const uint64_t &  - n  - - - - ) - + const uint64_t & n )
    @@ -270,7 +264,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -288,7 +282,7 @@ Here is the call graph for this function:
    73 const int16_t n1 = 8; // size of rod
    74 std::array<int32_t, n1> price1 = {1,2,4,6,8,45,21,9}; // price array
    75 const int64_t max_profit1 =
    -
    76 dynamic_programming::cut_rod::maxProfitByCuttingRod(price1, n1);
    +
    76 dynamic_programming::cut_rod::maxProfitByCuttingRod(price1, n1);
    77 const int64_t expected_max_profit1 = 47;
    78 assert(max_profit1 == expected_max_profit1);
    79 std::cout << "Maximum profit with " << n1 << " inch road is " << max_profit1
    @@ -302,7 +296,7 @@ Here is the call graph for this function:
    87 41, 42, 43, 44, 45, 46, 47, 48, 49, 50};
    88
    89 const int64_t max_profit2=
    -
    90 dynamic_programming::cut_rod::maxProfitByCuttingRod(price2, n2);
    +
    90 dynamic_programming::cut_rod::maxProfitByCuttingRod(price2, n2);
    91 const int32_t expected_max_profit2 = 90;
    92 assert(max_profit2 == expected_max_profit2);
    93 std::cout << "Maximum profit with " << n2 << " inch road is " << max_profit2
    @@ -311,7 +305,7 @@ Here is the call graph for this function:
    96 const int16_t n3 = 5; // size of rod
    97 std::array<int32_t, n3> price3 = {2,9,17,23,45}; // price array
    98 const int64_t max_profit3 =
    -
    99 dynamic_programming::cut_rod::maxProfitByCuttingRod(price3, n3);
    +
    99 dynamic_programming::cut_rod::maxProfitByCuttingRod(price3, n3);
    100 const int64_t expected_max_profit3 = 45;
    101 assert(max_profit3 == expected_max_profit3);
    102 std::cout << "Maximum profit with " << n3 << " inch road is " << max_profit3
    @@ -319,7 +313,7 @@ Here is the call graph for this function:
    104}
    -
    dynamic_programming::cut_rod::maxProfitByCuttingRod
    int maxProfitByCuttingRod(const std::array< int, T > &price, const uint64_t &n)
    Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.
    Definition cut_rod.cpp:44
    +
    dynamic_programming::cut_rod::maxProfitByCuttingRod
    int maxProfitByCuttingRod(const std::array< int, T > &price, const uint64_t &n)
    Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.
    Definition cut_rod.cpp:44
    std::endl
    T endl(T... args)
    Here is the call graph for this function:
    @@ -335,7 +329,7 @@ Here is the call graph for this function: diff --git a/d6/d1a/dnf__sort_8cpp.html b/d6/d1a/dnf__sort_8cpp.html index 340608fa8..4b32f275c 100644 --- a/d6/d1a/dnf__sort_8cpp.html +++ b/d6/d1a/dnf__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/dnf_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,13 +130,13 @@ Namespaces

    Functions

    template<typename T > -std::vector< T > sorting::dnf_sort::dnfSort (const std::vector< T > &in_arr) +std::vector< T > sorting::dnf_sort::dnfSort (const std::vector< T > &in_arr)  The main function implements DNF sort.
      -static void test () +static void test ()  Self-test implementations.
      -int main () +int main ()  Main function.
      @@ -153,8 +155,7 @@ template<typename T >
    std::vector< T > sorting::dnf_sort::dnfSort ( - const std::vector< T > &  - in_arr) + const std::vector< T > & in_arr) @@ -222,8 +223,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -232,10 +232,10 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    108 {
    -
    109 test(); // execute the test
    +
    109 test(); // execute the test
    110 return 0;
    111}
    -
    test
    static void test()
    Self-test implementations.
    Definition dnf_sort.cpp:73
    +
    test
    static void test()
    Self-test implementations.
    Definition dnf_sort.cpp:73
    Here is the call graph for this function:
    @@ -256,7 +256,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -274,34 +274,34 @@ Here is the call graph for this function:
    75 // [1, 0, 2, 1] return [0, 1, 1, 2]
    76 std::vector<uint64_t> array1 = {0, 1, 1, 2};
    77 std::cout << "Test 1... ";
    -
    78 std::vector<uint64_t> arr1 = sorting::dnf_sort::dnfSort(array1);
    +
    78 std::vector<uint64_t> arr1 = sorting::dnf_sort::dnfSort(array1);
    79 assert(std::is_sorted(std::begin(arr1), std::end(arr1)));
    80 std::cout << "passed" << std::endl;
    81 // 2nd test
    82 // [1, 0, 0, 1, 1, 0, 2, 1] return [0, 0, 0, 1, 1, 1, 1, 2]
    83 std::vector<uint64_t> array2 = {1, 0, 0, 1, 1, 0, 2, 1};
    84 std::cout << "Test 2... ";
    -
    85 std::vector<uint64_t> arr2 = sorting::dnf_sort::dnfSort(array2);
    +
    85 std::vector<uint64_t> arr2 = sorting::dnf_sort::dnfSort(array2);
    86 assert(std::is_sorted(std::begin(arr2), std::end(arr2)));
    87 std::cout << "passed" << std::endl;
    88 // 3rd test
    89 // [1, 1, 0, 0, 1, 2, 2, 0, 2, 1] return [0, 0, 0, 1, 1, 1, 1, 2, 2, 2]
    90 std::vector<uint64_t> array3 = {1, 1, 0, 0, 1, 2, 2, 0, 2, 1};
    91 std::cout << "Test 3... ";
    -
    92 std::vector<uint64_t> arr3 = sorting::dnf_sort::dnfSort(array3);
    +
    92 std::vector<uint64_t> arr3 = sorting::dnf_sort::dnfSort(array3);
    93 assert(std::is_sorted(std::begin(arr3), std::end(arr3)));
    94 std::cout << "passed" << std::endl;
    95 // 4th test
    96 // [2, 2, 2, 0, 0, 1, 1] return [0, 0, 1, 1, 2, 2, 2]
    97 std::vector<uint64_t> array4 = {2, 2, 2, 0, 0, 1, 1};
    98 std::cout << "Test 4... ";
    -
    99 std::vector<uint64_t> arr4 = sorting::dnf_sort::dnfSort(array4);
    +
    99 std::vector<uint64_t> arr4 = sorting::dnf_sort::dnfSort(array4);
    100 assert(std::is_sorted(std::begin(arr4), std::end(arr4)));
    101 std::cout << "passed" << std::endl;
    102}
    std::begin
    T begin(T... args)
    -
    sorting::dnf_sort::dnfSort
    std::vector< T > dnfSort(const std::vector< T > &in_arr)
    The main function implements DNF sort.
    Definition dnf_sort.cpp:38
    +
    sorting::dnf_sort::dnfSort
    std::vector< T > dnfSort(const std::vector< T > &in_arr)
    The main function implements DNF sort.
    Definition dnf_sort.cpp:38
    std::end
    T end(T... args)
    std::endl
    T endl(T... args)
    std::is_sorted
    T is_sorted(T... args)
    @@ -319,7 +319,7 @@ Here is the call graph for this function: diff --git a/d6/d1f/class_complex-members.html b/d6/d1f/class_complex-members.html index 6c4a5fb62..515a9367b 100644 --- a/d6/d1f/class_complex-members.html +++ b/d6/d1f/class_complex-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -122,7 +124,7 @@ $(document).ready(function(){initNavTree('da/d5a/class_complex.html','../../'); diff --git a/d6/d26/classciphers_1_1_hill_cipher.html b/d6/d26/classciphers_1_1_hill_cipher.html index 082af0143..aba54e898 100644 --- a/d6/d26/classciphers_1_1_hill_cipher.html +++ b/d6/d26/classciphers_1_1_hill_cipher.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ciphers::HillCipher Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,56 +108,56 @@ $(document).ready(function(){initNavTree('d6/d26/classciphers_1_1_hill_cipher.ht

    Implementation of Hill Cipher algorithm. - More...

    + More...

    - + - + - + - + - +

    Static Public Member Functions

    static matrix< int > generate_encryption_key (size_t size, int limit1=0, int limit2=10)
    static matrix< int > generate_encryption_key (size_t size, int limit1=0, int limit2=10)
     Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provide more security. Important conditions are:
     
    static matrix< int > generate_decryption_key (matrix< int > const &encrypt_key)
    static matrix< int > generate_decryption_key (matrix< int > const &encrypt_key)
     Generate decryption matrix from an encryption matrix key.
     
    static std::pair< matrix< int >, matrix< int > > generate_keys (size_t size, int limit1=0, int limit2=10)
    static std::pair< matrix< int >, matrix< int > > generate_keys (size_t size, int limit1=0, int limit2=10)
     Generate encryption and decryption key pair.
     
    static const std::string encrypt_text (const std::string &text, const matrix< int > &encrypt_key)
    static const std::string encrypt_text (const std::string &text, const matrix< int > &encrypt_key)
     Encrypt a given text using a given key.
     
    static const std::string decrypt_text (const std::string &text, const matrix< int > &decrypt_key)
    static const std::string decrypt_text (const std::string &text, const matrix< int > &decrypt_key)
     Decrypt a given text using a given key.
     
    - + - + - + - + - + - + - + - + - +

    Static Private Member Functions

    template<typename T1 , typename T2 >
    static const T2 rand_range (T1 a, T1 b)
    static const T2 rand_range (T1 a, T1 b)
     Function to generate a random integer in a given interval.
     
    template<typename T1 , typename T2 >
    static double rand_range (matrix< T2 > *M, T1 a, T1 b)
    static double rand_range (matrix< T2 > *M, T1 a, T1 b)
     Function overload to fill a matrix with random integers in a given interval.
     
    template<typename T >
    static const T gcd (T a, T b)
    static const T gcd (T a, T b)
     Compute GCD of two integers using Euler's algorithm.
     
    static const std::valarray< uint8_t > mat_mul (const std::valarray< uint8_t > &vector, const matrix< int > &key)
    static const std::valarray< uint8_t > mat_mul (const std::valarray< uint8_t > &vector, const matrix< int > &key)
     helper function to perform vector multiplication with encryption or decryption matrix
     
    static char get_idx_char (const uint8_t idx)
    static char get_idx_char (const uint8_t idx)
     Get the character at a given index in the STRKEY.
     
    static uint8_t get_char_idx (const char ch)
    static uint8_t get_char_idx (const char ch)
     Get the index of a character in the STRKEY.
     
    static const std::string codec (const std::string &text, const matrix< int > &key)
    static const std::string codec (const std::string &text, const matrix< int > &key)
     Convenience function to perform block cipher operations. The operations are identical for both encryption and decryption.
     
    template<typename T >
    static matrix< double > get_inverse (matrix< T > const &A)
    static matrix< double > get_inverse (matrix< T > const &A)
     
    static int modulo (int a, int b)
    static int modulo (int a, int b)
     

    Detailed Description

    @@ -173,19 +175,12 @@ Static Private Member Functions static const std::string ciphers::HillCipher::codec ( - const std::string &  - text, + const std::string & text, - const matrix< int > &  - key  - - - - ) - + const matrix< int > & key ) @@ -223,10 +218,10 @@ Static Private Member Functions
    227 for (i = 0; i < L2 - key_len + 1; i += key_len) {
    228 std::valarray<uint8_t> batch_int(key_len);
    229 for (size_t j = 0; j < key_len; j++) {
    -
    230 batch_int[j] = get_char_idx(text[i + j]);
    +
    230 batch_int[j] = get_char_idx(text[i + j]);
    231 }
    232
    -
    233 batch_int = mat_mul(batch_int, key);
    +
    233 batch_int = mat_mul(batch_int, key);
    234
    235 for (size_t j = 0; j < key_len; j++) {
    236 coded_text[i + j] =
    @@ -237,8 +232,8 @@ Static Private Member Functions
    241 return coded_text;
    242 }
    -
    ciphers::HillCipher::mat_mul
    static const std::valarray< uint8_t > mat_mul(const std::valarray< uint8_t > &vector, const matrix< int > &key)
    helper function to perform vector multiplication with encryption or decryption matrix
    Definition hill_cipher.cpp:159
    -
    ciphers::HillCipher::get_char_idx
    static uint8_t get_char_idx(const char ch)
    Get the index of a character in the STRKEY.
    Definition hill_cipher.cpp:190
    +
    ciphers::HillCipher::mat_mul
    static const std::valarray< uint8_t > mat_mul(const std::valarray< uint8_t > &vector, const matrix< int > &key)
    helper function to perform vector multiplication with encryption or decryption matrix
    Definition hill_cipher.cpp:159
    +
    ciphers::HillCipher::get_char_idx
    static uint8_t get_char_idx(const char ch)
    Get the index of a character in the STRKEY.
    Definition hill_cipher.cpp:190
    ciphers::STRKEY
    static const char * STRKEY
    Definition hill_cipher.cpp:73
    std::string::length
    T length(T... args)
    @@ -262,19 +257,12 @@ Here is the call graph for this function:
    static const std::string ciphers::HillCipher::decrypt_text ( - const std::string &  - text, + const std::string & text, - const matrix< int > &  - decrypt_key  - - - - ) - + const matrix< int > & decrypt_key ) @@ -294,9 +282,9 @@ Here is the call graph for this function:
    Returns
    decrypted text
    458 {
    -
    459 return codec(text, decrypt_key);
    +
    459 return codec(text, decrypt_key);
    460 }
    -
    ciphers::HillCipher::codec
    static const std::string codec(const std::string &text, const matrix< int > &key)
    Convenience function to perform block cipher operations. The operations are identical for both encryp...
    Definition hill_cipher.cpp:210
    +
    ciphers::HillCipher::codec
    static const std::string codec(const std::string &text, const matrix< int > &key)
    Convenience function to perform block cipher operations. The operations are identical for both encryp...
    Definition hill_cipher.cpp:210
    Here is the call graph for this function:
    @@ -317,19 +305,12 @@ Here is the call graph for this function:
    static const std::string ciphers::HillCipher::encrypt_text ( - const std::string &  - text, + const std::string & text, - const matrix< int > &  - encrypt_key  - - - - ) - + const matrix< int > & encrypt_key ) @@ -349,7 +330,7 @@ Here is the call graph for this function:
    Returns
    encrypted text
    446 {
    -
    447 return codec(text, encrypt_key);
    +
    447 return codec(text, encrypt_key);
    448 }
    Here is the call graph for this function:
    @@ -373,19 +354,12 @@ template<typename T > static const T ciphers::HillCipher::gcd ( - T  - a, + T a, - T  - b  - - - - ) - + T b ) @@ -435,10 +409,9 @@ Here is the call graph for this function: - + - - +
    static matrix< int > ciphers::HillCipher::generate_decryption_key static matrix< int > ciphers::HillCipher::generate_decryption_key (matrix< int > const & encrypt_key)matrix< int > const & encrypt_key)
    @@ -466,7 +439,7 @@ Here is the call graph for this function:
    377
    378 int mat_determinant = det_encrypt < 0 ? det_encrypt % L : det_encrypt;
    379
    -
    380 matrix<double> tmp_inverse = get_inverse(encrypt_key);
    +
    380 matrix<double> tmp_inverse = get_inverse(encrypt_key);
    381 double d2 = determinant_lu(decrypt_key);
    382
    383 // find co-prime factor for inversion
    @@ -499,7 +472,7 @@ Here is the call graph for this function:
    410 return decrypt_key;
    411 }
    -
    ciphers::HillCipher::get_inverse
    static matrix< double > get_inverse(matrix< T > const &A)
    Definition hill_cipher.cpp:250
    +
    ciphers::HillCipher::get_inverse
    static matrix< double > get_inverse(matrix< T > const &A)
    Definition hill_cipher.cpp:250
    std::exit
    T exit(T... args)
    determinant_lu
    double determinant_lu(const matrix< T > &A)
    Definition lu_decomposition.h:90
    std::round
    T round(T... args)
    @@ -523,27 +496,19 @@ Here is the call graph for this function: - + - - + - - + - - - - - - - +
    static matrix< int > ciphers::HillCipher::generate_encryption_key static matrix< int > ciphers::HillCipher::generate_encryption_key (size_t size, size_t size,
    int limit1 = 0, int limit1 = 0,
    int limit2 = 10 
    )int limit2 = 10 )
    @@ -578,7 +543,7 @@ Here is the call graph for this function:
    348 do {
    349 // keeping the random number range smaller generates better
    350 // defined matrices with more ease of cracking
    -
    351 dd = rand_range(&encrypt_key, limit1, limit2);
    +
    351 dd = rand_range(&encrypt_key, limit1, limit2);
    352 mat_determinant = static_cast<int>(dd);
    353
    354 if (mat_determinant < 0)
    @@ -586,13 +551,13 @@ Here is the call graph for this function:
    356 } while (std::abs(dd) > 1e3 || // while ill-defined
    357 dd < 0.1 || // while singular or negative determinant
    358 !std::isfinite(dd) || // while determinant is not finite
    -
    359 gcd(mat_determinant, L) != 1); // while no common factors
    +
    359 gcd(mat_determinant, L) != 1); // while no common factors
    360 // std::cout <<
    361
    362 return encrypt_key;
    363 }
    -
    ciphers::HillCipher::rand_range
    static const T2 rand_range(T1 a, T1 b)
    Function to generate a random integer in a given interval.
    Definition hill_cipher.cpp:92
    -
    ciphers::HillCipher::gcd
    static const T gcd(T a, T b)
    Compute GCD of two integers using Euler's algorithm.
    Definition hill_cipher.cpp:138
    +
    ciphers::HillCipher::rand_range
    static const T2 rand_range(T1 a, T1 b)
    Function to generate a random integer in a given interval.
    Definition hill_cipher.cpp:92
    +
    ciphers::HillCipher::gcd
    static const T gcd(T a, T b)
    Compute GCD of two integers using Euler's algorithm.
    Definition hill_cipher.cpp:138
    std::isfinite
    T isfinite(T... args)
    Here is the call graph for this function:
    @@ -612,27 +577,19 @@ Here is the call graph for this function: - + - - + - - + - - - - - - - +
    static std::pair< matrix< int >, matrix< int > > ciphers::HillCipher::generate_keys static std::pair< matrix< int >, matrix< int > > ciphers::HillCipher::generate_keys (size_t size, size_t size,
    int limit1 = 0, int limit1 = 0,
    int limit2 = 10 
    )int limit2 = 10 )
    @@ -652,20 +609,20 @@ Here is the call graph for this function:
    Returns
    std::pair<matrix<int>, matrix<int>> encryption and decryption keys as a pair
    -
    See also
    generate_encryption_key
    +
    See also
    generate_encryption_key
    426 {
    -
    427 matrix<int> encrypt_key = generate_encryption_key(size);
    -
    428 matrix<int> decrypt_key = generate_decryption_key(encrypt_key);
    +
    427 matrix<int> encrypt_key = generate_encryption_key(size);
    +
    428 matrix<int> decrypt_key = generate_decryption_key(encrypt_key);
    429 double det2 = determinant_lu(decrypt_key);
    430 while (std::abs(det2) < 0.1 || std::abs(det2) > 1e3) {
    -
    431 encrypt_key = generate_encryption_key(size, limit1, limit2);
    -
    432 decrypt_key = generate_decryption_key(encrypt_key);
    +
    431 encrypt_key = generate_encryption_key(size, limit1, limit2);
    +
    432 decrypt_key = generate_decryption_key(encrypt_key);
    433 det2 = determinant_lu(decrypt_key);
    434 }
    435 return std::make_pair(encrypt_key, decrypt_key);
    436 }
    -
    ciphers::HillCipher::generate_encryption_key
    static matrix< int > generate_encryption_key(size_t size, int limit1=0, int limit2=10)
    Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...
    Definition hill_cipher.cpp:339
    -
    ciphers::HillCipher::generate_decryption_key
    static matrix< int > generate_decryption_key(matrix< int > const &encrypt_key)
    Generate decryption matrix from an encryption matrix key.
    Definition hill_cipher.cpp:371
    +
    ciphers::HillCipher::generate_encryption_key
    static matrix< int > generate_encryption_key(size_t size, int limit1=0, int limit2=10)
    Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...
    Definition hill_cipher.cpp:339
    +
    ciphers::HillCipher::generate_decryption_key
    static matrix< int > generate_decryption_key(matrix< int > const &encrypt_key)
    Generate decryption matrix from an encryption matrix key.
    Definition hill_cipher.cpp:371
    std::make_pair
    T make_pair(T... args)
    Here is the call graph for this function:
    @@ -687,8 +644,7 @@ Here is the call graph for this function: static uint8_t ciphers::HillCipher::get_char_idx ( - const char  - ch) + const char ch) @@ -738,8 +694,7 @@ Here is the call graph for this function: static char ciphers::HillCipher::get_idx_char ( - const uint8_t  - idx) + const uint8_t idx) @@ -774,10 +729,9 @@ template<typename T > - + - - +
    static matrix< double > ciphers::HillCipher::get_inverse static matrix< double > ciphers::HillCipher::get_inverse (matrix< T > const & A)matrix< T > const & A)
    @@ -873,19 +827,12 @@ Here is the call graph for this function: static const std::valarray< uint8_t > ciphers::HillCipher::mat_mul ( - const std::valarray< uint8_t > &  - vector, + const std::valarray< uint8_t > & vector, - const matrix< int > &  - key  - - - - ) - + const matrix< int > & key ) @@ -939,19 +886,12 @@ Here is the call graph for this function: static int ciphers::HillCipher::modulo ( - int  - a, + int a, - int  - b  - - - - ) - + int b ) @@ -983,25 +923,17 @@ template<typename T1 , typename T2 > static double ciphers::HillCipher::rand_range ( - matrix< T2 > *  - M, + matrix< T2 > * M, - T1  - a, + T1 a, - T1  - b  - - - - ) - + T1 b ) @@ -1061,19 +993,12 @@ template<typename T1 , typename T2 > static const T2 ciphers::HillCipher::rand_range ( - T1  - a, + T1 a, - T1  - b  - - - - ) - + T1 b ) @@ -1123,7 +1048,7 @@ Here is the call graph for this function: diff --git a/d6/d26/house__robber_8cpp.html b/d6/d26/house__robber_8cpp.html index dec3bb88c..5e3454168 100644 --- a/d6/d26/house__robber_8cpp.html +++ b/d6/d26/house__robber_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/house_robber.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,13 +129,13 @@ Namespaces - + - + - +

    Functions

    std::uint32_t dynamic_programming::house_robber::houseRobber (const std::vector< uint32_t > &money, const uint32_t &n)
    std::uint32_t dynamic_programming::house_robber::houseRobber (const std::vector< uint32_t > &money, const uint32_t &n)
     The main function that implements the House Robber algorithm using dynamic programming.
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -150,19 +152,12 @@ Functions std::uint32_t dynamic_programming::house_robber::houseRobber ( - const std::vector< uint32_t > &  - money, + const std::vector< uint32_t > & money, - const uint32_t &  - n  - - - - ) - + const uint32_t & n )
    @@ -216,8 +211,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -226,10 +220,10 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    111 {
    -
    112 test(); // run self-test implementations
    +
    112 test(); // run self-test implementations
    113 return 0;
    114}
    -
    test
    static void test()
    Self-test implementations.
    Definition house_robber.cpp:66
    +
    test
    static void test()
    Self-test implementations.
    Definition house_robber.cpp:66
    Here is the call graph for this function:
    @@ -250,7 +244,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -321,7 +315,7 @@ Here is the call graph for this function: diff --git a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.map b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.map index f7bddafac..d6223e6f3 100644 --- a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.map +++ b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.map @@ -1,8 +1,11 @@ - - - - - - + + + + + + + + + diff --git a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.md5 b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.md5 index 39a702324..8ef4cdc2c 100644 --- a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.md5 +++ b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.md5 @@ -1 +1 @@ -7b723a3263ac1a0a1c2e17b6764e444f \ No newline at end of file +455a4be07dce015dea0fc6a1abe2e4e6 \ No newline at end of file diff --git a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.svg b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.svg index a51b9d2e0..28efa54cf 100644 --- a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.svg +++ b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.svg @@ -4,8 +4,8 @@ - + - + binary_search_tree< T >::bst_node @@ -31,10 +31,9 @@ Node2 - - -std::unique_ptr< binary -_search_tree::bst_node > + + +T @@ -42,43 +41,73 @@ Node2->Node1 - - + + - left -right + value + + + +Node4 + + +binary_search_tree +< T >::bst_node + + + + + +Node2->Node4 + + + + + + value Node3 - - -binary_search_tree -< T >::bst_node + + +std::unique_ptr< binary +_search_tree::bst_node > - - -Node2->Node3 - - - + + +Node3->Node1 + + + - left -right + left +right - - -Node3->Node2 - - - + + +Node3->Node4 + + + - ptr + left +right + + + +Node4->Node3 + + + + + + ptr diff --git a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph_org.svg b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph_org.svg index 8832ba69c..944e35042 100644 --- a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph_org.svg +++ b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph_org.svg @@ -4,9 +4,9 @@ - - + + binary_search_tree< T >::bst_node @@ -21,10 +21,9 @@ Node2 - - -std::unique_ptr< binary -_search_tree::bst_node > + + +T @@ -32,43 +31,73 @@ Node2->Node1 - - + + - left -right + value + + + +Node4 + + +binary_search_tree +< T >::bst_node + + + + + +Node2->Node4 + + + + + + value Node3 - - -binary_search_tree -< T >::bst_node + + +std::unique_ptr< binary +_search_tree::bst_node > - - -Node2->Node3 - - - + + +Node3->Node1 + + + - left -right + left +right - - -Node3->Node2 - - - + + +Node3->Node4 + + + - ptr + left +right + + + +Node4->Node3 + + + + + + ptr diff --git a/d6/d2c/caesar__cipher_8cpp.html b/d6/d2c/caesar__cipher_8cpp.html index 753e50e30..dd5c3d55a 100644 --- a/d6/d2c/caesar__cipher_8cpp.html +++ b/d6/d2c/caesar__cipher_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ciphers/caesar_cipher.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,13 +128,13 @@ Namespaces - + - + - + - +

    Functions

    std::string ciphers::caesar::encrypt (const std::string &text, const int &shift)
    std::string ciphers::caesar::encrypt (const std::string &text, const int &shift)
     
    std::string ciphers::caesar::decrypt (const std::string &text, const int &shift)
    std::string ciphers::caesar::decrypt (const std::string &text, const int &shift)
     
    void test ()
    void test ()
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -158,19 +160,12 @@ Algorithm std::string ciphers::caesar::decrypt ( - const std::string &  - text, + const std::string & text, - const int &  - shift  - - - - ) - + const int & shift )
    @@ -209,19 +204,12 @@ Algorithm std::string ciphers::caesar::encrypt ( - const std::string &  - text, + const std::string & text, - const int &  - shift  - - - - ) - + const int & shift )
    @@ -255,8 +243,7 @@ Algorithm int main ( - void  - ) + void ) @@ -264,10 +251,10 @@ Algorithm

    Driver Code

    120 {
    121 // Testing
    -
    122 test();
    +
    122 test();
    123 return 0;
    124}
    -
    test
    void test()
    Definition caesar_cipher.cpp:100
    +
    test
    void test()
    Definition caesar_cipher.cpp:100
    Here is the call graph for this function:
    @@ -285,7 +272,7 @@ Here is the call graph for this function:
    void test ( - ) + ) @@ -294,24 +281,24 @@ Here is the call graph for this function:
    100 {
    101 // Test 1
    102 std::string text1 = "ALANTURING";
    -
    103 std::string encrypted1 = ciphers::caesar::encrypt(text1, 17);
    -
    104 std::string decrypted1 = ciphers::caesar::decrypt(encrypted1, 17);
    +
    103 std::string encrypted1 = ciphers::caesar::encrypt(text1, 17);
    +
    104 std::string decrypted1 = ciphers::caesar::decrypt(encrypted1, 17);
    105 assert(text1 == decrypted1);
    106 std::cout << "Original text : " << text1;
    107 std::cout << " , Encrypted text (with shift = 21) : " << encrypted1;
    108 std::cout << " , Decrypted text : "<< decrypted1 << std::endl;
    109 // Test 2
    110 std::string text2 = "HELLOWORLD";
    -
    111 std::string encrypted2 = ciphers::caesar::encrypt(text2, 1729);
    -
    112 std::string decrypted2 = ciphers::caesar::decrypt(encrypted2, 1729);
    +
    111 std::string encrypted2 = ciphers::caesar::encrypt(text2, 1729);
    +
    112 std::string decrypted2 = ciphers::caesar::decrypt(encrypted2, 1729);
    113 assert(text2 == decrypted2);
    114 std::cout << "Original text : " << text2;
    115 std::cout << " , Encrypted text (with shift = 1729) : " << encrypted2;
    116 std::cout << " , Decrypted text : "<< decrypted2 << std::endl;
    117}
    -
    ciphers::caesar::decrypt
    std::string decrypt(const std::string &text, const int &shift)
    Definition caesar_cipher.cpp:81
    -
    ciphers::caesar::encrypt
    std::string encrypt(const std::string &text, const int &shift)
    Definition caesar_cipher.cpp:65
    +
    ciphers::caesar::decrypt
    std::string decrypt(const std::string &text, const int &shift)
    Definition caesar_cipher.cpp:81
    +
    ciphers::caesar::encrypt
    std::string encrypt(const std::string &text, const int &shift)
    Definition caesar_cipher.cpp:65
    std::endl
    T endl(T... args)
    Here is the call graph for this function:
    @@ -327,7 +314,7 @@ Here is the call graph for this function: diff --git a/d6/d2d/modular__inverse__simple_8cpp.html b/d6/d2d/modular__inverse__simple_8cpp.html index b8ef02752..3c74ef00d 100644 --- a/d6/d2d/modular__inverse__simple_8cpp.html +++ b/d6/d2d/modular__inverse__simple_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/modular_inverse_simple.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,13 +117,13 @@ Include dependency graph for modular_inverse_simple.cpp:
    - + - + - +

    Functions

    uint64_t imod (uint64_t x, uint64_t y)
    uint64_t imod (uint64_t x, uint64_t y)
     for IO operations
     
    static void test ()
    static void test ()
     self-test implementations
     
    int main ()
    int main ()
     Main function.
     
    @@ -138,19 +140,12 @@ Functions uint64_t imod ( - uint64_t  - x, + uint64_t x, - uint64_t  - y  - - - - ) - + uint64_t y )
    @@ -188,8 +183,7 @@ Functions int main ( - void  - ) + void ) @@ -198,9 +192,9 @@ Functions

    Main function.

    Returns
    0 on exit
    58 {
    -
    59 test(); // run self-test implementations
    +
    59 test(); // run self-test implementations
    60};
    -
    test
    static void test()
    self-test implementations
    Definition modular_inverse_simple.cpp:36
    +
    test
    static void test()
    self-test implementations
    Definition modular_inverse_simple.cpp:36
    Here is the call graph for this function:
    @@ -221,7 +215,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -237,23 +231,23 @@ Here is the call graph for this function:
    36 {
    37 std::cout << "First case testing... \n";
    38 // for a = 3 and b = 11 return 4
    -
    39 assert(imod(3, 11) == 4);
    +
    39 assert(imod(3, 11) == 4);
    40 std::cout << "\nPassed!\n";
    41
    42 std::cout << "Second case testing... \n";
    43 // for a = 3 and b = 26 return 9
    -
    44 assert(imod(3, 26) == 9);
    +
    44 assert(imod(3, 26) == 9);
    45 std::cout << "\nPassed!\n";
    46
    47 std::cout << "Third case testing... \n";
    48 // for a = 7 and b = 26 return 15
    -
    49 assert(imod(7, 26) == 15);
    +
    49 assert(imod(7, 26) == 15);
    50 std::cout << "\nPassed!\n";
    51
    52 std::cout << "\nAll test cases have successfully passed!\n";
    53}
    -
    imod
    uint64_t imod(uint64_t x, uint64_t y)
    for IO operations
    Definition modular_inverse_simple.cpp:20
    +
    imod
    uint64_t imod(uint64_t x, uint64_t y)
    for IO operations
    Definition modular_inverse_simple.cpp:20
    Here is the call graph for this function:
    @@ -268,7 +262,7 @@ Here is the call graph for this function:
    diff --git a/d6/d2e/fenwick__tree_8cpp.html b/d6/d2e/fenwick__tree_8cpp.html index 24d9fd594..2d5440ee4 100644 --- a/d6/d2e/fenwick__tree_8cpp.html +++ b/d6/d2e/fenwick__tree_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: range_queries/fenwick_tree.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -130,10 +132,10 @@ Namespaces - + - +

    Functions

    static void tests ()
    static void tests ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -154,8 +156,7 @@ Functions int main ( - void  - ) + void ) @@ -164,10 +165,10 @@ Functions

    Main function.

    Returns
    0 on exit
    132 {
    -
    133 tests(); // run self-test implementations
    +
    133 tests(); // run self-test implementations
    134 return 0;
    135}
    -
    tests
    static void tests()
    Self-test implementations.
    Definition fenwick_tree.cpp:114
    +
    tests
    static void tests()
    Self-test implementations.
    Definition fenwick_tree.cpp:114
    Here is the call graph for this function:
    @@ -188,7 +189,7 @@ Here is the call graph for this function:
    static void tests ( - ) + ) @@ -231,7 +232,7 @@ Here is the call graph for this function:
    diff --git a/d6/d30/classmachine__learning_1_1adaline.html b/d6/d30/classmachine__learning_1_1adaline.html index d784b587c..10908c5a5 100644 --- a/d6/d30/classmachine__learning_1_1adaline.html +++ b/d6/d30/classmachine__learning_1_1adaline.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: machine_learning::adaline Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,21 +116,21 @@ Collaboration diagram for machine_learning::adaline:
    - + - + - + - + - +

    Public Member Functions

     adaline (int num_features, const double eta=0.01f, const double accuracy=1e-5)
     adaline (int num_features, const double eta=0.01f, const double accuracy=1e-5)
     
    int predict (const std::vector< double > &x, double *out=nullptr)
    int predict (const std::vector< double > &x, double *out=nullptr)
     
    double fit (const std::vector< double > &x, const int &y)
    double fit (const std::vector< double > &x, const int &y)
     
    template<size_t N>
    void fit (std::array< std::vector< double >, N > const &X, std::array< int, N > const &Y)
    void fit (std::array< std::vector< double >, N > const &X, std::array< int, N > const &Y)
     
    int activation (double x)
    int activation (double x)
     
    - +

    Private Member Functions

    bool check_size_match (const std::vector< double > &x)
    bool check_size_match (const std::vector< double > &x)
     

    @@ -148,7 +150,7 @@ const double 

    		accuracy<
    - +

    Friends

    std::ostream & operator<< (std::ostream &out, const adaline &ada)
    std::ostream & operator<< (std::ostream &out, const adaline &ada)
     

    Constructor & Destructor Documentation

    @@ -164,25 +166,17 @@ Friends machine_learning::adaline::adaline ( - int  - num_features, + int num_features, - const double  - eta = 0.01f, + const double eta = 0.01f, - const double  - accuracy = 1e-5  - - - - ) - + const double accuracy = 1e-5 ) @@ -199,25 +193,25 @@ Friends -
    57 : eta(eta), accuracy(accuracy) {
    -
    58 if (eta <= 0) {
    +
    57 : eta(eta), accuracy(accuracy) {
    +
    58 if (eta <= 0) {
    59 std::cerr << "learning rate should be positive and nonzero"
    60 << std::endl;
    61 std::exit(EXIT_FAILURE);
    62 }
    63
    -
    64 weights = std::vector<double>(
    +
    64 weights = std::vector<double>(
    65 num_features +
    66 1); // additional weight is for the constant bias term
    67
    68 // initialize with random weights in the range [-50, 49]
    -
    69 for (double &weight : weights) weight = 1.f;
    +
    69 for (double &weight : weights) weight = 1.f;
    70 // weights[i] = (static_cast<double>(std::rand() % 100) - 50);
    71 }
    -
    machine_learning::adaline::eta
    const double eta
    learning rate of the algorithm
    Definition adaline_learning.cpp:207
    -
    machine_learning::adaline::weights
    std::vector< double > weights
    weights of the neural network
    Definition adaline_learning.cpp:209
    -
    machine_learning::adaline::accuracy
    const double accuracy
    model fit convergence accuracy
    Definition adaline_learning.cpp:208
    +
    machine_learning::adaline::eta
    const double eta
    learning rate of the algorithm
    Definition adaline_learning.cpp:207
    +
    machine_learning::adaline::weights
    std::vector< double > weights
    weights of the neural network
    Definition adaline_learning.cpp:209
    +
    machine_learning::adaline::accuracy
    const double accuracy
    model fit convergence accuracy
    Definition adaline_learning.cpp:208
    std::endl
    T endl(T... args)
    std::exit
    T exit(T... args)
    @@ -242,8 +236,7 @@ Here is the call graph for this function:
    int machine_learning::adaline::activation ( - double  - x) + double x) @@ -284,8 +277,7 @@ f(x) = \begin{cases} bool machine_learning::adaline::check_size_match ( - const std::vector< double > &  - x) + const std::vector< double > & x) @@ -305,7 +297,7 @@ f(x) = \begin{cases}
    false size does not match
    196 {
    -
    197 if (x.size() != (weights.size() - 1)) {
    +
    197 if (x.size() != (weights.size() - 1)) {
    198 std::cerr << __func__ << ": "
    199 << "Number of features in x does not match the feature "
    200 "dimension in model!"
    @@ -335,19 +327,12 @@ Here is the call graph for this function:
    double machine_learning::adaline::fit ( - const std::vector< double > &  - x, + const std::vector< double > & x, - const int &  - y  - - - - ) - + const int & y ) @@ -365,25 +350,25 @@ Here is the call graph for this function:
    Returns
    correction factor
    119 {
    -
    120 if (!check_size_match(x)) {
    +
    120 if (!check_size_match(x)) {
    121 return 0;
    122 }
    123
    124 /* output of the model with current weights */
    -
    125 int p = predict(x);
    +
    125 int p = predict(x);
    126 int prediction_error = y - p; // error in estimation
    -
    127 double correction_factor = eta * prediction_error;
    +
    127 double correction_factor = eta * prediction_error;
    128
    129 /* update each weight, the last weight is the bias term */
    130 for (int i = 0; i < x.size(); i++) {
    -
    131 weights[i] += correction_factor * x[i];
    +
    131 weights[i] += correction_factor * x[i];
    132 }
    -
    133 weights[x.size()] += correction_factor; // update bias
    +
    133 weights[x.size()] += correction_factor; // update bias
    134
    135 return correction_factor;
    136 }
    -
    machine_learning::adaline::predict
    int predict(const std::vector< double > &x, double *out=nullptr)
    Definition adaline_learning.cpp:95
    -
    machine_learning::adaline::check_size_match
    bool check_size_match(const std::vector< double > &x)
    Definition adaline_learning.cpp:196
    +
    machine_learning::adaline::predict
    int predict(const std::vector< double > &x, double *out=nullptr)
    Definition adaline_learning.cpp:95
    +
    machine_learning::adaline::check_size_match
    bool check_size_match(const std::vector< double > &x)
    Definition adaline_learning.cpp:196
    Here is the call graph for this function:
    @@ -406,19 +391,12 @@ template<size_t N>
    void machine_learning::adaline::fit ( - std::array< std::vector< double >, N > const &  - X, + std::array< std::vector< double >, N > const & X, - std::array< int, N > const &  - Y  - - - - ) - + std::array< int, N > const & Y ) @@ -438,13 +416,13 @@ template<size_t N>
    147 double avg_pred_error = 1.f;
    148
    149 int iter = 0;
    -
    150 for (iter = 0; (iter < MAX_ITER) && (avg_pred_error > accuracy);
    +
    150 for (iter = 0; (iter < MAX_ITER) && (avg_pred_error > accuracy);
    151 iter++) {
    152 avg_pred_error = 0.f;
    153
    154 // perform fit for each sample
    155 for (int i = 0; i < N; i++) {
    -
    156 double err = fit(X[i], Y[i]);
    +
    156 double err = fit(X[i], Y[i]);
    157 avg_pred_error += std::abs(err);
    158 }
    159 avg_pred_error /= N;
    @@ -463,7 +441,7 @@ template<size_t N>
    172 << std::endl;
    173 }
    174 }
    -
    machine_learning::adaline::fit
    double fit(const std::vector< double > &x, const int &y)
    Definition adaline_learning.cpp:119
    +
    machine_learning::adaline::fit
    double fit(const std::vector< double > &x, const int &y)
    Definition adaline_learning.cpp:119
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:47
    MAX_ITER
    constexpr int MAX_ITER
    Definition adaline_learning.cpp:40
    @@ -486,19 +464,12 @@ Here is the call graph for this function:
    int machine_learning::adaline::predict ( - const std::vector< double > &  - x, + const std::vector< double > & x, - double *  - out = nullptr  - - - - ) - + double * out = nullptr ) @@ -516,24 +487,24 @@ Here is the call graph for this function:
    Returns
    model prediction output
    95 {
    -
    96 if (!check_size_match(x)) {
    +
    96 if (!check_size_match(x)) {
    97 return 0;
    98 }
    99
    -
    100 double y = weights.back(); // assign bias value
    +
    100 double y = weights.back(); // assign bias value
    101
    102 // for (int i = 0; i < x.size(); i++) y += x[i] * weights[i];
    -
    103 y = std::inner_product(x.begin(), x.end(), weights.begin(), y);
    +
    103 y = std::inner_product(x.begin(), x.end(), weights.begin(), y);
    104
    105 if (out != nullptr) { // if out variable is provided
    106 *out = y;
    107 }
    108
    -
    109 return activation(y); // quantizer: apply ADALINE threshold function
    +
    109 return activation(y); // quantizer: apply ADALINE threshold function
    110 }
    std::vector::back
    T back(T... args)
    std::vector::begin
    T begin(T... args)
    -
    machine_learning::adaline::activation
    int activation(double x)
    Definition adaline_learning.cpp:186
    +
    machine_learning::adaline::activation
    int activation(double x)
    Definition adaline_learning.cpp:186
    std::vector::end
    T end(T... args)
    std::inner_product
    T inner_product(T... args)
    @@ -557,19 +528,12 @@ Here is the call graph for this function:
    std::ostream & operator<< ( - std::ostream &  - out, + std::ostream & out, - const adaline &  - ada  - - - - ) - + const adaline & ada ) @@ -581,9 +545,9 @@ Here is the call graph for this function:

    Operator to print the weights of the model

    76 {
    77 out << "<";
    -
    78 for (int i = 0; i < ada.weights.size(); i++) {
    -
    79 out << ada.weights[i];
    -
    80 if (i < ada.weights.size() - 1) {
    +
    78 for (int i = 0; i < ada.weights.size(); i++) {
    +
    79 out << ada.weights[i];
    +
    80 if (i < ada.weights.size() - 1) {
    81 out << ", ";
    82 }
    83 }
    @@ -602,7 +566,7 @@ Here is the call graph for this function:
    diff --git a/d6/d38/find__non__repeating__number_8cpp.html b/d6/d38/find__non__repeating__number_8cpp.html index 5afbac7dc..400e6bcf6 100644 --- a/d6/d38/find__non__repeating__number_8cpp.html +++ b/d6/d38/find__non__repeating__number_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: bit_manipulation/find_non_repeating_number.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,13 +128,13 @@ Namespaces - + - + - +

    Functions

    int64_t bit_manipulation::find_non_repeating_integer::find_non_repeating_integer (const std::vector< int > &nums)
    int64_t bit_manipulation::find_non_repeating_integer::find_non_repeating_integer (const std::vector< int > &nums)
     The main function implements find single number.
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -151,8 +153,7 @@ Functions int64_t bit_manipulation::find_non_repeating_integer::find_non_repeating_integer ( - const std::vector< int > &  - nums) + const std::vector< int > & nums) @@ -194,8 +195,7 @@ Functions int main ( - void  - ) + void ) @@ -204,10 +204,10 @@ Functions

    Main function.

    Returns
    0 on exit
    85 {
    -
    86 test(); // run self-test implementations
    +
    86 test(); // run self-test implementations
    87 return 0;
    88}
    -
    test
    static void test()
    Self-test implementations.
    Definition find_non_repeating_number.cpp:62
    +
    test
    static void test()
    Self-test implementations.
    Definition find_non_repeating_number.cpp:62
    Here is the call graph for this function:
    @@ -228,7 +228,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -278,7 +278,7 @@ Here is the call graph for this function:
    diff --git a/d6/d42/data__structures_2sparse__table_8cpp.html b/d6/d42/data__structures_2sparse__table_8cpp.html index 2a8845db2..dd0b21739 100644 --- a/d6/d42/data__structures_2sparse__table_8cpp.html +++ b/d6/d42/data__structures_2sparse__table_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/sparse_table.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -133,16 +135,16 @@ Namespaces - + - +

    Functions

    static void test ()
    static void test ()
     Self-test implementations.
     
    int main (int argc, char *argv[])
    int main (int argc, char *argv[])
     Main function.
     
    - + - - + - - - - - - - +

    Variables

    constexpr uint32_t data_structures::sparse_table::N = 12345
    constexpr uint32_t data_structures::sparse_table::N = 12345
     A struct to represent sparse table for min() as their invariant function, for the given array A. The answer to queries are stored in the array ST.
     
    @@ -155,7 +157,7 @@ constexpr uint8_t data_str
    Author
    Mann Patel

    Sparse Table is a data structure, that allows answering range queries. It can answer most range queries in O(logn), but its true power is answering range minimum queries (or equivalent range maximum queries). For those queries it can compute the answer in O(1) time. The only drawback of this data structure is, that it can only be used on immutable arrays. This means, that the array cannot be changed between two queries.

    If any element in the array changes, the complete data structure has to be recomputed.

    -
    Todo:
    make stress tests.
    +
    Todo
    make stress tests.
    Warning
    This sparse table is made for min(a1,a2,...an) duplicate invariant function. This implementation can be changed to other functions like gcd(), lcm(), and max() by changing a few lines of code.

    Function Documentation

    @@ -167,19 +169,12 @@ constexpr uint8_t     		data_str
    int main (int argc, int argc,
    char * argv[] 
    )char * argv[] )
    @@ -194,10 +189,10 @@ constexpr uint8_t data_str
    Returns
    0 on exit
    161 {
    -
    162 test(); // run self-test implementations
    +
    162 test(); // run self-test implementations
    163 return 0;
    164}
    -
    test
    static void test()
    Self-test implementations.
    Definition sparse_table.cpp:128
    +
    test
    static void test()
    Self-test implementations.
    Definition sparse_table.cpp:128
    Here is the call graph for this function:
    @@ -218,7 +213,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -313,7 +308,7 @@ Here is the call graph for this function:
    diff --git a/d6/d42/miller__rabin_8cpp.html b/d6/d42/miller__rabin_8cpp.html index 7b63d8647..1ab561192 100644 --- a/d6/d42/miller__rabin_8cpp.html +++ b/d6/d42/miller__rabin_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/miller_rabin.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,20 +117,20 @@ Include dependency graph for miller_rabin.cpp:

    Functions

    template<typename T > -std::vector< T > reverse_binary (T num) +std::vector< T > reverse_binary (T num)   template<typename T > -T modular_exponentiation (T base, const std::vector< T > &rev_binary_exponent, T mod) +T modular_exponentiation (T base, const std::vector< T > &rev_binary_exponent, T mod)   template<typename T > -bool miller_test (T d, T num) +bool miller_test (T d, T num)   template<typename T > -bool miller_rabin_primality_test (T num, T repeats) +bool miller_rabin_primality_test (T num, T repeats)   -void tests () +void tests ()   -int main () +int main ()  

    Detailed Description

    @@ -144,18 +146,17 @@ Functions int main ( - void  - ) + void )

    Main function

    183 {
    -
    184 tests();
    +
    184 tests();
    185 return 0;
    186}
    -
    tests
    void tests()
    Definition miller_rabin.cpp:157
    +
    tests
    void tests()
    Definition miller_rabin.cpp:157
    Here is the call graph for this function:
    @@ -175,19 +176,12 @@ template<typename T >
    bool miller_rabin_primality_test ( - T  - num, + T num, - T  - repeats  - - - - ) - + T repeats )
    @@ -223,13 +217,13 @@ template<typename T >
    143 }
    144
    145 for (T i = 0; i < repeats; ++i) {
    -
    146 if (!miller_test(d, num)) {
    +
    146 if (!miller_test(d, num)) {
    147 return false;
    148 }
    149 }
    150 return true;
    151}
    -
    miller_test
    bool miller_test(T d, T num)
    Definition miller_rabin.cpp:73
    +
    miller_test
    bool miller_test(T d, T num)
    Definition miller_rabin.cpp:73
    Here is the call graph for this function:
    @@ -249,19 +243,12 @@ template<typename T >
    bool miller_test ( - T  - d, + T d, - T  - num  - - - - ) - + T num )
    @@ -285,9 +272,9 @@ template<typename T >
    80 // Random number generated in the range [2, num -2].
    81 T random = distribution(gen);
    82 // vector for reverse binary of the power
    -
    83 std::vector<T> power = reverse_binary(d);
    +
    83 std::vector<T> power = reverse_binary(d);
    84 // x = random ^ d % num
    -
    85 T x = modular_exponentiation(random, power, num);
    +
    85 T x = modular_exponentiation(random, power, num);
    86 // miller conditions
    87 if (x == 1 || x == num - 1) {
    88 return true;
    @@ -306,8 +293,8 @@ template<typename T >
    101 return false;
    102}
    -
    reverse_binary
    std::vector< T > reverse_binary(T num)
    Definition miller_rabin.cpp:19
    -
    modular_exponentiation
    T modular_exponentiation(T base, const std::vector< T > &rev_binary_exponent, T mod)
    Definition miller_rabin.cpp:43
    +
    reverse_binary
    std::vector< T > reverse_binary(T num)
    Definition miller_rabin.cpp:19
    +
    modular_exponentiation
    T modular_exponentiation(T base, const std::vector< T > &rev_binary_exponent, T mod)
    Definition miller_rabin.cpp:43
    power
    void power(int x, int n)
    Definition power_for_huge_numbers.cpp:56
    @@ -331,25 +318,17 @@ template<typename T > T modular_exponentiation ( - T  - base, + T base, - const std::vector< T > &  - rev_binary_exponent, + const std::vector< T > & rev_binary_exponent, - T  - mod  - - - - ) - + T mod )
    @@ -373,7 +352,7 @@ template<typename T >
    51 if (rev_binary_exponent[0] == 1)
    52 b = base;
    53
    -
    54 for (typename std::vector<T>::const_iterator it =
    +
    54 for (typename std::vector<T>::const_iterator it =
    55 rev_binary_exponent.cbegin() + 1;
    56 it != rev_binary_exponent.cend(); ++it) {
    57 A = A * A % mod;
    @@ -404,8 +383,7 @@ template<typename T > std::vector< T > reverse_binary ( - T  - num) + T num) @@ -439,37 +417,37 @@ template<typename T > void tests ( - ) + )
    -

    Functions for testing the miller_rabin_primality_test() function with some assert statements.

    +

    Functions for testing the miller_rabin_primality_test() function with some assert statements.

    157 {
    158 // First test on 2
    159 assert(((void)"2 is prime but function says otherwise.\n",
    -
    160 miller_rabin_primality_test(2, 1) == true));
    +
    160 miller_rabin_primality_test(2, 1) == true));
    161 std::cout << "First test passes." << std::endl;
    162 // Second test on 5
    163 assert(((void)"5 should be prime but the function says otherwise.\n",
    -
    164 miller_rabin_primality_test(5, 3) == true));
    +
    164 miller_rabin_primality_test(5, 3) == true));
    165 std::cout << "Second test passes." << std::endl;
    166 // Third test on 23
    167 assert(((void)"23 should be prime but the function says otherwise.\n",
    -
    168 miller_rabin_primality_test(23, 3) == true));
    +
    168 miller_rabin_primality_test(23, 3) == true));
    169 std::cout << "Third test passes." << std::endl;
    170 // Fourth test on 16
    171 assert(((void)"16 is not a prime but the function says otherwise.\n",
    -
    172 miller_rabin_primality_test(16, 3) == false));
    +
    172 miller_rabin_primality_test(16, 3) == false));
    173 std::cout << "Fourth test passes." << std::endl;
    174 // Fifth test on 27
    175 assert(((void)"27 is not a prime but the function says otherwise.\n",
    -
    176 miller_rabin_primality_test(27, 3) == false));
    +
    176 miller_rabin_primality_test(27, 3) == false));
    177 std::cout << "Fifth test passes." << std::endl;
    178}
    std::endl
    T endl(T... args)
    -
    miller_rabin_primality_test
    bool miller_rabin_primality_test(T num, T repeats)
    Definition miller_rabin.cpp:125
    +
    miller_rabin_primality_test
    bool miller_rabin_primality_test(T num, T repeats)
    Definition miller_rabin.cpp:125
    Here is the call graph for this function:
    @@ -484,7 +462,7 @@ Here is the call graph for this function:
    diff --git a/d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html b/d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html index a124f3c36..1fb093e49 100644 --- a/d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html +++ b/d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ciphers::elliptic_curve_key_exchange::Point Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('d6/d45/structciphers_1_1elliptic__curv

    Definition of struct Point. - More...

    + More...

    Collaboration diagram for ciphers::elliptic_curve_key_exchange::Point:
    @@ -116,7 +118,7 @@ Collaboration diagram for ciphers::elliptic_curve_key_exchange::Point:
    - +

    Public Member Functions

    bool operator== (const Point &p)
    bool operator== (const Point &p)
     x and y co-ordinates
     
    @@ -131,7 +133,7 @@ Public Attributes
    - +

    Friends

    std::ostream & operator<< (std::ostream &op, const Point &p)
    std::ostream & operator<< (std::ostream &op, const Point &p)
     ostream operator for printing Point
     
    @@ -151,8 +153,7 @@ Friends bool ciphers::elliptic_curve_key_exchange::Point::operator== ( - const Point &  - p) + const Point & p) @@ -190,19 +191,12 @@ Friends std::ostream & operator<< ( - std::ostream &  - op, + std::ostream & op, - const Point &  - p  - - - - ) - + const Point & p ) @@ -237,7 +231,7 @@ Friends diff --git a/d6/d4a/addition__rule_8cpp.html b/d6/d4a/addition__rule_8cpp.html index 5b2faf72e..d4e7e4c5b 100644 --- a/d6/d4a/addition__rule_8cpp.html +++ b/d6/d4a/addition__rule_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: probability/addition_rule.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,11 +116,11 @@ Include dependency graph for addition_rule.cpp:
    - + - + - +

    Functions

    double addition_rule_independent (double A, double B)
    double addition_rule_independent (double A, double B)
     
    double addition_rule_dependent (double A, double B, double B_given_A)
    double addition_rule_dependent (double A, double B, double B_given_A)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -133,25 +135,17 @@ Functions double addition_rule_dependent ( - double  - A, + double A, - double  - B, + double B, - double  - B_given_A  - - - - ) - + double B_given_A )
    @@ -171,19 +165,12 @@ Functions double addition_rule_independent ( - double  - A, + double A, - double  - B  - - - - ) - + double B )
    @@ -203,8 +190,7 @@ Functions int main ( - void  - ) + void ) @@ -215,16 +201,16 @@ Functions
    32 double B = 0.25;
    33 double B_given_A = 0.05;
    34
    -
    35 std::cout << "independent P(A or B) = " << addition_rule_independent(A, B)
    +
    35 std::cout << "independent P(A or B) = " << addition_rule_independent(A, B)
    36 << std::endl;
    37
    38 std::cout << "dependent P(A or B) = "
    -
    39 << addition_rule_dependent(A, B, B_given_A) << std::endl;
    +
    39 << addition_rule_dependent(A, B, B_given_A) << std::endl;
    40
    41 return 0;
    42}
    -
    addition_rule_independent
    double addition_rule_independent(double A, double B)
    Definition addition_rule.cpp:14
    -
    addition_rule_dependent
    double addition_rule_dependent(double A, double B, double B_given_A)
    Definition addition_rule.cpp:25
    +
    addition_rule_independent
    double addition_rule_independent(double A, double B)
    Definition addition_rule.cpp:14
    +
    addition_rule_dependent
    double addition_rule_dependent(double A, double B, double B_given_A)
    Definition addition_rule.cpp:25
    std::endl
    T endl(T... args)
    @@ -241,7 +227,7 @@ Here is the call graph for this function:
    diff --git a/d6/d4e/namespaceciphers.html b/d6/d4e/namespaceciphers.html index cc95ff69e..f2a9ccadb 100644 --- a/d6/d4e/namespaceciphers.html +++ b/d6/d4e/namespaceciphers.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ciphers Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d6/d4e/namespaceciphers.html','../../'

    Algorithms for encryption and decryption. -More...

    +More...

    @@ -122,7 +124,7 @@ Classes

    Namespaces

    - +

    Variables

    static const char * STRKEY
    static const char * STRKEY
     

    Detailed Description

    @@ -170,7 +172,7 @@ Variables diff --git a/d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html b/d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html index 4e8934ddd..ed8030651 100644 --- a/d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html +++ b/d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/iterative_factorial.cpp + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -236,7 +238,7 @@ $(document).ready(function(){initNavTree('d6/d50/_2_users_2runner_2work_2_c-_plu diff --git a/d6/d53/namespaceword__break.html b/d6/d53/namespaceword__break.html index 74d303a0c..74dc812b7 100644 --- a/d6/d53/namespaceword__break.html +++ b/d6/d53/namespaceword__break.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: word_break Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d6/d53/namespaceword__break.html','../

    Functions for Word Break problem. -More...

    +More...

    Detailed Description

    Functions for Word Break problem.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d6/d53/namespaceword__break.html','../ diff --git a/d6/d57/array__right__rotation_8cpp.html b/d6/d57/array__right__rotation_8cpp.html index 782acfda0..4d6ed8ae8 100644 --- a/d6/d57/array__right__rotation_8cpp.html +++ b/d6/d57/array__right__rotation_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: operations_on_datastructures/array_right_rotation.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -147,10 +149,10 @@ Functions void tests::test5 ()  A Test to check a shift of zero.
      -static void test () +static void test ()  Function to test the correctness of shift_right() function.
      -int main () +int main ()  main function
      @@ -168,8 +170,7 @@ Functions int main ( - void  - ) + void ) @@ -178,10 +179,10 @@ Functions

    main function

    Returns
    0 on exit
    172 {
    -
    173 test(); // run self-test implementations
    +
    173 test(); // run self-test implementations
    174 return 0;
    175}
    -
    test
    static void test()
    Function to test the correctness of shift_right() function.
    Definition array_right_rotation.cpp:160
    +
    test
    static void test()
    Function to test the correctness of shift_right() function.
    Definition array_right_rotation.cpp:160
    Here is the call graph for this function:
    @@ -202,7 +203,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -241,7 +242,7 @@ Here is the call graph for this function:
    diff --git a/d6/d60/group__ode.html b/d6/d60/group__ode.html index 351ab334d..77532dfed 100644 --- a/d6/d60/group__ode.html +++ b/d6/d60/group__ode.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Ordinary Differential Equations + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -105,27 +107,27 @@ $(document).ready(function(){initNavTree('d6/d60/group__ode.html','../../'); ini - + - + - + - + - + - +

    Functions

    void forward_euler_step (const double dx, const double x, std::valarray< double > *y, std::valarray< double > *dy)
    void forward_euler_step (const double dx, const double x, std::valarray< double > *y, std::valarray< double > *dy)
     Compute next step approximation using the forward-Euler method.
     
    double forward_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
    double forward_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
     Compute approximation using the forward-Euler method in the given limits.
     
    void midpoint_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
    void midpoint_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
     Compute next step approximation using the midpoint-Euler method.
     
    double midpoint_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
    double midpoint_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
     Compute approximation using the midpoint-Euler method in the given limits.
     
    void semi_implicit_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
    void semi_implicit_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
     Compute next step approximation using the semi-implicit-Euler method.
     
    double semi_implicit_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
    double semi_implicit_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
     Compute approximation using the semi-implicit-Euler method in the given limits.
     

    Detailed Description

    -

    Integration functions for implementations with solving ordinary differential equations (ODEs) of any order and and any number of independent variables.

    +

    Integration functions for implementations with solving ordinary differential equations (ODEs) of any order and and any number of independent variables.

    Function Documentation

    ◆ forward_euler()

    @@ -136,37 +138,27 @@ Functions double forward_euler ( - double  - dx, + double dx, - double  - x0, + double x0, - double  - x_max, + double x_max, - std::valarray< double > *  - y, + std::valarray< double > * y, - bool  - save_to_file = false  - - - - ) - + bool save_to_file = false )
    @@ -210,7 +202,7 @@ Functions
    127 fp << y[0][L - 1] << "\n"; // NOLINT
    128 }
    129
    -
    130 forward_euler_step(dx, x, y, &dy); // perform integration
    +
    130 forward_euler_step(dx, x, y, &dy); // perform integration
    131 x += dx; // update step
    132 } while (x <= x_max); // till upper limit of independent variable
    133 /* end of integration */
    @@ -226,7 +218,7 @@ Functions
    std::clock
    T clock(T... args)
    std::ofstream::close
    T close(T... args)
    -
    forward_euler_step
    void forward_euler_step(const double dx, const double x, std::valarray< double > *y, std::valarray< double > *dy)
    Compute next step approximation using the forward-Euler method.
    Definition ode_forward_euler.cpp:86
    +
    forward_euler_step
    void forward_euler_step(const double dx, const double x, std::valarray< double > *y, std::valarray< double > *dy)
    Compute next step approximation using the forward-Euler method.
    Definition ode_forward_euler.cpp:86
    std::ofstream::is_open
    T is_open(T... args)
    std::ofstream::open
    T open(T... args)
    std::perror
    T perror(T... args)
    @@ -249,31 +241,22 @@ Here is the call graph for this function:
    void forward_euler_step ( - const double  - dx, + const double dx, - const double  - x, + const double x, - std::valarray< double > *  - y, + std::valarray< double > * y, - std::valarray< double > *  - dy  - - - - ) - + std::valarray< double > * dy )
    @@ -313,37 +296,27 @@ Here is the call graph for this function:
    double midpoint_euler ( - double  - dx, + double dx, - double  - x0, + double x0, - double  - x_max, + double x_max, - std::valarray< double > *  - y, + std::valarray< double > * y, - bool  - save_to_file = false  - - - - ) - + bool save_to_file = false )
    @@ -386,7 +359,7 @@ Here is the call graph for this function:
    131 fp << y[0][L - 1] << "\n";
    132 }
    133
    -
    134 midpoint_euler_step(dx, x, y, &dy); // perform integration
    +
    134 midpoint_euler_step(dx, x, y, &dy); // perform integration
    135 x += dx; // update step
    136 } while (x <= x_max); // till upper limit of independent variable
    137 /* end of integration */
    @@ -397,7 +370,7 @@ Here is the call graph for this function:
    142
    143 return static_cast<double>(t2 - t1) / CLOCKS_PER_SEC;
    144}
    -
    midpoint_euler_step
    void midpoint_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
    Compute next step approximation using the midpoint-Euler method.
    Definition ode_midpoint_euler.cpp:85
    +
    midpoint_euler_step
    void midpoint_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
    Compute next step approximation using the midpoint-Euler method.
    Definition ode_midpoint_euler.cpp:85
    Here is the call graph for this function:
    @@ -415,31 +388,22 @@ Here is the call graph for this function:
    void midpoint_euler_step ( - const double  - dx, + const double dx, - const double &  - x, + const double & x, - std::valarray< double > *  - y, + std::valarray< double > * y, - std::valarray< double > *  - dy  - - - - ) - + std::valarray< double > * dy )
    @@ -486,37 +450,27 @@ Here is the call graph for this function:
    double semi_implicit_euler ( - double  - dx, + double dx, - double  - x0, + double x0, - double  - x_max, + double x_max, - std::valarray< double > *  - y, + std::valarray< double > * y, - bool  - save_to_file = false  - - - - ) - + bool save_to_file = false )
    @@ -559,7 +513,7 @@ Here is the call graph for this function:
    128 fp << y[0][L - 1] << "\n";
    129 }
    130
    -
    131 semi_implicit_euler_step(dx, x, y, &dy); // perform integration
    +
    131 semi_implicit_euler_step(dx, x, y, &dy); // perform integration
    132 x += dx; // update step
    133 } while (x <= x_max); // till upper limit of independent variable
    134 /* end of integration */
    @@ -570,7 +524,7 @@ Here is the call graph for this function:
    139
    140 return static_cast<double>(t2 - t1) / CLOCKS_PER_SEC;
    141}
    -
    semi_implicit_euler_step
    void semi_implicit_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
    Compute next step approximation using the semi-implicit-Euler method.
    Definition ode_semi_implicit_euler.cpp:82
    +
    semi_implicit_euler_step
    void semi_implicit_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
    Compute next step approximation using the semi-implicit-Euler method.
    Definition ode_semi_implicit_euler.cpp:82
    Here is the call graph for this function:
    @@ -588,31 +542,22 @@ Here is the call graph for this function:
    void semi_implicit_euler_step ( - const double  - dx, + const double dx, - const double &  - x, + const double & x, - std::valarray< double > *  - y, + std::valarray< double > * y, - std::valarray< double > *  - dy  - - - - ) - + std::valarray< double > * dy )
    @@ -652,7 +597,7 @@ Here is the call graph for this function:
    diff --git a/d6/d74/namespacekadane.html b/d6/d74/namespacekadane.html index 6c54355a1..839643491 100644 --- a/d6/d74/namespacekadane.html +++ b/d6/d74/namespacekadane.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: kadane Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d6/d74/namespacekadane.html','../../')

    Functions for Kadane algorithm. -More...

    +More...

    Detailed Description

    Functions for Kadane algorithm.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d6/d74/namespacekadane.html','../../') diff --git a/d6/d7a/golden__search__extrema_8cpp.html b/d6/d7a/golden__search__extrema_8cpp.html index a2c5e821c..a8ca76b5d 100644 --- a/d6/d7a/golden__search__extrema_8cpp.html +++ b/d6/d7a/golden__search__extrema_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/golden_search_extrema.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -129,22 +131,22 @@ Macros - + - + - + - + - +

    Functions

    double get_minima (const std::function< double(double)> &f, double lim_a, double lim_b)
    double get_minima (const std::function< double(double)> &f, double lim_a, double lim_b)
     Get the minima of a function in the given interval. To get the maxima, simply negate the function. The golden ratio used here is:
     
    void test1 ()
    void test1 ()
     Test function to find minima for the function \(f(x)= (x-2)^2\) in the interval \([1,5]\)
    Expected result = 2.
     
    void test2 ()
    void test2 ()
     Test function to find maxima for the function \(f(x)= x^{\frac{1}{x}}\) in the interval \([-2,10]\)
    Expected result: \(e\approx 2.71828182845904509\).
     
    void test3 ()
    void test3 ()
     Test function to find maxima for the function \(f(x)= \cos x\) in the interval \([0,12]\)
    Expected result: \(\pi\approx 3.14159265358979312\).
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -161,25 +163,17 @@ Functions double get_minima ( - const std::function< double(double)> &  - f, + const std::function< double(double)> & f, - double  - lim_a, + double lim_a, - double  - lim_b  - - - - ) - + double lim_b )
    @@ -209,8 +203,8 @@ k=\frac{3-\sqrt{5}}{2} \approx 0.381966\ldots\]
    38 // ensure that lim_a < lim_b
    39 if (lim_a > lim_b) {
    40 std::swap(lim_a, lim_b);
    -
    41 } else if (std::abs(lim_a - lim_b) <= EPSILON) {
    -
    42 std::cerr << "Search range must be greater than " << EPSILON << "\n";
    +
    41 } else if (std::abs(lim_a - lim_b) <= EPSILON) {
    +
    42 std::cerr << "Search range must be greater than " << EPSILON << "\n";
    43 return lim_a;
    44 }
    45
    @@ -234,14 +228,14 @@ k=\frac{3-\sqrt{5}}{2} \approx 0.381966\ldots\]
    63 iters++;
    64
    65 // continue till the interval width is greater than sqrt(system epsilon)
    -
    66 } while (std::abs(lim_a - lim_b) > EPSILON);
    +
    66 } while (std::abs(lim_a - lim_b) > EPSILON);
    67
    68 std::cout << " (iters: " << iters << ") ";
    69 return prev_mean;
    70}
    numerical_methods::simpson_method::f
    double f(double x)
    A function f(x) that will be used to test the method.
    Definition composite_simpson_rule.cpp:113
    -
    EPSILON
    #define EPSILON
    solution accuracy limit
    Definition golden_search_extrema.cpp:17
    +
    EPSILON
    #define EPSILON
    solution accuracy limit
    Definition golden_search_extrema.cpp:17
    std::numeric_limits::infinity
    T infinity(T... args)
    std::sqrt
    T sqrt(T... args)
    std::swap
    T swap(T... args)
    @@ -262,8 +256,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -272,18 +265,18 @@ Here is the call graph for this function:
    139 {
    140 std::cout.precision(9);
    141
    -
    142 std::cout << "Computations performed with machine epsilon: " << EPSILON
    +
    142 std::cout << "Computations performed with machine epsilon: " << EPSILON
    143 << "\n";
    144
    -
    145 test1();
    -
    146 test2();
    -
    147 test3();
    +
    145 test1();
    +
    146 test2();
    +
    147 test3();
    148
    149 return 0;
    150}
    -
    test2
    void test2()
    Test function to find maxima for the function in the interval Expected result: .
    Definition golden_search_extrema.cpp:100
    -
    test1
    void test1()
    Test function to find minima for the function in the interval Expected result = 2.
    Definition golden_search_extrema.cpp:78
    -
    test3
    void test3()
    Test function to find maxima for the function in the interval Expected result: .
    Definition golden_search_extrema.cpp:123
    +
    test2
    void test2()
    Test function to find maxima for the function in the interval Expected result: .
    Definition golden_search_extrema.cpp:100
    +
    test1
    void test1()
    Test function to find minima for the function in the interval Expected result = 2.
    Definition golden_search_extrema.cpp:78
    +
    test3
    void test3()
    Test function to find maxima for the function in the interval Expected result: .
    Definition golden_search_extrema.cpp:123
    Here is the call graph for this function:
    @@ -301,7 +294,7 @@ Here is the call graph for this function:
    void test1 ( - ) + ) @@ -317,15 +310,15 @@ Here is the call graph for this function:
    83
    84 std::cout << "Test 1.... ";
    85
    -
    86 double minima = get_minima(f1, 1, 5);
    +
    86 double minima = get_minima(f1, 1, 5);
    87
    88 std::cout << minima << "...";
    89
    -
    90 assert(std::abs(minima - 2) < EPSILON);
    +
    90 assert(std::abs(minima - 2) < EPSILON);
    91 std::cout << "passed\n";
    92}
    -
    get_minima
    double get_minima(const std::function< double(double)> &f, double lim_a, double lim_b)
    Get the minima of a function in the given interval. To get the maxima, simply negate the function....
    Definition golden_search_extrema.cpp:29
    +
    get_minima
    double get_minima(const std::function< double(double)> &f, double lim_a, double lim_b)
    Get the minima of a function in the given interval. To get the maxima, simply negate the function....
    Definition golden_search_extrema.cpp:29
    Here is the call graph for this function:
    @@ -343,7 +336,7 @@ Here is the call graph for this function:
    void test2 ( - ) + ) @@ -360,11 +353,11 @@ Here is the call graph for this function:
    106
    107 std::cout << "Test 2.... ";
    108
    -
    109 double minima = get_minima(func, -2, 10);
    +
    109 double minima = get_minima(func, -2, 10);
    110
    111 std::cout << minima << " (" << M_E << ")...";
    112
    -
    113 assert(std::abs(minima - M_E) < EPSILON);
    +
    113 assert(std::abs(minima - M_E) < EPSILON);
    114 std::cout << "passed\n";
    115}
    std::pow
    T pow(T... args)
    @@ -385,7 +378,7 @@ Here is the call graph for this function: void test3 ( - ) + ) @@ -400,11 +393,11 @@ Here is the call graph for this function:
    127
    128 std::cout << "Test 3.... ";
    129
    -
    130 double minima = get_minima(func, -4, 12);
    +
    130 double minima = get_minima(func, -4, 12);
    131
    132 std::cout << minima << " (" << M_PI << ")...";
    133
    -
    134 assert(std::abs(minima - M_PI) < EPSILON);
    +
    134 assert(std::abs(minima - M_PI) < EPSILON);
    135 std::cout << "passed\n";
    136}
    std::cos
    T cos(T... args)
    @@ -422,7 +415,7 @@ Here is the call graph for this function: diff --git a/d6/d80/double__hash__hash__table_8cpp.html b/d6/d80/double__hash__hash__table_8cpp.html index dacd8d7a9..9d3731186 100644 --- a/d6/d80/double__hash__hash__table_8cpp.html +++ b/d6/d80/double__hash__hash__table_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: hashing/double_hash_hash_table.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -131,9 +133,9 @@ Namespaces - - + +

    Typedefs

    -using double_hashing::Entry = Entry
     
    +using double_hashing::Entry = struct Entry
     
    @@ -162,7 +164,7 @@ Functions - +

    Functions

     
    void double_hashing::removalInfo (int key)
     
    int main ()
    int main ()
     
    - - +

    @@ -202,8 +204,7 @@ bool 

    		double_hashing::rehas
    int main (void )void )
    @@ -289,7 +290,7 @@ Here is the call graph for this function:
    diff --git a/d6/d80/dynamic__programming_2subset__sum_8cpp.html b/d6/d80/dynamic__programming_2subset__sum_8cpp.html index cbdfb3044..5f8536537 100644 --- a/d6/d80/dynamic__programming_2subset__sum_8cpp.html +++ b/d6/d80/dynamic__programming_2subset__sum_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/subset_sum.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,14 +129,14 @@ Namespaces - + - + - + - +

    Functions

    bool dynamic_programming::subset_sum::subset_sum_recursion (const std::vector< int > &arr, int targetSum, std::vector< std::unordered_map< int, bool > > *dp, int index=0)
    bool dynamic_programming::subset_sum::subset_sum_recursion (const std::vector< int > &arr, int targetSum, std::vector< std::unordered_map< int, bool > > *dp, int index=0)
     
    bool dynamic_programming::subset_sum::subset_sum_problem (const std::vector< int > &arr, const int targetSum)
    bool dynamic_programming::subset_sum::subset_sum_problem (const std::vector< int > &arr, const int targetSum)
     
    static void test ()
    static void test ()
     Test Function.
     
    int main ()
    int main ()
     Main function.
     
    @@ -151,8 +153,7 @@ Functions int main ( - void  - ) + void ) @@ -182,19 +183,12 @@ Here is the call graph for this function:
    bool dynamic_programming::subset_sum::subset_sum_problem ( - const std::vector< int > &  - arr, + const std::vector< int > & arr, - const int  - targetSum  - - - - ) - + const int targetSum )
    @@ -209,9 +203,9 @@ Here is the call graph for this function:
    70 {
    71 size_t n = arr.size();
    72 std::vector<std::unordered_map<int, bool>> dp(n);
    -
    73 return subset_sum_recursion(arr, targetSum, &dp);
    +
    73 return subset_sum_recursion(arr, targetSum, &dp);
    74}
    -
    dynamic_programming::subset_sum::subset_sum_recursion
    bool subset_sum_recursion(const std::vector< int > &arr, int targetSum, std::vector< std::unordered_map< int, bool > > *dp, int index=0)
    Definition subset_sum.cpp:43
    +
    dynamic_programming::subset_sum::subset_sum_recursion
    bool subset_sum_recursion(const std::vector< int > &arr, int targetSum, std::vector< std::unordered_map< int, bool > > *dp, int index=0)
    Definition subset_sum.cpp:43
    dp
    for std::vector
    Definition partition_problem.cpp:39
    std::vector::size
    T size(T... args)
    @@ -232,31 +226,22 @@ Here is the call graph for this function:
    bool dynamic_programming::subset_sum::subset_sum_recursion ( - const std::vector< int > &  - arr, + const std::vector< int > & arr, - int  - targetSum, + int targetSum, - std::vector< std::unordered_map< int, bool > > *  - dp, + std::vector< std::unordered_map< int, bool > > * dp, - int  - index = 0  - - - - ) - + int index = 0 )
    @@ -282,8 +267,8 @@ Here is the call graph for this function:
    55 }
    56
    57 bool ans =
    -
    58 subset_sum_recursion(arr, targetSum - arr[index], dp, index + 1) ||
    -
    59 subset_sum_recursion(arr, targetSum, dp, index + 1);
    +
    58 subset_sum_recursion(arr, targetSum - arr[index], dp, index + 1) ||
    +
    59 subset_sum_recursion(arr, targetSum, dp, index + 1);
    60 (*dp)[index][targetSum] = ans; // Save ans in dp map.
    61 return ans;
    62}
    @@ -307,7 +292,7 @@ Here is the call graph for this function: static void test ( - ) + ) @@ -337,7 +322,7 @@ Here is the call graph for this function:
    96
    97 for (int i = 0; i < 3; i++) {
    98 calculated_output[i] =
    -
    99 dynamic_programming::subset_sum::subset_sum_problem(
    +
    99 dynamic_programming::subset_sum::subset_sum_problem(
    100 custom_input_arr[i], custom_input_target_sum[i]);
    101 }
    102
    @@ -354,7 +339,7 @@ Here is the call graph for this function:
    113 std::cout << "All tests passed successfully!\n";
    114}
    -
    dynamic_programming::subset_sum::subset_sum_problem
    bool subset_sum_problem(const std::vector< int > &arr, const int targetSum)
    Definition subset_sum.cpp:70
    +
    dynamic_programming::subset_sum::subset_sum_problem
    bool subset_sum_problem(const std::vector< int > &arr, const int targetSum)
    Definition subset_sum.cpp:70
    @@ -364,7 +349,7 @@ Here is the call graph for this function: diff --git a/d6/d84/classhashing_1_1sha256_1_1_hash.html b/d6/d84/classhashing_1_1sha256_1_1_hash.html index deae57bb0..4d12c85c5 100644 --- a/d6/d84/classhashing_1_1sha256_1_1_hash.html +++ b/d6/d84/classhashing_1_1sha256_1_1_hash.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: hashing::sha256::Hash Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d6/d84/classhashing_1_1sha256_1_1_hash

    Contains hash array and functions to update it and convert it to a hexadecimal string. - More...

    + More...

    Collaboration diagram for hashing::sha256::Hash:
    @@ -115,16 +117,16 @@ Collaboration diagram for hashing::sha256::Hash:
    - + - +

    Public Member Functions

    void update (const std::array< uint32_t, 64 > &blocks)
    void update (const std::array< uint32_t, 64 > &blocks)
     Updates the hash array.
     
    std::string to_string () const
    std::string to_string () const
     Convert the hash to a hexadecimal string.
     
    - +

    Private Attributes

    std::array< uint32_t, 8 > hash
    std::array< uint32_t, 8 > hash
     

    Detailed Description

    @@ -139,7 +141,7 @@ Private Attributes std::string hashing::sha256::Hash::to_string ( - ) + ) const @@ -176,8 +178,7 @@ Here is the call graph for this function:
    void hashing::sha256::Hash::update ( - const std::array< uint32_t, 64 > &  - blocks) + const std::array< uint32_t, 64 > & blocks) @@ -300,7 +301,7 @@ Here is the call graph for this function:
    diff --git a/d6/d8d/namespacemorse.html b/d6/d8d/namespacemorse.html index 3f403d55d..381766efd 100644 --- a/d6/d8d/namespacemorse.html +++ b/d6/d8d/namespacemorse.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: morse Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d6/d8d/namespacemorse.html','../../');

    Functions for [Morse Code] (https://en.wikipedia.org/wiki/Morse_code). -More...

    +More...

    Detailed Description

    Functions for [Morse Code] (https://en.wikipedia.org/wiki/Morse_code).

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d6/d8d/namespacemorse.html','../../'); diff --git a/d6/d9d/large__factorial_8cpp.html b/d6/d9d/large__factorial_8cpp.html index c004e49f6..e27f4a622 100644 --- a/d6/d9d/large__factorial_8cpp.html +++ b/d6/d9d/large__factorial_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/large_factorial.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -117,11 +119,11 @@ Include dependency graph for large_factorial.cpp:
    - + - + - +

    Functions

    bool test1 ()
    bool test1 ()
     
    bool test2 ()
    bool test2 ()
     
    int main (int argc, char *argv[])
    int main (int argc, char *argv[])
     

    Detailed Description

    @@ -138,19 +140,12 @@ Functions int main ( - int  - argc, + int argc, - char *  - argv[]  - - - - ) - + char * argv[] )
    @@ -179,8 +174,8 @@ Functions
    110 << "Time taken: " << std::scientific << time_taken << " s"
    111 << std::endl;
    112
    -
    113 test1();
    -
    114 test2();
    +
    113 test1();
    +
    114 test2();
    115 result.test();
    116
    117 return 0;
    @@ -194,8 +189,8 @@ Functions
    std::endl
    T endl(T... args)
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition fibonacci_sum.cpp:76
    std::scientific
    T scientific(T... args)
    -
    test1
    bool test1()
    Definition large_factorial.cpp:17
    -
    test2
    bool test2()
    Definition large_factorial.cpp:54
    +
    test1
    bool test1()
    Definition large_factorial.cpp:17
    +
    test2
    bool test2()
    Definition large_factorial.cpp:54
    Here is the call graph for this function:
    @@ -213,7 +208,7 @@ Here is the call graph for this function:
    bool test1 ( - ) + ) @@ -266,7 +261,7 @@ Here is the call graph for this function: bool test2 ( - ) + ) @@ -320,7 +315,7 @@ Here is the call graph for this function: diff --git a/d6/da2/namespacevigenere.html b/d6/da2/namespacevigenere.html index a432153a9..090309de2 100644 --- a/d6/da2/namespacevigenere.html +++ b/d6/da2/namespacevigenere.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: vigenere Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d6/da2/namespacevigenere.html','../../

    Functions for vigenère cipher algorithm. -More...

    +More...

    Detailed Description

    Functions for vigenère cipher algorithm.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d6/da2/namespacevigenere.html','../../ diff --git a/d6/dab/namespacetree__234.html b/d6/dab/namespacetree__234.html index 8cb6e3465..dde2a1805 100644 --- a/d6/dab/namespacetree__234.html +++ b/d6/dab/namespacetree__234.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: tree_234 Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d6/dab/namespacetree__234.html','../..

    Functions for 2–3–4 tree -More...

    +More...

    Detailed Description

    Functions for 2–3–4 tree

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d6/dab/namespacetree__234.html','../.. diff --git a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html b/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html index 3d5d177c1..47a0fdf7c 100644 --- a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html +++ b/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others::lru_cache::LRUCache Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d6/dae/classothers_1_1lru__cache_1_1_l

    LRU cache class. - More...

    + More...

    Collaboration diagram for others::lru_cache::LRUCache:
    @@ -115,19 +117,19 @@ Collaboration diagram for others::lru_cache::LRUCache:
    - + - + - + - + - +

    Public Member Functions

     LRUCache (uint64_t pf)
     LRUCache (uint64_t pf)
     Constructor, Initialize thee LRU class with page frame.
     
    void refer (uint64_t page)
    void refer (uint64_t page)
     Refer to a page, or request a page from memory.
     
    void display ()
    void display ()
     A function to display the current cache.
     
    uint64_t getHits () const
    uint64_t getHits () const
     A function to get page hits.
     
    uint64_t getPageFault () const
    uint64_t getPageFault () const
     A function to get page fault.
     
    @@ -145,10 +147,10 @@ uint64_t std::unordered_map< uint64_t, std::list< uint64_t >::iterator >  - + - +
    pageFramepageMap
     Hash map containing pages and their addresses.
     
    uint64_t hits
    uint64_t hits
     was found in cache.
     
    uint64_t pageFault = 0
    uint64_t pageFault = 0
     

    Detailed Description

    @@ -166,8 +168,7 @@ uint64_t pageFrame others::lru_cache::LRUCache::LRUCache ( - uint64_t  - pf) + uint64_t pf) @@ -185,8 +186,8 @@ uint64_t pageFrame -
    84{ pageFrame = pf; }
    -
    others::lru_cache::LRUCache::pageFrame
    uint64_t pageFrame
    Page frame, or total size of the cache.
    Definition lru_cache.cpp:68
    +
    84{ pageFrame = pf; }
    +
    others::lru_cache::LRUCache::pageFrame
    uint64_t pageFrame
    Page frame, or total size of the cache.
    Definition lru_cache.cpp:68
    @@ -203,7 +204,7 @@ uint64_t pageFrame void others::lru_cache::LRUCache::display ( - ) + ) @@ -217,13 +218,13 @@ uint64_t pageFrameA function to display the current cache.

    Returns
    Void
    120 {
    -
    121 for (uint64_t &it : cache) {
    +
    121 for (uint64_t &it : cache) {
    122 std::cout << it << " ";
    123 }
    124 std::cout << std::endl;
    125 }
    -
    others::lru_cache::LRUCache::cache
    std::list< uint64_t > cache
    Cache linked list (using the STL)
    Definition lru_cache.cpp:69
    +
    others::lru_cache::LRUCache::cache
    std::list< uint64_t > cache
    Cache linked list (using the STL)
    Definition lru_cache.cpp:69
    std::endl
    T endl(T... args)
    Here is the call graph for this function:
    @@ -245,7 +246,7 @@ Here is the call graph for this function:
    uint64_t others::lru_cache::LRUCache::getHits ( - ) + ) const @@ -258,8 +259,8 @@ Here is the call graph for this function:

    A function to get page hits.

    Returns
    int
    -
    130{ return hits; }
    -
    others::lru_cache::LRUCache::hits
    uint64_t hits
    was found in cache.
    Definition lru_cache.cpp:73
    +
    130{ return hits; }
    +
    others::lru_cache::LRUCache::hits
    uint64_t hits
    was found in cache.
    Definition lru_cache.cpp:73
    @@ -275,7 +276,7 @@ Here is the call graph for this function: uint64_t others::lru_cache::LRUCache::getPageFault ( - ) + ) const @@ -288,8 +289,8 @@ Here is the call graph for this function:

    A function to get page fault.

    Returns
    int
    -
    135{ return pageFault; }
    -
    others::lru_cache::LRUCache::pageFault
    uint64_t pageFault
    Definition lru_cache.cpp:76
    +
    135{ return pageFault; }
    +
    others::lru_cache::LRUCache::pageFault
    uint64_t pageFault
    Definition lru_cache.cpp:76
    @@ -305,8 +306,7 @@ Here is the call graph for this function: void others::lru_cache::LRUCache::refer ( - uint64_t  - page) + uint64_t page) @@ -328,31 +328,31 @@ Here is the call graph for this function:

    < Increase the page fault by one.

    91 {
    92 // If the page requested not in cache.
    -
    93 if (pageMap.find(page) == pageMap.end()) {
    -
    94 pageFault++; ///< Increase the page fault by one.
    +
    93 if (pageMap.find(page) == pageMap.end()) {
    +
    94 pageFault++; ///< Increase the page fault by one.
    95
    96 // Check if the cache is full
    -
    97 if (cache.size() == pageFrame) {
    +
    97 if (cache.size() == pageFrame) {
    98 // delete the last page from cache
    -
    99 uint64_t lastPage = cache.back();
    -
    100 cache.pop_back();
    -
    101 pageMap.erase(lastPage);
    +
    99 uint64_t lastPage = cache.back();
    +
    100 cache.pop_back();
    +
    101 pageMap.erase(lastPage);
    102 }
    103 }
    104 // The requested page is in the cache
    105 else {
    -
    106 hits++;
    +
    106 hits++;
    107 // present in cache, erase from current position to bring in front
    -
    108 cache.erase(pageMap[page]);
    +
    108 cache.erase(pageMap[page]);
    109 }
    110 // Push it in the front of the cache and update the page reference in
    111 // page map.
    -
    112 cache.push_front(page);
    -
    113 pageMap[page] = cache.begin();
    +
    112 cache.push_front(page);
    +
    113 pageMap[page] = cache.begin();
    114 }
    std::list::back
    T back(T... args)
    std::list::begin
    T begin(T... args)
    -
    others::lru_cache::LRUCache::pageMap
    std::unordered_map< uint64_t, std::list< uint64_t >::iterator > pageMap
    Hash map containing pages and their addresses.
    Definition lru_cache.cpp:71
    +
    others::lru_cache::LRUCache::pageMap
    std::unordered_map< uint64_t, std::list< uint64_t >::iterator > pageMap
    Hash map containing pages and their addresses.
    Definition lru_cache.cpp:71
    std::unordered_map::end
    T end(T... args)
    std::unordered_map::erase
    T erase(T... args)
    std::unordered_map::find
    T find(T... args)
    @@ -427,7 +427,7 @@ Here is the call graph for this function:
    diff --git a/d6/db0/binomial__dist_8cpp.html b/d6/db0/binomial__dist_8cpp.html index 8f89da30a..eb406d9c4 100644 --- a/d6/db0/binomial__dist_8cpp.html +++ b/d6/db0/binomial__dist_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: probability/binomial_dist.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,19 +117,19 @@ Include dependency graph for binomial_dist.cpp:
    - + - + - + - + - + - + - +

    Functions

    double binomial_expected (double n, double p)
    double binomial_expected (double n, double p)
     
    double binomial_variance (double n, double p)
    double binomial_variance (double n, double p)
     
    double binomial_standard_deviation (double n, double p)
    double binomial_standard_deviation (double n, double p)
     
    double nCr (double n, double r)
    double nCr (double n, double r)
     
    double binomial_x_successes (double n, double p, double x)
    double binomial_x_successes (double n, double p, double x)
     
    double binomial_range_successes (double n, double p, double lower_bound, double upper_bound)
    double binomial_range_successes (double n, double p, double lower_bound, double upper_bound)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -148,19 +150,12 @@ Functions double binomial_expected ( - double  - n, + double n, - double  - p  - - - - ) - + double p )
    @@ -185,31 +180,22 @@ Functions double binomial_range_successes ( - double  - n, + double n, - double  - p, + double p, - double  - lower_bound, + double lower_bound, - double  - upper_bound  - - - - ) - + double upper_bound )
    @@ -219,11 +205,11 @@ Functions
    75 {
    76 double probability = 0;
    77 for (int i = lower_bound; i <= upper_bound; i++) {
    -
    78 probability += nCr(n, i) * std::pow(p, i) * std::pow(1 - p, n - i);
    +
    78 probability += nCr(n, i) * std::pow(p, i) * std::pow(1 - p, n - i);
    79 }
    80 return probability;
    81}
    -
    nCr
    double nCr(double n, double r)
    Definition binomial_dist.cpp:47
    +
    nCr
    double nCr(double n, double r)
    Definition binomial_dist.cpp:47
    probability
    Probability algorithms.
    std::pow
    T pow(T... args)
    std::upper_bound
    T upper_bound(T... args)
    @@ -244,19 +230,12 @@ Here is the call graph for this function:
    double binomial_standard_deviation ( - double  - n, + double n, - double  - p  - - - - ) - + double p )
    @@ -269,9 +248,9 @@ Here is the call graph for this function:
    Returns
    \(\sigma = \sqrt{\sigma^2} = \sqrt{n\cdot p\cdot (1-p)}\)
    36 {
    -
    37 return std::sqrt(binomial_variance(n, p));
    +
    37 return std::sqrt(binomial_variance(n, p));
    38}
    -
    binomial_variance
    double binomial_variance(double n, double p)
    Definition binomial_dist.cpp:29
    +
    binomial_variance
    double binomial_variance(double n, double p)
    Definition binomial_dist.cpp:29
    std::sqrt
    T sqrt(T... args)
    Here is the call graph for this function:
    @@ -290,19 +269,12 @@ Here is the call graph for this function: double binomial_variance ( - double  - n, + double n, - double  - p  - - - - ) - + double p )
    @@ -327,31 +299,23 @@ Here is the call graph for this function:
    double binomial_x_successes ( - double  - n, + double n, - double  - p, + double p, - double  - x  - - - - ) - + double x )

    calculates the probability of exactly x successes

    Returns
    \(\displaystyle P(n,p,x) = {n\choose x} p^x (1-p)^{n-x}\)
    65 {
    -
    66 return nCr(n, x) * std::pow(p, x) * std::pow(1 - p, n - x);
    +
    66 return nCr(n, x) * std::pow(p, x) * std::pow(1 - p, n - x);
    67}
    Here is the call graph for this function:
    @@ -370,35 +334,34 @@ Here is the call graph for this function:
    int main ( - void  - ) + void )

    main function

    84 {
    -
    85 std::cout << "expected value : " << binomial_expected(100, 0.5)
    +
    85 std::cout << "expected value : " << binomial_expected(100, 0.5)
    86 << std::endl;
    87
    -
    88 std::cout << "variance : " << binomial_variance(100, 0.5) << std::endl;
    +
    88 std::cout << "variance : " << binomial_variance(100, 0.5) << std::endl;
    89
    90 std::cout << "standard deviation : "
    -
    91 << binomial_standard_deviation(100, 0.5) << std::endl;
    +
    91 << binomial_standard_deviation(100, 0.5) << std::endl;
    92
    -
    93 std::cout << "exactly 30 successes : " << binomial_x_successes(100, 0.5, 30)
    +
    93 std::cout << "exactly 30 successes : " << binomial_x_successes(100, 0.5, 30)
    94 << std::endl;
    95
    96 std::cout << "45 or more successes : "
    -
    97 << binomial_range_successes(100, 0.5, 45, 100) << std::endl;
    +
    97 << binomial_range_successes(100, 0.5, 45, 100) << std::endl;
    98
    99 return 0;
    100}
    -
    binomial_x_successes
    double binomial_x_successes(double n, double p, double x)
    Definition binomial_dist.cpp:65
    -
    binomial_expected
    double binomial_expected(double n, double p)
    Definition binomial_dist.cpp:22
    -
    binomial_range_successes
    double binomial_range_successes(double n, double p, double lower_bound, double upper_bound)
    Definition binomial_dist.cpp:74
    -
    binomial_standard_deviation
    double binomial_standard_deviation(double n, double p)
    Definition binomial_dist.cpp:36
    +
    binomial_x_successes
    double binomial_x_successes(double n, double p, double x)
    Definition binomial_dist.cpp:65
    +
    binomial_expected
    double binomial_expected(double n, double p)
    Definition binomial_dist.cpp:22
    +
    binomial_range_successes
    double binomial_range_successes(double n, double p, double lower_bound, double upper_bound)
    Definition binomial_dist.cpp:74
    +
    binomial_standard_deviation
    double binomial_standard_deviation(double n, double p)
    Definition binomial_dist.cpp:36
    std::endl
    T endl(T... args)
    Here is the call graph for this function:
    @@ -417,19 +380,12 @@ Here is the call graph for this function:
    double nCr ( - double  - n, + double n, - double  - r  - - - - ) - + double r )
    @@ -466,7 +422,7 @@ Here is the call graph for this function:
    diff --git a/d6/db7/classdata__structures_1_1_skip_list-members.html b/d6/db7/classdata__structures_1_1_skip_list-members.html index 5c15310b3..5970d0cbe 100644 --- a/d6/db7/classdata__structures_1_1_skip_list-members.html +++ b/d6/db7/classdata__structures_1_1_skip_list-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,7 +118,7 @@ $(document).ready(function(){initNavTree('d4/d90/classdata__structures_1_1_skip_ diff --git a/d6/db8/inv__sqrt_8cpp.html b/d6/db8/inv__sqrt_8cpp.html index dec85a6e4..accdeb0a6 100644 --- a/d6/db8/inv__sqrt_8cpp.html +++ b/d6/db8/inv__sqrt_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/inv_sqrt.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -118,17 +120,17 @@ Include dependency graph for inv_sqrt.cpp:

    Functions

    template<typename T = double, char iterations = 2> -T Fast_InvSqrt (T x) +T Fast_InvSqrt (T x)  for numeric_limits
      template<typename T = double> -T Standard_InvSqrt (T number) +T Standard_InvSqrt (T number)  This is the function that calculates the fast inverse square root. The following code is the fast inverse square root with standard lib (cmath) More information can be found at LinkedIn
      -static void test () +static void test ()  Self-test implementations.
      -int main () +int main ()  Main function.
      @@ -150,8 +152,7 @@ template<typename T = double, char iterations = 2> T Fast_InvSqrt ( - T  - x) + T x) @@ -212,8 +213,7 @@ template<typename T = double, char iterations = 2> int main ( - void  - ) + void ) @@ -222,27 +222,27 @@ template<typename T = double, char iterations = 2>

    Main function.

    Returns
    0 on exit
    87 {
    -
    88 test(); // run self-test implementations
    +
    88 test(); // run self-test implementations
    89 std::cout << "The Fast inverse square root of 36 is: "
    90 << Fast_InvSqrt<float, 1>(36.0f) << std::endl;
    91 std::cout << "The Fast inverse square root of 36 is: "
    92 << Fast_InvSqrt<double, 2>(36.0f) << " (2 iterations)"
    93 << std::endl;
    94 std::cout << "The Fast inverse square root of 100 is: "
    -
    95 << Fast_InvSqrt(100.0f)
    +
    95 << Fast_InvSqrt(100.0f)
    96 << " (With default template type and iterations: double, 2)"
    97 << std::endl;
    98 std::cout << "The Standard inverse square root of 36 is: "
    99 << Standard_InvSqrt<float>(36.0f) << std::endl;
    100 std::cout << "The Standard inverse square root of 100 is: "
    -
    101 << Standard_InvSqrt(100.0f)
    +
    101 << Standard_InvSqrt(100.0f)
    102 << " (With default template type: double)" << std::endl;
    103}
    std::endl
    T endl(T... args)
    -
    Standard_InvSqrt
    T Standard_InvSqrt(T number)
    This is the function that calculates the fast inverse square root. The following code is the fast inv...
    Definition inv_sqrt.cpp:59
    -
    test
    static void test()
    Self-test implementations.
    Definition inv_sqrt.cpp:68
    -
    Fast_InvSqrt
    T Fast_InvSqrt(T x)
    for numeric_limits
    Definition inv_sqrt.cpp:28
    +
    Standard_InvSqrt
    T Standard_InvSqrt(T number)
    This is the function that calculates the fast inverse square root. The following code is the fast inv...
    Definition inv_sqrt.cpp:59
    +
    test
    static void test()
    Self-test implementations.
    Definition inv_sqrt.cpp:68
    +
    Fast_InvSqrt
    T Fast_InvSqrt(T x)
    for numeric_limits
    Definition inv_sqrt.cpp:28
    Here is the call graph for this function:
    @@ -262,8 +262,7 @@ template<typename T = double>
    T Standard_InvSqrt ( - T  - number) + T number) @@ -303,7 +302,7 @@ template<typename T = double> static void test ( - ) + ) @@ -322,12 +321,12 @@ template<typename T = double>
    71 /* Tests with multiple values */
    72 assert(std::fabs(Standard_InvSqrt<float>(100.0f) - 0.0998449f) < epsilon);
    73 assert(std::fabs(Standard_InvSqrt<double>(36.0f) - 0.166667f) < epsilon);
    -
    74 assert(std::fabs(Standard_InvSqrt(12.0f) - 0.288423f) < epsilon);
    +
    74 assert(std::fabs(Standard_InvSqrt(12.0f) - 0.288423f) < epsilon);
    75 assert(std::fabs(Standard_InvSqrt<double>(5.0f) - 0.447141f) < epsilon);
    76
    77 assert(std::fabs(Fast_InvSqrt<float, 1>(100.0f) - 0.0998449f) < epsilon);
    78 assert(std::fabs(Fast_InvSqrt<double, 1>(36.0f) - 0.166667f) < epsilon);
    -
    79 assert(std::fabs(Fast_InvSqrt(12.0f) - 0.288423) < epsilon);
    +
    79 assert(std::fabs(Fast_InvSqrt(12.0f) - 0.288423) < epsilon);
    80 assert(std::fabs(Fast_InvSqrt<double>(5.0f) - 0.447141) < epsilon);
    81}
    std::fabs
    T fabs(T... args)
    @@ -345,7 +344,7 @@ Here is the call graph for this function: diff --git a/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html b/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html index eab449280..f0d6621f4 100644 --- a/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html +++ b/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math::ncr_modulo_p::NCRModuloP Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d6/dc1/classmath_1_1ncr__modulo__p_1_1

    Class which contains all methods required for calculating nCr mod p. - More...

    + More...

    Collaboration diagram for math::ncr_modulo_p::NCRModuloP:
    @@ -115,19 +117,19 @@ Collaboration diagram for math::ncr_modulo_p::NCRModuloP:
    - + - + - + - +

    Public Member Functions

     NCRModuloP (const uint64_t &size, const uint64_t &mod)
     NCRModuloP (const uint64_t &size, const uint64_t &mod)
     the p from (nCr % p)
     
    uint64_t gcdExtended (const uint64_t &a, const uint64_t &b, int64_t *x, int64_t *y)
    uint64_t gcdExtended (const uint64_t &a, const uint64_t &b, int64_t *x, int64_t *y)
     
    int64_t modInverse (const uint64_t &a, const uint64_t &m)
    int64_t modInverse (const uint64_t &a, const uint64_t &m)
     
    int64_t ncr (const uint64_t &n, const uint64_t &r, const uint64_t &p)
    int64_t ncr (const uint64_t &n, const uint64_t &r, const uint64_t &p)
     
    - + @@ -149,19 +151,12 @@ uint64_t  - - + - - - - - - - +

    Private Attributes

    std::vector< uint64_t > fac {}
    std::vector< uint64_t > fac {}
     
    uint64_t p = 0
    p = 0 math::ncr_modulo_p::NCRModuloP::NCRModuloP (const uint64_t & size, const uint64_t & size,
    const uint64_t & mod 
    )const uint64_t & mod )
    @@ -174,14 +169,14 @@ uint64_t p = 0the p from (nCr % p)

    Constructor which precomputes the values of n! % mod from n=0 to size and stores them in vector 'fac' @params[in] the numbers 'size', 'mod'

    41 {
    -
    42 p = mod;
    +
    42 p = mod;
    43 fac = std::vector<uint64_t>(size);
    44 fac[0] = 1;
    45 for (int i = 1; i <= size; i++) {
    -
    46 fac[i] = (fac[i - 1] * i) % p;
    +
    46 fac[i] = (fac[i - 1] * i) % p;
    47 }
    48 }
    -
    math::ncr_modulo_p::NCRModuloP::p
    uint64_t p
    stores precomputed factorial(i) % p value
    Definition ncr_modulo_p.cpp:34
    +
    math::ncr_modulo_p::NCRModuloP::p
    uint64_t p
    stores precomputed factorial(i) % p value
    Definition ncr_modulo_p.cpp:34
    @@ -199,31 +194,22 @@ uint64_t p = 0 uint64_t math::ncr_modulo_p::NCRModuloP::gcdExtended ( - const uint64_t &  - a, + const uint64_t & a, - const uint64_t &  - b, + const uint64_t & b, - int64_t *  - x, + int64_t * x, - int64_t *  - y  - - - - ) - + int64_t * y ) @@ -241,13 +227,13 @@ uint64_t p = 0 61 }
    62
    63 int64_t x1 = 0, y1 = 0;
    -
    64 uint64_t gcd = gcdExtended(b % a, a, &x1, &y1);
    +
    64 uint64_t gcd = gcdExtended(b % a, a, &x1, &y1);
    65
    66 *x = y1 - (b / a) * x1;
    67 *y = x1;
    68 return gcd;
    69 }
    -
    math::ncr_modulo_p::NCRModuloP::gcdExtended
    uint64_t gcdExtended(const uint64_t &a, const uint64_t &b, int64_t *x, int64_t *y)
    Definition ncr_modulo_p.cpp:56
    +
    math::ncr_modulo_p::NCRModuloP::gcdExtended
    uint64_t gcdExtended(const uint64_t &a, const uint64_t &b, int64_t *x, int64_t *y)
    Definition ncr_modulo_p.cpp:56
    gcd
    int gcd(int num1, int num2)
    Definition gcd_iterative_euclidean.cpp:15
    Here is the call graph for this function:
    @@ -269,19 +255,12 @@ Here is the call graph for this function: int64_t math::ncr_modulo_p::NCRModuloP::modInverse ( - const uint64_t &  - a, + const uint64_t & a, - const uint64_t &  - m  - - - - ) - + const uint64_t & m ) @@ -294,7 +273,7 @@ Here is the call graph for this function:

    @params[in] the numbers 'a' and 'm' from above equation

    Returns
    the modular inverse of a
    76 {
    77 int64_t x = 0, y = 0;
    -
    78 uint64_t g = gcdExtended(a, m, &x, &y);
    +
    78 uint64_t g = gcdExtended(a, m, &x, &y);
    79 if (g != 1) { // modular inverse doesn't exist
    80 return -1;
    81 } else {
    @@ -323,25 +302,17 @@ Here is the call graph for this function:
    int64_t math::ncr_modulo_p::NCRModuloP::ncr ( - const uint64_t &  - n, + const uint64_t & n, - const uint64_t &  - r, + const uint64_t & r, - const uint64_t &  - p  - - - - ) - + const uint64_t & p ) @@ -358,23 +329,23 @@ Here is the call graph for this function:
    95 return 0;
    96 }
    97 if (r == 1) {
    -
    98 return n % p;
    +
    98 return n % p;
    99 }
    100 if (r == 0 || r == n) {
    101 return 1;
    102 }
    103 // fac is a global array with fac[r] = (r! % p)
    -
    104 int64_t denominator = modInverse(fac[r], p);
    +
    104 int64_t denominator = modInverse(fac[r], p);
    105 if (denominator < 0) { // modular inverse doesn't exist
    106 return -1;
    107 }
    -
    108 denominator = (denominator * modInverse(fac[n - r], p)) % p;
    +
    108 denominator = (denominator * modInverse(fac[n - r], p)) % p;
    109 if (denominator < 0) { // modular inverse doesn't exist
    110 return -1;
    111 }
    -
    112 return (fac[n] * denominator) % p;
    +
    112 return (fac[n] * denominator) % p;
    113 }
    -
    math::ncr_modulo_p::NCRModuloP::modInverse
    int64_t modInverse(const uint64_t &a, const uint64_t &m)
    Definition ncr_modulo_p.cpp:76
    +
    math::ncr_modulo_p::NCRModuloP::modInverse
    int64_t modInverse(const uint64_t &a, const uint64_t &m)
    Definition ncr_modulo_p.cpp:76
    Here is the call graph for this function:
    @@ -416,7 +387,7 @@ Here is the call graph for this function:
    diff --git a/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html b/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html index d3f2efb18..29aab586a 100644 --- a/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html +++ b/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: CONTRIBUTION GUIDELINES + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -459,7 +461,7 @@ After enabling, it will execute <tt>clang-tidy</tt> and <tt>cl diff --git a/d6/dce/rabin__karp_8cpp.html b/d6/dce/rabin__karp_8cpp.html index 37e3b33af..3e4867e63 100644 --- a/d6/dce/rabin__karp_8cpp.html +++ b/d6/dce/rabin__karp_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: strings/rabin_karp.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -140,7 +142,7 @@ Functions   int string_search::rabin_karp (const std::string &str, const std::string &pat)   -int main (void) +int main (void)  

    Detailed Description

    @@ -155,21 +157,19 @@ Functions int main ( - void  - ) + void )

    Main function

    105 {
    -
    106 assert(rabin_karp("helloWorld", "world") == -1);
    -
    107 assert(rabin_karp("helloWorld", "World") == 5);
    -
    108 assert(rabin_karp("this_is_c++", "c++") == 8);
    -
    109 assert(rabin_karp("happy_coding", "happy") == 0);
    +
    106 assert(rabin_karp("helloWorld", "world") == -1);
    +
    107 assert(rabin_karp("helloWorld", "World") == 5);
    +
    108 assert(rabin_karp("this_is_c++", "c++") == 8);
    +
    109 assert(rabin_karp("happy_coding", "happy") == 0);
    110 return 0;
    111}
    -
    string_search::rabin_karp
    int rabin_karp(const std::string &str, const std::string &pat)
    Definition rabin_karp.cpp:83
    @@ -179,7 +179,7 @@ Functions diff --git a/d6/dd3/ode__midpoint__euler_8cpp.html b/d6/dd3/ode__midpoint__euler_8cpp.html index f5be2fe12..18b3d6958 100644 --- a/d6/dd3/ode__midpoint__euler_8cpp.html +++ b/d6/dd3/ode__midpoint__euler_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/ode_midpoint_euler.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -118,10 +120,10 @@ Include dependency graph for ode_midpoint_euler.cpp:
    - + - + @@ -130,9 +132,9 @@ Functions - + - +

    Functions

    void problem (const double &x, std::valarray< double > *y, std::valarray< double > *dy)
    void problem (const double &x, std::valarray< double > *y, std::valarray< double > *dy)
     Problem statement for a system with first-order differential equations. Updates the system differential variables.
     
    void exact_solution (const double &x, std::valarray< double > *y)
    void exact_solution (const double &x, std::valarray< double > *y)
     Exact solution of the problem. Used for solution comparison.
     
    void midpoint_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
    double midpoint_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
     Compute approximation using the midpoint-Euler method in the given limits.
     
    void save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
    void save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
     
    int main (int argc, char *argv[])
    int main (int argc, char *argv[])
     

    Detailed Description

    @@ -153,7 +155,7 @@ v(x) &=& -\sin(x)\\ \end{eqnarray*}

    The computation results are stored to a text file midpoint_euler.csv and the exact soltuion results in exact.csv for comparison. Implementation solution

    -

    To implement Van der Pol oscillator, change the problem function to:

    const double mu = 2.0;
    +

    To implement Van der Pol oscillator, change the problem function to:

    const double mu = 2.0;
    dy[0] = y[1];
    dy[1] = mu * (1.f - y[0] * y[0]) * y[1] - y[0];
    See also
    ode_forward_euler.cpp, ode_semi_implicit_euler.cpp
    @@ -167,19 +169,12 @@ v(x) &=& -\sin(x)\\ void exact_solution ( - const double &  - x, + const double & x, - std::valarray< double > *  - y  - - - - ) - + std::valarray< double > * y )
    @@ -215,19 +210,12 @@ Here is the call graph for this function:
    int main ( - int  - argc, + int argc, - char *  - argv[]  - - - - ) - + char * argv[] )
    @@ -251,7 +239,7 @@ Here is the call graph for this function:
    208 std::cout << "\tTime = " << total_time << " ms\n";
    209
    210 /* compute exact solution for comparion */
    -
    211 save_exact_solution(X0, X_MAX, step_size, Y0);
    +
    211 save_exact_solution(X0, X_MAX, step_size, Y0);
    212
    213 return 0;
    214}
    @@ -259,7 +247,7 @@ Here is the call graph for this function:
    midpoint_euler
    double midpoint_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
    Compute approximation using the midpoint-Euler method in the given limits.
    Definition ode_midpoint_euler.cpp:107
    -
    save_exact_solution
    void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
    Definition ode_midpoint_euler.cpp:156
    +
    save_exact_solution
    void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
    Definition ode_midpoint_euler.cpp:156
    Here is the call graph for this function:
    @@ -278,25 +266,17 @@ Here is the call graph for this function: void problem ( - const double &  - x, + const double & x, - std::valarray< double > *  - y, + std::valarray< double > * y, - std::valarray< double > *  - dy  - - - - ) - + std::valarray< double > * dy )
    @@ -328,31 +308,22 @@ Here is the call graph for this function:
    void save_exact_solution ( - const double &  - X0, + const double & X0, - const double &  - X_MAX, + const double & X_MAX, - const double &  - step_size, + const double & step_size, - const std::valarray< double > &  - Y0  - - - - ) - + const std::valarray< double > & Y0 )
    @@ -385,7 +356,7 @@ Here is the call graph for this function:
    174 }
    175 fp << y[y.size() - 1] << "\n";
    176
    -
    177 exact_solution(x, &y);
    +
    177 exact_solution(x, &y);
    178
    179 x += step_size;
    180 } while (x <= X_MAX);
    @@ -399,7 +370,7 @@ Here is the call graph for this function:
    std::clock
    T clock(T... args)
    -
    exact_solution
    void exact_solution(const double &x, std::valarray< double > *y)
    Exact solution of the problem. Used for solution comparison.
    Definition ode_midpoint_euler.cpp:66
    +
    exact_solution
    void exact_solution(const double &x, std::valarray< double > *y)
    Exact solution of the problem. Used for solution comparison.
    Definition ode_midpoint_euler.cpp:66
    std::perror
    T perror(T... args)
    Here is the call graph for this function:
    @@ -415,7 +386,7 @@ Here is the call graph for this function: diff --git a/d6/dd8/is__graph__bipartite_8cpp.html b/d6/dd8/is__graph__bipartite_8cpp.html index 8c1c8307a..91c2884bd 100644 --- a/d6/dd8/is__graph__bipartite_8cpp.html +++ b/d6/dd8/is__graph__bipartite_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph/is_graph_bipartite.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -133,9 +135,9 @@ Namespaces - + - +

    Functions

    static void test ()
    static void test ()
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -166,8 +168,7 @@ Example - Here is a graph G2 with 3 vertices and is not bipartite int main ( - void  - ) + void ) @@ -175,10 +176,10 @@ Example - Here is a graph G2 with 3 vertices and is not bipartite

    Main function

    Testing

    168 {
    -
    169 test(); /// Testing
    +
    169 test(); /// Testing
    170 return 0;
    171}
    -
    test
    static void test()
    Definition is_graph_bipartite.cpp:136
    +
    test
    static void test()
    Definition is_graph_bipartite.cpp:136
    Here is the call graph for this function:
    @@ -199,7 +200,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -259,7 +260,7 @@ Here is the call graph for this function:
    diff --git a/d6/df8/classdata__structures_1_1_bitset-members.html b/d6/df8/classdata__structures_1_1_bitset-members.html index b9ba8dc48..cf8e6184f 100644 --- a/d6/df8/classdata__structures_1_1_bitset-members.html +++ b/d6/df8/classdata__structures_1_1_bitset-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,7 +116,7 @@ $(document).ready(function(){initNavTree('d9/dae/classdata__structures_1_1_bitse diff --git a/d7/d00/list__array_8cpp.html b/d7/d00/list__array_8cpp.html index 73bfa6215..33435c3e5 100644 --- a/d7/d00/list__array_8cpp.html +++ b/d7/d00/list__array_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/list_array.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -133,10 +135,10 @@ Namespaces - + - +

    Functions

    static void test ()
    static void test ()
     Test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -156,8 +158,7 @@ Algorithm int main ( - void  - ) + void ) @@ -166,10 +167,10 @@ Algorithm

    Main function.

    Returns
    0 on exit
    248 {
    -
    249 test(); // Execute the tests
    +
    249 test(); // Execute the tests
    250 return 0;
    251}
    -
    test
    static void test()
    Test implementations.
    Definition list_array.cpp:206
    +
    test
    static void test()
    Test implementations.
    Definition list_array.cpp:206
    Here is the call graph for this function:
    @@ -190,7 +191,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -259,7 +260,7 @@ Here is the call graph for this function:
    diff --git a/d7/d07/bidirectional__dijkstra_8cpp.html b/d7/d07/bidirectional__dijkstra_8cpp.html index a7690616d..a210647c6 100644 --- a/d7/d07/bidirectional__dijkstra_8cpp.html +++ b/d7/d07/bidirectional__dijkstra_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph/bidirectional_dijkstra.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -130,25 +132,25 @@ Namespaces - + - + - + - + - +

    Functions

    void graph::bidirectional_dijkstra::addEdge (std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj2, uint64_t u, uint64_t v, uint64_t w)
    void graph::bidirectional_dijkstra::addEdge (std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj2, uint64_t u, uint64_t v, uint64_t w)
     Function that add edge between two nodes or vertices of graph.
     
    uint64_t graph::bidirectional_dijkstra::Shortest_Path_Distance (const std::vector< uint64_t > &workset_, const std::vector< std::vector< uint64_t > > &distance_)
    uint64_t graph::bidirectional_dijkstra::Shortest_Path_Distance (const std::vector< uint64_t > &workset_, const std::vector< std::vector< uint64_t > > &distance_)
     This function returns the shortest distance from the source to the target if there is path between vertices 's' and 't'.
     
    int graph::bidirectional_dijkstra::Bidijkstra (std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj2, uint64_t s, uint64_t t)
    int graph::bidirectional_dijkstra::Bidijkstra (std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj2, uint64_t s, uint64_t t)
     Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and returns the shortest distance of target from the source.
     
    static void tests ()
    static void tests ()
     Function to test the provided algorithm above.
     
    int main ()
    int main ()
     Main function.
     
    - +

    Variables

    constexpr int64_t INF = std::numeric_limits<int64_t>::max()
    constexpr int64_t INF = std::numeric_limits<int64_t>::max()
     for store the graph, the distances, and the path
     
    @@ -166,37 +168,27 @@ Variables void graph::bidirectional_dijkstra::addEdge ( - std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *  - adj1, + std::vector< std::vector< std::pair< uint64_t, uint64_t > > > * adj1, - std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *  - adj2, + std::vector< std::vector< std::pair< uint64_t, uint64_t > > > * adj2, - uint64_t  - u, + uint64_t u, - uint64_t  - v, + uint64_t v, - uint64_t  - w  - - - - ) - + uint64_t w )
    @@ -234,31 +226,22 @@ Here is the call graph for this function:
    int graph::bidirectional_dijkstra::Bidijkstra ( - std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *  - adj1, + std::vector< std::vector< std::pair< uint64_t, uint64_t > > > * adj1, - std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *  - adj2, + std::vector< std::vector< std::pair< uint64_t, uint64_t > > > * adj2, - uint64_t  - s, + uint64_t s, - uint64_t  - t  - - - - ) - + uint64_t t )
    @@ -301,7 +284,7 @@ Here is the call graph for this function:
    90 uint64_t n = adj1->size();
    91
    92 /// setting all the distances initially to INF
    -
    93 std::vector<std::vector<uint64_t>> dist(2, std::vector<uint64_t>(n, INF));
    +
    93 std::vector<std::vector<uint64_t>> dist(2, std::vector<uint64_t>(n, INF));
    94
    95 /// creating a a vector of min heap using priority queue
    96 /// pq[0] contains the min heap for the direct search
    @@ -361,7 +344,7 @@ Here is the call graph for this function:
    150
    151 /// check if currentNode has already been visited
    152 if (visited[currentNode] == 1) {
    -
    153 return Shortest_Path_Distance(workset, dist);
    +
    153 return Shortest_Path_Distance(workset, dist);
    154 }
    155 visited[currentNode] = true;
    156 /// reversed search
    @@ -393,14 +376,14 @@ Here is the call graph for this function:
    182
    183 /// check if currentNode has already been visited
    184 if (visited[currentNode] == 1) {
    -
    185 return Shortest_Path_Distance(workset, dist);
    +
    185 return Shortest_Path_Distance(workset, dist);
    186 }
    187 visited[currentNode] = true;
    188 }
    189 return -1;
    190}
    -
    graph::bidirectional_dijkstra::Shortest_Path_Distance
    uint64_t Shortest_Path_Distance(const std::vector< uint64_t > &workset_, const std::vector< std::vector< uint64_t > > &distance_)
    This function returns the shortest distance from the source to the target if there is path between ve...
    Definition bidirectional_dijkstra.cpp:61
    -
    INF
    constexpr int64_t INF
    for store the graph, the distances, and the path
    Definition bidirectional_dijkstra.cpp:23
    +
    graph::bidirectional_dijkstra::Shortest_Path_Distance
    uint64_t Shortest_Path_Distance(const std::vector< uint64_t > &workset_, const std::vector< std::vector< uint64_t > > &distance_)
    This function returns the shortest distance from the source to the target if there is path between ve...
    Definition bidirectional_dijkstra.cpp:61
    +
    INF
    constexpr int64_t INF
    for store the graph, the distances, and the path
    Definition bidirectional_dijkstra.cpp:23
    @@ -423,8 +406,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -433,7 +415,7 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    248 {
    -
    249 tests(); // running predefined tests
    +
    249 tests(); // running predefined tests
    250 uint64_t vertices = uint64_t();
    251 uint64_t edges = uint64_t();
    252 std::cout << "Enter the number of vertices : ";
    @@ -454,7 +436,7 @@ Here is the call graph for this function:
    267 << std::endl;
    268 while (edges--) {
    269 std::cin >> u >> v >> w;
    -
    270 graph::bidirectional_dijkstra::addEdge(&adj1, &adj2, u, v, w);
    +
    270 graph::bidirectional_dijkstra::addEdge(&adj1, &adj2, u, v, w);
    271 if (edges != 0) {
    272 std::cout << "Enter the next edge" << std::endl;
    273 }
    @@ -469,7 +451,7 @@ Here is the call graph for this function:
    282 << std::endl;
    283 std::cin >> s >> t;
    284 int dist =
    -
    285 graph::bidirectional_dijkstra::Bidijkstra(&adj1, &adj2, s - 1, t - 1);
    +
    285 graph::bidirectional_dijkstra::Bidijkstra(&adj1, &adj2, s - 1, t - 1);
    286 if (dist == -1) {
    287 std::cout << "Target not reachable from source" << std::endl;
    288 } else {
    @@ -480,9 +462,9 @@ Here is the call graph for this function:
    293}
    -
    graph::bidirectional_dijkstra::Bidijkstra
    int Bidijkstra(std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj2, uint64_t s, uint64_t t)
    Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...
    Definition bidirectional_dijkstra.cpp:86
    -
    tests
    static void tests()
    Function to test the provided algorithm above.
    Definition bidirectional_dijkstra.cpp:199
    -
    graph::bidirectional_dijkstra::addEdge
    void addEdge(std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj2, uint64_t u, uint64_t v, uint64_t w)
    Function that add edge between two nodes or vertices of graph.
    Definition bidirectional_dijkstra.cpp:45
    +
    graph::bidirectional_dijkstra::Bidijkstra
    int Bidijkstra(std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj2, uint64_t s, uint64_t t)
    Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...
    Definition bidirectional_dijkstra.cpp:86
    +
    tests
    static void tests()
    Function to test the provided algorithm above.
    Definition bidirectional_dijkstra.cpp:199
    +
    graph::bidirectional_dijkstra::addEdge
    void addEdge(std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj2, uint64_t u, uint64_t v, uint64_t w)
    Function that add edge between two nodes or vertices of graph.
    Definition bidirectional_dijkstra.cpp:45
    std::endl
    T endl(T... args)
    Here is the call graph for this function:
    @@ -501,19 +483,12 @@ Here is the call graph for this function: uint64_t graph::bidirectional_dijkstra::Shortest_Path_Distance ( - const std::vector< uint64_t > &  - workset_, + const std::vector< uint64_t > & workset_, - const std::vector< std::vector< uint64_t > > &  - distance_  - - - - ) - + const std::vector< std::vector< uint64_t > > & distance_ )
    @@ -527,7 +502,7 @@ Here is the call graph for this function:
    63 {
    -
    64 int64_t distance = INF;
    +
    64 int64_t distance = INF;
    65 for (uint64_t i : workset_) {
    66 if (distance_[0][i] + distance_[1][i] < distance) {
    67 distance = distance_[0][i] + distance_[1][i];
    @@ -556,7 +531,7 @@ Here is the call graph for this function:
    static void tests ( - ) + ) @@ -576,10 +551,10 @@ Here is the call graph for this function:
    203 4, std::vector<std::pair<uint64_t, uint64_t>>());
    204 std::vector<std::vector<std::pair<uint64_t, uint64_t>>> adj1_2(
    205 4, std::vector<std::pair<uint64_t, uint64_t>>());
    -
    206 graph::bidirectional_dijkstra::addEdge(&adj1_1, &adj1_2, 1, 2, 1);
    -
    207 graph::bidirectional_dijkstra::addEdge(&adj1_1, &adj1_2, 4, 1, 2);
    -
    208 graph::bidirectional_dijkstra::addEdge(&adj1_1, &adj1_2, 2, 3, 2);
    -
    209 graph::bidirectional_dijkstra::addEdge(&adj1_1, &adj1_2, 1, 3, 5);
    +
    206 graph::bidirectional_dijkstra::addEdge(&adj1_1, &adj1_2, 1, 2, 1);
    +
    207 graph::bidirectional_dijkstra::addEdge(&adj1_1, &adj1_2, 4, 1, 2);
    +
    208 graph::bidirectional_dijkstra::addEdge(&adj1_1, &adj1_2, 2, 3, 2);
    +
    209 graph::bidirectional_dijkstra::addEdge(&adj1_1, &adj1_2, 1, 3, 5);
    210
    211 uint64_t s = 1, t = 3;
    212 assert(graph::bidirectional_dijkstra::Bidijkstra(&adj1_1, &adj1_2, s - 1,
    @@ -596,15 +571,15 @@ Here is the call graph for this function:
    223 5, std::vector<std::pair<uint64_t, uint64_t>>());
    224 std::vector<std::vector<std::pair<uint64_t, uint64_t>>> adj2_2(
    225 5, std::vector<std::pair<uint64_t, uint64_t>>());
    -
    226 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 1, 2, 4);
    -
    227 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 1, 3, 2);
    -
    228 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 2, 3, 2);
    -
    229 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 3, 2, 1);
    -
    230 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 2, 4, 2);
    -
    231 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 3, 5, 4);
    -
    232 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 5, 4, 1);
    -
    233 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 2, 5, 3);
    -
    234 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 3, 4, 4);
    +
    226 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 1, 2, 4);
    +
    227 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 1, 3, 2);
    +
    228 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 2, 3, 2);
    +
    229 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 3, 2, 1);
    +
    230 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 2, 4, 2);
    +
    231 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 3, 5, 4);
    +
    232 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 5, 4, 1);
    +
    233 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 2, 5, 3);
    +
    234 graph::bidirectional_dijkstra::addEdge(&adj2_1, &adj2_2, 3, 4, 4);
    235
    236 s = 1, t = 5;
    237 std::cout << "Initiating Test 3..." << std::endl;
    @@ -653,7 +628,7 @@ Here is the call graph for this function: diff --git a/d7/d08/namespacegraph__coloring.html b/d7/d08/namespacegraph__coloring.html index 130e14e3e..f6519c5a6 100644 --- a/d7/d08/namespacegraph__coloring.html +++ b/d7/d08/namespacegraph__coloring.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph_coloring Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d7/d08/namespacegraph__coloring.html',

    Functions for the Graph Coloring algorithm,. -More...

    +More...

    Detailed Description

    Functions for the Graph Coloring algorithm,.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d7/d08/namespacegraph__coloring.html', diff --git a/d7/d0a/namespacetrie__using__hashmap.html b/d7/d0a/namespacetrie__using__hashmap.html index b20beb1e1..cfe2c4eef 100644 --- a/d7/d0a/namespacetrie__using__hashmap.html +++ b/d7/d0a/namespacetrie__using__hashmap.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: trie_using_hashmap Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d7/d0a/namespacetrie__using__hashmap.h

    Functions for Trie data structure using hashmap implementation. -More...

    +More...

    Detailed Description

    Functions for Trie data structure using hashmap implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d7/d0a/namespacetrie__using__hashmap.h diff --git a/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html b/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html index 3558ec651..99e9c999d 100644 --- a/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html +++ b/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Guidelines for reviewers and maintainers + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -118,7 +120,7 @@ $(document).ready(function(){initNavTree('d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.h diff --git a/d7/d1e/graph_2dijkstra_8cpp.html b/d7/d1e/graph_2dijkstra_8cpp.html index debface94..29d11840b 100644 --- a/d7/d1e/graph_2dijkstra_8cpp.html +++ b/d7/d1e/graph_2dijkstra_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph/dijkstra.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -134,9 +136,9 @@ Functions int graph::dijkstra (std::vector< std::vector< std::pair< int, int > > > *adj, int s, int t)  Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and returns the shortest distance of target from the source.
      -void tests () +void tests ()   -int main () +int main ()   - - +

    @@ -161,8 +163,7 @@ constexpr int64_t 

    		INF
    int main (void )void )
    @@ -170,7 +171,7 @@ constexpr int64_t INF

    Main function

    152 {
    153 // running predefined tests
    -
    154 tests();
    +
    154 tests();
    155
    156 int vertices = int(), edges = int();
    157 std::cout << "Enter the number of vertices : ";
    @@ -200,7 +201,7 @@ constexpr int64_t INF
    std::endl
    T endl(T... args)
    -
    tests
    void tests()
    Definition dijkstra.cpp:113
    +
    tests
    void tests()
    Definition dijkstra.cpp:113
    graph::addEdge
    void addEdge(std::vector< std::vector< int > > *adj, int u, int v)
    Function that add edge between two nodes or vertices of graph.
    Definition connected_components.cpp:46
    graph::dijkstra
    int dijkstra(std::vector< std::vector< std::pair< int, int > > > *adj, int s, int t)
    Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...
    Definition dijkstra.cpp:66
    @@ -222,7 +223,7 @@ Here is the call graph for this function:
    void tests ( - ) + ) @@ -279,7 +280,7 @@ Here is the call graph for this function:
    diff --git a/d7/d21/classstack__linked_list-members.html b/d7/d21/classstack__linked_list-members.html index b6b5b45f1..0bc6e0d2f 100644 --- a/d7/d21/classstack__linked_list-members.html +++ b/d7/d21/classstack__linked_list-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,7 +116,7 @@ $(document).ready(function(){initNavTree('d2/dc4/classstack__linked_list.html',' diff --git a/d7/d24/nqueen__print__all__solutions_8cpp.html b/d7/d24/nqueen__print__all__solutions_8cpp.html index 6d7c80ca8..4e15fa339 100644 --- a/d7/d24/nqueen__print__all__solutions_8cpp.html +++ b/d7/d24/nqueen__print__all__solutions_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: backtracking/nqueen_print_all_solutions.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,18 +128,18 @@ Namespaces

    Functions

    template<size_t n> -void backtracking::n_queens_all_solutions::PrintSol (const std::array< std::array< int, n >, n > &board) +void backtracking::n_queens_all_solutions::PrintSol (const std::array< std::array< int, n >, n > &board)  Utility function to print matrix.
      template<size_t n> -bool backtracking::n_queens_all_solutions::CanIMove (const std::array< std::array< int, n >, n > &board, int row, int col) +bool backtracking::n_queens_all_solutions::CanIMove (const std::array< std::array< int, n >, n > &board, int row, int col)  Check if a queen can be placed on the matrix.
      template<size_t n> -void backtracking::n_queens_all_solutions::NQueenSol (std::array< std::array< int, n >, n > board, int col) +void backtracking::n_queens_all_solutions::NQueenSol (std::array< std::array< int, n >, n > board, int col)  Main function to solve the N Queens problem.
      -int main () +int main ()  Main function.
      @@ -158,25 +160,17 @@ template<size_t n>
    bool backtracking::n_queens_all_solutions::CanIMove ( - const std::array< std::array< int, n >, n > &  - board, + const std::array< std::array< int, n >, n > & board, - int  - row, + int row, - int  - col  - - - - ) - + int col )
    @@ -235,8 +229,7 @@ template<size_t n>
    int main ( - void  - ) + void ) @@ -248,10 +241,10 @@ template<size_t n>
    102 const int n = 4;
    103 std::array<std::array<int, n>, n> board{0};
    104
    -
    105 backtracking::n_queens_all_solutions::NQueenSol(board, 0);
    +
    105 backtracking::n_queens_all_solutions::NQueenSol(board, 0);
    106}
    -
    backtracking::n_queens_all_solutions::NQueenSol
    void NQueenSol(std::array< std::array< int, n >, n > board, int col)
    Main function to solve the N Queens problem.
    Definition nqueen_print_all_solutions.cpp:81
    +
    backtracking::n_queens_all_solutions::NQueenSol
    void NQueenSol(std::array< std::array< int, n >, n > board, int col)
    Main function to solve the N Queens problem.
    Definition nqueen_print_all_solutions.cpp:81
    @@ -266,19 +259,12 @@ template<size_t n> void backtracking::n_queens_all_solutions::NQueenSol ( - std::array< std::array< int, n >, n >  - board, + std::array< std::array< int, n >, n > board, - int  - col  - - - - ) - + int col )
    @@ -327,8 +313,7 @@ template<size_t n>
    void backtracking::n_queens_all_solutions::PrintSol ( - const std::array< std::array< int, n >, n > &  - board) + const std::array< std::array< int, n >, n > & board) @@ -372,7 +357,7 @@ Here is the call graph for this function: diff --git a/d7/d35/matrix__exponentiation_8cpp.html b/d7/d35/matrix__exponentiation_8cpp.html index f56b694a8..775c77983 100644 --- a/d7/d35/matrix__exponentiation_8cpp.html +++ b/d7/d35/matrix__exponentiation_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/matrix_exponentiation.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -117,11 +119,11 @@ Include dependency graph for matrix_exponentiation.cpp:
    - + - + - + @@ -129,23 +131,23 @@ Macros

    Macros

    #define ll   int64_t
    #define ll   int64_t
     
    #define endl   std::endl
    #define endl   std::endl
     
    #define pb   push_back
    #define pb   push_back
     
    #define MOD   1000000007
    - + - + - + - +

    Functions

    vector< vector< ll > > multiply (const vector< vector< ll > > &A, const vector< vector< ll > > &B)
    vector< vector< ll > > multiply (const vector< vector< ll > > &A, const vector< vector< ll > > &B)
     
    vector< vector< ll > > power (const vector< vector< ll > > &A, ll p)
    vector< vector< ll > > power (const vector< vector< ll > > &A, ll p)
     
    ll ans (ll n)
    ll ans (ll n)
     
    int main ()
    int main ()
     
    - + - + +vector< ll > 

    Variables

    ll mat_size
    ll mat_size
     
    vector< ll > fib_b
    vector< ll > fib_b
     
    -vector< ll > fib_c
    fib_c
     

    Detailed Description

    @@ -219,10 +221,9 @@ This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a genera
    - + - - +
    ll ans ll ans (ll n)ll n)
    @@ -237,39 +238,39 @@ This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a genera
    91 {
    92 if (n == 0)
    93 return 0;
    -
    94 if (n <= mat_size)
    -
    95 return fib_b[n - 1];
    +
    94 if (n <= mat_size)
    +
    95 return fib_b[n - 1];
    96 // F1
    -
    97 vector<ll> F1(mat_size + 1);
    -
    98 for (ll i = 1; i <= mat_size; i++) F1[i] = fib_b[i - 1];
    +
    97 vector<ll> F1(mat_size + 1);
    +
    98 for (ll i = 1; i <= mat_size; i++) F1[i] = fib_b[i - 1];
    99
    100 // Transpose matrix
    -
    101 vector<vector<ll>> T(mat_size + 1, vector<ll>(mat_size + 1));
    -
    102 for (ll i = 1; i <= mat_size; i++) {
    -
    103 for (ll j = 1; j <= mat_size; j++) {
    -
    104 if (i < mat_size) {
    +
    101 vector<vector<ll>> T(mat_size + 1, vector<ll>(mat_size + 1));
    +
    102 for (ll i = 1; i <= mat_size; i++) {
    +
    103 for (ll j = 1; j <= mat_size; j++) {
    +
    104 if (i < mat_size) {
    105 if (j == i + 1)
    106 T[i][j] = 1;
    107 else
    108 T[i][j] = 0;
    109 continue;
    110 }
    -
    111 T[i][j] = fib_c[mat_size - j];
    +
    111 T[i][j] = fib_c[mat_size - j];
    112 }
    113 }
    114 // T^n-1
    -
    115 T = power(T, n - 1);
    +
    115 T = power(T, n - 1);
    116
    117 // T*F1
    118 ll res = 0;
    -
    119 for (ll i = 1; i <= mat_size; i++) {
    +
    119 for (ll i = 1; i <= mat_size; i++) {
    120 res = (res + (T[1][i] * F1[i]) % MOD) % MOD;
    121 }
    122 return res;
    123}
    -
    fib_b
    vector< ll > fib_b
    Definition matrix_exponentiation.cpp:50
    -
    power
    vector< vector< ll > > power(const vector< vector< ll > > &A, ll p)
    Definition matrix_exponentiation.cpp:76
    -
    mat_size
    ll mat_size
    Definition matrix_exponentiation.cpp:45
    +
    fib_b
    vector< ll > fib_b
    Definition matrix_exponentiation.cpp:50
    +
    power
    vector< vector< ll > > power(const vector< vector< ll > > &A, ll p)
    Definition matrix_exponentiation.cpp:76
    +
    mat_size
    ll mat_size
    Definition matrix_exponentiation.cpp:45
    Here is the call graph for this function:
    @@ -288,8 +289,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -302,25 +302,25 @@ Here is the call graph for this function:
    130 cin >> t;
    131 ll i, j, x;
    132 while (t--) {
    -
    133 cin >> mat_size;
    -
    134 for (i = 0; i < mat_size; i++) {
    +
    133 cin >> mat_size;
    +
    134 for (i = 0; i < mat_size; i++) {
    135 cin >> x;
    -
    136 fib_b.pb(x);
    +
    136 fib_b.pb(x);
    137 }
    -
    138 for (i = 0; i < mat_size; i++) {
    +
    138 for (i = 0; i < mat_size; i++) {
    139 cin >> x;
    140 fib_c.pb(x);
    141 }
    142 cin >> x;
    -
    143 cout << ans(x) << endl;
    -
    144 fib_b.clear();
    +
    143 cout << ans(x) << endl;
    +
    144 fib_b.clear();
    145 fib_c.clear();
    146 }
    147 return 0;
    148}
    -
    endl
    #define endl
    Definition matrix_exponentiation.cpp:36
    +
    endl
    #define endl
    Definition matrix_exponentiation.cpp:36
    @@ -331,21 +331,14 @@ Here is the call graph for this function:
    - + - - + - - - - - - - +
    vector< vector< ll > > multiply vector< vector< ll > > multiply (const vector< vector< ll > > & A, const vector< vector< ll > > & A,
    const vector< vector< ll > > & B 
    )const vector< vector< ll > > & B )
    @@ -360,10 +353,10 @@ Here is the call graph for this function:
    Note
    \(p=n\)
    Returns
    matrix of dimension (m \(\times\)q)
    58 {
    -
    59 vector<vector<ll>> C(mat_size + 1, vector<ll>(mat_size + 1));
    -
    60 for (ll i = 1; i <= mat_size; i++) {
    -
    61 for (ll j = 1; j <= mat_size; j++) {
    -
    62 for (ll z = 1; z <= mat_size; z++) {
    +
    59 vector<vector<ll>> C(mat_size + 1, vector<ll>(mat_size + 1));
    +
    60 for (ll i = 1; i <= mat_size; i++) {
    +
    61 for (ll j = 1; j <= mat_size; j++) {
    +
    62 for (ll z = 1; z <= mat_size; z++) {
    63 C[i][j] = (C[i][j] + (A[i][z] * B[z][j]) % MOD) % MOD;
    64 }
    65 }
    @@ -380,21 +373,14 @@ Here is the call graph for this function:
    - + - - + - - - - - - - +
    vector< vector< ll > > power vector< vector< ll > > power (const vector< vector< ll > > & A, const vector< vector< ll > > & A,
    ll p 
    )ll p )
    @@ -411,13 +397,13 @@ Here is the call graph for this function:
    77 if (p == 1)
    78 return A;
    79 if (p % 2 == 1) {
    -
    80 return multiply(A, power(A, p - 1));
    +
    80 return multiply(A, power(A, p - 1));
    81 } else {
    -
    82 vector<vector<ll>> X = power(A, p / 2);
    -
    83 return multiply(X, X);
    +
    82 vector<vector<ll>> X = power(A, p / 2);
    +
    83 return multiply(X, X);
    84 }
    85}
    -
    multiply
    vector< vector< ll > > multiply(const vector< vector< ll > > &A, const vector< vector< ll > > &B)
    Definition matrix_exponentiation.cpp:57
    +
    multiply
    vector< vector< ll > > multiply(const vector< vector< ll > > &A, const vector< vector< ll > > &B)
    Definition matrix_exponentiation.cpp:57
    Here is the call graph for this function:
    @@ -434,11 +420,11 @@ Here is the call graph for this function:
    - +
    vector<ll> fib_bvector<ll> fib_b
    -

    global vector variables used in the ans function.

    Todo:
    @stepfencurryxiao add documetnation
    +

    global vector variables used in the ans function.

    Todo
    @stepfencurryxiao add documetnation
    @@ -449,11 +435,11 @@ Here is the call graph for this function:
    - +
    ll mat_sizell mat_size
    -

    global variable mat_size

    Todo:
    @stepfencurryxiao add documetnation
    +

    global variable mat_size

    Todo
    @stepfencurryxiao add documetnation
    @@ -463,7 +449,7 @@ Here is the call graph for this function: diff --git a/d7/d3f/namespacetravelling_salesman__bitmanipulation.html b/d7/d3f/namespacetravelling_salesman__bitmanipulation.html index ad5a7f0df..f0486a952 100644 --- a/d7/d3f/namespacetravelling_salesman__bitmanipulation.html +++ b/d7/d3f/namespacetravelling_salesman__bitmanipulation.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: travellingSalesman_bitmanipulation Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d7/d3f/namespacetravelling_salesman__b

    Functions for the Travelling Salesman Bitmask implementation. -More...

    +More...

    Detailed Description

    Functions for the Travelling Salesman Bitmask implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d7/d3f/namespacetravelling_salesman__b diff --git a/d7/d47/namespace_x_o_r.html b/d7/d47/namespace_x_o_r.html index debaa03e5..5fa57be21 100644 --- a/d7/d47/namespace_x_o_r.html +++ b/d7/d47/namespace_x_o_r.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: XOR Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d7/d47/namespace_x_o_r.html','../../')

    Functions for XOR cipher algorithm. -More...

    +More...

    Detailed Description

    Functions for XOR cipher algorithm.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d7/d47/namespace_x_o_r.html','../../') diff --git a/d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html b/d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html index d4173acea..ee7814e49 100644 --- a/d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html +++ b/d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: std::is_integral< uint256_t > Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -119,7 +121,7 @@ Collaboration diagram for std::is_integral< uint256_t >:
    diff --git a/d7/d48/structgeometry_1_1grahamscan_1_1_point.html b/d7/d48/structgeometry_1_1grahamscan_1_1_point.html index 892dc730f..7efad0c7b 100644 --- a/d7/d48/structgeometry_1_1grahamscan_1_1_point.html +++ b/d7/d48/structgeometry_1_1grahamscan_1_1_point.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: geometry::grahamscan::Point Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -122,7 +124,7 @@ int y diff --git a/d7/d4c/namespacek__nearest__neighbors.html b/d7/d4c/namespacek__nearest__neighbors.html index 009f1ba48..5f9ff12ea 100644 --- a/d7/d4c/namespacek__nearest__neighbors.html +++ b/d7/d4c/namespacek__nearest__neighbors.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: k_nearest_neighbors Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d7/d4c/namespacek__nearest__neighbors.

    Functions for the [K-Nearest Neighbors algorithm] (https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm) implementation. -More...

    +More...

    Detailed Description

    Functions for the [K-Nearest Neighbors algorithm] (https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm) implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d7/d4c/namespacek__nearest__neighbors. diff --git a/d7/d56/count__bits__flip_8cpp.html b/d7/d56/count__bits__flip_8cpp.html index e678aea9b..3d46f7309 100644 --- a/d7/d56/count__bits__flip_8cpp.html +++ b/d7/d56/count__bits__flip_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: bit_manipulation/count_bits_flip.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -125,13 +127,13 @@ Namespaces - + - + - +

    Functions

    std::uint64_t bit_manipulation::count_bits_flip::countBitsFlip (std::int64_t A, std::int64_t B)
    std::uint64_t bit_manipulation::count_bits_flip::countBitsFlip (std::int64_t A, std::int64_t B)
     The main function implements count of bits flip required.
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -151,19 +153,12 @@ Functions std::uint64_t bit_manipulation::count_bits_flip::countBitsFlip ( - std::int64_t  - A, + std::int64_t A, - std::int64_t  - B  - - - - ) - + std::int64_t B )
    @@ -207,8 +202,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -217,10 +211,10 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    85 {
    -
    86 test(); // run self-test implementations
    +
    86 test(); // run self-test implementations
    87 return 0;
    88}
    -
    test
    static void test()
    Self-test implementations.
    Definition count_bits_flip.cpp:64
    +
    test
    static void test()
    Self-test implementations.
    Definition count_bits_flip.cpp:64
    Here is the call graph for this function:
    @@ -241,7 +235,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -287,7 +281,7 @@ Here is the call graph for this function: diff --git a/d7/d57/longest__increasing__subsequence_8cpp.html b/d7/d57/longest__increasing__subsequence_8cpp.html index bc7a639cb..49935ac8f 100644 --- a/d7/d57/longest__increasing__subsequence_8cpp.html +++ b/d7/d57/longest__increasing__subsequence_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/longest_increasing_subsequence.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,10 +129,10 @@ Functions uint64_t dynamic_programming::LIS (const std::vector< uint64_t > &a, const uint32_t &n)  Calculate the longest increasing subsequence for the specified numbers.
      -static void test () +static void test ()  Self-test implementations.
      -int main (int argc, char const *argv[]) +int main (int argc, char const *argv[])  Main function.
      @@ -150,19 +152,12 @@ Functions int main ( - int  - argc, + int argc, - char const *  - argv[]  - - - - ) - + char const * argv[] )
    @@ -191,14 +186,14 @@ Functions
    92
    93 std::cout << "\nThe result is: " << dynamic_programming::LIS(a, n)
    94 << std::endl;
    -
    95 test(); // run self-test implementations
    +
    95 test(); // run self-test implementations
    96
    97 return 0;
    98}
    std::endl
    T endl(T... args)
    -
    test
    static void test()
    Self-test implementations.
    Definition longest_increasing_subsequence.cpp:63
    +
    test
    static void test()
    Self-test implementations.
    Definition longest_increasing_subsequence.cpp:63
    dynamic_programming::LIS
    uint64_t LIS(const std::vector< uint64_t > &a, const uint32_t &n)
    Calculate the longest increasing subsequence for the specified numbers.
    Definition longest_increasing_subsequence.cpp:39
    @@ -221,7 +216,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -260,7 +255,7 @@ Here is the call graph for this function: diff --git a/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html index 048c986da..be63d2916 100644 --- a/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html +++ b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -110,7 +112,7 @@ $(document).ready(function(){initNavTree('d4/d0e/classdata__structures_1_1linked diff --git a/d7/d61/classdata__structures_1_1tree__234_1_1_node-members.html b/d7/d61/classdata__structures_1_1tree__234_1_1_node-members.html index 27667a315..934ef767e 100644 --- a/d7/d61/classdata__structures_1_1tree__234_1_1_node-members.html +++ b/d7/d61/classdata__structures_1_1tree__234_1_1_node-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -135,7 +137,7 @@ $(document).ready(function(){initNavTree('dd/d40/classdata__structures_1_1tree__ diff --git a/d7/d65/shortest__common__supersequence_8cpp.html b/d7/d65/shortest__common__supersequence_8cpp.html index 371fe732d..5211a310c 100644 --- a/d7/d65/shortest__common__supersequence_8cpp.html +++ b/d7/d65/shortest__common__supersequence_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/shortest_common_supersequence.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,11 +130,11 @@ Namespaces - + - + - +

    Functions

    std::string dynamic_programming::shortest_common_supersequence::scs (const std::string &str1, const std::string &str2)
    std::string dynamic_programming::shortest_common_supersequence::scs (const std::string &str1, const std::string &str2)
     
    static void test ()
    static void test ()
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -152,8 +154,7 @@ related int main ( - void  - ) + void ) @@ -161,7 +162,7 @@ related
    164 {
    165 // test for implementation
    -
    166 test();
    +
    166 test();
    167
    168 // user input
    169 std::string s1, s2;
    @@ -171,15 +172,15 @@ related 173 std::string ans;
    174
    175 // user output
    -
    176 ans = dynamic_programming::shortest_common_supersequence::scs(s1, s2);
    +
    176 ans = dynamic_programming::shortest_common_supersequence::scs(s1, s2);
    177 std::cout << ans;
    178 return 0;
    179}
    -
    test
    static void test()
    Definition shortest_common_supersequence.cpp:124
    -
    dynamic_programming::shortest_common_supersequence::scs
    std::string scs(const std::string &str1, const std::string &str2)
    Definition shortest_common_supersequence.cpp:42
    +
    test
    static void test()
    Definition shortest_common_supersequence.cpp:124
    +
    dynamic_programming::shortest_common_supersequence::scs
    std::string scs(const std::string &str1, const std::string &str2)
    Definition shortest_common_supersequence.cpp:42
    Here is the call graph for this function:
    @@ -197,19 +198,12 @@ Here is the call graph for this function:
    std::string dynamic_programming::shortest_common_supersequence::scs ( - const std::string &  - str1, + const std::string & str1, - const std::string &  - str2  - - - - ) - + const std::string & str2 )
    @@ -323,7 +317,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -348,7 +342,7 @@ Here is the call graph for this function:
    135 int i=0;
    136 for(auto & scsString : scsStrings) {
    137
    -
    138 calculatedOutput[i] = dynamic_programming::shortest_common_supersequence::scs(
    +
    138 calculatedOutput[i] = dynamic_programming::shortest_common_supersequence::scs(
    139 scsString[0], scsString[1]
    140 );
    141 i++;
    @@ -381,7 +375,7 @@ Here is the call graph for this function: diff --git a/d7/d6a/bisection__method_8cpp.html b/d7/d6a/bisection__method_8cpp.html index 2c288eb90..cbc3975ed 100644 --- a/d7/d6a/bisection__method_8cpp.html +++ b/d7/d6a/bisection__method_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/bisection_method.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -117,8 +119,7 @@ Include dependency graph for bisection_method.cpp:
    - + @@ -127,12 +128,12 @@ Macros

    Macros

    -#define EPSILON    1e-6
    #define EPSILON    1e-6
     
    #define MAX_ITERATIONS   50000
    - + - + - +

    Functions

    static double eq (double i)
    static double eq (double i)
     
    template<typename T >
    int sgn (T val)
    int sgn (T val)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -144,7 +145,24 @@ x_{i+1} = \frac{a_i+b_i}{2}

    For the next iteration, the interval is selected as: \([a,x]\) if \(x>0\) or \([x,b]\) if \(x<0\). The Process is continued till a close enough approximation is achieved.

    See also
    newton_raphson_method.cpp, false_position.cpp, secant_method.cpp
    -

    Function Documentation

    +

    Macro Definition Documentation

    + +

    ◆ EPSILON

    + +
    +
    + + + + +
    #define EPSILON    1e-6
    +
    +
    20#define EPSILON \
    +
    21 1e-6 // std::numeric_limits<double>::epsilon() ///< system accuracy limit
    +
    +
    +
    +

    Function Documentation

    ◆ eq()

    @@ -157,8 +175,7 @@ x_{i+1} = \frac{a_i+b_i}{2} static double eq ( - double  - i) + double i) @@ -190,8 +207,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -202,10 +218,10 @@ Here is the call graph for this function:
    39 int i;
    40
    41 // loop to find initial intervals a, b
    -
    42 for (int i = 0; i < MAX_ITERATIONS; i++) {
    -
    43 z = eq(a);
    -
    44 x = eq(b);
    -
    45 if (sgn(z) == sgn(x)) { // same signs, increase interval
    +
    42 for (int i = 0; i < MAX_ITERATIONS; i++) {
    +
    43 z = eq(a);
    +
    44 x = eq(b);
    +
    45 if (sgn(z) == sgn(x)) { // same signs, increase interval
    46 b++;
    47 a--;
    48 } else { // if opposite signs, we got our interval
    @@ -217,9 +233,9 @@ Here is the call graph for this function:
    54 std::cout << "\nSecond initial: " << b;
    55
    56 // start iterations
    -
    57 for (i = 0; i < MAX_ITERATIONS; i++) {
    +
    57 for (i = 0; i < MAX_ITERATIONS; i++) {
    58 x = (a + b) / 2;
    -
    59 z = eq(x);
    +
    59 z = eq(x);
    60 std::cout << "\n\nz: " << z << "\t[" << a << " , " << b
    61 << " | Bisect: " << x << "]";
    62
    @@ -237,9 +253,9 @@ Here is the call graph for this function:
    74 return 0;
    75}
    -
    MAX_ITERATIONS
    #define MAX_ITERATIONS
    Maximum number of iterations to check.
    Definition bisection_method.cpp:22
    -
    sgn
    int sgn(T val)
    Definition bisection_method.cpp:32
    -
    eq
    static double eq(double i)
    Definition bisection_method.cpp:26
    +
    MAX_ITERATIONS
    #define MAX_ITERATIONS
    Maximum number of iterations to check.
    Definition bisection_method.cpp:22
    +
    sgn
    int sgn(T val)
    Definition bisection_method.cpp:32
    +
    eq
    static double eq(double i)
    Definition bisection_method.cpp:26
    std::endl
    T endl(T... args)
    Here is the call graph for this function:
    @@ -260,8 +276,7 @@ template<typename T > int sgn ( - T  - val) + T val) @@ -279,7 +294,7 @@ template<typename T > diff --git a/d7/d73/abbreviation_8cpp.html b/d7/d73/abbreviation_8cpp.html index b269077eb..816daffac 100644 --- a/d7/d73/abbreviation_8cpp.html +++ b/d7/d73/abbreviation_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/abbreviation.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,16 +129,16 @@ Namespaces - + - + - + - +

    Functions

    bool dynamic_programming::abbreviation::abbreviation_recursion (std::vector< std::vector< bool > > *memo, std::vector< std::vector< bool > > *visited, const std::string &str, const std::string &result, uint32_t str_idx=0, uint32_t result_idx=0)
    bool dynamic_programming::abbreviation::abbreviation_recursion (std::vector< std::vector< bool > > *memo, std::vector< std::vector< bool > > *visited, const std::string &str, const std::string &result, uint32_t str_idx=0, uint32_t result_idx=0)
     Recursive Dynamic Programming function.
     
    bool dynamic_programming::abbreviation::abbreviation (const std::string &str, const std::string &result)
    bool dynamic_programming::abbreviation::abbreviation (const std::string &str, const std::string &result)
     Iterative Dynamic Programming function.
     
    static void test ()
    static void test ()
     Self test-implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -164,19 +166,12 @@ Algorithm bool dynamic_programming::abbreviation::abbreviation ( - const std::string &  - str, + const std::string & str, - const std::string &  - result  - - - - ) - + const std::string & result )
    @@ -239,43 +234,32 @@ Here is the call graph for this function:
    bool dynamic_programming::abbreviation::abbreviation_recursion ( - std::vector< std::vector< bool > > *  - memo, + std::vector< std::vector< bool > > * memo, - std::vector< std::vector< bool > > *  - visited, + std::vector< std::vector< bool > > * visited, - const std::string &  - str, + const std::string & str, - const std::string &  - result, + const std::string & result, - uint32_t  - str_idx = 0, + uint32_t str_idx = 0, - uint32_t  - result_idx = 0  - - - - ) - + uint32_t result_idx = 0 )
    @@ -319,12 +303,12 @@ Here is the call graph for this function:
    78 * j)`
    79 */
    80 if (str[str_idx] == result[result_idx]) {
    -
    81 ans = abbreviation_recursion(memo, visited, str, result,
    +
    81 ans = abbreviation_recursion(memo, visited, str, result,
    82 str_idx + 1, result_idx + 1);
    83 } else if (str[str_idx] - 32 == result[result_idx]) {
    -
    84 ans = abbreviation_recursion(memo, visited, str, result,
    +
    84 ans = abbreviation_recursion(memo, visited, str, result,
    85 str_idx + 1, result_idx + 1) ||
    -
    86 abbreviation_recursion(memo, visited, str, result,
    +
    86 abbreviation_recursion(memo, visited, str, result,
    87 str_idx + 1, result_idx);
    88 } else {
    89 // if `str[i]` is uppercase, then cannot be converted, return
    @@ -334,7 +318,7 @@ Here is the call graph for this function:
    93 if (str[str_idx] >= 'A' && str[str_idx] <= 'Z') {
    94 ans = false;
    95 } else {
    -
    96 ans = abbreviation_recursion(memo, visited, str, result,
    +
    96 ans = abbreviation_recursion(memo, visited, str, result,
    97 str_idx + 1, result_idx);
    98 }
    99 }
    @@ -343,7 +327,7 @@ Here is the call graph for this function:
    102 (*visited)[str_idx][result_idx] = true;
    103 return (*memo)[str_idx][result_idx];
    104}
    -
    dynamic_programming::abbreviation::abbreviation_recursion
    bool abbreviation_recursion(std::vector< std::vector< bool > > *memo, std::vector< std::vector< bool > > *visited, const std::string &str, const std::string &result, uint32_t str_idx=0, uint32_t result_idx=0)
    Recursive Dynamic Programming function.
    Definition abbreviation.cpp:58
    +
    dynamic_programming::abbreviation::abbreviation_recursion
    bool abbreviation_recursion(std::vector< std::vector< bool > > *memo, std::vector< std::vector< bool > > *visited, const std::string &str, const std::string &result, uint32_t str_idx=0, uint32_t result_idx=0)
    Recursive Dynamic Programming function.
    Definition abbreviation.cpp:58
    std::vector::at
    T at(T... args)
    Here is the call graph for this function:
    @@ -362,8 +346,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -372,10 +355,10 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    191 {
    -
    192 test(); // run self-test implementations
    +
    192 test(); // run self-test implementations
    193 return 0;
    194}
    -
    test
    static void test()
    Self test-implementations.
    Definition abbreviation.cpp:152
    +
    test
    static void test()
    Self test-implementations.
    Definition abbreviation.cpp:152
    Here is the call graph for this function:
    @@ -396,7 +379,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -458,7 +441,7 @@ Here is the call graph for this function: diff --git a/d7/d75/postfix__evaluation_8cpp.html b/d7/d75/postfix__evaluation_8cpp.html index c49ea0a27..b171d6ab5 100644 --- a/d7/d75/postfix__evaluation_8cpp.html +++ b/d7/d75/postfix__evaluation_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/postfix_evaluation.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -135,29 +137,29 @@ Namespaces - + - + - + - + - + - + - + - +

    Functions

    void others::postfix_expression::push (float operand, Stack *stack)
    void others::postfix_expression::push (float operand, Stack *stack)
     Pushing operand, also called the number in the array to the stack.
     
    float others::postfix_expression::pop (Stack *stack)
    float others::postfix_expression::pop (Stack *stack)
     Popping operand, also called the number from the stack.
     
    bool others::postfix_expression::is_number (const std::string &s)
    bool others::postfix_expression::is_number (const std::string &s)
     Checks if scanned string is a number.
     
    void others::postfix_expression::evaluate (float a, float b, const std::string &operation, Stack *stack)
    void others::postfix_expression::evaluate (float a, float b, const std::string &operation, Stack *stack)
     Evaluate answer using given last two operands from and operation.
     
    template<std::size_t N>
    float others::postfix_expression::postfix_evaluation (std::array< std::string, N > input)
    float others::postfix_expression::postfix_evaluation (std::array< std::string, N > input)
     Postfix Evaluation algorithm to compute the value from given input array.
     
    static void test_function_1 ()
    static void test_function_1 ()
     Test function 1 with input array {'2', '3', '1', '*', '+', '9', '-'}.
     
    static void test_function_2 ()
    static void test_function_2 ()
     Test function 2 with input array {'1', '2', '+', '2', '/', '5', '*', '7', '+'}.
     
    int main ()
    int main ()
     Main function.
     
    @@ -175,31 +177,22 @@ Functions void others::postfix_expression::evaluate ( - float  - a, + float a, - float  - b, + float b, - const std::string &  - operation, + const std::string & operation, - Stack *  - stack  - - - - ) - + Stack * stack )
    @@ -221,22 +214,22 @@ Functions
    80 switch (*op) {
    81 case '+':
    82 c = a + b; // Addition of numbers
    -
    83 others::postfix_expression::push(c, stack);
    +
    83 others::postfix_expression::push(c, stack);
    84 break;
    85
    86 case '-':
    87 c = a - b; // Subtraction of numbers
    -
    88 others::postfix_expression::push(c, stack);
    +
    88 others::postfix_expression::push(c, stack);
    89 break;
    90
    91 case '*':
    92 c = a * b; // Multiplication of numbers
    -
    93 others::postfix_expression::push(c, stack);
    +
    93 others::postfix_expression::push(c, stack);
    94 break;
    95
    96 case '/':
    97 c = a / b; // Division of numbers
    -
    98 others::postfix_expression::push(c, stack);
    +
    98 others::postfix_expression::push(c, stack);
    99 break;
    100
    101 default:
    @@ -247,7 +240,7 @@ Functions
    std::string::c_str
    T c_str(T... args)
    stack
    for std::invalid_argument
    Definition stack.hpp:19
    -
    others::postfix_expression::push
    void push(float operand, Stack *stack)
    Pushing operand, also called the number in the array to the stack.
    Definition postfix_evaluation.cpp:44
    +
    others::postfix_expression::push
    void push(float operand, Stack *stack)
    Pushing operand, also called the number in the array to the stack.
    Definition postfix_evaluation.cpp:44
    Here is the call graph for this function:
    @@ -265,8 +258,7 @@ Here is the call graph for this function:
    bool others::postfix_expression::is_number ( - const std::string &  - s) + const std::string & s) @@ -304,8 +296,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -314,15 +305,15 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    171 {
    -
    172 test_function_1();
    -
    173 test_function_2();
    +
    172 test_function_1();
    +
    173 test_function_2();
    174
    175 std::cout << "\nTest implementations passed!\n";
    176
    177 return 0;
    178}
    -
    test_function_2
    static void test_function_2()
    Test function 2 with input array {'1', '2', '+', '2', '/', '5', '*', '7', '+'}.
    Definition postfix_evaluation.cpp:159
    -
    test_function_1
    static void test_function_1()
    Test function 1 with input array {'2', '3', '1', '*', '+', '9', '-'}.
    Definition postfix_evaluation.cpp:146
    +
    test_function_2
    static void test_function_2()
    Test function 2 with input array {'1', '2', '+', '2', '/', '5', '*', '7', '+'}.
    Definition postfix_evaluation.cpp:159
    +
    test_function_1
    static void test_function_1()
    Test function 1 with input array {'2', '3', '1', '*', '+', '9', '-'}.
    Definition postfix_evaluation.cpp:146
    Here is the call graph for this function:
    @@ -340,8 +331,7 @@ Here is the call graph for this function:
    float others::postfix_expression::pop ( - Stack *  - stack) + Stack * stack) @@ -375,8 +365,7 @@ template<float others::postfix_expression::postfix_evaluation ( - std::array< std::string, N >  - input) + std::array< std::string, N > input) @@ -409,7 +398,7 @@ template< 125 float op2 = pop(&stack);
    126 float op1 = pop(&stack);
    127
    -
    128 evaluate(op1, op2, scan, &stack);
    +
    128 evaluate(op1, op2, scan, &stack);
    129 }
    130 j++;
    131 }
    @@ -420,7 +409,7 @@ template< 136}
    games::memory_game::is_number
    bool is_number(const T &input)
    Utility function to verify if the given input is a number or not. This is very useful to prevent the ...
    Definition memory_game.cpp:62
    -
    others::postfix_expression::evaluate
    void evaluate(float a, float b, const std::string &operation, Stack *stack)
    Evaluate answer using given last two operands from and operation.
    Definition postfix_evaluation.cpp:77
    +
    others::postfix_expression::evaluate
    void evaluate(float a, float b, const std::string &operation, Stack *stack)
    Evaluate answer using given last two operands from and operation.
    Definition postfix_evaluation.cpp:77
    std::stof
    T stof(T... args)
    Here is the call graph for this function:
    @@ -439,19 +428,12 @@ Here is the call graph for this function: void others::postfix_expression::push ( - float  - operand, + float operand, - Stack *  - stack  - - - - ) - + Stack * stack )
    @@ -484,7 +466,7 @@ Here is the call graph for this function:
    static void test_function_1 ( - ) + ) @@ -500,12 +482,12 @@ Here is the call graph for this function:
    146 {
    147 std::array<std::string, 7> input = {"2", "3", "1", "*", "+", "9", "-"};
    148
    -
    149 float answer = others::postfix_expression::postfix_evaluation(input);
    +
    149 float answer = others::postfix_expression::postfix_evaluation(input);
    150
    151 assert(answer == -4);
    152}
    -
    others::postfix_expression::postfix_evaluation
    float postfix_evaluation(std::array< std::string, N > input)
    Postfix Evaluation algorithm to compute the value from given input array.
    Definition postfix_evaluation.cpp:115
    +
    others::postfix_expression::postfix_evaluation
    float postfix_evaluation(std::array< std::string, N > input)
    Postfix Evaluation algorithm to compute the value from given input array.
    Definition postfix_evaluation.cpp:115
    @@ -521,7 +503,7 @@ Here is the call graph for this function: static void test_function_2 ( - ) + ) @@ -537,7 +519,7 @@ Here is the call graph for this function:
    159 {
    160 std::array<std::string, 9> input = {"100", "200", "+", "2", "/",
    161 "5", "*", "7", "+"};
    -
    162 float answer = others::postfix_expression::postfix_evaluation(input);
    +
    162 float answer = others::postfix_expression::postfix_evaluation(input);
    163
    164 assert(answer == 757);
    165}
    @@ -550,7 +532,7 @@ Here is the call graph for this function:
    diff --git a/d7/d77/class_edge.html b/d7/d77/class_edge.html index 59310d80f..c84331524 100644 --- a/d7/d77/class_edge.html +++ b/d7/d77/class_edge.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Edge Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -119,7 +121,7 @@ Public Member Functions Edge & operator= (Edge const &)=default   - Edge (unsigned int source, unsigned int destination) + Edge (unsigned int source, unsigned int destination)   - - + - - - - - - - +

    @@ -156,19 +158,12 @@ unsigned int 

    		dest
    Edge::Edge (unsigned int source, unsigned int source,
    unsigned int destination 
    )unsigned int destination )
    @@ -199,7 +194,7 @@ unsigned int dest diff --git a/d7/d7a/namespacebinomial.html b/d7/d7a/namespacebinomial.html index f0d4a8aa6..c47b0e565 100644 --- a/d7/d7a/namespacebinomial.html +++ b/d7/d7a/namespacebinomial.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: binomial Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d7/d7a/namespacebinomial.html','../../

    Functions for Binomial coefficients implementation. -More...

    +More...

    Detailed Description

    Functions for Binomial coefficients implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d7/d7a/namespacebinomial.html','../../ diff --git a/d7/d7c/classstatistics_1_1stats__computer1.html b/d7/d7c/classstatistics_1_1stats__computer1.html index 2aa38c345..d7282a077 100644 --- a/d7/d7c/classstatistics_1_1stats__computer1.html +++ b/d7/d7c/classstatistics_1_1stats__computer1.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: statistics::stats_computer1< T > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,13 +115,13 @@ Collaboration diagram for statistics::stats_computer1< T >:
    - + - + - + - +

    Public Member Functions

    void new_val (T x)
    void new_val (T x)
     
    double mean () const
    double mean () const
     
    double variance () const
    double variance () const
     
    double std () const
    double std () const
     

    @@ -139,7 +141,7 @@ T 

    		K
    - +

    Friends

    std::istream & operator>> (std::istream &input, stats_computer1 &stat)
    std::istream & operator>> (std::istream &input, stats_computer1 &stat)
     

    Detailed Description

    @@ -160,7 +162,7 @@ template<typename T > double statistics::stats_computer1< T >::mean ( - ) + ) const @@ -189,8 +191,7 @@ template<typename T > void statistics::stats_computer1< T >::new_val ( - T  - x) + T x) @@ -231,7 +232,7 @@ template<typename T > double statistics::stats_computer1< T >::std ( - ) + ) const @@ -242,8 +243,8 @@ template<typename T >

    return sample standard deviation computed till last sample

    -
    48{ return std::sqrt(this->variance()); }
    -
    statistics::stats_computer1::variance
    double variance() const
    Definition realtime_stats.cpp:45
    +
    48{ return std::sqrt(this->variance()); }
    +
    statistics::stats_computer1::variance
    double variance() const
    Definition realtime_stats.cpp:45
    std::sqrt
    T sqrt(T... args)
    Here is the call graph for this function:
    @@ -267,7 +268,7 @@ template<typename T >
    double statistics::stats_computer1< T >::variance ( - ) + ) const @@ -297,19 +298,12 @@ template<typename T >
    std::istream & operator>> ( - std::istream &  - input, + std::istream & input, - stats_computer1< T > &  - stat  - - - - ) - + stats_computer1< T > & stat ) @@ -323,10 +317,10 @@ template<typename T >
    54 {
    55 T val;
    56 input >> val;
    -
    57 stat.new_val(val);
    +
    57 stat.new_val(val);
    58 return input;
    59 }
    -
    statistics::stats_computer1::new_val
    void new_val(T x)
    Definition realtime_stats.cpp:32
    +
    statistics::stats_computer1::new_val
    void new_val(T x)
    Definition realtime_stats.cpp:32
    @@ -339,7 +333,7 @@ template<typename T > diff --git a/d7/d7f/section.html b/d7/d7f/section.html index 46a2b2389..4c36ba384 100644 --- a/d7/d7f/section.html +++ b/d7/d7f/section.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Prime factorization + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -100,7 +102,7 @@ $(document).ready(function(){initNavTree('d7/d7f/section.html','../../'); initRe
    Prime factorization
    -

    Prime Factorization is a very important and useful technique to factorize any number into its prime factors. It has various applications in the field of number theory.

    +

    Prime Factorization is a very important and useful technique to factorize any number into its prime factors. It has various applications in the field of number theory.

    The method of prime factorization involves two function calls. First: Calculating all the prime number up till a certain range using the standard Sieve of Eratosthenes.

    Second: Using the prime numbers to reduce the the given number and thus find all its prime factors.

    The complexity of the solution involves approx. O(n logn) in calculating sieve of eratosthenes O(log n) in calculating the prime factors of the number. So in total approx. O(n logn).

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d7/d7f/section.html','../../'); initRe diff --git a/d7/d81/namespacebit__manipulation.html b/d7/d81/namespacebit__manipulation.html index 49f24c990..150406f21 100644 --- a/d7/d81/namespacebit__manipulation.html +++ b/d7/d81/namespacebit__manipulation.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: bit_manipulation Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -104,14 +106,14 @@ $(document).ready(function(){initNavTree('d7/d81/namespacebit__manipulation.html

    for IO operations -More...

    +More...

    - + - +

    Functions

    uint64_t next_higher_number (uint64_t x)
    uint64_t next_higher_number (uint64_t x)
     The main function implements checking the next number.
     
    bool isPowerOfTwo (std ::int64_t n)
    bool isPowerOfTwo (std ::int64_t n)
     The main function implements check for power of 2.
     
    @@ -137,8 +139,7 @@ Functions bool bit_manipulation::isPowerOfTwo ( - std ::int64_t  - n) + std ::int64_t n) @@ -175,8 +176,7 @@ Functions uint64_t bit_manipulation::next_higher_number ( - uint64_t  - x) + uint64_t x) @@ -233,7 +233,7 @@ Functions diff --git a/d7/d83/trie__tree_8cpp.html b/d7/d83/trie__tree_8cpp.html index 70a31b4fd..7cc81c5db 100644 --- a/d7/d83/trie__tree_8cpp.html +++ b/d7/d83/trie__tree_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/trie_tree.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -133,10 +135,10 @@ Namespaces - + - +

    Functions

    static void test ()
    static void test ()
     Testing function.
     
    int main ()
    int main ()
     Main function.
     
    @@ -157,8 +159,7 @@ Functions int main ( - void  - ) + void ) @@ -167,11 +168,11 @@ Functions

    Main function.

    Returns
    0 on exit
    205 {
    -
    206 test();
    +
    206 test();
    207
    208 return 0;
    209}
    -
    test
    static void test()
    Testing function.
    Definition trie_tree.cpp:178
    +
    test
    static void test()
    Testing function.
    Definition trie_tree.cpp:178
    Here is the call graph for this function:
    @@ -192,7 +193,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -244,7 +245,7 @@ Here is the call graph for this function:
    diff --git a/d7/d88/namespaceprefix__sum__array.html b/d7/d88/namespaceprefix__sum__array.html index f45f57095..2fa54872f 100644 --- a/d7/d88/namespaceprefix__sum__array.html +++ b/d7/d88/namespaceprefix__sum__array.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: prefix_sum_array Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d7/d88/namespaceprefix__sum__array.htm

    Range sum queries using prefix-sum-array. -More...

    +More...

    Detailed Description

    Range sum queries using prefix-sum-array.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d7/d88/namespaceprefix__sum__array.htm diff --git a/d7/d89/double__factorial_8cpp.html b/d7/d89/double__factorial_8cpp.html index d727e3a2d..7d73700df 100644 --- a/d7/d89/double__factorial_8cpp.html +++ b/d7/d89/double__factorial_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/double_factorial.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,15 +117,15 @@ Include dependency graph for double_factorial.cpp:
    - + - + - + - + - +

    Functions

    uint64_t double_factorial_iterative (uint64_t n)
    uint64_t double_factorial_iterative (uint64_t n)
     
    uint64_t double_factorial_recursive (uint64_t n)
    uint64_t double_factorial_recursive (uint64_t n)
     
    void test (uint64_t n, uint64_t expected)
    void test (uint64_t n, uint64_t expected)
     
    void tests ()
    void tests ()
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -140,8 +142,7 @@ It is also called as semifactorial of a number and is denoted by \(n!!\)

    uint64_t double_factorial_iterative ( - uint64_t  - n) + uint64_t n) @@ -168,8 +169,7 @@ It is also called as semifactorial of a number and is denoted by \(n!!\)

    uint64_t double_factorial_recursive ( - uint64_t  - n) + uint64_t n) @@ -179,9 +179,9 @@ Recursion can be costly for large numbers.

    30 {
    31 if (n <= 1)
    32 return 1;
    -
    33 return n * double_factorial_recursive(n - 2);
    +
    33 return n * double_factorial_recursive(n - 2);
    34}
    -
    double_factorial_recursive
    uint64_t double_factorial_recursive(uint64_t n)
    Definition double_factorial.cpp:30
    +
    double_factorial_recursive
    uint64_t double_factorial_recursive(uint64_t n)
    Definition double_factorial.cpp:30
    Here is the call graph for this function:
    @@ -199,18 +199,17 @@ Here is the call graph for this function:
    int main ( - void  - ) + void )

    Main function

    67 {
    -
    68 tests();
    +
    68 tests();
    69 return 0;
    70}
    -
    tests
    void tests()
    Definition double_factorial.cpp:50
    +
    tests
    void tests()
    Definition double_factorial.cpp:50
    Here is the call graph for this function:
    @@ -228,19 +227,12 @@ Here is the call graph for this function:
    void test ( - uint64_t  - n, + uint64_t n, - uint64_t  - expected  - - - - ) - + uint64_t expected )
    @@ -252,10 +244,10 @@ Here is the call graph for this function:
    42 {
    -
    43 assert(double_factorial_iterative(n) == expected);
    -
    44 assert(double_factorial_recursive(n) == expected);
    +
    43 assert(double_factorial_iterative(n) == expected);
    +
    44 assert(double_factorial_recursive(n) == expected);
    45}
    -
    double_factorial_iterative
    uint64_t double_factorial_iterative(uint64_t n)
    Definition double_factorial.cpp:17
    +
    double_factorial_iterative
    uint64_t double_factorial_iterative(uint64_t n)
    Definition double_factorial.cpp:17
    Here is the call graph for this function:
    @@ -273,7 +265,7 @@ Here is the call graph for this function:
    void tests ( - ) + ) @@ -308,7 +300,7 @@ Here is the call graph for this function: diff --git a/d7/da4/struct_list_node.html b/d7/da4/struct_list_node.html index c629deb12..710ef583a 100644 --- a/d7/da4/struct_list_node.html +++ b/d7/da4/struct_list_node.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ListNode Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d7/da4/struct_list_node.html','../../'

    for IO operations - More...

    + More...

    Collaboration diagram for ListNode:
    @@ -124,16 +126,16 @@ Public Member Functions  constructor with value for node->val provided
      - ListNode (int x, ListNode *next) + ListNode (int x, ListNode *next)  constructor with values provided for node->val and node->next
      - + - +

    Public Attributes

    int val {0}
    int val {0}
     the value stored in the node
     
    ListNode * next {nullptr}
    ListNode * next {nullptr}
     pointer to the next node
     
    @@ -184,7 +186,7 @@ Public Attributes diff --git a/d7/da6/eratosthenes_8cpp.html b/d7/da6/eratosthenes_8cpp.html index a884155a3..0c26bbf6b 100644 --- a/d7/da6/eratosthenes_8cpp.html +++ b/d7/da6/eratosthenes_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/eratosthenes.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -131,10 +133,10 @@ Functions void math::print_primes (std::vector< bool > const &primes)  Prints all the indexes of true values in the passed std::vector.
      -static void test () +static void test ()  Self-tests the sieve function for major inconsistencies.
      -int main (int argc, char *argv[]) +int main (int argc, char *argv[])  Main function.
      @@ -152,19 +154,12 @@ Functions int main ( - int  - argc, + int argc, - char *  - argv[]  - - - - ) - + char * argv[] )
    @@ -179,7 +174,7 @@ Functions
    Returns
    0 on exit
    87 {
    -
    88 test(); // run self-test implementations
    +
    88 test(); // run self-test implementations
    89
    90 // The largest prime we will check for
    91 auto max = 10000;
    @@ -215,7 +210,7 @@ Functions
    std::chrono::duration_cast
    T duration_cast(T... args)
    std::endl
    T endl(T... args)
    -
    test
    static void test()
    Self-tests the sieve function for major inconsistencies.
    Definition eratosthenes.cpp:64
    +
    test
    static void test()
    Self-tests the sieve function for major inconsistencies.
    Definition eratosthenes.cpp:64
    std::max
    T max(T... args)
    math::sieve
    void sieve(std::vector< bool > *vec)
    Performs the sieve.
    Definition eratosthenes.cpp:33
    math::print_primes
    void print_primes(std::vector< bool > const &primes)
    Prints all the indexes of true values in the passed std::vector.
    Definition eratosthenes.cpp:51
    @@ -243,7 +238,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -286,7 +281,7 @@ Here is the call graph for this function:
    diff --git a/d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html b/d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html index 75dd90345..e34df4ad1 100644 --- a/d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html +++ b/d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('dd/d5a/structstrings_1_1boyer__moore_1 diff --git a/d7/daf/namespace_knapsack.html b/d7/daf/namespace_knapsack.html index 6e1bda98b..f6a282e3b 100644 --- a/d7/daf/namespace_knapsack.html +++ b/d7/daf/namespace_knapsack.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Knapsack Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d7/daf/namespace_knapsack.html','../..

    Implementation of 0-1 Knapsack problem. -More...

    +More...

    Detailed Description

    Implementation of 0-1 Knapsack problem.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d7/daf/namespace_knapsack.html','../.. diff --git a/d7/db9/hill__cipher_8cpp.html b/d7/db9/hill__cipher_8cpp.html index ccd007fba..7ca71d449 100644 --- a/d7/db9/hill__cipher_8cpp.html +++ b/d7/db9/hill__cipher_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ciphers/hill_cipher.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -138,15 +140,15 @@ Namespaces

    Functions

    template<typename T > -static std::ostream & operator<< (std::ostream &out, matrix< T > const &v) +static std::ostream & operator<< (std::ostream &out, matrix< T > const &v)   -void test1 (const std::string &text) +void test1 (const std::string &text)  Self test 1 - using 3x3 randomly generated key.
      -void test2 (const std::string &text) +void test2 (const std::string &text)  Self test 2 - using 8x8 randomly generated key.
      -int main () +int main ()  
    Note
    This program uses determinant computation using LU decomposition from the file lu_decomposition.h
    The matrix generation algorithm is very rudimentary and does not guarantee an invertible modulus matrix.
    -
    Todo:
    Better matrix generation algorithm.
    +
    Todo
    Better matrix generation algorithm.
    Author
    Krishna Vedala

    Function Documentation

    @@ -176,8 +178,7 @@ The matrix generation algorithm is very rudimentary and does not guarantee an in - - +

    @@ -164,7 +166,7 @@ Variables

    int main (void )void )
    @@ -225,19 +226,12 @@ template<typename T >
    static std::ostream & operator<< ( - std::ostream &  - out, + std::ostream & out, - matrix< T > const &  - v  - - - - ) - + matrix< T > const & v ) @@ -282,8 +276,7 @@ Here is the call graph for this function: void test1 ( - const std::string &  - text) + const std::string & text) @@ -348,8 +341,7 @@ Here is the call graph for this function: void test2 ( - const std::string &  - text) + const std::string & text) @@ -402,7 +394,7 @@ Here is the call graph for this function: diff --git a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.map b/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.map index cccd65365..501d33718 100644 --- a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.map +++ b/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.map @@ -1,14 +1,13 @@ - - + - + - + diff --git a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.md5 b/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.md5 index 089c6683e..75081c87e 100644 --- a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.md5 +++ b/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.md5 @@ -1 +1 @@ -294214990261e200a706839ee95daf07 \ No newline at end of file +58ca71fcfc592d99f44ef2bc0f19eadc \ No newline at end of file diff --git a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.svg b/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.svg index fbe11d92f..bc983258b 100644 --- a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.svg +++ b/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.svg @@ -27,15 +27,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -82,9 +73,9 @@ - + Node1->Node4 - + @@ -100,9 +91,9 @@ - + Node1->Node5 - + @@ -118,9 +109,9 @@ - + Node1->Node6 - + diff --git a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph_org.svg b/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph_org.svg index 4c5190c35..f236a4614 100644 --- a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph_org.svg +++ b/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph_org.svg @@ -17,15 +17,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -72,9 +63,9 @@ - + Node1->Node4 - + @@ -90,9 +81,9 @@ - + Node1->Node5 - + @@ -108,9 +99,9 @@ - + Node1->Node6 - + diff --git a/d7/dba/cll_8h_source.html b/d7/dba/cll_8h_source.html index d6c196682..cc9c50691 100644 --- a/d7/dba/cll_8h_source.html +++ b/d7/dba/cll_8h_source.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/cll/cll.h Source File + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -76,7 +78,7 @@ $(document).ready(function() { init_codefold(1); });
    @@ -158,7 +160,7 @@ $(document).ready(function(){initNavTree('d7/dba/cll_8h_source.html','../../'); diff --git a/d7/dc7/classmachine__learning_1_1k__nearest__neighbors_1_1_knn-members.html b/d7/dc7/classmachine__learning_1_1k__nearest__neighbors_1_1_knn-members.html index 2a5248315..484b21ee0 100644 --- a/d7/dc7/classmachine__learning_1_1k__nearest__neighbors_1_1_knn-members.html +++ b/d7/dc7/classmachine__learning_1_1k__nearest__neighbors_1_1_knn-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -117,7 +119,7 @@ $(document).ready(function(){initNavTree('da/d94/classmachine__learning_1_1k__ne diff --git a/d7/ded/queue_8hpp_source.html b/d7/ded/queue_8hpp_source.html index 01091761a..d83ac30e7 100644 --- a/d7/ded/queue_8hpp_source.html +++ b/d7/ded/queue_8hpp_source.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/queue.hpp Source File + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -76,7 +78,7 @@ $(document).ready(function() { init_codefold(1); });
    @@ -253,7 +255,7 @@ $(document).ready(function(){initNavTree('d7/ded/queue_8hpp_source.html','../../ diff --git a/d7/def/trie__multiple__search_8cpp.html b/d7/def/trie__multiple__search_8cpp.html index 8d9b56988..7ba4962cb 100644 --- a/d7/def/trie__multiple__search_8cpp.html +++ b/d7/def/trie__multiple__search_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: operations_on_datastructures/trie_multiple_search.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -136,10 +138,10 @@ Namespaces - + - +

    Functions

    static void test ()
    static void test ()
     Function to test a simple search before and after deleting an entry. And to test out the multiple variants of search.
     
    int main (int argc, char const *argv[])
    int main (int argc, char const *argv[])
     Main function.
     
    @@ -156,19 +158,12 @@ Functions int main ( - int  - argc, + int argc, - char const *  - argv[]  - - - - ) - + char const * argv[] )
    @@ -183,10 +178,10 @@ Functions
    Returns
    0 on exit
    463 {
    -
    464 test(); // run self-test implementations
    +
    464 test(); // run self-test implementations
    465 return 0;
    466}
    -
    test
    static void test()
    Function to test a simple search before and after deleting an entry. And to test out the multiple var...
    Definition trie_multiple_search.cpp:422
    +
    test
    static void test()
    Function to test a simple search before and after deleting an entry. And to test out the multiple var...
    Definition trie_multiple_search.cpp:422
    Here is the call graph for this function:
    @@ -207,7 +202,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -271,7 +266,7 @@ Here is the call graph for this function:
    diff --git a/d7/df9/structothers_1_1iterative__tree__traversals_1_1_node-members.html b/d7/df9/structothers_1_1iterative__tree__traversals_1_1_node-members.html index 09ad2fdba..4b9155271 100644 --- a/d7/df9/structothers_1_1iterative__tree__traversals_1_1_node-members.html +++ b/d7/df9/structothers_1_1iterative__tree__traversals_1_1_node-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d2/d9a/structothers_1_1iterative__tree diff --git a/d8/d01/struct_item-members.html b/d8/d01/struct_item-members.html index c81167a1c..01e3ae3bc 100644 --- a/d8/d01/struct_item-members.html +++ b/d8/d01/struct_item-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -110,7 +112,7 @@ $(document).ready(function(){initNavTree('db/d66/struct_item.html','../../'); in diff --git a/d8/d10/structlist.html b/d8/d10/structlist.html index 092561349..c0be11438 100644 --- a/d8/d10/structlist.html +++ b/d8/d10/structlist.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: list Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -131,7 +133,7 @@ struct list * 
    • list
      • -
    • Generated by doxygen 1.9.8
      • +
    • Generated by doxygen 1.10.0
    diff --git a/d8/d13/bubble__sort_8cpp.html b/d8/d13/bubble__sort_8cpp.html index fd109c893..decc6b268 100644 --- a/d8/d13/bubble__sort_8cpp.html +++ b/d8/d13/bubble__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/bubble_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,7 +117,7 @@ Include dependency graph for bubble_sort.cpp:
    - +

    Functions

    int main ()
    int main ()
     

    Detailed Description

    @@ -138,8 +140,7 @@ Functions int main ( - void  - ) + void ) @@ -201,7 +202,7 @@ Functions diff --git a/d8/d14/namespacen__queens__optimized.html b/d8/d14/namespacen__queens__optimized.html index 6f887a944..e0d90eae6 100644 --- a/d8/d14/namespacen__queens__optimized.html +++ b/d8/d14/namespacen__queens__optimized.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: n_queens_optimized Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/d14/namespacen__queens__optimized.h

    Functions for Eight Queens puzzle optimized. -More...

    +More...

    Detailed Description

    Functions for Eight Queens puzzle optimized.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/d14/namespacen__queens__optimized.h diff --git a/d8/d1d/namespacestrand.html b/d8/d1d/namespacestrand.html index 6dca4609c..86795cb3c 100644 --- a/d8/d1d/namespacestrand.html +++ b/d8/d1d/namespacestrand.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: strand Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/d1d/namespacestrand.html','../../')

    Functions for Strand Sort algorithm. -More...

    +More...

    Detailed Description

    Functions for Strand Sort algorithm.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/d1d/namespacestrand.html','../../') diff --git a/d8/d20/classuint256__t-members.html b/d8/d20/classuint256__t-members.html index b7b95fc30..c86e5bf73 100644 --- a/d8/d20/classuint256__t-members.html +++ b/d8/d20/classuint256__t-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -192,7 +194,7 @@ $(document).ready(function(){initNavTree('d1/d83/classuint256__t.html','../../') diff --git a/d8/d27/classmachine__learning_1_1neural__network_1_1_neural_network-members.html b/d8/d27/classmachine__learning_1_1neural__network_1_1_neural_network-members.html index 5ec905ad3..ad38f3d87 100644 --- a/d8/d27/classmachine__learning_1_1neural__network_1_1_neural_network-members.html +++ b/d8/d27/classmachine__learning_1_1neural__network_1_1_neural_network-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,7 +130,7 @@ $(document).ready(function(){initNavTree('d4/df4/classmachine__learning_1_1neura diff --git a/d8/d28/classrange__queries_1_1per_seg_tree.html b/d8/d28/classrange__queries_1_1per_seg_tree.html index 6a72d1613..818165610 100644 --- a/d8/d28/classrange__queries_1_1per_seg_tree.html +++ b/d8/d28/classrange__queries_1_1per_seg_tree.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: range_queries::perSegTree Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -108,7 +110,7 @@ $(document).ready(function(){initNavTree('d8/d28/classrange__queries_1_1per_seg_

    Range query here is range sum, but the code can be modified to make different queries like range max or min. - More...

    + More...

    Collaboration diagram for range_queries::perSegTree:
    @@ -122,34 +124,34 @@ Classes - + - + - + - +

    Public Member Functions

    void construct (const std::vector< int64_t > &vec)
    void construct (const std::vector< int64_t > &vec)
     Constructing the segment tree with the values in the passed vector. Returned root pointer is pushed in the pointers vector to have access to the original version if the segment tree is updated.
     
    void update (const uint32_t &l, const uint32_t &r, const int64_t &value)
    void update (const uint32_t &l, const uint32_t &r, const int64_t &value)
     Doing range update by passing the left and right indexes of the range as well as the value to be added.
     
    int64_t query (const uint32_t &l, const uint32_t &r, const uint32_t &version)
    int64_t query (const uint32_t &l, const uint32_t &r, const uint32_t &version)
     Querying the range from index l to index r, getting the sum of the elements whose index x satisfies l<=x<=r.
     
    uint32_t size ()
    uint32_t size ()
     Getting the number of versions after updates so far which is equal to the size of the pointers vector.
     
    - + - + - + - + - +

    Private Member Functions

    std::shared_ptr< Node > newKid (std::shared_ptr< Node > const &curr)
    std::shared_ptr< Node > newKid (std::shared_ptr< Node > const &curr)
     Creating a new node with the same values of curr node.
     
    void lazy (const uint32_t &i, const uint32_t &j, std::shared_ptr< Node > const &curr)
    void lazy (const uint32_t &i, const uint32_t &j, std::shared_ptr< Node > const &curr)
     If there is some value to be propagated to the passed node, value is added to the node and the children of the node, if exist, are copied and the propagated value is also added to them.
     
    std::shared_ptr< Node > construct (const uint32_t &i, const uint32_t &j)
    std::shared_ptr< Node > construct (const uint32_t &i, const uint32_t &j)
     Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum of the given range, set its pointers to the children, and set its value to the sum of the children's values.
     
    std::shared_ptr< Node > update (const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, const int64_t &value, std::shared_ptr< Node > const &curr)
    std::shared_ptr< Node > update (const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, const int64_t &value, std::shared_ptr< Node > const &curr)
     Doing range update, checking at every node if it has some value to be propagated. All nodes affected by the update are copied and propagation value is added to the leaf of them.
     
    int64_t query (const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, std::shared_ptr< Node > const &curr)
    int64_t query (const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, std::shared_ptr< Node > const &curr)
     Querying the range from index l to index r, checking at every node if it has some value to be propagated. Current node's value is returned if its range is completely inside the wanted range, else 0 is returned.
     
    @@ -158,10 +160,10 @@ Private Attributes - + - +
    uint32_t n = 0
     
    std::vector< std::shared_ptr< Node > > ptrs {}
    std::vector< std::shared_ptr< Node > > ptrs {}
     number of elements/leaf nodes in the segment tree
     
    std::vector< int64_t > vec {}
    std::vector< int64_t > vec {}
     

    Detailed Description

    @@ -179,8 +181,7 @@ uint32_t n = 0 void range_queries::perSegTree::construct ( - const std::vector< int64_t > &  - vec) + const std::vector< int64_t > & vec) @@ -200,17 +201,17 @@ uint32_t n = 0
    Returns
    void
    200 {
    -
    201 if (vec.empty()) {
    +
    201 if (vec.empty()) {
    202 return;
    203 }
    -
    204 n = vec.size();
    -
    205 this->vec = vec;
    -
    206 auto root = construct(0, n - 1);
    -
    207 ptrs.push_back(root);
    +
    204 n = vec.size();
    +
    205 this->vec = vec;
    +
    206 auto root = construct(0, n - 1);
    +
    207 ptrs.push_back(root);
    208 }
    -
    range_queries::perSegTree::ptrs
    std::vector< std::shared_ptr< Node > > ptrs
    number of elements/leaf nodes in the segment tree
    Definition persistent_seg_tree_lazy_prop.cpp:54
    -
    range_queries::perSegTree::construct
    std::shared_ptr< Node > construct(const uint32_t &i, const uint32_t &j)
    Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...
    Definition persistent_seg_tree_lazy_prop.cpp:106
    -
    range_queries::perSegTree::vec
    std::vector< int64_t > vec
    Definition persistent_seg_tree_lazy_prop.cpp:57
    +
    range_queries::perSegTree::ptrs
    std::vector< std::shared_ptr< Node > > ptrs
    number of elements/leaf nodes in the segment tree
    Definition persistent_seg_tree_lazy_prop.cpp:54
    +
    range_queries::perSegTree::construct
    std::shared_ptr< Node > construct(const uint32_t &i, const uint32_t &j)
    Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...
    Definition persistent_seg_tree_lazy_prop.cpp:106
    +
    range_queries::perSegTree::vec
    std::vector< int64_t > vec
    Definition persistent_seg_tree_lazy_prop.cpp:57
    std::vector::empty
    T empty(T... args)
    std::vector::push_back
    T push_back(T... args)
    std::vector::size
    T size(T... args)
    @@ -234,19 +235,12 @@ Here is the call graph for this function:
    std::shared_ptr< Node > range_queries::perSegTree::construct ( - const uint32_t &  - i, + const uint32_t & i, - const uint32_t &  - j  - - - - ) - + const uint32_t & j ) @@ -268,17 +262,18 @@ Here is the call graph for this function:
    106 {
    107 auto newNode = std::make_shared<Node>(Node());
    108 if (i == j) {
    -
    109 newNode->val = vec[i];
    +
    109 newNode->val = vec[i];
    110 } else {
    111 uint32_t mid = i + (j - i) / 2;
    -
    112 auto leftt = construct(i, mid);
    -
    113 auto right = construct(mid + 1, j);
    -
    114 newNode->val = leftt->val + right->val;
    +
    112 auto leftt = construct(i, mid);
    +
    113 auto right = construct(mid + 1, j);
    +
    114 newNode->val = leftt->val + right->val;
    115 newNode->left = leftt;
    -
    116 newNode->right = right;
    +
    116 newNode->right = right;
    117 }
    118 return newNode;
    119 }
    +
    std::right
    T right(T... args)
    Node
    Definition linkedlist_implentation_usingarray.cpp:14
    Here is the call graph for this function:
    @@ -300,25 +295,17 @@ Here is the call graph for this function:
    void range_queries::perSegTree::lazy ( - const uint32_t &  - i, + const uint32_t & i, - const uint32_t &  - j, + const uint32_t & j, - std::shared_ptr< Node > const &  - curr  - - - - ) - + std::shared_ptr< Node > const & curr ) @@ -344,14 +331,14 @@ Here is the call graph for this function:
    87 }
    88 curr->val += (j - i + 1) * curr->prop;
    89 if (i != j) {
    -
    90 curr->left = newKid(curr->left);
    -
    91 curr->right = newKid(curr->right);
    +
    90 curr->left = newKid(curr->left);
    +
    91 curr->right = newKid(curr->right);
    92 curr->left->prop += curr->prop;
    93 curr->right->prop += curr->prop;
    94 }
    95 curr->prop = 0;
    96 }
    -
    range_queries::perSegTree::newKid
    std::shared_ptr< Node > newKid(std::shared_ptr< Node > const &curr)
    Creating a new node with the same values of curr node.
    Definition persistent_seg_tree_lazy_prop.cpp:65
    +
    range_queries::perSegTree::newKid
    std::shared_ptr< Node > newKid(std::shared_ptr< Node > const &curr)
    Creating a new node with the same values of curr node.
    Definition persistent_seg_tree_lazy_prop.cpp:65
    Here is the call graph for this function:
    @@ -372,8 +359,7 @@ Here is the call graph for this function:
    std::shared_ptr< Node > range_queries::perSegTree::newKid ( - std::shared_ptr< Node > const &  - curr) + std::shared_ptr< Node > const & curr) @@ -415,37 +401,27 @@ Here is the call graph for this function: int64_t range_queries::perSegTree::query ( - const uint32_t &  - i, + const uint32_t & i, - const uint32_t &  - j, + const uint32_t & j, - const uint32_t &  - l, + const uint32_t & l, - const uint32_t &  - r, + const uint32_t & r, - std::shared_ptr< Node > const &  - curr  - - - - ) - + std::shared_ptr< Node > const & curr ) @@ -468,7 +444,7 @@ Here is the call graph for this function:
    Returns
    sum of elements whose index x satisfies l<=x<=r
    172 {
    -
    173 lazy(i, j, curr);
    +
    173 lazy(i, j, curr);
    174 if (j < l || r < i) {
    175 return 0;
    176 }
    @@ -476,15 +452,15 @@ Here is the call graph for this function:
    178 return curr->val;
    179 }
    180 uint32_t mid = i + (j - i) / 2;
    -
    181 return query(i, mid, l, r, curr->left) +
    -
    182 query(mid + 1, j, l, r, curr->right);
    +
    181 return query(i, mid, l, r, curr->left) +
    +
    182 query(mid + 1, j, l, r, curr->right);
    183 }
    -
    range_queries::perSegTree::lazy
    void lazy(const uint32_t &i, const uint32_t &j, std::shared_ptr< Node > const &curr)
    If there is some value to be propagated to the passed node, value is added to the node and the childr...
    Definition persistent_seg_tree_lazy_prop.cpp:83
    -
    query
    Definition mo.cpp:6
    +
    range_queries::perSegTree::lazy
    void lazy(const uint32_t &i, const uint32_t &j, std::shared_ptr< Node > const &curr)
    If there is some value to be propagated to the passed node, value is added to the node and the childr...
    Definition persistent_seg_tree_lazy_prop.cpp:83
    +
    range_queries::perSegTree::query
    int64_t query(const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, std::shared_ptr< Node > const &curr)
    Querying the range from index l to index r, checking at every node if it has some value to be propaga...
    Definition persistent_seg_tree_lazy_prop.cpp:171
    Here is the call graph for this function:
    -
    +
    @@ -501,25 +477,17 @@ Here is the call graph for this function: int64_t range_queries::perSegTree::query ( - const uint32_t &  - l, + const uint32_t & l, - const uint32_t &  - r, + const uint32_t & r, - const uint32_t &  - version  - - - - ) - + const uint32_t & version ) @@ -540,9 +508,14 @@ Here is the call graph for this function:
    Returns
    sum of elements whose index x satisfies l<=x<=r
    246 {
    -
    247 return query(0, n - 1, l, r, ptrs[version]);
    +
    247 return query(0, n - 1, l, r, ptrs[version]);
    248 }
    -
    +
    +Here is the call graph for this function:
    +
    +
    +
    + @@ -557,7 +530,7 @@ Here is the call graph for this function: uint32_t range_queries::perSegTree::size ( - ) + ) @@ -571,7 +544,7 @@ Here is the call graph for this function:

    Getting the number of versions after updates so far which is equal to the size of the pointers vector.

    Returns
    the number of versions
    258 {
    -
    259 return ptrs.size();
    +
    259 return ptrs.size();
    260 }
    Here is the call graph for this function:
    @@ -593,43 +566,32 @@ Here is the call graph for this function: std::shared_ptr< Node > range_queries::perSegTree::update ( - const uint32_t &  - i, + const uint32_t & i, - const uint32_t &  - j, + const uint32_t & j, - const uint32_t &  - l, + const uint32_t & l, - const uint32_t &  - r, + const uint32_t & r, - const int64_t &  - value, + const int64_t & value, - std::shared_ptr< Node > const &  - curr  - - - - ) - + std::shared_ptr< Node > const & curr ) @@ -653,11 +615,11 @@ Here is the call graph for this function:
    Returns
    pointer to the current newly created node
    138 {
    -
    139 lazy(i, j, curr);
    +
    139 lazy(i, j, curr);
    140 if (i >= l && j <= r) {
    -
    141 std::shared_ptr<Node> newNode = newKid(curr);
    +
    141 std::shared_ptr<Node> newNode = newKid(curr);
    142 newNode->prop += value;
    -
    143 lazy(i, j, newNode);
    +
    143 lazy(i, j, newNode);
    144 return newNode;
    145 }
    146 if (i > r || j < l) {
    @@ -665,12 +627,12 @@ Here is the call graph for this function:
    148 }
    149 auto newNode = std::make_shared<Node>(Node());
    150 uint32_t mid = i + (j - i) / 2;
    -
    151 newNode->left = update(i, mid, l, r, value, curr->left);
    -
    152 newNode->right = update(mid + 1, j, l, r, value, curr->right);
    +
    151 newNode->left = update(i, mid, l, r, value, curr->left);
    +
    152 newNode->right = update(mid + 1, j, l, r, value, curr->right);
    153 newNode->val = newNode->left->val + newNode->right->val;
    154 return newNode;
    155 }
    -
    range_queries::perSegTree::update
    std::shared_ptr< Node > update(const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, const int64_t &value, std::shared_ptr< Node > const &curr)
    Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...
    Definition persistent_seg_tree_lazy_prop.cpp:135
    +
    range_queries::perSegTree::update
    std::shared_ptr< Node > update(const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, const int64_t &value, std::shared_ptr< Node > const &curr)
    Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...
    Definition persistent_seg_tree_lazy_prop.cpp:135
    Here is the call graph for this function:
    @@ -692,25 +654,17 @@ Here is the call graph for this function: void range_queries::perSegTree::update ( - const uint32_t &  - l, + const uint32_t & l, - const uint32_t &  - r, + const uint32_t & r, - const int64_t &  - value  - - - - ) - + const int64_t & value ) @@ -731,9 +685,9 @@ Here is the call graph for this function:
    Returns
    void
    223 {
    -
    224 ptrs.push_back(update(
    +
    224 ptrs.push_back(update(
    225 0, n - 1, l, r, value,
    -
    226 ptrs[ptrs.size() -
    +
    226 ptrs[ptrs.size() -
    227 1])); // saving the root pointer to the new segment tree
    228 }
    @@ -803,7 +757,7 @@ Here is the call graph for this function:
    diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.map b/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.map new file mode 100644 index 000000000..846c04693 --- /dev/null +++ b/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.md5 b/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.md5 new file mode 100644 index 000000000..3429b77c6 --- /dev/null +++ b/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.md5 @@ -0,0 +1 @@ +d87ad1a779660183ec12d19bde9a55cd \ No newline at end of file diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.svg b/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.svg new file mode 100644 index 000000000..b0b665455 --- /dev/null +++ b/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.svg @@ -0,0 +1,170 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +range_queries::perSegTree::query + + +Node1 + + +range_queries::perSegTree +::query + + + + + +Node2 + + +range_queries::perSegTree +::query + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +range_queries::perSegTree +::lazy + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +range_queries::perSegTree +::newKid + + + + + +Node3->Node4 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph_org.svg b/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph_org.svg new file mode 100644 index 000000000..e20545307 --- /dev/null +++ b/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph_org.svg @@ -0,0 +1,88 @@ + + + + + + +range_queries::perSegTree::query + + +Node1 + + +range_queries::perSegTree +::query + + + + + +Node2 + + +range_queries::perSegTree +::query + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +range_queries::perSegTree +::lazy + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +range_queries::perSegTree +::newKid + + + + + +Node3->Node4 + + + + + + + + diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.map b/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.map index 70ed96fb2..027cc6931 100644 --- a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.map +++ b/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.map @@ -1,7 +1,8 @@ - - - - - + + + + + + diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.md5 b/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.md5 index 5e6e8b016..93b61e8c3 100644 --- a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.md5 +++ b/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.md5 @@ -1 +1 @@ -49b1384190e585e38d4d2029d902fd45 \ No newline at end of file +991b705637377a9d6d81be7be1aa5a0b \ No newline at end of file diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.svg b/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.svg index cc1819241..f98d89e73 100644 --- a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.svg +++ b/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.svg @@ -4,8 +4,8 @@ - + - + range_queries::perSegTree::query @@ -28,6 +28,15 @@ + + +Node1->Node1 + + + + + + Node2 diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph_org.svg b/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph_org.svg index 740161bbb..af442bc1d 100644 --- a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph_org.svg +++ b/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph_org.svg @@ -4,9 +4,9 @@ - - + + range_queries::perSegTree::query @@ -18,6 +18,15 @@ + + +Node1->Node1 + + + + + + Node2 diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.svg b/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.svg index 324ab295b..dbde85ab2 100644 --- a/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.svg +++ b/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.svg @@ -48,7 +48,7 @@ diff --git a/d8/d2a/namespacea1z26.html b/d8/d2a/namespacea1z26.html index 766f0c40f..ff8e1f7dd 100644 --- a/d8/d2a/namespacea1z26.html +++ b/d8/d2a/namespacea1z26.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: a1z26 Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/d2a/namespacea1z26.html','../../');

    Functions for A1Z26 encryption and decryption implementation. -More...

    +More...

    Detailed Description

    Functions for A1Z26 encryption and decryption implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/d2a/namespacea1z26.html','../../'); diff --git a/d8/d36/namespacecut__rod.html b/d8/d36/namespacecut__rod.html index 60cd7db63..57d06be78 100644 --- a/d8/d36/namespacecut__rod.html +++ b/d8/d36/namespacecut__rod.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: cut_rod Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/d36/namespacecut__rod.html','../../

    Implementation of cutting a rod problem. -More...

    +More...

    Detailed Description

    Implementation of cutting a rod problem.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/d36/namespacecut__rod.html','../../ diff --git a/d8/d38/structquery-members.html b/d8/d38/structquery-members.html index 6143c92b4..c7945154f 100644 --- a/d8/d38/structquery-members.html +++ b/d8/d38/structquery-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('dd/d1b/structquery.html','../../'); in diff --git a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.map b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.map index 05f6597b8..39ae8d3a6 100644 --- a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.map +++ b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.map @@ -1,14 +1,14 @@ - - - - - + + + + + - - - - - - + + + + + + diff --git a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.md5 b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.md5 index 2fef92919..e3129d92c 100644 --- a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.md5 +++ b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.md5 @@ -1 +1 @@ -d829501ad3379c32837a3226b67e5f41 \ No newline at end of file +864119e941297c9ddafe2c5174f0cfc9 \ No newline at end of file diff --git a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg index 0018219bd..0ebf778b7 100644 --- a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg +++ b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg @@ -4,8 +4,8 @@ - + - + data_structures::BloomFilter< T > Node1 - -data_structures::BloomFilter< T > + +data_structures::BloomFilter< T > @@ -31,8 +31,8 @@ Node2 - -data_structures::Bitset + +data_structures::Bitset @@ -40,18 +40,18 @@ Node2->Node1 - - + + - set + set Node3 - -std::vector< std::size_t > + +std::vector< std::size_t > @@ -59,18 +59,18 @@ Node3->Node2 - - + + - data + data Node4 - -std::size_t + +std::size_t @@ -78,29 +78,29 @@ Node4->Node2 - - + + - blockSize + blockSize Node4->Node3 - - + + - elements + elements Node5 - -std::vector< std::function -< std::size_t(T)> > + +std::vector< std::function +< std::size_t(T)> > @@ -108,19 +108,18 @@ Node5->Node1 - - + + - hashFunks + hashFunks Node6 - - -std::function< std -::size_t(T)> + + +T @@ -128,11 +127,11 @@ Node6->Node5 - - + + - elements + elements diff --git a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph_org.svg b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph_org.svg index 5f19a7a9a..db73cbc65 100644 --- a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph_org.svg +++ b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph_org.svg @@ -4,16 +4,16 @@ - - + + data_structures::BloomFilter< T > Node1 - -data_structures::BloomFilter< T > + +data_structures::BloomFilter< T > @@ -21,8 +21,8 @@ Node2 - -data_structures::Bitset + +data_structures::Bitset @@ -30,18 +30,18 @@ Node2->Node1 - - + + - set + set Node3 - -std::vector< std::size_t > + +std::vector< std::size_t > @@ -49,18 +49,18 @@ Node3->Node2 - - + + - data + data Node4 - -std::size_t + +std::size_t @@ -68,29 +68,29 @@ Node4->Node2 - - + + - blockSize + blockSize Node4->Node3 - - + + - elements + elements Node5 - -std::vector< std::function -< std::size_t(T)> > + +std::vector< std::function +< std::size_t(T)> > @@ -98,19 +98,18 @@ Node5->Node1 - - + + - hashFunks + hashFunks Node6 - - -std::function< std -::size_t(T)> + + +T @@ -118,11 +117,11 @@ Node6->Node5 - - + + - elements + elements diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp.html b/d8/d53/modular__inverse__fermat__little__theorem_8cpp.html index 6adf8aaab..f23a1a90e 100644 --- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp.html +++ b/d8/d53/modular__inverse__fermat__little__theorem_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/modular_inverse_fermat_little_theorem.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,11 +117,11 @@ Include dependency graph for modular_inverse_fermat_little_theorem.cpp:
    - + - + - +

    Functions

    int64_t binExpo (int64_t a, int64_t b, int64_t m)
    int64_t binExpo (int64_t a, int64_t b, int64_t m)
     
    bool isPrime (int64_t m)
    bool isPrime (int64_t m)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -163,25 +165,17 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5 \;\text{mod}\; 7 = 1 \;\ int64_t binExpo ( - int64_t  - a, + int64_t a, - int64_t  - b, + int64_t b, - int64_t  - m  - - - - ) - + int64_t m )
    @@ -211,8 +205,7 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5 \;\text{mod}\; 7 = 1 \;\ bool isPrime ( - int64_t  - m) + int64_t m) @@ -242,8 +235,7 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5 \;\text{mod}\; 7 = 1 \;\ int main ( - void  - ) + void ) @@ -256,9 +248,9 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5 \;\text{mod}\; 7 = 1 \;\
    88 std::cout << std::endl << std::endl;
    89 std::cout << "Give input 'a' and 'm' space separated : ";
    90 std::cin >> a >> m;
    -
    91 if (isPrime(m)) {
    +
    91 if (isPrime(m)) {
    92 std::cout << "The modular inverse of a with mod m is (a^(m-2)) : ";
    -
    93 std::cout << binExpo(a, m - 2, m) << std::endl;
    +
    93 std::cout << binExpo(a, m - 2, m) << std::endl;
    94 } else {
    95 std::cout << "m must be a prime number.";
    96 std::cout << std::endl;
    @@ -267,8 +259,8 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5 \;\text{mod}\; 7 = 1 \;\
    std::endl
    T endl(T... args)
    -
    isPrime
    bool isPrime(int64_t m)
    Definition modular_inverse_fermat_little_theorem.cpp:68
    -
    binExpo
    int64_t binExpo(int64_t a, int64_t b, int64_t m)
    Definition modular_inverse_fermat_little_theorem.cpp:52
    +
    isPrime
    bool isPrime(int64_t m)
    Definition modular_inverse_fermat_little_theorem.cpp:68
    +
    binExpo
    int64_t binExpo(int64_t a, int64_t b, int64_t m)
    Definition modular_inverse_fermat_little_theorem.cpp:52
    Here is the call graph for this function:
    @@ -283,7 +275,7 @@ Here is the call graph for this function:
    diff --git a/d8/d55/class_cycle_check-members.html b/d8/d55/class_cycle_check-members.html index 0d20f0039..e5116d1ae 100644 --- a/d8/d55/class_cycle_check-members.html +++ b/d8/d55/class_cycle_check-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,7 +117,7 @@ $(document).ready(function(){initNavTree('d3/dbb/class_cycle_check.html','../../ diff --git a/d8/d61/radix__sort2_8cpp.html b/d8/d61/radix__sort2_8cpp.html index c39e8075e..18728d3f1 100644 --- a/d8/d61/radix__sort2_8cpp.html +++ b/d8/d61/radix__sort2_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/radix_sort2.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,16 +129,16 @@ Namespaces - + - + - + - +

    Functions

    std::vector< uint64_t > sorting::radix_sort::step_ith (uint16_t cur_digit, const std::vector< uint64_t > &ar)
    std::vector< uint64_t > sorting::radix_sort::step_ith (uint16_t cur_digit, const std::vector< uint64_t > &ar)
     Function to sort vector according to current digit using stable sorting.
     
    std::vector< uint64_t > sorting::radix_sort::radix (const std::vector< uint64_t > &ar)
    std::vector< uint64_t > sorting::radix_sort::radix (const std::vector< uint64_t > &ar)
     Function to sort vector digit by digit.
     
    static void tests ()
    static void tests ()
     Function to test the above algorithm.
     
    int main ()
    int main ()
     Main function.
     
    @@ -157,8 +159,7 @@ Functions int main ( - void  - ) + void ) @@ -167,10 +168,10 @@ Functions

    Main function.

    Returns
    0 on exit
    117 {
    -
    118 tests(); // execute the tests
    +
    118 tests(); // execute the tests
    119 return 0;
    120}
    -
    tests
    static void tests()
    Function to test the above algorithm.
    Definition radix_sort2.cpp:102
    +
    tests
    static void tests()
    Function to test the above algorithm.
    Definition radix_sort2.cpp:102
    Here is the call graph for this function:
    @@ -188,8 +189,7 @@ Here is the call graph for this function:
    std::vector< uint64_t > sorting::radix_sort::radix ( - const std::vector< uint64_t > &  - ar) + const std::vector< uint64_t > & ar) @@ -210,7 +210,7 @@ Here is the call graph for this function:
    84 for (int i = 1; max_ele / i > 0;
    85 i *= 10) { // loop breaks when i > max_ele because no further digits
    86 // left to makes changes in aray.
    -
    87 temp = step_ith(i, temp);
    +
    87 temp = step_ith(i, temp);
    88 }
    89 for (uint64_t i : temp) {
    90 std::cout << i << " ";
    @@ -222,7 +222,7 @@ Here is the call graph for this function:
    std::vector::begin
    T begin(T... args)
    std::vector::end
    T end(T... args)
    std::max_element
    T max_element(T... args)
    -
    sorting::radix_sort::step_ith
    std::vector< uint64_t > step_ith(uint16_t cur_digit, const std::vector< uint64_t > &ar)
    Function to sort vector according to current digit using stable sorting.
    Definition radix_sort2.cpp:49
    +
    sorting::radix_sort::step_ith
    std::vector< uint64_t > step_ith(uint16_t cur_digit, const std::vector< uint64_t > &ar)
    Function to sort vector according to current digit using stable sorting.
    Definition radix_sort2.cpp:49
    Here is the call graph for this function:
    @@ -241,19 +241,12 @@ Here is the call graph for this function: std::vector< uint64_t > sorting::radix_sort::step_ith ( - uint16_t  - cur_digit, + uint16_t cur_digit, - const std::vector< uint64_t > &  - ar  - - - - ) - + const std::vector< uint64_t > & ar )
    @@ -312,7 +305,7 @@ Here is the call graph for this function:
    static void tests ( - ) + ) @@ -330,16 +323,16 @@ Here is the call graph for this function:
    102 {
    103 /// Test 1
    104 std::vector<uint64_t> ar1 = {432, 234, 143, 332, 123};
    -
    105 ar1 = sorting::radix_sort::radix(ar1);
    +
    105 ar1 = sorting::radix_sort::radix(ar1);
    106 assert(std::is_sorted(ar1.begin(), ar1.end()));
    107 /// Test 2
    108 std::vector<uint64_t> ar2 = {213, 3214, 123, 111, 112, 142,
    109 133, 132, 32, 12, 113};
    -
    110 ar2 = sorting::radix_sort::radix(ar2);
    +
    110 ar2 = sorting::radix_sort::radix(ar2);
    111 assert(std::is_sorted(ar2.begin(), ar2.end()));
    112}
    std::is_sorted
    T is_sorted(T... args)
    -
    sorting::radix_sort::radix
    std::vector< uint64_t > radix(const std::vector< uint64_t > &ar)
    Function to sort vector digit by digit.
    Definition radix_sort2.cpp:80
    +
    sorting::radix_sort::radix
    std::vector< uint64_t > radix(const std::vector< uint64_t > &ar)
    Function to sort vector digit by digit.
    Definition radix_sort2.cpp:80
    Here is the call graph for this function:
    @@ -354,7 +347,7 @@ Here is the call graph for this function:
    diff --git a/d8/d64/namespaceboruvkas__minimum__spanning__tree.html b/d8/d64/namespaceboruvkas__minimum__spanning__tree.html index 271ecc2cc..f456339a8 100644 --- a/d8/d64/namespaceboruvkas__minimum__spanning__tree.html +++ b/d8/d64/namespaceboruvkas__minimum__spanning__tree.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: boruvkas_minimum_spanning_tree Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/d64/namespaceboruvkas__minimum__spa

    Functions for the [Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) implementation. -More...

    +More...

    Detailed Description

    Functions for the [Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/d64/namespaceboruvkas__minimum__spa diff --git a/d8/d69/classgraph_1_1_h_k_graph.html b/d8/d69/classgraph_1_1_h_k_graph.html index f44a7527c..2d38ab80d 100644 --- a/d8/d69/classgraph_1_1_h_k_graph.html +++ b/d8/d69/classgraph_1_1_h_k_graph.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph::HKGraph Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d8/d69/classgraph_1_1_h_k_graph.html',

    Represents Bipartite graph for Hopcroft Karp implementation. - More...

    + More...

    Collaboration diagram for graph::HKGraph:
    @@ -119,33 +121,33 @@ Public Member Functions  HKGraph ()  Default Constructor for initialization.
      - HKGraph (int m, int n) + HKGraph (int m, int n)  Constructor for initialization.
      -void addEdge (int u, int v) +void addEdge (int u, int v)  function to add edge from u to v
      -bool bfs () +bool bfs ()  This function checks for the possibility of augmented path availability.
      -bool dfs (int u) +bool dfs (int u)  This functions checks whether an augmenting path is available exists beginning with free vertex u.
      -int hopcroftKarpAlgorithm () +int hopcroftKarpAlgorithm ()  This function counts the number of augmenting paths between left and right sides of the Bipartite graph.
      - + - + - + - + @@ -176,19 +178,12 @@ Private Attributes - - + - - - - - - - +

    Private Attributes

    int m {}
    int m {}
     m is the number of vertices on left side of Bipartite Graph
     
    int n {}
    int n {}
     n is the number of vertices on right side of Bipartite Graph
     
    const int NIL {0}
    const int NIL {0}
     
    const int INF {INT_MAX}
    const int INF {INT_MAX}
     
    std::vector< std::list< int > > adj
    graph::HKGraph::HKGraph (int m, int m,
    int n 
    )int n )
    @@ -202,13 +197,13 @@ Private Attributes
    231 {
    -
    232 this->m = m;
    -
    233 this->n = n;
    -
    234 adj = std::vector<std::list<int> >(m + 1);
    +
    232 this->m = m;
    +
    233 this->n = n;
    +
    234 adj = std::vector<std::list<int> >(m + 1);
    235}
    -
    graph::HKGraph::adj
    std::vector< std::list< int > > adj
    adj[u] stores adjacents of left side and 0 is used for dummy vertex
    Definition hopcroft_karp.cpp:73
    -
    graph::HKGraph::m
    int m
    m is the number of vertices on left side of Bipartite Graph
    Definition hopcroft_karp.cpp:68
    -
    graph::HKGraph::n
    int n
    n is the number of vertices on right side of Bipartite Graph
    Definition hopcroft_karp.cpp:69
    +
    graph::HKGraph::adj
    std::vector< std::list< int > > adj
    adj[u] stores adjacents of left side and 0 is used for dummy vertex
    Definition hopcroft_karp.cpp:73
    +
    graph::HKGraph::m
    int m
    m is the number of vertices on left side of Bipartite Graph
    Definition hopcroft_karp.cpp:68
    +
    graph::HKGraph::n
    int n
    n is the number of vertices on right side of Bipartite Graph
    Definition hopcroft_karp.cpp:69
    @@ -223,19 +218,12 @@ Private Attributes void graph::HKGraph::addEdge ( - int  - u, + int u, - int  - v  - - - - ) - + int v )
    @@ -249,7 +237,7 @@ Private Attributes
    243{
    -
    244 adj[u].push_back(v); // Add v to u’s list.
    +
    244 adj[u].push_back(v); // Add v to u’s list.
    245}
    std::vector::push_back
    T push_back(T... args)
    @@ -269,7 +257,7 @@ Here is the call graph for this function:
    bool graph::HKGraph::bfs ( - ) + ) @@ -283,22 +271,22 @@ Here is the call graph for this function:
    135 std::queue<int> q; // an integer queue for bfs
    136
    137 // First layer of vertices (set distance as 0)
    -
    138 for (int u = 1; u <= m; u++)
    +
    138 for (int u = 1; u <= m; u++)
    139 {
    140 // If this is a free vertex, add it to queue
    -
    141 if (pair_u[u] == NIL){
    +
    141 if (pair_u[u] == NIL){
    142
    -
    143 dist[u] = 0; // u is not matched so distance is 0
    +
    143 dist[u] = 0; // u is not matched so distance is 0
    144 q.push(u);
    145 }
    146
    147 else{
    -
    148 dist[u] = INF; // set distance as infinite so that this vertex is considered next time for availibility
    +
    148 dist[u] = INF; // set distance as infinite so that this vertex is considered next time for availibility
    149 }
    150 }
    151
    152
    -
    153 dist[NIL] = INF; // Initialize distance to NIL as infinite
    +
    153 dist[NIL] = INF; // Initialize distance to NIL as infinite
    154
    155 // q is going to contain vertices of left side only.
    156 while (!q.empty())
    @@ -307,19 +295,19 @@ Here is the call graph for this function:
    159 q.pop();
    160
    161 // If this node is not NIL and can provide a shorter path to NIL then
    -
    162 if (dist[u] < dist[NIL])
    +
    162 if (dist[u] < dist[NIL])
    163 {
    164 // Get all the adjacent vertices of the dequeued vertex u
    -
    165 std::list<int>::iterator it;
    -
    166 for (it = adj[u].begin(); it != adj[u].end(); ++it)
    +
    165 std::list<int>::iterator it;
    +
    166 for (it = adj[u].begin(); it != adj[u].end(); ++it)
    167 {
    168 int v = *it;
    169
    170 // If pair of v is not considered so far i.e. (v, pair_v[v]) is not yet explored edge.
    -
    171 if (dist[pair_v[v]] == INF)
    +
    171 if (dist[pair_v[v]] == INF)
    172 {
    -
    173 dist[pair_v[v]] = dist[u] + 1;
    -
    174 q.push(pair_v[v]); // Consider the pair and push it to queue
    +
    173 dist[pair_v[v]] = dist[u] + 1;
    +
    174 q.push(pair_v[v]); // Consider the pair and push it to queue
    175 }
    176 }
    177 }
    @@ -327,14 +315,13 @@ Here is the call graph for this function:
    179
    180
    181
    -
    182 return (dist[NIL] != INF); // If we could come back to NIL using alternating path of distinct vertices then there is an augmenting path available
    +
    182 return (dist[NIL] != INF); // If we could come back to NIL using alternating path of distinct vertices then there is an augmenting path available
    183}
    std::begin
    T begin(T... args)
    -
    graph::HKGraph::dist
    std::vector< int > dist
    dist represents the distance between vertex 'u' and vertex 'v'
    Definition hopcroft_karp.cpp:77
    -
    graph::HKGraph::pair_u
    std::vector< int > pair_u
    value of vertex 'u' ranges from 1 to m
    Definition hopcroft_karp.cpp:75
    -
    graph::HKGraph::pair_v
    std::vector< int > pair_v
    value of vertex 'v' ranges from 1 to n
    Definition hopcroft_karp.cpp:76
    +
    graph::HKGraph::dist
    std::vector< int > dist
    dist represents the distance between vertex 'u' and vertex 'v'
    Definition hopcroft_karp.cpp:77
    +
    graph::HKGraph::pair_u
    std::vector< int > pair_u
    value of vertex 'u' ranges from 1 to m
    Definition hopcroft_karp.cpp:75
    +
    graph::HKGraph::pair_v
    std::vector< int > pair_v
    value of vertex 'v' ranges from 1 to n
    Definition hopcroft_karp.cpp:76
    std::vector::end
    T end(T... args)
    -
    Here is the call graph for this function:
    @@ -353,8 +340,7 @@ Here is the call graph for this function: bool graph::HKGraph::dfs ( - int  - u) + int u) @@ -373,32 +359,32 @@ Here is the call graph for this function:
    192{
    193 if (u != NIL)
    194 {
    -
    195 std::list<int>::iterator it;
    -
    196 for (it = adj[u].begin(); it != adj[u].end(); ++it)
    +
    195 std::list<int>::iterator it;
    +
    196 for (it = adj[u].begin(); it != adj[u].end(); ++it)
    197 {
    198
    199 int v = *it; // Adjacent vertex of u
    200
    201 // Follow the distances set by BFS search
    -
    202 if (dist[pair_v[v]] == dist[u] + 1)
    +
    202 if (dist[pair_v[v]] == dist[u] + 1)
    203 {
    204 // If dfs for pair of v also return true then new matching possible, store the matching
    -
    205 if (dfs(pair_v[v]) == true)
    +
    205 if (dfs(pair_v[v]) == true)
    206 {
    -
    207 pair_v[v] = u;
    -
    208 pair_u[u] = v;
    +
    207 pair_v[v] = u;
    +
    208 pair_u[u] = v;
    209 return true;
    210 }
    211 }
    212 }
    213
    214
    -
    215 dist[u] = INF; // If there is no augmenting path beginning with u then set distance to infinite.
    +
    215 dist[u] = INF; // If there is no augmenting path beginning with u then set distance to infinite.
    216 return false;
    217 }
    218 return true;
    219}
    -
    graph::HKGraph::dfs
    bool dfs(int u)
    This functions checks whether an augmenting path is available exists beginning with free vertex u.
    Definition hopcroft_karp.cpp:191
    +
    graph::HKGraph::dfs
    bool dfs(int u)
    This functions checks whether an augmenting path is available exists beginning with free vertex u.
    Definition hopcroft_karp.cpp:191
    Here is the call graph for this function:
    @@ -416,7 +402,7 @@ Here is the call graph for this function:
    int graph::HKGraph::hopcroftKarpAlgorithm ( - ) + ) @@ -428,33 +414,33 @@ Here is the call graph for this function:
    97
    98 // pair_u[u] stores pair of u in matching on left side of Bipartite Graph.
    99 // If u doesn't have any pair, then pair_u[u] is NIL
    -
    100 pair_u = std::vector<int>(m + 1,NIL);
    +
    100 pair_u = std::vector<int>(m + 1,NIL);
    101
    102 // pair_v[v] stores pair of v in matching on right side of Biparite Graph.
    103 // If v doesn't have any pair, then pair_u[v] is NIL
    -
    104 pair_v = std::vector<int>(n + 1,NIL);
    +
    104 pair_v = std::vector<int>(n + 1,NIL);
    105
    -
    106 dist = std::vector<int>(m + 1); // dist[u] stores distance of left side vertices
    +
    106 dist = std::vector<int>(m + 1); // dist[u] stores distance of left side vertices
    107
    108 int result = 0; // Initialize result
    109
    110 // Keep updating the result while there is an augmenting path possible.
    -
    111 while (bfs())
    +
    111 while (bfs())
    112 {
    113 // Find a free vertex to check for a matching
    -
    114 for (int u = 1; u <= m; u++){
    +
    114 for (int u = 1; u <= m; u++){
    115
    116 // If current vertex is free and there is
    117 // an augmenting path from current vertex
    118 // then increment the result
    -
    119 if (pair_u[u] == NIL && dfs(u)){
    +
    119 if (pair_u[u] == NIL && dfs(u)){
    120 result++;
    121 }
    122 }
    123 }
    124 return result;
    125}
    -
    graph::HKGraph::bfs
    bool bfs()
    This function checks for the possibility of augmented path availability.
    Definition hopcroft_karp.cpp:133
    +
    graph::HKGraph::bfs
    bool bfs()
    This function checks for the possibility of augmented path availability.
    Definition hopcroft_karp.cpp:133
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition fibonacci_sum.cpp:76
    Here is the call graph for this function:
    @@ -570,7 +556,7 @@ Here is the call graph for this function: diff --git a/d8/d6c/line__segment__intersection_8cpp.html b/d8/d6c/line__segment__intersection_8cpp.html index d065a030d..7638e4b93 100644 --- a/d8/d6c/line__segment__intersection_8cpp.html +++ b/d8/d6c/line__segment__intersection_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: geometry/line_segment_intersection.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -123,7 +125,7 @@ Classes - +

    Functions

    int main ()
    int main ()
     

    Detailed Description

    @@ -138,8 +140,7 @@ Functions int main ( - void  - ) + void ) @@ -179,7 +180,7 @@ Here is the call graph for this function:
    diff --git a/d8/d72/class_r_btree.html b/d8/d72/class_r_btree.html index 56f7d260a..12b5688a4 100644 --- a/d8/d72/class_r_btree.html +++ b/d8/d72/class_r_btree.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: RBtree Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,25 +114,25 @@ Collaboration diagram for RBtree:
    - + - + - + - + - + - + - + - + - + - +

    Public Member Functions

    void insert ()
    void insert ()
     
    void insertfix (node *)
    void insertfix (node *)
     
    void leftrotate (node *)
    void leftrotate (node *)
     
    void rightrotate (node *)
    void rightrotate (node *)
     
    void del ()
    void del ()
     
    node * successor (node *)
    node * successor (node *)
     
    void delfix (node *)
    void delfix (node *)
     
    void disp ()
    void disp ()
     
    void display (node *)
    void display (node *)
     
    void search ()
    void search ()
     
    - +

    @@ -155,7 +157,7 @@ Private Attributes

    RBtree::RBtree ())
    @@ -182,7 +184,7 @@ Private Attributes void RBtree::del ( - ) + ) @@ -288,8 +290,7 @@ Private Attributes void RBtree::delfix ( - node *  - p) + node * p) @@ -376,7 +377,7 @@ Private Attributes void RBtree::disp ( - ) + ) @@ -396,8 +397,7 @@ Private Attributes void RBtree::display ( - node *  - p) + node * p) @@ -459,7 +459,7 @@ Private Attributes void RBtree::insert ( - ) + ) @@ -469,7 +469,7 @@ Private Attributes
    37 cout << "\nEnter key of the node to be inserted: ";
    38 cin >> z;
    39 node *p, *q;
    -
    40 node *t = new node;
    +
    40 node *t = new node;
    41 t->key = z;
    42 t->left = NULL;
    43 t->right = NULL;
    @@ -499,6 +499,7 @@ Private Attributes
    67 }
    68 insertfix(t);
    69}
    +
    node
    struct node { int data; int height; struct node *left; struct node *right;} node
    for std::queue
    Definition avltree.cpp:13
    @@ -511,8 +512,7 @@ Private Attributes void RBtree::insertfix ( - node *  - t) + node * t) @@ -593,8 +593,7 @@ Private Attributes void RBtree::leftrotate ( - node *  - p) + node * p) @@ -639,8 +638,7 @@ Private Attributes void RBtree::rightrotate ( - node *  - p) + node * p) @@ -685,7 +683,7 @@ Private Attributes void RBtree::search ( - ) + ) @@ -752,8 +750,7 @@ Private Attributes node * RBtree::successor ( - node *  - p) + node * p) @@ -786,7 +783,7 @@ Private Attributes diff --git a/d8/d76/morse__code_8cpp.html b/d8/d76/morse__code_8cpp.html index eddc7bc33..133af9968 100644 --- a/d8/d76/morse__code_8cpp.html +++ b/d8/d76/morse__code_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ciphers/morse_code.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,18 +129,18 @@ Namespaces - + - + - + - + - + - +

    Functions

    std::string ciphers::morse::char_to_morse (const char &c)
    std::string ciphers::morse::char_to_morse (const char &c)
     
    char ciphers::morse::morse_to_char (const std::string &s)
    char ciphers::morse::morse_to_char (const std::string &s)
     
    std::string ciphers::morse::encrypt (const std::string &text)
    std::string ciphers::morse::encrypt (const std::string &text)
     
    std::string ciphers::morse::decrypt (const std::string &text)
    std::string ciphers::morse::decrypt (const std::string &text)
     
    static void test ()
    static void test ()
     Function to test above algorithm.
     
    int main ()
    int main ()
     Main function.
     
    @@ -156,8 +158,7 @@ Functions std::string ciphers::morse::char_to_morse ( - const char &  - c) + const char & c) @@ -269,8 +270,7 @@ Here is the call graph for this function:
    std::string ciphers::morse::decrypt ( - const std::string &  - text) + const std::string & text) @@ -299,14 +299,14 @@ Here is the call graph for this function:
    230 // Traversing through each morse code string
    231 for (const std::string &s : splits) {
    232 // Add corresponding character
    -
    233 decrypted_text += ciphers::morse::morse_to_char(s);
    +
    233 decrypted_text += ciphers::morse::morse_to_char(s);
    234 }
    235
    236 return decrypted_text; // Returning decrypted text
    237}
    std::string::find
    T find(T... args)
    -
    ciphers::morse::morse_to_char
    char morse_to_char(const std::string &s)
    Definition morse_code.cpp:118
    +
    ciphers::morse::morse_to_char
    char morse_to_char(const std::string &s)
    Definition morse_code.cpp:118
    std::vector::push_back
    T push_back(T... args)
    std::string::substr
    T substr(T... args)
    @@ -328,8 +328,7 @@ Here is the call graph for this function: std::string ciphers::morse::encrypt ( - const std::string &  - text) + const std::string & text) @@ -346,11 +345,11 @@ Here is the call graph for this function:
    204 // Going through each character of text and converting it
    205 // to morse representation
    206 for (const char &c : text) {
    -
    207 encrypted_text += ciphers::morse::char_to_morse(c) + " ";
    +
    207 encrypted_text += ciphers::morse::char_to_morse(c) + " ";
    208 }
    209 return encrypted_text; // Returning encrypted text
    210}
    -
    ciphers::morse::char_to_morse
    std::string char_to_morse(const char &c)
    Definition morse_code.cpp:33
    +
    ciphers::morse::char_to_morse
    std::string char_to_morse(const char &c)
    Definition morse_code.cpp:33
    Here is the call graph for this function:
    @@ -368,8 +367,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -379,10 +377,10 @@ Here is the call graph for this function:
    Returns
    0 on exit
    268 {
    269 // Testing
    -
    270 test();
    +
    270 test();
    271 return 0;
    272}
    -
    test
    static void test()
    Function to test above algorithm.
    Definition morse_code.cpp:245
    +
    test
    static void test()
    Function to test above algorithm.
    Definition morse_code.cpp:245
    Here is the call graph for this function:
    @@ -400,8 +398,7 @@ Here is the call graph for this function:
    char ciphers::morse::morse_to_char ( - const std::string &  - s) + const std::string & s) @@ -512,7 +509,7 @@ Here is the call graph for this function: static void test ( - ) + ) @@ -528,23 +525,23 @@ Here is the call graph for this function:
    245 {
    246 // Test 1
    247 std::string text1 = "01234567890";
    -
    248 std::string encrypted1 = ciphers::morse::encrypt(text1);
    -
    249 std::string decrypted1 = ciphers::morse::decrypt(encrypted1);
    +
    248 std::string encrypted1 = ciphers::morse::encrypt(text1);
    +
    249 std::string decrypted1 = ciphers::morse::decrypt(encrypted1);
    250 assert(text1 == decrypted1);
    251 std::cout << "Original text : " << text1 << std::endl;
    252 std::cout << "Encrypted text : " << encrypted1 << std::endl;
    253 std::cout << "Decrypted text : " << decrypted1 << std::endl;
    254 // Test 2
    255 std::string text2 = "abcdefghijklmnopqrstuvwxyz";
    -
    256 std::string encrypted2 = ciphers::morse::encrypt(text2);
    -
    257 std::string decrypted2 = ciphers::morse::decrypt(encrypted2);
    +
    256 std::string encrypted2 = ciphers::morse::encrypt(text2);
    +
    257 std::string decrypted2 = ciphers::morse::decrypt(encrypted2);
    258 assert(text2 == decrypted2);
    259 std::cout << "Original text : " << text2 << std::endl;
    260 std::cout << "Encrypted text : " << encrypted2 << std::endl;
    261 std::cout << "Decrypted text : " << decrypted2 << std::endl;
    262}
    -
    ciphers::morse::encrypt
    std::string encrypt(const std::string &text)
    Definition morse_code.cpp:202
    -
    ciphers::morse::decrypt
    std::string decrypt(const std::string &text)
    Definition morse_code.cpp:216
    +
    ciphers::morse::encrypt
    std::string encrypt(const std::string &text)
    Definition morse_code.cpp:202
    +
    ciphers::morse::decrypt
    std::string decrypt(const std::string &text)
    Definition morse_code.cpp:216
    Here is the call graph for this function:
    @@ -559,7 +556,7 @@ Here is the call graph for this function:
    diff --git a/d8/d77/namespacemachine__learning.html b/d8/d77/namespacemachine__learning.html index c0d2ce7c9..b32a58c4b 100644 --- a/d8/d77/namespacemachine__learning.html +++ b/d8/d77/namespacemachine__learning.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: machine_learning Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d8/d77/namespacemachine__learning.html

    A* search algorithm -More...

    +More...

    @@ -115,86 +117,86 @@ Classes

    Classes

    - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - +

    Functions

    int save_u_matrix (const char *fname, const std::vector< std::vector< std::valarray< double > > > &W)
    int save_u_matrix (const char *fname, const std::vector< std::vector< std::valarray< double > > > &W)
     
    double update_weights (const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)
    double update_weights (const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)
     
    void kohonen_som (const std::vector< std::valarray< double > > &X, std::vector< std::vector< std::valarray< double > > > *W, double alpha_min)
    void kohonen_som (const std::vector< std::valarray< double > > &X, std::vector< std::vector< std::valarray< double > > > *W, double alpha_min)
     
    void update_weights (const std::valarray< double > &x, std::vector< std::valarray< double > > *W, std::valarray< double > *D, double alpha, int R)
    void update_weights (const std::valarray< double > &x, std::vector< std::valarray< double > > *W, std::valarray< double > *D, double alpha, int R)
     
    void kohonen_som_tracer (const std::vector< std::valarray< double > > &X, std::vector< std::valarray< double > > *W, double alpha_min)
    void kohonen_som_tracer (const std::vector< std::valarray< double > > &X, std::vector< std::valarray< double > > *W, double alpha_min)
     
    template<typename T >
    std::ostream & operator<< (std::ostream &out, std::vector< std::valarray< T > > const &A)
    std::ostream & operator<< (std::ostream &out, std::vector< std::valarray< T > > const &A)
     
    template<typename T >
    std::ostream & operator<< (std::ostream &out, const std::pair< T, T > &A)
    std::ostream & operator<< (std::ostream &out, const std::pair< T, T > &A)
     
    template<typename T >
    std::ostream & operator<< (std::ostream &out, const std::valarray< T > &A)
    std::ostream & operator<< (std::ostream &out, const std::valarray< T > &A)
     
    template<typename T >
    std::valarray< T > insert_element (const std::valarray< T > &A, const T &ele)
    std::valarray< T > insert_element (const std::valarray< T > &A, const T &ele)
     
    template<typename T >
    std::valarray< T > pop_front (const std::valarray< T > &A)
    std::valarray< T > pop_front (const std::valarray< T > &A)
     
    template<typename T >
    std::valarray< T > pop_back (const std::valarray< T > &A)
    std::valarray< T > pop_back (const std::valarray< T > &A)
     
    template<typename T >
    void equal_shuffle (std::vector< std::vector< std::valarray< T > > > &A, std::vector< std::vector< std::valarray< T > > > &B)
    void equal_shuffle (std::vector< std::vector< std::valarray< T > > > &A, std::vector< std::vector< std::valarray< T > > > &B)
     
    template<typename T >
    void uniform_random_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape, const T &low, const T &high)
    void uniform_random_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape, const T &low, const T &high)
     
    template<typename T >
    void unit_matrix_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape)
    void unit_matrix_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape)
     
    template<typename T >
    void zeroes_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape)
    void zeroes_initialization (std::vector< std::valarray< T > > &A, const std::pair< size_t, size_t > &shape)
     
    template<typename T >
    T sum (const std::vector< std::valarray< T > > &A)
    T sum (const std::vector< std::valarray< T > > &A)
     
    template<typename T >
    std::pair< size_t, size_t > get_shape (const std::vector< std::valarray< T > > &A)
    std::pair< size_t, size_t > get_shape (const std::vector< std::valarray< T > > &A)
     
    template<typename T >
    std::vector< std::vector< std::valarray< T > > > minmax_scaler (const std::vector< std::vector< std::valarray< T > > > &A, const T &low, const T &high)
    std::vector< std::vector< std::valarray< T > > > minmax_scaler (const std::vector< std::vector< std::valarray< T > > > &A, const T &low, const T &high)
     
    template<typename T >
    size_t argmax (const std::vector< std::valarray< T > > &A)
    size_t argmax (const std::vector< std::valarray< T > > &A)
     
    template<typename T >
    std::vector< std::valarray< T > > apply_function (const std::vector< std::valarray< T > > &A, T(*func)(const T &))
    std::vector< std::valarray< T > > apply_function (const std::vector< std::valarray< T > > &A, T(*func)(const T &))
     
    template<typename T >
    std::vector< std::valarray< T > > operator* (const std::vector< std::valarray< T > > &A, const T &val)
    std::vector< std::valarray< T > > operator* (const std::vector< std::valarray< T > > &A, const T &val)
     
    template<typename T >
    std::vector< std::valarray< T > > operator/ (const std::vector< std::valarray< T > > &A, const T &val)
    std::vector< std::valarray< T > > operator/ (const std::vector< std::valarray< T > > &A, const T &val)
     
    template<typename T >
    std::vector< std::valarray< T > > transpose (const std::vector< std::valarray< T > > &A)
    std::vector< std::valarray< T > > transpose (const std::vector< std::valarray< T > > &A)
     
    template<typename T >
    std::vector< std::valarray< T > > operator+ (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
    std::vector< std::valarray< T > > operator+ (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
     
    template<typename T >
    std::vector< std::valarray< T > > operator- (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
    std::vector< std::valarray< T > > operator- (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
     
    template<typename T >
    std::vector< std::valarray< T > > multiply (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
    std::vector< std::valarray< T > > multiply (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
     
    template<typename T >
    std::vector< std::valarray< T > > hadamard_product (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
    std::vector< std::valarray< T > > hadamard_product (const std::vector< std::valarray< T > > &A, const std::vector< std::valarray< T > > &B)
     
    - +

    Variables

    constexpr double MIN_DISTANCE = 1e-4
    constexpr double MIN_DISTANCE = 1e-4
     

    Detailed Description

    @@ -219,19 +221,12 @@ template<typename T >
    std::vector< std::valarray< T > > machine_learning::apply_function ( - const std::vector< std::valarray< T > > &  - A, + const std::vector< std::valarray< T > > & A, - T(*)(const T &)  - func  - - - - ) - + T(*)(const T &) func )
    @@ -272,8 +267,7 @@ template<typename T >
    size_t machine_learning::argmax ( - const std::vector< std::valarray< T > > &  - A) + const std::vector< std::valarray< T > > & A) @@ -292,7 +286,7 @@ template<typename T >
    Returns
    index of maximum element
    307 {
    -
    308 const auto shape = get_shape(A);
    +
    308 const auto shape = get_shape(A);
    309 // As this function is used on predicted (or target) vector, shape should be
    310 // (1, X)
    311 if (shape.first != 1) {
    @@ -311,7 +305,7 @@ template<typename T >
    std::endl
    T endl(T... args)
    std::exit
    T exit(T... args)
    std::max_element
    T max_element(T... args)
    -
    machine_learning::get_shape
    std::pair< size_t, size_t > get_shape(const std::vector< std::valarray< T > > &A)
    Definition vector_ops.hpp:247
    +
    machine_learning::get_shape
    std::pair< size_t, size_t > get_shape(const std::vector< std::valarray< T > > &A)
    Definition vector_ops.hpp:247
    Here is the call graph for this function:
    @@ -331,19 +325,12 @@ template<typename T >
    void machine_learning::equal_shuffle ( - std::vector< std::vector< std::valarray< T > > > &  - A, + std::vector< std::vector< std::valarray< T > > > & A, - std::vector< std::vector< std::valarray< T > > > &  - B  - - - - ) - + std::vector< std::vector< std::valarray< T > > > & B )
    @@ -403,8 +390,7 @@ template<typename T >
    std::pair< size_t, size_t > machine_learning::get_shape ( - const std::vector< std::valarray< T > > &  - A) + const std::vector< std::valarray< T > > & A) @@ -454,19 +440,12 @@ template<typename T > std::vector< std::valarray< T > > machine_learning::hadamard_product ( - const std::vector< std::valarray< T > > &  - A, + const std::vector< std::valarray< T > > & A, - const std::vector< std::valarray< T > > &  - B  - - - - ) - + const std::vector< std::valarray< T > > & B )
    @@ -485,8 +464,8 @@ template<typename T >
    Returns
    new resultant vector
    496 {
    -
    497 const auto shape_a = get_shape(A);
    -
    498 const auto shape_b = get_shape(B);
    +
    497 const auto shape_a = get_shape(A);
    +
    498 const auto shape_b = get_shape(B);
    499 // If vectors are not eligible for hadamard product
    500 if (shape_a.first != shape_b.first || shape_a.second != shape_b.second) {
    501 std::cerr << "ERROR (" << __func__ << ") : ";
    @@ -520,19 +499,12 @@ template<typename T >
    std::valarray< T > machine_learning::insert_element ( - const std::valarray< T > &  - A, + const std::valarray< T > & A, - const T &  - ele  - - - - ) - + const T & ele )
    @@ -572,25 +544,17 @@ template<typename T >
    void machine_learning::kohonen_som ( - const std::vector< std::valarray< double > > &  - X, + const std::vector< std::valarray< double > > & X, - std::vector< std::vector< std::valarray< double > > > *  - W, + std::vector< std::vector< std::valarray< double > > > * W, - double  - alpha_min  - - - - ) - + double alpha_min )
    @@ -622,7 +586,7 @@ template<typename T >
    287 // Loop for each sample pattern in the data set
    288 for (int sample = 0; sample < num_samples; sample++) {
    289 // update weights for the current input pattern sample
    -
    290 dmin += update_weights(X[sample], W, &D, alpha, R);
    +
    290 dmin += update_weights(X[sample], W, &D, alpha, R);
    291 }
    292
    293 // every 100th iteration, reduce the neighborhood range
    @@ -645,7 +609,7 @@ template<typename T >
    310
    311 std::cout << "\n";
    312}
    -
    machine_learning::update_weights
    double update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)
    Definition kohonen_som_topology.cpp:200
    +
    machine_learning::update_weights
    double update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)
    Definition kohonen_som_topology.cpp:200
    Here is the call graph for this function:
    @@ -663,25 +627,17 @@ Here is the call graph for this function:
    void machine_learning::kohonen_som_tracer ( - const std::vector< std::valarray< double > > &  - X, + const std::vector< std::valarray< double > > & X, - std::vector< std::valarray< double > > *  - W, + std::vector< std::valarray< double > > * W, - double  - alpha_min  - - - - ) - + double alpha_min )
    @@ -708,7 +664,7 @@ Here is the call graph for this function:
    162 // Loop for each sample pattern in the data set
    163 for (int sample = 0; sample < num_samples; sample++) {
    164 // update weights for the current input pattern sample
    -
    165 update_weights(X[sample], W, &D, alpha, R);
    +
    165 update_weights(X[sample], W, &D, alpha, R);
    166 }
    167
    168 // every 10th iteration, reduce the neighborhood range
    @@ -739,25 +695,17 @@ template<typename T > std::vector< std::vector< std::valarray< T > > > machine_learning::minmax_scaler ( - const std::vector< std::vector< std::valarray< T > > > &  - A, + const std::vector< std::vector< std::valarray< T > > > & A, - const T &  - low, + const T & low, - const T &  - high  - - - - ) - + const T & high )
    @@ -779,7 +727,7 @@ template<typename T >
    271 {
    272 std::vector<std::vector<std::valarray<T>>> B =
    273 A; // Copying into new vector B
    -
    274 const auto shape = get_shape(B[0]); // Storing shape of B's every element
    +
    274 const auto shape = get_shape(B[0]); // Storing shape of B's every element
    275 // As this function is used for scaling training data vector should be of
    276 // shape (1, X)
    277 if (shape.first != 1) {
    @@ -825,19 +773,12 @@ template<typename T >
    std::vector< std::valarray< T > > machine_learning::multiply ( - const std::vector< std::valarray< T > > &  - A, + const std::vector< std::valarray< T > > & A, - const std::vector< std::valarray< T > > &  - B  - - - - ) - + const std::vector< std::valarray< T > > & B )
    @@ -856,8 +797,8 @@ template<typename T >
    Returns
    new resultant vector
    461 {
    -
    462 const auto shape_a = get_shape(A);
    -
    463 const auto shape_b = get_shape(B);
    +
    462 const auto shape_a = get_shape(A);
    +
    463 const auto shape_b = get_shape(B);
    464 // If vectors are not eligible for multiplication
    465 if (shape_a.second != shape_b.first) {
    466 std::cerr << "ERROR (" << __func__ << ") : ";
    @@ -898,19 +839,12 @@ template<typename T >
    std::vector< std::valarray< T > > machine_learning::operator* ( - const std::vector< std::valarray< T > > &  - A, + const std::vector< std::valarray< T > > & A, - const T &  - val  - - - - ) - + const T & val )
    @@ -950,19 +884,12 @@ template<typename T >
    std::vector< std::valarray< T > > machine_learning::operator+ ( - const std::vector< std::valarray< T > > &  - A, + const std::vector< std::valarray< T > > & A, - const std::vector< std::valarray< T > > &  - B  - - - - ) - + const std::vector< std::valarray< T > > & B )
    @@ -981,8 +908,8 @@ template<typename T >
    Returns
    new resultant vector
    408 {
    -
    409 const auto shape_a = get_shape(A);
    -
    410 const auto shape_b = get_shape(B);
    +
    409 const auto shape_a = get_shape(A);
    +
    410 const auto shape_b = get_shape(B);
    411 // If vectors don't have equal shape
    412 if (shape_a.first != shape_b.first || shape_a.second != shape_b.second) {
    413 std::cerr << "ERROR (" << __func__ << ") : ";
    @@ -1015,19 +942,12 @@ template<typename T >
    std::vector< std::valarray< T > > machine_learning::operator- ( - const std::vector< std::valarray< T > > &  - A, + const std::vector< std::valarray< T > > & A, - const std::vector< std::valarray< T > > &  - B  - - - - ) - + const std::vector< std::valarray< T > > & B )
    @@ -1046,8 +966,8 @@ template<typename T >
    Returns
    new resultant vector
    435 {
    -
    436 const auto shape_a = get_shape(A);
    -
    437 const auto shape_b = get_shape(B);
    +
    436 const auto shape_a = get_shape(A);
    +
    437 const auto shape_b = get_shape(B);
    438 // If vectors don't have equal shape
    439 if (shape_a.first != shape_b.first || shape_a.second != shape_b.second) {
    440 std::cerr << "ERROR (" << __func__ << ") : ";
    @@ -1080,19 +1000,12 @@ template<typename T >
    std::vector< std::valarray< T > > machine_learning::operator/ ( - const std::vector< std::valarray< T > > &  - A, + const std::vector< std::valarray< T > > & A, - const T &  - val  - - - - ) - + const T & val )
    @@ -1132,19 +1045,12 @@ template<typename T >
    std::ostream & machine_learning::operator<< ( - std::ostream &  - out, + std::ostream & out, - const std::pair< T, T > &  - A  - - - - ) - + const std::pair< T, T > & A )
    @@ -1172,7 +1078,7 @@ template<typename T >
    Here is the call graph for this function:
    -
    +
    @@ -1188,19 +1094,12 @@ template<typename T > std::ostream & machine_learning::operator<< ( - std::ostream &  - out, + std::ostream & out, - const std::valarray< T > &  - A  - - - - ) - + const std::valarray< T > & A )
    @@ -1229,7 +1128,7 @@ template<typename T >
    Here is the call graph for this function:
    -
    +
    @@ -1245,19 +1144,12 @@ template<typename T > std::ostream & machine_learning::operator<< ( - std::ostream &  - out, + std::ostream & out, - std::vector< std::valarray< T > > const &  - A  - - - - ) - + std::vector< std::valarray< T > > const & A )
    @@ -1288,7 +1180,7 @@ template<typename T >
    Here is the call graph for this function:
    -
    +
    @@ -1304,8 +1196,7 @@ template<typename T > std::valarray< T > machine_learning::pop_back ( - const std::valarray< T > &  - A) + const std::valarray< T > & A) @@ -1346,8 +1237,7 @@ template<typename T > std::valarray< T > machine_learning::pop_front ( - const std::valarray< T > &  - A) + const std::valarray< T > & A) @@ -1386,19 +1276,12 @@ template<typename T > int machine_learning::save_u_matrix ( - const char *  - fname, + const char * fname, - const std::vector< std::vector< std::valarray< double > > > &  - W  - - - - ) - + const std::vector< std::vector< std::valarray< double > > > & W )
    @@ -1482,8 +1365,7 @@ template<typename T >
    T machine_learning::sum ( - const std::vector< std::valarray< T > > &  - A) + const std::vector< std::valarray< T > > & A) @@ -1522,8 +1404,7 @@ template<typename T > std::vector< std::valarray< T > > machine_learning::transpose ( - const std::vector< std::valarray< T > > &  - A) + const std::vector< std::valarray< T > > & A) @@ -1542,7 +1423,7 @@ template<typename T >
    Returns
    new resultant vector
    383 {
    -
    384 const auto shape = get_shape(A); // Current shape of vector
    +
    384 const auto shape = get_shape(A); // Current shape of vector
    385 std::vector<std::valarray<T>> B; // New vector to store result
    386 // Storing transpose values of A in B
    387 for (size_t j = 0; j < shape.second; j++) {
    @@ -1574,31 +1455,22 @@ template<typename T >
    void machine_learning::uniform_random_initialization ( - std::vector< std::valarray< T > > &  - A, + std::vector< std::valarray< T > > & A, - const std::pair< size_t, size_t > &  - shape, + const std::pair< size_t, size_t > & shape, - const T &  - low, + const T & low, - const T &  - high  - - - - ) - + const T & high )
    @@ -1656,19 +1528,12 @@ template<typename T >
    void machine_learning::unit_matrix_initialization ( - std::vector< std::valarray< T > > &  - A, + std::vector< std::valarray< T > > & A, - const std::pair< size_t, size_t > &  - shape  - - - - ) - + const std::pair< size_t, size_t > & shape )
    @@ -1708,37 +1573,27 @@ template<typename T >
    void machine_learning::update_weights ( - const std::valarray< double > &  - x, + const std::valarray< double > & x, - std::vector< std::valarray< double > > *  - W, + std::vector< std::valarray< double > > * W, - std::valarray< double > *  - D, + std::valarray< double > * D, - double  - alpha, + double alpha, - int  - R  - - - - ) - + int R )
    @@ -1806,37 +1661,27 @@ Here is the call graph for this function:
    double machine_learning::update_weights ( - const std::valarray< double > &  - X, + const std::valarray< double > & X, - std::vector< std::vector< std::valarray< double > > > *  - W, + std::vector< std::vector< std::valarray< double > > > * W, - std::vector< std::valarray< double > > *  - D, + std::vector< std::valarray< double > > * D, - double  - alpha, + double alpha, - int  - R  - - - - ) - + int R )
    @@ -1870,7 +1715,7 @@ Here is the call graph for this function:
    218 // compute Euclidian distance of each output
    219 // point from the current sample
    220 auto d = ((*W)[x][y] - X);
    -
    221 (*D)[x][y] = (d * d).sum();
    +
    221 (*D)[x][y] = (d * d).sum();
    222 (*D)[x][y] = std::sqrt((*D)[x][y]);
    223 }
    224 }
    @@ -1911,7 +1756,7 @@ Here is the call graph for this function:
    259}
    std::exp
    T exp(T... args)
    get_min_2d
    void get_min_2d(const std::vector< std::valarray< double > > &X, double *val, int *x_idx, int *y_idx)
    Definition kohonen_som_topology.cpp:105
    -
    machine_learning::sum
    T sum(const std::vector< std::valarray< T > > &A)
    Definition vector_ops.hpp:232
    +
    machine_learning::sum
    T sum(const std::vector< std::valarray< T > > &A)
    Definition vector_ops.hpp:232
    Here is the call graph for this function:
    @@ -1931,19 +1776,12 @@ template<typename T >
    void machine_learning::zeroes_initialization ( - std::vector< std::valarray< T > > &  - A, + std::vector< std::valarray< T > > & A, - const std::pair< size_t, size_t > &  - shape  - - - - ) - + const std::pair< size_t, size_t > & shape )
    @@ -2003,7 +1841,7 @@ template<typename T >
    diff --git a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.map b/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.map index 6dc3b35c4..a2154fb2f 100644 --- a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.map +++ b/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.map @@ -1,26 +1,25 @@ - - + - + - + - + - + - + - + - + - + - + - + diff --git a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.md5 b/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.md5 index 30391e24a..432919a85 100644 --- a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.md5 +++ b/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.md5 @@ -1 +1 @@ -745b70a0c3e0237863f536a02848ca65 \ No newline at end of file +3cc03b906d359c08441aa0384717fbbd \ No newline at end of file diff --git a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.svg b/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.svg index aae67569f..dfa40b7a7 100644 --- a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.svg +++ b/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.svg @@ -64,15 +64,6 @@ var sectionId = 'dynsection-5';     - - -Node1->Node1 - - - - - - Node2 @@ -84,9 +75,9 @@ var sectionId = 'dynsection-5';     - + Node1->Node2 - + @@ -102,9 +93,9 @@ var sectionId = 'dynsection-5'; - + Node2->Node3 - + @@ -120,9 +111,9 @@ var sectionId = 'dynsection-5'; - + Node2->Node4 - + @@ -138,9 +129,9 @@ var sectionId = 'dynsection-5'; - + Node2->Node9 - + @@ -156,9 +147,9 @@ var sectionId = 'dynsection-5'; - + Node2->Node10 - + @@ -174,9 +165,9 @@ var sectionId = 'dynsection-5'; - + Node2->Node11 - + @@ -192,9 +183,9 @@ var sectionId = 'dynsection-5'; - + Node2->Node12 - + @@ -210,9 +201,9 @@ var sectionId = 'dynsection-5'; - + Node4->Node5 - + @@ -228,9 +219,9 @@ var sectionId = 'dynsection-5'; - + Node4->Node6 - + @@ -246,9 +237,9 @@ var sectionId = 'dynsection-5'; - + Node4->Node7 - + @@ -264,9 +255,9 @@ var sectionId = 'dynsection-5'; - + Node4->Node8 - + diff --git a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph_org.svg b/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph_org.svg index 586595cef..8bcb01eb3 100644 --- a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph_org.svg +++ b/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph_org.svg @@ -18,15 +18,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -38,9 +29,9 @@ - + Node1->Node2 - + @@ -56,9 +47,9 @@ - + Node2->Node3 - + @@ -74,9 +65,9 @@ - + Node2->Node4 - + @@ -92,9 +83,9 @@ - + Node2->Node9 - + @@ -110,9 +101,9 @@ - + Node2->Node10 - + @@ -128,9 +119,9 @@ - + Node2->Node11 - + @@ -146,9 +137,9 @@ - + Node2->Node12 - + @@ -164,9 +155,9 @@ - + Node4->Node5 - + @@ -182,9 +173,9 @@ - + Node4->Node6 - + @@ -200,9 +191,9 @@ - + Node4->Node7 - + @@ -218,9 +209,9 @@ - + Node4->Node8 - + diff --git a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.map b/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.map index e46848525..0f6fa6bf6 100644 --- a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.map +++ b/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.map @@ -1,17 +1,7 @@ - - - - - - - - - - - - - - - + + + + + diff --git a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.md5 b/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.md5 index 9eaf463a8..f958f89d5 100644 --- a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.md5 +++ b/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.md5 @@ -1 +1 @@ -7491a41aa8bf1abf5dd1e6f8f00237cf \ No newline at end of file +5037bc766a84951d786a77f5d204d721 \ No newline at end of file diff --git a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.svg b/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.svg index 0240be544..75106c3c8 100644 --- a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.svg +++ b/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.svg @@ -4,8 +4,8 @@ - + - + machine_learning::operator<< Node1 - -machine_learning::operator<< + +machine_learning::operator<< @@ -31,8 +31,8 @@ Node2 - -std::endl + +std::endl @@ -40,17 +40,17 @@ Node1->Node2 - - + + Node3 - - -operator<< + + +std::ostream::precision @@ -58,98 +58,8 @@ Node1->Node3 - - - - - - - -Node7 - - -std::ostream::precision - - - - - -Node1->Node7 - - - - - - - - -Node3->Node2 - - - - - - - - -Node3->Node3 - - - - - - - - -Node4 - - -std::left - - - - - -Node3->Node4 - - - - - - - - -Node5 - - -std::setfill - - - - - -Node3->Node5 - - - - - - - - -Node6 - - -std::setw - - - - - -Node3->Node6 - - - + + diff --git a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph_org.svg b/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph_org.svg index ddcb3a0a1..6cae9b569 100644 --- a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph_org.svg +++ b/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + machine_learning::operator<< Node1 - -machine_learning::operator<< + +machine_learning::operator<< @@ -21,8 +21,8 @@ Node2 - -std::endl + +std::endl @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node3 - - -operator<< + + +std::ostream::precision @@ -48,98 +48,8 @@ Node1->Node3 - - - - - - - -Node7 - - -std::ostream::precision - - - - - -Node1->Node7 - - - - - - - - -Node3->Node2 - - - - - - - - -Node3->Node3 - - - - - - - - -Node4 - - -std::left - - - - - -Node3->Node4 - - - - - - - - -Node5 - - -std::setfill - - - - - -Node3->Node5 - - - - - - - - -Node6 - - -std::setw - - - - - -Node3->Node6 - - - + + diff --git a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.map b/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.map index e46848525..0f6fa6bf6 100644 --- a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.map +++ b/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.map @@ -1,17 +1,7 @@ - - - - - - - - - - - - - - - + + + + + diff --git a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.md5 b/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.md5 index 9eaf463a8..f958f89d5 100644 --- a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.md5 +++ b/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.md5 @@ -1 +1 @@ -7491a41aa8bf1abf5dd1e6f8f00237cf \ No newline at end of file +5037bc766a84951d786a77f5d204d721 \ No newline at end of file diff --git a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.svg b/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.svg index 0240be544..75106c3c8 100644 --- a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.svg +++ b/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.svg @@ -4,8 +4,8 @@ - + - + machine_learning::operator<< Node1 - -machine_learning::operator<< + +machine_learning::operator<< @@ -31,8 +31,8 @@ Node2 - -std::endl + +std::endl @@ -40,17 +40,17 @@ Node1->Node2 - - + + Node3 - - -operator<< + + +std::ostream::precision @@ -58,98 +58,8 @@ Node1->Node3 - - - - - - - -Node7 - - -std::ostream::precision - - - - - -Node1->Node7 - - - - - - - - -Node3->Node2 - - - - - - - - -Node3->Node3 - - - - - - - - -Node4 - - -std::left - - - - - -Node3->Node4 - - - - - - - - -Node5 - - -std::setfill - - - - - -Node3->Node5 - - - - - - - - -Node6 - - -std::setw - - - - - -Node3->Node6 - - - + + diff --git a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph_org.svg b/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph_org.svg index ddcb3a0a1..6cae9b569 100644 --- a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph_org.svg +++ b/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + machine_learning::operator<< Node1 - -machine_learning::operator<< + +machine_learning::operator<< @@ -21,8 +21,8 @@ Node2 - -std::endl + +std::endl @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node3 - - -operator<< + + +std::ostream::precision @@ -48,98 +48,8 @@ Node1->Node3 - - - - - - - -Node7 - - -std::ostream::precision - - - - - -Node1->Node7 - - - - - - - - -Node3->Node2 - - - - - - - - -Node3->Node3 - - - - - - - - -Node4 - - -std::left - - - - - -Node3->Node4 - - - - - - - - -Node5 - - -std::setfill - - - - - -Node3->Node5 - - - - - - - - -Node6 - - -std::setw - - - - - -Node3->Node6 - - - + + diff --git a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.map b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.map index d4dcefb87..5d80efcec 100644 --- a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.map +++ b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.map @@ -1,6 +1,5 @@ - @@ -8,7 +7,7 @@ - + - + diff --git a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.md5 b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.md5 index ebe55a6f9..a68d50638 100644 --- a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.md5 +++ b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.md5 @@ -1 +1 @@ -4548052f410a77b2126de55102ebc00b \ No newline at end of file +2aac8c73bbc8837f7fcadeb2d6889e76 \ No newline at end of file diff --git a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.svg b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.svg index dcb176214..ceb9977e2 100644 --- a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.svg +++ b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.svg @@ -28,15 +28,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -101,9 +92,9 @@ - + Node1->Node5 - + @@ -119,9 +110,9 @@ - + Node1->Node6 - + diff --git a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph_org.svg b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph_org.svg index fee83e9b7..071c623d5 100644 --- a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph_org.svg +++ b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph_org.svg @@ -18,15 +18,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -91,9 +82,9 @@ - + Node1->Node5 - + @@ -109,9 +100,9 @@ - + Node1->Node6 - + diff --git a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.map b/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.map index d31d19832..e4a842a65 100644 --- a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.map +++ b/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.map @@ -1,26 +1,25 @@ - - + - + - + - + - + - + - + - + - + - + - + diff --git a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.md5 b/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.md5 index 0e56e943c..e6fdbeee6 100644 --- a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.md5 +++ b/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.md5 @@ -1 +1 @@ -152dd2967de00a39e09ece49da0f929e \ No newline at end of file +fc4174f43c406273aae7026d0b3b0803 \ No newline at end of file diff --git a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.svg b/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.svg index b822f3a0d..881bf03a5 100644 --- a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.svg +++ b/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.svg @@ -63,15 +63,6 @@ var sectionId = 'dynsection-4'; - - -Node1->Node1 - - - - - - Node2 @@ -83,9 +74,9 @@ var sectionId = 'dynsection-4'; - + Node1->Node2 - + @@ -101,9 +92,9 @@ var sectionId = 'dynsection-4'; - + Node2->Node3 - + @@ -119,9 +110,9 @@ var sectionId = 'dynsection-4'; - + Node2->Node4 - + @@ -137,9 +128,9 @@ var sectionId = 'dynsection-4'; - + Node2->Node9 - + @@ -155,9 +146,9 @@ var sectionId = 'dynsection-4'; - + Node2->Node10 - + @@ -173,9 +164,9 @@ var sectionId = 'dynsection-4'; - + Node2->Node11 - + @@ -191,9 +182,9 @@ var sectionId = 'dynsection-4'; - + Node2->Node12 - + @@ -209,9 +200,9 @@ var sectionId = 'dynsection-4'; - + Node4->Node5 - + @@ -227,9 +218,9 @@ var sectionId = 'dynsection-4'; - + Node4->Node6 - + @@ -245,9 +236,9 @@ var sectionId = 'dynsection-4'; - + Node4->Node7 - + @@ -263,9 +254,9 @@ var sectionId = 'dynsection-4'; - + Node4->Node8 - + diff --git a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph_org.svg b/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph_org.svg index c65e6b931..49c4ecaa6 100644 --- a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph_org.svg +++ b/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph_org.svg @@ -17,15 +17,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -37,9 +28,9 @@ - + Node1->Node2 - + @@ -55,9 +46,9 @@ - + Node2->Node3 - + @@ -73,9 +64,9 @@ - + Node2->Node4 - + @@ -91,9 +82,9 @@ - + Node2->Node9 - + @@ -109,9 +100,9 @@ - + Node2->Node10 - + @@ -127,9 +118,9 @@ - + Node2->Node11 - + @@ -145,9 +136,9 @@ - + Node2->Node12 - + @@ -163,9 +154,9 @@ - + Node4->Node5 - + @@ -181,9 +172,9 @@ - + Node4->Node6 - + @@ -199,9 +190,9 @@ - + Node4->Node7 - + @@ -217,9 +208,9 @@ - + Node4->Node8 - + diff --git a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.map b/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.map index 5dedc8469..2b247eafd 100644 --- a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.map +++ b/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.map @@ -1,16 +1,5 @@ - - - - - - - - - - - - - - + + + diff --git a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.md5 b/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.md5 index 9407afe4d..ac89327b0 100644 --- a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.md5 +++ b/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.md5 @@ -1 +1 @@ -0d4f9d0b14c4f8b392a1f0ac11f16fb9 \ No newline at end of file +7f1dc6e9d6cb9a5a6d5f47948242c662 \ No newline at end of file diff --git a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.svg b/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.svg index 01dc2c3fb..6211d5c3c 100644 --- a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.svg +++ b/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.svg @@ -4,8 +4,8 @@ - + - + machine_learning::operator<< Node1 - -machine_learning::operator<< + +machine_learning::operator<< Node2 - - -operator<< + + +std::ostream::precision @@ -40,107 +40,8 @@ Node1->Node2 - - - - - - - -Node7 - - -std::ostream::precision - - - - - -Node1->Node7 - - - - - - - - -Node2->Node2 - - - - - - - - -Node3 - - -std::endl - - - - - -Node2->Node3 - - - - - - - - -Node4 - - -std::left - - - - - -Node2->Node4 - - - - - - - - -Node5 - - -std::setfill - - - - - -Node2->Node5 - - - - - - - - -Node6 - - -std::setw - - - - - -Node2->Node6 - - - + + diff --git a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph_org.svg b/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph_org.svg index 58eebe010..1c45e2e13 100644 --- a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph_org.svg +++ b/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph_org.svg @@ -4,25 +4,25 @@ - - + + machine_learning::operator<< Node1 - -machine_learning::operator<< + +machine_learning::operator<< Node2 - - -operator<< + + +std::ostream::precision @@ -30,107 +30,8 @@ Node1->Node2 - - - - - - - -Node7 - - -std::ostream::precision - - - - - -Node1->Node7 - - - - - - - - -Node2->Node2 - - - - - - - - -Node3 - - -std::endl - - - - - -Node2->Node3 - - - - - - - - -Node4 - - -std::left - - - - - -Node2->Node4 - - - - - - - - -Node5 - - -std::setfill - - - - - -Node2->Node5 - - - - - - - - -Node6 - - -std::setw - - - - - -Node2->Node6 - - - + + diff --git a/d8/d7a/sha1_8cpp.html b/d8/d7a/sha1_8cpp.html index 9c53cdd33..d7c1992c7 100644 --- a/d8/d7a/sha1_8cpp.html +++ b/d8/d7a/sha1_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: hashing/sha1.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -130,25 +132,25 @@ Namespaces - + - + - + - + - + - + - +

    Functions

    uint32_t hashing::sha1::leftRotate32bits (uint32_t n, std::size_t rotate)
    uint32_t hashing::sha1::leftRotate32bits (uint32_t n, std::size_t rotate)
     Rotates the bits of a 32-bit unsigned integer.
     
    std::string hashing::sha1::sig2hex (void *sig)
    std::string hashing::sha1::sig2hex (void *sig)
     Transforms the 160-bit SHA-1 signature into a 40 char hex string.
     
    void * hashing::sha1::hash_bs (const void *input_bs, uint64_t input_size)
    void * hashing::sha1::hash_bs (const void *input_bs, uint64_t input_size)
     The SHA-1 algorithm itself, taking in a bytestring.
     
    void * hashing::sha1::hash (const std::string &message)
    void * hashing::sha1::hash (const std::string &message)
     Converts the string to bytestring and calls the main algorithm.
     
    static void test ()
    static void test ()
     Self-test implementations of well-known SHA-1 hashes.
     
    static void interactive ()
    static void interactive ()
     Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed.
     
    int main ()
    int main ()
     Main function.
     
    @@ -170,8 +172,7 @@ Algorithm void * hashing::sha1::hash ( - const std::string &  - message) + const std::string & message) @@ -207,19 +208,12 @@ Here is the call graph for this function:
    void * hashing::sha1::hash_bs ( - const void *  - input_bs, + const void * input_bs, - uint64_t  - input_size  - - - - ) - + uint64_t input_size )
    @@ -379,7 +373,7 @@ Here is the call graph for this function:
    static void interactive ( - ) + ) @@ -398,8 +392,8 @@ Here is the call graph for this function:
    277 std::cout << "Enter a message to be hashed (Ctrl-C to exit): "
    278 << std::endl;
    279 std::getline(std::cin, input);
    -
    280 void* sig = hashing::sha1::hash(input);
    -
    281 std::cout << "Hash is: " << hashing::sha1::sig2hex(sig) << std::endl;
    +
    280 void* sig = hashing::sha1::hash(input);
    +
    281 std::cout << "Hash is: " << hashing::sha1::sig2hex(sig) << std::endl;
    282
    283 while (true) {
    284 std::cout << "Want to enter another message? (y/n) ";
    @@ -418,8 +412,8 @@ Here is the call graph for this function:
    std::string::compare
    T compare(T... args)
    std::endl
    T endl(T... args)
    std::getline
    T getline(T... args)
    -
    hashing::sha1::hash
    void * hash(const std::string &message)
    Converts the string to bytestring and calls the main algorithm.
    Definition sha1.cpp:210
    -
    hashing::sha1::sig2hex
    std::string sig2hex(void *sig)
    Transforms the 160-bit SHA-1 signature into a 40 char hex string.
    Definition sha1.cpp:66
    +
    hashing::sha1::hash
    void * hash(const std::string &message)
    Converts the string to bytestring and calls the main algorithm.
    Definition sha1.cpp:210
    +
    hashing::sha1::sig2hex
    std::string sig2hex(void *sig)
    Transforms the 160-bit SHA-1 signature into a 40 char hex string.
    Definition sha1.cpp:66
    Here is the call graph for this function:
    @@ -437,19 +431,12 @@ Here is the call graph for this function:
    uint32_t hashing::sha1::leftRotate32bits ( - uint32_t  - n, + uint32_t n, - std::size_t  - rotate  - - - - ) - + std::size_t rotate )
    @@ -479,8 +466,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -489,19 +475,19 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    299 {
    -
    300 test(); // run self-test implementations
    +
    300 test(); // run self-test implementations
    301
    302 // Launch interactive mode where user can input messages and see
    303 // their hash
    -
    304 interactive();
    +
    304 interactive();
    305 return 0;
    306}
    -
    test
    static void test()
    Self-test implementations of well-known SHA-1 hashes.
    Definition sha1.cpp:220
    -
    interactive
    static void interactive()
    Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed.
    Definition sha1.cpp:274
    +
    test
    static void test()
    Self-test implementations of well-known SHA-1 hashes.
    Definition sha1.cpp:220
    +
    interactive
    static void interactive()
    Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed.
    Definition sha1.cpp:274
    Here is the call graph for this function:
    -
    +
    @@ -515,8 +501,7 @@ Here is the call graph for this function: std::string hashing::sha1::sig2hex ( - void *  - sig) + void * sig) @@ -556,7 +541,7 @@ Here is the call graph for this function: static void test ( - ) + ) @@ -571,57 +556,57 @@ Here is the call graph for this function:
    Returns
    void
    220 {
    221 // Hashes empty string and stores signature
    -
    222 void* sig = hashing::sha1::hash("");
    +
    222 void* sig = hashing::sha1::hash("");
    223 std::cout << "Hashing empty string" << std::endl;
    224 // Prints signature hex representation
    -
    225 std::cout << hashing::sha1::sig2hex(sig) << std::endl << std::endl;
    +
    225 std::cout << hashing::sha1::sig2hex(sig) << std::endl << std::endl;
    226 // Test with cassert wether sig is correct from expected value
    -
    227 assert(hashing::sha1::sig2hex(sig).compare(
    +
    227 assert(hashing::sha1::sig2hex(sig).compare(
    228 "da39a3ee5e6b4b0d3255bfef95601890afd80709") == 0);
    229
    230 // Hashes "The quick brown fox jumps over the lazy dog" and stores signature
    231 void* sig2 =
    -
    232 hashing::sha1::hash("The quick brown fox jumps over the lazy dog");
    +
    232 hashing::sha1::hash("The quick brown fox jumps over the lazy dog");
    233 std::cout << "Hashing The quick brown fox jumps over the lazy dog"
    234 << std::endl;
    235 // Prints signature hex representation
    -
    236 std::cout << hashing::sha1::sig2hex(sig2) << std::endl << std::endl;
    +
    236 std::cout << hashing::sha1::sig2hex(sig2) << std::endl << std::endl;
    237 // Test with cassert wether sig is correct from expected value
    -
    238 assert(hashing::sha1::sig2hex(sig2).compare(
    +
    238 assert(hashing::sha1::sig2hex(sig2).compare(
    239 "2fd4e1c67a2d28fced849ee1bb76e7391b93eb12") == 0);
    240
    241 // Hashes "The quick brown fox jumps over the lazy dog." (notice the
    242 // additional period) and stores signature
    243 void* sig3 =
    -
    244 hashing::sha1::hash("The quick brown fox jumps over the lazy dog.");
    +
    244 hashing::sha1::hash("The quick brown fox jumps over the lazy dog.");
    245 std::cout << "Hashing "
    246 "The quick brown fox jumps over the lazy dog."
    247 << std::endl;
    248 // Prints signature hex representation
    -
    249 std::cout << hashing::sha1::sig2hex(sig3) << std::endl << std::endl;
    +
    249 std::cout << hashing::sha1::sig2hex(sig3) << std::endl << std::endl;
    250 // Test with cassert wether sig is correct from expected value
    -
    251 assert(hashing::sha1::sig2hex(sig3).compare(
    +
    251 assert(hashing::sha1::sig2hex(sig3).compare(
    252 "408d94384216f890ff7a0c3528e8bed1e0b01621") == 0);
    253
    254 // Hashes "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"
    255 // and stores signature
    -
    256 void* sig4 = hashing::sha1::hash(
    +
    256 void* sig4 = hashing::sha1::hash(
    257 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789");
    258 std::cout
    259 << "Hashing "
    260 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"
    261 << std::endl;
    262 // Prints signature hex representation
    -
    263 std::cout << hashing::sha1::sig2hex(sig4) << std::endl << std::endl;
    +
    263 std::cout << hashing::sha1::sig2hex(sig4) << std::endl << std::endl;
    264 // Test with cassert wether sig is correct from expected value
    -
    265 assert(hashing::sha1::sig2hex(sig4).compare(
    +
    265 assert(hashing::sha1::sig2hex(sig4).compare(
    266 "761c457bf73b14d27e9e9265c46f4b4dda11f940") == 0);
    267}
    -
    compare
    Definition huffman.cpp:28
    +
    compare
    int compare(const void *a, const void *b)
    Definition shell_sort2.cpp:87
    Here is the call graph for this function:
    -
    +
    @@ -632,7 +617,7 @@ Here is the call graph for this function: diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map index 2f512b050..142d335bc 100644 --- a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map +++ b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -1,5 +1,7 @@ - - - + + + + + diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 index 5d283d101..f56a1c7be 100644 --- a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 +++ b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -1 +1 @@ -26083a40d70f854a17e3e067d4246882 \ No newline at end of file +051da4281d575e7f47fc60770596a53a \ No newline at end of file diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 975992ec3..e25efc30c 100644 --- a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -4,8 +4,8 @@ - + - + test Node1 - -test + +test Node2 - - -std::endl + + +compare @@ -40,8 +40,26 @@ Node1->Node2 - - + + + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index add97fbdb..4b22762c5 100644 --- a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -4,25 +4,25 @@ - - + + test Node1 - -test + +test Node2 - - -std::endl + + +compare @@ -30,8 +30,26 @@ Node1->Node2 - - + + + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 179fa3737..20b48e459 100644 --- a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -10,5 +10,7 @@ - + + + diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 6e9895a29..1b00ff021 100644 --- a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -8ea8abf0dd20626a6248a98fe192134d \ No newline at end of file +0ed0d9463a76665282a5146586435f83 \ No newline at end of file diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 34116d68a..1001dcb2a 100644 --- a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,8 +4,8 @@ - + - + main Node1 - -main + +main @@ -31,8 +31,8 @@ Node2 - -interactive + +interactive @@ -40,8 +40,8 @@ Node1->Node2 - - + + @@ -49,8 +49,8 @@ Node6 - -test + +test @@ -58,8 +58,8 @@ Node1->Node6 - - + + @@ -67,8 +67,8 @@ Node3 - -std::string::compare + +std::string::compare @@ -76,8 +76,8 @@ Node2->Node3 - - + + @@ -85,8 +85,8 @@ Node4 - -std::endl + +std::endl @@ -94,8 +94,8 @@ Node2->Node4 - - + + @@ -103,8 +103,8 @@ Node5 - -std::getline + +std::getline @@ -112,17 +112,35 @@ Node2->Node5 - - + + - + Node6->Node4 - - - + + + + + + + + +Node7 + + +compare + + + + + +Node6->Node7 + + + diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 6d00b911c..2e7a49801 100644 --- a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + main Node1 - -main + +main @@ -21,8 +21,8 @@ Node2 - -interactive + +interactive @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -39,8 +39,8 @@ Node6 - -test + +test @@ -48,8 +48,8 @@ Node1->Node6 - - + + @@ -57,8 +57,8 @@ Node3 - -std::string::compare + +std::string::compare @@ -66,8 +66,8 @@ Node2->Node3 - - + + @@ -75,8 +75,8 @@ Node4 - -std::endl + +std::endl @@ -84,8 +84,8 @@ Node2->Node4 - - + + @@ -93,8 +93,8 @@ Node5 - -std::getline + +std::getline @@ -102,17 +102,35 @@ Node2->Node5 - - + + - + Node6->Node4 - - - + + + + + + + + +Node7 + + +compare + + + + + +Node6->Node7 + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html index 25ebf6b90..0222e19ee 100644 --- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: operations_on_datastructures::circular_linked_list::CircularLinkedList Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d8/d7c/classoperations__on__datastruct

    A class that implements a Circular Linked List. - More...

    + More...

    Collaboration diagram for operations_on_datastructures::circular_linked_list::CircularLinkedList:
    @@ -115,45 +117,45 @@ Collaboration diagram for operations_on_datastructures::circular_linked_list::Ci - + - + - + - + - + - + - + - + - + - + - + - + - + - +

    Public Member Functions

     CircularLinkedList ()
     CircularLinkedList ()
     Creates an empty CircularLinkedList.
     
     CircularLinkedList (const CircularLinkedList &copy)
     CircularLinkedList (const CircularLinkedList &copy)
     Copy constructor for CircularLinkedList.
     
     CircularLinkedList (CircularLinkedList &&source) noexcept
     CircularLinkedList (CircularLinkedList &&source) noexcept
     Move constructor for CircularLinkedList.
     
    CircularLinkedList & operator= (const CircularLinkedList &other)
    CircularLinkedList & operator= (const CircularLinkedList &other)
     Copy assignment operator.
     
    CircularLinkedList & operator= (CircularLinkedList &&other) noexcept
    CircularLinkedList & operator= (CircularLinkedList &&other) noexcept
     Move assignment operator.
     
     ~CircularLinkedList ()
     ~CircularLinkedList ()
     Cleans up memory when destroyed.
     
    void erase ()
    void erase ()
     
    void insert (const std::vector< int64_t > &values)
    void insert (const std::vector< int64_t > &values)
     Inserts all the values from a vector into the Circular Linked List.
     
    void insert (int64_t data)
    void insert (int64_t data)
     Inserts a single value into the Circular Linked List.
     
    void insert (Node *node)
    void insert (Node *node)
     Inserts a given Node into the Circular Linked List.
     
    void print ()
    void print ()
     Prints the values of the Circular Linked List, beginning from the root Node.
     
    void print (Node *root)
    void print (Node *root)
     Prints the values of the Circular Linked List, beginning from a given Node to be used as the root.
     
    std::vector< int64_t > values ()
    std::vector< int64_t > values ()
     Returns a std::vector of the values of the Circular Linked List.
     
    std::vector< int64_t > values (Node *root)
    std::vector< int64_t > values (Node *root)
     Returns a std::vector of the values of the Circular Linked List, beginning from a given Node.
     
    @@ -163,7 +165,7 @@ Private AttributesNode *  - +
    root
     Pointer to the root Node.
     
    Node * end {}
    Node * end {}
     Pointer to the last Node.
     
    @@ -182,7 +184,7 @@ Private Attributes operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList ( - ) + ) @@ -195,11 +197,11 @@ Private Attributes

    Creates an empty CircularLinkedList.

    66 {
    -
    67 root = nullptr;
    -
    68 end = nullptr;
    +
    67 root = nullptr;
    +
    68 end = nullptr;
    69 }
    -
    operations_on_datastructures::circular_linked_list::CircularLinkedList::root
    Node * root
    Pointer to the root Node.
    Definition circular_linked_list.cpp:59
    -
    operations_on_datastructures::circular_linked_list::CircularLinkedList::end
    Node * end
    Pointer to the last Node.
    Definition circular_linked_list.cpp:60
    +
    operations_on_datastructures::circular_linked_list::CircularLinkedList::root
    Node * root
    Pointer to the root Node.
    Definition circular_linked_list.cpp:59
    +
    operations_on_datastructures::circular_linked_list::CircularLinkedList::end
    Node * end
    Pointer to the last Node.
    Definition circular_linked_list.cpp:60
    @@ -215,8 +217,7 @@ Private Attributes operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList ( - const CircularLinkedList &  - copy) + const CircularLinkedList & copy) @@ -229,16 +230,16 @@ Private Attributes

    Copy constructor for CircularLinkedList.

    73 {
    -
    74 erase();
    -
    75 root = nullptr;
    +
    74 erase();
    +
    75 root = nullptr;
    76 Node* node = copy.root;
    77 while (node != nullptr) {
    -
    78 insert(node->data);
    +
    78 insert(node->data);
    79 node = node->next;
    80 }
    81 }
    -
    operations_on_datastructures::circular_linked_list::CircularLinkedList::erase
    void erase()
    Definition circular_linked_list.cpp:126
    -
    operations_on_datastructures::circular_linked_list::CircularLinkedList::insert
    void insert(const std::vector< int64_t > &values)
    Inserts all the values from a vector into the Circular Linked List.
    Definition circular_linked_list.cpp:146
    +
    operations_on_datastructures::circular_linked_list::CircularLinkedList::erase
    void erase()
    Definition circular_linked_list.cpp:126
    +
    operations_on_datastructures::circular_linked_list::CircularLinkedList::insert
    void insert(const std::vector< int64_t > &values)
    Inserts all the values from a vector into the Circular Linked List.
    Definition circular_linked_list.cpp:146
    std::copy
    T copy(T... args)
    Node
    Definition linkedlist_implentation_usingarray.cpp:14
    node
    Definition binary_search_tree.cpp:11
    @@ -262,8 +263,7 @@ Here is the call graph for this function:
    operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList ( - CircularLinkedList &&  - source) + CircularLinkedList && source) @@ -282,8 +282,8 @@ Here is the call graph for this function:
    86 {
    -
    87 root = source.root;
    -
    88 end = source.end;
    +
    87 root = source.root;
    +
    88 end = source.end;
    89 source.root = nullptr;
    90 source.end = nullptr;
    91 }
    @@ -302,7 +302,7 @@ Here is the call graph for this function:
    operations_on_datastructures::circular_linked_list::CircularLinkedList::~CircularLinkedList ( - ) + ) @@ -314,7 +314,7 @@ Here is the call graph for this function:

    Cleans up memory when destroyed.

    -
    122{ erase(); }
    +
    122{ erase(); }
    Here is the call graph for this function:
    @@ -336,7 +336,7 @@ Here is the call graph for this function:
    void operations_on_datastructures::circular_linked_list::CircularLinkedList::erase ( - ) + ) @@ -348,18 +348,19 @@ Here is the call graph for this function:

    Iteratively frees each node in the Circular Linked List from the heap

    126 {
    -
    127 if (root == nullptr) {
    +
    127 if (root == nullptr) {
    128 return;
    129 }
    -
    130 Node* node = root;
    +
    130 Node* node = root;
    131 do {
    -
    132 Node* temp = node;
    +
    132 Node* temp = node;
    133 node = node->next;
    134 delete (temp);
    -
    135 } while (node != root);
    -
    136 root = nullptr;
    -
    137 end = nullptr;
    +
    135 } while (node != root);
    +
    136 root = nullptr;
    +
    137 end = nullptr;
    138 }
    +
    node
    struct node { int data; int height; struct node *left; struct node *right;} node
    for std::queue
    Definition avltree.cpp:13
    @@ -375,8 +376,7 @@ Here is the call graph for this function: void operations_on_datastructures::circular_linked_list::CircularLinkedList::insert ( - const std::vector< int64_t > &  - values) + const std::vector< int64_t > & values) @@ -396,11 +396,11 @@ Here is the call graph for this function:
    Returns
    void
    146 {
    -
    147 for (int64_t value : values) {
    -
    148 insert(value);
    +
    147 for (int64_t value : values) {
    +
    148 insert(value);
    149 }
    150 }
    -
    operations_on_datastructures::circular_linked_list::CircularLinkedList::values
    std::vector< int64_t > values()
    Returns a std::vector of the values of the Circular Linked List.
    Definition circular_linked_list.cpp:214
    +
    operations_on_datastructures::circular_linked_list::CircularLinkedList::values
    std::vector< int64_t > values()
    Returns a std::vector of the values of the Circular Linked List.
    Definition circular_linked_list.cpp:214
    Here is the call graph for this function:
    @@ -421,8 +421,7 @@ Here is the call graph for this function:
    void operations_on_datastructures::circular_linked_list::CircularLinkedList::insert ( - int64_t  - data) + int64_t data) @@ -442,8 +441,8 @@ Here is the call graph for this function:
    Returns
    void
    158 {
    -
    159 Node* node = new Node(data, root);
    -
    160 insert(node);
    +
    159 Node* node = new Node(data, root);
    +
    160 insert(node);
    161 }
    data
    int data[MAX]
    test data
    Definition hash_search.cpp:24
    @@ -466,8 +465,7 @@ Here is the call graph for this function:
    void operations_on_datastructures::circular_linked_list::CircularLinkedList::insert ( - Node *  - node) + Node * node) @@ -493,14 +491,14 @@ Here is the call graph for this function:

    < Set the next value to the root

    < Make end point to node

    169 {
    -
    170 if (root == nullptr) {
    -
    171 root = node; ///< Set node as the root
    -
    172 node->next = root; ///< Point node to itself
    -
    173 end = root; ///< Set the end to the root
    +
    170 if (root == nullptr) {
    +
    171 root = node; ///< Set node as the root
    +
    172 node->next = root; ///< Point node to itself
    +
    173 end = root; ///< Set the end to the root
    174 } else {
    -
    175 end->next = node; ///< Append node to the end
    -
    176 node->next = root; ///< Set the next value to the root
    -
    177 end = node; ///< Make end point to node
    +
    175 end->next = node; ///< Append node to the end
    +
    176 node->next = root; ///< Set the next value to the root
    +
    177 end = node; ///< Make end point to node
    178 }
    179 }
    operations_on_datastructures::circular_linked_list::Node::next
    Node * next
    The Node's successor.
    Definition circular_linked_list.cpp:34
    @@ -519,8 +517,7 @@ Here is the call graph for this function:
    CircularLinkedList & operations_on_datastructures::circular_linked_list::CircularLinkedList::operator= ( - CircularLinkedList &&  - other) + CircularLinkedList && other) @@ -540,8 +537,8 @@ Here is the call graph for this function:
    Returns
    Reference to CircularLinkedList
    112 {
    -
    113 root = other.root;
    -
    114 end = other.end;
    +
    113 root = other.root;
    +
    114 end = other.end;
    115 other.root = nullptr;
    116 other.end = nullptr;
    117 return *this;
    @@ -561,8 +558,7 @@ Here is the call graph for this function:
    CircularLinkedList & operations_on_datastructures::circular_linked_list::CircularLinkedList::operator= ( - const CircularLinkedList &  - other) + const CircularLinkedList & other) @@ -582,11 +578,11 @@ Here is the call graph for this function:
    Returns
    Reference to CircularLinkedList
    97 {
    -
    98 erase();
    -
    99 root = nullptr;
    +
    98 erase();
    +
    99 root = nullptr;
    100 Node* node = other.root;
    101 while (node != nullptr) {
    -
    102 insert(node->data);
    +
    102 insert(node->data);
    103 node = node->next;
    104 }
    105 return *this;
    @@ -611,7 +607,7 @@ Here is the call graph for this function:
    void operations_on_datastructures::circular_linked_list::CircularLinkedList::print ( - ) + ) @@ -624,8 +620,8 @@ Here is the call graph for this function:

    Prints the values of the Circular Linked List, beginning from the root Node.

    Goes through each Node from the root and prints them out in order

    Returns
    void
    -
    187{ print(root); }
    -
    operations_on_datastructures::circular_linked_list::CircularLinkedList::print
    void print()
    Prints the values of the Circular Linked List, beginning from the root Node.
    Definition circular_linked_list.cpp:187
    +
    187{ print(root); }
    +
    operations_on_datastructures::circular_linked_list::CircularLinkedList::print
    void print()
    Prints the values of the Circular Linked List, beginning from the root Node.
    Definition circular_linked_list.cpp:187
    Here is the call graph for this function:
    @@ -646,8 +642,7 @@ Here is the call graph for this function:
    void operations_on_datastructures::circular_linked_list::CircularLinkedList::print ( - Node *  - root) + Node * root) @@ -667,15 +662,15 @@ Here is the call graph for this function:
    Returns
    void
    196 {
    -
    197 Node* temp = root;
    -
    198 if (root == nullptr) {
    +
    197 Node* temp = root;
    +
    198 if (root == nullptr) {
    199 std::cout << "Empty List!\n";
    200 return;
    201 }
    202 do {
    203 std::cout << temp->data << " ";
    204 temp = temp->next;
    -
    205 } while (temp != root);
    +
    205 } while (temp != root);
    206 std::cout << "\n";
    207 }
    @@ -694,7 +689,7 @@ Here is the call graph for this function:
    std::vector< int64_t > operations_on_datastructures::circular_linked_list::CircularLinkedList::values ( - ) + ) @@ -707,7 +702,7 @@ Here is the call graph for this function:

    Returns a std::vector of the values of the Circular Linked List.

    Starting from the root Node, appends each value of the list to a std::vector and returns it

    Returns
    A std::vector of the list's values
    -
    214{ return values(root); }
    +
    214{ return values(root); }
    Here is the call graph for this function:
    @@ -728,8 +723,7 @@ Here is the call graph for this function:
    std::vector< int64_t > operations_on_datastructures::circular_linked_list::CircularLinkedList::values ( - Node *  - root) + Node * root) @@ -751,14 +745,14 @@ Here is the call graph for this function:

    < Return empty vector

    223 {
    224 std::vector<int64_t> res;
    -
    225 if (root == nullptr) {
    +
    225 if (root == nullptr) {
    226 return res; ///< Return empty vector
    227 }
    -
    228 Node* temp = root;
    +
    228 Node* temp = root;
    229 do {
    230 res.push_back(temp->data);
    231 temp = temp->next;
    -
    232 } while (temp != root);
    +
    232 } while (temp != root);
    233 return res;
    234 }
    std::vector::push_back
    T push_back(T... args)
    @@ -806,7 +800,7 @@ Here is the call graph for this function:
    diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html b/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html index f86b283d3..7441ba493 100644 --- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html +++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: greedy_algorithms/kruskals_minimum_spanning_tree.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,7 +128,7 @@ Functions void greedy_algorithms::findMinimumEdge (const int &infinity, const std::array< std::array< T, 6 >, 6 > &graph)  Finds the minimum edge of the given graph.
      -int main () +int main ()  Main function.
      @@ -145,8 +147,7 @@ Functions int main ( - void  - ) + void ) @@ -184,7 +185,7 @@ Here is the call graph for this function:
    diff --git a/d8/d88/namespaceset_kth_bit.html b/d8/d88/namespaceset_kth_bit.html index 4a777c059..9fd06d9ea 100644 --- a/d8/d88/namespaceset_kth_bit.html +++ b/d8/d88/namespaceset_kth_bit.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: setKthBit Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/d88/namespaceset_kth_bit.html','../

    Functions for the [From the right, set the Kth bit in the binary representation of N] (https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/) implementation. -More...

    +More...

    Detailed Description

    Functions for the [From the right, set the Kth bit in the binary representation of N] (https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/) implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/d88/namespaceset_kth_bit.html','../ diff --git a/d8/d89/namespacelinear__probing.html b/d8/d89/namespacelinear__probing.html index fd5049fd5..ae85a7270 100644 --- a/d8/d89/namespacelinear__probing.html +++ b/d8/d89/namespacelinear__probing.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: linear_probing Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('d8/d89/namespacelinear__probing.html',

    An implementation of hash table using linear probing algorithm. -More...

    +More...

    @@ -116,32 +118,32 @@ Classes

    Classes

    - - + +

    Typedefs

    -using Entry = Entry
     
    +using Entry = struct Entry
     
    - + - + - + - + - + - + - + - + - + - +

    Functions

    bool putProber (const Entry &entry, int key)
    bool putProber (const Entry &entry, int key)
     
    bool searchingProber (const Entry &entry, int key)
    bool searchingProber (const Entry &entry, int key)
     
    void add (int key)
    void add (int key)
     
    size_t hashFxn (int key)
    size_t hashFxn (int key)
     Hash a key. Uses the STL library's std::hash() function.
     
    int linearProbe (int key, bool searching)
    int linearProbe (int key, bool searching)
     
    void display ()
    void display ()
     
    void rehash ()
    void rehash ()
     
    void remove (int key)
    void remove (int key)
     
    void addInfo (int key)
    void addInfo (int key)
     
    void removalInfo (int key)
    void removalInfo (int key)
     
    - - +

    @@ -177,8 +179,7 @@ bool 

    		rehashing void linear_probing::add (int key)int key)
    @@ -190,14 +191,14 @@ bool rehashing
    161 {
    -
    162 int index = linearProbe(key, false);
    +
    162 int index = linearProbe(key, false);
    163 table[index].key = key;
    164 // Load factor greater than 0.5 causes resizing
    165 if (++size / static_cast<double>(totalSize) >= 0.5) {
    166 rehash();
    167 }
    168}
    -
    linear_probing::linearProbe
    int linearProbe(int key, bool searching)
    Definition linear_probing_hash_table.cpp:55
    +
    linear_probing::linearProbe
    int linearProbe(int key, bool searching)
    Definition linear_probing_hash_table.cpp:55
    Here is the call graph for this function:
    @@ -215,8 +216,7 @@ Here is the call graph for this function:
    void linear_probing::addInfo ( - int  - key) + int key) @@ -258,7 +258,7 @@ Here is the call graph for this function:
    void linear_probing::display ( - ) + ) @@ -295,8 +295,7 @@ Here is the call graph for this function:
    size_t linear_probing::hashFxn ( - int  - key) + int key) @@ -327,19 +326,12 @@ Here is the call graph for this function: int linear_probing::linearProbe ( - int  - key, + int key, - bool  - searching  - - - - ) - + bool searching )
    @@ -407,19 +399,12 @@ Here is the call graph for this function:
    bool linear_probing::putProber ( - const Entry &  - entry, + const Entry & entry, - int  - key  - - - - ) - + int key )
    @@ -449,7 +434,7 @@ Here is the call graph for this function:
    void linear_probing::rehash ( - ) + ) @@ -492,8 +477,7 @@ Here is the call graph for this function: void linear_probing::removalInfo ( - int  - key) + int key) @@ -532,8 +516,7 @@ Here is the call graph for this function: void linear_probing::remove ( - int  - key) + int key) @@ -545,7 +528,7 @@ Here is the call graph for this function:
    173 {
    -
    174 int index = linearProbe(key, true);
    +
    174 int index = linearProbe(key, true);
    175 if (index == notPresent) {
    176 std::cout << "key not found" << std::endl;
    177 }
    @@ -570,19 +553,12 @@ Here is the call graph for this function:
    bool linear_probing::searchingProber ( - const Entry &  - entry, + const Entry & entry, - int  - key  - - - - ) - + int key )
    @@ -609,7 +585,7 @@ Here is the call graph for this function:
    diff --git a/d8/d8a/exponential__search_8cpp.html b/d8/d8a/exponential__search_8cpp.html index 52a805173..c38bf3359 100644 --- a/d8/d8a/exponential__search_8cpp.html +++ b/d8/d8a/exponential__search_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: search/exponential_search.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -118,12 +120,12 @@ Include dependency graph for exponential_search.cpp:

    Functions

    template<class Type > -Type * binary_s (Type *array, size_t size, Type key) +Type * binary_s (Type *array, size_t size, Type key)   template<class Type > -Type * struzik_search (Type *array, size_t size, Type key) +Type * struzik_search (Type *array, size_t size, Type key)   -int main () +int main ()  

    Detailed Description

    @@ -145,25 +147,17 @@ template<class Type > Type * binary_s ( - Type *  - array, + Type * array, - size_t  - size, + size_t size, - Type  - key  - - - - ) - + Type key ) @@ -172,7 +166,7 @@ template<class Type >
    -

    Binary Search Algorithm (used by struzik_search)
    +

    Binary Search Algorithm (used by struzik_search)

    • Time Complexity O(log n) where 'n' is the number of elements
    • Worst Time Complexity O(log n)
      • @@ -217,8 +211,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -249,25 +242,17 @@ template<class Type > Type * struzik_search ( - Type *  - array, + Type * array, - size_t  - size, + size_t size, - Type  - key  - - - - ) - + Type key )
    @@ -300,7 +285,7 @@ template<class Type >
    diff --git a/d8/d8e/struct_node-members.html b/d8/d8e/struct_node-members.html index c93f4739d..b46b533e2 100644 --- a/d8/d8e/struct_node-members.html +++ b/d8/d8e/struct_node-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,7 +118,7 @@ $(document).ready(function(){initNavTree('db/d8b/struct_node.html','../../'); in diff --git a/d8/d90/iterative__tree__traversals_8cpp.html b/d8/d90/iterative__tree__traversals_8cpp.html index 73413d7d2..b94fd0b14 100644 --- a/d8/d90/iterative__tree__traversals_8cpp.html +++ b/d8/d90/iterative__tree__traversals_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/iterative_tree_traversals.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -138,25 +140,25 @@ Namespaces - + - + - + - + - + - + - +

    Functions

    static void test1 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
    static void test1 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
     Test the computed preorder with the actual preorder.
     
    static void test2 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
    static void test2 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
     Test the computed postorder with the actual postorder.
     
    static void test3 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
    static void test3 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
     Test the computed inorder with the actual inorder.
     
    static void test4 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
    static void test4 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
     Test the computed preorder with the actual preorder on negative value.
     
    static void test5 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
    static void test5 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
     Test the computed postorder with the actual postorder on negative value.
     
    static void test6 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
    static void test6 (others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
     Test the computed inorder with the actual inorder on negative value.
     
    int main ()
    int main ()
     Main function.
     
    @@ -182,8 +184,7 @@ Iterative Inorder Traversal of a tree int main ( - void  - ) + void ) @@ -229,13 +230,13 @@ Iterative Inorder Traversal of a tree
    387 root->left->right->data = -5;
    388
    389 std::cout << "\n| Tests for negative data values |" << std::endl;
    -
    390 test4(binaryTree, root); // run preorder-iterative test on negative values
    +
    390 test4(binaryTree, root); // run preorder-iterative test on negative values
    391 std::cout << "\nPre-order test on-negative value Passed!" << std::endl;
    392
    -
    393 test5(binaryTree, root); // run postorder-iterative test on negative values
    +
    393 test5(binaryTree, root); // run postorder-iterative test on negative values
    394 std::cout << "\nPost-order test on-negative value Passed!" << std::endl;
    395
    -
    396 test6(binaryTree, root); // run inorder-iterative test on negative values
    +
    396 test6(binaryTree, root); // run inorder-iterative test on negative values
    397 std::cout << "\nIn-order test on-negative value Passed!" << std::endl;
    398
    399 return 0;
    @@ -248,9 +249,9 @@ Iterative Inorder Traversal of a tree
    test1
    static void test1()
    Self-test implementations, 1st test.
    Definition dsu_path_compression.cpp:169
    std::endl
    T endl(T... args)
    test3
    static void test3()
    Definition hamiltons_cycle.cpp:122
    -
    test4
    static void test4(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
    Test the computed preorder with the actual preorder on negative value.
    Definition iterative_tree_traversals.cpp:272
    -
    test5
    static void test5(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
    Test the computed postorder with the actual postorder on negative value.
    Definition iterative_tree_traversals.cpp:300
    -
    test6
    static void test6(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
    Test the computed inorder with the actual inorder on negative value.
    Definition iterative_tree_traversals.cpp:327
    +
    test4
    static void test4(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
    Test the computed preorder with the actual preorder on negative value.
    Definition iterative_tree_traversals.cpp:272
    +
    test5
    static void test5(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
    Test the computed postorder with the actual postorder on negative value.
    Definition iterative_tree_traversals.cpp:300
    +
    test6
    static void test6(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)
    Test the computed inorder with the actual inorder on negative value.
    Definition iterative_tree_traversals.cpp:327
    others::iterative_tree_traversals::Node
    defines the structure of a node of the tree
    Definition iterative_tree_traversals.cpp:58
    Here is the call graph for this function:
    @@ -272,19 +273,12 @@ Here is the call graph for this function: static void test1 ( - others::iterative_tree_traversals::BinaryTree  - binaryTree, + others::iterative_tree_traversals::BinaryTree binaryTree, - others::iterative_tree_traversals::Node *  - root  - - - - ) - + others::iterative_tree_traversals::Node * root ) @@ -346,19 +340,12 @@ Here is the call graph for this function: static void test2 ( - others::iterative_tree_traversals::BinaryTree  - binaryTree, + others::iterative_tree_traversals::BinaryTree binaryTree, - others::iterative_tree_traversals::Node *  - root  - - - - ) - + others::iterative_tree_traversals::Node * root ) @@ -418,19 +405,12 @@ Here is the call graph for this function: static void test3 ( - others::iterative_tree_traversals::BinaryTree  - binaryTree, + others::iterative_tree_traversals::BinaryTree binaryTree, - others::iterative_tree_traversals::Node *  - root  - - - - ) - + others::iterative_tree_traversals::Node * root ) @@ -490,19 +470,12 @@ Here is the call graph for this function: static void test4 ( - others::iterative_tree_traversals::BinaryTree  - binaryTree, + others::iterative_tree_traversals::BinaryTree binaryTree, - others::iterative_tree_traversals::Node *  - root  - - - - ) - + others::iterative_tree_traversals::Node * root ) @@ -561,19 +534,12 @@ Here is the call graph for this function: static void test5 ( - others::iterative_tree_traversals::BinaryTree  - binaryTree, + others::iterative_tree_traversals::BinaryTree binaryTree, - others::iterative_tree_traversals::Node *  - root  - - - - ) - + others::iterative_tree_traversals::Node * root ) @@ -632,19 +598,12 @@ Here is the call graph for this function: static void test6 ( - others::iterative_tree_traversals::BinaryTree  - binaryTree, + others::iterative_tree_traversals::BinaryTree binaryTree, - others::iterative_tree_traversals::Node *  - root  - - - - ) - + others::iterative_tree_traversals::Node * root ) @@ -697,7 +656,7 @@ Here is the call graph for this function: diff --git a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index d4306b198..d81f31e56 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -10,20 +10,20 @@ - - - - - - - - + + + + + + + + - - + + @@ -35,42 +35,46 @@ - - - - - - - - - - + + + + + + + + + + - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 066297144..6225494c6 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -961c419788dbcc8e36d8b4ae9600395e \ No newline at end of file +44f49165bbee9a3e7d8b64612961ec44 \ No newline at end of file diff --git a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 2bf8c569e..9e54113ca 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,7 +4,7 @@ - + - + main Node1 - -main + +main Node2 - - -sieve + + +print @@ -40,35 +40,71 @@ Node1->Node2 - - + + + + + + + +Node4 + + +sieve + + + + + +Node1->Node4 + + + + + + + + +Node5 + + +tests + + + + + +Node1->Node5 + + + Node3 - - -tests + + +std::endl - - -Node1->Node3 - - - + + +Node2->Node3 + + + - - -Node3->Node2 - - - + + +Node5->Node4 + + + diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index e0d93f929..135634386 100644 --- a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -4,25 +4,25 @@ - - + + main Node1 - -main + +main Node2 - - -sieve + + +print @@ -30,35 +30,71 @@ Node1->Node2 - - + + + + + + + +Node4 + + +sieve + + + + + +Node1->Node4 + + + + + + + + +Node5 + + +tests + + + + + +Node1->Node5 + + + Node3 - - -tests + + +std::endl - - -Node1->Node3 - - - + + +Node2->Node3 + + + - - -Node3->Node2 - - - + + +Node5->Node4 + + + diff --git a/d8/dee/avltree_8cpp.html b/d8/dee/avltree_8cpp.html index 488503870..67e8e5957 100644 --- a/d8/dee/avltree_8cpp.html +++ b/d8/dee/avltree_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/avltree.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -99,8 +101,7 @@ $(document).ready(function(){initNavTree('d8/dee/avltree_8cpp.html','../../'); i
    Typedefs | -Functions | -Variables
    +Functions
    avltree.cpp File Reference
    @@ -118,73 +119,77 @@ Include dependency graph for avltree.cpp:
    - - - + + +

    Typedefs

    using node = node { int data
     for std::queue
     
    using node
     for std::queue
     
    - + - + - + - + - + - + - + - + - + - + - + -

    Functions

    node * createNode (int data)
    node * createNode (int data)
     creates and returns a new node
     
    int height (node *root)
    int height (node *root)
     
    int getBalance (node *root)
    int getBalance (node *root)
     
    node * rightRotate (node *root)
    node * rightRotate (node *root)
     
    node * leftRotate (node *root)
    node * leftRotate (node *root)
     
    node * minValue (node *root)
    node * minValue (node *root)
     
    node * insert (node *root, int item)
    node * insert (node *root, int item)
     inserts a new element into AVL tree
     
    node * deleteNode (node *root, int element)
    node * deleteNode (node *root, int element)
     removes a given element from AVL tree
     
    void deleteAllNodes (const node *const root)
    void deleteAllNodes (const node *const root)
     calls delete on every node
     
    void levelOrder (node *root)
    void levelOrder (node *root)
     prints given tree in the LevelOrder
     
    int main ()
    int main ()
     Main function.
     
    - - - - - - -

    -Variables

    -int height
     
    -struct node * left
     
    -struct node * right
     

    Detailed Description

    A simple tree implementation using nodes.

    -
    Todo:
    update code to use C++ STL library features and OO structure
    +
    Todo
    update code to use C++ STL library features and OO structure
    Warning
    This program is a poor implementation and does not utilize any of the C++ STL features.

    Typedef Documentation

    - -

    ◆ node

    + +

    ◆ node

    - +
    using node = node { int datausing node
    - +Initial value:
    struct node {
    +
    int data;
    +
    int height;
    +
    struct node *left;
    +
    struct node *right;
    +
    }
    +
    height
    int height(node *root)
    Definition avltree.cpp:38
    +
    node
    Definition binary_search_tree.cpp:11
    +

    for std::queue

    for std::max for std::cout

    - +
    13 {
    +
    14 int data;
    +
    15 int height;
    +
    16 struct node *left;
    +
    17 struct node *right;
    +
    18};
    +
    data
    int data[MAX]
    test data
    Definition hash_search.cpp:24
    +
    std::right
    T right(T... args)
    +

    Function Documentation

    @@ -197,8 +202,7 @@ struct node *  node * createNode ( - int  - data) + int data) @@ -213,16 +217,14 @@ struct node * 
    Returns
    newly created node
    25 {
    -
    26 node *nn = new node();
    +
    26 node *nn = new node();
    27 nn->data = data;
    28 nn->height = 0;
    29 nn->left = nullptr;
    30 nn->right = nullptr;
    31 return nn;
    32}
    -
    node
    node { int data node
    for std::queue
    Definition avltree.cpp:14
    -
    data
    int data[MAX]
    test data
    Definition hash_search.cpp:24
    -
    node
    Definition binary_search_tree.cpp:11
    +
    node
    struct node { int data; int height; struct node *left; struct node *right;} node
    for std::queue
    Definition avltree.cpp:13
    @@ -235,8 +237,7 @@ struct node *  void deleteAllNodes ( - const node *const  - root) + const node *const root) @@ -251,12 +252,12 @@ struct node * 
    151 {
    152 if (root) {
    -
    153 deleteAllNodes(root->left);
    -
    154 deleteAllNodes(root->right);
    +
    153 deleteAllNodes(root->left);
    +
    154 deleteAllNodes(root->right);
    155 delete root;
    156 }
    157}
    -
    deleteAllNodes
    void deleteAllNodes(const node *const root)
    calls delete on every node
    Definition avltree.cpp:151
    +
    deleteAllNodes
    void deleteAllNodes(const node *const root)
    calls delete on every node
    Definition avltree.cpp:151
    Here is the call graph for this function:
    @@ -274,19 +275,12 @@ Here is the call graph for this function:
    node * deleteNode ( - node *  - root, + node * root, - int  - element  - - - - ) - + int element )
    @@ -305,9 +299,9 @@ Here is the call graph for this function:
    124 return root;
    125 }
    126 if (element < root->data) {
    -
    127 root->left = deleteNode(root->left, element);
    +
    127 root->left = deleteNode(root->left, element);
    128 } else if (element > root->data) {
    -
    129 root->right = deleteNode(root->right, element);
    +
    129 root->right = deleteNode(root->right, element);
    130
    131 } else {
    132 // Node to be deleted is leaf node or have only one Child
    @@ -317,15 +311,15 @@ Here is the call graph for this function:
    136 return temp;
    137 }
    138 // Node to be deleted have both left and right subtrees
    -
    139 node *temp = minValue(root->right);
    +
    139 node *temp = minValue(root->right);
    140 root->data = temp->data;
    -
    141 root->right = deleteNode(root->right, temp->data);
    +
    141 root->right = deleteNode(root->right, temp->data);
    142 }
    143 // Balancing Tree after deletion
    144 return root;
    145}
    -
    minValue
    node * minValue(node *root)
    Definition avltree.cpp:79
    -
    deleteNode
    node * deleteNode(node *root, int element)
    removes a given element from AVL tree
    Definition avltree.cpp:122
    +
    minValue
    node * minValue(node *root)
    Definition avltree.cpp:79
    +
    deleteNode
    node * deleteNode(node *root, int element)
    removes a given element from AVL tree
    Definition avltree.cpp:122
    std::vector::data
    T data(T... args)
    Here is the call graph for this function:
    @@ -344,8 +338,7 @@ Here is the call graph for this function: int getBalance ( - node *  - root) + node * root) @@ -357,8 +350,13 @@ Here is the call graph for this function:
    Returns
    difference between height of left and right subtree
    -
    49{ return height(root->left) - height(root->right); }
    -
    +
    49{ return height(root->left) - height(root->right); }
    +
    +Here is the call graph for this function:
    +
    +
    +
    + @@ -370,8 +368,7 @@ Here is the call graph for this function: int height ( - node *  - root) + node * root) @@ -387,13 +384,13 @@ Here is the call graph for this function:
    39 if (root == nullptr) {
    40 return 0;
    41 }
    -
    42 return 1 + std::max(height(root->left), height(root->right));
    +
    42 return 1 + std::max(height(root->left), height(root->right));
    43}
    std::max
    T max(T... args)
    Here is the call graph for this function:
    -
    +
    @@ -407,19 +404,12 @@ Here is the call graph for this function: node * insert ( - node *  - root, + node * root, - int  - item  - - - - ) - + int item )
    @@ -435,36 +425,36 @@ Here is the call graph for this function:
    Returns
    root of the updated tree
    92 {
    93 if (root == nullptr) {
    -
    94 return createNode(item);
    +
    94 return createNode(item);
    95 }
    96 if (item < root->data) {
    -
    97 root->left = insert(root->left, item);
    +
    97 root->left = insert(root->left, item);
    98 } else {
    -
    99 root->right = insert(root->right, item);
    +
    99 root->right = insert(root->right, item);
    100 }
    -
    101 int b = getBalance(root);
    +
    101 int b = getBalance(root);
    102 if (b > 1) {
    -
    103 if (getBalance(root->left) < 0) {
    -
    104 root->left = leftRotate(root->left); // Left-Right Case
    +
    103 if (getBalance(root->left) < 0) {
    +
    104 root->left = leftRotate(root->left); // Left-Right Case
    105 }
    -
    106 return rightRotate(root); // Left-Left Case
    +
    106 return rightRotate(root); // Left-Left Case
    107 } else if (b < -1) {
    -
    108 if (getBalance(root->right) > 0) {
    -
    109 root->right = rightRotate(root->right); // Right-Left Case
    +
    108 if (getBalance(root->right) > 0) {
    +
    109 root->right = rightRotate(root->right); // Right-Left Case
    110 }
    -
    111 return leftRotate(root); // Right-Right Case
    +
    111 return leftRotate(root); // Right-Right Case
    112 }
    113 return root;
    114}
    -
    insert
    node * insert(node *root, int item)
    inserts a new element into AVL tree
    Definition avltree.cpp:92
    -
    leftRotate
    node * leftRotate(node *root)
    Definition avltree.cpp:67
    -
    createNode
    node * createNode(int data)
    creates and returns a new node
    Definition avltree.cpp:25
    -
    getBalance
    int getBalance(node *root)
    Definition avltree.cpp:49
    -
    rightRotate
    node * rightRotate(node *root)
    Definition avltree.cpp:55
    +
    insert
    node * insert(node *root, int item)
    inserts a new element into AVL tree
    Definition avltree.cpp:92
    +
    leftRotate
    node * leftRotate(node *root)
    Definition avltree.cpp:67
    +
    createNode
    node * createNode(int data)
    creates and returns a new node
    Definition avltree.cpp:25
    +
    getBalance
    int getBalance(node *root)
    Definition avltree.cpp:49
    +
    rightRotate
    node * rightRotate(node *root)
    Definition avltree.cpp:55
    Here is the call graph for this function:
    -
    +
    @@ -478,8 +468,7 @@ Here is the call graph for this function: node * leftRotate ( - node *  - root) + node * root) @@ -510,8 +499,7 @@ Here is the call graph for this function: void levelOrder ( - node *  - root) + node * root) @@ -558,8 +546,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -571,23 +558,23 @@ Here is the call graph for this function:
    184 // Testing AVL Tree
    185 node *root = nullptr;
    186 int i = 0;
    -
    187 for (i = 1; i <= 7; i++) root = insert(root, i);
    +
    187 for (i = 1; i <= 7; i++) root = insert(root, i);
    188 std::cout << "LevelOrder: ";
    -
    189 levelOrder(root);
    -
    190 root = deleteNode(root, 1); // Deleting key with value 1
    +
    189 levelOrder(root);
    +
    190 root = deleteNode(root, 1); // Deleting key with value 1
    191 std::cout << "\nLevelOrder: ";
    -
    192 levelOrder(root);
    -
    193 root = deleteNode(root, 4); // Deletin key with value 4
    +
    192 levelOrder(root);
    +
    193 root = deleteNode(root, 4); // Deletin key with value 4
    194 std::cout << "\nLevelOrder: ";
    -
    195 levelOrder(root);
    -
    196 deleteAllNodes(root);
    +
    195 levelOrder(root);
    +
    196 deleteAllNodes(root);
    197 return 0;
    198}
    -
    levelOrder
    void levelOrder(node *root)
    prints given tree in the LevelOrder
    Definition avltree.cpp:163
    +
    levelOrder
    void levelOrder(node *root)
    prints given tree in the LevelOrder
    Definition avltree.cpp:163
    Here is the call graph for this function:
    -
    +
    @@ -601,8 +588,7 @@ Here is the call graph for this function: node * minValue ( - node *  - root) + node * root) @@ -618,7 +604,7 @@ Here is the call graph for this function:
    80 if (root->left == nullptr) {
    81 return root;
    82 }
    -
    83 return minValue(root->left);
    +
    83 return minValue(root->left);
    84}
    Here is the call graph for this function:
    @@ -637,8 +623,7 @@ Here is the call graph for this function: node * rightRotate ( - node *  - root) + node * root) @@ -666,7 +651,7 @@ Here is the call graph for this function: diff --git a/d8/dee/avltree_8cpp.js b/d8/dee/avltree_8cpp.js index 90d71f423..19fceb0c2 100644 --- a/d8/dee/avltree_8cpp.js +++ b/d8/dee/avltree_8cpp.js @@ -1,6 +1,6 @@ var avltree_8cpp = [ - [ "node", "d8/dee/avltree_8cpp.html#a3e7e4d8f7f8e212c1d31fe6b5d5da66a", null ], + [ "node", "d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287", null ], [ "createNode", "d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6", null ], [ "deleteAllNodes", "d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c", null ], [ "deleteNode", "d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5", null ], diff --git a/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.map b/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.map index e6c92ba9d..10c26e033 100644 --- a/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.map +++ b/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.map @@ -1,12 +1,17 @@ - + - - - - + + + + + + + + + diff --git a/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.md5 b/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.md5 index 3139a7dde..60d5b32c4 100644 --- a/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.md5 +++ b/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.md5 @@ -1 +1 @@ -1a7f011c59e0b41ceab57c8e5c8ef5cd \ No newline at end of file +87c01be2b9e4ed83ed5c49dacda99fe8 \ No newline at end of file diff --git a/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.svg b/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.svg index 80df9e1ed..327da394d 100644 --- a/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.svg +++ b/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.svg @@ -4,8 +4,8 @@ - + + + + +getBalance + + +Node1 + + +getBalance + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph_org.svg b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph_org.svg new file mode 100644 index 000000000..73bbb58bd --- /dev/null +++ b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph_org.svg @@ -0,0 +1,66 @@ + + + + + + +getBalance + + +Node1 + + +getBalance + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + diff --git a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map index 5b43a392f..bd05216f6 100644 --- a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map +++ b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map @@ -1,5 +1,6 @@ - - - + + + + diff --git a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5 b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5 index 1cefd46d4..686de6f25 100644 --- a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5 +++ b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5 @@ -1 +1 @@ -7af667a67e0eed65bcedf20bab3831c5 \ No newline at end of file +e7cb9a35d598cb4951da940253f6e605 \ No newline at end of file diff --git a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg index 24fc11f2b..3691795a7 100644 --- a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg +++ b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg @@ -4,8 +4,8 @@ - + - + height @@ -27,6 +27,15 @@ + + +Node1->Node1 + + + + + + Node2 @@ -37,9 +46,9 @@ - + Node1->Node2 - + diff --git a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph_org.svg b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph_org.svg index 1f3c44d81..fda06c69a 100644 --- a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph_org.svg +++ b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph_org.svg @@ -4,9 +4,9 @@ - - + + height @@ -17,6 +17,15 @@ + + +Node1->Node1 + + + + + + Node2 @@ -27,9 +36,9 @@ - + Node1->Node2 - + diff --git a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 20202884e..5046d800f 100644 --- a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -6,23 +6,28 @@ - - + + - - + + - - - - - + + + + + + + + + + diff --git a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 98bdd14b3..3bd476412 100644 --- a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -03a5532a501c7485618a1e7c2dfa1a78 \ No newline at end of file +54fda7c297af6879115664c67a41bc2e \ No newline at end of file diff --git a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 3aad77640..db8b78351 100644 --- a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,8 +4,8 @@ - + - + string_search::brute_force @@ -28,15 +28,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -47,9 +38,9 @@ - + Node1->Node2 - + @@ -65,9 +56,9 @@ - + Node1->Node3 - + diff --git a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph_org.svg b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph_org.svg index 606a5c632..145f3a0be 100644 --- a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph_org.svg +++ b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph_org.svg @@ -4,9 +4,9 @@ - - + + string_search::brute_force @@ -18,15 +18,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -37,9 +28,9 @@ - + Node1->Node2 - + @@ -55,9 +46,9 @@ - + Node1->Node3 - + diff --git a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html index 173299b05..66d0beef6 100644 --- a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html +++ b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others::iterative_tree_traversals::BinaryTree Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -105,21 +107,21 @@ $(document).ready(function(){initNavTree('d9/d12/classothers_1_1iterative__tree_

    defines the functions associated with the binary tree - More...

    + More...

    - + - - + + - - + + - - + +

    Public Member Functions

    Node * createNewNode (int64_t)
    Node * createNewNode (int64_t)
     function that will create new node for insertion.
     
    std::vector< int64_t > preOrderIterative (Node *)
     preOrderIterative() function that will perform the preorder traversal iteratively, and return the result array that contain the preorder traversal of a tree.
    std::vector< int64_t > preOrderIterative (Node *)
     preOrderIterative() function that will perform the preorder traversal iteratively, and return the result array that contain the preorder traversal of a tree.
     
    std::vector< int64_t > postOrderIterative (Node *)
     postOrderIterative() function that will perform the postorder traversal iteratively, and return the result array that contain the postorder traversal of a tree.
    std::vector< int64_t > postOrderIterative (Node *)
     postOrderIterative() function that will perform the postorder traversal iteratively, and return the result array that contain the postorder traversal of a tree.
     
    std::vector< int64_t > inOrderIterative (Node *)
     inOrderIterative() function that will perform the inorder traversal iteratively, and return the result array that contain the inorder traversal of a tree.
    std::vector< int64_t > inOrderIterative (Node *)
     inOrderIterative() function that will perform the inorder traversal iteratively, and return the result array that contain the inorder traversal of a tree.
     

    Detailed Description

    @@ -134,8 +136,7 @@ Public Member Functions Node * others::iterative_tree_traversals::BinaryTree::createNewNode ( - int64_t  - data) + int64_t data) @@ -154,8 +155,9 @@ Public Member Functions
    89 Node *node = new Node();
    90 node->data = data;
    91 node->left = node->right = nullptr;
    -
    92 return node;
    +
    92 return node;
    93}
    +
    node
    struct node { int data; int height; struct node *left; struct node *right;} node
    for std::queue
    Definition avltree.cpp:13
    data
    int data[MAX]
    test data
    Definition hash_search.cpp:24
    Node
    Definition linkedlist_implentation_usingarray.cpp:14
    node
    Definition binary_search_tree.cpp:11
    @@ -171,14 +173,13 @@ Public Member Functions std::vector< int64_t > others::iterative_tree_traversals::BinaryTree::inOrderIterative ( - Node *  - root) + Node * root)
    -

    inOrderIterative() function that will perform the inorder traversal iteratively, and return the result array that contain the inorder traversal of a tree.

    +

    inOrderIterative() function that will perform the inorder traversal iteratively, and return the result array that contain the inorder traversal of a tree.

    function that takes root of the tree as an argument, and returns its inorder traversal.

    Parameters
    @@ -232,14 +233,13 @@ Here is the call graph for this function: - - +
    std::vector< int64_t > others::iterative_tree_traversals::BinaryTree::postOrderIterative (Node * root)Node * root)
    -

    postOrderIterative() function that will perform the postorder traversal iteratively, and return the result array that contain the postorder traversal of a tree.

    +

    postOrderIterative() function that will perform the postorder traversal iteratively, and return the result array that contain the postorder traversal of a tree.

    function that takes root of the tree as an argument, and returns its postorder traversal.

    Parameters
    @@ -292,14 +292,13 @@ Here is the call graph for this function: - - +
    std::vector< int64_t > others::iterative_tree_traversals::BinaryTree::preOrderIterative (Node * root)Node * root)
    -

    preOrderIterative() function that will perform the preorder traversal iteratively, and return the result array that contain the preorder traversal of a tree.

    +

    preOrderIterative() function that will perform the preorder traversal iteratively, and return the result array that contain the preorder traversal of a tree.

    function that takes root of the tree as an argument, and returns its preorder traversal.

    Parameters
    @@ -349,7 +348,7 @@ Here is the call graph for this function: diff --git a/d9/d13/namespaceinversion.html b/d9/d13/namespaceinversion.html index 6c34f2dc4..9972abed9 100644 --- a/d9/d13/namespaceinversion.html +++ b/d9/d13/namespaceinversion.html @@ -3,16 +3,18 @@ - +Algorithms_in_C++: inversion Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d9/d13/namespaceinversion.html','../..

    Functions for counting inversions using Merge Sort algorithm. -More...

    +More...

    Detailed Description

    Functions for counting inversions using Merge Sort algorithm.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d9/d13/namespaceinversion.html','../.. diff --git a/d9/d14/array__left__rotation_8cpp.html b/d9/d14/array__left__rotation_8cpp.html index 0c804a1ef..a6f4f0bd0 100644 --- a/d9/d14/array__left__rotation_8cpp.html +++ b/d9/d14/array__left__rotation_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: operations_on_datastructures/array_left_rotation.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -147,10 +149,10 @@ Functions void tests::test5 ()  A Test to check a shift of zero.
      -static void test () +static void test ()  Function to test the correctness of shift_left() function.
      -int main () +int main ()  main function
      @@ -167,8 +169,7 @@ Functions int main ( - void  - ) + void ) @@ -177,10 +178,10 @@ Functions

    main function

    Returns
    0 on exit
    171 {
    -
    172 test(); // run self-test implementations
    +
    172 test(); // run self-test implementations
    173 return 0;
    174}
    -
    test
    static void test()
    Function to test the correctness of shift_left() function.
    Definition array_left_rotation.cpp:159
    +
    test
    static void test()
    Function to test the correctness of shift_left() function.
    Definition array_left_rotation.cpp:159
    Here is the call graph for this function:
    @@ -201,7 +202,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -240,7 +241,7 @@ Here is the call graph for this function:
    diff --git a/d9/d21/classmachine__learning_1_1adaline-members.html b/d9/d21/classmachine__learning_1_1adaline-members.html index ad68924e6..c11287a42 100644 --- a/d9/d21/classmachine__learning_1_1adaline-members.html +++ b/d9/d21/classmachine__learning_1_1adaline-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -118,7 +120,7 @@ $(document).ready(function(){initNavTree('d6/d30/classmachine__learning_1_1adali diff --git a/d9/d21/namespacewave__sort.html b/d9/d21/namespacewave__sort.html index 200cb4a1d..dad441133 100644 --- a/d9/d21/namespacewave__sort.html +++ b/d9/d21/namespacewave__sort.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: wave_sort Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d9/d21/namespacewave__sort.html','../.

    Functions for the Wave sort implementation. -More...

    +More...

    Detailed Description

    Functions for the Wave sort implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d9/d21/namespacewave__sort.html','../. diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor.html b/d9/d23/classgraph_1_1_lowest_common_ancestor.html index 0b01aa5d7..cfa5e55d1 100644 --- a/d9/d23/classgraph_1_1_lowest_common_ancestor.html +++ b/d9/d23/classgraph_1_1_lowest_common_ancestor.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph::LowestCommonAncestor Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -108,15 +110,15 @@ $(document).ready(function(){initNavTree('d9/d23/classgraph_1_1_lowest_common_an
    Collaboration diagram for graph::LowestCommonAncestor:
    -
    +
    [legend]
    - + - +

    Public Member Functions

     LowestCommonAncestor (const RootedTree &tree_)
     LowestCommonAncestor (const RootedTree &tree_)
     Stores the tree and precomputs "up lifts".
     
    int lowest_common_ancestor (int u, int v) const
    int lowest_common_ancestor (int u, int v) const
     Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid indices of vertices. Iterativelly modifies ("lifts") u an v until it finnds their lowest common ancestor.
     
    @@ -132,7 +134,7 @@ const RootedTr
    - +

    Protected Member Functions

    void populate_up ()
    void populate_up ()
     

    Detailed Description

    @@ -150,8 +152,7 @@ Protected Member Functions graph::LowestCommonAncestor::LowestCommonAncestor ( - const RootedTree &  - tree_) + const RootedTree & tree_) @@ -170,9 +171,9 @@ Protected Member Functions
    151 : tree(tree_) {
    -
    152 populate_up();
    +
    152 populate_up();
    153 }
    -
    graph::LowestCommonAncestor::populate_up
    void populate_up()
    Definition lowest_common_ancestor.cpp:212
    +
    graph::LowestCommonAncestor::populate_up
    void populate_up()
    Definition lowest_common_ancestor.cpp:212
    Here is the call graph for this function:
    @@ -194,19 +195,12 @@ Here is the call graph for this function:
    int graph::LowestCommonAncestor::lowest_common_ancestor ( - int  - u, + int u, - int  - v  - - - - ) - const + int v ) const @@ -235,7 +229,7 @@ Here is the call graph for this function:
    171 int level_diff = tree.level[u] - tree.level[v];
    172 for (int i = 0; (1 << i) <= level_diff; ++i) {
    173 if (level_diff & (1 << i)) {
    -
    174 u = up[u][i];
    +
    174 u = up[u][i];
    175 }
    176 }
    177 assert(tree.level[u] == tree.level[v]);
    @@ -245,20 +239,20 @@ Here is the call graph for this function:
    181 }
    182
    183 // "Lift" u and v to their 2^i th ancestor if they are different
    -
    184 for (int i = static_cast<int>(up[u].size()) - 1; i >= 0; --i) {
    -
    185 if (up[u][i] != up[v][i]) {
    -
    186 u = up[u][i];
    -
    187 v = up[v][i];
    +
    184 for (int i = static_cast<int>(up[u].size()) - 1; i >= 0; --i) {
    +
    185 if (up[u][i] != up[v][i]) {
    +
    186 u = up[u][i];
    +
    187 v = up[v][i];
    188 }
    189 }
    190
    191 // As we regressed u an v such that they cannot further be lifted so
    192 // that their ancestor would be different, the only logical
    193 // consequence is that their parent is the sought answer.
    -
    194 assert(up[u][0] == up[v][0]);
    -
    195 return up[u][0];
    +
    194 assert(up[u][0] == up[v][0]);
    +
    195 return up[u][0];
    196 }
    -
    graph::LowestCommonAncestor::up
    std::vector< std::vector< int > > up
    for every vertex stores a list of its ancestors by powers of two For each vertex, the first element o...
    Definition lowest_common_ancestor.cpp:206
    +
    graph::LowestCommonAncestor::up
    std::vector< std::vector< int > > up
    for every vertex stores a list of its ancestors by powers of two For each vertex, the first element o...
    Definition lowest_common_ancestor.cpp:206
    graph::RootedTree::level
    std::vector< int > level
    Stores the distance from the root.
    Definition lowest_common_ancestor.cpp:106
    std::swap
    T swap(T... args)
    @@ -281,7 +275,7 @@ Here is the call graph for this function:
    void graph::LowestCommonAncestor::populate_up ( - ) + ) @@ -293,16 +287,16 @@ Here is the call graph for this function:

    Populate the "up" structure. See above.

    212 {
    -
    213 up.resize(tree.number_of_vertices());
    +
    213 up.resize(tree.number_of_vertices());
    214 for (int vertex = 0; vertex < tree.number_of_vertices(); ++vertex) {
    -
    215 up[vertex].push_back(tree.parent[vertex]);
    +
    215 up[vertex].push_back(tree.parent[vertex]);
    216 }
    217 for (int level = 0; (1 << level) < tree.number_of_vertices(); ++level) {
    218 for (int vertex = 0; vertex < tree.number_of_vertices(); ++vertex) {
    219 // up[vertex][level + 1] = 2^(level + 1) th ancestor of vertex =
    220 // = 2^level th ancestor of 2^level th ancestor of vertex =
    221 // = 2^level th ancestor of up[vertex][level]
    -
    222 up[vertex].push_back(up[up[vertex][level]][level]);
    +
    222 up[vertex].push_back(up[up[vertex][level]][level]);
    223 }
    224 }
    225 }
    @@ -327,7 +321,7 @@ Here is the call graph for this function:
    diff --git a/d9/d24/poisson__dist_8cpp.html b/d9/d24/poisson__dist_8cpp.html index 40095ecdd..1bf60c83b 100644 --- a/d9/d24/poisson__dist_8cpp.html +++ b/d9/d24/poisson__dist_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: probability/poisson_dist.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,17 +117,17 @@ Include dependency graph for poisson_dist.cpp:
    - + - + - + - + - + - +

    Functions

    double poisson_rate (double events, double timeframe)
    double poisson_rate (double events, double timeframe)
     
    double poisson_expected (double rate, double time)
    double poisson_expected (double rate, double time)
     
    double fact (double x)
    double fact (double x)
     
    double poisson_x_successes (double expected, double x)
    double poisson_x_successes (double expected, double x)
     
    double poisson_range_successes (double expected, double lower, double upper)
    double poisson_range_successes (double expected, double lower, double upper)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -141,8 +143,7 @@ Functions double fact ( - double  - x) + double x) @@ -171,8 +172,7 @@ Functions int main ( - void  - ) + void ) @@ -180,25 +180,25 @@ Functions

    main function

    65 {
    66 double rate, expected;
    -
    67 rate = poisson_rate(3, 1);
    +
    67 rate = poisson_rate(3, 1);
    68 std::cout << "Poisson rate : " << rate << std::endl;
    69
    -
    70 expected = poisson_expected(rate, 2);
    +
    70 expected = poisson_expected(rate, 2);
    71 std::cout << "Poisson expected : " << expected << std::endl;
    72
    -
    73 std::cout << "Poisson 0 successes : " << poisson_x_successes(expected, 0)
    +
    73 std::cout << "Poisson 0 successes : " << poisson_x_successes(expected, 0)
    74 << std::endl;
    75 std::cout << "Poisson 0-8 successes : "
    -
    76 << poisson_range_successes(expected, 0, 8) << std::endl;
    +
    76 << poisson_range_successes(expected, 0, 8) << std::endl;
    77
    78 return 0;
    79}
    std::endl
    T endl(T... args)
    -
    poisson_x_successes
    double poisson_x_successes(double expected, double x)
    Definition poisson_dist.cpp:46
    -
    poisson_rate
    double poisson_rate(double events, double timeframe)
    Definition poisson_dist.cpp:17
    -
    poisson_expected
    double poisson_expected(double rate, double time)
    Definition poisson_dist.cpp:25
    -
    poisson_range_successes
    double poisson_range_successes(double expected, double lower, double upper)
    Definition poisson_dist.cpp:54
    +
    poisson_x_successes
    double poisson_x_successes(double expected, double x)
    Definition poisson_dist.cpp:46
    +
    poisson_rate
    double poisson_rate(double events, double timeframe)
    Definition poisson_dist.cpp:17
    +
    poisson_expected
    double poisson_expected(double rate, double time)
    Definition poisson_dist.cpp:25
    +
    poisson_range_successes
    double poisson_range_successes(double expected, double lower, double upper)
    Definition poisson_dist.cpp:54
    Here is the call graph for this function:
    @@ -216,19 +216,12 @@ Here is the call graph for this function:
    double poisson_expected ( - double  - rate, + double rate, - double  - time  - - - - ) - + double time )
    @@ -247,25 +240,17 @@ Here is the call graph for this function:
    double poisson_range_successes ( - double  - expected, + double expected, - double  - lower, + double lower, - double  - upper  - - - - ) - + double upper )
    @@ -275,7 +260,7 @@ Here is the call graph for this function:
    54 {
    55 double probability = 0;
    56 for (int i = lower; i <= upper; i++) {
    -
    57 probability += poisson_x_successes(expected, i);
    +
    57 probability += poisson_x_successes(expected, i);
    58 }
    59 return probability;
    60}
    @@ -298,19 +283,12 @@ Here is the call graph for this function:
    double poisson_rate ( - double  - events, + double events, - double  - timeframe  - - - - ) - + double timeframe )
    @@ -332,19 +310,12 @@ e.g 5 dollars every 2 mins = 5 / 2 = 2.5

    double poisson_x_successes ( - double  - expected, + double expected, - double  - x  - - - - ) - + double x )
    @@ -352,10 +323,10 @@ e.g 5 dollars every 2 mins = 5 / 2 = 2.5

    \[p(\mu,x) = \frac{\mu^x e^{-\mu}}{x!}\]

    46 {
    -
    47 return (std::pow(expected, x) * std::exp(-expected)) / fact(x);
    +
    47 return (std::pow(expected, x) * std::exp(-expected)) / fact(x);
    48}
    std::exp
    T exp(T... args)
    -
    fact
    double fact(double x)
    Definition poisson_dist.cpp:30
    +
    fact
    double fact(double x)
    Definition poisson_dist.cpp:30
    std::pow
    T pow(T... args)
    Here is the call graph for this function:
    @@ -371,7 +342,7 @@ Here is the call graph for this function:
    diff --git a/d9/d27/namespacelist__array.html b/d9/d27/namespacelist__array.html index b55ef6c9e..d239d0713 100644 --- a/d9/d27/namespacelist__array.html +++ b/d9/d27/namespacelist__array.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: list_array Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d9/d27/namespacelist__array.html','../

    Functions for Dynamic Array algorithm. -More...

    +More...

    Detailed Description

    Functions for Dynamic Array algorithm.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d9/d27/namespacelist__array.html','../ diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp.html b/d9/d29/ground__to__ground__projectile__motion_8cpp.html index 070d06d89..017e5d8e1 100644 --- a/d9/d29/ground__to__ground__projectile__motion_8cpp.html +++ b/d9/d29/ground__to__ground__projectile__motion_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: physics/ground_to_ground_projectile_motion.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,25 +128,25 @@ Namespaces - + - + - + - + - + - +

    Functions

    double physics::ground_to_ground_projectile_motion::degrees_to_radians (double radian, double PI=3.14)
    double physics::ground_to_ground_projectile_motion::degrees_to_radians (double radian, double PI=3.14)
     Convert radians to degrees.
     
    template<typename T >
    T physics::ground_to_ground_projectile_motion::time_of_flight (T initial_velocity, T angle, double gravity=9.81)
    T physics::ground_to_ground_projectile_motion::time_of_flight (T initial_velocity, T angle, double gravity=9.81)
     Calculate the time of flight.
     
    template<typename T >
    T physics::ground_to_ground_projectile_motion::horizontal_range (T initial_velocity, T angle, T time)
    T physics::ground_to_ground_projectile_motion::horizontal_range (T initial_velocity, T angle, T time)
     Calculate the horizontal distance that the projectile travels.
     
    template<typename T >
    T physics::ground_to_ground_projectile_motion::max_height (T initial_velocity, T angle, double gravity=9.81)
    T physics::ground_to_ground_projectile_motion::max_height (T initial_velocity, T angle, double gravity=9.81)
     Calculate the max height of the projectile.
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -162,19 +164,12 @@ Functions double physics::ground_to_ground_projectile_motion::degrees_to_radians ( - double  - radian, + double radian, - double  - PI = 3.14  - - - - ) - + double PI = 3.14 )
    @@ -210,25 +205,17 @@ template<typename T >
    T physics::ground_to_ground_projectile_motion::horizontal_range ( - T  - initial_velocity, + T initial_velocity, - T  - angle, + T angle, - T  - time  - - - - ) - + T time )
    @@ -243,11 +230,11 @@ template<typename T >
    Returns
    Horizontal distance that the projectile travels
    57 {
    -
    58 double Vix = initial_velocity * (std::cos(degrees_to_radians(angle))); // calculate x component of the initial velocity
    +
    58 double Vix = initial_velocity * (std::cos(degrees_to_radians(angle))); // calculate x component of the initial velocity
    59 return Vix * time;
    60}
    std::cos
    T cos(T... args)
    -
    physics::ground_to_ground_projectile_motion::degrees_to_radians
    double degrees_to_radians(double radian, double PI=3.14)
    Convert radians to degrees.
    Definition ground_to_ground_projectile_motion.cpp:33
    +
    physics::ground_to_ground_projectile_motion::degrees_to_radians
    double degrees_to_radians(double radian, double PI=3.14)
    Convert radians to degrees.
    Definition ground_to_ground_projectile_motion.cpp:33
    std::time
    T time(T... args)
    Here is the call graph for this function:
    @@ -266,8 +253,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -276,10 +262,10 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    136 {
    -
    137 test(); // run self-test implementations
    +
    137 test(); // run self-test implementations
    138 return 0;
    139}
    -
    test
    static void test()
    Self-test implementations.
    Definition ground_to_ground_projectile_motion.cpp:81
    +
    test
    static void test()
    Self-test implementations.
    Definition ground_to_ground_projectile_motion.cpp:81
    Here is the call graph for this function:
    @@ -299,25 +285,17 @@ template<typename T >
    T physics::ground_to_ground_projectile_motion::max_height ( - T  - initial_velocity, + T initial_velocity, - T  - angle, + T angle, - double  - gravity = 9.81  - - - - ) - + double gravity = 9.81 )
    @@ -333,7 +311,7 @@ template<typename T >
    Returns
    The max height that the projectile reaches
    70 {
    -
    71 double Viy = initial_velocity * (std::sin(degrees_to_radians(angle))); // calculate y component of the initial velocity
    +
    71 double Viy = initial_velocity * (std::sin(degrees_to_radians(angle))); // calculate y component of the initial velocity
    72 return (std::pow(Viy, 2) / (2.0 * gravity));
    73}
    std::pow
    T pow(T... args)
    @@ -358,7 +336,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -443,25 +421,17 @@ template<typename T > T physics::ground_to_ground_projectile_motion::time_of_flight ( - T  - initial_velocity, + T initial_velocity, - T  - angle, + T angle, - double  - gravity = 9.81  - - - - ) - + double gravity = 9.81 )
    @@ -477,7 +447,7 @@ template<typename T >
    Returns
    The time that the projectile is in the air for
    45 {
    -
    46 double Viy = initial_velocity * (std::sin(degrees_to_radians(angle))); // calculate y component of the initial velocity
    +
    46 double Viy = initial_velocity * (std::sin(degrees_to_radians(angle))); // calculate y component of the initial velocity
    47 return 2.0 * Viy / gravity;
    48}
    @@ -494,7 +464,7 @@ Here is the call graph for this function:
    diff --git a/d9/d2c/class_test_cases-members.html b/d9/d2c/class_test_cases-members.html index 14d25fd6d..06ea65fa4 100644 --- a/d9/d2c/class_test_cases-members.html +++ b/d9/d2c/class_test_cases-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -123,7 +125,7 @@ $(document).ready(function(){initNavTree('d5/d58/class_test_cases.html','../../' diff --git a/d9/d31/coin__change__topdown_8cpp.html b/d9/d31/coin__change__topdown_8cpp.html index 4f66bc76c..187902e13 100644 --- a/d9/d31/coin__change__topdown_8cpp.html +++ b/d9/d31/coin__change__topdown_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/coin_change_topdown.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,13 +130,13 @@ Namespaces

    Functions

    template<typename T > -int64_t dynamic_programming::mincoins_topdown::mincoins (const T &n, const std::vector< T > &coins, const int16_t &t, std::vector< T > dp) +int64_t dynamic_programming::mincoins_topdown::mincoins (const T &n, const std::vector< T > &coins, const int16_t &t, std::vector< T > dp)  This implementation is for finding minimum number of coins .
      -static void test () +static void test ()  Test implementations.
      -int main () +int main ()  Main function.
      @@ -155,8 +157,7 @@ Functions int main ( - void  - ) + void ) @@ -165,10 +166,10 @@ Functions

    Main function.

    Returns
    0 on exit
    91 {
    -
    92 test(); // execute the test
    +
    92 test(); // execute the test
    93 return 0;
    94}
    -
    test
    static void test()
    Test implementations.
    Definition coin_change_topdown.cpp:74
    +
    test
    static void test()
    Test implementations.
    Definition coin_change_topdown.cpp:74
    Here is the call graph for this function:
    @@ -188,31 +189,22 @@ template<typename T >
    int64_t dynamic_programming::mincoins_topdown::mincoins ( - const T &  - n, + const T & n, - const std::vector< T > &  - coins, + const std::vector< T > & coins, - const int16_t &  - t, + const int16_t & t, - std::vector< T >  - dp  - - - - ) - + std::vector< T > dp )
    @@ -240,14 +232,14 @@ template<typename T >
    56 for (int i = 0; i < t; i++) {
    57 if (n - coins[i] >= 0) { // if after subtracting the current
    58 // denomination is it greater than 0 or not
    -
    59 int sub = mincoins(n - coins[i], coins, t, dp);
    +
    59 int sub = mincoins(n - coins[i], coins, t, dp);
    60 ans = std::min(ans, sub + 1);
    61 }
    62 }
    63 dp[n] = ans;
    64 return dp[n]; // returns minimum number of coins
    65}
    -
    dynamic_programming::mincoins_topdown::mincoins
    int64_t mincoins(const T &n, const std::vector< T > &coins, const int16_t &t, std::vector< T > dp)
    This implementation is for finding minimum number of coins .
    Definition coin_change_topdown.cpp:47
    +
    dynamic_programming::mincoins_topdown::mincoins
    int64_t mincoins(const T &n, const std::vector< T > &coins, const int16_t &t, std::vector< T > dp)
    This implementation is for finding minimum number of coins .
    Definition coin_change_topdown.cpp:47
    std::min
    T min(T... args)
    dp
    for std::vector
    Definition partition_problem.cpp:39
    @@ -270,7 +262,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -312,7 +304,7 @@ Here is the call graph for this function: diff --git a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html b/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html index 233007db6..a3fd1d94e 100644 --- a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html +++ b/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: range_queries::heavy_light_decomposition::SG< X > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('d9/d35/classrange__queries_1_1heavy__l

    Segment Tree, to store heavy chains. - More...

    + More...

    Inheritance diagram for range_queries::heavy_light_decomposition::SG< X >:
    @@ -121,25 +123,25 @@ Collaboration diagram for range_queries::heavy_light_decomposition::SG< X > - + - + - + - + - +

    Private Member Functions

    X combine (X lhs, X rhs)
    X combine (X lhs, X rhs)
     Function that specifies the type of operation involved when segments are combined.
     
     SG (int size)
     SG (int size)
     Class parameterized constructor. Resizes the and initilizes the data members.
     
    void update (int p, X v)
    void update (int p, X v)
     Update the value at a node.
     
    X query (int l, int r)
    X query (int l, int r)
     Make a range query from node label l to node label r.
     
    void set_sret_init (X new_sret_init)
    void set_sret_init (X new_sret_init)
     Set the initialization for the query data type, based on requirement.
     
    - + - - +

    Private Attributes

    std::vector< X > s_tree
    std::vector< X > s_tree
     Everything here is private, and can only be accessed through the methods, in the derived class (HLD)
     
    @@ -182,8 +184,7 @@ template<typename X >
    range_queries::heavy_light_decomposition::SG< X >::SG (int size)int size)
    @@ -203,12 +204,12 @@ template<typename X >
    Returns
    void
    282 {
    -
    283 s_size = size;
    -
    284 s_tree.assign(2 * s_size, 0ll);
    +
    283 s_size = size;
    +
    284 s_tree.assign(2 * s_size, 0ll);
    285 }
    std::vector::assign
    T assign(T... args)
    -
    range_queries::heavy_light_decomposition::SG::s_size
    int s_size
    number of leaves in the segment tree
    Definition heavy_light_decomposition.cpp:263
    -
    range_queries::heavy_light_decomposition::SG::s_tree
    std::vector< X > s_tree
    Everything here is private, and can only be accessed through the methods, in the derived class (HLD)
    Definition heavy_light_decomposition.cpp:262
    +
    range_queries::heavy_light_decomposition::SG::s_size
    int s_size
    number of leaves in the segment tree
    Definition heavy_light_decomposition.cpp:263
    +
    range_queries::heavy_light_decomposition::SG::s_tree
    std::vector< X > s_tree
    Everything here is private, and can only be accessed through the methods, in the derived class (HLD)
    Definition heavy_light_decomposition.cpp:262
    Here is the call graph for this function:
    @@ -232,19 +233,12 @@ template<typename X >
    X range_queries::heavy_light_decomposition::SG< X >::combine ( - X  - lhs, + X lhs, - X  - rhs  - - - - ) - + X rhs ) @@ -281,19 +275,12 @@ template<typename X >
    X range_queries::heavy_light_decomposition::SG< X >::query ( - int  - l, + int l, - int  - r  - - - - ) - + int r ) @@ -313,19 +300,19 @@ template<typename X >
    Returns
    void
    305 {
    -
    306 X lhs = sret_init, rhs = sret_init;
    -
    307 for (l += s_size, r += s_size + 1; l < r; l >>= 1, r >>= 1) {
    +
    306 X lhs = sret_init, rhs = sret_init;
    +
    307 for (l += s_size, r += s_size + 1; l < r; l >>= 1, r >>= 1) {
    308 if (l & 1) {
    -
    309 lhs = combine(lhs, s_tree[l++]);
    +
    309 lhs = combine(lhs, s_tree[l++]);
    310 }
    311 if (r & 1) {
    -
    312 rhs = combine(s_tree[--r], rhs);
    +
    312 rhs = combine(s_tree[--r], rhs);
    313 }
    314 }
    -
    315 return combine(lhs, rhs);
    +
    315 return combine(lhs, rhs);
    316 }
    -
    range_queries::heavy_light_decomposition::SG::combine
    X combine(X lhs, X rhs)
    Function that specifies the type of operation involved when segments are combined.
    Definition heavy_light_decomposition.cpp:274
    -
    range_queries::heavy_light_decomposition::SG::sret_init
    X sret_init
    inital query return value
    Definition heavy_light_decomposition.cpp:264
    +
    range_queries::heavy_light_decomposition::SG::combine
    X combine(X lhs, X rhs)
    Function that specifies the type of operation involved when segments are combined.
    Definition heavy_light_decomposition.cpp:274
    +
    range_queries::heavy_light_decomposition::SG::sret_init
    X sret_init
    inital query return value
    Definition heavy_light_decomposition.cpp:264
    Here is the call graph for this function:
    @@ -348,8 +335,7 @@ template<typename X >
    void range_queries::heavy_light_decomposition::SG< X >::set_sret_init ( - X  - new_sret_init) + X new_sret_init) @@ -373,7 +359,7 @@ template<typename X > -
    329{ sret_init = new_sret_init; }
    +
    329{ sret_init = new_sret_init; }
    @@ -391,19 +377,12 @@ template<typename X > void range_queries::heavy_light_decomposition::SG< X >::update ( - int  - p, + int p, - X  - v  - - - - ) - + X v ) @@ -423,8 +402,8 @@ template<typename X >
    Returns
    void
    293 {
    -
    294 for (p += s_size; p > 0; p >>= 1) {
    -
    295 s_tree[p] += v;
    +
    294 for (p += s_size; p > 0; p >>= 1) {
    +
    295 s_tree[p] += v;
    296 }
    297 }
    @@ -467,7 +446,7 @@ template<typename X > diff --git a/d9/d37/inverse__fast__fourier__transform_8cpp.html b/d9/d37/inverse__fast__fourier__transform_8cpp.html index cf9b28f60..b46dc25cd 100644 --- a/d9/d37/inverse__fast__fourier__transform_8cpp.html +++ b/d9/d37/inverse__fast__fourier__transform_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/inverse_fast_fourier_transform.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,10 +130,10 @@ Functions std::complex< double > * numerical_methods::InverseFastFourierTransform (std::complex< double > *p, uint8_t n)  InverseFastFourierTransform is a recursive function which returns list of complex numbers.
      -static void test () +static void test ()  Self-test implementations.
      -int main (int argc, char const *argv[]) +int main (int argc, char const *argv[])  Main function.
      @@ -148,19 +150,12 @@ Functions int main ( - int  - argc, + int argc, - char const *  - argv[]  - - - - ) - + char const * argv[] )
    @@ -175,11 +170,11 @@ Functions
    Returns
    0 on exit
    156 {
    -
    157 test(); // run self-test implementations
    +
    157 test(); // run self-test implementations
    158 // with 2 defined test cases
    159 return 0;
    160}
    -
    test
    static void test()
    Self-test implementations.
    Definition inverse_fast_fourier_transform.cpp:100
    +
    test
    static void test()
    Self-test implementations.
    Definition inverse_fast_fourier_transform.cpp:100
    Here is the call graph for this function:
    @@ -200,7 +195,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -284,7 +279,7 @@ Here is the call graph for this function:
    diff --git a/d9/d44/magic__number_8cpp.html b/d9/d44/magic__number_8cpp.html index d7611e284..69263a944 100644 --- a/d9/d44/magic__number_8cpp.html +++ b/d9/d44/magic__number_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/magic_number.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -124,10 +126,10 @@ Namespaces Functions bool math::magic_number (const uint64_t &n)   -static void tests () +static void tests ()  Test function.
      -int main () +int main ()  Main function.
      @@ -144,8 +146,7 @@ Functions int main ( - void  - ) + void ) @@ -154,10 +155,10 @@ Functions

    Main function.

    Returns
    0 on exit
    77 {
    -
    78 tests(); // execute the tests
    +
    78 tests(); // execute the tests
    79 return 0;
    80}
    -
    tests
    static void tests()
    Test function.
    Definition magic_number.cpp:51
    +
    tests
    static void tests()
    Test function.
    Definition magic_number.cpp:51
    Here is the call graph for this function:
    @@ -178,7 +179,7 @@ Here is the call graph for this function:
    static void tests ( - ) + ) @@ -228,7 +229,7 @@ Here is the call graph for this function:
    diff --git a/d9/d49/kohonen__som__trace_8cpp.html b/d9/d49/kohonen__som__trace_8cpp.html index 213e797dd..27485bf74 100644 --- a/d9/d49/kohonen__som__trace_8cpp.html +++ b/d9/d49/kohonen__som__trace_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: machine_learning/kohonen_som_trace.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -138,21 +140,21 @@ Functions   void machine_learning::kohonen_som_tracer (const std::vector< std::valarray< double > > &X, std::vector< std::valarray< double > > *W, double alpha_min)   -void test_circle (std::vector< std::valarray< double > > *data) +void test_circle (std::vector< std::valarray< double > > *data)   -void test1 () +void test1 ()   -void test_lamniscate (std::vector< std::valarray< double > > *data) +void test_lamniscate (std::vector< std::valarray< double > > *data)   -void test2 () +void test2 ()   -void test_3d_classes (std::vector< std::valarray< double > > *data) +void test_3d_classes (std::vector< std::valarray< double > > *data)   -void test3 () +void test3 ()   -double get_clock_diff (clock_t start_t, clock_t end_t) +double get_clock_diff (clock_t start_t, clock_t end_t)   -int main (int argc, char **argv) +int main (int argc, char **argv)  

    Detailed Description

    @@ -173,19 +175,12 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with double get_clock_diff ( - clock_t  - start_t, + clock_t start_t, - clock_t  - end_t  - - - - ) - + clock_t end_t )
    @@ -213,19 +208,12 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with int main ( - int  - argc, + int argc, - char **  - argv  - - - - ) - + char ** argv )
    @@ -240,21 +228,21 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with
    464 std::srand(std::time(nullptr));
    465
    466 std::clock_t start_clk = std::clock();
    -
    467 test1();
    +
    467 test1();
    468 auto end_clk = std::clock();
    -
    469 std::cout << "Test 1 completed in " << get_clock_diff(start_clk, end_clk)
    +
    469 std::cout << "Test 1 completed in " << get_clock_diff(start_clk, end_clk)
    470 << " sec\n";
    471
    472 start_clk = std::clock();
    -
    473 test2();
    +
    473 test2();
    474 end_clk = std::clock();
    -
    475 std::cout << "Test 2 completed in " << get_clock_diff(start_clk, end_clk)
    +
    475 std::cout << "Test 2 completed in " << get_clock_diff(start_clk, end_clk)
    476 << " sec\n";
    477
    478 start_clk = std::clock();
    -
    479 test3();
    +
    479 test3();
    480 end_clk = std::clock();
    -
    481 std::cout << "Test 3 completed in " << get_clock_diff(start_clk, end_clk)
    +
    481 std::cout << "Test 3 completed in " << get_clock_diff(start_clk, end_clk)
    482 << " sec\n";
    483
    484 std::cout
    @@ -265,10 +253,10 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with
    std::clock
    T clock(T... args)
    -
    test2
    void test2()
    Definition kohonen_som_trace.cpp:315
    -
    test1
    void test1()
    Definition kohonen_som_trace.cpp:233
    -
    get_clock_diff
    double get_clock_diff(clock_t start_t, clock_t end_t)
    Definition kohonen_som_trace.cpp:452
    -
    test3
    void test3()
    Definition kohonen_som_trace.cpp:414
    +
    test2
    void test2()
    Definition kohonen_som_trace.cpp:315
    +
    test1
    void test1()
    Definition kohonen_som_trace.cpp:233
    +
    get_clock_diff
    double get_clock_diff(clock_t start_t, clock_t end_t)
    Definition kohonen_som_trace.cpp:452
    +
    test3
    void test3()
    Definition kohonen_som_trace.cpp:414
    std::srand
    T srand(T... args)
    std::time
    T time(T... args)
    @@ -288,7 +276,7 @@ Here is the call graph for this function:
    void test1 ( - ) + ) @@ -328,18 +316,17 @@ output" style="pointer-events: none;" class="inline"/>

    254 }
    255 }
    256
    -
    257 test_circle(&X); // create test data around circumference of a circle
    +
    257 test_circle(&X); // create test data around circumference of a circle
    258 save_nd_data("test1.csv", X); // save test data points
    259 save_nd_data("w11.csv", W); // save initial random weights
    -
    260 kohonen_som_tracer(X, &W, 0.1); // train the SOM
    +
    260 kohonen_som_tracer(X, &W, 0.1); // train the SOM
    261 save_nd_data("w12.csv", W); // save the resultant weights
    262}
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:47
    save_nd_data
    int save_nd_data(const char *fname, const std::vector< std::valarray< double > > &X)
    Definition kohonen_som_trace.cpp:58
    _random
    double _random(double a, double b)
    Definition kohonen_som_topology.cpp:53
    -
    test_circle
    void test_circle(std::vector< std::valarray< double > > *data)
    Definition kohonen_som_trace.cpp:196
    +
    test_circle
    void test_circle(std::vector< std::valarray< double > > *data)
    Definition kohonen_som_trace.cpp:196
    std::max
    T max(T... args)
    -
    machine_learning::kohonen_som_tracer
    void kohonen_som_tracer(const std::vector< std::valarray< double > > &X, std::vector< std::valarray< double > > *W, double alpha_min)
    Definition kohonen_som_trace.cpp:149
    @@ -359,7 +346,7 @@ Here is the call graph for this function:
    void test2 ( - ) + ) @@ -399,13 +386,13 @@ output" style="pointer-events: none;" class="inline"/>

    336 }
    337 }
    338
    -
    339 test_lamniscate(&X); // create test data around the lamniscate
    +
    339 test_lamniscate(&X); // create test data around the lamniscate
    340 save_nd_data("test2.csv", X); // save test data points
    341 save_nd_data("w21.csv", W); // save initial random weights
    -
    342 kohonen_som_tracer(X, &W, 0.01); // train the SOM
    +
    342 kohonen_som_tracer(X, &W, 0.01); // train the SOM
    343 save_nd_data("w22.csv", W); // save the resultant weights
    344}
    -
    test_lamniscate
    void test_lamniscate(std::vector< std::valarray< double > > *data)
    Definition kohonen_som_trace.cpp:277
    +
    test_lamniscate
    void test_lamniscate(std::vector< std::valarray< double > > *data)
    Definition kohonen_som_trace.cpp:277
    Here is the call graph for this function:
    @@ -423,7 +410,7 @@ Here is the call graph for this function:
    void test3 ( - ) + ) @@ -463,13 +450,13 @@ output" style="pointer-events: none;" class="inline"/>

    435 }
    436 }
    437
    -
    438 test_3d_classes(&X); // create test data around the lamniscate
    +
    438 test_3d_classes(&X); // create test data around the lamniscate
    439 save_nd_data("test3.csv", X); // save test data points
    440 save_nd_data("w31.csv", W); // save initial random weights
    -
    441 kohonen_som_tracer(X, &W, 0.01); // train the SOM
    +
    441 kohonen_som_tracer(X, &W, 0.01); // train the SOM
    442 save_nd_data("w32.csv", W); // save the resultant weights
    443}
    -
    test_3d_classes
    void test_3d_classes(std::vector< std::valarray< double > > *data)
    Definition kohonen_som_trace.cpp:359
    +
    test_3d_classes
    void test_3d_classes(std::vector< std::valarray< double > > *data)
    Definition kohonen_som_trace.cpp:359
    Here is the call graph for this function:
    @@ -487,8 +474,7 @@ Here is the call graph for this function:
    void test_3d_classes ( - std::vector< std::valarray< double > > *  - data) + std::vector< std::valarray< double > > * data) @@ -564,8 +550,7 @@ Here is the call graph for this function: void test_circle ( - std::vector< std::valarray< double > > *  - data) + std::vector< std::valarray< double > > * data) @@ -620,8 +605,7 @@ Here is the call graph for this function: void test_lamniscate ( - std::vector< std::valarray< double > > *  - data) + std::vector< std::valarray< double > > * data) @@ -672,7 +656,7 @@ Here is the call graph for this function: diff --git a/d9/d49/structdata__structures_1_1_node.html b/d9/d49/structdata__structures_1_1_node.html index 8ad956f27..f4d1837bb 100644 --- a/d9/d49/structdata__structures_1_1_node.html +++ b/d9/d49/structdata__structures_1_1_node.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures::Node Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ Collaboration diagram for data_structures::Node:
    - +

    Public Member Functions

     Node (int key, int level, void *value=nullptr)
     Node (int key, int level, void *value=nullptr)
     
    - - + - - + - - - - - - - +

    @@ -145,25 +147,17 @@ void * 

    		value
    data_structures::Node::Node (int key, int key,
    int level, int level,
    void * value = nullptr 
    )void * value = nullptr )
    @@ -179,16 +173,16 @@ void * value -
    44 : key(key), value(value) {
    +
    44 : key(key), value(value) {
    45 // Initialization of forward vector
    46 for (int i = 0; i < (level + 1); i++) {
    -
    47 forward.push_back(nullptr);
    +
    47 forward.push_back(nullptr);
    48 }
    49 }
    std::vector::push_back
    T push_back(T... args)
    -
    data_structures::Node::value
    void * value
    pointer of value
    Definition skip_list.cpp:35
    -
    data_structures::Node::key
    int key
    key integer
    Definition skip_list.cpp:34
    -
    data_structures::Node::forward
    std::vector< std::shared_ptr< Node > > forward
    nodes of the given one in all levels
    Definition skip_list.cpp:37
    +
    data_structures::Node::value
    void * value
    pointer of value
    Definition skip_list.cpp:35
    +
    data_structures::Node::key
    int key
    key integer
    Definition skip_list.cpp:34
    +
    data_structures::Node::forward
    std::vector< std::shared_ptr< Node > > forward
    nodes of the given one in all levels
    Definition skip_list.cpp:37
    Here is the call graph for this function:
    @@ -206,7 +200,7 @@ Here is the call graph for this function:
    diff --git a/d9/d4e/classrange__queries_1_1heavy__light__decomposition_1_1_tree-members.html b/d9/d4e/classrange__queries_1_1heavy__light__decomposition_1_1_tree-members.html index 930411677..8bfb161ad 100644 --- a/d9/d4e/classrange__queries_1_1heavy__light__decomposition_1_1_tree-members.html +++ b/d9/d4e/classrange__queries_1_1heavy__light__decomposition_1_1_tree-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,7 +129,7 @@ $(document).ready(function(){initNavTree('d1/d51/classrange__queries_1_1heavy__l diff --git a/d9/d55/namespacesparse__table.html b/d9/d55/namespacesparse__table.html index 6947c9806..1c4f3aa9d 100644 --- a/d9/d55/namespacesparse__table.html +++ b/d9/d55/namespacesparse__table.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sparse_table Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d9/d55/namespacesparse__table.html','.

    Functions for Implementation of Sparse Table -More...

    +More...

    Detailed Description

    Functions for Implementation of Sparse Table

    Range queries using sparse-tables.

    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('d9/d55/namespacesparse__table.html','. diff --git a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html index 0602f266d..32b037d0b 100644 --- a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html +++ b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -132,7 +134,7 @@ $(document).ready(function(){initNavTree('d1/def/classdata__structures_1_1linked diff --git a/d9/d5a/structgeometry_1_1jarvis_1_1_point.html b/d9/d5a/structgeometry_1_1jarvis_1_1_point.html index ab5ac6100..12c552add 100644 --- a/d9/d5a/structgeometry_1_1jarvis_1_1_point.html +++ b/d9/d5a/structgeometry_1_1jarvis_1_1_point.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: geometry::jarvis::Point Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -124,7 +126,7 @@ int y diff --git a/d9/d5d/extended__euclid__algorithm_8cpp.html b/d9/d5d/extended__euclid__algorithm_8cpp.html index 781439c7e..92c97ad43 100644 --- a/d9/d5d/extended__euclid__algorithm_8cpp.html +++ b/d9/d5d/extended__euclid__algorithm_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/extended_euclid_algorithm.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,15 +118,15 @@ Include dependency graph for extended_euclid_algorithm.cpp:

    Functions

    template<typename T , typename T2 > -void update_step (T *r, T *r0, const T2 quotient) +void update_step (T *r, T *r0, const T2 quotient)   template<typename T1 , typename T2 > -void extendedEuclid_1 (T1 A, T1 B, T1 *GCD, T2 *x, T2 *y) +void extendedEuclid_1 (T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)   template<typename T , typename T2 > -void extendedEuclid (T A, T B, T *GCD, T2 *x, T2 *y) +void extendedEuclid (T A, T B, T *GCD, T2 *x, T2 *y)   -int main () +int main ()  Main function.
      @@ -146,37 +148,27 @@ template<typename T , typename T2 > void extendedEuclid ( - T  - A, + T A, - T  - B, + T B, - T *  - GCD, + T * GCD, - T2 *  - x, + T2 * x, - T2 *  - y  - - - - ) - + T2 * y )
    @@ -200,13 +192,13 @@ template<typename T , typename T2 >
    76 *x = 1;
    77 *y = 0;
    78 } else {
    -
    79 extendedEuclid(B, A % B, GCD, x, y);
    +
    79 extendedEuclid(B, A % B, GCD, x, y);
    80 T2 temp = *x;
    81 *x = *y;
    82 *y = temp - (A / B) * (*y);
    83 }
    84}
    -
    extendedEuclid
    void extendedEuclid(T A, T B, T *GCD, T2 *x, T2 *y)
    Definition extended_euclid_algorithm.cpp:70
    +
    extendedEuclid
    void extendedEuclid(T A, T B, T *GCD, T2 *x, T2 *y)
    Definition extended_euclid_algorithm.cpp:70
    std::swap
    T swap(T... args)
    Here is the call graph for this function:
    @@ -227,37 +219,27 @@ template<typename T1 , typename T2 > void extendedEuclid_1 ( - T1  - A, + T1 A, - T1  - B, + T1 B, - T1 *  - GCD, + T1 * GCD, - T2 *  - x, + T2 * x, - T2 *  - y  - - - - ) - + T2 * y )
    @@ -282,15 +264,15 @@ template<typename T1 , typename T2 >
    48
    49 while (r != 0) {
    50 T1 quotient = r0 / r;
    -
    51 update_step(&r, &r0, quotient);
    -
    52 update_step(&s, &s0, quotient);
    -
    53 update_step(&t, &t0, quotient);
    +
    51 update_step(&r, &r0, quotient);
    +
    52 update_step(&s, &s0, quotient);
    +
    53 update_step(&t, &t0, quotient);
    54 }
    55 *GCD = r0;
    56 *x = s0;
    57 *y = t0;
    58}
    -
    update_step
    void update_step(T *r, T *r0, const T2 quotient)
    Definition extended_euclid_algorithm.cpp:24
    +
    update_step
    void update_step(T *r, T *r0, const T2 quotient)
    Definition extended_euclid_algorithm.cpp:24
    Here is the call graph for this function:
    @@ -308,8 +290,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -320,16 +301,16 @@ Here is the call graph for this function:
    88 uint32_t a, b, gcd;
    89 int32_t x, y;
    90 std::cin >> a >> b;
    -
    91 extendedEuclid(a, b, &gcd, &x, &y);
    +
    91 extendedEuclid(a, b, &gcd, &x, &y);
    92 std::cout << gcd << " " << x << " " << y << std::endl;
    -
    93 extendedEuclid_1(a, b, &gcd, &x, &y);
    +
    93 extendedEuclid_1(a, b, &gcd, &x, &y);
    94 std::cout << gcd << " " << x << " " << y << std::endl;
    95 return 0;
    96}
    std::endl
    T endl(T... args)
    -
    extendedEuclid_1
    void extendedEuclid_1(T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)
    Definition extended_euclid_algorithm.cpp:41
    +
    extendedEuclid_1
    void extendedEuclid_1(T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)
    Definition extended_euclid_algorithm.cpp:41
    gcd
    int gcd(int num1, int num2)
    Definition gcd_iterative_euclidean.cpp:15
    Here is the call graph for this function:
    @@ -353,25 +334,17 @@ template<typename T , typename T2 > void update_step ( - T *  - r, + T * r, - T *  - r0, + T * r0, - const T2  - quotient  - - - - ) - + const T2 quotient ) @@ -405,7 +378,7 @@ template<typename T , typename T2 > diff --git a/d9/d60/namespacerat__maze.html b/d9/d60/namespacerat__maze.html index 752d81467..2b206b95e 100644 --- a/d9/d60/namespacerat__maze.html +++ b/d9/d60/namespacerat__maze.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: rat_maze Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -103,7 +105,7 @@ $(document).ready(function(){initNavTree('d9/d60/namespacerat__maze.html','../..

    Functions for Rat in a Maze algorithm. -More...

    +More...

    Detailed Description

    Functions for Rat in a Maze algorithm.

    @@ -113,7 +115,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm diff --git a/d9/d66/group__machine__learning.html b/d9/d66/group__machine__learning.html index e4fbdd4e3..f79896a4f 100644 --- a/d9/d66/group__machine__learning.html +++ b/d9/d66/group__machine__learning.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Machine Learning Algorithms + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,18 +129,18 @@ Namespaces - + - + - + - +

    Functions

    double _random (double a, double b)
    double _random (double a, double b)
     
    int save_2d_data (const char *fname, const std::vector< std::valarray< double > > &X)
    int save_2d_data (const char *fname, const std::vector< std::valarray< double > > &X)
     
    void get_min_2d (const std::vector< std::valarray< double > > &X, double *val, int *x_idx, int *y_idx)
    void get_min_2d (const std::vector< std::valarray< double > > &X, double *val, int *x_idx, int *y_idx)
     
    int save_nd_data (const char *fname, const std::vector< std::valarray< double > > &X)
    int save_nd_data (const char *fname, const std::vector< std::valarray< double > > &X)
     
    - +

    Variables

    constexpr int MAX_ITER = 500
    constexpr int MAX_ITER = 500
     

    Detailed Description

    @@ -152,19 +154,12 @@ Variables double _random ( - double  - a, + double a, - double  - b  - - - - ) - + double b )
    @@ -203,31 +198,22 @@ Here is the call graph for this function:
    void get_min_2d ( - const std::vector< std::valarray< double > > &  - X, + const std::vector< std::valarray< double > > & X, - double *  - val, + double * val, - int *  - x_idx, + int * x_idx, - int *  - y_idx  - - - - ) - + int * y_idx )
    @@ -281,19 +267,12 @@ Here is the call graph for this function:
    int save_2d_data ( - const char *  - fname, + const char * fname, - const std::vector< std::valarray< double > > &  - X  - - - - ) - + const std::vector< std::valarray< double > > & X )
    @@ -361,19 +340,12 @@ Here is the call graph for this function:
    int save_nd_data ( - const char *  - fname, + const char * fname, - const std::vector< std::valarray< double > > &  - X  - - - - ) - + const std::vector< std::valarray< double > > & X )
    @@ -454,7 +426,7 @@ Here is the call graph for this function:
    diff --git a/d9/d69/median__search_8cpp.html b/d9/d69/median__search_8cpp.html index a73a19eab..ad7229eca 100644 --- a/d9/d69/median__search_8cpp.html +++ b/d9/d69/median__search_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: search/median_search.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,11 +129,11 @@ Namespaces - + - + - +

    Functions

    int search::median_search::median_of_medians (const std::vector< int > &A, const int &idx)
    int search::median_search::median_of_medians (const std::vector< int > &A, const int &idx)
     
    void test ()
    void test ()
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -152,15 +154,14 @@ Functions int main ( - void  - ) + void )

    Main function

    129{
    -
    130 test();
    +
    130 test();
    131 int n = 0;
    132 std::cout << "Enter Size of Array: ";
    133 std::cin >> n;
    @@ -170,9 +171,9 @@ Functions
    137 std::cin >> a[i];
    138 }
    139 std::cout << "Median: "; // Median defination: https://en.wikipedia.org/wiki/Median
    -
    140 int x = search::median_search::median_of_medians(a, (n - 1) / 2);
    +
    140 int x = search::median_search::median_of_medians(a, (n - 1) / 2);
    141 if(n % 2 == 0){
    -
    142 int y = search::median_search::median_of_medians(a, n / 2);
    +
    142 int y = search::median_search::median_of_medians(a, n / 2);
    143 std::cout << (float(x) + float(y))/2.0;
    144 }
    145 else{
    @@ -183,13 +184,13 @@ Functions
    150 int idx = 0;
    151 std::cin >> idx;
    152 idx--;
    -
    153 std::cout << idx + 1<< "-th smallest element: " << search::median_search::median_of_medians(a, idx) << '\n';
    +
    153 std::cout << idx + 1<< "-th smallest element: " << search::median_search::median_of_medians(a, idx) << '\n';
    154 return 0;
    155}
    -
    search::median_search::median_of_medians
    int median_of_medians(const std::vector< int > &A, const int &idx)
    Definition median_search.cpp:62
    -
    test
    void test()
    Definition median_search.cpp:107
    +
    search::median_search::median_of_medians
    int median_of_medians(const std::vector< int > &A, const int &idx)
    Definition median_search.cpp:62
    +
    test
    void test()
    Definition median_search.cpp:107
    Here is the call graph for this function:
    @@ -208,19 +209,12 @@ Here is the call graph for this function:
    int search::median_search::median_of_medians ( - const std::vector< int > &  - A, + const std::vector< int > & A, - const int &  - idx  - - - - ) - + const int & idx )
    @@ -248,7 +242,7 @@ Here is the call graph for this function:
    75 pivot = m[(sz- 1) / 2];
    76 }
    77 else{
    -
    78 pivot = median_of_medians(m, idx);
    +
    78 pivot = median_of_medians(m, idx);
    79 }
    80 std::vector<int> low;
    81 std::vector<int> high;
    @@ -262,10 +256,10 @@ Here is the call graph for this function:
    89 }
    90 int k = int(low.size());
    91 if(idx < k){
    -
    92 return median_of_medians(low, idx);
    +
    92 return median_of_medians(low, idx);
    93 }
    94 else if(idx > k){
    -
    95 return median_of_medians(high, idx-k-1);
    +
    95 return median_of_medians(high, idx-k-1);
    96 }
    97 else{
    98 return pivot;
    @@ -295,7 +289,7 @@ Here is the call graph for this function: void test ( - ) + ) @@ -327,7 +321,7 @@ Here is the call graph for this function: diff --git a/d9/d70/namespacequeue__using__array.html b/d9/d70/namespacequeue__using__array.html index 494120bdd..b08cf6bbb 100644 --- a/d9/d70/namespacequeue__using__array.html +++ b/d9/d70/namespacequeue__using__array.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: queue_using_array Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d9/d70/namespacequeue__using__array.ht

    Functions for [Queue using Array] (https://www.geeksforgeeks.org/array-implementation-of-queue-simple/) implementation. -More...

    +More...

    Detailed Description

    Functions for [Queue using Array] (https://www.geeksforgeeks.org/array-implementation-of-queue-simple/) implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d9/d70/namespacequeue__using__array.ht diff --git a/d9/d75/namespacednf__sort.html b/d9/d75/namespacednf__sort.html index 2ce3ac4b9..9acf1cafd 100644 --- a/d9/d75/namespacednf__sort.html +++ b/d9/d75/namespacednf__sort.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dnf_sort Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d9/d75/namespacednf__sort.html','../..

    Functions for the DNF sort implementation. -More...

    +More...

    Detailed Description

    Functions for the DNF sort implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d9/d75/namespacednf__sort.html','../.. diff --git a/d9/d89/fibonacci_8cpp.html b/d9/d89/fibonacci_8cpp.html index 40ef61f0b..f82768883 100644 --- a/d9/d89/fibonacci_8cpp.html +++ b/d9/d89/fibonacci_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/fibonacci.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,11 +117,11 @@ Include dependency graph for fibonacci.cpp:
    - + - + - +

    Functions

    uint64_t fibonacci (uint64_t n)
    uint64_t fibonacci (uint64_t n)
     
    static void test ()
    static void test ()
     
    int main ()
    int main ()
     Main function.
     
    @@ -139,8 +141,7 @@ Functions uint64_t fibonacci ( - uint64_t  - n) + uint64_t n) @@ -160,9 +161,9 @@ Functions
    24 }
    25
    26 /* Add the last 2 values of the sequence to get next */
    -
    27 return fibonacci(n - 1) + fibonacci(n - 2);
    +
    27 return fibonacci(n - 1) + fibonacci(n - 2);
    28}
    -
    fibonacci
    uint64_t fibonacci(uint64_t n)
    Definition fibonacci.cpp:19
    +
    fibonacci
    uint64_t fibonacci(uint64_t n)
    Definition fibonacci.cpp:19
    Here is the call graph for this function:
    @@ -180,8 +181,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -189,16 +189,16 @@ Here is the call graph for this function:

    Main function.

    62 {
    -
    63 test();
    +
    63 test();
    64 int n = 0;
    65 std::cin >> n;
    66 assert(n >= 0);
    -
    67 std::cout << "F(" << n << ")= " << fibonacci(n) << std::endl;
    +
    67 std::cout << "F(" << n << ")= " << fibonacci(n) << std::endl;
    68}
    std::endl
    T endl(T... args)
    -
    test
    static void test()
    Definition fibonacci.cpp:35
    +
    test
    static void test()
    Definition fibonacci.cpp:35
    Here is the call graph for this function:
    @@ -219,7 +219,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -229,29 +229,29 @@ Here is the call graph for this function:
    -

    Function for testing the fibonacci() function with a few test cases and assert statement.

    Returns
    void
    +

    Function for testing the fibonacci() function with a few test cases and assert statement.

    Returns
    void
    35 {
    -
    36 uint64_t test_case_1 = fibonacci(0);
    +
    36 uint64_t test_case_1 = fibonacci(0);
    37 assert(test_case_1 == 0);
    38 std::cout << "Passed Test 1!" << std::endl;
    39
    -
    40 uint64_t test_case_2 = fibonacci(1);
    +
    40 uint64_t test_case_2 = fibonacci(1);
    41 assert(test_case_2 == 1);
    42 std::cout << "Passed Test 2!" << std::endl;
    43
    -
    44 uint64_t test_case_3 = fibonacci(2);
    +
    44 uint64_t test_case_3 = fibonacci(2);
    45 assert(test_case_3 == 1);
    46 std::cout << "Passed Test 3!" << std::endl;
    47
    -
    48 uint64_t test_case_4 = fibonacci(3);
    +
    48 uint64_t test_case_4 = fibonacci(3);
    49 assert(test_case_4 == 2);
    50 std::cout << "Passed Test 4!" << std::endl;
    51
    -
    52 uint64_t test_case_5 = fibonacci(4);
    +
    52 uint64_t test_case_5 = fibonacci(4);
    53 assert(test_case_5 == 3);
    54 std::cout << "Passed Test 5!" << std::endl;
    55
    -
    56 uint64_t test_case_6 = fibonacci(15);
    +
    56 uint64_t test_case_6 = fibonacci(15);
    57 assert(test_case_6 == 610);
    58 std::cout << "Passed Test 6!" << std::endl << std::endl;
    59}
    @@ -269,7 +269,7 @@ Here is the call graph for this function:
    diff --git a/d9/d90/struct_btree.html b/d9/d90/struct_btree.html index afd2ed80e..90dad5da9 100644 --- a/d9/d90/struct_btree.html +++ b/d9/d90/struct_btree.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Btree Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -130,7 +132,7 @@ struct Btree * 
    • Btree
      • -
    • Generated by doxygen 1.9.8
      • +
    • Generated by doxygen 1.10.0
    diff --git a/d9/d92/chaining_8cpp.html b/d9/d92/chaining_8cpp.html index 6c92a65b1..6ef312a39 100644 --- a/d9/d92/chaining_8cpp.html +++ b/d9/d92/chaining_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: hashing/chaining.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -124,7 +126,7 @@ Classes - +

    Functions

    int main ()
    int main ()
     

    Detailed Description

    @@ -142,8 +144,7 @@ Functions int main ( - void  - ) + void ) @@ -222,7 +223,7 @@ Here is the call graph for this function:
    diff --git a/d9/daa/namespacemidpoint__rule.html b/d9/daa/namespacemidpoint__rule.html index f951589c8..23401c47c 100644 --- a/d9/daa/namespacemidpoint__rule.html +++ b/d9/daa/namespacemidpoint__rule.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: midpoint_rule Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d9/daa/namespacemidpoint__rule.html','

    Functions for the Midpoint Integral method implementation. -More...

    +More...

    Detailed Description

    Functions for the Midpoint Integral method implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d9/daa/namespacemidpoint__rule.html',' diff --git a/d9/dab/bloom__filter_8cpp.html b/d9/dab/bloom__filter_8cpp.html index 5541cb3a8..062223faf 100644 --- a/d9/dab/bloom__filter_8cpp.html +++ b/d9/dab/bloom__filter_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/bloom_filter.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -148,16 +150,16 @@ Functions std::size_t data_structures::hashInt_2 (int x)  Hash function for test
      -static void test_bloom_filter_string () +static void test_bloom_filter_string ()  Test for bloom filter with string as generic type.
      -static void test_bloom_filter_int () +static void test_bloom_filter_int ()  Test for bloom filter with int as generic type.
      -static void test_bitset () +static void test_bitset ()  Test for bitset.
      -int main () +int main ()  Main function.
      @@ -179,8 +181,7 @@ operation"

    int main ( - void  - ) + void ) @@ -191,17 +192,17 @@ operation"

    282 {
    283 // run self-test implementations
    284
    -
    285 test_bitset(); // run test for bitset, because bloom filter is depending on it
    -
    286 test_bloom_filter_string();
    -
    287 test_bloom_filter_int();
    +
    285 test_bitset(); // run test for bitset, because bloom filter is depending on it
    +
    286 test_bloom_filter_string();
    +
    287 test_bloom_filter_int();
    288
    289 std::cout << "All tests have successfully passed!\n";
    290 return 0;
    291}
    -
    test_bloom_filter_int
    static void test_bloom_filter_int()
    Test for bloom filter with int as generic type.
    Definition bloom_filter.cpp:246
    -
    test_bitset
    static void test_bitset()
    Test for bitset.
    Definition bloom_filter.cpp:267
    -
    test_bloom_filter_string
    static void test_bloom_filter_string()
    Test for bloom filter with string as generic type.
    Definition bloom_filter.cpp:226
    +
    test_bloom_filter_int
    static void test_bloom_filter_int()
    Test for bloom filter with int as generic type.
    Definition bloom_filter.cpp:246
    +
    test_bitset
    static void test_bitset()
    Test for bitset.
    Definition bloom_filter.cpp:267
    +
    test_bloom_filter_string
    static void test_bloom_filter_string()
    Test for bloom filter with string as generic type.
    Definition bloom_filter.cpp:226
    Here is the call graph for this function:
    @@ -222,7 +223,7 @@ Here is the call graph for this function:
    static void test_bitset ( - ) + ) @@ -267,7 +268,7 @@ Here is the call graph for this function:
    static void test_bloom_filter_int ( - ) + ) @@ -318,7 +319,7 @@ Here is the call graph for this function: static void test_bloom_filter_string ( - ) + ) @@ -362,7 +363,7 @@ Here is the call graph for this function: diff --git a/d9/dae/classdata__structures_1_1_bitset.html b/d9/dae/classdata__structures_1_1_bitset.html index 5700e7b3c..2dca17b59 100644 --- a/d9/dae/classdata__structures_1_1_bitset.html +++ b/d9/dae/classdata__structures_1_1_bitset.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures::Bitset Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('d9/dae/classdata__structures_1_1_bitse

    Simple bitset implementation for bloom filter. - More...

    + More...

    Collaboration diagram for data_structures::Bitset:
    @@ -116,16 +118,16 @@ Collaboration diagram for data_structures::Bitset:
    - + - + - + - +

    Public Member Functions

     Bitset (std::size_t)
     Bitset (std::size_t)
     BitSet class constructor.
     
    std::size_t size ()
    std::size_t size ()
     Utility function to return the size of the inner array.
     
    void add (std::size_t)
    void add (std::size_t)
     Turn bit on position x to 1s.
     
    bool contains (std::size_t)
    bool contains (std::size_t)
     Doest bitset contains element x.
     
    @@ -138,7 +140,7 @@ Private Attributes
    - +

    Static Private Attributes

    static const std::size_t blockSize
    static const std::size_t blockSize
     

    Detailed Description

    @@ -156,8 +158,7 @@ Static Private Attributes data_structures::Bitset::Bitset ( - std::size_t  - initSize) + std::size_t initSize) @@ -175,8 +176,8 @@ Static Private Attributes -
    63: data(initSize) {}
    -
    data_structures::Bitset::data
    std::vector< std::size_t > data
    short info of this variable
    Definition bloom_filter.cpp:42
    +
    63: data(initSize) {}
    +
    data_structures::Bitset::data
    std::vector< std::size_t > data
    short info of this variable
    Definition bloom_filter.cpp:42
    @@ -190,8 +191,7 @@ Static Private Attributes void data_structures::Bitset::add ( - std::size_t  - x) + std::size_t x) @@ -206,13 +206,13 @@ Static Private Attributes
    Returns
    void
    71 {
    -
    72 std::size_t blockIndex = x / blockSize;
    -
    73 if (blockIndex >= data.size()) {
    -
    74 data.resize(blockIndex + 1);
    +
    72 std::size_t blockIndex = x / blockSize;
    +
    73 if (blockIndex >= data.size()) {
    +
    74 data.resize(blockIndex + 1);
    75 }
    -
    76 data[blockIndex] |= 1 << (x % blockSize);
    +
    76 data[blockIndex] |= 1 << (x % blockSize);
    77}
    -
    data_structures::Bitset::blockSize
    static const std::size_t blockSize
    Definition bloom_filter.cpp:43
    +
    data_structures::Bitset::blockSize
    static const std::size_t blockSize
    Definition bloom_filter.cpp:43
    std::vector::resize
    T resize(T... args)
    std::vector::size
    T size(T... args)
    @@ -233,8 +233,7 @@ Here is the call graph for this function:
    bool data_structures::Bitset::contains ( - std::size_t  - x) + std::size_t x) @@ -251,11 +250,11 @@ Here is the call graph for this function:
    false if bit position x is 0
    86 {
    -
    87 std::size_t blockIndex = x / blockSize;
    -
    88 if (blockIndex >= data.size()) {
    +
    87 std::size_t blockIndex = x / blockSize;
    +
    88 if (blockIndex >= data.size()) {
    89 return false;
    90 }
    -
    91 return data[blockIndex] & (1 << (x % blockSize));
    +
    91 return data[blockIndex] & (1 << (x % blockSize));
    92}
    Here is the call graph for this function:
    @@ -274,7 +273,7 @@ Here is the call graph for this function: std::size_t data_structures::Bitset::size ( - ) + ) @@ -282,7 +281,7 @@ Here is the call graph for this function:

    Utility function to return the size of the inner array.

    Returns
    the size of inner array
    -
    57{ return data.size(); }
    +
    57{ return data.size(); }
    Here is the call graph for this function:
    @@ -326,7 +325,7 @@ Here is the call graph for this function:
    diff --git a/d9/db6/classgreedy__algorithms_1_1dijkstra_1_1_graph-members.html b/d9/db6/classgreedy__algorithms_1_1dijkstra_1_1_graph-members.html index af88f99d8..d0f3cc08d 100644 --- a/d9/db6/classgreedy__algorithms_1_1dijkstra_1_1_graph-members.html +++ b/d9/db6/classgreedy__algorithms_1_1dijkstra_1_1_graph-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('d2/daa/classgreedy__algorithms_1_1dijk diff --git a/d9/dc9/namespacebase64__encoding.html b/d9/dc9/namespacebase64__encoding.html index 5db493523..6697b5fd6 100644 --- a/d9/dc9/namespacebase64__encoding.html +++ b/d9/dc9/namespacebase64__encoding.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: base64_encoding Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d9/dc9/namespacebase64__encoding.html'

    Functions for Base64 Encoding and Decoding implementation. -More...

    +More...

    Detailed Description

    Functions for Base64 Encoding and Decoding implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d9/dc9/namespacebase64__encoding.html' diff --git a/d9/dca/namespacesearch.html b/d9/dca/namespacesearch.html index 9feb0dd6e..d4c82d5a8 100644 --- a/d9/dca/namespacesearch.html +++ b/d9/dca/namespacesearch.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: search Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d9/dca/namespacesearch.html','../../')

    for std::vector -More...

    +More...

    Detailed Description

    for std::vector

    Search algorithms.

    @@ -119,7 +121,7 @@ $(document).ready(function(){initNavTree('d9/dca/namespacesearch.html','../../') diff --git a/d9/dd1/namespacelinear__recurrence__matrix.html b/d9/dd1/namespacelinear__recurrence__matrix.html index 36327fb69..3253cd327 100644 --- a/d9/dd1/namespacelinear__recurrence__matrix.html +++ b/d9/dd1/namespacelinear__recurrence__matrix.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: linear_recurrence_matrix Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d9/dd1/namespacelinear__recurrence__ma

    Functions for Linear Recurrence Matrix implementation. -More...

    +More...

    Detailed Description

    Functions for Linear Recurrence Matrix implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d9/dd1/namespacelinear__recurrence__ma diff --git a/d9/dde/classbinary__search__tree.html b/d9/dde/classbinary__search__tree.html index 2c428ad75..d1911a235 100644 --- a/d9/dde/classbinary__search__tree.html +++ b/d9/dde/classbinary__search__tree.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: binary_search_tree< T > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -108,11 +110,11 @@ $(document).ready(function(){initNavTree('d9/dde/classbinary__search__tree.html'

    The Binary Search Tree class. - More...

    + More...

    Collaboration diagram for binary_search_tree< T >:
    -
    +
    [legend]

    @@ -123,69 +125,69 @@ Classes

    - + - + - + - + - + - + - + - + - + - +

    Public Member Functions

     binary_search_tree ()
     binary_search_tree ()
     Construct a new Binary Search Tree object.
     
    bool insert (T new_value)
    bool insert (T new_value)
     Insert a new value into the BST.
     
    bool remove (T rm_value)
    bool remove (T rm_value)
     Remove a specified value from the BST.
     
    bool contains (T value)
    bool contains (T value)
     Check if a value is in the BST.
     
    bool find_min (T &ret_value)
    bool find_min (T &ret_value)
     Find the smallest value in the BST.
     
    bool find_max (T &ret_value)
    bool find_max (T &ret_value)
     Find the largest value in the BST.
     
    std::size_t size ()
    std::size_t size ()
     Get the number of values in the BST.
     
    std::vector< T > get_elements_inorder ()
    std::vector< T > get_elements_inorder ()
     Get all values of the BST in in-order order.
     
    std::vector< T > get_elements_preorder ()
    std::vector< T > get_elements_preorder ()
     Get all values of the BST in pre-order order.
     
    std::vector< T > get_elements_postorder ()
    std::vector< T > get_elements_postorder ()
     Get all values of the BST in post-order order.
     
    - + - + - + - + - + - + - + - +

    Private Member Functions

    bool find_max (std::unique_ptr< bst_node > &node, T &ret_value)
    bool find_max (std::unique_ptr< bst_node > &node, T &ret_value)
     Recursive function to find the maximum value in the BST.
     
    bool find_min (std::unique_ptr< bst_node > &node, T &ret_value)
    bool find_min (std::unique_ptr< bst_node > &node, T &ret_value)
     Recursive function to find the minimum value in the BST.
     
    bool insert (std::unique_ptr< bst_node > &node, T new_value)
    bool insert (std::unique_ptr< bst_node > &node, T new_value)
     Recursive function to insert a value into the BST.
     
    bool remove (std::unique_ptr< bst_node > &parent, std::unique_ptr< bst_node > &node, T rm_value)
    bool remove (std::unique_ptr< bst_node > &parent, std::unique_ptr< bst_node > &node, T rm_value)
     Recursive function to remove a value from the BST.
     
    bool contains (std::unique_ptr< bst_node > &node, T value)
    bool contains (std::unique_ptr< bst_node > &node, T value)
     Recursive function to check if a value is in the BST.
     
    void traverse_inorder (std::function< void(T)> callback, std::unique_ptr< bst_node > &node)
    void traverse_inorder (std::function< void(T)> callback, std::unique_ptr< bst_node > &node)
     Recursive function to traverse the tree in in-order order.
     
    void traverse_preorder (std::function< void(T)> callback, std::unique_ptr< bst_node > &node)
    void traverse_preorder (std::function< void(T)> callback, std::unique_ptr< bst_node > &node)
     Recursive function to traverse the tree in pre-order order.
     
    void traverse_postorder (std::function< void(T)> callback, std::unique_ptr< bst_node > &node)
    void traverse_postorder (std::function< void(T)> callback, std::unique_ptr< bst_node > &node)
     Recursive function to traverse the tree in post-order order.
     
    - + - +

    Private Attributes

    std::unique_ptr< bst_node > root_
    std::unique_ptr< bst_node > root_
     
    std::size_t size_ = 0
    std::size_t size_ = 0
     

    Detailed Description

    @@ -212,7 +214,7 @@ template<class T >
    binary_search_tree< T >::binary_search_tree ( - ) + ) @@ -225,11 +227,11 @@ template<class T >

    Construct a new Binary Search Tree object.

    247 {
    -
    248 root_ = nullptr;
    -
    249 size_ = 0;
    +
    248 root_ = nullptr;
    +
    249 size_ = 0;
    250 }
    -
    binary_search_tree::size_
    std::size_t size_
    Definition binary_search_tree2.cpp:43
    -
    binary_search_tree::root_
    std::unique_ptr< bst_node > root_
    Definition binary_search_tree2.cpp:42
    +
    binary_search_tree::size_
    std::size_t size_
    Definition binary_search_tree2.cpp:43
    +
    binary_search_tree::root_
    std::unique_ptr< bst_node > root_
    Definition binary_search_tree2.cpp:42
    @@ -248,19 +250,12 @@ template<class T > bool binary_search_tree< T >::contains ( - std::unique_ptr< bst_node > &  - node, + std::unique_ptr< bst_node > & node, - T  - value  - - - - ) - + T value ) @@ -287,14 +282,14 @@ false Otherwise.
    180 }
    181
    182 if (value < node->value) {
    -
    183 return contains(node->left, value);
    +
    183 return contains(node->left, value);
    184 } else if (value > node->value) {
    -
    185 return contains(node->right, value);
    +
    185 return contains(node->right, value);
    186 } else {
    187 return true;
    188 }
    189 }
    -
    binary_search_tree::contains
    bool contains(std::unique_ptr< bst_node > &node, T value)
    Recursive function to check if a value is in the BST.
    Definition binary_search_tree2.cpp:177
    +
    binary_search_tree::contains
    bool contains(std::unique_ptr< bst_node > &node, T value)
    Recursive function to check if a value is in the BST.
    Definition binary_search_tree2.cpp:177
    node
    Definition binary_search_tree.cpp:11
    Here is the call graph for this function:
    @@ -318,8 +313,7 @@ template<class T > bool binary_search_tree< T >::contains ( - T  - value) + T value) @@ -340,7 +334,7 @@ template<class T >
    Returns
    true If value is in the BST.
    false Otherwise.
    -
    289{ return contains(root_, value); }
    +
    289{ return contains(root_, value); }
    Here is the call graph for this function:
    @@ -363,19 +357,12 @@ template<class T >
    bool binary_search_tree< T >::find_max ( - std::unique_ptr< bst_node > &  - node, + std::unique_ptr< bst_node > & node, - T &  - ret_value  - - - - ) - + T & ret_value ) @@ -403,9 +390,9 @@ false Otherwise.
    57 ret_value = node->value;
    58 return true;
    59 }
    -
    60 return find_max(node->right, ret_value);
    +
    60 return find_max(node->right, ret_value);
    61 }
    -
    binary_search_tree::find_max
    bool find_max(std::unique_ptr< bst_node > &node, T &ret_value)
    Recursive function to find the maximum value in the BST.
    Definition binary_search_tree2.cpp:53
    +
    binary_search_tree::find_max
    bool find_max(std::unique_ptr< bst_node > &node, T &ret_value)
    Recursive function to find the maximum value in the BST.
    Definition binary_search_tree2.cpp:53
    Here is the call graph for this function:
    @@ -428,8 +415,7 @@ template<class T >
    bool binary_search_tree< T >::find_max ( - T &  - ret_value) + T & ret_value) @@ -450,7 +436,7 @@ template<class T >
    Returns
    true If maximum value was successfully found.
    false Otherwise.
    -
    307{ return find_max(root_, ret_value); }
    +
    307{ return find_max(root_, ret_value); }
    Here is the call graph for this function:
    @@ -473,19 +459,12 @@ template<class T >
    bool binary_search_tree< T >::find_min ( - std::unique_ptr< bst_node > &  - node, + std::unique_ptr< bst_node > & node, - T &  - ret_value  - - - - ) - + T & ret_value ) @@ -514,9 +493,9 @@ false Otherwise.
    76 return true;
    77 }
    78
    -
    79 return find_min(node->left, ret_value);
    +
    79 return find_min(node->left, ret_value);
    80 }
    -
    binary_search_tree::find_min
    bool find_min(std::unique_ptr< bst_node > &node, T &ret_value)
    Recursive function to find the minimum value in the BST.
    Definition binary_search_tree2.cpp:71
    +
    binary_search_tree::find_min
    bool find_min(std::unique_ptr< bst_node > &node, T &ret_value)
    Recursive function to find the minimum value in the BST.
    Definition binary_search_tree2.cpp:71
    Here is the call graph for this function:
    @@ -539,8 +518,7 @@ template<class T >
    bool binary_search_tree< T >::find_min ( - T &  - ret_value) + T & ret_value) @@ -561,7 +539,7 @@ template<class T >
    Returns
    true If minimum value was successfully found.
    false Otherwise.
    -
    298{ return find_min(root_, ret_value); }
    +
    298{ return find_min(root_, ret_value); }
    Here is the call graph for this function:
    @@ -584,7 +562,7 @@ template<class T >
    std::vector< T > binary_search_tree< T >::get_elements_inorder ( - ) + ) @@ -599,11 +577,11 @@ template<class T >
    Returns
    std::vector<T> List of values, sorted in in-order order.
    321 {
    322 std::vector<T> result;
    -
    323 traverse_inorder([&](T node_value) { result.push_back(node_value); },
    -
    324 root_);
    +
    323 traverse_inorder([&](T node_value) { result.push_back(node_value); },
    +
    324 root_);
    325 return result;
    326 }
    -
    binary_search_tree::traverse_inorder
    void traverse_inorder(std::function< void(T)> callback, std::unique_ptr< bst_node > &node)
    Recursive function to traverse the tree in in-order order.
    Definition binary_search_tree2.cpp:197
    +
    binary_search_tree::traverse_inorder
    void traverse_inorder(std::function< void(T)> callback, std::unique_ptr< bst_node > &node)
    Recursive function to traverse the tree in in-order order.
    Definition binary_search_tree2.cpp:197
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition fibonacci_sum.cpp:76
    @@ -628,7 +606,7 @@ template<class T >
    std::vector< T > binary_search_tree< T >::get_elements_postorder ( - ) + ) @@ -643,11 +621,11 @@ template<class T >
    Returns
    std::vector<T> List of values, sorted in post-order order.
    345 {
    346 std::vector<T> result;
    -
    347 traverse_postorder([&](T node_value) { result.push_back(node_value); },
    -
    348 root_);
    +
    347 traverse_postorder([&](T node_value) { result.push_back(node_value); },
    +
    348 root_);
    349 return result;
    350 }
    -
    binary_search_tree::traverse_postorder
    void traverse_postorder(std::function< void(T)> callback, std::unique_ptr< bst_node > &node)
    Recursive function to traverse the tree in post-order order.
    Definition binary_search_tree2.cpp:231
    +
    binary_search_tree::traverse_postorder
    void traverse_postorder(std::function< void(T)> callback, std::unique_ptr< bst_node > &node)
    Recursive function to traverse the tree in post-order order.
    Definition binary_search_tree2.cpp:231
    Here is the call graph for this function:
    @@ -670,7 +648,7 @@ template<class T >
    std::vector< T > binary_search_tree< T >::get_elements_preorder ( - ) + ) @@ -685,11 +663,11 @@ template<class T >
    Returns
    std::vector<T> List of values, sorted in pre-order order.
    333 {
    334 std::vector<T> result;
    -
    335 traverse_preorder([&](T node_value) { result.push_back(node_value); },
    -
    336 root_);
    +
    335 traverse_preorder([&](T node_value) { result.push_back(node_value); },
    +
    336 root_);
    337 return result;
    338 }
    -
    binary_search_tree::traverse_preorder
    void traverse_preorder(std::function< void(T)> callback, std::unique_ptr< bst_node > &node)
    Recursive function to traverse the tree in pre-order order.
    Definition binary_search_tree2.cpp:214
    +
    binary_search_tree::traverse_preorder
    void traverse_preorder(std::function< void(T)> callback, std::unique_ptr< bst_node > &node)
    Recursive function to traverse the tree in pre-order order.
    Definition binary_search_tree2.cpp:214
    Here is the call graph for this function:
    @@ -712,19 +690,12 @@ template<class T >
    bool binary_search_tree< T >::insert ( - std::unique_ptr< bst_node > &  - node, + std::unique_ptr< bst_node > & node, - T  - new_value  - - - - ) - + T new_value ) @@ -746,8 +717,8 @@ template<class T >
    false Otherwise.
    90 {
    -
    91 if (root_ == node && !root_) {
    -
    92 root_ = std::unique_ptr<bst_node>(new bst_node(new_value));
    +
    91 if (root_ == node && !root_) {
    +
    92 root_ = std::unique_ptr<bst_node>(new bst_node(new_value));
    93 return true;
    94 }
    95
    @@ -756,7 +727,7 @@ false Otherwise.
    98 node->left = std::unique_ptr<bst_node>(new bst_node(new_value));
    99 return true;
    100 } else {
    -
    101 return insert(node->left, new_value);
    +
    101 return insert(node->left, new_value);
    102 }
    103 } else if (new_value > node->value) {
    104 if (!node->right) {
    @@ -764,13 +735,13 @@ false Otherwise.
    106 std::unique_ptr<bst_node>(new bst_node(new_value));
    107 return true;
    108 } else {
    -
    109 return insert(node->right, new_value);
    +
    109 return insert(node->right, new_value);
    110 }
    111 } else {
    112 return false;
    113 }
    114 }
    -
    binary_search_tree::insert
    bool insert(std::unique_ptr< bst_node > &node, T new_value)
    Recursive function to insert a value into the BST.
    Definition binary_search_tree2.cpp:90
    +
    binary_search_tree::insert
    bool insert(std::unique_ptr< bst_node > &node, T new_value)
    Recursive function to insert a value into the BST.
    Definition binary_search_tree2.cpp:90
    Here is the call graph for this function:
    @@ -794,8 +765,7 @@ template<class T > bool binary_search_tree< T >::insert ( - T  - new_value) + T new_value) @@ -817,9 +787,9 @@ template<class T >
    false Otherwise.
    259 {
    -
    260 bool result = insert(root_, new_value);
    +
    260 bool result = insert(root_, new_value);
    261 if (result) {
    -
    262 size_++;
    +
    262 size_++;
    263 }
    264 return result;
    265 }
    @@ -845,25 +815,17 @@ template<class T >
    bool binary_search_tree< T >::remove ( - std::unique_ptr< bst_node > &  - parent, + std::unique_ptr< bst_node > & parent, - std::unique_ptr< bst_node > &  - node, + std::unique_ptr< bst_node > & node, - T  - rm_value  - - - - ) - + T rm_value ) @@ -893,16 +855,16 @@ false Otherwise.
    131 if (node->value == rm_value) {
    132 if (node->left && node->right) {
    133 T successor_node_value{};
    -
    134 find_max(node->left, successor_node_value);
    -
    135 remove(root_, root_, successor_node_value);
    +
    134 find_max(node->left, successor_node_value);
    +
    135 remove(root_, root_, successor_node_value);
    136 node->value = successor_node_value;
    137 return true;
    138 } else if (node->left || node->right) {
    139 std::unique_ptr<bst_node>& non_null =
    140 (node->left ? node->left : node->right);
    141
    -
    142 if (node == root_) {
    -
    143 root_ = std::move(non_null);
    +
    142 if (node == root_) {
    +
    143 root_ = std::move(non_null);
    144 } else if (rm_value < parent->value) {
    145 parent->left = std::move(non_null);
    146 } else {
    @@ -911,8 +873,8 @@ false Otherwise.
    149
    150 return true;
    151 } else {
    -
    152 if (node == root_) {
    -
    153 root_.reset(nullptr);
    +
    152 if (node == root_) {
    +
    153 root_.reset(nullptr);
    154 } else if (rm_value < parent->value) {
    155 parent->left.reset(nullptr);
    156 } else {
    @@ -922,12 +884,12 @@ false Otherwise.
    160 return true;
    161 }
    162 } else if (rm_value < node->value) {
    -
    163 return remove(node, node->left, rm_value);
    +
    163 return remove(node, node->left, rm_value);
    164 } else {
    -
    165 return remove(node, node->right, rm_value);
    +
    165 return remove(node, node->right, rm_value);
    166 }
    167 }
    -
    binary_search_tree::remove
    bool remove(std::unique_ptr< bst_node > &parent, std::unique_ptr< bst_node > &node, T rm_value)
    Recursive function to remove a value from the BST.
    Definition binary_search_tree2.cpp:125
    +
    binary_search_tree::remove
    bool remove(std::unique_ptr< bst_node > &parent, std::unique_ptr< bst_node > &node, T rm_value)
    Recursive function to remove a value from the BST.
    Definition binary_search_tree2.cpp:125
    std::move
    T move(T... args)
    Here is the call graph for this function:
    @@ -951,8 +913,7 @@ template<class T > bool binary_search_tree< T >::remove ( - T  - rm_value) + T rm_value) @@ -974,9 +935,9 @@ template<class T >
    false Otherwise.
    274 {
    -
    275 bool result = remove(root_, root_, rm_value);
    +
    275 bool result = remove(root_, root_, rm_value);
    276 if (result) {
    -
    277 size_--;
    +
    277 size_--;
    278 }
    279 return result;
    280 }
    @@ -1002,7 +963,7 @@ template<class T >
    std::size_t binary_search_tree< T >::size ( - ) + ) @@ -1015,7 +976,7 @@ template<class T >

    Get the number of values in the BST.

    Returns
    std::size_t Number of values in the BST.
    -
    314{ return size_; }
    +
    314{ return size_; }
    @@ -1033,19 +994,12 @@ template<class T > void binary_search_tree< T >::traverse_inorder ( - std::function< void(T)>  - callback, + std::function< void(T)> callback, - std::unique_ptr< bst_node > &  - node  - - - - ) - + std::unique_ptr< bst_node > & node ) @@ -1068,9 +1022,9 @@ template<class T >
    200 return;
    201 }
    202
    -
    203 traverse_inorder(callback, node->left);
    +
    203 traverse_inorder(callback, node->left);
    204 callback(node->value);
    -
    205 traverse_inorder(callback, node->right);
    +
    205 traverse_inorder(callback, node->right);
    206 }
    Here is the call graph for this function:
    @@ -1094,19 +1048,12 @@ template<class T > void binary_search_tree< T >::traverse_postorder ( - std::function< void(T)>  - callback, + std::function< void(T)> callback, - std::unique_ptr< bst_node > &  - node  - - - - ) - + std::unique_ptr< bst_node > & node ) @@ -1129,8 +1076,8 @@ template<class T >
    234 return;
    235 }
    236
    -
    237 traverse_postorder(callback, node->left);
    -
    238 traverse_postorder(callback, node->right);
    +
    237 traverse_postorder(callback, node->left);
    +
    238 traverse_postorder(callback, node->right);
    239 callback(node->value);
    240 }
    @@ -1155,19 +1102,12 @@ template<class T >
    void binary_search_tree< T >::traverse_preorder ( - std::function< void(T)>  - callback, + std::function< void(T)> callback, - std::unique_ptr< bst_node > &  - node  - - - - ) - + std::unique_ptr< bst_node > & node ) @@ -1191,8 +1131,8 @@ template<class T >
    218 }
    219
    220 callback(node->value);
    -
    221 traverse_preorder(callback, node->left);
    -
    222 traverse_preorder(callback, node->right);
    +
    221 traverse_preorder(callback, node->left);
    +
    222 traverse_preorder(callback, node->right);
    223 }
    Here is the call graph for this function:
    @@ -1262,7 +1202,7 @@ template<class T > diff --git a/d9/dde/structdouble__hashing_1_1_entry.html b/d9/dde/structdouble__hashing_1_1_entry.html index a3e2822d2..54413b31d 100644 --- a/d9/dde/structdouble__hashing_1_1_entry.html +++ b/d9/dde/structdouble__hashing_1_1_entry.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: double_hashing::Entry Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -108,7 +110,7 @@ $(document).ready(function(){initNavTree('d9/dde/structdouble__hashing_1_1_entry

    Public Member Functions

    - Entry (int key=notPresent) + Entry (int key=notPresent)  constructor
      @@ -130,7 +132,7 @@ int  diff --git a/d9/dee/classdouble__linked__list.html b/d9/dee/classdouble__linked__list.html index 7bdcff0c1..d9a536168 100644 --- a/d9/dee/classdouble__linked__list.html +++ b/d9/dee/classdouble__linked__list.html @@ -3,16 +3,18 @@ - +Algorithms_in_C++: double_linked_list Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    key
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,15 +108,15 @@ $(document).ready(function(){initNavTree('d9/dee/classdouble__linked__list.html' - + - + - + - + - +

    Public Member Functions

    void insert (int x)
    void insert (int x)
     
    void remove (int x)
    void remove (int x)
     
    void search (int x)
    void search (int x)
     
    void show ()
    void show ()
     
    void reverseShow ()
    void reverseShow ()
     

    Constructor & Destructor Documentation

    @@ -130,7 +132,7 @@ Public Member Functions double_linked_list::double_linked_list ( - ) + ) @@ -154,8 +156,7 @@ Public Member Functions void double_linked_list::insert ( - int  - x) + int x) @@ -166,19 +167,20 @@ Public Member Functions
    24 while (t->next != NULL) {
    25 t = t->next;
    26 }
    -
    27 node *n = new node;
    +
    27 node *n = new node;
    28 t->next = n;
    29 n->prev = t;
    30 n->val = x;
    31 n->next = NULL;
    32 } else {
    -
    33 node *n = new node;
    +
    33 node *n = new node;
    34 n->val = x;
    35 n->prev = NULL;
    36 n->next = NULL;
    37 start = n;
    38 }
    39}
    +
    node
    struct node { int data; int height; struct node *left; struct node *right;} node
    for std::queue
    Definition avltree.cpp:13
    node
    Definition binary_search_tree.cpp:11
    @@ -192,8 +194,7 @@ Public Member Functions void double_linked_list::remove ( - int  - x) + int x) @@ -233,7 +234,7 @@ Public Member Functions void double_linked_list::reverseShow ( - ) + ) @@ -261,8 +262,7 @@ Public Member Functions void double_linked_list::search ( - int  - x) + int x) @@ -294,7 +294,7 @@ Public Member Functions void double_linked_list::show ( - ) + ) @@ -318,7 +318,7 @@ Public Member Functions diff --git a/d9/def/namespacesublist__search.html b/d9/def/namespacesublist__search.html index 6bb690684..d0a86cf3e 100644 --- a/d9/def/namespacesublist__search.html +++ b/d9/def/namespacesublist__search.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sublist_search Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d9/def/namespacesublist__search.html',

    Functions for the Sublist Search implementation. -More...

    +More...

    Detailed Description

    Functions for the Sublist Search implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d9/def/namespacesublist__search.html', diff --git a/d9/df0/fast__integer__input_8cpp.html b/d9/df0/fast__integer__input_8cpp.html index 6e53eef56..d6abf1c36 100644 --- a/d9/df0/fast__integer__input_8cpp.html +++ b/d9/df0/fast__integer__input_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/fast_integer_input.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,9 +116,9 @@ Include dependency graph for fast_integer_input.cpp:
    - + - +

    Functions

    void fastinput (int *number)
    void fastinput (int *number)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -131,8 +133,7 @@ Functions void fastinput ( - int *  - number) + int * number) @@ -182,8 +183,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -191,13 +191,13 @@ Here is the call graph for this function:

    Main function

    39 {
    40 int number;
    -
    41 fastinput(&number);
    +
    41 fastinput(&number);
    42 std::cout << number << std::endl;
    43 return 0;
    44}
    std::endl
    T endl(T... args)
    -
    fastinput
    void fastinput(int *number)
    Definition fast_integer_input.cpp:11
    +
    fastinput
    void fastinput(int *number)
    Definition fast_integer_input.cpp:11
    Here is the call graph for this function:
    @@ -212,7 +212,7 @@ Here is the call graph for this function:
    diff --git a/d9/df4/namespacetests.html b/d9/df4/namespacetests.html index cb7527c4c..0ee32a9e5 100644 --- a/d9/df4/namespacetests.html +++ b/d9/df4/namespacetests.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: tests Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -104,26 +106,26 @@ $(document).ready(function(){initNavTree('d9/df4/namespacetests.html','../../');

    Testcases to check Union of Two Arrays. -More...

    +More...

    - + - + - + - + - + - +

    Functions

    void test1 ()
    void test1 ()
     A Test to check an simple case.
     
    void test2 ()
    void test2 ()
     A Test to check an empty vector.
     
    void test3 ()
    void test3 ()
     A Test to check an invalid shift value.
     
    void test4 ()
    void test4 ()
     A Test to check a very large input.
     
    void test5 ()
    void test5 ()
     A Test to check a shift of zero.
     
    void test6 ()
    void test6 ()
     A Test to check correct functionality with an array sorted using std::sort.
     
    @@ -142,7 +144,7 @@ Functions void tests::test1 ( - ) + ) @@ -196,7 +198,7 @@ Functions void tests::test2 ( - ) + ) @@ -245,7 +247,7 @@ Functions void tests::test3 ( - ) + ) @@ -297,7 +299,7 @@ Functions void tests::test4 ( - ) + ) @@ -357,7 +359,7 @@ Here is the call graph for this function:
    void tests::test5 ( - ) + ) @@ -400,7 +402,7 @@ Here is the call graph for this function:
    void tests::test6 ( - ) + ) @@ -429,7 +431,7 @@ Here is the call graph for this function:
    172 std::vector<int32_t> b = {11, 3, 7, 8, 6};
    173 std::sort(a.begin(), a.end()); ///< Sort vector a
    174 std::sort(b.begin(), b.end()); ///< Sort vector b
    -
    175 std::vector<int32_t> result = get_intersection(a, b);
    +
    175 std::vector<int32_t> result = get_intersection(a, b);
    176 std::vector<int32_t> expected = {3, 7};
    177 assert(result == expected); ///< Check if result is correct
    178 print(result); ///< Should print 3 7
    @@ -438,7 +440,6 @@ Here is the call graph for this function:
    std::vector::begin
    T begin(T... args)
    std::vector::end
    T end(T... args)
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition fibonacci_sum.cpp:76
    -
    operations_on_datastructures::get_intersection
    std::vector< int32_t > get_intersection(const std::vector< int32_t > &first, const std::vector< int32_t > &second)
    Gets the intersection of two sorted arrays, and returns them in a vector.
    Definition intersection_of_two_arrays.cpp:49
    std::sort
    T sort(T... args)
    Here is the call graph for this function:
    @@ -454,7 +455,7 @@ Here is the call graph for this function: diff --git a/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html b/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html index cf18dc565..19f5ae28e 100644 --- a/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html +++ b/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others::recursive_tree_traversals::Node Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -105,7 +107,7 @@ $(document).ready(function(){initNavTree('d9/df7/structothers_1_1recursive__tree

    The structure to hold Nodes of the tree. - More...

    + More...

    Collaboration diagram for others::recursive_tree_traversals::Node:
    @@ -118,10 +120,10 @@ Public Attributes uint64_t data = 0  The value/key of the node.
      -struct Node * left {} +struct Node * left {}  struct pointer to left subtree.
      -struct Node * right {} +struct Node * right {}  struct pointer to right subtree.
      @@ -179,7 +181,7 @@ uint64_t data = 0 diff --git a/d9/dfd/comb__sort_8cpp.html b/d9/dfd/comb__sort_8cpp.html index aa566f3d2..d8c40e838 100644 --- a/d9/dfd/comb__sort_8cpp.html +++ b/d9/dfd/comb__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/comb_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,13 +118,13 @@ Include dependency graph for comb_sort.cpp:
    - + - + - + - +

    Functions

    int FindNextGap (int gap)
    int FindNextGap (int gap)
     
    void CombSort (int *arr, int l, int r)
    void CombSort (int *arr, int l, int r)
     
    void tests ()
    void tests ()
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -143,25 +145,17 @@ Functions void CombSort ( - int *  - arr, + int * arr, - int  - l, + int l, - int  - r  - - - - ) - + int r )
    @@ -196,7 +190,7 @@ Functions
    56 /// Keep running until gap = 1 or none elements were swapped
    57 while (gap != 1 || swapped) {
    58 /// Find next gap
    -
    59 gap = FindNextGap(gap);
    +
    59 gap = FindNextGap(gap);
    60
    61 swapped = false;
    62
    @@ -209,7 +203,7 @@ Functions
    69 }
    70 }
    71}
    -
    FindNextGap
    int FindNextGap(int gap)
    Definition comb_sort.cpp:29
    +
    FindNextGap
    int FindNextGap(int gap)
    Definition comb_sort.cpp:29
    std::swap
    T swap(T... args)
    Here is the call graph for this function:
    @@ -228,8 +222,7 @@ Here is the call graph for this function: int FindNextGap ( - int  - gap) + int gap) @@ -264,8 +257,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -275,22 +267,22 @@ Here is the call graph for this function:

    For user interaction

    88 {
    89 /// Running predefined tests
    -
    90 tests();
    +
    90 tests();
    91
    92 /// For user interaction
    93 int n;
    94 std::cin >> n;
    95 int *arr = new int[n];
    96 for (int i = 0; i < n; ++i) std::cin >> arr[i];
    -
    97 CombSort(arr, 0, n);
    +
    97 CombSort(arr, 0, n);
    98 for (int i = 0; i < n; ++i) std::cout << arr[i] << ' ';
    99 delete[] arr;
    100 return 0;
    101}
    -
    CombSort
    void CombSort(int *arr, int l, int r)
    Definition comb_sort.cpp:42
    -
    tests
    void tests()
    Definition comb_sort.cpp:73
    +
    CombSort
    void CombSort(int *arr, int l, int r)
    Definition comb_sort.cpp:42
    +
    tests
    void tests()
    Definition comb_sort.cpp:73
    Here is the call graph for this function:
    @@ -308,7 +300,7 @@ Here is the call graph for this function:
    void tests ( - ) + ) @@ -318,13 +310,13 @@ Here is the call graph for this function:
    73 {
    74 /// Test 1
    75 int arr1[10] = {34, 56, 6, 23, 76, 34, 76, 343, 4, 76};
    -
    76 CombSort(arr1, 0, 10);
    +
    76 CombSort(arr1, 0, 10);
    77 assert(std::is_sorted(arr1, arr1 + 10));
    78 std::cout << "Test 1 passed\n";
    79
    80 /// Test 2
    81 int arr2[8] = {-6, 56, -45, 56, 0, -1, 8, 8};
    -
    82 CombSort(arr2, 0, 8);
    +
    82 CombSort(arr2, 0, 8);
    83 assert(std::is_sorted(arr2, arr2 + 8));
    84 std::cout << "Test 2 Passed\n";
    85}
    @@ -343,7 +335,7 @@ Here is the call graph for this function:
    diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html index 2ad2e38e0..f9a23ee1f 100644 --- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html +++ b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: machine_learning::aystar_search::AyStarSearch< Puzzle > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -109,7 +111,7 @@ $(document).ready(function(){initNavTree('da/d02/classmachine__learning_1_1aysta

    A class defining A* search algorithm. for some initial state and final state. - More...

    + More...

    Collaboration diagram for machine_learning::aystar_search::AyStarSearch< Puzzle >:
    @@ -127,31 +129,28 @@ Classes - - - - - - + + + + + +

    Public Types

    -using MapOfPuzzleInfoWithPuzzleInfo = std::map< std::shared_ptr< Info >, std::shared_ptr< Info >, comparison_operator >
     
    -using MapOfPuzzleInfoWithInteger = std::map< std::shared_ptr< Info >, uint32_t, comparison_operator >
     
    -using SetOfPuzzleInfo = std::set< std::shared_ptr< Info >, comparison_operator >
     
    using MapOfPuzzleInfoWithPuzzleInfo
     
    using MapOfPuzzleInfoWithInteger
     
    using SetOfPuzzleInfo
     
    - + - + - +

    Public Member Functions

     AyStarSearch (const Puzzle &initial, const Puzzle &final)
     AyStarSearch (const Puzzle &initial, const Puzzle &final)
     Parameterized constructor for AyStarSearch.
     
    std::vector< Puzzle > Solution (std::shared_ptr< Info > FinalState, const MapOfPuzzleInfoWithPuzzleInfo &parent_of)
    std::vector< Puzzle > Solution (std::shared_ptr< Info > FinalState, const MapOfPuzzleInfoWithPuzzleInfo &parent_of)
     A helper solution: launches when a solution for AyStarSearch is found.
     
    std::vector< Puzzle > a_star_search (const std::function< uint32_t(const Puzzle &, const Puzzle &)> &dist, const uint32_t permissible_depth=30)
    std::vector< Puzzle > a_star_search (const std::function< uint32_t(const Puzzle &, const Puzzle &)> &dist, const uint32_t permissible_depth=30)
     
    +typedef struct machine_learning::aystar_search::AyStarSearch::Info 

    Private Types

    -typedef struct machine_learning::aystar_search::AyStarSearch::Info Info
    Info
     Struct that handles all the information related to the current state.
     
    @@ -177,7 +176,66 @@ class machine_learning::aystar_search::AyStarSearch< Puzzle >

    A cl

  • For AyStarSearch to work, the definitions for template Puzzle is compulsory. a. Comparison operator for template Puzzle (<, ==, and <=) b. generate_possible_moves()
    • -

    Constructor & Destructor Documentation

    +

    Member Typedef Documentation

    + +

    ◆ MapOfPuzzleInfoWithInteger

    + +
    +
    +
    +template<typename Puzzle >
    +
    + + + +
    using machine_learning::aystar_search::AyStarSearch< Puzzle >::MapOfPuzzleInfoWithInteger
    +
    +Initial value:
    +
    std::map<std::shared_ptr<Info>, uint32_t, comparison_operator>
    + +
    +
    +
    + +

    ◆ MapOfPuzzleInfoWithPuzzleInfo

    + +
    +
    +
    +template<typename Puzzle >
    + + + + +
    using machine_learning::aystar_search::AyStarSearch< Puzzle >::MapOfPuzzleInfoWithPuzzleInfo
    +
    +Initial value:
    +
    std::map<std::shared_ptr<Info>, std::shared_ptr<Info>,
    +
    comparison_operator>
    + +
    +
    +
    + +

    ◆ SetOfPuzzleInfo

    + +
    +
    +
    +template<typename Puzzle >
    + + + + +
    using machine_learning::aystar_search::AyStarSearch< Puzzle >::SetOfPuzzleInfo
    +
    +Initial value:
    +
    std::set<std::shared_ptr<Info>, comparison_operator>
    + +
    +
    +
    +

    Constructor & Destructor Documentation

    ◆ AyStarSearch()

    @@ -192,19 +250,12 @@ template<typename Puzzle >
    machine_learning::aystar_search::AyStarSearch< Puzzle >::AyStarSearch ( - const Puzzle &  - initial, + const Puzzle & initial, - const Puzzle &  - final  - - - - ) - + const Puzzle & final ) @@ -244,19 +295,12 @@ template<typename Puzzle > std::vector< Puzzle > machine_learning::aystar_search::AyStarSearch< Puzzle >::a_star_search ( - const std::function< uint32_t(const Puzzle &, const Puzzle &)> &  - dist, + const std::function< uint32_t(const Puzzle &, const Puzzle &)> & dist, - const uint32_t  - permissible_depth = 30  - - - - ) - + const uint32_t permissible_depth = 30 ) @@ -309,7 +353,7 @@ template<typename Puzzle >
    460
    461 // if this current state is equal to final, return
    462 if (*(current_state->state) == *(Final->state)) {
    -
    463 return Solution(current_state, parent_of);
    +
    463 return Solution(current_state, parent_of);
    464 }
    465 // else remove from open list as visited.
    466 open_list.erase(it_low_f_score);
    @@ -372,13 +416,12 @@ template<typename Puzzle >
    523 // Cannot find the solution, return empty vector
    524 return std::vector<Puzzle>(0);
    525 }
    -
    Solution
    Definition bridge_finding_with_tarjan_algorithm.cpp:11
    - +
    machine_learning::aystar_search::AyStarSearch::Solution
    std::vector< Puzzle > Solution(std::shared_ptr< Info > FinalState, const MapOfPuzzleInfoWithPuzzleInfo &parent_of)
    A helper solution: launches when a solution for AyStarSearch is found.
    Definition a_star_search.cpp:405
    Here is the call graph for this function:
    -
    +
    @@ -397,19 +440,12 @@ template<typename Puzzle > std::vector< Puzzle > machine_learning::aystar_search::AyStarSearch< Puzzle >::Solution ( - std::shared_ptr< Info >  - FinalState, + std::shared_ptr< Info > FinalState, - const MapOfPuzzleInfoWithPuzzleInfo &  - parent_of  - - - - ) - + const MapOfPuzzleInfoWithPuzzleInfo & parent_of ) @@ -460,7 +496,7 @@ Here is the call graph for this function: diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.map b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.map index 74fbcc988..6bf23f383 100644 --- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.map +++ b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.map @@ -1,19 +1,24 @@ - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.md5 b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.md5 index 68fbd05a2..290e56252 100644 --- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.md5 +++ b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.md5 @@ -1 +1 @@ -d14ef6fc2ab70cc26df42d399c08866c \ No newline at end of file +f93f4ea0c4d233668b5c6694a4f7829e \ No newline at end of file diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.svg b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.svg index 0ca70e888..40c1d3400 100644 --- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.svg +++ b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.svg @@ -4,8 +4,8 @@ - + - + machine_learning::aystar_search::AyStarSearch::a_star_search Node1 - -machine_learning::aystar -_search::AyStarSearch:: -a_star_search + +machine_learning::aystar +_search::AyStarSearch:: +a_star_search @@ -33,8 +33,8 @@ Node2 - -std::set::begin + +std::set::begin @@ -42,8 +42,8 @@ Node1->Node2 - - + + @@ -51,8 +51,8 @@ Node3 - -std::set::emplace + +std::set::emplace @@ -60,8 +60,8 @@ Node1->Node3 - - + + @@ -69,8 +69,8 @@ Node4 - -std::set::empty + +std::set::empty @@ -78,8 +78,8 @@ Node1->Node4 - - + + @@ -87,8 +87,8 @@ Node5 - -std::set::end + +std::set::end @@ -96,8 +96,8 @@ Node1->Node5 - - + + @@ -105,8 +105,8 @@ Node6 - -std::map::end + +std::map::end @@ -114,8 +114,8 @@ Node1->Node6 - - + + @@ -123,8 +123,8 @@ Node7 - -std::set::erase + +std::set::erase @@ -132,8 +132,8 @@ Node1->Node7 - - + + @@ -141,8 +141,8 @@ Node8 - -std::set::find + +std::set::find @@ -150,8 +150,8 @@ Node1->Node8 - - + + @@ -159,8 +159,8 @@ Node9 - -std::map::find + +std::map::find @@ -168,8 +168,55 @@ Node1->Node9 - - + + + + + + + +Node10 + + +machine_learning::aystar +_search::AyStarSearch:: +Solution + + + + + +Node1->Node10 + + + + + + + + +Node10->Node9 + + + + + + + + +Node11 + + +std::vector::emplace_back + + + + + +Node10->Node11 + + + diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph_org.svg b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph_org.svg index dd35f64ec..e4ae87d4b 100644 --- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph_org.svg +++ b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph_org.svg @@ -4,18 +4,18 @@ - - + + machine_learning::aystar_search::AyStarSearch::a_star_search Node1 - -machine_learning::aystar -_search::AyStarSearch:: -a_star_search + +machine_learning::aystar +_search::AyStarSearch:: +a_star_search @@ -23,8 +23,8 @@ Node2 - -std::set::begin + +std::set::begin @@ -32,8 +32,8 @@ Node1->Node2 - - + + @@ -41,8 +41,8 @@ Node3 - -std::set::emplace + +std::set::emplace @@ -50,8 +50,8 @@ Node1->Node3 - - + + @@ -59,8 +59,8 @@ Node4 - -std::set::empty + +std::set::empty @@ -68,8 +68,8 @@ Node1->Node4 - - + + @@ -77,8 +77,8 @@ Node5 - -std::set::end + +std::set::end @@ -86,8 +86,8 @@ Node1->Node5 - - + + @@ -95,8 +95,8 @@ Node6 - -std::map::end + +std::map::end @@ -104,8 +104,8 @@ Node1->Node6 - - + + @@ -113,8 +113,8 @@ Node7 - -std::set::erase + +std::set::erase @@ -122,8 +122,8 @@ Node1->Node7 - - + + @@ -131,8 +131,8 @@ Node8 - -std::set::find + +std::set::find @@ -140,8 +140,8 @@ Node1->Node8 - - + + @@ -149,8 +149,8 @@ Node9 - -std::map::find + +std::map::find @@ -158,8 +158,55 @@ Node1->Node9 - - + + + + + + + +Node10 + + +machine_learning::aystar +_search::AyStarSearch:: +Solution + + + + + +Node1->Node10 + + + + + + + + +Node10->Node9 + + + + + + + + +Node11 + + +std::vector::emplace_back + + + + + +Node10->Node11 + + + diff --git a/da/d0d/longest__common__string_8cpp.html b/da/d0d/longest__common__string_8cpp.html index 604e04ddd..0a665f066 100644 --- a/da/d0d/longest__common__string_8cpp.html +++ b/da/d0d/longest__common__string_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/longest_common_string.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -104,7 +106,7 @@ $(document).ready(function(){initNavTree('da/d0d/longest__common__string_8cpp.ht
    -

    contains the definition of the function longest_common_string_length +

    contains the definition of the function longest_common_string_length More...

    #include <cassert>
    #include <iostream>
    @@ -120,41 +122,41 @@ Include dependency graph for longest_common_string.cpp:

    Classes

    struct  TestCase - represents single example inputs and expected output of the function longest_common_string_length More...
    + represents single example inputs and expected output of the function longest_common_string_length More...
      - + - + - - + + - - + + - + - - + + - - + + - +

    Functions

    std::size_t longest_common_string_length (const std::string &string_a, const std::string &string_b)
    std::size_t longest_common_string_length (const std::string &string_a, const std::string &string_b)
     for std::vector
     
    std::vector< TestCase > get_test_cases ()
    std::vector< TestCase > get_test_cases ()
     
    template<typename TestCases >
    static void test_longest_common_string_length (const TestCases &test_cases)
     checks the function longest_common_string_length agains example data
    static void test_longest_common_string_length (const TestCases &test_cases)
     checks the function longest_common_string_length agains example data
     
    template<typename TestCases >
    static void test_longest_common_string_length_is_symmetric (const TestCases &test_cases)
     checks if the function longest_common_string_length returns the same result when its argument are flipped
    static void test_longest_common_string_length_is_symmetric (const TestCases &test_cases)
     checks if the function longest_common_string_length returns the same result when its argument are flipped
     
    std::string reverse_str (const std::string &in_str)
    std::string reverse_str (const std::string &in_str)
     reverses a given string
     
    template<typename TestCases >
    static void test_longest_common_string_length_for_reversed_inputs (const TestCases &test_cases)
     checks if the function longest_common_string_length returns the same result when its inputs are reversed
    static void test_longest_common_string_length_for_reversed_inputs (const TestCases &test_cases)
     checks if the function longest_common_string_length returns the same result when its inputs are reversed
     
    static void tests ()
     runs all tests for longest_common_string_length funcion
    static void tests ()
     runs all tests for longest_common_string_length funcion
     
    int main ()
    int main ()
     Main function.
     

    Detailed Description

    -

    contains the definition of the function longest_common_string_length

    -

    the function longest_common_string_length computes the length of the longest common string which can be created of two input strings by removing characters from them

    +

    contains the definition of the function longest_common_string_length

    +

    the function longest_common_string_length computes the length of the longest common string which can be created of two input strings by removing characters from them

    Author
    Nikhil Arora
    Piotr Idzik
    @@ -168,12 +170,12 @@ Functions std::vector< TestCase > get_test_cases ( - ) + )
    -
    Returns
    example data used in the tests of longest_common_string_length
    +
    Returns
    example data used in the tests of longest_common_string_length
    69 {
    70 return {TestCase("", "", 0),
    71 TestCase("ab", "ab", 2),
    @@ -202,19 +204,12 @@ Functions std::size_t longest_common_string_length ( - const std::string &  - string_a, + const std::string & string_a, - const std::string &  - string_b  - - - - ) - + const std::string & string_b )
    @@ -271,8 +266,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -281,10 +275,10 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    156 {
    -
    157 tests();
    +
    157 tests();
    158 return 0;
    159}
    -
    tests
    static void tests()
    runs all tests for longest_common_string_length funcion
    Definition longest_common_string.cpp:142
    +
    tests
    static void tests()
    runs all tests for longest_common_string_length funcion
    Definition longest_common_string.cpp:142
    Here is the call graph for this function:
    @@ -302,8 +296,7 @@ Here is the call graph for this function:
    std::string reverse_str ( - const std::string &  - in_str) + const std::string & in_str) @@ -344,8 +337,7 @@ template<typename Tes static void test_longest_common_string_length ( - const TestCases &  - test_cases) + const TestCases & test_cases) @@ -356,7 +348,7 @@ template<typename Tes
    -

    checks the function longest_common_string_length agains example data

    +

    checks the function longest_common_string_length agains example data

    Parameters
    @@ -371,11 +363,11 @@ template<typename Tes
    91 {
    92 for (const auto& cur_tc : test_cases) {
    -
    93 assert(longest_common_string_length(cur_tc.string_a, cur_tc.string_b) ==
    +
    93 assert(longest_common_string_length(cur_tc.string_a, cur_tc.string_b) ==
    94 cur_tc.common_string_len);
    95 }
    96}
    -
    longest_common_string_length
    std::size_t longest_common_string_length(const std::string &string_a, const std::string &string_b)
    for std::vector
    Definition longest_common_string.cpp:28
    +
    longest_common_string_length
    std::size_t longest_common_string_length(const std::string &string_a, const std::string &string_b)
    for std::vector
    Definition longest_common_string.cpp:28
    Here is the call graph for this function:
    @@ -398,8 +390,7 @@ template<typename Tes
    - - +
    test_caseslist of test cases
    static void test_longest_common_string_length_for_reversed_inputs (const TestCases & test_cases)const TestCases & test_cases)
    @@ -410,7 +401,7 @@ template<typename Tes
    -

    checks if the function longest_common_string_length returns the same result when its inputs are reversed

    +

    checks if the function longest_common_string_length returns the same result when its inputs are reversed

    Parameters
    @@ -425,12 +416,12 @@ template<typename Tes
    131 {
    132 for (const auto& cur_tc : test_cases) {
    -
    133 assert(longest_common_string_length(reverse_str(cur_tc.string_a),
    -
    134 reverse_str(cur_tc.string_b)) ==
    +
    133 assert(longest_common_string_length(reverse_str(cur_tc.string_a),
    +
    134 reverse_str(cur_tc.string_b)) ==
    135 cur_tc.common_string_len);
    136 }
    137}
    -
    reverse_str
    std::string reverse_str(const std::string &in_str)
    reverses a given string
    Definition longest_common_string.cpp:119
    +
    reverse_str
    std::string reverse_str(const std::string &in_str)
    reverses a given string
    Definition longest_common_string.cpp:119
    Here is the call graph for this function:
    @@ -453,8 +444,7 @@ template<typename Tes
    - - +
    test_caseslist of test cases
    static void test_longest_common_string_length_is_symmetric (const TestCases & test_cases)const TestCases & test_cases)
    @@ -465,7 +455,7 @@ template<typename Tes
    -

    checks if the function longest_common_string_length returns the same result when its argument are flipped

    +

    checks if the function longest_common_string_length returns the same result when its argument are flipped

    Parameters
    @@ -480,7 +470,7 @@ template<typename Tes
    106 {
    107 for (const auto& cur_tc : test_cases) {
    -
    108 assert(longest_common_string_length(cur_tc.string_b, cur_tc.string_a) ==
    +
    108 assert(longest_common_string_length(cur_tc.string_b, cur_tc.string_a) ==
    109 cur_tc.common_string_len);
    110 }
    111}
    @@ -504,7 +494,7 @@ Here is the call graph for this function:
    - +
    test_caseslist of test cases
    static void tests ())
    @@ -515,21 +505,21 @@ Here is the call graph for this function:
    -

    runs all tests for longest_common_string_length funcion

    +

    runs all tests for longest_common_string_length funcion

    142 {
    -
    143 const auto test_cases = get_test_cases();
    +
    143 const auto test_cases = get_test_cases();
    144 assert(test_cases.size() > 0);
    -
    145 test_longest_common_string_length(test_cases);
    -
    146 test_longest_common_string_length_is_symmetric(test_cases);
    -
    147 test_longest_common_string_length_for_reversed_inputs(test_cases);
    +
    145 test_longest_common_string_length(test_cases);
    +
    146 test_longest_common_string_length_is_symmetric(test_cases);
    +
    147 test_longest_common_string_length_for_reversed_inputs(test_cases);
    148
    149 std::cout << "All tests have successfully passed!\n";
    150}
    -
    test_longest_common_string_length_for_reversed_inputs
    static void test_longest_common_string_length_for_reversed_inputs(const TestCases &test_cases)
    checks if the function longest_common_string_length returns the same result when its inputs are rever...
    Definition longest_common_string.cpp:130
    -
    get_test_cases
    std::vector< TestCase > get_test_cases()
    Definition longest_common_string.cpp:69
    -
    test_longest_common_string_length
    static void test_longest_common_string_length(const TestCases &test_cases)
    checks the function longest_common_string_length agains example data
    Definition longest_common_string.cpp:91
    -
    test_longest_common_string_length_is_symmetric
    static void test_longest_common_string_length_is_symmetric(const TestCases &test_cases)
    checks if the function longest_common_string_length returns the same result when its argument are fli...
    Definition longest_common_string.cpp:105
    +
    test_longest_common_string_length_for_reversed_inputs
    static void test_longest_common_string_length_for_reversed_inputs(const TestCases &test_cases)
    checks if the function longest_common_string_length returns the same result when its inputs are rever...
    Definition longest_common_string.cpp:130
    +
    get_test_cases
    std::vector< TestCase > get_test_cases()
    Definition longest_common_string.cpp:69
    +
    test_longest_common_string_length
    static void test_longest_common_string_length(const TestCases &test_cases)
    checks the function longest_common_string_length agains example data
    Definition longest_common_string.cpp:91
    +
    test_longest_common_string_length_is_symmetric
    static void test_longest_common_string_length_is_symmetric(const TestCases &test_cases)
    checks if the function longest_common_string_length returns the same result when its argument are fli...
    Definition longest_common_string.cpp:105
    Here is the call graph for this function:
    @@ -544,7 +534,7 @@ Here is the call graph for this function:
    diff --git a/da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html b/da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html index 83327f0c2..27c2d7816 100644 --- a/da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html +++ b/da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: operations_on_datastructures::circular_linked_list::Node Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('da/d16/structoperations__on__datastruc

    A Node struct that represents a single Node in a Binary Tree. - More...

    + More...

    Collaboration diagram for operations_on_datastructures::circular_linked_list::Node:
    @@ -115,10 +117,10 @@ Collaboration diagram for operations_on_datastructures::circular_linked_list::No - + - +

    Public Member Functions

     Node (int64_t _data)
     Node (int64_t _data)
     Creates a new Node with some initial data.
     
     Node (int64_t _data, Node *_next)
     Node (int64_t _data, Node *_next)
     Creates a new Node with initial data and a successor.
     
    @@ -148,8 +150,7 @@ int64_t  - - +
    data
    operations_on_datastructures::circular_linked_list::Node::Node (int64_t _data)int64_t _data)
    @@ -170,11 +171,11 @@ int64_t data

    < Set value of Node data

    < Initialize successor

    39 {
    -
    40 data = _data; ///< Set value of Node data
    -
    41 next = nullptr; ///< Initialize successor
    +
    40 data = _data; ///< Set value of Node data
    +
    41 next = nullptr; ///< Initialize successor
    42 }
    -
    operations_on_datastructures::circular_linked_list::Node::data
    int64_t data
    The value of the Node.
    Definition circular_linked_list.cpp:33
    -
    operations_on_datastructures::circular_linked_list::Node::next
    Node * next
    The Node's successor.
    Definition circular_linked_list.cpp:34
    +
    operations_on_datastructures::circular_linked_list::Node::data
    int64_t data
    The value of the Node.
    Definition circular_linked_list.cpp:33
    +
    operations_on_datastructures::circular_linked_list::Node::next
    Node * next
    The Node's successor.
    Definition circular_linked_list.cpp:34
    @@ -190,19 +191,12 @@ int64_t data operations_on_datastructures::circular_linked_list::Node::Node ( - int64_t  - _data, + int64_t _data, - Node *  - _next  - - - - ) - + Node * _next ) @@ -223,8 +217,8 @@ int64_t data

    < Set value of Node data

    < Initialize successor

    48 {
    -
    49 data = _data; ///< Set value of Node data
    -
    50 next = _next; ///< Initialize successor
    +
    49 data = _data; ///< Set value of Node data
    +
    50 next = _next; ///< Initialize successor
    51 }
    @@ -238,7 +232,7 @@ int64_t data diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp.html b/da/d18/quadratic__equations__complex__numbers_8cpp.html index cc7a68003..dd6506066 100644 --- a/da/d18/quadratic__equations__complex__numbers_8cpp.html +++ b/da/d18/quadratic__equations__complex__numbers_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/quadratic_equations_complex_numbers.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -130,13 +132,13 @@ Functions std::array< std::complex< long double >, 2 > math::quadraticEquation (long double a, long double b, long double c)  Quadratic equation calculator.
      -void assertArray (std::array< std::complex< long double >, 2 > input, std::array< std::complex< long double >, 2 > expected, size_t precision=10) +void assertArray (std::array< std::complex< long double >, 2 > input, std::array< std::complex< long double >, 2 > expected, size_t precision=10)  Asserts an array of complex numbers.
      -static void test () +static void test ()  Self-test implementations to test quadraticEquation function.
      -int main () +int main ()  Main function.
      @@ -155,25 +157,17 @@ Functions void assertArray ( - std::array< std::complex< long double >, 2 >  - input, + std::array< std::complex< long double >, 2 > input, - std::array< std::complex< long double >, 2 >  - expected, + std::array< std::complex< long double >, 2 > expected, - size_t  - precision = 10  - - - - ) - + size_t precision = 10 )
    @@ -222,8 +216,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -232,10 +225,10 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    186 {
    -
    187 test(); // Run self-test implementation.
    +
    187 test(); // Run self-test implementation.
    188 return 0;
    189}
    -
    test
    static void test()
    Self-test implementations to test quadraticEquation function.
    Definition quadratic_equations_complex_numbers.cpp:122
    +
    test
    static void test()
    Self-test implementations to test quadraticEquation function.
    Definition quadratic_equations_complex_numbers.cpp:122
    Here is the call graph for this function:
    @@ -256,7 +249,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -302,7 +295,7 @@ Here is the call graph for this function:
    152 std::array<std::complex<long double>, 2> floatCase{
    153 std::complex<long double>{-4.7912878475, 0},
    154 std::complex<long double>{-0.2087121525, 0}};
    -
    155 assertArray(math::quadraticEquation(1, 5, 1), floatCase);
    +
    155 assertArray(math::quadraticEquation(1, 5, 1), floatCase);
    156
    157 // Values are complex.
    158 std::cout << "Input: \n"
    @@ -314,7 +307,7 @@ Here is the call graph for this function:
    164 std::array<std::complex<long double>, 2> ifloatCase{
    165 std::complex<long double>{-0.5, -0.8660254038},
    166 std::complex<long double>{-0.5, 0.8660254038}};
    -
    167 assertArray(math::quadraticEquation(1, 1, 1), ifloatCase);
    +
    167 assertArray(math::quadraticEquation(1, 1, 1), ifloatCase);
    168
    169 std::cout << "Exception test: \n"
    170 "Input: \n"
    @@ -333,7 +326,7 @@ Here is the call graph for this function:
    math::quadraticEquation
    std::array< std::complex< long double >, 2 > quadraticEquation(long double a, long double b, long double c)
    Quadratic equation calculator.
    Definition quadratic_equations_complex_numbers.cpp:53
    -
    assertArray
    void assertArray(std::array< std::complex< long double >, 2 > input, std::array< std::complex< long double >, 2 > expected, size_t precision=10)
    Asserts an array of complex numbers.
    Definition quadratic_equations_complex_numbers.cpp:100
    +
    assertArray
    void assertArray(std::array< std::complex< long double >, 2 > input, std::array< std::complex< long double >, 2 > expected, size_t precision=10)
    Asserts an array of complex numbers.
    Definition quadratic_equations_complex_numbers.cpp:100
    Here is the call graph for this function:
    @@ -348,7 +341,7 @@ Here is the call graph for this function:
    diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html index 8c083fc07..e77a2714a 100644 --- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html +++ b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: probability::geometric_dist::geometric_distribution Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,35 +108,35 @@ $(document).ready(function(){initNavTree('da/d19/classprobability_1_1geometric__

    A class to model the geometric distribution. - More...

    + More...

    - + - + - + - + - + - + - + - + - +

    Public Member Functions

     geometric_distribution (const float &p)
     geometric_distribution (const float &p)
     Constructor for the geometric distribution.
     
    float expected_value () const
    float expected_value () const
     The expected value of a geometrically distributed random variable X.
     
    float variance () const
    float variance () const
     The variance of a geometrically distributed random variable X.
     
    float standard_deviation () const
    float standard_deviation () const
     The standard deviation of a geometrically distributed random variable X.
     
    float probability_density (const uint32_t &k) const
    float probability_density (const uint32_t &k) const
     The probability density function.
     
    float cumulative_distribution (const uint32_t &k) const
    float cumulative_distribution (const uint32_t &k) const
     The cumulative distribution function.
     
    float inverse_cumulative_distribution (const float &cdf) const
    float inverse_cumulative_distribution (const float &cdf) const
     The inverse cumulative distribution function.
     
    uint32_t draw_sample () const
    uint32_t draw_sample () const
     Generates a (discrete) sample according to the geometrical distribution.
     
    float range_tries (const uint32_t &min_tries=1, const uint32_t &max_tries=std::numeric_limits< uint32_t >::max()) const
    float range_tries (const uint32_t &min_tries=1, const uint32_t &max_tries=std::numeric_limits< uint32_t >::max()) const
     This function computes the probability to have success in a given range of tries.
     
    @@ -160,8 +162,7 @@ float  - - +
    p
    probability::geometric_dist::geometric_distribution::geometric_distribution (const float & p)const float & p)
    @@ -179,8 +180,8 @@ float p -
    64: p(p) {}
    -
    probability::geometric_dist::geometric_distribution::p
    float p
    The succes probability p.
    Definition geometric_dist.cpp:57
    +
    64: p(p) {}
    +
    probability::geometric_dist::geometric_distribution::p
    float p
    The succes probability p.
    Definition geometric_dist.cpp:57
    @@ -197,8 +198,7 @@ float p float probability::geometric_dist::geometric_distribution::cumulative_distribution ( - const uint32_t &  - k) + const uint32_t & k) const @@ -218,7 +218,7 @@ float p
    Returns
    The probability to have success within k trials
    104 {
    -
    105 return 1.0f - std::pow((1.0f - p), static_cast<float>(k));
    +
    105 return 1.0f - std::pow((1.0f - p), static_cast<float>(k));
    106 }
    std::pow
    T pow(T... args)
    @@ -241,7 +241,7 @@ Here is the call graph for this function:
    uint32_t probability::geometric_dist::geometric_distribution::draw_sample ( - ) + ) const @@ -257,10 +257,10 @@ Here is the call graph for this function:
    125 {
    126 float uniform_sample = generate_uniform();
    127 return static_cast<uint32_t>(
    -
    128 inverse_cumulative_distribution(uniform_sample)) +
    +
    128 inverse_cumulative_distribution(uniform_sample)) +
    129 1;
    130 }
    -
    probability::geometric_dist::geometric_distribution::inverse_cumulative_distribution
    float inverse_cumulative_distribution(const float &cdf) const
    The inverse cumulative distribution function.
    Definition geometric_dist.cpp:116
    +
    probability::geometric_dist::geometric_distribution::inverse_cumulative_distribution
    float inverse_cumulative_distribution(const float &cdf) const
    The inverse cumulative distribution function.
    Definition geometric_dist.cpp:116
    probability::geometric_dist::generate_uniform
    float generate_uniform()
    Returns a random number between [0,1].
    Definition geometric_dist.cpp:48
    Here is the call graph for this function:
    @@ -282,7 +282,7 @@ Here is the call graph for this function: float probability::geometric_dist::geometric_distribution::expected_value ( - ) + ) const @@ -295,7 +295,7 @@ Here is the call graph for this function:

    The expected value of a geometrically distributed random variable X.

    Returns
    E[X] = 1/p
    -
    71{ return 1.0f / p; }
    +
    71{ return 1.0f / p; }
    @@ -311,8 +311,7 @@ Here is the call graph for this function: float probability::geometric_dist::geometric_distribution::inverse_cumulative_distribution ( - const float &  - cdf) + const float & cdf) const @@ -332,7 +331,7 @@ Here is the call graph for this function:
    Returns
    The number of (exact) trials.
    116 {
    -
    117 return std::log(1.0f - cdf) / std::log(1.0f - p);
    +
    117 return std::log(1.0f - cdf) / std::log(1.0f - p);
    118 }
    std::log
    T log(T... args)
    @@ -355,8 +354,7 @@ Here is the call graph for this function:
    float probability::geometric_dist::geometric_distribution::probability_density ( - const uint32_t &  - k) + const uint32_t & k) const @@ -376,7 +374,7 @@ Here is the call graph for this function:
    Returns
    A number between [0,1] according to p * (1-p)^{k-1}
    93 {
    -
    94 return std::pow((1.0f - p), static_cast<float>(k - 1)) * p;
    +
    94 return std::pow((1.0f - p), static_cast<float>(k - 1)) * p;
    95 }
    Here is the call graph for this function:
    @@ -398,19 +396,12 @@ Here is the call graph for this function: float probability::geometric_dist::geometric_distribution::range_tries ( - const uint32_t &  - min_tries = 1, + const uint32_t & min_tries = 1, - const uint32_t &  - max_tries = std::numeric_limits<uint32_t>::max()  - - - - ) - const + const uint32_t & max_tries = std::numeric_limits<uint32_t>::max() ) const @@ -430,13 +421,13 @@ Here is the call graph for this function:
    Returns
    The probability of having success within a range of tries [min_tries, max_tries]
    147 {
    -
    148 float cdf_lower = cumulative_distribution(min_tries - 1);
    +
    148 float cdf_lower = cumulative_distribution(min_tries - 1);
    149 float cdf_upper = max_tries == std::numeric_limits<uint32_t>::max()
    150 ? 1.0f
    -
    151 : cumulative_distribution(max_tries);
    +
    151 : cumulative_distribution(max_tries);
    152 return cdf_upper - cdf_lower;
    153 }
    -
    probability::geometric_dist::geometric_distribution::cumulative_distribution
    float cumulative_distribution(const uint32_t &k) const
    The cumulative distribution function.
    Definition geometric_dist.cpp:104
    +
    probability::geometric_dist::geometric_distribution::cumulative_distribution
    float cumulative_distribution(const uint32_t &k) const
    The cumulative distribution function.
    Definition geometric_dist.cpp:104
    std::numeric_limits::max
    T max(T... args)
    Here is the call graph for this function:
    @@ -458,7 +449,7 @@ Here is the call graph for this function: float probability::geometric_dist::geometric_distribution::standard_deviation ( - ) + ) const @@ -471,8 +462,8 @@ Here is the call graph for this function:

    The standard deviation of a geometrically distributed random variable X.

    Returns
    \sigma = \sqrt{V[X]}
    -
    84{ return std::sqrt(variance()); }
    -
    probability::geometric_dist::geometric_distribution::variance
    float variance() const
    The variance of a geometrically distributed random variable X.
    Definition geometric_dist.cpp:77
    +
    84{ return std::sqrt(variance()); }
    +
    probability::geometric_dist::geometric_distribution::variance
    float variance() const
    The variance of a geometrically distributed random variable X.
    Definition geometric_dist.cpp:77
    std::sqrt
    T sqrt(T... args)
    Here is the call graph for this function:
    @@ -494,7 +485,7 @@ Here is the call graph for this function:
    float probability::geometric_dist::geometric_distribution::variance ( - ) + ) const @@ -507,7 +498,7 @@ Here is the call graph for this function:

    The variance of a geometrically distributed random variable X.

    Returns
    V[X] = (1 - p) / p^2
    -
    77{ return (1.0f - p) / (p * p); }
    +
    77{ return (1.0f - p) / (p * p); }
    @@ -520,7 +511,7 @@ Here is the call graph for this function: diff --git a/da/d23/eulers__totient__function_8cpp.html b/da/d23/eulers__totient__function_8cpp.html index 22c86a8b4..b2d767d7f 100644 --- a/da/d23/eulers__totient__function_8cpp.html +++ b/da/d23/eulers__totient__function_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/eulers_totient_function.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -125,10 +127,10 @@ Functions uint64_t math::phiFunction (uint64_t n)  Function to calculate Euler's Totient.
      -static void test () +static void test ()  Self-test implementations.
      -int main (int argc, char *argv[]) +int main (int argc, char *argv[])  Main function.
      @@ -166,19 +168,12 @@ Some known values are:

      int main ( - int  - argc, + int argc, - char *  - argv[]  - - - - ) - + char * argv[] )
    @@ -193,10 +188,10 @@ Some known values are:

      Returns
      0 on exit
      75 {
      -
      76 test();
      +
      76 test();
      77 return 0;
      78}
      -
      test
      static void test()
      Self-test implementations.
      Definition eulers_totient_function.cpp:57
      +
      test
      static void test()
      Self-test implementations.
      Definition eulers_totient_function.cpp:57
      Here is the call graph for this function:
      @@ -217,7 +212,7 @@ Here is the call graph for this function:
      static void test ( - ) + ) @@ -257,7 +252,7 @@ Here is the call graph for this function:
    diff --git a/da/d24/sqrt__double_8cpp.html b/da/d24/sqrt__double_8cpp.html index d73132660..4a8afc4bf 100644 --- a/da/d24/sqrt__double_8cpp.html +++ b/da/d24/sqrt__double_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/sqrt_double.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,9 +118,9 @@ Include dependency graph for sqrt_double.cpp:
    - + - +

    Functions

    double Sqrt (double a)
    double Sqrt (double a)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -135,8 +137,7 @@ N)\) time, with precision fixed using int main ( - void  - ) + void ) @@ -148,12 +149,12 @@ N)\) time, with precision fixed using 45 assert(n >= 0);
    46 // Change this line for a better precision
    47 std::cout.precision(12);
    -
    48 std::cout << std::fixed << Sqrt(n);
    +
    48 std::cout << std::fixed << Sqrt(n);
    49}
    std::fixed
    T fixed(T... args)
    -
    Sqrt
    double Sqrt(double a)
    Definition sqrt_double.cpp:16
    +
    Sqrt
    double Sqrt(double a)
    Definition sqrt_double.cpp:16
    Here is the call graph for this function:
    @@ -171,8 +172,7 @@ Here is the call graph for this function:
    double Sqrt ( - double  - a) + double a) @@ -180,7 +180,7 @@ Here is the call graph for this function:

    Bisection method implemented for the function \(x^2-a=0\) whose roots are \(\pm\sqrt{a}\) and only the positive root is returned.

    16 {
    17 if (a > 0 && a < 1) {
    -
    18 return 1 / Sqrt(1 / a);
    +
    18 return 1 / Sqrt(1 / a);
    19 }
    20 double l = 0, r = a;
    21 /* Epsilon is the precision.
    @@ -217,7 +217,7 @@ Here is the call graph for this function:
    diff --git a/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html b/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html index ce05c4051..02d165046 100644 --- a/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html +++ b/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures::sparse_table::Sparse_table Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ Collaboration diagram for data_structures::sparse_table::Sparse_table:
    - +

    Public Member Functions

    int64_t query (int64_t l, int64_t r)
    int64_t query (int64_t l, int64_t r)
     Queries the sparse table for the value of the interval [l, r] (i.e. from l to r inclusive).
     
    @@ -122,13 +124,13 @@ Public Attributes size_t  - + - + - +
    n = 0
     size of input array.
     
    std::array< int64_t, N > A = {}
    std::array< int64_t, N > A = {}
     input array to perform RMQ.
     
    std::array< std::array< int64_t, N >, M > ST {}
    std::array< std::array< int64_t, N >, M > ST {}
     the sparse table storing min() values for given interval.
     
    std::array< int64_t, N > LOG = {}
    std::array< int64_t, N > LOG = {}
     where floor(log2(i)) are precomputed.
     
    @@ -145,19 +147,12 @@ size_t n = 0 int64_t data_structures::sparse_table::Sparse_table::query ( - int64_t  - l, + int64_t l, - int64_t  - r  - - - - ) - + int64_t r ) @@ -181,21 +176,21 @@ size_t n = 0

    < represents minimum value over the range [g, r - pow(2,g) + 1]

    < represents minimum value over the whole range [l,r]

    109 {
    -
    110 int64_t g = LOG[r - l + 1]; ///< smallest power of 2 covering [l,r]
    -
    111 int64_t x = ST[g][l]; ///< represents minimum value over the range
    +
    110 int64_t g = LOG[r - l + 1]; ///< smallest power of 2 covering [l,r]
    +
    111 int64_t x = ST[g][l]; ///< represents minimum value over the range
    112 ///< [g,l]
    113 int64_t y =
    -
    114 ST[g][r - (1 << g) + 1]; ///< represents minimum value over the
    +
    114 ST[g][r - (1 << g) + 1]; ///< represents minimum value over the
    115 ///< range [g, r - pow(2,g) + 1]
    116
    -
    117 return (A[x] <= A[y] ? x : y); ///< represents minimum value over
    +
    117 return (A[x] <= A[y] ? x : y); ///< represents minimum value over
    118 ///< the whole range [l,r]
    119 }
    numerical_methods::simpson_method::g
    double g(double x)
    Another test function.
    Definition composite_simpson_rule.cpp:115
    numerical_methods::simpson_method::l
    double l(double x)
    Another test function.
    Definition composite_simpson_rule.cpp:119
    -
    data_structures::sparse_table::Sparse_table::LOG
    std::array< int64_t, N > LOG
    where floor(log2(i)) are precomputed.
    Definition sparse_table.cpp:59
    -
    data_structures::sparse_table::Sparse_table::A
    std::array< int64_t, N > A
    input array to perform RMQ.
    Definition sparse_table.cpp:56
    -
    data_structures::sparse_table::Sparse_table::ST
    std::array< std::array< int64_t, N >, M > ST
    the sparse table storing min() values for given interval.
    Definition sparse_table.cpp:58
    +
    data_structures::sparse_table::Sparse_table::LOG
    std::array< int64_t, N > LOG
    where floor(log2(i)) are precomputed.
    Definition sparse_table.cpp:59
    +
    data_structures::sparse_table::Sparse_table::A
    std::array< int64_t, N > A
    input array to perform RMQ.
    Definition sparse_table.cpp:56
    +
    data_structures::sparse_table::Sparse_table::ST
    std::array< std::array< int64_t, N >, M > ST
    the sparse table storing min() values for given interval.
    Definition sparse_table.cpp:58
    @@ -261,7 +256,7 @@ size_t n = 0 diff --git a/da/d39/volume_8cpp.html b/da/d39/volume_8cpp.html index 8c46ccf6d..331730b84 100644 --- a/da/d39/volume_8cpp.html +++ b/da/d39/volume_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/volume.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -129,19 +131,19 @@ Functions  The volume of a cube
      template<typename T > -T math::rect_prism_volume (T length, T width, T height) +T math::rect_prism_volume (T length, T width, T height)  The volume of a rectangular prism.
      template<typename T > -T math::cone_volume (T radius, T height, double PI=3.14) +T math::cone_volume (T radius, T height, double PI=3.14)  The volume of a cone
      template<typename T > -T math::triangle_prism_volume (T base, T height, T depth) +T math::triangle_prism_volume (T base, T height, T depth)  The volume of a triangular prism.
      template<typename T > -T math::pyramid_volume (T length, T width, T height) +T math::pyramid_volume (T length, T width, T height)  The volume of a pyramid
      template<typename T > @@ -149,13 +151,13 @@ Functions  The volume of a sphere
      template<typename T > -T math::cylinder_volume (T radius, T height, double PI=3.14) +T math::cylinder_volume (T radius, T height, double PI=3.14)  The volume of a cylinder
      -static void test () +static void test ()  Self-test implementations.
      -int main () +int main ()  Main function.
      @@ -173,8 +175,7 @@ Functions int main ( - void  - ) + void ) @@ -183,14 +184,14 @@ Functions

    Main function.

    Returns
    0 on exit
    235 {
    -
    236 test(); // run self-test implementations
    +
    236 test(); // run self-test implementations
    237 return 0;
    238}
    -
    test
    static void test()
    Self-test implementations.
    Definition volume.cpp:112
    +
    test
    static void test()
    Self-test implementations.
    Definition volume.cpp:112
    Here is the call graph for this function:
    -
    +
    @@ -207,7 +208,7 @@ Here is the call graph for this function: static void test ( - ) + ) @@ -350,7 +351,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -361,7 +362,7 @@ Here is the call graph for this function: diff --git a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map index f393b2dcf..08ddecb29 100644 --- a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map +++ b/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -1,24 +1,33 @@ - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 index 88b27b54f..0fef6ee3b 100644 --- a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 +++ b/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -1 +1 @@ -2dff8a46e90bc7792fd9c5d6263dd9d4 \ No newline at end of file +a2042f44422579dc6741441ab872465c \ No newline at end of file diff --git a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 32d12c05b..18cf8754d 100644 --- a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -4,8 +4,8 @@ - + - + test Node1 - -test + +test @@ -31,8 +31,8 @@ Node2 - -math::cone_volume + +math::cone_volume @@ -40,71 +40,35 @@ Node1->Node2 - - - - - - - -Node4 - - -math::cube_volume - - - - - -Node1->Node4 - - - - - - - - -Node5 - - -math::cylinder_volume - - - - - -Node1->Node5 - - - + + Node6 - - -std::endl + + +math::cube_volume - + Node1->Node6 - - - + + + Node7 - - -math::pyramid_volume + + +math::cylinder_volume @@ -112,72 +76,108 @@ Node1->Node7 - - + + Node8 - - -math::rect_prism_volume + + +std::endl - + Node1->Node8 - - - + + + Node9 - - -math::sphere_volume + + +math::pyramid_volume - + Node1->Node9 - - - + + + Node10 - - -math::triangle_prism -_volume + + +math::rect_prism_volume - + Node1->Node10 - - - + + + + + + + + +Node11 + + +math::sphere_volume + + + + + +Node1->Node11 + + + + + + + + +Node12 + + +math::triangle_prism +_volume + + + + + +Node1->Node12 + + + Node3 - - -std::pow + + +height @@ -185,35 +185,116 @@ Node2->Node3 - - + + - - -Node4->Node3 - - - + + +Node5 + + +std::pow - - -Node5->Node3 - - - + + +Node2->Node5 + + + + + + + + +Node3->Node3 + + + + + + + + +Node4 + + +std::max + + + + + +Node3->Node4 + + + + + + + + +Node6->Node5 + + + + + + + + +Node7->Node3 + + + + + + + + +Node7->Node5 + + + - + Node9->Node3 - - - + + + + + + + + +Node10->Node3 + + + + + + + + +Node11->Node5 + + + + + + + + +Node12->Node3 + + + diff --git a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index 25207c3dd..48b919013 100644 --- a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + test Node1 - -test + +test @@ -21,8 +21,8 @@ Node2 - -math::cone_volume + +math::cone_volume @@ -30,71 +30,35 @@ Node1->Node2 - - - - - - - -Node4 - - -math::cube_volume - - - - - -Node1->Node4 - - - - - - - - -Node5 - - -math::cylinder_volume - - - - - -Node1->Node5 - - - + + Node6 - - -std::endl + + +math::cube_volume - + Node1->Node6 - - - + + + Node7 - - -math::pyramid_volume + + +math::cylinder_volume @@ -102,72 +66,108 @@ Node1->Node7 - - + + Node8 - - -math::rect_prism_volume + + +std::endl - + Node1->Node8 - - - + + + Node9 - - -math::sphere_volume + + +math::pyramid_volume - + Node1->Node9 - - - + + + Node10 - - -math::triangle_prism -_volume + + +math::rect_prism_volume - + Node1->Node10 - - - + + + + + + + + +Node11 + + +math::sphere_volume + + + + + +Node1->Node11 + + + + + + + + +Node12 + + +math::triangle_prism +_volume + + + + + +Node1->Node12 + + + Node3 - - -std::pow + + +height @@ -175,35 +175,116 @@ Node2->Node3 - - + + - - -Node4->Node3 - - - + + +Node5 + + +std::pow - - -Node5->Node3 - - - + + +Node2->Node5 + + + + + + + + +Node3->Node3 + + + + + + + + +Node4 + + +std::max + + + + + +Node3->Node4 + + + + + + + + +Node6->Node5 + + + + + + + + +Node7->Node3 + + + + + + + + +Node7->Node5 + + + - + Node9->Node3 - - - + + + + + + + + +Node10->Node3 + + + + + + + + +Node11->Node5 + + + + + + + + +Node12->Node3 + + + diff --git a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 6b2b7087a..722fa8778 100644 --- a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,26 +1,35 @@ - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index f4e2b2958..ed37e25d6 100644 --- a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -3e11eabc0642f070195c5ca8e878cbee \ No newline at end of file +61f18d2a4263c96e3cb9bdb9e010288d \ No newline at end of file diff --git a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index c6b2a6483..8c048f6e8 100644 --- a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,8 +4,8 @@ - + - + main Node1 - -main + +main @@ -31,8 +31,8 @@ Node2 - -test + +test @@ -40,8 +40,8 @@ Node1->Node2 - - + + @@ -49,8 +49,8 @@ Node3 - -math::cone_volume + +math::cone_volume @@ -58,71 +58,35 @@ Node2->Node3 - - - - - - - -Node5 - - -math::cube_volume - - - - - -Node2->Node5 - - - - - - - - -Node6 - - -math::cylinder_volume - - - - - -Node2->Node6 - - - + + Node7 - - -std::endl + + +math::cube_volume - + Node2->Node7 - - - + + + Node8 - - -math::pyramid_volume + + +math::cylinder_volume @@ -130,72 +94,108 @@ Node2->Node8 - - + + Node9 - - -math::rect_prism_volume + + +std::endl - + Node2->Node9 - - - + + + Node10 - - -math::sphere_volume + + +math::pyramid_volume - + Node2->Node10 - - - + + + Node11 - - -math::triangle_prism -_volume + + +math::rect_prism_volume - + Node2->Node11 - - - + + + + + + + + +Node12 + + +math::sphere_volume + + + + + +Node2->Node12 + + + + + + + + +Node13 + + +math::triangle_prism +_volume + + + + + +Node2->Node13 + + + Node4 - - -std::pow + + +height @@ -203,35 +203,116 @@ Node3->Node4 - - + + - - -Node5->Node4 - - - + + +Node6 + + +std::pow - - -Node6->Node4 - - - + + +Node3->Node6 + + + + + + + + +Node4->Node4 + + + + + + + + +Node5 + + +std::max + + + + + +Node4->Node5 + + + + + + + + +Node7->Node6 + + + + + + + + +Node8->Node4 + + + + + + + + +Node8->Node6 + + + - + Node10->Node4 - - - + + + + + + + + +Node11->Node4 + + + + + + + + +Node12->Node6 + + + + + + + + +Node13->Node4 + + + diff --git a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 81765aa81..e8a119b93 100644 --- a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + main Node1 - -main + +main @@ -21,8 +21,8 @@ Node2 - -test + +test @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -39,8 +39,8 @@ Node3 - -math::cone_volume + +math::cone_volume @@ -48,71 +48,35 @@ Node2->Node3 - - - - - - - -Node5 - - -math::cube_volume - - - - - -Node2->Node5 - - - - - - - - -Node6 - - -math::cylinder_volume - - - - - -Node2->Node6 - - - + + Node7 - - -std::endl + + +math::cube_volume - + Node2->Node7 - - - + + + Node8 - - -math::pyramid_volume + + +math::cylinder_volume @@ -120,72 +84,108 @@ Node2->Node8 - - + + Node9 - - -math::rect_prism_volume + + +std::endl - + Node2->Node9 - - - + + + Node10 - - -math::sphere_volume + + +math::pyramid_volume - + Node2->Node10 - - - + + + Node11 - - -math::triangle_prism -_volume + + +math::rect_prism_volume - + Node2->Node11 - - - + + + + + + + + +Node12 + + +math::sphere_volume + + + + + +Node2->Node12 + + + + + + + + +Node13 + + +math::triangle_prism +_volume + + + + + +Node2->Node13 + + + Node4 - - -std::pow + + +height @@ -193,35 +193,116 @@ Node3->Node4 - - + + - - -Node5->Node4 - - - + + +Node6 + + +std::pow - - -Node6->Node4 - - - + + +Node3->Node6 + + + + + + + + +Node4->Node4 + + + + + + + + +Node5 + + +std::max + + + + + +Node4->Node5 + + + + + + + + +Node7->Node6 + + + + + + + + +Node8->Node4 + + + + + + + + +Node8->Node6 + + + - + Node10->Node4 - - - + + + + + + + + +Node11->Node4 + + + + + + + + +Node12->Node6 + + + + + + + + +Node13->Node4 + + + diff --git a/da/d41/uint128__t_8hpp.html b/da/d41/uint128__t_8hpp.html index 5bf80ffc4..0dc83eeed 100644 --- a/da/d41/uint128__t_8hpp.html +++ b/da/d41/uint128__t_8hpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ciphers/uint128_t.hpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -135,62 +137,62 @@ Classes - +

    Macros

    #define CIPHERS_UINT128_T_HPP_
    #define CIPHERS_UINT128_T_HPP_
     for std::pair library
     
    - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - +

    Functions

    std::string add (const std::string &first, const std::string &second)
    std::string add (const std::string &first, const std::string &second)
     Adding two string.
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator+ (const T &p, const uint128_t &q)
    uint128_t operator+ (const T &p, const uint128_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator- (const T p, const uint128_t &q)
    uint128_t operator- (const T p, const uint128_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator* (const T p, const uint128_t &q)
    uint128_t operator* (const T p, const uint128_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator/ (const T p, const uint128_t &q)
    uint128_t operator/ (const T p, const uint128_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator% (const T p, const uint128_t &q)
    uint128_t operator% (const T p, const uint128_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator& (const T &p, const uint128_t &q)
    uint128_t operator& (const T &p, const uint128_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator| (const T p, const uint128_t &q)
    uint128_t operator| (const T p, const uint128_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator^ (const T p, const uint128_t &q)
    uint128_t operator^ (const T p, const uint128_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator&& (const T p, const uint128_t &q)
    bool operator&& (const T p, const uint128_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator|| (const T p, const uint128_t &q)
    bool operator|| (const T p, const uint128_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator== (const T p, const uint128_t &q)
    bool operator== (const T p, const uint128_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator!= (const T p, const uint128_t &q)
    bool operator!= (const T p, const uint128_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator< (const T p, const uint128_t &q)
    bool operator< (const T p, const uint128_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator<= (const T p, const uint128_t &q)
    bool operator<= (const T p, const uint128_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator> (const T p, const uint128_t &q)
    bool operator> (const T p, const uint128_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator>= (const T p, const uint128_t &q)
    bool operator>= (const T p, const uint128_t &q)
     

    Detailed Description

    @@ -224,19 +226,12 @@ Functions std::string add ( - const std::string &  - first, + const std::string & first, - const std::string &  - second  - - - - ) - + const std::string & second )
    @@ -297,19 +292,12 @@ template<typename T , typename = typename std::enable_if< bool operator!= ( - const T  - p, + const T p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -339,19 +327,12 @@ template<typename T , typename = typename std::enable_if< uint128_t operator% ( - const T  - p, + const T p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -380,19 +361,12 @@ template<typename T , typename = typename std::enable_if< uint128_t operator& ( - const T &  - p, + const T & p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -421,19 +395,12 @@ template<typename T , typename = typename std::enable_if< bool operator&& ( - const T  - p, + const T p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -462,19 +429,12 @@ template<typename T , typename = typename std::enable_if< uint128_t operator* ( - const T  - p, + const T p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -503,19 +463,12 @@ template<typename T , typename = typename std::enable_if< uint128_t operator+ ( - const T &  - p, + const T & p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -544,19 +497,12 @@ template<typename T , typename = typename std::enable_if< uint128_t operator- ( - const T  - p, + const T p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -585,19 +531,12 @@ template<typename T , typename = typename std::enable_if< uint128_t operator/ ( - const T  - p, + const T p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -626,19 +565,12 @@ template<typename T , typename = typename std::enable_if< bool operator< ( - const T  - p, + const T p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -667,19 +599,12 @@ template<typename T , typename = typename std::enable_if< bool operator<= ( - const T  - p, + const T p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -708,19 +633,12 @@ template<typename T , typename = typename std::enable_if< bool operator== ( - const T  - p, + const T p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -749,19 +667,12 @@ template<typename T , typename = typename std::enable_if< bool operator> ( - const T  - p, + const T p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -790,19 +701,12 @@ template<typename T , typename = typename std::enable_if< bool operator>= ( - const T  - p, + const T p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -831,19 +735,12 @@ template<typename T , typename = typename std::enable_if< uint128_t operator^ ( - const T  - p, + const T p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -872,19 +769,12 @@ template<typename T , typename = typename std::enable_if< uint128_t operator| ( - const T  - p, + const T p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -913,19 +803,12 @@ template<typename T , typename = typename std::enable_if< bool operator|| ( - const T  - p, + const T p, - const uint128_t &  - q  - - - - ) - + const uint128_t & q ) @@ -946,7 +829,7 @@ template<typename T , typename = typename std::enable_if< diff --git a/da/d41/uint128__t_8hpp_source.html b/da/d41/uint128__t_8hpp_source.html index 40703ae62..c862f07f1 100644 --- a/da/d41/uint128__t_8hpp_source.html +++ b/da/d41/uint128__t_8hpp_source.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ciphers/uint128_t.hpp Source File + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -76,7 +78,7 @@ $(document).ready(function() { init_codefold(1); });
    @@ -1440,7 +1442,7 @@ $(document).ready(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','. diff --git a/da/d4b/depth__first__search__with__stack_8cpp.html b/da/d4b/depth__first__search__with__stack_8cpp.html index c7156ab0e..c13f4faba 100644 --- a/da/d4b/depth__first__search__with__stack_8cpp.html +++ b/da/d4b/depth__first__search__with__stack_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph/depth_first_search_with_stack.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -129,21 +131,21 @@ Namespaces - + - + - + - +

    Functions

    void graph::depth_first_search::addEdge (std::vector< std::vector< size_t > > *adj, size_t u, size_t v)
    void graph::depth_first_search::addEdge (std::vector< std::vector< size_t > > *adj, size_t u, size_t v)
     Adds and edge between two vertices of graph say u and v in this case.
     
    std::vector< size_t > graph::depth_first_search::dfs (const std::vector< std::vector< size_t > > &graph, size_t start)
    std::vector< size_t > graph::depth_first_search::dfs (const std::vector< std::vector< size_t > > &graph, size_t start)
     Explores the given vertex, exploring a vertex means traversing over all the vertices which are connected to the vertex that is currently being explored and push it onto the stack.
     
    static void tests ()
    static void tests ()
     
    int main ()
    int main ()
     Main function.
     
    - + @@ -191,25 +193,17 @@ constexpr int64_t  - - + - - + - - - - - - - +

    Variables

    constexpr int WHITE = 0
    constexpr int WHITE = 0
     
    constexpr int GREY = 1
    INF
    void graph::depth_first_search::addEdge (std::vector< std::vector< size_t > > * adj, std::vector< std::vector< size_t > > * adj,
    size_t u, size_t u,
    size_t v 
    )size_t v )
    @@ -245,19 +239,12 @@ constexpr int64_t INF std::vector< size_t > graph::depth_first_search::dfs ( - const std::vector< std::vector< size_t > > &  - graph, + const std::vector< std::vector< size_t > > & graph, - size_t  - start  - - - - ) - + size_t start )
    @@ -278,9 +265,9 @@ constexpr int64_t INF

    Node has been explored

    87 {
    88 /// checked[i] stores the status of each node
    -
    89 std::vector<size_t> checked(graph.size(), WHITE), traversed_path;
    +
    89 std::vector<size_t> checked(graph.size(), WHITE), traversed_path;
    90
    -
    91 checked[start] = GREY;
    +
    91 checked[start] = GREY;
    92 std::stack<size_t> stack;
    93 stack.push(start);
    94
    @@ -289,18 +276,18 @@ constexpr int64_t INF
    97 int act = stack.top();
    98 stack.pop();
    99
    -
    100 if (checked[act] == GREY) {
    +
    100 if (checked[act] == GREY) {
    101 /// push the node to the final result vector
    102 traversed_path.push_back(act + 1);
    103
    104 /// exploring the neighbours of the current node
    105 for (auto it : graph[act]) {
    106 stack.push(it);
    -
    107 if (checked[it] != BLACK) {
    -
    108 checked[it] = GREY;
    +
    107 if (checked[it] != BLACK) {
    +
    108 checked[it] = GREY;
    109 }
    110 }
    -
    111 checked[act] = BLACK; /// Node has been explored
    +
    111 checked[act] = BLACK; /// Node has been explored
    112 }
    113 }
    114 return traversed_path;
    @@ -309,9 +296,9 @@ constexpr int64_t INF
    stack::pop
    void pop()
    Definition stack.hpp:62
    stack::push
    void push(const value_type &item)
    Definition stack.hpp:47
    stack::top
    value_type top() const
    Definition stack.hpp:56
    -
    GREY
    constexpr int GREY
    indicates the node hasn't been explored
    Definition depth_first_search_with_stack.cpp:39
    -
    BLACK
    constexpr int BLACK
    indicates node is in stack waiting to be explored
    Definition depth_first_search_with_stack.cpp:40
    -
    WHITE
    constexpr int WHITE
    Definition depth_first_search_with_stack.cpp:38
    +
    GREY
    constexpr int GREY
    indicates the node hasn't been explored
    Definition depth_first_search_with_stack.cpp:39
    +
    BLACK
    constexpr int BLACK
    indicates node is in stack waiting to be explored
    Definition depth_first_search_with_stack.cpp:40
    +
    WHITE
    constexpr int WHITE
    Definition depth_first_search_with_stack.cpp:38
    graph
    Graph Algorithms.
    std::vector::push_back
    T push_back(T... args)
    @@ -333,8 +320,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -347,7 +333,7 @@ Here is the call graph for this function:

    taking input for the starting position

    Printing the order of traversal

    173 {
    -
    174 tests(); // execute the tests
    +
    174 tests(); // execute the tests
    175
    176 size_t vertices = 0, edges = 0, start_pos = 1;
    177 std::vector<size_t> traversal;
    @@ -365,14 +351,14 @@ Here is the call graph for this function:
    189 while (edges--) {
    190 size_t u = 0, v = 0;
    191 std::cin >> u >> v;
    -
    192 graph::depth_first_search::addEdge(&adj, u, v);
    +
    192 graph::depth_first_search::addEdge(&adj, u, v);
    193 }
    194
    195 /// taking input for the starting position
    196 std::cout << "Enter the starting vertex [1,n]: " << std::endl;
    197 std::cin >> start_pos;
    198 start_pos -= 1;
    -
    199 traversal = graph::depth_first_search::dfs(adj, start_pos);
    +
    199 traversal = graph::depth_first_search::dfs(adj, start_pos);
    200
    201 /// Printing the order of traversal
    202 for (auto x : traversal) {
    @@ -383,9 +369,9 @@ Here is the call graph for this function:
    207}
    -
    tests
    static void tests()
    Definition depth_first_search_with_stack.cpp:123
    -
    graph::depth_first_search::dfs
    std::vector< size_t > dfs(const std::vector< std::vector< size_t > > &graph, size_t start)
    Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec...
    Definition depth_first_search_with_stack.cpp:87
    -
    graph::depth_first_search::addEdge
    void addEdge(std::vector< std::vector< size_t > > *adj, size_t u, size_t v)
    Adds and edge between two vertices of graph say u and v in this case.
    Definition depth_first_search_with_stack.cpp:64
    +
    tests
    static void tests()
    Definition depth_first_search_with_stack.cpp:123
    +
    graph::depth_first_search::dfs
    std::vector< size_t > dfs(const std::vector< std::vector< size_t > > &graph, size_t start)
    Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec...
    Definition depth_first_search_with_stack.cpp:87
    +
    graph::depth_first_search::addEdge
    void addEdge(std::vector< std::vector< size_t > > *adj, size_t u, size_t v)
    Adds and edge between two vertices of graph say u and v in this case.
    Definition depth_first_search_with_stack.cpp:64
    std::endl
    T endl(T... args)
    Here is the call graph for this function:
    @@ -407,7 +393,7 @@ Here is the call graph for this function: static void tests ( - ) + ) @@ -432,9 +418,9 @@ Here is the call graph for this function:
    128 start_pos = 1;
    129 std::vector<std::vector<size_t> > g1(3, std::vector<size_t>());
    130
    -
    131 graph::depth_first_search::addEdge(&g1, 1, 2);
    -
    132 graph::depth_first_search::addEdge(&g1, 2, 3);
    -
    133 graph::depth_first_search::addEdge(&g1, 3, 1);
    +
    131 graph::depth_first_search::addEdge(&g1, 1, 2);
    +
    132 graph::depth_first_search::addEdge(&g1, 2, 3);
    +
    133 graph::depth_first_search::addEdge(&g1, 3, 1);
    134
    135 std::vector<size_t> expected1 {1, 2, 3}; /// for the above sample data, this is the expected output
    136 assert(graph::depth_first_search::dfs(g1, start_pos - 1) == expected1);
    @@ -445,10 +431,10 @@ Here is the call graph for this function:
    141 start_pos = 1;
    142 std::vector<std::vector<size_t> > g2(4, std::vector<size_t>());
    143
    -
    144 graph::depth_first_search::addEdge(&g2, 1, 2);
    -
    145 graph::depth_first_search::addEdge(&g2, 1, 3);
    -
    146 graph::depth_first_search::addEdge(&g2, 2, 4);
    -
    147 graph::depth_first_search::addEdge(&g2, 4, 1);
    +
    144 graph::depth_first_search::addEdge(&g2, 1, 2);
    +
    145 graph::depth_first_search::addEdge(&g2, 1, 3);
    +
    146 graph::depth_first_search::addEdge(&g2, 2, 4);
    +
    147 graph::depth_first_search::addEdge(&g2, 4, 1);
    148
    149 std::vector<size_t> expected2 {1, 3, 2, 4}; /// for the above sample data, this is the expected output
    150 assert(graph::depth_first_search::dfs(g2, start_pos - 1) == expected2);
    @@ -459,10 +445,10 @@ Here is the call graph for this function:
    155 start_pos = 2;
    156 std::vector<std::vector<size_t> > g3(4, std::vector<size_t>());
    157
    -
    158 graph::depth_first_search::addEdge(&g3, 1, 2);
    -
    159 graph::depth_first_search::addEdge(&g3, 1, 3);
    -
    160 graph::depth_first_search::addEdge(&g3, 2, 4);
    -
    161 graph::depth_first_search::addEdge(&g3, 4, 1);
    +
    158 graph::depth_first_search::addEdge(&g3, 1, 2);
    +
    159 graph::depth_first_search::addEdge(&g3, 1, 3);
    +
    160 graph::depth_first_search::addEdge(&g3, 2, 4);
    +
    161 graph::depth_first_search::addEdge(&g3, 4, 1);
    162
    163 std::vector<size_t> expected3 {2, 4, 1, 3}; /// for the above sample data, this is the expected output
    164 assert(graph::depth_first_search::dfs(g3, start_pos - 1) == expected3);
    @@ -507,7 +493,7 @@ Here is the call graph for this function: diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html index 000896af4..f9ccc5aae 100644 --- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html +++ b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -125,13 +127,13 @@ Namespaces - + - + - +

    Functions

    uint64_t bit_manipulation::count_of_trailing_ciphers_in_factorial_n::numberOfCiphersInFactorialN (uint64_t n)
    uint64_t bit_manipulation::count_of_trailing_ciphers_in_factorial_n::numberOfCiphersInFactorialN (uint64_t n)
     Function to count the number of the trailing ciphers.
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -149,8 +151,7 @@ Functions int main ( - void  - ) + void ) @@ -159,10 +160,10 @@ Functions

    Main function.

    Returns
    0 on exit
    95 {
    -
    96 test(); // run self-test implementations
    +
    96 test(); // run self-test implementations
    97 return 0;
    98}
    -
    test
    static void test()
    Self-test implementations.
    Definition count_of_trailing_ciphers_in_factorial_n.cpp:59
    +
    test
    static void test()
    Self-test implementations.
    Definition count_of_trailing_ciphers_in_factorial_n.cpp:59
    Here is the call graph for this function:
    @@ -180,8 +181,7 @@ Here is the call graph for this function:
    uint64_t bit_manipulation::count_of_trailing_ciphers_in_factorial_n::numberOfCiphersInFactorialN ( - uint64_t  - n) + uint64_t n) @@ -227,7 +227,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -244,35 +244,35 @@ Here is the call graph for this function:
    60 // 1st test
    61 std::cout << "1st test ";
    62 assert(bit_manipulation::count_of_trailing_ciphers_in_factorial_n::
    -
    63 numberOfCiphersInFactorialN(395) == 97);
    +
    63 numberOfCiphersInFactorialN(395) == 97);
    64 std::cout << "passed" << std::endl;
    65
    66 // 2nd test
    67 std::cout << "2nd test ";
    68 assert(bit_manipulation::count_of_trailing_ciphers_in_factorial_n::
    -
    69 numberOfCiphersInFactorialN(977) == 242);
    +
    69 numberOfCiphersInFactorialN(977) == 242);
    70 std::cout << "passed" << std::endl;
    71
    72 // 3rd test
    73 std::cout << "3rd test ";
    74 assert(bit_manipulation::count_of_trailing_ciphers_in_factorial_n::
    -
    75 numberOfCiphersInFactorialN(871) == 215);
    +
    75 numberOfCiphersInFactorialN(871) == 215);
    76 std::cout << "passed" << std::endl;
    77
    78 // 4th test
    79 std::cout << "4th test ";
    80 assert(bit_manipulation::count_of_trailing_ciphers_in_factorial_n::
    -
    81 numberOfCiphersInFactorialN(239) == 57);
    +
    81 numberOfCiphersInFactorialN(239) == 57);
    82 std::cout << "passed" << std::endl;
    83
    84 // 5th test
    85 std::cout << "5th test ";
    86 assert(bit_manipulation::count_of_trailing_ciphers_in_factorial_n::
    -
    87 numberOfCiphersInFactorialN(0) == 0);
    +
    87 numberOfCiphersInFactorialN(0) == 0);
    88 std::cout << "passed" << std::endl;
    89}
    -
    bit_manipulation::count_of_trailing_ciphers_in_factorial_n::numberOfCiphersInFactorialN
    uint64_t numberOfCiphersInFactorialN(uint64_t n)
    Function to count the number of the trailing ciphers.
    Definition count_of_trailing_ciphers_in_factorial_n.cpp:40
    +
    bit_manipulation::count_of_trailing_ciphers_in_factorial_n::numberOfCiphersInFactorialN
    uint64_t numberOfCiphersInFactorialN(uint64_t n)
    Function to count the number of the trailing ciphers.
    Definition count_of_trailing_ciphers_in_factorial_n.cpp:40
    std::endl
    T endl(T... args)
    Here is the call graph for this function:
    @@ -288,7 +288,7 @@ Here is the call graph for this function: diff --git a/da/d52/minimum__edit__distance_8cpp.html b/da/d52/minimum__edit__distance_8cpp.html index 150c926ce..04686b3f6 100644 --- a/da/d52/minimum__edit__distance_8cpp.html +++ b/da/d52/minimum__edit__distance_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/minimum_edit_distance.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,16 +128,16 @@ Namespaces - + - + - + - +

    Functions

    uint64_t dynamic_programming::minimum_edit_distance::min (uint64_t x, uint64_t y, uint64_t z)
    uint64_t dynamic_programming::minimum_edit_distance::min (uint64_t x, uint64_t y, uint64_t z)
     Takes input of the cost of three operations: Insert, Replace and Delete and return the minimum cost among them.
     
    uint64_t dynamic_programming::minimum_edit_distance::editDistDP (std::string str1, std::string str2, uint64_t m, uint64_t n)
    uint64_t dynamic_programming::minimum_edit_distance::editDistDP (std::string str1, std::string str2, uint64_t m, uint64_t n)
     Calculates and stores the result of all the sub-problems, so that we don't have to recur to compute the minimum cost of a particular operation if it is already computed and stored in the dp vector.
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    int main (int argc, char *argv[])
    int main (int argc, char *argv[])
     main function
     
    @@ -159,31 +161,22 @@ Algorithm uint64_t dynamic_programming::minimum_edit_distance::editDistDP ( - std::string  - str1, + std::string str1, - std::string  - str2, + std::string str2, - uint64_t  - m, + uint64_t m, - uint64_t  - n  - - - - ) - + uint64_t n )
    @@ -262,19 +255,12 @@ Algorithm int main ( - int  - argc, + int argc, - char *  - argv[]  - - - - ) - + char * argv[] )
    @@ -289,10 +275,10 @@ Algorithm
    Returns
    0 on exit
    160 {
    -
    161 test(); // run self-test implementations
    +
    161 test(); // run self-test implementations
    162 return 0;
    163}
    -
    test
    static void test()
    Self-test implementations.
    Definition minimum_edit_distance.cpp:132
    +
    test
    static void test()
    Self-test implementations.
    Definition minimum_edit_distance.cpp:132
    Here is the call graph for this function:
    @@ -310,25 +296,17 @@ Here is the call graph for this function:
    uint64_t dynamic_programming::minimum_edit_distance::min ( - uint64_t  - x, + uint64_t x, - uint64_t  - y, + uint64_t y, - uint64_t  - z  - - - - ) - + uint64_t z )
    @@ -376,7 +354,7 @@ z if z is the minimum value static void test ( - ) + ) @@ -394,7 +372,7 @@ z if z is the minimum value
    134 std::string str1 = "INTENTION"; // Sample input of 1st string
    135 std::string str2 = "EXECUTION"; // Sample input of 2nd string
    136 uint64_t expected_output1 = 5; // Expected minimum cost
    -
    137 uint64_t output1 = dynamic_programming::minimum_edit_distance::editDistDP(
    +
    137 uint64_t output1 = dynamic_programming::minimum_edit_distance::editDistDP(
    138 str1, str2, str1.length(), str2.length()); // calling the editDistDP function and storing the result on output1
    139 assert(output1 == expected_output1); // comparing the output with the expected output
    140 std::cout << "Minimum Number of Operations Required: " << output1
    @@ -404,7 +382,7 @@ z if z is the minimum value
    144 std::string str3 = "SATURDAY";
    145 std::string str4 = "SUNDAY";
    146 uint64_t expected_output2 = 3;
    -
    147 uint64_t output2 = dynamic_programming::minimum_edit_distance::editDistDP(
    +
    147 uint64_t output2 = dynamic_programming::minimum_edit_distance::editDistDP(
    148 str3, str4, str3.length(), str4.length());
    149 assert(output2 == expected_output2);
    150 std::cout << "Minimum Number of Operations Required: " << output2
    @@ -413,7 +391,7 @@ z if z is the minimum value
    std::endl
    T endl(T... args)
    -
    dynamic_programming::minimum_edit_distance::editDistDP
    uint64_t editDistDP(std::string str1, std::string str2, uint64_t m, uint64_t n)
    Calculates and stores the result of all the sub-problems, so that we don't have to recur to compute t...
    Definition minimum_edit_distance.cpp:88
    +
    dynamic_programming::minimum_edit_distance::editDistDP
    uint64_t editDistDP(std::string str1, std::string str2, uint64_t m, uint64_t n)
    Calculates and stores the result of all the sub-problems, so that we don't have to recur to compute t...
    Definition minimum_edit_distance.cpp:88
    std::string::length
    T length(T... args)
    Here is the call graph for this function:
    @@ -429,7 +407,7 @@ Here is the call graph for this function: diff --git a/da/d5a/class_complex.html b/da/d5a/class_complex.html index 717f84525..b22dc16b6 100644 --- a/da/d5a/class_complex.html +++ b/da/d5a/class_complex.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Complex Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,44 +108,44 @@ $(document).ready(function(){initNavTree('da/d5a/class_complex.html','../../');

    Class Complex to represent complex numbers as a field. - More...

    + More...

    - + - + - + - + - + - + - + - + - + - + - + - +

    Public Member Functions

     Complex (double x=0.f, double y=0.f, bool is_polar=false)
     Complex (double x=0.f, double y=0.f, bool is_polar=false)
     Complex Constructor which initialises our complex number.
     
     Complex (const Complex &other)
     Complex (const Complex &other)
     Copy Constructor.
     
    double real () const
    double real () const
     Member function to get real value of our complex number. Member function (getter) to access the class' re value.
     
    double imag () const
    double imag () const
     Member function to get imaginary value of our complex number. Member function (getter) to access the class' im value.
     
    double abs () const
    double abs () const
     Member function to give the modulus of our complex number. Member function to which gives the absolute value (modulus) of our complex number.
     
    double arg () const
    double arg () const
     Member function to give the argument of our complex number.
     
    Complex operator+ (const Complex &other)
    Complex operator+ (const Complex &other)
     Operator overload of '+' on Complex class. Operator overload to be able to add two complex numbers.
     
    Complex operator- (const Complex &other)
    Complex operator- (const Complex &other)
     Operator overload of '-' on Complex class. Operator overload to be able to subtract two complex numbers.
     
    Complex operator* (const Complex &other)
    Complex operator* (const Complex &other)
     Operator overload of '*' on Complex class. Operator overload to be able to multiple two complex numbers.
     
    Complex operator~ () const
    Complex operator~ () const
     Operator overload of '~' on Complex class. Operator overload of the BITWISE NOT which gives us the conjugate of our complex number. NOTE: This is overloading the BITWISE operator but its not a BITWISE operation in this definition.
     
    Complex operator/ (const Complex &other)
    Complex operator/ (const Complex &other)
     Operator overload of '/' on Complex class. Operator overload to be able to divide two complex numbers. This function would throw an exception if the other number is zero.
     
    const Complex & operator= (const Complex &other)
    const Complex & operator= (const Complex &other)
     Operator overload of '=' on Complex class. Operator overload to be able to copy RHS instance of Complex to LHS instance of Complex.
     
    @@ -171,25 +173,17 @@ double  - - + - - + - - - - - - - +
    im
    Complex::Complex (double x = 0.f, double x = 0.f,
    double y = 0.f, double y = 0.f,
    bool is_polar = false 
    )bool is_polar = false )
    @@ -240,8 +234,7 @@ Here is the call graph for this function:
    Complex::Complex ( - const Complex &  - other) + const Complex & other) @@ -259,9 +252,9 @@ Here is the call graph for this function:
    -
    58: re(other.real()), im(other.imag()) {}
    -
    Complex::real
    double real() const
    Member function to get real value of our complex number. Member function (getter) to access the class...
    Definition complex_numbers.cpp:64
    -
    Complex::imag
    double imag() const
    Member function to get imaginary value of our complex number. Member function (getter) to access the ...
    Definition complex_numbers.cpp:70
    +
    58: re(other.real()), im(other.imag()) {}
    +
    Complex::real
    double real() const
    Member function to get real value of our complex number. Member function (getter) to access the class...
    Definition complex_numbers.cpp:64
    +
    Complex::imag
    double imag() const
    Member function to get imaginary value of our complex number. Member function (getter) to access the ...
    Definition complex_numbers.cpp:70
    @@ -278,7 +271,7 @@ Here is the call graph for this function: double Complex::abs ( - ) + ) const @@ -315,7 +308,7 @@ Here is the call graph for this function: double Complex::arg ( - ) + ) const @@ -350,7 +343,7 @@ Here is the call graph for this function: double Complex::imag ( - ) + ) const @@ -378,8 +371,7 @@ Here is the call graph for this function: Complex Complex::operator* ( - const Complex &  - other) + const Complex & other) @@ -420,8 +412,7 @@ Here is the call graph for this function: Complex Complex::operator+ ( - const Complex &  - other) + const Complex & other) @@ -459,8 +450,7 @@ Here is the call graph for this function: Complex Complex::operator- ( - const Complex &  - other) + const Complex & other) @@ -498,8 +488,7 @@ Here is the call graph for this function: Complex Complex::operator/ ( - const Complex &  - other) + const Complex & other) @@ -521,20 +510,21 @@ Here is the call graph for this function:
    142 {
    143 Complex result = *this * ~other;
    144 double denominator =
    -
    145 other.real() * other.real() + other.imag() * other.imag();
    +
    145 other.real() * other.real() + other.imag() * other.imag();
    146 if (denominator != 0) {
    -
    147 result = Complex(result.real() / denominator,
    +
    147 result = Complex(result.real() / denominator,
    148 result.imag() / denominator);
    149 return result;
    150 } else {
    151 throw std::invalid_argument("Undefined Value");
    152 }
    153 }
    +
    Complex::Complex
    Complex(double x=0.f, double y=0.f, bool is_polar=false)
    Complex Constructor which initialises our complex number.
    Definition complex_numbers.cpp:43
    Here is the call graph for this function:
    -
    +
    @@ -551,8 +541,7 @@ Here is the call graph for this function: const Complex & Complex::operator= ( - const Complex &  - other) + const Complex & other) @@ -565,8 +554,8 @@ Here is the call graph for this function:

    Operator overload of '=' on Complex class. Operator overload to be able to copy RHS instance of Complex to LHS instance of Complex.

    160 {
    -
    161 this->re = other.real();
    -
    162 this->im = other.imag();
    +
    161 this->re = other.real();
    +
    162 this->im = other.imag();
    163 return *this;
    164 }
    @@ -589,7 +578,7 @@ Here is the call graph for this function:
    Complex Complex::operator~ ( - ) + ) const @@ -621,7 +610,7 @@ Here is the call graph for this function: double Complex::real ( - ) + ) const @@ -646,7 +635,7 @@ Here is the call graph for this function: diff --git a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.map b/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.map index 55a972433..e60303da3 100644 --- a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.map +++ b/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.map @@ -1,7 +1,13 @@ - - - - - + + + + + + + + + + + diff --git a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.md5 b/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.md5 index da6dd58b8..e9b20ae6b 100644 --- a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.md5 +++ b/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.md5 @@ -1 +1 @@ -b0250996c7303ce83c30808909a450b9 \ No newline at end of file +1df6004932b22273f0110421ebe6a226 \ No newline at end of file diff --git a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.svg b/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.svg index a7c3e3906..be6e3ff63 100644 --- a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.svg +++ b/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.svg @@ -4,8 +4,8 @@ - + - + Complex::operator/ Node1 - -Complex::operator/ + +Complex::operator/ Node2 - - -Complex::imag + + +Complex::Complex @@ -40,26 +40,80 @@ Node1->Node2 - - + + + + + + + +Node5 + + +Complex::imag + + + + + +Node1->Node5 + + + + + + + + +Node6 + + +Complex::real + + + + + +Node1->Node6 + + + Node3 - - -Complex::real + + +std::cos - - -Node1->Node3 - - - + + +Node2->Node3 + + + + + + + + +Node4 + + +std::sin + + + + + +Node2->Node4 + + + diff --git a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph_org.svg b/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph_org.svg index bb12c664e..67ff1cb6d 100644 --- a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph_org.svg +++ b/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph_org.svg @@ -4,25 +4,25 @@ - - + + Complex::operator/ Node1 - -Complex::operator/ + +Complex::operator/ Node2 - - -Complex::imag + + +Complex::Complex @@ -30,26 +30,80 @@ Node1->Node2 - - + + + + + + + +Node5 + + +Complex::imag + + + + + +Node1->Node5 + + + + + + + + +Node6 + + +Complex::real + + + + + +Node1->Node6 + + + Node3 - - -Complex::real + + +std::cos - - -Node1->Node3 - - - + + +Node2->Node3 + + + + + + + + +Node4 + + +std::sin + + + + + +Node2->Node4 + + + diff --git a/da/d61/structsearch_1_1sublist__search_1_1_node.html b/da/d61/structsearch_1_1sublist__search_1_1_node.html index c1a7e2927..9071d34dd 100644 --- a/da/d61/structsearch_1_1sublist__search_1_1_node.html +++ b/da/d61/structsearch_1_1sublist__search_1_1_node.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: search::sublist_search::Node Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -105,7 +107,7 @@ $(document).ready(function(){initNavTree('da/d61/structsearch_1_1sublist__search

    A Node structure representing a single link Node in a linked list. - More...

    + More...

    Collaboration diagram for search::sublist_search::Node:
    @@ -118,7 +120,7 @@ Public Attributes uint32_t data = 0  the key/value of the node
      -Node * next {} +Node * next {}  pointer to the next node
      @@ -151,7 +153,7 @@ uint32_t data = 0 diff --git a/da/d66/classrange__queries_1_1per_seg_tree-members.html b/da/d66/classrange__queries_1_1per_seg_tree-members.html index 2d410be38..dbe4bbb59 100644 --- a/da/d66/classrange__queries_1_1per_seg_tree-members.html +++ b/da/d66/classrange__queries_1_1per_seg_tree-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -120,7 +122,7 @@ $(document).ready(function(){initNavTree('d8/d28/classrange__queries_1_1per_seg_ diff --git a/da/d6d/namespaceoperations__on__datastructures.html b/da/d6d/namespaceoperations__on__datastructures.html index 31483bd7d..d90014598 100644 --- a/da/d6d/namespaceoperations__on__datastructures.html +++ b/da/d6d/namespaceoperations__on__datastructures.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: operations_on_datastructures Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -104,23 +106,23 @@ $(document).ready(function(){initNavTree('da/d6d/namespaceoperations__on__datast

    for std::vector -More...

    +More...

    - + - + - + - + - +

    Functions

    void print (const std::vector< int32_t > &array)
    void print (const std::vector< int32_t > &array)
     Prints the values of a vector sequentially, ending with a newline character.
     
    std::vector< int32_t > shift_left (const std::vector< int32_t > &array, size_t shift)
    std::vector< int32_t > shift_left (const std::vector< int32_t > &array, size_t shift)
     Shifts the given vector to the left by the shift amount and returns a new vector with the result. The original vector is not mutated.
     
    std::vector< int32_t > shift_right (const std::vector< int32_t > &array, size_t shift)
    std::vector< int32_t > shift_right (const std::vector< int32_t > &array, size_t shift)
     Shifts the given vector to the right by the shift amount and returns a new vector with the result. The original vector is not mutated.
     
    std::vector< int32_t > get_intersection (const std::vector< int32_t > &first, const std::vector< int32_t > &second)
    std::vector< int32_t > get_intersection (const std::vector< int32_t > &first, const std::vector< int32_t > &second)
     Gets the intersection of two sorted arrays, and returns them in a vector.
     
    std::vector< int32_t > get_union (const std::vector< int32_t > &first, const std::vector< int32_t > &second)
    std::vector< int32_t > get_union (const std::vector< int32_t > &first, const std::vector< int32_t > &second)
     Gets the union of two sorted arrays, and returns them in a vector.
     
    @@ -148,19 +150,12 @@ Functions std::vector< int32_t > operations_on_datastructures::get_intersection ( - const std::vector< int32_t > &  - first, + const std::vector< int32_t > & first, - const std::vector< int32_t > &  - second  - - - - ) - + const std::vector< int32_t > & second )
    @@ -228,19 +223,12 @@ Here is the call graph for this function:
    std::vector< int32_t > operations_on_datastructures::get_union ( - const std::vector< int32_t > &  - first, + const std::vector< int32_t > & first, - const std::vector< int32_t > &  - second  - - - - ) - + const std::vector< int32_t > & second )
    @@ -330,8 +318,7 @@ Here is the call graph for this function:
    void operations_on_datastructures::print ( - const std::vector< int32_t > &  - array) + const std::vector< int32_t > & array) @@ -378,19 +365,12 @@ Here is the call graph for this function: std::vector< int32_t > operations_on_datastructures::shift_left ( - const std::vector< int32_t > &  - array, + const std::vector< int32_t > & array, - size_t  - shift  - - - - ) - + size_t shift )
    @@ -425,7 +405,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -439,19 +419,12 @@ Here is the call graph for this function: std::vector< int32_t > operations_on_datastructures::shift_right ( - const std::vector< int32_t > &  - array, + const std::vector< int32_t > & array, - size_t  - shift  - - - - ) - + size_t shift )
    @@ -486,7 +459,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -497,7 +470,7 @@ Here is the call graph for this function: diff --git a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.map b/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.map index b8bf7480d..b818dad7d 100644 --- a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.map +++ b/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.map @@ -1,6 +1,5 @@ - - - - + + + diff --git a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.md5 b/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.md5 index 0cba9a5fe..488896de4 100644 --- a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.md5 +++ b/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.md5 @@ -1 +1 @@ -79f3aa9cd19deb4d5f60f50392a41099 \ No newline at end of file +f5e25a3ff024932c5a51b7b1efdd2a05 \ No newline at end of file diff --git a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.svg b/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.svg index 1c31e2c10..a266611fa 100644 --- a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.svg +++ b/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.svg @@ -4,8 +4,8 @@ - + - + operations_on_datastructures::shift_right @@ -28,15 +28,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -47,9 +38,9 @@ - + Node1->Node2 - + diff --git a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph_org.svg b/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph_org.svg index 54aa739cf..435680931 100644 --- a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph_org.svg +++ b/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph_org.svg @@ -4,9 +4,9 @@ - - + + operations_on_datastructures::shift_right @@ -18,15 +18,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -37,9 +28,9 @@ - + Node1->Node2 - + diff --git a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.map b/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.map index 9ce9ab897..8bd4a4256 100644 --- a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.map +++ b/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.map @@ -1,10 +1,9 @@ - - + - + diff --git a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.md5 b/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.md5 index a7b1ee634..108aa866d 100644 --- a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.md5 +++ b/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.md5 @@ -1 +1 @@ -bc683ebaea04d2816d23e041d6a2dfaf \ No newline at end of file +bcd05b03e4b3054b424c6943fd327030 \ No newline at end of file diff --git a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.svg b/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.svg index 5fa892389..b62efef6c 100644 --- a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.svg +++ b/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.svg @@ -28,15 +28,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -65,9 +56,9 @@ - + Node1->Node3 - + @@ -83,9 +74,9 @@ - + Node1->Node4 - + diff --git a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph_org.svg b/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph_org.svg index 3ac80155d..dc4089834 100644 --- a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph_org.svg +++ b/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph_org.svg @@ -18,15 +18,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -55,9 +46,9 @@ - + Node1->Node3 - + @@ -73,9 +64,9 @@ - + Node1->Node4 - + diff --git a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.map b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.map index bde0cffb8..d807fc099 100644 --- a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.map +++ b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.map @@ -1,10 +1,9 @@ - - + - + diff --git a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.md5 b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.md5 index 944e1823c..39e81ed39 100644 --- a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.md5 +++ b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.md5 @@ -1 +1 @@ -d6093502d8cda06dacc5ddfa81a30697 \ No newline at end of file +2f60d246ed68f9e25d3c25cb94b3090a \ No newline at end of file diff --git a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.svg b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.svg index 4a5af9301..939543aa5 100644 --- a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.svg +++ b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.svg @@ -28,15 +28,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -65,9 +56,9 @@ - + Node1->Node3 - + @@ -83,9 +74,9 @@ - + Node1->Node4 - + diff --git a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph_org.svg b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph_org.svg index 9b89080cd..0a227781f 100644 --- a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph_org.svg +++ b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph_org.svg @@ -18,15 +18,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -55,9 +46,9 @@ - + Node1->Node3 - + @@ -73,9 +64,9 @@ - + Node1->Node4 - + diff --git a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.map b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.map index bb68baecc..3b23b5b5f 100644 --- a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.map +++ b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.map @@ -1,6 +1,5 @@ - - - - + + + diff --git a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.md5 b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.md5 index 6d41b1c76..12ef778e0 100644 --- a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.md5 +++ b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.md5 @@ -1 +1 @@ -8395e829d32d8b2e92fac2dc9b5805d2 \ No newline at end of file +14dc21fcd42b7e6eab77f4df2162358f \ No newline at end of file diff --git a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.svg b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.svg index fcc79ba87..9e680d74e 100644 --- a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.svg +++ b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.svg @@ -4,8 +4,8 @@ - + - + operations_on_datastructures::shift_left @@ -28,15 +28,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -47,9 +38,9 @@ - + Node1->Node2 - + diff --git a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph_org.svg b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph_org.svg index 72b10f1dd..2f4222cd3 100644 --- a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph_org.svg +++ b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph_org.svg @@ -4,9 +4,9 @@ - - + + operations_on_datastructures::shift_left @@ -18,15 +18,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -37,9 +28,9 @@ - + Node1->Node2 - + diff --git a/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html b/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html index 5a415f401..73feae2a5 100644 --- a/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html +++ b/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: machine_learning::aystar_search::AyStarSearch< Puzzle >::Info Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('da/d70/structmachine__learning_1_1ayst

    Struct that handles all the information related to the current state. - More...

    + More...

    Collaboration diagram for machine_learning::aystar_search::AyStarSearch< Puzzle >::Info:
    @@ -115,25 +117,25 @@ Collaboration diagram for machine_learning::aystar_search::AyStarSearch< Puzz - + - + - + - + - + - + - + - +

    Public Member Functions

     Info ()=default
     Info ()=default
     stores g score
     
     Info (const Puzzle &A)
     Info (const Puzzle &A)
     constructor having Puzzle as parameter
     
     Info (const Puzzle &A, size_t h_value, size_t d)
     Info (const Puzzle &A, size_t h_value, size_t d)
     constructor having three parameters
     
     Info (const Info &A)
     Info (const Info &A)
     Copy constructor.
     
     Info (const Info &&A) noexcept
     Info (const Info &&A) noexcept
     Move constructor.
     
    Info & operator= (const Info &A)
    Info & operator= (const Info &A)
     copy assignment operator
     
    Info & operator= (Info &&A) noexcept
    Info & operator= (Info &&A) noexcept
     move assignment operator
     
    @@ -173,7 +175,7 @@ template<typename Puzzle >
    machine_learning::aystar_search::AyStarSearch< Puzzle >::Info::Info ())
    @@ -203,8 +205,7 @@ template<typename Puzzle >
    machine_learning::aystar_search::AyStarSearch< Puzzle >::Info::Info ( - const Puzzle &  - A) + const Puzzle & A) @@ -240,25 +241,17 @@ template<typename Puzzle >
    machine_learning::aystar_search::AyStarSearch< Puzzle >::Info::Info ( - const Puzzle &  - A, + const Puzzle & A, - size_t  - h_value, + size_t h_value, - size_t  - d  - - - - ) - + size_t d ) @@ -278,10 +271,10 @@ template<typename Puzzle >
    316 : state(std::make_shared<Puzzle>(A)),
    -
    317 heuristic_value(h_value),
    -
    318 depth(d) {}
    -
    machine_learning::aystar_search::AyStarSearch::Info::depth
    size_t depth
    stores h score
    Definition a_star_search.cpp:296
    -
    machine_learning::aystar_search::AyStarSearch::Info::heuristic_value
    size_t heuristic_value
    Holds the current state.
    Definition a_star_search.cpp:295
    +
    317 heuristic_value(h_value),
    +
    318 depth(d) {}
    +
    machine_learning::aystar_search::AyStarSearch::Info::depth
    size_t depth
    stores h score
    Definition a_star_search.cpp:296
    +
    machine_learning::aystar_search::AyStarSearch::Info::heuristic_value
    size_t heuristic_value
    Holds the current state.
    Definition a_star_search.cpp:295
    @@ -299,8 +292,7 @@ template<typename Puzzle > machine_learning::aystar_search::AyStarSearch< Puzzle >::Info::Info ( - const Info &  - A) + const Info & A) @@ -319,8 +311,8 @@ template<typename Puzzle >
    325 : state(std::make_shared<Puzzle>(A.state)),
    -
    326 heuristic_value(A.heuristic_value),
    -
    327 depth(A.depth) {}
    +
    326 heuristic_value(A.heuristic_value),
    +
    327 depth(A.depth) {}
    @@ -338,8 +330,7 @@ template<typename Puzzle > machine_learning::aystar_search::AyStarSearch< Puzzle >::Info::Info ( - const Info &&  - A) + const Info && A) @@ -358,8 +349,8 @@ template<typename Puzzle >
    334 : state(std::make_shared<Puzzle>(std::move(A.state))),
    -
    335 heuristic_value(std::move(A.heuristic_value)),
    -
    336 depth(std::move(A.depth)) {}
    +
    335 heuristic_value(std::move(A.heuristic_value)),
    +
    336 depth(std::move(A.depth)) {}
    std::move
    T move(T... args)
    @@ -379,8 +370,7 @@ template<typename Puzzle > Info & machine_learning::aystar_search::AyStarSearch< Puzzle >::Info::operator= ( - const Info &  - A) + const Info & A) @@ -400,8 +390,8 @@ template<typename Puzzle >
    342 {
    343 state = A.state;
    -
    344 heuristic_value = A.heuristic_value;
    -
    345 depth = A.depth;
    +
    344 heuristic_value = A.heuristic_value;
    +
    345 depth = A.depth;
    346 return *this;
    347 }
    @@ -421,8 +411,7 @@ template<typename Puzzle > Info & machine_learning::aystar_search::AyStarSearch< Puzzle >::Info::operator= ( - Info &&  - A) + Info && A) @@ -442,8 +431,8 @@ template<typename Puzzle >
    353 {
    354 state = std::move(A.state);
    -
    355 heuristic_value = std::move(A.heuristic_value);
    -
    356 depth = std::move(A.depth);
    +
    355 heuristic_value = std::move(A.heuristic_value);
    +
    356 depth = std::move(A.depth);
    357 return *this;
    358 }
    @@ -463,7 +452,7 @@ Here is the call graph for this function:
    diff --git a/da/d73/classgraph_1_1_lowest_common_ancestor-members.html b/da/d73/classgraph_1_1_lowest_common_ancestor-members.html index 5d3fe1aa2..2cb21cc2e 100644 --- a/da/d73/classgraph_1_1_lowest_common_ancestor-members.html +++ b/da/d73/classgraph_1_1_lowest_common_ancestor-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,7 +115,7 @@ $(document).ready(function(){initNavTree('d9/d23/classgraph_1_1_lowest_common_an diff --git a/da/d77/spirograph_8cpp.html b/da/d77/spirograph_8cpp.html index 72196aa44..9f59d99d0 100644 --- a/da/d77/spirograph_8cpp.html +++ b/da/d77/spirograph_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graphics/spirograph.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,7 +130,7 @@ Namespaces - +

    Macros

    #define _USE_MATH_DEFINES
    #define _USE_MATH_DEFINES
     
    - +

    @@ -139,7 +141,7 @@ Functions

    void spirograph::test ()
     Test function to save resulting points to a CSV file.
     
    int main (int argc, char **argv)
    int main (int argc, char **argv)
     

    Detailed Description

    @@ -173,19 +175,12 @@ Functions int main ( - int  - argc, + int argc, - char **  - argv  - - - - ) - + char ** argv )
    @@ -222,7 +217,7 @@ Here is the call graph for this function:
    diff --git a/da/d7b/primality__test_8cpp.html b/da/d7b/primality__test_8cpp.html index ce54b4834..594a2c52b 100644 --- a/da/d7b/primality__test_8cpp.html +++ b/da/d7b/primality__test_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/primality_test.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,9 +116,9 @@ Include dependency graph for primality_test.cpp:
    - + - +

    Functions

    bool IsPrime (int number)
    bool IsPrime (int number)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -135,8 +137,7 @@ Functions bool IsPrime ( - int  - number) + int number) @@ -172,8 +173,7 @@ Functions int main ( - void  - ) + void ) @@ -184,7 +184,7 @@ Functions
    33 std::cout << "Enter the value of n to check if Prime\n";
    34 int n;
    35 std::cin >> n;
    -
    36 if (IsPrime(n))
    +
    36 if (IsPrime(n))
    37 std::cout << n << " is Prime" << std::endl;
    38 else
    39 std::cout << n << " is not Prime" << std::endl;
    @@ -194,7 +194,7 @@ Functions
    std::endl
    T endl(T... args)
    -
    IsPrime
    bool IsPrime(int number)
    Definition primality_test.cpp:18
    +
    IsPrime
    bool IsPrime(int number)
    Definition primality_test.cpp:18
    Here is the call graph for this function:
    @@ -209,7 +209,7 @@ Here is the call graph for this function:
    diff --git a/da/d82/namespacecycle__detection.html b/da/d82/namespacecycle__detection.html index c83d97aa9..90fb74931 100644 --- a/da/d82/namespacecycle__detection.html +++ b/da/d82/namespacecycle__detection.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: cycle_detection Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('da/d82/namespacecycle__detection.html'

    Functions for the Floyd's Cycle Detection algorithm. -More...

    +More...

    Detailed Description

    Functions for the Floyd's Cycle Detection algorithm.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('da/d82/namespacecycle__detection.html' diff --git a/da/d86/struct_test_case.html b/da/d86/struct_test_case.html index 576fc71b5..96a2125dd 100644 --- a/da/d86/struct_test_case.html +++ b/da/d86/struct_test_case.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: TestCase Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('da/d86/struct_test_case.html','../../'

    represents single example inputs and expected output of the function longest_common_string_length - More...

    + More...

    Collaboration diagram for TestCase:
    @@ -115,7 +117,7 @@ Collaboration diagram for TestCase:
    - +

    Public Member Functions

     TestCase (std::string string_a, std::string string_b, const std::size_t in_common_string_len)
     TestCase (std::string string_a, std::string string_b, const std::size_t in_common_string_len)
     
    - - + - - + - - - - - - - +

    @@ -145,25 +147,17 @@ const TestCase::TestCase

    		(std::string string_a, std::string string_a,
    std::string string_b, std::string string_b,
    const std::size_t in_common_string_len 
    )const std::size_t in_common_string_len )
    @@ -188,7 +182,7 @@ const
    • TestCase
      • -
    • Generated by doxygen 1.9.8
      • +
    • Generated by doxygen 1.10.0
    diff --git a/da/d8d/depth__first__search_8cpp.html b/da/d8d/depth__first__search_8cpp.html index 879ffc1ae..4304d1507 100644 --- a/da/d8d/depth__first__search_8cpp.html +++ b/da/d8d/depth__first__search_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph/depth_first_search.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -132,7 +134,7 @@ Functions void graph::depth_first_search (const std::vector< std::vector< size_t > > &adj, size_t start)  initiates depth first search algorithm.
      -int main () +int main ()  

    Detailed Description

    @@ -166,8 +168,7 @@ Functions int main ( - void  - ) + void ) @@ -221,7 +222,7 @@ Here is the call graph for this function:
    diff --git a/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html b/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html index 452d2a390..9ffeb399e 100644 --- a/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html +++ b/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: machine_learning::k_nearest_neighbors::Knn Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('da/d94/classmachine__learning_1_1k__ne

    K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric. - More...

    + More...

    Collaboration diagram for machine_learning::k_nearest_neighbors::Knn:
    @@ -115,31 +117,31 @@ Collaboration diagram for machine_learning::k_nearest_neighbors::Knn:
    - + - + - + - + - + - +

    Public Member Functions

     Knn (std::vector< std::vector< double > > &X, std::vector< int > &Y)
     Knn (std::vector< std::vector< double > > &X, std::vector< int > &Y)
     Construct a new Knn object.
     
     Knn (const Knn &model)=default
     Knn (const Knn &model)=default
     
    Knn & operator= (const Knn &model)=default
    Knn & operator= (const Knn &model)=default
     
     Knn (Knn &&)=default
     Knn (Knn &&)=default
     
    Knn & operator= (Knn &&)=default
    Knn & operator= (Knn &&)=default
     
     ~Knn ()=default
     Destroy the Knn object.
     
    int predict (std::vector< double > &sample, int k)
    int predict (std::vector< double > &sample, int k)
     Classify sample.
     
    - + - +

    Private Attributes

    std::vector< std::vector< double > > X_ {}
    std::vector< std::vector< double > > X_ {}
     attributes vector
     
    std::vector< int > Y_ {}
    std::vector< int > Y_ {}
     labels vector
     
    @@ -158,19 +160,12 @@ Private Attributes machine_learning::k_nearest_neighbors::Knn::Knn ( - std::vector< std::vector< double > > &  - X, + std::vector< std::vector< double > > & X, - std::vector< int > &  - Y  - - - - ) - + std::vector< int > & Y ) @@ -188,9 +183,9 @@ Private Attributes -
    68 : X_(X), Y_(Y){};
    -
    machine_learning::k_nearest_neighbors::Knn::X_
    std::vector< std::vector< double > > X_
    attributes vector
    Definition k_nearest_neighbors.cpp:57
    -
    machine_learning::k_nearest_neighbors::Knn::Y_
    std::vector< int > Y_
    labels vector
    Definition k_nearest_neighbors.cpp:58
    +
    68 : X_(X), Y_(Y){};
    +
    machine_learning::k_nearest_neighbors::Knn::X_
    std::vector< std::vector< double > > X_
    attributes vector
    Definition k_nearest_neighbors.cpp:57
    +
    machine_learning::k_nearest_neighbors::Knn::Y_
    std::vector< int > Y_
    labels vector
    Definition k_nearest_neighbors.cpp:58
    @@ -206,8 +201,7 @@ Private Attributes machine_learning::k_nearest_neighbors::Knn::Knn ( - const Knn &  - model) + const Knn & model) @@ -239,8 +233,7 @@ Private Attributes machine_learning::k_nearest_neighbors::Knn::Knn ( - Knn &&  - ) + Knn && ) @@ -267,8 +260,7 @@ Private Attributes Knn & machine_learning::k_nearest_neighbors::Knn::operator= ( - const Knn &  - model) + const Knn & model) @@ -294,8 +286,7 @@ Private Attributes Knn & machine_learning::k_nearest_neighbors::Knn::operator= ( - Knn &&  - ) + Knn && ) @@ -321,19 +312,12 @@ Private Attributes int machine_learning::k_nearest_neighbors::Knn::predict ( - std::vector< double > &  - sample, + std::vector< double > & sample, - int  - k  - - - - ) - + int k ) @@ -355,9 +339,9 @@ Private Attributes
    103 {
    104 std::vector<int> neighbors;
    105 std::vector<std::pair<double, int>> distances;
    -
    106 for (size_t i = 0; i < this->X_.size(); ++i) {
    -
    107 auto current = this->X_.at(i);
    -
    108 auto label = this->Y_.at(i);
    +
    106 for (size_t i = 0; i < this->X_.size(); ++i) {
    +
    107 auto current = this->X_.at(i);
    +
    108 auto label = this->Y_.at(i);
    109 auto distance = euclidean_distance(current, sample);
    110 distances.emplace_back(distance, label);
    111 }
    @@ -462,7 +446,7 @@ Here is the call graph for this function:
    diff --git a/da/d9a/class_graph.html b/da/d9a/class_graph.html index af21db76c..3704ac67b 100644 --- a/da/d9a/class_graph.html +++ b/da/d9a/class_graph.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Graph Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,13 +116,13 @@ Collaboration diagram for Graph:
    - + - + - + - + @@ -134,27 +136,27 @@ Public Member Functions - + - + - + - + - + - + - + - + - + - + - +

    Public Member Functions

     Graph (int V, int E)
     Graph (int V, int E)
     
    void addEdge (int src, int dst, int weight)
    void addEdge (int src, int dst, int weight)
     
     Graph (int V)
     Graph (int V)
     
    void addEdge (int src, int dst, int weight)
    void addEdge (int src, int dst, int weight)
     
     Graph (Graph &&)=default
    Graph & operator= (Graph const &)=default
     
     Graph (unsigned int vertices, AdjList adjList)
     Graph (unsigned int vertices, AdjList adjList)
     
     Graph (unsigned int vertices, AdjList &&adjList)
     Graph (unsigned int vertices, AdjList &&adjList)
     
     Graph (unsigned int vertices, std::vector< Edge > const &edges)
     Graph (unsigned int vertices, std::vector< Edge > const &edges)
     
    std::remove_reference< AdjList >::type const & getAdjList () const
    std::remove_reference< AdjList >::type const & getAdjList () const
     
    unsigned int getVertices () const
    unsigned int getVertices () const
     
    void addVertices (unsigned int num=1)
    void addVertices (unsigned int num=1)
     
    void addEdge (Edge const &edge)
    void addEdge (Edge const &edge)
     
    void addEdge (unsigned int source, unsigned int destination)
    void addEdge (unsigned int source, unsigned int destination)
     
    void set_graph ()
    void set_graph ()
     
    void ford_fulkerson ()
    void ford_fulkerson ()
     
    void print_flow_info ()
    void print_flow_info ()
     

    @@ -174,7 +176,7 @@ int ** 

    		edges
    - +

    Private Member Functions

    bool bfs (int source, int sink)
    bool bfs (int source, int sink)
     
    < - - + - - - - - - - +

    @@ -232,19 +234,12 @@ int 

    		max_flow = 0
    Graph::Graph (int V, int V,
    int E 
    )int E )
    @@ -275,8 +270,7 @@ int max_flow = 0< Graph::Graph ( - int  - V) + int V) @@ -310,7 +304,7 @@ int max_flow = 0< Graph::~Graph ( - ) + ) @@ -339,7 +333,7 @@ int max_flow = 0< Graph::Graph ( - ) + ) @@ -365,19 +359,12 @@ int max_flow = 0< Graph::Graph ( - unsigned int  - vertices, + unsigned int vertices, - AdjList  - adjList  - - - - ) - + AdjList adjList ) @@ -411,19 +398,12 @@ int max_flow = 0< Graph::Graph ( - unsigned int  - vertices, + unsigned int vertices, - AdjList &&  - adjList  - - - - ) - + AdjList && adjList ) @@ -456,19 +436,12 @@ int max_flow = 0< Graph::Graph ( - unsigned int  - vertices, + unsigned int vertices, - std::vector< Edge > const &  - edges  - - - - ) - + std::vector< Edge > const & edges ) @@ -512,8 +485,7 @@ int max_flow = 0< void Graph::addEdge ( - Edge const &  - edge) + Edge const & edge) @@ -551,25 +523,17 @@ int max_flow = 0< void Graph::addEdge ( - int  - src, + int src, - int  - dst, + int dst, - int  - weight  - - - - ) - + int weight ) @@ -603,25 +567,17 @@ int max_flow = 0< void Graph::addEdge ( - int  - src, + int src, - int  - dst, + int dst, - int  - weight  - - - - ) - + int weight ) @@ -648,19 +604,12 @@ int max_flow = 0< void Graph::addEdge ( - unsigned int  - source, + unsigned int source, - unsigned int  - destination  - - - - ) - + unsigned int destination ) @@ -699,8 +648,7 @@ int max_flow = 0< void Graph::addVertices ( - unsigned int  - num = 1) + unsigned int num = 1) @@ -733,19 +681,12 @@ int max_flow = 0< bool Graph::bfs ( - int  - source, + int source, - int  - sink  - - - - ) - + int sink ) @@ -794,7 +735,7 @@ int max_flow = 0< void Graph::ford_fulkerson ( - ) + ) @@ -840,7 +781,7 @@ int max_flow = 0< std::remove_reference< AdjList >::type const & Graph::getAdjList ( - ) + ) const @@ -870,7 +811,7 @@ int max_flow = 0< unsigned int Graph::getVertices ( - ) + ) const @@ -897,7 +838,7 @@ int max_flow = 0< void Graph::print_flow_info ( - ) + ) @@ -948,7 +889,7 @@ int max_flow = 0< void Graph::set_graph ( - ) + ) @@ -987,7 +928,7 @@ int max_flow = 0< diff --git a/da/d9a/palindrome__of__number_8cpp.html b/da/d9a/palindrome__of__number_8cpp.html index 0b9776154..3153fe5d1 100644 --- a/da/d9a/palindrome__of__number_8cpp.html +++ b/da/d9a/palindrome__of__number_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/palindrome_of_number.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,7 +118,7 @@ Include dependency graph for palindrome_of_number.cpp:
    - +

    Functions

    int main ()
    int main ()
     

    Detailed Description

    @@ -132,8 +134,7 @@ Functions int main ( - void  - ) + void ) @@ -177,7 +178,7 @@ Here is the call graph for this function: diff --git a/da/da3/uint256__t_8hpp.html b/da/da3/uint256__t_8hpp.html index 8ce5d432f..28a761f35 100644 --- a/da/da3/uint256__t_8hpp.html +++ b/da/da3/uint256__t_8hpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ciphers/uint256_t.hpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -134,59 +136,59 @@ Classes - +

    Macros

    #define CIPHERS_UINT256_T_HPP_
    #define CIPHERS_UINT256_T_HPP_
     for std::pair library
     
    - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - +

    Functions

    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator+ (const T p, const uint256_t &q)
    uint256_t operator+ (const T p, const uint256_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator- (const T p, const uint256_t &q)
    uint256_t operator- (const T p, const uint256_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator* (const T p, const uint256_t &q)
    uint256_t operator* (const T p, const uint256_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator/ (const T p, const uint256_t &q)
    uint256_t operator/ (const T p, const uint256_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator% (const T p, const uint256_t &q)
    uint256_t operator% (const T p, const uint256_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator& (const T &p, const uint256_t &q)
    uint256_t operator& (const T &p, const uint256_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator| (const T p, const uint256_t &q)
    uint256_t operator| (const T p, const uint256_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint256_t operator^ (const T p, const uint256_t &q)
    uint256_t operator^ (const T p, const uint256_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator&& (const T p, const uint256_t &q)
    bool operator&& (const T p, const uint256_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator|| (const T p, const uint256_t &q)
    bool operator|| (const T p, const uint256_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator== (const T p, const uint256_t &q)
    bool operator== (const T p, const uint256_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator!= (const T p, const uint256_t &q)
    bool operator!= (const T p, const uint256_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator< (const T p, const uint256_t &q)
    bool operator< (const T p, const uint256_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator<= (const T p, const uint256_t &q)
    bool operator<= (const T p, const uint256_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator> (const T p, const uint256_t &q)
    bool operator> (const T p, const uint256_t &q)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator>= (const T p, const uint256_t &q)
    bool operator>= (const T p, const uint256_t &q)
     

    Detailed Description

    @@ -225,19 +227,12 @@ template<typename T , typename = typename std::enable_if< bool operator!= ( - const T  - p, + const T p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -267,19 +262,12 @@ template<typename T , typename = typename std::enable_if< uint256_t operator% ( - const T  - p, + const T p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -308,19 +296,12 @@ template<typename T , typename = typename std::enable_if< uint256_t operator& ( - const T &  - p, + const T & p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -349,19 +330,12 @@ template<typename T , typename = typename std::enable_if< bool operator&& ( - const T  - p, + const T p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -390,19 +364,12 @@ template<typename T , typename = typename std::enable_if< uint256_t operator* ( - const T  - p, + const T p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -431,19 +398,12 @@ template<typename T , typename = typename std::enable_if< uint256_t operator+ ( - const T  - p, + const T p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -472,19 +432,12 @@ template<typename T , typename = typename std::enable_if< uint256_t operator- ( - const T  - p, + const T p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -513,19 +466,12 @@ template<typename T , typename = typename std::enable_if< uint256_t operator/ ( - const T  - p, + const T p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -554,19 +500,12 @@ template<typename T , typename = typename std::enable_if< bool operator< ( - const T  - p, + const T p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -595,19 +534,12 @@ template<typename T , typename = typename std::enable_if< bool operator<= ( - const T  - p, + const T p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -636,19 +568,12 @@ template<typename T , typename = typename std::enable_if< bool operator== ( - const T  - p, + const T p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -677,19 +602,12 @@ template<typename T , typename = typename std::enable_if< bool operator> ( - const T  - p, + const T p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -718,19 +636,12 @@ template<typename T , typename = typename std::enable_if< bool operator>= ( - const T  - p, + const T p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -759,19 +670,12 @@ template<typename T , typename = typename std::enable_if< uint256_t operator^ ( - const T  - p, + const T p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -800,19 +704,12 @@ template<typename T , typename = typename std::enable_if< uint256_t operator| ( - const T  - p, + const T p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -841,19 +738,12 @@ template<typename T , typename = typename std::enable_if< bool operator|| ( - const T  - p, + const T p, - const uint256_t &  - q  - - - - ) - + const uint256_t & q ) @@ -874,7 +764,7 @@ template<typename T , typename = typename std::enable_if< diff --git a/da/da3/uint256__t_8hpp_source.html b/da/da3/uint256__t_8hpp_source.html index ecf72a2e1..5e90c53fa 100644 --- a/da/da3/uint256__t_8hpp_source.html +++ b/da/da3/uint256__t_8hpp_source.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ciphers/uint256_t.hpp Source File + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -76,7 +78,7 @@ $(document).ready(function() { init_codefold(1); });
    @@ -1415,7 +1417,7 @@ $(document).ready(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','. diff --git a/da/da4/structoperations__on__datastructures_1_1circular__linked__list_1_1_node-members.html b/da/da4/structoperations__on__datastructures_1_1circular__linked__list_1_1_node-members.html index 00550d5a7..5b96d55e3 100644 --- a/da/da4/structoperations__on__datastructures_1_1circular__linked__list_1_1_node-members.html +++ b/da/da4/structoperations__on__datastructures_1_1circular__linked__list_1_1_node-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('da/d16/structoperations__on__datastruc diff --git a/da/dac/classdata__structures_1_1_segment_tree-members.html b/da/dac/classdata__structures_1_1_segment_tree-members.html index ad8ee6cd3..08df37626 100644 --- a/da/dac/classdata__structures_1_1_segment_tree-members.html +++ b/da/dac/classdata__structures_1_1_segment_tree-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -118,7 +120,7 @@ $(document).ready(function(){initNavTree('dd/d95/classdata__structures_1_1_segme diff --git a/da/dac/n__queens__all__solution__optimised_8cpp.html b/da/dac/n__queens__all__solution__optimised_8cpp.html index a4fd61907..d8a4ed1c7 100644 --- a/da/dac/n__queens__all__solution__optimised_8cpp.html +++ b/da/dac/n__queens__all__solution__optimised_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: backtracking/n_queens_all_solution_optimised.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,15 +128,15 @@ Namespaces

    Functions

    template<size_t n> -void backtracking::n_queens_optimized::PrintSol (const std::array< std::array< int, n >, n > &board) +void backtracking::n_queens_optimized::PrintSol (const std::array< std::array< int, n >, n > &board)   template<size_t n> -bool backtracking::n_queens_optimized::CanIMove (const std::array< std::array< int, n >, n > &board, int row, int col) +bool backtracking::n_queens_optimized::CanIMove (const std::array< std::array< int, n >, n > &board, int row, int col)   template<size_t n> -void backtracking::n_queens_optimized::NQueenSol (std::array< std::array< int, n >, n > board, int col) +void backtracking::n_queens_optimized::NQueenSol (std::array< std::array< int, n >, n > board, int col)   -int main () +int main ()  Main function.
      @@ -155,25 +157,17 @@ template<size_t n>
    bool backtracking::n_queens_optimized::CanIMove ( - const std::array< std::array< int, n >, n > &  - board, + const std::array< std::array< int, n >, n > & board, - int  - row, + int row, - int  - col  - - - - ) - + int col )
    @@ -235,8 +229,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -252,7 +245,7 @@ Here is the call graph for this function:
    114 for (int i = 0; i <= n / 2 - 1; i++) {
    115 if (backtracking::n_queens_optimized::CanIMove(board, i, 0)) {
    116 board[i][0] = 1;
    -
    117 backtracking::n_queens_optimized::NQueenSol(board, 1);
    +
    117 backtracking::n_queens_optimized::NQueenSol(board, 1);
    118 board[i][0] = 0;
    119 }
    120 }
    @@ -260,7 +253,7 @@ Here is the call graph for this function:
    122 for (int i = 0; i <= n / 2; i++) {
    123 if (backtracking::n_queens_optimized::CanIMove(board, i, 0)) {
    124 board[i][0] = 1;
    -
    125 backtracking::n_queens_optimized::NQueenSol(board, 1);
    +
    125 backtracking::n_queens_optimized::NQueenSol(board, 1);
    126 board[i][0] = 0;
    127 }
    128 }
    @@ -268,7 +261,7 @@ Here is the call graph for this function:
    130 return 0;
    131}
    -
    backtracking::n_queens_optimized::NQueenSol
    void NQueenSol(std::array< std::array< int, n >, n > board, int col)
    Definition n_queens_all_solution_optimised.cpp:89
    +
    backtracking::n_queens_optimized::NQueenSol
    void NQueenSol(std::array< std::array< int, n >, n > board, int col)
    Definition n_queens_all_solution_optimised.cpp:89
    @@ -283,19 +276,12 @@ template<size_t n> void backtracking::n_queens_optimized::NQueenSol ( - std::array< std::array< int, n >, n >  - board, + std::array< std::array< int, n >, n > board, - int  - col  - - - - ) - + int col )
    @@ -344,8 +330,7 @@ template<size_t n>
    void backtracking::n_queens_optimized::PrintSol ( - const std::array< std::array< int, n >, n > &  - board) + const std::array< std::array< int, n >, n > & board) @@ -396,7 +381,7 @@ Here is the call graph for this function: diff --git a/da/db8/count__of__set__bits_8cpp.html b/da/db8/count__of__set__bits_8cpp.html index 3dc2aa78c..94763cfe5 100644 --- a/da/db8/count__of__set__bits_8cpp.html +++ b/da/db8/count__of__set__bits_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: bit_manipulation/count_of_set_bits.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -125,12 +127,12 @@ Namespaces - + - + - +

    Functions

    std::uint64_t bit_manipulation::count_of_set_bits::countSetBits (std ::int64_t n)
    std::uint64_t bit_manipulation::count_of_set_bits::countSetBits (std ::int64_t n)
     The main function implements set bit count.
     
    static void test ()
    static void test ()
     
    int main ()
    int main ()
     Main function.
     
    @@ -150,8 +152,7 @@ Functions std::uint64_t bit_manipulation::count_of_set_bits::countSetBits ( - std ::int64_t  - n) + std ::int64_t n) @@ -197,8 +198,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -225,7 +225,7 @@ Here is the call graph for this function: static void test ( - ) + ) @@ -265,7 +265,7 @@ Here is the call graph for this function: diff --git a/da/dc3/linked__list_8cpp.html b/da/dc3/linked__list_8cpp.html index 762ed1f21..0d95dace9 100644 --- a/da/dc3/linked__list_8cpp.html +++ b/da/dc3/linked__list_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/linked_list.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -134,9 +136,9 @@ Namespaces - + - +

    Functions

    bool data_structures::linked_list::isDigit (const std::string &s)
    bool data_structures::linked_list::isDigit (const std::string &s)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -157,8 +159,7 @@ the pointers) starting from the first link. Whichever link points to null is bool data_structures::linked_list::isDigit ( - const std::string &  - s) + const std::string & s) @@ -199,8 +200,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -288,7 +288,7 @@ Here is the call graph for this function: diff --git a/da/dc9/fibonacci__matrix__exponentiation_8cpp.html b/da/dc9/fibonacci__matrix__exponentiation_8cpp.html index b42321e7d..11c283b75 100644 --- a/da/dc9/fibonacci__matrix__exponentiation_8cpp.html +++ b/da/dc9/fibonacci__matrix__exponentiation_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/fibonacci_matrix_exponentiation.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,11 +118,11 @@ Include dependency graph for fibonacci_matrix_exponentiation.cpp:
    - + - + - +

    Functions

    uint64_t fibo (uint64_t n, uint64_t mod)
    uint64_t fibo (uint64_t n, uint64_t mod)
     
    void test ()
    void test ()
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -140,19 +142,12 @@ Functions uint64_t fibo ( - uint64_t  - n, + uint64_t n, - uint64_t  - mod  - - - - ) - + uint64_t mod )
    @@ -238,25 +233,24 @@ Functions int main ( - void  - ) + void )

    Main function

    107{
    -
    108 test();
    +
    108 test();
    109 uint64_t mod=1000000007;
    110 std::cout<<"Enter the value of N: ";
    111 uint64_t n=0; std::cin>>n;
    -
    112 std::cout<<n<<"th Fibonacci number in modulo " << mod << ": "<< fibo( n , mod) << std::endl;
    +
    112 std::cout<<n<<"th Fibonacci number in modulo " << mod << ": "<< fibo( n , mod) << std::endl;
    113}
    std::endl
    T endl(T... args)
    -
    fibo
    uint64_t fibo(uint64_t n, uint64_t mod)
    Definition fibonacci_matrix_exponentiation.cpp:23
    -
    test
    void test()
    Definition fibonacci_matrix_exponentiation.cpp:88
    +
    fibo
    uint64_t fibo(uint64_t n, uint64_t mod)
    Definition fibonacci_matrix_exponentiation.cpp:23
    +
    test
    void test()
    Definition fibonacci_matrix_exponentiation.cpp:88
    Here is the call graph for this function:
    @@ -274,22 +268,22 @@ Here is the call graph for this function:
    void test ( - ) + )

    Function to test above algorithm

    89{
    -
    90 assert(fibo(6, 1000000007 ) == 8);
    +
    90 assert(fibo(6, 1000000007 ) == 8);
    91 std::cout << "test case:1 passed\n";
    -
    92 assert(fibo(5, 1000000007 ) == 5);
    +
    92 assert(fibo(5, 1000000007 ) == 5);
    93 std::cout << "test case:2 passed\n";
    -
    94 assert(fibo(10 , 1000000007) == 55);
    +
    94 assert(fibo(10 , 1000000007) == 55);
    95 std::cout << "test case:3 passed\n";
    -
    96 assert(fibo(500 , 100) == 25);
    +
    96 assert(fibo(500 , 100) == 25);
    97 std::cout << "test case:3 passed\n";
    -
    98 assert(fibo(500 , 10000) == 4125);
    +
    98 assert(fibo(500 , 10000) == 4125);
    99 std::cout << "test case:3 passed\n";
    100 std::cout << "--All tests passed--\n";
    101}
    @@ -307,7 +301,7 @@ Here is the call graph for this function:
    diff --git a/da/dd1/structquadratic__probing_1_1_entry.html b/da/dd1/structquadratic__probing_1_1_entry.html index 0799ec2d6..cb10ace7e 100644 --- a/da/dd1/structquadratic__probing_1_1_entry.html +++ b/da/dd1/structquadratic__probing_1_1_entry.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: quadratic_probing::Entry Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -108,7 +110,7 @@ $(document).ready(function(){initNavTree('da/dd1/structquadratic__probing_1_1_en

    Public Member Functions

    - Entry (int key=notPresent) + Entry (int key=notPresent)  constructor
      @@ -130,7 +132,7 @@ int  diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html index fefc46be2..e0fec253b 100644 --- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html +++ b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html @@ -3,16 +3,18 @@ - +Algorithms_in_C++: divide_and_conquer/karatsuba_algorithm_for_fast_multiplication.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    key
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,19 +129,19 @@ Namespaces - + - + - + - + - +

    Functions

    std::string divide_and_conquer::karatsuba_algorithm::add_strings (std::string first, std::string second)
    std::string divide_and_conquer::karatsuba_algorithm::add_strings (std::string first, std::string second)
     Binary addition.
     
    std::string divide_and_conquer::karatsuba_algorithm::safe_substr (const std::string &str, int64_t x1, int64_t x2, int64_t n)
    std::string divide_and_conquer::karatsuba_algorithm::safe_substr (const std::string &str, int64_t x1, int64_t x2, int64_t n)
     Wrapper function for substr that considers leading zeros.
     
    int64_t divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm (std::string str1, std::string str2)
    int64_t divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm (std::string str1, std::string str2)
     The main function implements Karatsuba's algorithm for fast multiplication.
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -158,19 +160,12 @@ Functions std::string divide_and_conquer::karatsuba_algorithm::add_strings ( - std::string  - first, + std::string first, - std::string  - second  - - - - ) - + std::string second )
    @@ -246,19 +241,12 @@ Here is the call graph for this function:
    int64_t divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm ( - std::string  - str1, + std::string str1, - std::string  - str2  - - - - ) - + std::string str2 )
    @@ -287,11 +275,11 @@ Here is the call graph for this function:
    124 int64_t fh = n / 2; // first half of string
    125 int64_t sh = n - fh; // second half of string
    126
    -
    127 std::string Xl = divide_and_conquer::karatsuba_algorithm::safe_substr(str1, 0, fh, n); // first half of first string
    -
    128 std::string Xr = divide_and_conquer::karatsuba_algorithm::safe_substr(str1, fh, sh, n); // second half of first string
    +
    127 std::string Xl = divide_and_conquer::karatsuba_algorithm::safe_substr(str1, 0, fh, n); // first half of first string
    +
    128 std::string Xr = divide_and_conquer::karatsuba_algorithm::safe_substr(str1, fh, sh, n); // second half of first string
    129
    -
    130 std::string Yl = divide_and_conquer::karatsuba_algorithm::safe_substr(str2, 0, fh, n); // first half of second string
    -
    131 std::string Yr = divide_and_conquer::karatsuba_algorithm::safe_substr(str2, fh, sh, n); // second half of second string
    +
    130 std::string Yl = divide_and_conquer::karatsuba_algorithm::safe_substr(str2, 0, fh, n); // first half of second string
    +
    131 std::string Yr = divide_and_conquer::karatsuba_algorithm::safe_substr(str2, fh, sh, n); // second half of second string
    132
    133 // calculating the three products of inputs of size n/2 recursively
    134 int64_t product1 = karatsuba_algorithm(Xl, Yl);
    @@ -304,7 +292,7 @@ Here is the call graph for this function:
    141 (product3 - product1 - product2) * (1 << sh) +
    142 product2; // combining the three products to get the final result.
    143}
    -
    divide_and_conquer::karatsuba_algorithm::safe_substr
    std::string safe_substr(const std::string &str, int64_t x1, int64_t x2, int64_t n)
    Wrapper function for substr that considers leading zeros.
    Definition karatsuba_algorithm_for_fast_multiplication.cpp:86
    +
    divide_and_conquer::karatsuba_algorithm::safe_substr
    std::string safe_substr(const std::string &str, int64_t x1, int64_t x2, int64_t n)
    Wrapper function for substr that considers leading zeros.
    Definition karatsuba_algorithm_for_fast_multiplication.cpp:86
    karatsuba_algorithm
    Functions for the Karatsuba algorithm for fast multiplication implementation.
    Here is the call graph for this function:
    @@ -323,8 +311,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -333,10 +320,10 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    181 {
    -
    182 test(); // run self-test implementations
    +
    182 test(); // run self-test implementations
    183 return 0;
    184}
    -
    test
    static void test()
    Self-test implementations.
    Definition karatsuba_algorithm_for_fast_multiplication.cpp:151
    +
    test
    static void test()
    Self-test implementations.
    Definition karatsuba_algorithm_for_fast_multiplication.cpp:151
    Here is the call graph for this function:
    @@ -354,31 +341,22 @@ Here is the call graph for this function:
    std::string divide_and_conquer::karatsuba_algorithm::safe_substr ( - const std::string &  - str, + const std::string & str, - int64_t  - x1, + int64_t x1, - int64_t  - x2, + int64_t x2, - int64_t  - n  - - - - ) - + int64_t n )
    @@ -435,7 +413,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -489,7 +467,7 @@ Here is the call graph for this function: diff --git a/da/dd3/namespacespirograph.html b/da/dd3/namespacespirograph.html index ff8d198c2..2c7a56c5e 100644 --- a/da/dd3/namespacespirograph.html +++ b/da/dd3/namespacespirograph.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: spirograph Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,9 +108,9 @@ $(document).ready(function(){initNavTree('da/dd3/namespacespirograph.html','../.

    Functions

    template<std::size_t N> -void spirograph (std::array< std::pair< double, double >, N > *points, double l, double k, double rot) +void spirograph (std::array< std::pair< double, double >, N > *points, double l, double k, double rot)   -void test () +void test ()  Test function to save resulting points to a CSV file.
      @@ -126,31 +128,22 @@ template<void spirograph::spirograph ( - std::array< std::pair< double, double >, N > *  - points, + std::array< std::pair< double, double >, N > * points, - double  - l, + double l, - double  - k, + double k, - double  - rot  - - - - ) - + double rot )
    @@ -222,7 +215,7 @@ Here is the call graph for this function:
    void spirograph::test ( - ) + ) @@ -274,7 +267,7 @@ Here is the call graph for this function: diff --git a/da/dd4/namespacemedian__search.html b/da/dd4/namespacemedian__search.html index 56f25311a..f45949cda 100644 --- a/da/dd4/namespacemedian__search.html +++ b/da/dd4/namespacemedian__search.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: median_search Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('da/dd4/namespacemedian__search.html','

    Functions for Median search algorithm. -More...

    +More...

    Detailed Description

    Functions for Median search algorithm.

    Functions for the Median Search algorithm implementation. Wkipedia link to algorithm: https://en.wikipedia.org/wiki/Median_search.

    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('da/dd4/namespacemedian__search.html',' diff --git a/da/dda/namespaceradix__sort.html b/da/dda/namespaceradix__sort.html index 9e611dd29..866162dd7 100644 --- a/da/dda/namespaceradix__sort.html +++ b/da/dda/namespaceradix__sort.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: radix_sort Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('da/dda/namespaceradix__sort.html','../

    Functions for Radix sort algorithm. -More...

    +More...

    Detailed Description

    Functions for Radix sort algorithm.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('da/dda/namespaceradix__sort.html','../ diff --git a/da/de7/decimal__to__hexadecimal_8cpp.html b/da/de7/decimal__to__hexadecimal_8cpp.html index 7e591f5a3..bee3a1353 100644 --- a/da/de7/decimal__to__hexadecimal_8cpp.html +++ b/da/de7/decimal__to__hexadecimal_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/decimal_to_hexadecimal.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,7 +116,7 @@ Include dependency graph for decimal_to_hexadecimal.cpp:
    - +

    Functions

    int main (void)
    int main (void)
     

    Detailed Description

    @@ -129,8 +131,7 @@ Functions int main ( - void  - ) + void ) @@ -177,7 +178,7 @@ Here is the call graph for this function: diff --git a/da/df2/durand__kerner__roots_8cpp.html b/da/df2/durand__kerner__roots_8cpp.html index 851c5618a..e9296a63c 100644 --- a/da/df2/durand__kerner__roots_8cpp.html +++ b/da/df2/durand__kerner__roots_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/durand_kerner_roots.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -123,7 +125,7 @@ Include dependency graph for durand_kerner_roots.cpp:
    - + @@ -131,19 +133,19 @@ Macros

    Macros

    #define ACCURACY   1e-10
    #define ACCURACY   1e-10
     
    #define MAX_BUFF_SIZE   50
    - + - + - + - + - + - + - +

    Functions

    std::complex< double > poly_function (const std::valarray< double > &coeffs, std::complex< double > x)
    std::complex< double > poly_function (const std::valarray< double > &coeffs, std::complex< double > x)
     
    const char * complex_str (const std::complex< double > &x)
    const char * complex_str (const std::complex< double > &x)
     
    bool check_termination (long double delta)
    bool check_termination (long double delta)
     
    std::pair< uint32_t, double > durand_kerner_algo (const std::valarray< double > &coeffs, std::valarray< std::complex< double > > *roots, bool write_log=false)
    std::pair< uint32_t, double > durand_kerner_algo (const std::valarray< double > &coeffs, std::valarray< std::complex< double > > *roots, bool write_log=false)
     
    void test1 ()
    void test1 ()
     
    void test2 ()
    void test2 ()
     
    int main (int argc, char **argv)
    int main (int argc, char **argv)
     

    Detailed Description

    @@ -188,8 +190,7 @@ approximations" style="pointer-events: none;" width="400" class="inline"/>

    bool check_termination ( - long double  - delta) + long double delta) @@ -205,12 +206,12 @@ approximations" style="pointer-events: none;" width="400" class="inline"/>

    true if termination reached
    91 {
    92 static long double past_delta = INFINITY;
    -
    93 if (std::abs(past_delta - delta) <= ACCURACY || delta < ACCURACY)
    +
    93 if (std::abs(past_delta - delta) <= ACCURACY || delta < ACCURACY)
    94 return true;
    95 past_delta = delta;
    96 return false;
    97}
    -
    ACCURACY
    #define ACCURACY
    Definition durand_kerner_roots.cpp:45
    +
    ACCURACY
    #define ACCURACY
    Definition durand_kerner_roots.cpp:45
    @@ -223,8 +224,7 @@ approximations" style="pointer-events: none;" width="400" class="inline"/>

    const char * complex_str ( - const std::complex< double > &  - x) + const std::complex< double > & x) @@ -264,25 +264,17 @@ Here is the call graph for this function: std::pair< uint32_t, double > durand_kerner_algo ( - const std::valarray< double > &  - coeffs, + const std::valarray< double > & coeffs, - std::valarray< std::complex< double > > *  - roots, + std::valarray< std::complex< double > > * roots, - bool  - write_log = false  - - - - ) - + bool write_log = false )
    @@ -318,11 +310,11 @@ Here is the call graph for this function:
    130 log_file << "avg. correction";
    131 log_file << "\n0,";
    132 for (n = 0; n < roots->size(); n++)
    -
    133 log_file << complex_str((*roots)[n]) << ",";
    +
    133 log_file << complex_str((*roots)[n]) << ",";
    134 }
    135
    136 bool break_loop = false;
    -
    137 while (!check_termination(tol_condition) && iter < INT16_MAX &&
    +
    137 while (!check_termination(tol_condition) && iter < INT16_MAX &&
    138 !break_loop) {
    139 tol_condition = 0;
    140 iter++;
    @@ -339,7 +331,7 @@ Here is the call graph for this function:
    151 continue;
    152
    153 std::complex<double> numerator, denominator;
    -
    154 numerator = poly_function(coeffs, (*roots)[n]);
    +
    154 numerator = poly_function(coeffs, (*roots)[n]);
    155 denominator = 1.0;
    156 for (int i = 0; i < roots->size(); i++)
    157 if (i != n)
    @@ -368,14 +360,14 @@ Here is the call graph for this function:
    180
    181 if (log_file.is_open()) {
    182 for (n = 0; n < roots->size(); n++)
    -
    183 log_file << complex_str((*roots)[n]) << ",";
    +
    183 log_file << complex_str((*roots)[n]) << ",";
    184 }
    185
    186#if defined(DEBUG) || !defined(NDEBUG)
    187 if (iter % 500 == 0) {
    188 std::cout << "Iter: " << iter << "\t";
    189 for (n = 0; n < roots->size(); n++)
    -
    190 std::cout << "\t" << complex_str((*roots)[n]);
    +
    190 std::cout << "\t" << complex_str((*roots)[n]);
    191 std::cout << "\t\tabsolute average change: " << tol_condition
    192 << "\n";
    193 }
    @@ -390,9 +382,9 @@ Here is the call graph for this function: -
    check_termination
    bool check_termination(long double delta)
    Definition durand_kerner_roots.cpp:91
    -
    complex_str
    const char * complex_str(const std::complex< double > &x)
    Definition durand_kerner_roots.cpp:76
    -
    poly_function
    std::complex< double > poly_function(const std::valarray< double > &coeffs, std::complex< double > x)
    Definition durand_kerner_roots.cpp:53
    +
    check_termination
    bool check_termination(long double delta)
    Definition durand_kerner_roots.cpp:91
    +
    complex_str
    const char * complex_str(const std::complex< double > &x)
    Definition durand_kerner_roots.cpp:76
    +
    poly_function
    std::complex< double > poly_function(const std::valarray< double > &coeffs, std::complex< double > x)
    Definition durand_kerner_roots.cpp:53
    std::exit
    T exit(T... args)
    std::ofstream::is_open
    T is_open(T... args)
    std::isinf
    T isinf(T... args)
    @@ -418,19 +410,12 @@ Here is the call graph for this function: int main ( - int  - argc, + int argc, - char **  - argv  - - - - ) - + char ** argv )
    @@ -439,8 +424,8 @@ Here is the call graph for this function:
    285 std::srand(std::time(nullptr));
    286
    287 if (argc < 2) {
    -
    288 test1(); // run tests when no input is provided
    -
    289 test2(); // and skip tests when input polynomial is provided
    +
    288 test1(); // run tests when no input is provided
    +
    289 test2(); // and skip tests when input polynomial is provided
    290 std::cout << "Please pass the coefficients of the polynomial as "
    291 "commandline "
    292 "arguments.\n";
    @@ -478,12 +463,12 @@ Here is the call graph for this function:
    324 }
    325
    326 clock_t end_time, start_time = clock();
    -
    327 auto result = durand_kerner_algo(coeffs, &s0, true);
    +
    327 auto result = durand_kerner_algo(coeffs, &s0, true);
    328 end_time = clock();
    329
    330 std::cout << "\nIterations: " << result.first << "\n";
    331 for (n = 0; n < degree - 1; n++)
    -
    332 std::cout << "\t" << complex_str(s0[n]) << "\n";
    +
    332 std::cout << "\t" << complex_str(s0[n]) << "\n";
    333 std::cout << "absolute average change: " << result.second << "\n";
    334 std::cout << "Time taken: "
    335 << static_cast<double>(end_time - start_time) / CLOCKS_PER_SEC
    @@ -492,9 +477,9 @@ Here is the call graph for this function:
    338 return 0;
    339}
    std::clock
    T clock(T... args)
    -
    test2
    void test2()
    Definition durand_kerner_roots.cpp:242
    -
    test1
    void test1()
    Definition durand_kerner_roots.cpp:207
    -
    durand_kerner_algo
    std::pair< uint32_t, double > durand_kerner_algo(const std::valarray< double > &coeffs, std::valarray< std::complex< double > > *roots, bool write_log=false)
    Definition durand_kerner_roots.cpp:109
    +
    test2
    void test2()
    Definition durand_kerner_roots.cpp:242
    +
    test1
    void test1()
    Definition durand_kerner_roots.cpp:207
    +
    durand_kerner_algo
    std::pair< uint32_t, double > durand_kerner_algo(const std::valarray< double > &coeffs, std::valarray< std::complex< double > > *roots, bool write_log=false)
    Definition durand_kerner_roots.cpp:109
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition fibonacci_sum.cpp:76
    std::rand
    T rand(T... args)
    std::srand
    T srand(T... args)
    @@ -513,19 +498,12 @@ Here is the call graph for this function: std::complex< double > poly_function ( - const std::valarray< double > &  - coeffs, + const std::valarray< double > & coeffs, - std::complex< double >  - x  - - - - ) - + std::complex< double > x )
    @@ -571,7 +549,7 @@ Here is the call graph for this function:
    void test1 ( - ) + ) @@ -592,7 +570,7 @@ Here is the call graph for this function:
    219 roots[n] /= 25.f;
    220 }
    221
    -
    222 auto result = durand_kerner_algo(coeffs, &roots, false);
    +
    222 auto result = durand_kerner_algo(coeffs, &roots, false);
    223
    224 for (int i = 0; i < roots.size(); i++) {
    225 // check if approximations are have < 0.1% error with one of the
    @@ -624,7 +602,7 @@ Here is the call graph for this function: void test2 ( - ) + ) @@ -646,7 +624,7 @@ Here is the call graph for this function:
    255 roots[n] /= 25.f;
    256 }
    257
    -
    258 auto result = durand_kerner_algo(coeffs, &roots, false);
    +
    258 auto result = durand_kerner_algo(coeffs, &roots, false);
    259
    260 for (int i = 0; i < roots.size(); i++) {
    261 // check if approximations are have < 0.1% error with one of the
    @@ -675,7 +653,7 @@ Here is the call graph for this function: diff --git a/da/df3/classmachine__learning_1_1aystar__search_1_1_ay_star_search-members.html b/da/df3/classmachine__learning_1_1aystar__search_1_1_ay_star_search-members.html index 741614d95..0dbf926eb 100644 --- a/da/df3/classmachine__learning_1_1aystar__search_1_1_ay_star_search-members.html +++ b/da/df3/classmachine__learning_1_1aystar__search_1_1_ay_star_search-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -117,7 +119,7 @@ $(document).ready(function(){initNavTree('da/d02/classmachine__learning_1_1aysta diff --git a/da/dfa/structbinary__search__tree_1_1bst__node-members.html b/da/dfa/structbinary__search__tree_1_1bst__node-members.html index 185438680..8a4d04a4a 100644 --- a/da/dfa/structbinary__search__tree_1_1bst__node-members.html +++ b/da/dfa/structbinary__search__tree_1_1bst__node-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('dd/db6/structbinary__search__tree_1_1b diff --git a/db/d01/brent__method__extrema_8cpp.html b/db/d01/brent__method__extrema_8cpp.html index 28aa11e14..de3b118e6 100644 --- a/db/d01/brent__method__extrema_8cpp.html +++ b/db/d01/brent__method__extrema_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/brent_method_extrema.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -123,28 +125,28 @@ Macros #define _USE_MATH_DEFINES  required for MS Visual C++
      -#define EPSILON - system accuracy limit/*#end#*‍/
    +#define EPSILON + system accuracy limit
      - + - + - + - + - +

    Functions

    double get_minima (const std::function< double(double)> &f, double lim_a, double lim_b)
    double get_minima (const std::function< double(double)> &f, double lim_a, double lim_b)
     Get the real root of a function in the given interval.
     
    void test1 ()
    void test1 ()
     Test function to find root for the function \(f(x)= (x-2)^2\) in the interval \([1,5]\)
    Expected result = 2.
     
    void test2 ()
    void test2 ()
     Test function to find root for the function \(f(x)= x^{\frac{1}{x}}\) in the interval \([-2,10]\)
    Expected result: \(e\approx 2.71828182845904509\).
     
    void test3 ()
    void test3 ()
     Test function to find maxima for the function \(f(x)= \cos x\) in the interval \([0,12]\)
    Expected result: \(\pi\approx 3.14159265358979312\).
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -171,8 +173,11 @@ Functions
    std::sqrt
    T sqrt(T... args)
    -

    system accuracy limit/*#end#*‍/

    - +

    system accuracy limit

    +
    23#define EPSILON \
    +
    24 std::sqrt( \
    +
    25 std::numeric_limits<double>::epsilon()) ///< system accuracy limit
    +

    Function Documentation

    @@ -185,25 +190,17 @@ Functions double get_minima ( - const std::function< double(double)> &  - f, + const std::function< double(double)> & f, - double  - lim_a, + double lim_a, - double  - lim_b  - - - - ) - + double lim_b )
    @@ -223,8 +220,8 @@ Functions
    38
    39 if (lim_a > lim_b) {
    40 std::swap(lim_a, lim_b);
    -
    41 } else if (std::abs(lim_a - lim_b) <= EPSILON) {
    -
    42 std::cerr << "Search range must be greater than " << EPSILON << "\n";
    +
    41 } else if (std::abs(lim_a - lim_b) <= EPSILON) {
    +
    42 std::cerr << "Search range must be greater than " << EPSILON << "\n";
    43 return lim_a;
    44 }
    45
    @@ -244,7 +241,7 @@ Functions
    59
    60 do {
    61 mid_point = (lim_a + lim_b) / 2.f;
    -
    62 tolerance = EPSILON * std::abs(x);
    +
    62 tolerance = EPSILON * std::abs(x);
    63 tolerance2 = 2 * tolerance;
    64
    65 if (std::abs(e) > tolerance2) {
    @@ -319,7 +316,7 @@ Functions
    134 return x;
    135}
    -
    EPSILON
    #define EPSILON
    system accuracy limit/*#end#*‍/
    Definition brent_method_extrema.cpp:23
    +
    EPSILON
    #define EPSILON
    system accuracy limit
    Definition brent_method_extrema.cpp:23
    numerical_methods::simpson_method::f
    double f(double x)
    A function f(x) that will be used to test the method.
    Definition composite_simpson_rule.cpp:113
    std::swap
    T swap(T... args)
    @@ -339,8 +336,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -349,18 +345,18 @@ Here is the call graph for this function:
    204 {
    205 std::cout.precision(18);
    206
    -
    207 std::cout << "Computations performed with machine epsilon: " << EPSILON
    +
    207 std::cout << "Computations performed with machine epsilon: " << EPSILON
    208 << "\n";
    209
    -
    210 test1();
    -
    211 test2();
    -
    212 test3();
    +
    210 test1();
    +
    211 test2();
    +
    212 test3();
    213
    214 return 0;
    215}
    -
    test2
    void test2()
    Test function to find root for the function in the interval Expected result: .
    Definition brent_method_extrema.cpp:165
    -
    test1
    void test1()
    Test function to find root for the function in the interval Expected result = 2.
    Definition brent_method_extrema.cpp:143
    -
    test3
    void test3()
    Test function to find maxima for the function in the interval Expected result: .
    Definition brent_method_extrema.cpp:188
    +
    test2
    void test2()
    Test function to find root for the function in the interval Expected result: .
    Definition brent_method_extrema.cpp:165
    +
    test1
    void test1()
    Test function to find root for the function in the interval Expected result = 2.
    Definition brent_method_extrema.cpp:143
    +
    test3
    void test3()
    Test function to find maxima for the function in the interval Expected result: .
    Definition brent_method_extrema.cpp:188
    Here is the call graph for this function:
    @@ -378,7 +374,7 @@ Here is the call graph for this function:
    void test1 ( - ) + ) @@ -394,14 +390,14 @@ Here is the call graph for this function:
    148
    149 std::cout << "Test 1.... ";
    150
    -
    151 double minima = get_minima(f1, -1, 5);
    +
    151 double minima = get_minima(f1, -1, 5);
    152
    153 std::cout << minima << "...";
    154
    -
    155 assert(std::abs(minima - 2) < EPSILON);
    +
    155 assert(std::abs(minima - 2) < EPSILON);
    156 std::cout << "passed\n";
    157}
    -
    get_minima
    double get_minima(const std::function< double(double)> &f, double lim_a, double lim_b)
    Get the real root of a function in the given interval.
    Definition brent_method_extrema.cpp:35
    +
    get_minima
    double get_minima(const std::function< double(double)> &f, double lim_a, double lim_b)
    Get the real root of a function in the given interval.
    Definition brent_method_extrema.cpp:35
    Here is the call graph for this function:
    @@ -420,7 +416,7 @@ Here is the call graph for this function: void test2 ( - ) + ) @@ -437,11 +433,11 @@ Here is the call graph for this function:
    171
    172 std::cout << "Test 2.... ";
    173
    -
    174 double minima = get_minima(func, -2, 5);
    +
    174 double minima = get_minima(func, -2, 5);
    175
    176 std::cout << minima << " (" << M_E << ")...";
    177
    -
    178 assert(std::abs(minima - M_E) < EPSILON);
    +
    178 assert(std::abs(minima - M_E) < EPSILON);
    179 std::cout << "passed\n";
    180}
    std::pow
    T pow(T... args)
    @@ -462,7 +458,7 @@ Here is the call graph for this function: void test3 ( - ) + ) @@ -477,11 +473,11 @@ Here is the call graph for this function:
    192
    193 std::cout << "Test 3.... ";
    194
    -
    195 double minima = get_minima(func, -4, 12);
    +
    195 double minima = get_minima(func, -4, 12);
    196
    197 std::cout << minima << " (" << M_PI << ")...";
    198
    -
    199 assert(std::abs(minima - M_PI) < EPSILON);
    +
    199 assert(std::abs(minima - M_PI) < EPSILON);
    200 std::cout << "passed\n";
    201}
    std::cos
    T cos(T... args)
    @@ -499,7 +495,7 @@ Here is the call graph for this function: diff --git a/db/d03/_s_t-example.html b/db/d03/_s_t-example.html index dac1d47c1..17b1a1795 100644 --- a/db/d03/_s_t-example.html +++ b/db/d03/_s_t-example.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ST + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -109,7 +111,7 @@ $(document).ready(function(){initNavTree('db/d03/_s_t-example.html','../../'); i diff --git a/db/d03/namespacewildcard__matching.html b/db/d03/namespacewildcard__matching.html index 77a3b73a7..83c4cde2d 100644 --- a/db/d03/namespacewildcard__matching.html +++ b/db/d03/namespacewildcard__matching.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: wildcard_matching Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('db/d03/namespacewildcard__matching.htm

    Functions for the Wildcard Matching problem. -More...

    +More...

    Detailed Description

    Functions for the Wildcard Matching problem.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('db/d03/namespacewildcard__matching.htm diff --git a/db/d07/spiral__print_8cpp.html b/db/d07/spiral__print_8cpp.html index c3b2155f2..a0723a471 100644 --- a/db/d07/spiral__print_8cpp.html +++ b/db/d07/spiral__print_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/spiral_print.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,11 +116,11 @@ Include dependency graph for spiral_print.cpp:
    - + - + - +

    Functions

    void genArray (int **a, int r, int c)
    void genArray (int **a, int r, int c)
     
    void spiralPrint (int **a, int r, int c)
    void spiralPrint (int **a, int r, int c)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -133,25 +135,17 @@ Functions void genArray ( - int **  - a, + int ** a, - int  - r, + int r, - int  - c  - - - - ) - + int c )
    @@ -193,8 +187,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -206,16 +199,16 @@ Here is the call graph for this function:
    72 int **a = new int *[r];
    73 for (int i = 0; i < r; i++) a[i] = new int[c];
    74
    -
    75 genArray(a, r, c);
    -
    76 spiralPrint(a, r, c);
    +
    75 genArray(a, r, c);
    +
    76 spiralPrint(a, r, c);
    77
    78 for (int i = 0; i < r; i++) delete[] a[i];
    79 delete[] a;
    80 return 0;
    81}
    -
    spiralPrint
    void spiralPrint(int **a, int r, int c)
    Definition spiral_print.cpp:29
    -
    genArray
    void genArray(int **a, int r, int c)
    Definition spiral_print.cpp:12
    +
    spiralPrint
    void spiralPrint(int **a, int r, int c)
    Definition spiral_print.cpp:29
    +
    genArray
    void genArray(int **a, int r, int c)
    Definition spiral_print.cpp:12
    Here is the call graph for this function:
    @@ -233,25 +226,17 @@ Here is the call graph for this function:
    void spiralPrint ( - int **  - a, + int ** a, - int  - r, + int r, - int  - c  - - - - ) - + int c )
    @@ -314,7 +299,7 @@ Here is the call graph for this function:
    diff --git a/db/d0d/prime__factorization_8cpp.html b/db/d0d/prime__factorization_8cpp.html index ef07dc400..04e2a9c2e 100644 --- a/db/d0d/prime__factorization_8cpp.html +++ b/db/d0d/prime__factorization_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/prime_factorization.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -118,20 +120,20 @@ Include dependency graph for prime_factorization.cpp:
    - + - + - +

    Functions

    void SieveOfEratosthenes (int N)
    void SieveOfEratosthenes (int N)
     
    void prime_factorization (int num)
    void prime_factorization (int num)
     
    int main ()
    int main ()
     
    - + - + - +

    Variables

    bool isprime [1000006]
    bool isprime [1000006]
     
    std::vector< int > prime_numbers
    std::vector< int > prime_numbers
     
    std::vector< std::pair< int, int > > factors
    std::vector< std::pair< int, int > > factors
     

    Detailed Description

    @@ -146,8 +148,7 @@ Variables int main ( - void  - ) + void ) @@ -159,12 +160,12 @@ Variables
    65 std::cout << "Type in a number: ";
    66 std::cin >> num;
    67
    -
    68 SieveOfEratosthenes(num);
    +
    68 SieveOfEratosthenes(num);
    69
    -
    70 prime_factorization(num);
    +
    70 prime_factorization(num);
    71
    72 // Prime factors with their powers in the given number in new line
    -
    73 for (auto it : factors) {
    +
    73 for (auto it : factors) {
    74 std::cout << it.first << " " << it.second << std::endl;
    75 }
    76
    @@ -173,9 +174,9 @@ Variables
    std::endl
    T endl(T... args)
    -
    prime_factorization
    void prime_factorization(int num)
    Definition prime_factorization.cpp:40
    -
    factors
    std::vector< std::pair< int, int > > factors
    Definition prime_factorization.cpp:19
    -
    SieveOfEratosthenes
    void SieveOfEratosthenes(int N)
    Definition prime_factorization.cpp:23
    +
    prime_factorization
    void prime_factorization(int num)
    Definition prime_factorization.cpp:40
    +
    factors
    std::vector< std::pair< int, int > > factors
    Definition prime_factorization.cpp:19
    +
    SieveOfEratosthenes
    void SieveOfEratosthenes(int N)
    Definition prime_factorization.cpp:23
    Here is the call graph for this function:
    @@ -193,8 +194,7 @@ Here is the call graph for this function:
    void prime_factorization ( - int  - num) + int num) @@ -203,7 +203,7 @@ Here is the call graph for this function:
    40 {
    41 int number = num;
    42
    -
    43 for (int i = 0; prime_numbers[i] <= num; i++) {
    +
    43 for (int i = 0; prime_numbers[i] <= num; i++) {
    44 int count = 0;
    45
    46 // termination condition
    @@ -211,17 +211,17 @@ Here is the call graph for this function:
    48 break;
    49 }
    50
    -
    51 while (number % prime_numbers[i] == 0) {
    +
    51 while (number % prime_numbers[i] == 0) {
    52 count++;
    -
    53 number = number / prime_numbers[i];
    +
    53 number = number / prime_numbers[i];
    54 }
    55
    56 if (count)
    -
    57 factors.push_back(std::make_pair(prime_numbers[i], count));
    +
    57 factors.push_back(std::make_pair(prime_numbers[i], count));
    58 }
    59}
    std::make_pair
    T make_pair(T... args)
    -
    prime_numbers
    std::vector< int > prime_numbers
    Definition prime_factorization.cpp:16
    +
    prime_numbers
    std::vector< int > prime_numbers
    Definition prime_factorization.cpp:16
    std::vector::push_back
    T push_back(T... args)
    Here is the call graph for this function:
    @@ -240,8 +240,7 @@ Here is the call graph for this function: void SieveOfEratosthenes ( - int  - N) + int N) @@ -249,22 +248,22 @@ Here is the call graph for this function:

    Calculating prime number upto a given range

    23 {
    24 // initializes the array isprime
    -
    25 memset(isprime, true, sizeof isprime);
    +
    25 memset(isprime, true, sizeof isprime);
    26
    27 for (int i = 2; i <= N; i++) {
    -
    28 if (isprime[i]) {
    -
    29 for (int j = 2 * i; j <= N; j += i) isprime[j] = false;
    +
    28 if (isprime[i]) {
    +
    29 for (int j = 2 * i; j <= N; j += i) isprime[j] = false;
    30 }
    31 }
    32
    33 for (int i = 2; i <= N; i++) {
    -
    34 if (isprime[i])
    -
    35 prime_numbers.push_back(i);
    +
    34 if (isprime[i])
    +
    35 prime_numbers.push_back(i);
    36 }
    37}
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:47
    std::memset
    T memset(T... args)
    -
    isprime
    bool isprime[1000006]
    Definition prime_factorization.cpp:13
    +
    isprime
    bool isprime[1000006]
    Definition prime_factorization.cpp:13
    Here is the call graph for this function:
    @@ -325,7 +324,7 @@ Here is the call graph for this function:
    diff --git a/db/d16/0__1__knapsack_8cpp.html b/db/d16/0__1__knapsack_8cpp.html index e38d900f8..21b7c0b93 100644 --- a/db/d16/0__1__knapsack_8cpp.html +++ b/db/d16/0__1__knapsack_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/0_1_knapsack.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,13 +130,13 @@ Namespaces

    Functions

    template<size_t n> -int dynamic_programming::knapsack::maxKnapsackValue (const int capacity, const std::array< int, n > &weight, const std::array< int, n > &value) +int dynamic_programming::knapsack::maxKnapsackValue (const int capacity, const std::array< int, n > &weight, const std::array< int, n > &value)  Picking up all those items whose combined weight is below the given capacity and calculating the value of those picked items. Trying all possible combinations will yield the maximum knapsack value.
      -static void test () +static void test ()  Function to test the above algorithm.
      -int main () +int main ()  Main function.
      @@ -157,8 +159,7 @@ Algorithm int main ( - void  - ) + void ) @@ -168,10 +169,10 @@ Algorithm
    Returns
    0 on exit
    126 {
    127 // Testing
    -
    128 test();
    +
    128 test();
    129 return 0;
    130}
    -
    test
    static void test()
    Function to test the above algorithm.
    Definition 0_1_knapsack.cpp:96
    +
    test
    static void test()
    Function to test the above algorithm.
    Definition 0_1_knapsack.cpp:96
    Here is the call graph for this function:
    @@ -191,25 +192,17 @@ template<size_t n>
    int dynamic_programming::knapsack::maxKnapsackValue ( - const int  - capacity, + const int capacity, - const std::array< int, n > &  - weight, + const std::array< int, n > & weight, - const std::array< int, n > &  - value  - - - - ) - + const std::array< int, n > & value )
    @@ -289,7 +282,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -308,7 +301,7 @@ Here is the call graph for this function:
    99 std::array<int, n1> weight1 = {10, 20, 30}; // weight of each item
    100 std::array<int, n1> value1 = {60, 100, 120}; // value of each item
    101 const int capacity1 = 50; // capacity of carrying bag
    -
    102 const int max_value1 = dynamic_programming::knapsack::maxKnapsackValue(
    +
    102 const int max_value1 = dynamic_programming::knapsack::maxKnapsackValue(
    103 capacity1, weight1, value1);
    104 const int expected_max_value1 = 220;
    105 assert(max_value1 == expected_max_value1);
    @@ -320,14 +313,14 @@ Here is the call graph for this function:
    111 std::array<int, n2> weight2 = {24, 10, 10, 7}; // weight of each item
    112 std::array<int, n2> value2 = {24, 18, 18, 10}; // value of each item
    113 const int capacity2 = 25; // capacity of carrying bag
    -
    114 const int max_value2 = dynamic_programming::knapsack::maxKnapsackValue(
    +
    114 const int max_value2 = dynamic_programming::knapsack::maxKnapsackValue(
    115 capacity2, weight2, value2);
    116 const int expected_max_value2 = 36;
    117 assert(max_value2 == expected_max_value2);
    118 std::cout << "Maximum Knapsack value with " << n2 << " items is "
    119 << max_value2 << std::endl;
    120}
    -
    dynamic_programming::knapsack::maxKnapsackValue
    int maxKnapsackValue(const int capacity, const std::array< int, n > &weight, const std::array< int, n > &value)
    Picking up all those items whose combined weight is below the given capacity and calculating the valu...
    Definition 0_1_knapsack.cpp:51
    +
    dynamic_programming::knapsack::maxKnapsackValue
    int maxKnapsackValue(const int capacity, const std::array< int, n > &weight, const std::array< int, n > &value)
    Picking up all those items whose combined weight is below the given capacity and calculating the valu...
    Definition 0_1_knapsack.cpp:51
    std::endl
    T endl(T... args)
    @@ -345,7 +338,7 @@ Here is the call graph for this function: diff --git a/db/d19/structlinear__probing_1_1_entry.html b/db/d19/structlinear__probing_1_1_entry.html index 80b94e48b..13509ada7 100644 --- a/db/d19/structlinear__probing_1_1_entry.html +++ b/db/d19/structlinear__probing_1_1_entry.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: linear_probing::Entry Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -108,7 +110,7 @@ $(document).ready(function(){initNavTree('db/d19/structlinear__probing_1_1_entry

    Public Member Functions

    - Entry (int key=notPresent) + Entry (int key=notPresent)  constructor
      @@ -130,7 +132,7 @@ int  diff --git a/db/d1e/classgraph_1_1_graph-members.html b/db/d1e/classgraph_1_1_graph-members.html index 04ff40e7f..c3fa9ea39 100644 --- a/db/d1e/classgraph_1_1_graph-members.html +++ b/db/d1e/classgraph_1_1_graph-members.html @@ -3,16 +3,18 @@ - +Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    key
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,7 +117,7 @@ $(document).ready(function(){initNavTree('dc/d61/classgraph_1_1_graph.html','../ diff --git a/db/d27/n__bonacci_8cpp.html b/db/d27/n__bonacci_8cpp.html index 242b9bff9..e909ba9a1 100644 --- a/db/d27/n__bonacci_8cpp.html +++ b/db/d27/n__bonacci_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/n_bonacci.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,13 +128,13 @@ Namespaces - + - + - +

    Functions

    std::vector< uint64_t > math::n_bonacci::N_bonacci (const uint64_t &n, const uint64_t &m)
    std::vector< uint64_t > math::n_bonacci::N_bonacci (const uint64_t &n, const uint64_t &m)
     Finds the N-Bonacci series for the n parameter value and m parameter terms.
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -151,8 +153,7 @@ Functions int main ( - void  - ) + void ) @@ -161,10 +162,10 @@ Functions

    Main function.

    Returns
    0 on exit
    104 {
    -
    105 test(); // run self-test implementations
    +
    105 test(); // run self-test implementations
    106 return 0;
    107}
    -
    test
    static void test()
    Self-test implementations.
    Definition n_bonacci.cpp:69
    +
    test
    static void test()
    Self-test implementations.
    Definition n_bonacci.cpp:69
    Here is the call graph for this function:
    @@ -182,19 +183,12 @@ Here is the call graph for this function:
    std::vector< uint64_t > math::n_bonacci::N_bonacci ( - const uint64_t &  - n, + const uint64_t & n, - const uint64_t &  - m  - - - - ) - + const uint64_t & m )
    @@ -253,7 +247,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -315,7 +309,7 @@ Here is the call graph for this function: diff --git a/db/d32/structdata__structures_1_1sparse__table_1_1_sparse__table-members.html b/db/d32/structdata__structures_1_1sparse__table_1_1_sparse__table-members.html index efaae1b93..fd95aa916 100644 --- a/db/d32/structdata__structures_1_1sparse__table_1_1_sparse__table-members.html +++ b/db/d32/structdata__structures_1_1sparse__table_1_1_sparse__table-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,7 +115,7 @@ $(document).ready(function(){initNavTree('da/d37/structdata__structures_1_1spars diff --git a/db/d3c/tower__of__hanoi_8cpp.html b/db/d3c/tower__of__hanoi_8cpp.html index 5802abdab..b4852cb13 100644 --- a/db/d3c/tower__of__hanoi_8cpp.html +++ b/db/d3c/tower__of__hanoi_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/tower_of_hanoi.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -120,13 +122,13 @@ Classes - + - + - + - +

    Functions

    void show (const struct tower *const F, const struct tower *const T, const struct tower *const U)
    void show (const struct tower *const F, const struct tower *const T, const struct tower *const U)
     
    void mov (tower *From, tower *To)
    void mov (tower *From, tower *To)
     
    void TH (int n, tower *From, tower *Using, tower *To)
    void TH (int n, tower *From, tower *Using, tower *To)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -141,8 +143,7 @@ Functions int main ( - void  - ) + void ) @@ -165,7 +166,7 @@ Functions
    79 }
    80
    81 show(&F, &T, &U);
    -
    82 TH(no, &F, &U, &T);
    +
    82 TH(no, &F, &U, &T);
    83
    84 return 0;
    85}
    @@ -173,7 +174,7 @@ Functions
    tower
    Definition tower_of_hanoi.cpp:11
    tower::top
    int top
    top tower ID
    Definition tower_of_hanoi.cpp:15
    -
    TH
    void TH(int n, tower *From, tower *Using, tower *To)
    Definition tower_of_hanoi.cpp:52
    +
    TH
    void TH(int n, tower *From, tower *Using, tower *To)
    Definition tower_of_hanoi.cpp:52
    Here is the call graph for this function:
    @@ -191,19 +192,12 @@ Here is the call graph for this function:
    void mov ( - tower *  - From, + tower * From, - tower *  - To  - - - - ) - + tower * To )
    @@ -232,25 +226,17 @@ Here is the call graph for this function:
    void show ( - const struct tower *const  - F, + const struct tower *const F, - const struct tower *const  - T, + const struct tower *const T, - const struct tower *const  - U  - - - - ) - + const struct tower *const U )
    @@ -281,31 +267,22 @@ Here is the call graph for this function:
    void TH ( - int  - n, + int n, - tower *  - From, + tower * From, - tower *  - Using, + tower * Using, - tower *  - To  - - - - ) - + tower * To )
    @@ -320,16 +297,16 @@ Here is the call graph for this function:
    52 {
    53 if (n == 1) {
    -
    54 mov(From, To);
    +
    54 mov(From, To);
    55 show(From, To, Using);
    56 } else {
    -
    57 TH(n - 1, From, To, Using);
    -
    58 mov(From, To);
    +
    57 TH(n - 1, From, To, Using);
    +
    58 mov(From, To);
    59 show(From, To, Using);
    -
    60 TH(n - 1, Using, From, To);
    +
    60 TH(n - 1, Using, From, To);
    61 }
    62}
    -
    mov
    void mov(tower *From, tower *To)
    Definition tower_of_hanoi.cpp:39
    +
    mov
    void mov(tower *From, tower *To)
    Definition tower_of_hanoi.cpp:39
    Here is the call graph for this function:
    @@ -344,7 +321,7 @@ Here is the call graph for this function:
    diff --git a/db/d3f/wave__sort_8cpp.html b/db/d3f/wave__sort_8cpp.html index 5f89b98d5..80d244dfd 100644 --- a/db/d3f/wave__sort_8cpp.html +++ b/db/d3f/wave__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/wave_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,13 +130,13 @@ Namespaces

    Functions

    template<typename T > -std::vector< T > sorting::wave_sort::waveSort (const std::vector< T > &in_arr, int64_t n) +std::vector< T > sorting::wave_sort::waveSort (const std::vector< T > &in_arr, int64_t n)  The main function implements that implements the Wave Sort algorithm.
      -static void test () +static void test ()  Self-test implementations.
      -int main () +int main ()  Main function.
      @@ -151,8 +153,7 @@ Functions int main ( - void  - ) + void ) @@ -161,10 +162,10 @@ Functions

    Main function.

    Returns
    0 on exit
    91 {
    -
    92 test(); // run self-test implementations
    +
    92 test(); // run self-test implementations
    93 return 0;
    94}
    -
    test
    static void test()
    Self-test implementations.
    Definition wave_sort.cpp:53
    +
    test
    static void test()
    Self-test implementations.
    Definition wave_sort.cpp:53
    Here is the call graph for this function:
    @@ -185,7 +186,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -202,7 +203,7 @@ Here is the call graph for this function:
    54 // [10, 90, 49, 2, 1, 5, 23] return [2, 1, 10, 5, 49, 23, 90]
    55 std::vector<int64_t> array1 = {10, 90, 49, 2, 1, 5, 23};
    56 std::cout << "Test 1... ";
    -
    57 std::vector<int64_t> arr1 = sorting::wave_sort::waveSort(array1, 7);
    +
    57 std::vector<int64_t> arr1 = sorting::wave_sort::waveSort(array1, 7);
    58 const std::vector<int64_t> o1 = {2, 1, 10, 5, 49, 23, 90};
    59 assert(arr1 == o1);
    60 std::cout << "passed" << std::endl;
    @@ -210,7 +211,7 @@ Here is the call graph for this function:
    62 // [1, 3, 4, 2, 7, 8] return [2, 1, 4, 3, 8, 7]
    63 std::vector<int64_t> array2 = {1, 3, 4, 2, 7, 8};
    64 std::cout << "Test 2... ";
    -
    65 std::vector<int64_t> arr2 = sorting::wave_sort::waveSort(array2, 6);
    +
    65 std::vector<int64_t> arr2 = sorting::wave_sort::waveSort(array2, 6);
    66 const std::vector<int64_t> o2 = {2, 1, 4, 3, 8, 7};
    67 assert(arr2 == o2);
    68 std::cout << "passed" << std::endl;
    @@ -218,7 +219,7 @@ Here is the call graph for this function:
    70 // [3, 3, 3, 3] return [3, 3, 3, 3]
    71 std::vector<int64_t> array3 = {3, 3, 3, 3};
    72 std::cout << "Test 3... ";
    -
    73 std::vector<int64_t> arr3 = sorting::wave_sort::waveSort(array3, 4);
    +
    73 std::vector<int64_t> arr3 = sorting::wave_sort::waveSort(array3, 4);
    74 const std::vector<int64_t> o3 = {3, 3, 3, 3};
    75 assert(arr3 == o3);
    76 std::cout << "passed" << std::endl;
    @@ -226,7 +227,7 @@ Here is the call graph for this function:
    78 // [9, 4, 6, 8, 14, 3] return [4, 3, 8, 6, 14, 9]
    79 std::vector<int64_t> array4 = {9, 4, 6, 8, 14, 3};
    80 std::cout << "Test 4... ";
    -
    81 std::vector<int64_t> arr4 = sorting::wave_sort::waveSort(array4, 6);
    +
    81 std::vector<int64_t> arr4 = sorting::wave_sort::waveSort(array4, 6);
    82 const std::vector<int64_t> o4 = {4, 3, 8, 6, 14, 9};
    83 assert(arr4 == o4);
    84 std::cout << "passed" << std::endl;
    @@ -234,7 +235,7 @@ Here is the call graph for this function:
    std::endl
    T endl(T... args)
    -
    sorting::wave_sort::waveSort
    std::vector< T > waveSort(const std::vector< T > &in_arr, int64_t n)
    The main function implements that implements the Wave Sort algorithm.
    Definition wave_sort.cpp:34
    +
    sorting::wave_sort::waveSort
    std::vector< T > waveSort(const std::vector< T > &in_arr, int64_t n)
    The main function implements that implements the Wave Sort algorithm.
    Definition wave_sort.cpp:34
    Here is the call graph for this function:
    @@ -254,19 +255,12 @@ template<typename T >
    std::vector< T > sorting::wave_sort::waveSort ( - const std::vector< T > &  - in_arr, + const std::vector< T > & in_arr, - int64_t  - n  - - - - ) - + int64_t n )
    @@ -313,7 +307,7 @@ Here is the call graph for this function:
    diff --git a/db/d40/integral__approximation2_8cpp.html b/db/d40/integral__approximation2_8cpp.html index f3c5d019d..b4ac7950f 100644 --- a/db/d40/integral__approximation2_8cpp.html +++ b/db/d40/integral__approximation2_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/integral_approximation2.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -132,22 +134,21 @@ Namespaces - - + +

    Typedefs

    -using math::monte_carlo::Function = std::function< double(double &)>
     
    using math::monte_carlo::Function
     
    - + - + - + - +

    Functions

    std::vector< double > math::monte_carlo::generate_samples (const double &start_point, const Function &pdf, const uint32_t &num_samples, const uint32_t &discard=100000)
    std::vector< double > math::monte_carlo::generate_samples (const double &start_point, const Function &pdf, const uint32_t &num_samples, const uint32_t &discard=100000)
     short-hand for std::functions used in this implementation
     
    double math::monte_carlo::integral_monte_carlo (const double &start_point, const Function &function, const Function &pdf, const uint32_t &num_samples=1000000)
    double math::monte_carlo::integral_monte_carlo (const double &start_point, const Function &function, const Function &pdf, const uint32_t &num_samples=1000000)
     Compute an approximation of an integral using Monte Carlo integration.
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -156,7 +157,25 @@ Functions

    In mathematics, Monte Carlo integration is a technique for numerical integration using random numbers. It is a particular Monte Carlo method that numerically computes a definite integral. While other algorithms usually evaluate the integrand at a regular grid, Monte Carlo randomly chooses points at which the integrand is evaluated. This method is particularly useful for higher-dimensional integrals.

    This implementation supports arbitrary pdfs. These pdfs are sampled using the Metropolis-Hastings algorithm. This can be swapped out by every other sampling techniques for example the inverse method. Metropolis-Hastings was chosen because it is the most general and can also be extended for a higher dimensional sampling space.

    Author
    Domenic Zingsheim
    -

    Function Documentation

    +

    Typedef Documentation

    + +

    ◆ Function

    + +
    +
    + + + + +
    using math::monte_carlo::Function
    +
    +Initial value:
    std::function<double(
    +
    double&)>
    + +
    +
    +
    +

    Function Documentation

    ◆ generate_samples()

    @@ -166,31 +185,22 @@ Functions std::vector< double > math::monte_carlo::generate_samples ( - const double &  - start_point, + const double & start_point, - const Function &  - pdf, + const Function & pdf, - const uint32_t &  - num_samples, + const uint32_t & num_samples, - const uint32_t &  - discard = 100000  - - - - ) - + const uint32_t & discard = 100000 )
    @@ -262,31 +272,22 @@ Here is the call graph for this function:
    double math::monte_carlo::integral_monte_carlo ( - const double &  - start_point, + const double & start_point, - const Function &  - function, + const Function & function, - const Function &  - pdf, + const Function & pdf, - const uint32_t &  - num_samples = 1000000  - - - - ) - + const uint32_t & num_samples = 1000000 )
    @@ -305,7 +306,7 @@ Here is the call graph for this function:
    114 {
    115 double integral = 0.0;
    116 std::vector<double> samples =
    -
    117 generate_samples(start_point, pdf, num_samples);
    +
    117 generate_samples(start_point, pdf, num_samples);
    118
    119 for (double sample : samples) {
    120 integral += function(sample) / pdf(sample);
    @@ -313,7 +314,7 @@ Here is the call graph for this function:
    122
    123 return integral / static_cast<double>(samples.size());
    124}
    -
    math::monte_carlo::generate_samples
    std::vector< double > generate_samples(const double &start_point, const Function &pdf, const uint32_t &num_samples, const uint32_t &discard=100000)
    short-hand for std::functions used in this implementation
    Definition integral_approximation2.cpp:64
    +
    math::monte_carlo::generate_samples
    std::vector< double > generate_samples(const double &start_point, const Function &pdf, const uint32_t &num_samples, const uint32_t &discard=100000)
    short-hand for std::functions used in this implementation
    Definition integral_approximation2.cpp:64
    std::vector::size
    T size(T... args)
    Here is the call graph for this function:
    @@ -332,8 +333,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -342,10 +342,10 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    215 {
    -
    216 test(); // run self-test implementations
    +
    216 test(); // run self-test implementations
    217 return 0;
    218}
    -
    test
    static void test()
    Self-test implementations.
    Definition integral_approximation2.cpp:133
    +
    test
    static void test()
    Self-test implementations.
    Definition integral_approximation2.cpp:133
    Here is the call graph for this function:
    @@ -366,7 +366,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -411,7 +411,7 @@ Here is the call graph for this function:
    162 return 0.0;
    163 };
    164
    -
    165 integral = math::monte_carlo::integral_monte_carlo(
    +
    165 integral = math::monte_carlo::integral_monte_carlo(
    166 (upper_bound - lower_bound) / 2.0, f, pdf);
    167
    168 std::cout << "This number should be close to 10.666666: " << integral
    @@ -435,7 +435,7 @@ Here is the call graph for this function:
    186 return 0.0;
    187 };
    188
    -
    189 integral = math::monte_carlo::integral_monte_carlo(
    +
    189 integral = math::monte_carlo::integral_monte_carlo(
    190 (upper_bound - lower_bound) / 2.0, f, pdf);
    191
    192 std::cout << "This number should be close to 1.7182818: " << integral
    @@ -451,7 +451,7 @@ Here is the call graph for this function:
    202 return 1.0 / std::sqrt(2.0 * M_PI) * std::exp(-x * x / 2.0);
    203 };
    204
    -
    205 integral = math::monte_carlo::integral_monte_carlo(0.0, f, pdf, 10000000);
    +
    205 integral = math::monte_carlo::integral_monte_carlo(0.0, f, pdf, 10000000);
    206
    207 std::cout << "This number should be close to 1.0: " << integral
    208 << std::endl;
    @@ -460,8 +460,7 @@ Here is the call graph for this function:
    numerical_methods::simpson_method::f
    double f(double x)
    A function f(x) that will be used to test the method.
    Definition composite_simpson_rule.cpp:113
    std::endl
    T endl(T... args)
    std::exp
    T exp(T... args)
    - -
    math::monte_carlo::integral_monte_carlo
    double integral_monte_carlo(const double &start_point, const Function &function, const Function &pdf, const uint32_t &num_samples=1000000)
    Compute an approximation of an integral using Monte Carlo integration.
    Definition integral_approximation2.cpp:112
    +
    math::monte_carlo::integral_monte_carlo
    double integral_monte_carlo(const double &start_point, const Function &function, const Function &pdf, const uint32_t &num_samples=1000000)
    Compute an approximation of an integral using Monte Carlo integration.
    Definition integral_approximation2.cpp:112
    std::lower_bound
    T lower_bound(T... args)
    std::sin
    T sin(T... args)
    std::sqrt
    T sqrt(T... args)
    @@ -480,7 +479,7 @@ Here is the call graph for this function: diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html index 6414e53b4..eb9aa4c90 100644 --- a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html +++ b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures::stack_using_queue::Stack Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('db/d5b/structdata__structures_1_1stack

    Stack Class implementation for basic methods of Stack Data Structure. - More...

    + More...

    Collaboration diagram for data_structures::stack_using_queue::Stack:
    @@ -115,15 +117,15 @@ Collaboration diagram for data_structures::stack_using_queue::Stack:
    - + - + - + - +

    Public Member Functions

    int top ()
    int top ()
     
    void push (int val)
    void push (int val)
     Inserts an element to the top of the stack.
     
    void pop ()
    void pop ()
     Removes the topmost element from the stack.
     
    int size ()
    int size ()
     Utility function to return the current size of the stack.
     
    @@ -133,7 +135,7 @@ Public Attributesstd::queue< int64_t >  - + @@ -155,7 +157,7 @@ uint32_t  - +
    main_q
     stores the current state of the stack
     
    std::queue< int64_t > auxiliary_q
    std::queue< int64_t > auxiliary_q
     
    uint32_t current_size = 0
    current_size
    void data_structures::stack_using_queue::Stack::pop ())
    @@ -169,16 +171,16 @@ uint32_t current_size

    Removes the topmost element from the stack.

    Returns
    void
    61 {
    -
    62 if (main_q.empty()) {
    +
    62 if (main_q.empty()) {
    63 return;
    64 }
    -
    65 main_q.pop();
    -
    66 current_size--;
    +
    65 main_q.pop();
    +
    66 current_size--;
    67 }
    std::queue::empty
    T empty(T... args)
    std::queue::pop
    T pop(T... args)
    -
    data_structures::stack_using_queue::Stack::main_q
    std::queue< int64_t > main_q
    stores the current state of the stack
    Definition stack_using_queue.cpp:31
    -
    data_structures::stack_using_queue::Stack::current_size
    uint32_t current_size
    stores the current size of the stack
    Definition stack_using_queue.cpp:34
    +
    data_structures::stack_using_queue::Stack::main_q
    std::queue< int64_t > main_q
    stores the current state of the stack
    Definition stack_using_queue.cpp:31
    +
    data_structures::stack_using_queue::Stack::current_size
    uint32_t current_size
    stores the current size of the stack
    Definition stack_using_queue.cpp:34
    Here is the call graph for this function:
    @@ -199,8 +201,7 @@ Here is the call graph for this function:
    void data_structures::stack_using_queue::Stack::push ( - int  - val) + int val) @@ -220,17 +221,17 @@ Here is the call graph for this function:
    Returns
    void
    47 {
    -
    48 auxiliary_q.push(val);
    -
    49 while (!main_q.empty()) {
    -
    50 auxiliary_q.push(main_q.front());
    -
    51 main_q.pop();
    +
    48 auxiliary_q.push(val);
    +
    49 while (!main_q.empty()) {
    +
    50 auxiliary_q.push(main_q.front());
    +
    51 main_q.pop();
    52 }
    -
    53 swap(main_q, auxiliary_q);
    -
    54 current_size++;
    +
    53 swap(main_q, auxiliary_q);
    +
    54 current_size++;
    55 }
    std::queue::front
    T front(T... args)
    std::queue::push
    T push(T... args)
    -
    data_structures::stack_using_queue::Stack::auxiliary_q
    std::queue< int64_t > auxiliary_q
    Definition stack_using_queue.cpp:32
    +
    data_structures::stack_using_queue::Stack::auxiliary_q
    std::queue< int64_t > auxiliary_q
    Definition stack_using_queue.cpp:32
    std::swap
    T swap(T... args)
    Here is the call graph for this function:
    @@ -252,7 +253,7 @@ Here is the call graph for this function:
    int data_structures::stack_using_queue::Stack::size ( - ) + ) @@ -265,7 +266,7 @@ Here is the call graph for this function:

    Utility function to return the current size of the stack.

    Returns
    current size of stack
    -
    73{ return current_size; }
    +
    73{ return current_size; }
    @@ -281,7 +282,7 @@ Here is the call graph for this function: int data_structures::stack_using_queue::Stack::top ( - ) + ) @@ -292,7 +293,7 @@ Here is the call graph for this function:

    Returns the top most element of the stack

    Returns
    top element of the queue
    -
    40{ return main_q.front(); }
    +
    40{ return main_q.front(); }
    Here is the call graph for this function:
    @@ -326,7 +327,7 @@ Here is the call graph for this function:
    diff --git a/db/d62/class_easter_year_month_day-members.html b/db/d62/class_easter_year_month_day-members.html index a6862ee15..f383d1b91 100644 --- a/db/d62/class_easter_year_month_day-members.html +++ b/db/d62/class_easter_year_month_day-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('d1/df6/class_easter_year_month_day.htm diff --git a/db/d66/struct_item.html b/db/d66/struct_item.html index 7454514bd..06c9f62b1 100644 --- a/db/d66/struct_item.html +++ b/db/d66/struct_item.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Item Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -122,7 +124,7 @@ int profit diff --git a/db/d6b/kelvin__to__celsius_8cpp.html b/db/d6b/kelvin__to__celsius_8cpp.html index fcea34380..f2a4cef4c 100644 --- a/db/d6b/kelvin__to__celsius_8cpp.html +++ b/db/d6b/kelvin__to__celsius_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/kelvin_to_celsius.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -129,10 +131,10 @@ Functions double others::kelvin_to_celsius (double temperature_in_k)  Conversion from Kelvin to Celsius algorithm.
      -static void tests () +static void tests ()  Self-test implementations.
      -int main () +int main ()  Main function.
      @@ -156,8 +158,7 @@ Functions int main ( - void  - ) + void ) @@ -166,10 +167,10 @@ Functions

    Main function.

    Returns
    0 on exit
    78 {
    -
    79 tests(); // run self-test implementations
    +
    79 tests(); // run self-test implementations
    80 return 0;
    81}
    -
    tests
    static void tests()
    Self-test implementations.
    Definition kelvin_to_celsius.cpp:62
    +
    tests
    static void tests()
    Self-test implementations.
    Definition kelvin_to_celsius.cpp:62
    Here is the call graph for this function:
    @@ -190,7 +191,7 @@ Here is the call graph for this function:
    static void tests ( - ) + ) @@ -231,7 +232,7 @@ Here is the call graph for this function:
    diff --git a/db/d6f/namespaceheavy__light__decomposition.html b/db/d6f/namespaceheavy__light__decomposition.html index 8c5952f4e..579293132 100644 --- a/db/d6f/namespaceheavy__light__decomposition.html +++ b/db/d6f/namespaceheavy__light__decomposition.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: heavy_light_decomposition Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('db/d6f/namespaceheavy__light__decompos

    Heavy light decomposition algorithm. -More...

    +More...

    Detailed Description

    Heavy light decomposition algorithm.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('db/d6f/namespaceheavy__light__decompos diff --git a/db/d71/quadratic__probing__hash__table_8cpp.html b/db/d71/quadratic__probing__hash__table_8cpp.html index de8a2fddc..bdd398605 100644 --- a/db/d71/quadratic__probing__hash__table_8cpp.html +++ b/db/d71/quadratic__probing__hash__table_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: hashing/quadratic_probing_hash_table.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -131,9 +133,9 @@ Namespaces - - + +

    Typedefs

    -using quadratic_probing::Entry = Entry
     
    +using quadratic_probing::Entry = struct Entry
     
    @@ -159,7 +161,7 @@ Functions - +

    Functions

     
    void quadratic_probing::removalInfo (int key)
     
    int main ()
    int main ()
     
    - - +

    @@ -199,8 +201,7 @@ bool 

    		quadratic_probing::re
    int main (void )void )
    @@ -288,7 +289,7 @@ Here is the call graph for this function:
    diff --git a/db/d82/classlarge__number.html b/db/d82/classlarge__number.html index 183e2677f..fcef7022c 100644 --- a/db/d82/classlarge__number.html +++ b/db/d82/classlarge__number.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: large_number Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -117,66 +119,66 @@ Collaboration diagram for large_number:
    - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - +

    Public Member Functions

     large_number ()
     large_number ()
     
     large_number (int n)
     large_number (int n)
     
     large_number (const large_number &a)
     large_number (const large_number &a)
     
     large_number (std::vector< unsigned char > &vec)
     large_number (std::vector< unsigned char > &vec)
     
     large_number (char const *number_str)
     large_number (char const *number_str)
     
    void add_digit (unsigned int value)
    void add_digit (unsigned int value)
     
    size_t num_digits () const
    size_t num_digits () const
     
    unsigned char & operator[] (size_t n)
    unsigned char & operator[] (size_t n)
     
    const unsigned char & operator[] (size_t n) const
    const unsigned char & operator[] (size_t n) const
     
    large_number & operator++ ()
    large_number & operator++ ()
     
    large_number & operator++ (int)
    large_number & operator++ (int)
     
    large_number & operator+= (large_number n)
    large_number & operator+= (large_number n)
     
    large_number & operator+= (int n)
    large_number & operator+= (int n)
     
    large_number & operator= (const large_number &b)
    large_number & operator= (const large_number &b)
     
    template<class T >
    large_number & operator*= (const T n)
    large_number & operator*= (const T n)
     
    char digit_char (size_t i) const
    char digit_char (size_t i) const
     
    - +

    Static Public Member Functions

    static bool test ()
    static bool test ()
     
    - +

    Private Member Functions

    template<class T >
    void multiply (const T n)
    void multiply (const T n)
     
    - +

    Private Attributes

    std::vector< unsigned char > _digits
    std::vector< unsigned char > _digits
     
    - + - + - + - +

    Friends

    std::ostream & operator<< (std::ostream &out, const large_number &a)
    std::ostream & operator<< (std::ostream &out, const large_number &a)
     
    bool operator== (large_number const &a, large_number const &b)
    bool operator== (large_number const &a, large_number const &b)
     
    bool operator!= (large_number const &a, large_number const &b)
    bool operator!= (large_number const &a, large_number const &b)
     
    template<class T >
    large_number & operator+ (const large_number &a, const T &b)
    large_number & operator+ (const large_number &a, const T &b)
     

    Detailed Description

    @@ -194,7 +196,7 @@ Friends large_number::large_number ( - ) + ) @@ -205,8 +207,8 @@ Friends

    < initializer with value = 1

    -
    27{ _digits.push_back(1); }
    -
    large_number::_digits
    std::vector< unsigned char > _digits
    Definition large_number.h:285
    +
    27{ _digits.push_back(1); }
    +
    large_number::_digits
    std::vector< unsigned char > _digits
    Definition large_number.h:285
    std::vector::push_back
    T push_back(T... args)
    Here is the call graph for this function:
    @@ -228,8 +230,7 @@ Here is the call graph for this function:
    large_number::large_number ( - int  - n) + int n) @@ -260,8 +261,7 @@ Here is the call graph for this function:
    large_number::large_number ( - const large_number &  - a) + const large_number & a) @@ -287,8 +287,7 @@ Here is the call graph for this function: large_number::large_number ( - std::vector< unsigned char > &  - vec) + std::vector< unsigned char > & vec) @@ -314,8 +313,7 @@ Here is the call graph for this function: large_number::large_number ( - char const *  - number_str) + char const * number_str) @@ -329,7 +327,7 @@ Here is the call graph for this function:
    55 for (size_t i = strlen(number_str); i > 0; i--) {
    56 char a = number_str[i - 1] - '0';
    57 if (a >= 0 && a <= 9)
    -
    58 _digits.push_back(a);
    +
    58 _digits.push_back(a);
    59 }
    60 }
    std::strlen
    T strlen(T... args)
    @@ -349,8 +347,7 @@ Here is the call graph for this function: void large_number::add_digit ( - unsigned int  - value) + unsigned int value) @@ -367,7 +364,7 @@ Here is the call graph for this function:
    121 exit(EXIT_FAILURE);
    122 }
    123
    -
    124 _digits.push_back(value);
    +
    124 _digits.push_back(value);
    125 }
    std::exit
    T exit(T... args)
    @@ -391,8 +388,7 @@ Here is the call graph for this function: char large_number::digit_char ( - size_t  - i) + size_t i) const @@ -404,9 +400,9 @@ Here is the call graph for this function:

    returns i^th digit as an ASCII character

    248 {
    -
    249 return _digits[num_digits() - i - 1] + '0';
    +
    249 return _digits[num_digits() - i - 1] + '0';
    250 }
    -
    large_number::num_digits
    size_t num_digits() const
    Definition large_number.h:130
    +
    large_number::num_digits
    size_t num_digits() const
    Definition large_number.h:130
    Here is the call graph for this function:
    @@ -429,8 +425,7 @@ template<class T >
    void large_number::multiply ( - const T  - n) + const T n) @@ -449,7 +444,7 @@ template<class T >
    263
    264 size_t i;
    265 uint64_t carry = 0, temp;
    -
    266 for (i = 0; i < this->num_digits(); i++) {
    +
    266 for (i = 0; i < this->num_digits(); i++) {
    267 temp = static_cast<uint64_t>((*this)[i]) * n;
    268 temp += carry;
    269 if (temp < 10) {
    @@ -462,11 +457,11 @@ template<class T >
    276 }
    277
    278 while (carry != 0) {
    -
    279 this->add_digit(carry % 10);
    +
    279 this->add_digit(carry % 10);
    280 carry /= 10;
    281 }
    282 }
    -
    large_number::add_digit
    void add_digit(unsigned int value)
    Definition large_number.h:118
    +
    large_number::add_digit
    void add_digit(unsigned int value)
    Definition large_number.h:118
    Here is the call graph for this function:
    @@ -488,7 +483,7 @@ Here is the call graph for this function: size_t large_number::num_digits ( - ) + ) const @@ -499,7 +494,7 @@ Here is the call graph for this function:

    Get number of digits in the number

    -
    130{ return _digits.size(); }
    +
    130{ return _digits.size(); }
    std::vector::size
    T size(T... args)
    Here is the call graph for this function:
    @@ -523,8 +518,7 @@ template<class T >
    large_number & large_number::operator*= ( - const T  - n) + const T n) @@ -538,10 +532,10 @@ template<class T >
    238 {
    239 static_assert(std::is_integral<T>::value,
    240 "Must be integer addition unsigned integer types.");
    -
    241 this->multiply(n);
    +
    241 this->multiply(n);
    242 return *this;
    243 }
    -
    large_number::multiply
    void multiply(const T n)
    Definition large_number.h:258
    +
    large_number::multiply
    void multiply(const T n)
    Definition large_number.h:258
    Here is the call graph for this function:
    @@ -562,7 +556,7 @@ Here is the call graph for this function:
    large_number & large_number::operator++ ( - ) + ) @@ -592,8 +586,7 @@ Here is the call graph for this function: large_number & large_number::operator++ ( - int  - ) + int ) @@ -605,7 +598,7 @@ Here is the call graph for this function:

    operator overload to increment (postfix)

    183 {
    -
    184 static large_number tmp(_digits);
    +
    184 static large_number tmp(_digits);
    185 ++(*this);
    186 return tmp;
    187 }
    @@ -625,8 +618,7 @@ Here is the call graph for this function:
    large_number & large_number::operator+= ( - int  - n) + int n) @@ -636,8 +628,8 @@ Here is the call graph for this function:
    -
    212{ return (*this) += large_number(n); }
    -
    large_number::large_number
    large_number()
    Definition large_number.h:27
    +
    212{ return (*this) += large_number(n); }
    +
    large_number::large_number
    large_number()
    Definition large_number.h:27
    @@ -653,8 +645,7 @@ Here is the call graph for this function: large_number & large_number::operator+= ( - large_number  - n) + large_number n) @@ -668,18 +659,18 @@ Here is the call graph for this function:
    192 {
    193 // if adding with another large_number
    194 large_number *b = reinterpret_cast<large_number *>(&n);
    -
    195 const size_t max_L = std::max(this->num_digits(), b->num_digits());
    +
    195 const size_t max_L = std::max(this->num_digits(), b->num_digits());
    196 unsigned int carry = 0;
    197 size_t i;
    198 for (i = 0; i < max_L || carry != 0; i++) {
    -
    199 if (i < b->num_digits())
    +
    199 if (i < b->num_digits())
    200 carry += (*b)[i];
    -
    201 if (i < this->num_digits())
    +
    201 if (i < this->num_digits())
    202 carry += (*this)[i];
    -
    203 if (i < this->num_digits())
    +
    203 if (i < this->num_digits())
    204 (*this)[i] = carry % 10;
    205 else
    -
    206 this->add_digit(carry % 10);
    +
    206 this->add_digit(carry % 10);
    207 carry /= 10;
    208 }
    209 return *this;
    @@ -705,8 +696,7 @@ Here is the call graph for this function:
    large_number & large_number::operator= ( - const large_number &  - b) + const large_number & b) @@ -718,7 +708,7 @@ Here is the call graph for this function:

    assignment operator

    229 {
    -
    230 this->_digits = b._digits;
    +
    230 this->_digits = b._digits;
    231 return *this;
    232 }
    @@ -736,8 +726,7 @@ Here is the call graph for this function:
    unsigned char & large_number::operator[] ( - size_t  - n) + size_t n) @@ -748,7 +737,7 @@ Here is the call graph for this function:

    operator over load to access the i^th digit conveniently and also assign value to it

    -
    137{ return this->_digits[n]; }
    +
    137{ return this->_digits[n]; }
    @@ -764,8 +753,7 @@ Here is the call graph for this function: const unsigned char & large_number::operator[] ( - size_t  - n) + size_t n) const @@ -776,7 +764,7 @@ Here is the call graph for this function:
    139 {
    -
    140 return this->_digits[n];
    +
    140 return this->_digits[n];
    141 }
    @@ -793,7 +781,7 @@ Here is the call graph for this function: static bool large_number::test ( - ) + ) @@ -810,42 +798,42 @@ Here is the call graph for this function:
    68 large_number a(40);
    69 // 1. test multiplication
    70 a *= 10;
    -
    71 if (a != large_number(400)) {
    +
    71 if (a != large_number(400)) {
    72 std::cerr << "\tFailed 1/6 (" << a << "!=400)" << std::endl;
    73 return false;
    74 }
    75 std::cout << "\tPassed 1/6...";
    76 // 2. test compound addition with integer
    77 a += 120;
    -
    78 if (a != large_number(520)) {
    +
    78 if (a != large_number(520)) {
    79 std::cerr << "\tFailed 2/6 (" << a << "!=520)" << std::endl;
    80 return false;
    81 }
    82 std::cout << "\tPassed 2/6...";
    83 // 3. test compound multiplication again
    84 a *= 10;
    -
    85 if (a != large_number(5200)) {
    +
    85 if (a != large_number(5200)) {
    86 std::cerr << "\tFailed 3/6 (" << a << "!=5200)" << std::endl;
    87 return false;
    88 }
    89 std::cout << "\tPassed 3/6...";
    90 // 4. test increment (prefix)
    91 ++a;
    -
    92 if (a != large_number(5201)) {
    +
    92 if (a != large_number(5201)) {
    93 std::cerr << "\tFailed 4/6 (" << a << "!=5201)" << std::endl;
    94 return false;
    95 }
    96 std::cout << "\tPassed 4/6...";
    97 // 5. test increment (postfix)
    98 a++;
    -
    99 if (a != large_number(5202)) {
    +
    99 if (a != large_number(5202)) {
    100 std::cerr << "\tFailed 5/6 (" << a << "!=5202)" << std::endl;
    101 return false;
    102 }
    103 std::cout << "\tPassed 5/6...";
    104 // 6. test addition with another large number
    -
    105 a = a + large_number("7000000000000000000000000000000");
    -
    106 if (a != large_number("7000000000000000000000000005202")) {
    +
    105 a = a + large_number("7000000000000000000000000000000");
    +
    106 if (a != large_number("7000000000000000000000000005202")) {
    107 std::cerr << "\tFailed 6/6 (" << a
    108 << "!=7000000000000000000000000005202)" << std::endl;
    109 return false;
    @@ -875,19 +863,12 @@ Here is the call graph for this function: bool operator!= ( - large_number const &  - a, + large_number const & a, - large_number const &  - b  - - - - ) - + large_number const & b ) @@ -917,19 +898,12 @@ template<class T > large_number & operator+ ( - const large_number &  - a, + const large_number & a, - const T &  - b  - - - - ) - + const T & b ) @@ -959,19 +933,12 @@ template<class T > std::ostream & operator<< ( - std::ostream &  - out, + std::ostream & out, - const large_number &  - a  - - - - ) - + const large_number & a ) @@ -1001,19 +968,12 @@ template<class T > bool operator== ( - large_number const &  - a, + large_number const & a, - large_number const &  - b  - - - - ) - + large_number const & b ) @@ -1069,7 +1029,7 @@ template<class T > diff --git a/db/d8b/struct_node.html b/db/d8b/struct_node.html index 8476ee98f..f9b06a730 100644 --- a/db/d8b/struct_node.html +++ b/db/d8b/struct_node.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Node< ValueType > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -121,7 +123,7 @@ using value_type = Val - +

    Public Member Functions

     Node (int v, Node *n)
     Node (int v, Node *n)
     
    - + - + @@ -166,19 +168,12 @@ template<class ValueType > - - + - - - - - - - +

    @@ -132,9 +134,9 @@ int 

    		data
    int next
     
    ValueType data = {}
    ValueType data = {}
     
    std::shared_ptr< Node< ValueType > > next = {}
    std::shared_ptr< Node< ValueType > > next = {}
     
    int val
    Node< ValueType >::Node (int v, int v,
    Node< ValueType > * n 
    )Node< ValueType > * n )
    @@ -237,7 +232,7 @@ template<class ValueType >
    diff --git a/db/d93/check__prime_8cpp.html b/db/d93/check__prime_8cpp.html index fac7f3fc4..c01e79b71 100644 --- a/db/d93/check__prime_8cpp.html +++ b/db/d93/check__prime_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/check_prime.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -125,10 +127,10 @@ Functions bool math::is_prime (int64_t num)  Function to check if the given number is prime or not.
      -static void tests () +static void tests ()  Self-test implementations.
      -int main () +int main ()  Main function.
      @@ -147,8 +149,7 @@ Functions int main ( - void  - ) + void ) @@ -157,10 +158,10 @@ Functions

    Main function.

    Returns
    0 on exit
    81 {
    -
    82 tests(); // perform self-tests implementations
    +
    82 tests(); // perform self-tests implementations
    83 return 0;
    84}
    -
    tests
    static void tests()
    Self-test implementations.
    Definition check_prime.cpp:62
    +
    tests
    static void tests()
    Self-test implementations.
    Definition check_prime.cpp:62
    Here is the call graph for this function:
    @@ -181,7 +182,7 @@ Here is the call graph for this function:
    static void tests ( - ) + ) @@ -225,7 +226,7 @@ Here is the call graph for this function:
    diff --git a/db/d9a/classuint128__t.html b/db/d9a/classuint128__t.html index 019748aef..6245c5bbe 100644 --- a/db/d9a/classuint128__t.html +++ b/db/d9a/classuint128__t.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: uint128_t Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -108,59 +110,59 @@ $(document).ready(function(){initNavTree('db/d9a/classuint128__t.html','../../')

    class for 128-bit unsigned integer - More...

    + More...

    #include <uint128_t.hpp>

    - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - +

    Public Member Functions

    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
     uint128_t (T low)
     uint128_t (T low)
     Parameterized constructor.
     
     uint128_t (const std::string &str)
     uint128_t (const std::string &str)
     Parameterized constructor.
     
     uint128_t (const uint64_t high, const uint64_t low)
     uint128_t (const uint64_t high, const uint64_t low)
     Parameterized constructor.
     
     uint128_t (const uint128_t &num)=default
     uint128_t (const uint128_t &num)=default
     Copy constructor.
     
     uint128_t (uint128_t &&num) noexcept
     uint128_t (uint128_t &&num) noexcept
     Move constructor.
     
     ~uint128_t ()=default
     Destructor for uint128_t.
     
    uint32_t _lez ()
    uint32_t _lez ()
     Leading zeroes in binary.
     
    uint32_t _trz ()
    uint32_t _trz ()
     Trailing zeroes in binary.
     
     operator bool () const
     operator bool () const
     casting operator to boolean value
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
     operator T () const
     operator T () const
     casting operator to any integer valu
     
    uint64_t lower () const
    uint64_t lower () const
     returns lower 64-bit integer part
     
    uint64_t upper () const
    uint64_t upper () const
     returns upper 64-bit integer part
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator= (const T &p)
    uint128_t & operator= (const T &p)
     operator = for other types
     
    uint128_t & operator= (const std::string &p)
    uint128_t & operator= (const std::string &p)
     operator = for type string
     
    uint128_t & operator= (const uint128_t &p)=default
    uint128_t & operator= (const uint128_t &p)=default
     operator = for uint128_t
     
    @@ -168,233 +170,233 @@ Public Member Functions
     Move assignment operator.
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator+ (const T p)
    uint128_t operator+ (const T p)
     operator + for uint128_t and other integer types.
     
    uint128_t operator+ (const uint128_t &p)
    uint128_t operator+ (const uint128_t &p)
     operator + for uint128_t and other integer types.
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator+= (const T p)
    uint128_t & operator+= (const T p)
     operator += for uint128_t and other integer types.
     
    uint128_t & operator+= (const uint128_t &p)
    uint128_t & operator+= (const uint128_t &p)
     operator += for uint128_t
     
    uint128_t & operator++ ()
    uint128_t & operator++ ()
     pre-increment operator
     
    uint128_t operator++ (int)
    uint128_t operator++ (int)
     post-increment operator
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator- (const T &p)
    uint128_t operator- (const T &p)
     operator - for uint128_t and other integer types.
     
    uint128_t operator- (const uint128_t &p)
    uint128_t operator- (const uint128_t &p)
     operator - for uint128_t
     
    uint128_t operator- ()
    uint128_t operator- ()
     operator - using twos complement
     
    uint128_t & operator-- ()
    uint128_t & operator-- ()
     operator – (pre-decrement)
     
    uint128_t operator-- (int p)
    uint128_t operator-- (int p)
     operator – (post-decrement)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator-= (const T &p)
    uint128_t & operator-= (const T &p)
     operator -= for uint128_t and other integer types.
     
    uint128_t & operator-= (const uint128_t &p)
    uint128_t & operator-= (const uint128_t &p)
     operator -= for uint128_t
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator* (const T p)
    uint128_t operator* (const T p)
     operator * for uint128_t and other integer types.
     
    uint128_t operator* (const uint128_t &p)
    uint128_t operator* (const uint128_t &p)
     operator * for uint128_t and other integer types.
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator*= (const T p)
    uint128_t & operator*= (const T p)
     operator *= for uint128_t and other integer types.
     
    uint128_t & operator*= (const uint128_t &p)
    uint128_t & operator*= (const uint128_t &p)
     operator *= for uint128_t and other integer types.
     
    std::pair< uint128_t, uint128_t > divide (const uint128_t &p)
    std::pair< uint128_t, uint128_t > divide (const uint128_t &p)
     divide function for uint128_t and other integer types.
     
    uint128_t operator/ (const uint128_t &p)
    uint128_t operator/ (const uint128_t &p)
     operator / for uint128_t and other integer types.
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator/ (const T p)
    uint128_t operator/ (const T p)
     operator / for uint128_t and other integer types.
     
    uint128_t & operator/= (const uint128_t &p)
    uint128_t & operator/= (const uint128_t &p)
     operator /= for uint128_t
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator/= (const T p)
    uint128_t & operator/= (const T p)
     operator /= for uint128_t and other integer types.
     
    uint128_t operator% (const uint128_t &p)
    uint128_t operator% (const uint128_t &p)
     operator % for uint128_t
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator% (const T &p)
    uint128_t operator% (const T &p)
     operator % for uint128_t and other integer types.
     
    uint128_t & operator%= (const uint128_t &p)
    uint128_t & operator%= (const uint128_t &p)
     operator %= for uint128_t
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator%= (const T &p)
    uint128_t & operator%= (const T &p)
     operator %= for uint128_t
     
    bool operator< (const uint128_t &other)
    bool operator< (const uint128_t &other)
     operator < for uint128_t
     
    bool operator<= (const uint128_t &other)
    bool operator<= (const uint128_t &other)
     operator <= for uint128_t
     
    bool operator> (const uint128_t &other)
    bool operator> (const uint128_t &other)
     operator > for uint128_t
     
    bool operator>= (const uint128_t &other)
    bool operator>= (const uint128_t &other)
     operator >= for uint128_t
     
    bool operator== (const uint128_t &other)
    bool operator== (const uint128_t &other)
     operator == for uint128_t
     
    bool operator!= (const uint128_t &other)
    bool operator!= (const uint128_t &other)
     operator != for uint128_t
     
    bool operator! ()
    bool operator! ()
     operator ! for uint128_t
     
    bool operator&& (const uint128_t &b)
    bool operator&& (const uint128_t &b)
     operator && for uint128_t
     
    bool operator|| (const uint128_t &b)
    bool operator|| (const uint128_t &b)
     operator || for uint128_t
     
    bool operator() ()
    bool operator() ()
     operator () for uint128_t
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator< (const T other)
    bool operator< (const T other)
     operator < for other types
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator<= (const T other)
    bool operator<= (const T other)
     operator <= for other types
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator> (const T other)
    bool operator> (const T other)
     operator > for other types
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator>= (const T other)
    bool operator>= (const T other)
     operator >= for other types
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator== (const T other)
    bool operator== (const T other)
     operator == for other types
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator!= (const T other)
    bool operator!= (const T other)
     operator != for other types
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator&& (const T b)
    bool operator&& (const T b)
     operator && for other types
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    bool operator|| (const T b)
    bool operator|| (const T b)
     operator || for other types
     
    uint128_t operator~ ()
    uint128_t operator~ ()
     operator ~ for uint128_t
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator<< (const T p)
    uint128_t operator<< (const T p)
     operator << for uint128_t
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator<<= (const T p)
    uint128_t & operator<<= (const T p)
     operator <<= for uint128_t
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator>> (const T p)
    uint128_t operator>> (const T p)
     operator >> for uint128_t
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator>>= (const T p)
    uint128_t & operator>>= (const T p)
     operator >>= for uint128_t
     
    uint128_t operator& (const uint128_t &p)
    uint128_t operator& (const uint128_t &p)
     operator & for uint128_t (bitwise operator)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator& (const T p)
    uint128_t operator& (const T p)
     operator & for other types (bitwise operator)
     
    uint128_t & operator&= (const uint128_t &p)
    uint128_t & operator&= (const uint128_t &p)
     operator &= for uint128_t (bitwise operator)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator&= (const T p)
    uint128_t & operator&= (const T p)
     operator &= for other types (bitwise operator)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator| (const T p)
    uint128_t operator| (const T p)
     operator | for other types (bitwise operator)
     
    uint128_t operator| (const uint128_t &p)
    uint128_t operator| (const uint128_t &p)
     operator | for uint128_t (bitwise operator)
     
    uint128_t & operator|= (const uint128_t &p)
    uint128_t & operator|= (const uint128_t &p)
     operator |= for uint128_t (bitwise operator)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator|= (const T p)
    uint128_t & operator|= (const T p)
     operator |= for other types (bitwise operator)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t operator^ (const T p)
    uint128_t operator^ (const T p)
     operator ^ for other types (bitwise operator)
     
    uint128_t operator^ (const uint128_t &p)
    uint128_t operator^ (const uint128_t &p)
     operator ^ for uint128_t (bitwise operator)
     
    uint128_t & operator^= (const uint128_t &p)
    uint128_t & operator^= (const uint128_t &p)
     operator ^= for uint128_t (bitwise operator)
     
    template<typename T , typename = typename std::enable_if< std::is_integral<T>::value, T>::type>
    uint128_t & operator^= (const T &p)
    uint128_t & operator^= (const T &p)
     operator ^= for other types (bitwise operator)
     
    - +

    Private Member Functions

    void __get_integer_from_string (const std::string &str)
    void __get_integer_from_string (const std::string &str)
     First and second half of 128 bit number.
     
    - + - +

    Private Attributes

    uint64_t f {}
    uint64_t f {}
     
    uint64_t s {}
    uint64_t s {}
     
    - +

    Friends

    std::ostream & operator<< (std::ostream &op, const uint128_t &p)
    std::ostream & operator<< (std::ostream &op, const uint128_t &p)
     operator << for printing uint128_t integer
     
    @@ -415,8 +417,7 @@ template<typename T , typename = typename std::enable_if< uint128_t::uint128_t ( - T  - low) + T low) @@ -456,8 +457,7 @@ template<typename T , typename = typename std::enable_if< uint128_t::uint128_t ( - const std::string &  - str) + const std::string & str) @@ -476,9 +476,9 @@ template<typename T , typename = typename std::enable_if<
    106 {
    -
    107 __get_integer_from_string(str);
    +
    107 __get_integer_from_string(str);
    108 }
    -
    uint128_t::__get_integer_from_string
    void __get_integer_from_string(const std::string &str)
    First and second half of 128 bit number.
    Definition uint128_t.hpp:69
    +
    uint128_t::__get_integer_from_string
    void __get_integer_from_string(const std::string &str)
    First and second half of 128 bit number.
    Definition uint128_t.hpp:69
    Here is the call graph for this function:
    @@ -499,19 +499,12 @@ Here is the call graph for this function:
    uint128_t::uint128_t ( - const uint64_t  - high, + const uint64_t high, - const uint64_t  - low  - - - - ) - + const uint64_t low ) @@ -545,8 +538,7 @@ Here is the call graph for this function:
    uint128_t::uint128_t ( - const uint128_t &  - num) + const uint128_t & num) @@ -579,8 +571,7 @@ Here is the call graph for this function:
    uint128_t::uint128_t ( - uint128_t &&  - num) + uint128_t && num) @@ -615,8 +606,7 @@ Here is the call graph for this function: void uint128_t::__get_integer_from_string ( - const std::string &  - str) + const std::string & str) @@ -677,7 +667,7 @@ Here is the call graph for this function: uint32_t uint128_t::_lez ( - ) + ) @@ -723,7 +713,7 @@ Here is the call graph for this function: uint32_t uint128_t::_trz ( - ) + ) @@ -768,8 +758,7 @@ Here is the call graph for this function: std::pair< uint128_t, uint128_t > uint128_t::divide ( - const uint128_t &  - p) + const uint128_t & p) @@ -795,12 +784,12 @@ Here is the call graph for this function:
    458 return {uint128_t(1), uint128_t(0)};
    459 }
    460 uint128_t tmp = p, tmp2 = *this;
    -
    461 uint16_t left = tmp._lez() - _lez();
    +
    461 uint16_t left = tmp._lez() - _lez();
    462 tmp <<= left;
    463 uint128_t quotient(0);
    464 uint128_t zero(0);
    465 while (tmp2 >= p) {
    -
    466 uint16_t shf = tmp2._lez() - tmp._lez();
    +
    466 uint16_t shf = tmp2._lez() - tmp._lez();
    467 if (shf) {
    468 tmp >>= shf;
    469 quotient <<= shf;
    @@ -817,7 +806,7 @@ Here is the call graph for this function:
    480 return {quotient << left, tmp2};
    481 }
    uint128_t
    class for 128-bit unsigned integer
    Definition uint128_t.hpp:59
    -
    uint128_t::_lez
    uint32_t _lez()
    Leading zeroes in binary.
    Definition uint128_t.hpp:139
    +
    uint128_t::_lez
    uint32_t _lez()
    Leading zeroes in binary.
    Definition uint128_t.hpp:139
    Here is the call graph for this function:
    @@ -838,7 +827,7 @@ Here is the call graph for this function:
    uint64_t uint128_t::lower ( - ) + ) const @@ -867,7 +856,7 @@ Here is the call graph for this function: uint128_t::operator bool ( - ) + ) const @@ -898,7 +887,7 @@ template<typename T , typename = typename std::enable_if< uint128_t::operator T ( - ) + ) const @@ -935,7 +924,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator! ( - ) + ) @@ -964,10 +953,9 @@ template<typename T , typename = typename std::enable_if< - + - - +
    bool uint128_t::operator!= bool uint128_t::operator!= (const T other)const T other)
    @@ -1008,10 +996,9 @@ template<typename T , typename = typename std::enable_if< - + - - +
    bool uint128_t::operator!= bool uint128_t::operator!= (const uint128_t & other)const uint128_t & other)
    @@ -1050,8 +1037,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator% ( - const T &  - p) + const T & p) @@ -1094,8 +1080,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator% ( - const uint128_t &  - p) + const uint128_t & p) @@ -1114,8 +1099,8 @@ template<typename T , typename = typename std::enable_if<
    Returns
    unsigned 128-bit remainder.
    -
    532{ return divide(p).second; }
    -
    uint128_t::divide
    std::pair< uint128_t, uint128_t > divide(const uint128_t &p)
    divide function for uint128_t and other integer types.
    Definition uint128_t.hpp:454
    +
    532{ return divide(p).second; }
    +
    uint128_t::divide
    std::pair< uint128_t, uint128_t > divide(const uint128_t &p)
    divide function for uint128_t and other integer types.
    Definition uint128_t.hpp:454
    Here is the call graph for this function:
    @@ -1138,8 +1123,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator%= ( - const T &  - p) + const T & p) @@ -1183,8 +1167,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator%= ( - const uint128_t &  - p) + const uint128_t & p) @@ -1204,7 +1187,7 @@ template<typename T , typename = typename std::enable_if<
    Returns
    this set as unsigned 128-bit remainder.
    551 {
    -
    552 *this = divide(p).second;
    +
    552 *this = divide(p).second;
    553 return *this;
    554 }
    @@ -1229,8 +1212,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator& ( - const T  - p) + const T p) @@ -1274,8 +1256,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator& ( - const uint128_t &  - p) + const uint128_t & p) @@ -1314,8 +1295,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator&& ( - const T  - b) + const T b) @@ -1358,8 +1338,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator&& ( - const uint128_t &  - b) + const uint128_t & b) @@ -1398,8 +1377,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator&= ( - const T  - p) + const T p) @@ -1443,8 +1421,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator&= ( - const uint128_t &  - p) + const uint128_t & p) @@ -1483,7 +1460,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator() ( - ) + ) @@ -1514,8 +1491,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator* ( - const T  - p) + const T p) @@ -1558,8 +1534,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator* ( - const uint128_t &  - p) + const uint128_t & p) @@ -1608,8 +1583,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator*= ( - const T  - p) + const T p) @@ -1653,8 +1627,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator*= ( - const uint128_t &  - p) + const uint128_t & p) @@ -1704,8 +1677,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator+ ( - const T  - p) + const T p) @@ -1748,8 +1720,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator+ ( - const uint128_t &  - p) + const uint128_t & p) @@ -1786,7 +1757,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator++ ( - ) + ) @@ -1818,8 +1789,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator++ ( - int  - ) + int ) @@ -1853,8 +1823,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator+= ( - const T  - p) + const T p) @@ -1900,8 +1869,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator+= ( - const uint128_t &  - p) + const uint128_t & p) @@ -1941,7 +1909,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator- ( - ) + ) @@ -1972,8 +1940,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator- ( - const T &  - p) + const T & p) @@ -2017,8 +1984,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator- ( - const uint128_t &  - p) + const uint128_t & p) @@ -2056,7 +2022,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator-- ( - ) + ) @@ -2088,8 +2054,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator-- ( - int  - p) + int p) @@ -2123,8 +2088,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator-= ( - const T &  - p) + const T & p) @@ -2170,8 +2134,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator-= ( - const uint128_t &  - p) + const uint128_t & p) @@ -2213,8 +2176,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator/ ( - const T  - p) + const T p) @@ -2259,8 +2221,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator/ ( - const uint128_t &  - p) + const uint128_t & p) @@ -2279,7 +2240,7 @@ template<typename T , typename = typename std::enable_if<
    Returns
    unsigned 128-bit quotient.
    -
    488{ return divide(p).first; }
    +
    488{ return divide(p).first; }
    Here is the call graph for this function:
    @@ -2302,8 +2263,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator/= ( - const T  - p) + const T p) @@ -2347,8 +2307,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator/= ( - const uint128_t &  - p) + const uint128_t & p) @@ -2368,7 +2327,7 @@ template<typename T , typename = typename std::enable_if<
    Returns
    this set as unsigned 128-bit quotient.
    509 {
    -
    510 *this = divide(p).first;
    +
    510 *this = divide(p).first;
    511 return *this;
    512 }
    @@ -2393,8 +2352,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator< ( - const T  - other) + const T other) @@ -2437,8 +2395,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator< ( - const uint128_t &  - other) + const uint128_t & other) @@ -2477,8 +2434,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator<< ( - const T  - p) + const T p) @@ -2531,8 +2487,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator<<= ( - const T  - p) + const T p) @@ -2586,8 +2541,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator<= ( - const T  - other) + const T other) @@ -2630,8 +2584,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator<= ( - const uint128_t &  - other) + const uint128_t & other) @@ -2668,8 +2621,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator= ( - const std::string &  - p) + const std::string & p) @@ -2689,7 +2641,7 @@ template<typename T , typename = typename std::enable_if<
    Returns
    this pointer with it's value equal to p
    227 {
    -
    228 this->__get_integer_from_string(p);
    +
    228 this->__get_integer_from_string(p);
    229 return *this;
    230 }
    @@ -2714,8 +2666,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator= ( - const T &  - p) + const T & p) @@ -2759,8 +2710,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator= ( - const uint128_t &  - p) + const uint128_t & p) @@ -2796,8 +2746,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator== ( - const T  - other) + const T other) @@ -2840,8 +2789,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator== ( - const uint128_t &  - other) + const uint128_t & other) @@ -2880,8 +2828,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator> ( - const T  - other) + const T other) @@ -2924,8 +2871,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator> ( - const uint128_t &  - other) + const uint128_t & other) @@ -2964,8 +2910,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator>= ( - const T  - other) + const T other) @@ -3008,8 +2953,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator>= ( - const uint128_t &  - other) + const uint128_t & other) @@ -3048,8 +2992,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator>> ( - const T  - p) + const T p) @@ -3102,8 +3045,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator>>= ( - const T  - p) + const T p) @@ -3157,8 +3099,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator^ ( - const T  - p) + const T p) @@ -3201,8 +3142,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator^ ( - const uint128_t &  - p) + const uint128_t & p) @@ -3241,8 +3181,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator^= ( - const T &  - p) + const T & p) @@ -3286,8 +3225,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator^= ( - const uint128_t &  - p) + const uint128_t & p) @@ -3328,8 +3266,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator| ( - const T  - p) + const T p) @@ -3372,8 +3309,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator| ( - const uint128_t &  - p) + const uint128_t & p) @@ -3412,8 +3348,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator|= ( - const T  - p) + const T p) @@ -3457,8 +3392,7 @@ template<typename T , typename = typename std::enable_if< uint128_t & uint128_t::operator|= ( - const uint128_t &  - p) + const uint128_t & p) @@ -3499,8 +3433,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator|| ( - const T  - b) + const T b) @@ -3543,8 +3476,7 @@ template<typename T , typename = typename std::enable_if< bool uint128_t::operator|| ( - const uint128_t &  - b) + const uint128_t & b) @@ -3581,7 +3513,7 @@ template<typename T , typename = typename std::enable_if< uint128_t uint128_t::operator~ ( - ) + ) @@ -3610,7 +3542,7 @@ template<typename T , typename = typename std::enable_if< uint64_t uint128_t::upper ( - ) + ) const @@ -3640,19 +3572,12 @@ template<typename T , typename = typename std::enable_if< std::ostream & operator<< ( - std::ostream &  - op, + std::ostream & op, - const uint128_t &  - p  - - - - ) - + const uint128_t & p ) @@ -3754,7 +3679,7 @@ template<typename T , typename = typename std::enable_if< diff --git a/db/d9f/iterative__factorial_8cpp.html b/db/d9f/iterative__factorial_8cpp.html index 8ffd95ba2..c565ca258 100644 --- a/db/d9f/iterative__factorial_8cpp.html +++ b/db/d9f/iterative__factorial_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/iterative_factorial.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,10 +129,10 @@ Functions uint64_t math::iterativeFactorial (uint8_t n)  Calculates the factorial iteratively.
      -static void test () +static void test ()  Self-test implementations to test iterativeFactorial function.
      -int main () +int main ()  Main function.
      @@ -152,8 +154,7 @@ Functions int main ( - void  - ) + void ) @@ -162,10 +163,10 @@ Functions

    Main function.

    Returns
    0 on exit
    118 {
    -
    119 test(); // Run self-test implementation
    +
    119 test(); // Run self-test implementation
    120 return 0;
    121}
    -
    test
    static void test()
    Self-test implementations to test iterativeFactorial function.
    Definition iterative_factorial.cpp:69
    +
    test
    static void test()
    Self-test implementations to test iterativeFactorial function.
    Definition iterative_factorial.cpp:69
    Here is the call graph for this function:
    @@ -186,7 +187,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -261,7 +262,7 @@ Here is the call graph for this function:
    diff --git a/db/da9/classqueue.html b/db/da9/classqueue.html index 74f1486ec..c39fd5296 100644 --- a/db/da9/classqueue.html +++ b/db/da9/classqueue.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: queue< ValueType > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -123,44 +125,44 @@ using value_type = Val - + - + - + - + - + - + - +

    Public Member Functions

    void display () const
    void display () const
     prints the queue into the std::cout
     
    std::vector< value_type > toVector () const
    std::vector< value_type > toVector () const
     converts the queue into the std::vector
     
    bool isEmptyQueue () const
    bool isEmptyQueue () const
     checks if the queue has no elements
     
    void enQueue (const value_type &item)
    void enQueue (const value_type &item)
     inserts a new item into the queue
     
    value_type front () const
    value_type front () const
     
    void deQueue ()
    void deQueue ()
     removes the first element from the queue
     
    void clear ()
    void clear ()
     removes all elements from the queue
     
    +using 

    Private Types

    -using node_type = Node< ValueType >
    node_type = Node<ValueType>
     
    - +

    Private Member Functions

    void ensureNotEmpty () const
    void ensureNotEmpty () const
     throws an exception if queue is empty
     
    - + - + @@ -184,7 +186,7 @@ template<class ValueType > - +

    Private Attributes

    std::shared_ptr< node_type > queueFront
    std::shared_ptr< node_type > queueFront
     
    std::shared_ptr< node_type > queueRear
    std::shared_ptr< node_type > queueRear
     
    std::size_t size = 0
    void queue< ValueType >::clear ())
    @@ -197,12 +199,12 @@ template<class ValueType >

    removes all elements from the queue

    90 {
    -
    91 queueFront = nullptr;
    -
    92 queueRear = nullptr;
    +
    91 queueFront = nullptr;
    +
    92 queueRear = nullptr;
    93 size = 0;
    94 }
    -
    queue::queueRear
    std::shared_ptr< node_type > queueRear
    Definition queue.hpp:99
    -
    queue::queueFront
    std::shared_ptr< node_type > queueFront
    Definition queue.hpp:97
    +
    queue::queueRear
    std::shared_ptr< node_type > queueRear
    Definition queue.hpp:99
    +
    queue::queueFront
    std::shared_ptr< node_type > queueFront
    Definition queue.hpp:97
    @@ -220,7 +222,7 @@ template<class ValueType >
    void queue< ValueType >::deQueue ( - ) + ) @@ -239,11 +241,11 @@ template<class ValueType >
    81 {
    -
    82 ensureNotEmpty();
    -
    83 queueFront = queueFront->next;
    +
    82 ensureNotEmpty();
    +
    83 queueFront = queueFront->next;
    84 --size;
    85 }
    -
    queue::ensureNotEmpty
    void ensureNotEmpty() const
    throws an exception if queue is empty
    Definition queue.hpp:38
    +
    queue::ensureNotEmpty
    void ensureNotEmpty() const
    throws an exception if queue is empty
    Definition queue.hpp:38
    Here is the call graph for this function:
    @@ -266,7 +268,7 @@ template<class ValueType >
    void queue< ValueType >::display ( - ) + ) const @@ -280,7 +282,7 @@ template<class ValueType >

    prints the queue into the std::cout

    17 {
    18 std::cout << "Front --> ";
    -
    19 display_all(this->queueFront.get());
    +
    19 display_all(this->queueFront.get());
    20 std::cout << '\n';
    21 std::cout << "Size of queue: " << size << '\n';
    22 }
    @@ -302,8 +304,7 @@ template<class ValueType >
    void queue< ValueType >::enQueue ( - const value_type &  - item) + const value_type & item) @@ -319,16 +320,16 @@ template<class ValueType >
    55 auto newNode = std::make_shared<node_type>();
    56 newNode->data = item;
    57 newNode->next = nullptr;
    -
    58 if (isEmptyQueue()) {
    -
    59 queueFront = newNode;
    -
    60 queueRear = newNode;
    +
    58 if (isEmptyQueue()) {
    +
    59 queueFront = newNode;
    +
    60 queueRear = newNode;
    61 } else {
    -
    62 queueRear->next = newNode;
    -
    63 queueRear = queueRear->next;
    +
    62 queueRear->next = newNode;
    +
    63 queueRear = queueRear->next;
    64 }
    65 ++size;
    66 }
    -
    queue::isEmptyQueue
    bool isEmptyQueue() const
    checks if the queue has no elements
    Definition queue.hpp:49
    +
    queue::isEmptyQueue
    bool isEmptyQueue() const
    checks if the queue has no elements
    Definition queue.hpp:49
    Here is the call graph for this function:
    @@ -351,7 +352,7 @@ template<class ValueType >
    void queue< ValueType >::ensureNotEmpty ( - ) + ) const @@ -370,7 +371,7 @@ template<class ValueType >
    38 {
    -
    39 if (isEmptyQueue()) {
    +
    39 if (isEmptyQueue()) {
    40 throw std::invalid_argument("Queue is empty.");
    41 }
    42 }
    @@ -397,7 +398,7 @@ template<class ValueType >
    value_type queue< ValueType >::front ( - ) + ) const @@ -415,8 +416,8 @@ template<class ValueType >
    72 {
    -
    73 ensureNotEmpty();
    -
    74 return queueFront->data;
    +
    73 ensureNotEmpty();
    +
    74 return queueFront->data;
    75 }
    Here is the call graph for this function:
    @@ -440,7 +441,7 @@ template<class ValueType > bool queue< ValueType >::isEmptyQueue ( - ) + ) const @@ -453,7 +454,7 @@ template<class ValueType >

    checks if the queue has no elements

    Returns
    true if the queue is empty, false otherwise
    -
    49{ return (queueFront == nullptr); }
    +
    49{ return (queueFront == nullptr); }
    @@ -471,7 +472,7 @@ template<class ValueType > std::vector< value_type > queue< ValueType >::toVector ( - ) + ) const @@ -485,7 +486,7 @@ template<class ValueType >

    converts the queue into the std::vector

    Returns
    std::vector containning all of the elements of the queue in the same order
    29 {
    -
    30 return push_all_to_vector(this->queueFront.get(), this->size);
    +
    30 return push_all_to_vector(this->queueFront.get(), this->size);
    31 }
    @@ -557,7 +558,7 @@ template<class ValueType > diff --git a/db/dbc/tree__234_8cpp.html b/db/dbc/tree__234_8cpp.html index b3c2d3d93..636609a13 100644 --- a/db/dbc/tree__234_8cpp.html +++ b/db/dbc/tree__234_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/tree_234.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -140,13 +142,13 @@ Namespaces - + - + - +

    Functions

    static void test1 ()
    static void test1 ()
     simple test to insert a given array and delete some item, and print the tree
     
    static void test2 (int64_t n)
    static void test2 (int64_t n)
     simple test to insert continuous number of range [0, n), and print the tree
     
    int main (int argc, char *argv[])
    int main (int argc, char *argv[])
     Main function.
     
    @@ -163,19 +165,12 @@ Functions int main ( - int  - argc, + int argc, - char *  - argv[]  - - - - ) - + char * argv[] )
    @@ -191,7 +186,7 @@ Functions
    Returns
    0 on exit
    1298 {
    1299 if (argc < 2) {
    -
    1300 test1(); // execute 1st test
    +
    1300 test1(); // execute 1st test
    1301 } else {
    1302 test2(std::stoi(argv[1])); // execute 2nd test
    1303 }
    @@ -200,7 +195,7 @@ Functions
    1306}
    test2
    static void test2()
    Self-implementations, 2nd test.
    Definition dsu_path_compression.cpp:186
    std::stoi
    T stoi(T... args)
    -
    test1
    static void test1()
    simple test to insert a given array and delete some item, and print the tree
    Definition tree_234.cpp:1263
    +
    test1
    static void test1()
    simple test to insert a given array and delete some item, and print the tree
    Definition tree_234.cpp:1263
    Here is the call graph for this function:
    @@ -221,7 +216,7 @@ Here is the call graph for this function:
    static void test1 ( - ) + ) @@ -270,8 +265,7 @@ Here is the call graph for this function:
    static void test2 ( - int64_t  - n) + int64_t n) @@ -315,7 +309,7 @@ Here is the call graph for this function: diff --git a/db/dc0/namespacebacktracking.html b/db/dc0/namespacebacktracking.html index 8c9b7f686..e29299f77 100644 --- a/db/dc0/namespacebacktracking.html +++ b/db/dc0/namespacebacktracking.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: backtracking Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -105,7 +107,7 @@ $(document).ready(function(){initNavTree('db/dc0/namespacebacktracking.html','..

    for vector container -More...

    +More...

    @@ -116,7 +118,7 @@ Classes - +

    Classes

    Functions

    template<size_t T>
    int minimax (int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)
    int minimax (int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)
     Check which is the maximum/minimum number in the array.
     
    @@ -155,37 +157,27 @@ template<size_t T>
    int backtracking::minimax ( - int  - depth, + int depth, - int  - node_index, + int node_index, - bool  - is_max, + bool is_max, - const std::array< int, T > &  - scores, + const std::array< int, T > & scores, - double  - height  - - - - ) - + double height )
    @@ -203,21 +195,22 @@ template<size_t T>
    Returns
    the maximum or minimum number
    40 {
    -
    41 if (depth == height) {
    +
    41 if (depth == height) {
    42 return scores[node_index];
    43 }
    44
    -
    45 int v1 = minimax(depth + 1, node_index * 2, !is_max, scores, height);
    -
    46 int v2 = minimax(depth + 1, node_index * 2 + 1, !is_max, scores, height);
    +
    45 int v1 = minimax(depth + 1, node_index * 2, !is_max, scores, height);
    +
    46 int v2 = minimax(depth + 1, node_index * 2 + 1, !is_max, scores, height);
    47
    48 return is_max ? std::max(v1, v2) : std::min(v1, v2);
    49}
    +
    height
    int height(node *root)
    Definition avltree.cpp:38
    std::max
    T max(T... args)
    std
    STL namespace.
    Here is the call graph for this function:
    -
    +
    @@ -228,7 +221,7 @@ Here is the call graph for this function: diff --git a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.map b/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.map index 5b776edfe..5f1256fd2 100644 --- a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.map +++ b/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.map @@ -1,8 +1,12 @@ - - - - - - + + + + + + + + + + diff --git a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.md5 b/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.md5 index e85735e3a..ba550b848 100644 --- a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.md5 +++ b/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.md5 @@ -1 +1 @@ -6311f3ecfa6f7e53dc7849932e0a0ef8 \ No newline at end of file +c8b7a04cbe2bf55b877010b7c942dac6 \ No newline at end of file diff --git a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.svg b/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.svg index 36672367e..caa72bd04 100644 --- a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.svg +++ b/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.svg @@ -4,8 +4,8 @@ - + - + backtracking::minimax Node1 - -backtracking::minimax + +backtracking::minimax - + Node1->Node1 - - - + + + Node2 - - -std::max + + +height @@ -49,26 +49,62 @@ Node1->Node2 - - + + Node3 - - -std::min + + +std::max - + Node1->Node3 - - - + + + + + + + + +Node4 + + +std::min + + + + + +Node1->Node4 + + + + + + + + +Node2->Node2 + + + + + + + + +Node2->Node3 + + + diff --git a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph_org.svg b/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph_org.svg index 28878ac43..fe6f61d61 100644 --- a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph_org.svg +++ b/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph_org.svg @@ -4,34 +4,34 @@ - - + + backtracking::minimax Node1 - -backtracking::minimax + +backtracking::minimax - + Node1->Node1 - - - + + + Node2 - - -std::max + + +height @@ -39,26 +39,62 @@ Node1->Node2 - - + + Node3 - - -std::min + + +std::max - + Node1->Node3 - - - + + + + + + + + +Node4 + + +std::min + + + + + +Node1->Node4 + + + + + + + + +Node2->Node2 + + + + + + + + +Node2->Node3 + + + diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp.html b/db/dc4/floyd__cycle__detection__algo_8cpp.html index f67282917..b94ab5835 100644 --- a/db/dc4/floyd__cycle__detection__algo_8cpp.html +++ b/db/dc4/floyd__cycle__detection__algo_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: search/floyd_cycle_detection_algo.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,13 +129,13 @@ Namespaces

    Functions

    template<typename T > -int32_t search::cycle_detection::duplicateNumber (const std::vector< T > &in_arr, const uint32_t &n) +int32_t search::cycle_detection::duplicateNumber (const std::vector< T > &in_arr, const uint32_t &n)  The main function implements search algorithm.
      -static void test () +static void test ()  Self-test implementations.
      -int main () +int main ()  Main function.
      @@ -152,19 +154,12 @@ template<typename T >
    int32_t search::cycle_detection::duplicateNumber ( - const std::vector< T > &  - in_arr, + const std::vector< T > & in_arr, - const uint32_t &  - n  - - - - ) - + const uint32_t & n )
    @@ -221,8 +216,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -231,10 +225,10 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    95 {
    -
    96 test(); // run self-test implementations
    +
    96 test(); // run self-test implementations
    97 return 0;
    98}
    -
    test
    static void test()
    Self-test implementations.
    Definition floyd_cycle_detection_algo.cpp:64
    +
    test
    static void test()
    Self-test implementations.
    Definition floyd_cycle_detection_algo.cpp:64
    Here is the call graph for this function:
    @@ -255,7 +249,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -312,7 +306,7 @@ Here is the call graph for this function: diff --git a/db/dca/kadane2_8cpp.html b/db/dca/kadane2_8cpp.html index 078d224a6..d6c17c3f2 100644 --- a/db/dca/kadane2_8cpp.html +++ b/db/dca/kadane2_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/kadane2.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,10 +129,10 @@ Namespaces

    Functions

    template<size_t N> -int dynamic_programming::kadane::maxSubArray (const std::array< int, N > &n) +int dynamic_programming::kadane::maxSubArray (const std::array< int, N > &n)  maxSubArray function is used to calculate the maximum sum subarray and returns the value of maximum sum which is stored in the variable max_sum
      -int main () +int main ()  Main function.
      @@ -151,8 +153,7 @@ Algorithm int main ( - void  - ) + void ) @@ -193,8 +194,7 @@ template<size_t N>
    int dynamic_programming::kadane::maxSubArray ( - const std::array< int, N > &  - n) + const std::array< int, N > & n) @@ -240,7 +240,7 @@ Here is the call graph for this function: diff --git a/db/dd3/ode__forward__euler_8cpp.html b/db/dd3/ode__forward__euler_8cpp.html index e22a7e972..030b51a17 100644 --- a/db/dd3/ode__forward__euler_8cpp.html +++ b/db/dd3/ode__forward__euler_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/ode_forward_euler.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -118,10 +120,10 @@ Include dependency graph for ode_forward_euler.cpp:
    - + - + @@ -130,9 +132,9 @@ Functions - + - +

    Functions

    void problem (const double &x, std::valarray< double > *y, std::valarray< double > *dy)
    void problem (const double &x, std::valarray< double > *y, std::valarray< double > *dy)
     Problem statement for a system with first-order differential equations. Updates the system differential variables.
     
    void exact_solution (const double &x, std::valarray< double > *y)
    void exact_solution (const double &x, std::valarray< double > *y)
     Exact solution of the problem. Used for solution comparison.
     
    void forward_euler_step (const double dx, const double x, std::valarray< double > *y, std::valarray< double > *dy)
    double forward_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
     Compute approximation using the forward-Euler method in the given limits.
     
    void save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
    void save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
     
    int main (int argc, char *argv[])
    int main (int argc, char *argv[])
     

    Detailed Description

    @@ -153,7 +155,7 @@ v(x) &=& -\sin(x)\\ \end{eqnarray*}

    The computation results are stored to a text file forward_euler.csv and the exact soltuion results in exact.csv for comparison. Implementation solution

    -

    To implement Van der Pol oscillator, change the problem function to:

    const double mu = 2.0;
    +

    To implement Van der Pol oscillator, change the problem function to:

    const double mu = 2.0;
    dy[0] = y[1];
    dy[1] = mu * (1.f - y[0] * y[0]) * y[1] - y[0];
    See also
    ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp
    @@ -167,19 +169,12 @@ v(x) &=& -\sin(x)\\ void exact_solution ( - const double &  - x, + const double & x, - std::valarray< double > *  - y  - - - - ) - + std::valarray< double > * y )
    @@ -215,19 +210,12 @@ Here is the call graph for this function:
    int main ( - int  - argc, + int argc, - char *  - argv[]  - - - - ) - + char * argv[] )
    @@ -251,7 +239,7 @@ Here is the call graph for this function:
    205 std::cout << "\tTime = " << total_time << " ms\n";
    206
    207 /* compute exact solution for comparion */
    -
    208 save_exact_solution(X0, X_MAX, step_size, Y0);
    +
    208 save_exact_solution(X0, X_MAX, step_size, Y0);
    209
    210 return 0;
    211}
    @@ -259,7 +247,7 @@ Here is the call graph for this function:
    forward_euler
    double forward_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
    Compute approximation using the forward-Euler method in the given limits.
    Definition ode_forward_euler.cpp:102
    -
    save_exact_solution
    void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
    Definition ode_forward_euler.cpp:153
    +
    save_exact_solution
    void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
    Definition ode_forward_euler.cpp:153
    Here is the call graph for this function:
    @@ -278,25 +266,17 @@ Here is the call graph for this function: void problem ( - const double &  - x, + const double & x, - std::valarray< double > *  - y, + std::valarray< double > * y, - std::valarray< double > *  - dy  - - - - ) - + std::valarray< double > * dy )
    @@ -328,31 +308,22 @@ Here is the call graph for this function:
    void save_exact_solution ( - const double &  - X0, + const double & X0, - const double &  - X_MAX, + const double & X_MAX, - const double &  - step_size, + const double & step_size, - const std::valarray< double > &  - Y0  - - - - ) - + const std::valarray< double > & Y0 )
    @@ -385,7 +356,7 @@ Here is the call graph for this function:
    171 }
    172 fp << y[y.size() - 1] << "\n"; // NOLINT
    173
    -
    174 exact_solution(x, &y);
    +
    174 exact_solution(x, &y);
    175
    176 x += step_size;
    177 } while (x <= X_MAX);
    @@ -399,7 +370,7 @@ Here is the call graph for this function:
    std::clock
    T clock(T... args)
    -
    exact_solution
    void exact_solution(const double &x, std::valarray< double > *y)
    Exact solution of the problem. Used for solution comparison.
    Definition ode_forward_euler.cpp:67
    +
    exact_solution
    void exact_solution(const double &x, std::valarray< double > *y)
    Exact solution of the problem. Used for solution comparison.
    Definition ode_forward_euler.cpp:67
    std::perror
    T perror(T... args)
    Here is the call graph for this function:
    @@ -415,7 +386,7 @@ Here is the call graph for this function: diff --git a/db/ddb/classhash__chain__coll__graph.map b/db/ddb/classhash__chain__coll__graph.map index 28c629874..510ddd67e 100644 --- a/db/ddb/classhash__chain__coll__graph.map +++ b/db/ddb/classhash__chain__coll__graph.map @@ -1,15 +1,12 @@ - - - - - - - - - - - - - + + + + + + + + + + diff --git a/db/ddb/classhash__chain__coll__graph.md5 b/db/ddb/classhash__chain__coll__graph.md5 index d17eaa5e4..0eb30c00c 100644 --- a/db/ddb/classhash__chain__coll__graph.md5 +++ b/db/ddb/classhash__chain__coll__graph.md5 @@ -1 +1 @@ -72afbfd8d0acda9ec195776f6581be8e \ No newline at end of file +9a0469be3e837a0deef3b2d63f7ffd80 \ No newline at end of file diff --git a/db/ddb/classhash__chain__coll__graph.svg b/db/ddb/classhash__chain__coll__graph.svg index 236d7f756..4b90e8219 100644 --- a/db/ddb/classhash__chain__coll__graph.svg +++ b/db/ddb/classhash__chain__coll__graph.svg @@ -4,8 +4,8 @@ - + - + hash_chain Node1 - -hash_chain + +hash_chain Node2 - - -std::shared_ptr< struct - Node > + + +std::vector< std::shared +_ptr< Node > > @@ -41,18 +41,18 @@ Node2->Node1 - - + + - next + head Node3 - - -Node< ValueType > + + +std::shared_ptr< Node > @@ -60,48 +60,18 @@ Node3->Node2 - - + + - ptr - - - -Node3->Node3 - - - - - - next - - - -Node6 - - -std::shared_ptr< Node > - - - - - -Node3->Node6 - - - - - - ptr + elements Node4 - - -std::shared_ptr< Node -< ValueType > > + + +Node< ValueType > @@ -109,41 +79,41 @@ Node4->Node3 - - + + - next + ptr + + + +Node4->Node4 + + + + + + next Node5 - - -std::vector< std::shared -_ptr< Node > > + + +std::shared_ptr< Node +< ValueType > > - - -Node5->Node1 - - - + + +Node5->Node4 + + + - head - - - -Node6->Node5 - - - - - - elements + next diff --git a/db/ddb/classhash__chain__coll__graph_org.svg b/db/ddb/classhash__chain__coll__graph_org.svg index d5915964c..a258bc084 100644 --- a/db/ddb/classhash__chain__coll__graph_org.svg +++ b/db/ddb/classhash__chain__coll__graph_org.svg @@ -4,26 +4,26 @@ - - + + hash_chain Node1 - -hash_chain + +hash_chain Node2 - - -std::shared_ptr< struct - Node > + + +std::vector< std::shared +_ptr< Node > > @@ -31,18 +31,18 @@ Node2->Node1 - - + + - next + head Node3 - - -Node< ValueType > + + +std::shared_ptr< Node > @@ -50,48 +50,18 @@ Node3->Node2 - - + + - ptr - - - -Node3->Node3 - - - - - - next - - - -Node6 - - -std::shared_ptr< Node > - - - - - -Node3->Node6 - - - - - - ptr + elements Node4 - - -std::shared_ptr< Node -< ValueType > > + + +Node< ValueType > @@ -99,41 +69,41 @@ Node4->Node3 - - + + - next + ptr + + + +Node4->Node4 + + + + + + next Node5 - - -std::vector< std::shared -_ptr< Node > > + + +std::shared_ptr< Node +< ValueType > > - - -Node5->Node1 - - - + + +Node5->Node4 + + + - head - - - -Node6->Node5 - - - - - - elements + next diff --git a/db/ddc/namespaceaystar__search.html b/db/ddc/namespaceaystar__search.html index 1b37facda..d07e6d410 100644 --- a/db/ddc/namespaceaystar__search.html +++ b/db/ddc/namespaceaystar__search.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: aystar_search Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('db/ddc/namespaceaystar__search.html','

    Functions for A* Search implementation. -More...

    +More...

    Detailed Description

    Functions for A* Search implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('db/ddc/namespaceaystar__search.html',' diff --git a/db/df3/classmachine__learning_1_1aystar__search_1_1_eight_puzzle-members.html b/db/df3/classmachine__learning_1_1aystar__search_1_1_eight_puzzle-members.html index 091500eca..adea80736 100644 --- a/db/df3/classmachine__learning_1_1aystar__search_1_1_eight_puzzle-members.html +++ b/db/df3/classmachine__learning_1_1aystar__search_1_1_eight_puzzle-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,7 +129,7 @@ $(document).ready(function(){initNavTree('dd/d9c/classmachine__learning_1_1aysta diff --git a/db/df3/happy__number_8cpp.html b/db/df3/happy__number_8cpp.html index 4efb652a6..1c61e60a1 100644 --- a/db/df3/happy__number_8cpp.html +++ b/db/df3/happy__number_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/happy_number.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,9 +117,9 @@ Include dependency graph for happy_number.cpp:

    Functions

    template<typename T > -bool is_happy (T n) +bool is_happy (T n)   -int main () +int main ()  

    Detailed Description

    @@ -134,8 +136,7 @@ template<typename T > bool is_happy ( - T  - n) + T n) @@ -166,8 +167,7 @@ template<typename T > int main ( - void  - ) + void ) @@ -178,7 +178,7 @@ template<typename T >
    31 std::cout << "Enter a number:";
    32 std::cin >> n;
    33
    -
    34 if (is_happy(n))
    +
    34 if (is_happy(n))
    35 std::cout << n << " is a happy number" << std::endl;
    36 else
    37 std::cout << n << " is not a happy number" << std::endl;
    @@ -187,7 +187,7 @@ template<typename T >
    std::endl
    T endl(T... args)
    -
    is_happy
    bool is_happy(T n)
    Definition happy_number.cpp:14
    +
    is_happy
    bool is_happy(T n)
    Definition happy_number.cpp:14
    Here is the call graph for this function:
    @@ -202,7 +202,7 @@ Here is the call graph for this function:
    diff --git a/db/dfb/maximum__circular__subarray_8cpp.html b/db/dfb/maximum__circular__subarray_8cpp.html index ada8340ef..4ccc1f541 100644 --- a/db/dfb/maximum__circular__subarray_8cpp.html +++ b/db/dfb/maximum__circular__subarray_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming/maximum_circular_subarray.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,10 +128,10 @@ Functions int dynamic_programming::maxCircularSum (std::vector< int > &arr)  returns the maximum contiguous circular sum of an array
      -static void test () +static void test ()  Self-test implementation.
      -int main (int argc, char *argv[]) +int main (int argc, char *argv[])  Main function.
      @@ -146,19 +148,12 @@ Functions int main ( - int  - argc, + int argc, - char *  - argv[]  - - - - ) - + char * argv[] )
    @@ -173,10 +168,10 @@ Functions
    Returns
    0 on exit
    87 {
    -
    88 test(); // run self-test implementations
    +
    88 test(); // run self-test implementations
    89 return 0;
    90}
    -
    test
    static void test()
    Self-test implementation.
    Definition maximum_circular_subarray.cpp:64
    +
    test
    static void test()
    Self-test implementation.
    Definition maximum_circular_subarray.cpp:64
    Here is the call graph for this function:
    @@ -197,7 +192,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -242,7 +237,7 @@ Here is the call graph for this function:
    diff --git a/dc/d13/classdata__structures_1_1tree__234_1_1_tree234-members.html b/dc/d13/classdata__structures_1_1tree__234_1_1_tree234-members.html index 3448aa3e5..03e7e0320 100644 --- a/dc/d13/classdata__structures_1_1tree__234_1_1_tree234-members.html +++ b/dc/d13/classdata__structures_1_1tree__234_1_1_tree234-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -136,7 +138,7 @@ $(document).ready(function(){initNavTree('d3/d95/classdata__structures_1_1tree__ diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html index 9a308ca2e..3bd4eab93 100644 --- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html +++ b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: divide_and_conquer::strassens_multiplication::Matrix< T, typename > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,78 +109,78 @@ $(document).ready(function(){initNavTree('dc/d13/classdivide__and__conquer_1_1st

    Matrix class. - More...

    + More...

    Collaboration diagram for divide_and_conquer::strassens_multiplication::Matrix< T, typename >:
    -
    +
    [legend]
    - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - +

    Public Member Functions

    template<typename Integer , typename = typename std::enable_if< std::is_integral<Integer>::value, Integer>::type>
     Matrix (const Integer size)
     Matrix (const Integer size)
     Constructor.
     
    template<typename Integer , typename = typename std::enable_if< std::is_integral<Integer>::value, Integer>::type>
     Matrix (const Integer rows, const Integer cols)
     Matrix (const Integer rows, const Integer cols)
     Constructor.
     
    std::pair< size_t, size_t > size () const
    std::pair< size_t, size_t > size () const
     Get the matrix shape.
     
    template<typename Integer , typename = typename std::enable_if< std::is_integral<Integer>::value, Integer>::type>
    std::vector< T > & operator[] (const Integer index)
    std::vector< T > & operator[] (const Integer index)
     returns the address of the element at ith place (here ith row of the matrix)
     
    Matrix slice (const size_t row_start, const size_t row_end=MAX_SIZE, const size_t col_start=MAX_SIZE, const size_t col_end=MAX_SIZE) const
    Matrix slice (const size_t row_start, const size_t row_end=MAX_SIZE, const size_t col_start=MAX_SIZE, const size_t col_end=MAX_SIZE) const
     Creates a new matrix and returns a part of it.
     
    template<typename Number , typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, Number>::type>
    void h_stack (const Matrix< Number > &other)
    void h_stack (const Matrix< Number > &other)
     Horizontally stack the matrix (one after the other)
     
    template<typename Number , typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, Number>::type>
    void v_stack (const Matrix< Number > &other)
    void v_stack (const Matrix< Number > &other)
     Horizontally stack the matrix (current matrix above the other)
     
    template<typename Number , typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix operator+ (const Matrix< Number > &other) const
    Matrix operator+ (const Matrix< Number > &other) const
     Add two matrices and returns a new matrix.
     
    template<typename Number , typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix & operator+= (const Matrix< Number > &other) const
    Matrix & operator+= (const Matrix< Number > &other) const
     Add another matrices to current matrix.
     
    template<typename Number , typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix operator- (const Matrix< Number > &other) const
    Matrix operator- (const Matrix< Number > &other) const
     Subtract two matrices and returns a new matrix.
     
    template<typename Number , typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix & operator-= (const Matrix< Number > &other) const
    Matrix & operator-= (const Matrix< Number > &other) const
     Subtract another matrices to current matrix.
     
    template<typename Number , typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix operator* (const Matrix< Number > &other) const
    Matrix operator* (const Matrix< Number > &other) const
     Multiply two matrices and returns a new matrix.
     
    template<typename Number , typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix operator* (const Number other) const
    Matrix operator* (const Number other) const
     Multiply matrix with a number and returns a new matrix.
     
    template<typename Number , typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix & operator*= (const Number other) const
    Matrix & operator*= (const Number other) const
     Multiply a number to current matrix.
     
    template<typename Number , typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix naive_multiplication (const Matrix< Number > &other) const
    Matrix naive_multiplication (const Matrix< Number > &other) const
     Naive multiplication performed on this.
     
    template<typename Number , typename = typename std::enable_if< std::is_integral<Number>::value || std::is_floating_point<Number>::value, bool>::type>
    Matrix strassens_multiplication (const Matrix< Number > &other) const
    Matrix strassens_multiplication (const Matrix< Number > &other) const
     Strassens method of multiplying two matrices References: https://en.wikipedia.org/wiki/Strassen_algorithm.
     
    bool operator== (const Matrix< T > &other) const
    bool operator== (const Matrix< T > &other) const
     Compares two matrices if each of them are equal or not.
     
    @@ -190,7 +192,7 @@ Private Attributes
    - +

    Friends

    std::ostream & operator<< (std::ostream &out, const Matrix< T > &mat)
    std::ostream & operator<< (std::ostream &out, const Matrix< T > &mat)
     

    Detailed Description

    @@ -213,8 +215,7 @@ template<typename Integer , typename = typename std::enable_if< divide_and_conquer::strassens_multiplication::Matrix< T, typename >::Matrix ( - const Integer  - size) + const Integer size) @@ -239,11 +240,11 @@ template<typename Integer , typename = typename std::enable_if<
    53 {
    -
    54 for (size_t i = 0; i < size; ++i) {
    -
    55 _mat.emplace_back(std::vector<T>(size, 0));
    +
    54 for (size_t i = 0; i < size; ++i) {
    +
    55 _mat.emplace_back(std::vector<T>(size, 0));
    56 }
    57 }
    -
    divide_and_conquer::strassens_multiplication::Matrix::size
    std::pair< size_t, size_t > size() const
    Get the matrix shape.
    Definition strassen_matrix_multiplication.cpp:79
    +
    divide_and_conquer::strassens_multiplication::Matrix::size
    std::pair< size_t, size_t > size() const
    Get the matrix shape.
    Definition strassen_matrix_multiplication.cpp:79
    std::vector::emplace_back
    T emplace_back(T... args)
    @@ -270,19 +271,12 @@ template<typename Integer , typename = typename std::enable_if< divide_and_conquer::strassens_multiplication::Matrix< T, typename >::Matrix ( - const Integer  - rows, + const Integer rows, - const Integer  - cols  - - - - ) - + const Integer cols ) @@ -336,8 +330,7 @@ template<typename Number , typename = typename std::enable_if< void divide_and_conquer::strassens_multiplication::Matrix< T, typename >::h_stack ( - const Matrix< Number > &  - other) + const Matrix< Number > & other) @@ -396,8 +389,7 @@ template<typename Number , typename = typename std::enable_if< Matrix divide_and_conquer::strassens_multiplication::Matrix< T, typename >::naive_multiplication ( - const Matrix< Number > &  - other) + const Matrix< Number > & other) const @@ -423,7 +415,7 @@ template<typename Number , typename = typename std::enable_if<
    Returns
    new matrix
    316 {
    -
    317 Matrix C = Matrix<Number>(_mat.size(), other._mat[0].size());
    +
    317 Matrix C = Matrix<Number>(_mat.size(), other._mat[0].size());
    318
    319 for (size_t i = 0; i < _mat.size(); ++i) {
    320 for (size_t k = 0; k < _mat[0].size(); ++k) {
    @@ -434,7 +426,7 @@ template<typename Number , typename = typename std::enable_if<
    325 }
    326 return C;
    327 }
    -
    divide_and_conquer::strassens_multiplication::Matrix::Matrix
    Matrix(const Integer size)
    Constructor.
    Definition strassen_matrix_multiplication.cpp:53
    +
    divide_and_conquer::strassens_multiplication::Matrix::Matrix
    Matrix(const Integer size)
    Constructor.
    Definition strassen_matrix_multiplication.cpp:53
    numerical_methods::simpson_method::k
    double k(double x)
    Another test function.
    Definition composite_simpson_rule.cpp:117
    Here is the call graph for this function:
    @@ -460,8 +452,7 @@ template<typename Number , typename = typename std::enable_if< Matrix divide_and_conquer::strassens_multiplication::Matrix< T, typename >::operator* ( - const Matrix< Number > &  - other) + const Matrix< Number > & other) const @@ -487,17 +478,17 @@ template<typename Number , typename = typename std::enable_if<
    Returns
    new matrix
    255 {
    -
    256 assert(_mat[0].size() == other._mat.size());
    -
    257 auto size = this->size();
    -
    258 const size_t row = size.first, col = size.second;
    +
    256 assert(_mat[0].size() == other._mat.size());
    +
    257 auto size = this->size();
    +
    258 const size_t row = size.first, col = size.second;
    259 // Main condition for applying strassen's method:
    260 // 1: matrix should be a square matrix
    261 // 2: matrix should be of even size (mat.size() % 2 == 0)
    262 return (row == col && (row & 1) == 0)
    263 ? this->strassens_multiplication(other)
    -
    264 : this->naive_multiplication(other);
    +
    264 : this->naive_multiplication(other);
    265 }
    -
    divide_and_conquer::strassens_multiplication::Matrix::naive_multiplication
    Matrix naive_multiplication(const Matrix< Number > &other) const
    Naive multiplication performed on this.
    Definition strassen_matrix_multiplication.cpp:316
    +
    divide_and_conquer::strassens_multiplication::Matrix::naive_multiplication
    Matrix naive_multiplication(const Matrix< Number > &other) const
    Naive multiplication performed on this.
    Definition strassen_matrix_multiplication.cpp:316
    strassens_multiplication
    Namespace for performing strassen's multiplication.
    Here is the call graph for this function:
    @@ -523,8 +514,7 @@ template<typename Number , typename = typename std::enable_if< Matrix divide_and_conquer::strassens_multiplication::Matrix< T, typename >::operator* ( - const Number  - other) + const Number other) const @@ -550,7 +540,7 @@ template<typename Number , typename = typename std::enable_if<
    Returns
    new matrix
    277 {
    -
    278 Matrix C = Matrix<Number>(_mat.size(), _mat[0].size());
    +
    278 Matrix C = Matrix<Number>(_mat.size(), _mat[0].size());
    279 for (size_t i = 0; i < _mat.size(); ++i) {
    280 for (size_t j = 0; j < _mat[i].size(); ++j) {
    281 C._mat[i][j] = _mat[i][j] * other;
    @@ -582,8 +572,7 @@ template<typename Number , typename = typename std::enable_if< Matrix & divide_and_conquer::strassens_multiplication::Matrix< T, typename >::operator*= ( - const Number  - other) + const Number other) const @@ -640,8 +629,7 @@ template<typename Number , typename = typename std::enable_if< Matrix divide_and_conquer::strassens_multiplication::Matrix< T, typename >::operator+ ( - const Matrix< Number > &  - other) + const Matrix< Number > & other) const @@ -667,8 +655,8 @@ template<typename Number , typename = typename std::enable_if<
    Returns
    new matrix
    173 {
    -
    174 assert(this->size() == other.size());
    -
    175 Matrix C = Matrix<Number>(_mat.size(), _mat[0].size());
    +
    174 assert(this->size() == other.size());
    +
    175 Matrix C = Matrix<Number>(_mat.size(), _mat[0].size());
    176 for (size_t i = 0; i < _mat.size(); ++i) {
    177 for (size_t j = 0; j < _mat[i].size(); ++j) {
    178 C._mat[i][j] = _mat[i][j] + other._mat[i][j];
    @@ -700,8 +688,7 @@ template<typename Number , typename = typename std::enable_if< Matrix & divide_and_conquer::strassens_multiplication::Matrix< T, typename >::operator+= ( - const Matrix< Number > &  - other) + const Matrix< Number > & other) const @@ -727,7 +714,7 @@ template<typename Number , typename = typename std::enable_if<
    Returns
    reference of current matrix
    194 {
    -
    195 assert(this->size() == other.size());
    +
    195 assert(this->size() == other.size());
    196 for (size_t i = 0; i < _mat.size(); ++i) {
    197 for (size_t j = 0; j < _mat[i].size(); ++j) {
    198 _mat[i][j] += other._mat[i][j];
    @@ -759,8 +746,7 @@ template<typename Number , typename = typename std::enable_if< Matrix divide_and_conquer::strassens_multiplication::Matrix< T, typename >::operator- ( - const Matrix< Number > &  - other) + const Matrix< Number > & other) const @@ -786,8 +772,8 @@ template<typename Number , typename = typename std::enable_if<
    Returns
    new matrix
    214 {
    -
    215 assert(this->size() == other.size());
    -
    216 Matrix C = Matrix<Number>(_mat.size(), _mat[0].size());
    +
    215 assert(this->size() == other.size());
    +
    216 Matrix C = Matrix<Number>(_mat.size(), _mat[0].size());
    217 for (size_t i = 0; i < _mat.size(); ++i) {
    218 for (size_t j = 0; j < _mat[i].size(); ++j) {
    219 C._mat[i][j] = _mat[i][j] - other._mat[i][j];
    @@ -819,8 +805,7 @@ template<typename Number , typename = typename std::enable_if< Matrix & divide_and_conquer::strassens_multiplication::Matrix< T, typename >::operator-= ( - const Matrix< Number > &  - other) + const Matrix< Number > & other) const @@ -846,7 +831,7 @@ template<typename Number , typename = typename std::enable_if<
    Returns
    reference of current matrix
    235 {
    -
    236 assert(this->size() == other.size());
    +
    236 assert(this->size() == other.size());
    237 for (size_t i = 0; i < _mat.size(); ++i) {
    238 for (size_t j = 0; j < _mat[i].size(); ++j) {
    239 _mat[i][j] -= other._mat[i][j];
    @@ -876,8 +861,7 @@ template<typename T , typename = typename std::enable_if< st bool divide_and_conquer::strassens_multiplication::Matrix< T, typename >::operator== ( - const Matrix< T > &  - other) + const Matrix< T > & other) const @@ -934,8 +918,7 @@ template<typename Integer , typename = typename std::enable_if< std::vector< T > & divide_and_conquer::strassens_multiplication::Matrix< T, typename >::operator[] ( - const Integer  - index) + const Integer index) @@ -980,7 +963,7 @@ template<typename T , typename = typename std::enable_if< st std::pair< size_t, size_t > divide_and_conquer::strassens_multiplication::Matrix< T, typename >::size ( - ) + ) const @@ -1018,31 +1001,22 @@ template<typename T , typename = typename std::enable_if< st Matrix divide_and_conquer::strassens_multiplication::Matrix< T, typename >::slice ( - const size_t  - row_start, + const size_t row_start, - const size_t  - row_end = MAX_SIZE, + const size_t row_end = MAX_SIZE, - const size_t  - col_start = MAX_SIZE, + const size_t col_start = MAX_SIZE, - const size_t  - col_end = MAX_SIZE  - - - - ) - const + const size_t col_end = MAX_SIZE ) const @@ -1068,7 +1042,7 @@ template<typename T , typename = typename std::enable_if< st
    110 (row_end != MAX_SIZE ? row_end : _mat.size()) - row_start;
    111 const size_t v_size = (col_end != MAX_SIZE ? col_end : _mat[0].size()) -
    112 (col_start != MAX_SIZE ? col_start : 0);
    -
    113 Matrix result = Matrix<T>(h_size, v_size);
    +
    113 Matrix result = Matrix<T>(h_size, v_size);
    114
    115 const size_t v_start = (col_start != MAX_SIZE ? col_start : 0);
    116 for (size_t i = 0; i < h_size; ++i) {
    @@ -1103,8 +1077,7 @@ template<typename Number , typename = typename std::enable_if< Matrix divide_and_conquer::strassens_multiplication::Matrix< T, typename >::strassens_multiplication ( - const Matrix< Number > &  - other) + const Matrix< Number > & other) const @@ -1130,31 +1103,31 @@ template<typename Number , typename = typename std::enable_if<
    Returns
    new matrix
    340 {
    -
    341 const size_t size = _mat.size();
    +
    341 const size_t size = _mat.size();
    342 // Base case: when a matrix is small enough for faster naive
    343 // multiplication, or the matrix is of odd size, then go with the naive
    344 // multiplication route;
    345 // else; go with the strassen's method.
    -
    346 if (size <= 64ULL || (size & 1ULL)) {
    -
    347 return this->naive_multiplication(other);
    +
    346 if (size <= 64ULL || (size & 1ULL)) {
    +
    347 return this->naive_multiplication(other);
    348 } else {
    349 const Matrix<Number>
    -
    350 A = this->slice(0ULL, size >> 1, 0ULL, size >> 1),
    -
    351 B = this->slice(0ULL, size >> 1, size >> 1, size),
    -
    352 C = this->slice(size >> 1, size, 0ULL, size >> 1),
    -
    353 D = this->slice(size >> 1, size, size >> 1, size),
    -
    354 E = other.slice(0ULL, size >> 1, 0ULL, size >> 1),
    -
    355 F = other.slice(0ULL, size >> 1, size >> 1, size),
    -
    356 G = other.slice(size >> 1, size, 0ULL, size >> 1),
    -
    357 H = other.slice(size >> 1, size, size >> 1, size);
    +
    350 A = this->slice(0ULL, size >> 1, 0ULL, size >> 1),
    +
    351 B = this->slice(0ULL, size >> 1, size >> 1, size),
    +
    352 C = this->slice(size >> 1, size, 0ULL, size >> 1),
    +
    353 D = this->slice(size >> 1, size, size >> 1, size),
    +
    354 E = other.slice(0ULL, size >> 1, 0ULL, size >> 1),
    +
    355 F = other.slice(0ULL, size >> 1, size >> 1, size),
    +
    356 G = other.slice(size >> 1, size, 0ULL, size >> 1),
    +
    357 H = other.slice(size >> 1, size, size >> 1, size);
    358
    -
    359 Matrix P1 = A.strassens_multiplication(F - H);
    -
    360 Matrix P2 = (A + B).strassens_multiplication(H);
    -
    361 Matrix P3 = (C + D).strassens_multiplication(E);
    -
    362 Matrix P4 = D.strassens_multiplication(G - E);
    -
    363 Matrix P5 = (A + D).strassens_multiplication(E + H);
    -
    364 Matrix P6 = (B - D).strassens_multiplication(G + H);
    -
    365 Matrix P7 = (A - C).strassens_multiplication(E + F);
    +
    359 Matrix P1 = A.strassens_multiplication(F - H);
    +
    360 Matrix P2 = (A + B).strassens_multiplication(H);
    +
    361 Matrix P3 = (C + D).strassens_multiplication(E);
    +
    362 Matrix P4 = D.strassens_multiplication(G - E);
    +
    363 Matrix P5 = (A + D).strassens_multiplication(E + H);
    +
    364 Matrix P6 = (B - D).strassens_multiplication(G + H);
    +
    365 Matrix P7 = (A - C).strassens_multiplication(E + F);
    366
    367 // Building final matrix C11 would be
    368 // [ | ]
    @@ -1164,10 +1137,10 @@ template<typename Number , typename = typename std::enable_if<
    372 // [ C21 | C22 ]
    373 // [ | ]
    374
    -
    375 Matrix C11 = P5 + P4 - P2 + P6;
    -
    376 Matrix C12 = P1 + P2;
    -
    377 Matrix C21 = P3 + P4;
    -
    378 Matrix C22 = P1 + P5 - P3 - P7;
    +
    375 Matrix C11 = P5 + P4 - P2 + P6;
    +
    376 Matrix C12 = P1 + P2;
    +
    377 Matrix C21 = P3 + P4;
    +
    378 Matrix C22 = P1 + P5 - P3 - P7;
    379
    380 C21.h_stack(C22);
    381 C11.h_stack(C12);
    @@ -1176,7 +1149,8 @@ template<typename Number , typename = typename std::enable_if<
    384 return C11;
    385 }
    386 }
    -
    divide_and_conquer::strassens_multiplication::Matrix::slice
    Matrix slice(const size_t row_start, const size_t row_end=MAX_SIZE, const size_t col_start=MAX_SIZE, const size_t col_end=MAX_SIZE) const
    Creates a new matrix and returns a part of it.
    Definition strassen_matrix_multiplication.cpp:106
    +
    divide_and_conquer::strassens_multiplication::Matrix::slice
    Matrix slice(const size_t row_start, const size_t row_end=MAX_SIZE, const size_t col_start=MAX_SIZE, const size_t col_end=MAX_SIZE) const
    Creates a new matrix and returns a part of it.
    Definition strassen_matrix_multiplication.cpp:106
    +
    divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication
    Matrix strassens_multiplication(const Matrix< Number > &other) const
    Strassens method of multiplying two matrices References: https://en.wikipedia.org/wiki/Strassen_algor...
    Definition strassen_matrix_multiplication.cpp:340
    Here is the call graph for this function:
    @@ -1201,8 +1175,7 @@ template<typename Number , typename = typename std::enable_if< void divide_and_conquer::strassens_multiplication::Matrix< T, typename >::v_stack ( - const Matrix< Number > &  - other) + const Matrix< Number > & other) @@ -1228,7 +1201,7 @@ template<typename Number , typename = typename std::enable_if<
    Returns
    void, but modifies the current array
    153 {
    -
    154 assert(_mat[0].size() == other._mat[0].size());
    +
    154 assert(_mat[0].size() == other._mat[0].size());
    155 for (size_t i = 0; i < other._mat.size(); ++i) {
    156 _mat.emplace_back(std::vector<T>(other._mat[i].size()));
    157 for (size_t j = 0; j < other._mat[i].size(); ++j) {
    @@ -1260,19 +1233,12 @@ template<typename T , typename = typename std::enable_if< st std::ostream & operator<< ( - std::ostream &  - out, + std::ostream & out, - const Matrix< T > &  - mat  - - - - ) - + const Matrix< T > & mat ) @@ -1302,7 +1268,7 @@ template<typename T , typename = typename std::enable_if< st diff --git a/dc/d14/wildcard__matching_8cpp.html b/dc/d14/wildcard__matching_8cpp.html index 40c546560..3797302e0 100644 --- a/dc/d14/wildcard__matching_8cpp.html +++ b/dc/d14/wildcard__matching_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: backtracking/wildcard_matching.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,18 +129,18 @@ Namespaces - + - + - +

    Functions

    bool backtracking::wildcard_matching::wildcard_matching (std::string s, std::string p, uint32_t pos1, uint32_t pos2)
    bool backtracking::wildcard_matching::wildcard_matching (std::string s, std::string p, uint32_t pos1, uint32_t pos2)
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    - +

    Variables

    std::vector< std::vector< int64_t > > backtracking::wildcard_matching::dpTable (1000, std::vector< int64_t >(1000, -1))
    std::vector< std::vector< int64_t > > backtracking::wildcard_matching::dpTable (1000, std::vector< int64_t >(1000, -1))
     The main function implements if pattern can be matched with given string.
     
    @@ -155,8 +157,7 @@ Variables int main ( - void  - ) + void ) @@ -165,10 +166,10 @@ Variables

    Main function.

    Returns
    0 on exit
    152 {
    -
    153 test(); // run self-test implementations
    +
    153 test(); // run self-test implementations
    154 return 0;
    155}
    -
    test
    static void test()
    Self-test implementations.
    Definition wildcard_matching.cpp:101
    +
    test
    static void test()
    Self-test implementations.
    Definition wildcard_matching.cpp:101
    Here is the call graph for this function:
    @@ -189,7 +190,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -268,31 +269,22 @@ Here is the call graph for this function:
    bool backtracking::wildcard_matching::wildcard_matching ( - std::string  - s, + std::string s, - std::string  - p, + std::string p, - uint32_t  - pos1, + uint32_t pos1, - uint32_t  - pos2  - - - - ) - + uint32_t pos2 )
    @@ -322,36 +314,36 @@ Here is the call graph for this function:
    63
    64 // if already calculted for these positions
    65 if (dpTable[pos1][pos2] != -1) {
    -
    66 return dpTable[pos1][pos2];
    +
    66 return dpTable[pos1][pos2];
    67 }
    68
    69 // if the characters are same just go ahead in both the string
    70 if (s[pos1] == p[pos2]) {
    -
    71 return dpTable[pos1][pos2] =
    +
    71 return dpTable[pos1][pos2] =
    72 wildcard_matching(s, p, pos1 + 1, pos2 + 1);
    73 }
    74
    75 else {
    76 // can only single character
    77 if (p[pos2] == '?') {
    -
    78 return dpTable[pos1][pos2] =
    +
    78 return dpTable[pos1][pos2] =
    79 wildcard_matching(s, p, pos1 + 1, pos2 + 1);
    80 }
    81 // have choice either to match one or more charcters
    82 else if (p[pos2] == '*') {
    -
    83 return dpTable[pos1][pos2] =
    +
    83 return dpTable[pos1][pos2] =
    84 wildcard_matching(s, p, pos1, pos2 + 1) ||
    85 wildcard_matching(s, p, pos1 + 1, pos2);
    86 }
    87 // not possible to match
    88 else {
    -
    89 return dpTable[pos1][pos2] = 0;
    +
    89 return dpTable[pos1][pos2] = 0;
    90 }
    91 }
    92}
    wildcard_matching
    Functions for the Wildcard Matching problem.
    std::string::length
    T length(T... args)
    -
    backtracking::wildcard_matching::dpTable
    std::vector< std::vector< int64_t > > dpTable(1000, std::vector< int64_t >(1000, -1))
    The main function implements if pattern can be matched with given string.
    +
    backtracking::wildcard_matching::dpTable
    std::vector< std::vector< int64_t > > dpTable(1000, std::vector< int64_t >(1000, -1))
    The main function implements if pattern can be matched with given string.
    @@ -365,19 +357,12 @@ Here is the call graph for this function:
    std::vector< std::vector< int64_t > > backtracking::wildcard_matching::dpTable(1000, std::vector< int64_t >(1000, -1)) ( - 1000  - , + 1000 , - std::vector< int64_t >  - 1000, -1  - - - - ) - + std::vector< int64_t > 1000, -1 )
    @@ -402,7 +387,7 @@ Here is the call graph for this function:
    diff --git a/dc/d1a/pascal__triangle_8cpp.html b/dc/d1a/pascal__triangle_8cpp.html index 009e8ab04..16030392b 100644 --- a/dc/d1a/pascal__triangle_8cpp.html +++ b/dc/d1a/pascal__triangle_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/pascal_triangle.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,11 +118,11 @@ Include dependency graph for pascal_triangle.cpp:
    - + - + - +

    Functions

    void show_pascal (int **arr, int n)
    void show_pascal (int **arr, int n)
     
    int ** pascal_triangle (int **arr, int n)
    int ** pascal_triangle (int **arr, int n)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -135,8 +137,7 @@ Functions int main ( - void  - ) + void ) @@ -155,8 +156,8 @@ Functions
    62 memset(arr[i], 0, sizeof(int) * (2 * n - 1));
    63 }
    64
    -
    65 pascal_triangle(arr, n);
    -
    66 show_pascal(arr, n);
    +
    65 pascal_triangle(arr, n);
    +
    66 show_pascal(arr, n);
    67
    68 // deallocation
    69 for (int i = 0; i < n; ++i) {
    @@ -170,8 +171,8 @@ Functions
    std::endl
    T endl(T... args)
    std::memset
    T memset(T... args)
    -
    pascal_triangle
    int ** pascal_triangle(int **arr, int n)
    Definition pascal_triangle.cpp:36
    -
    show_pascal
    void show_pascal(int **arr, int n)
    Definition pascal_triangle.cpp:18
    +
    pascal_triangle
    int ** pascal_triangle(int **arr, int n)
    Definition pascal_triangle.cpp:36
    +
    show_pascal
    void show_pascal(int **arr, int n)
    Definition pascal_triangle.cpp:18
    Here is the call graph for this function:
    @@ -189,19 +190,12 @@ Here is the call graph for this function:
    int ** pascal_triangle ( - int **  - arr, + int ** arr, - int  - n  - - - - ) - + int n )
    @@ -237,19 +231,12 @@ Here is the call graph for this function:
    void show_pascal ( - int **  - arr, + int ** arr, - int  - n  - - - - ) - + int n )
    @@ -286,7 +273,7 @@ Here is the call graph for this function:
    diff --git a/dc/d25/structdata__structures_1_1_node-members.html b/dc/d25/structdata__structures_1_1_node-members.html index 6090d4200..352148060 100644 --- a/dc/d25/structdata__structures_1_1_node-members.html +++ b/dc/d25/structdata__structures_1_1_node-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('d9/d49/structdata__structures_1_1_node diff --git a/dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html b/dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html index 81a57c5db..190ab6cd0 100644 --- a/dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html +++ b/dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: count_of_trailing_ciphers_in_factorial_n Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('dc/d2f/namespacecount__of__trailing__c

    Functions for the Count the number of ciphers in n! implementation. -More...

    +More...

    Detailed Description

    Functions for the Count the number of ciphers in n! implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('dc/d2f/namespacecount__of__trailing__c diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp.html b/dc/d38/ordinary__least__squares__regressor_8cpp.html index f61b840c3..b1e4e567a 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp.html +++ b/dc/d38/ordinary__least__squares__regressor_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: machine_learning/ordinary_least_squares_regressor.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -119,50 +121,50 @@ Include dependency graph for ordinary_least_squares_regressor.cpp:

    Functions

    template<typename T > -std::ostream & operator<< (std::ostream &out, std::vector< std::vector< T > > const &v) +std::ostream & operator<< (std::ostream &out, std::vector< std::vector< T > > const &v)   template<typename T > -std::ostream & operator<< (std::ostream &out, std::vector< T > const &v) +std::ostream & operator<< (std::ostream &out, std::vector< T > const &v)   template<typename T > -bool is_square (std::vector< std::vector< T > > const &A) +bool is_square (std::vector< std::vector< T > > const &A)   template<typename T > -std::vector< std::vector< T > > operator* (std::vector< std::vector< T > > const &A, std::vector< std::vector< T > > const &B) +std::vector< std::vector< T > > operator* (std::vector< std::vector< T > > const &A, std::vector< std::vector< T > > const &B)   template<typename T > -std::vector< T > operator* (std::vector< std::vector< T > > const &A, std::vector< T > const &B) +std::vector< T > operator* (std::vector< std::vector< T > > const &A, std::vector< T > const &B)   template<typename T > -std::vector< float > operator* (float const scalar, std::vector< T > const &A) +std::vector< float > operator* (float const scalar, std::vector< T > const &A)   template<typename T > -std::vector< float > operator* (std::vector< T > const &A, float const scalar) +std::vector< float > operator* (std::vector< T > const &A, float const scalar)   template<typename T > -std::vector< float > operator/ (std::vector< T > const &A, float const scalar) +std::vector< float > operator/ (std::vector< T > const &A, float const scalar)   template<typename T > -std::vector< T > operator- (std::vector< T > const &A, std::vector< T > const &B) +std::vector< T > operator- (std::vector< T > const &A, std::vector< T > const &B)   template<typename T > -std::vector< T > operator+ (std::vector< T > const &A, std::vector< T > const &B) +std::vector< T > operator+ (std::vector< T > const &A, std::vector< T > const &B)   template<typename T > -std::vector< std::vector< float > > get_inverse (std::vector< std::vector< T > > const &A) +std::vector< std::vector< float > > get_inverse (std::vector< std::vector< T > > const &A)   template<typename T > -std::vector< std::vector< T > > get_transpose (std::vector< std::vector< T > > const &A) +std::vector< std::vector< T > > get_transpose (std::vector< std::vector< T > > const &A)   template<typename T > -std::vector< float > fit_OLS_regressor (std::vector< std::vector< T > > const &X, std::vector< T > const &Y) +std::vector< float > fit_OLS_regressor (std::vector< std::vector< T > > const &X, std::vector< T > const &Y)   template<typename T > -std::vector< float > predict_OLS_regressor (std::vector< std::vector< T > > const &X, std::vector< float > const &beta) +std::vector< float > predict_OLS_regressor (std::vector< std::vector< T > > const &X, std::vector< float > const &beta)   -void ols_test () +void ols_test ()   -int main () +int main ()  

    Detailed Description

    @@ -181,19 +183,12 @@ template<typename T > std::vector< float > fit_OLS_regressor ( - std::vector< std::vector< T > > const &  - X, + std::vector< std::vector< T > > const & X, - std::vector< T > const &  - Y  - - - - ) - + std::vector< T > const & Y )
    @@ -216,9 +211,9 @@ template<typename T >
    327 X2[i].push_back(1);
    328 }
    329 // (F+1)xN
    -
    330 std::vector<std::vector<T>> Xt = get_transpose(X2);
    +
    330 std::vector<std::vector<T>> Xt = get_transpose(X2);
    331 // (F+1)x(F+1)
    -
    332 std::vector<std::vector<T>> tmp = get_inverse(Xt * X2);
    +
    332 std::vector<std::vector<T>> tmp = get_inverse(Xt * X2);
    333 // (F+1)xN
    334 std::vector<std::vector<float>> out = tmp * Xt;
    335 // cout << endl
    @@ -227,8 +222,8 @@ template<typename T >
    338 // Fx1,1 -> (F+1)^th element is the independent constant
    339 return out * Y;
    340}
    -
    get_transpose
    std::vector< std::vector< T > > get_transpose(std::vector< std::vector< T > > const &A)
    Definition ordinary_least_squares_regressor.cpp:300
    -
    get_inverse
    std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T > > const &A)
    Definition ordinary_least_squares_regressor.cpp:226
    +
    get_transpose
    std::vector< std::vector< T > > get_transpose(std::vector< std::vector< T > > const &A)
    Definition ordinary_least_squares_regressor.cpp:300
    +
    get_inverse
    std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T > > const &A)
    Definition ordinary_least_squares_regressor.cpp:226
    std::vector::push_back
    T push_back(T... args)
    std::vector::size
    T size(T... args)
    @@ -251,8 +246,7 @@ template<typename T > std::vector< std::vector< float > > get_inverse ( - std::vector< std::vector< T > > const &  - A) + std::vector< std::vector< T > > const & A) @@ -271,7 +265,7 @@ template<typename T >
    237 }
    238 }
    239
    -
    240 if (!is_square(A)) {
    +
    240 if (!is_square(A)) {
    241 std::cerr << "A must be a square matrix!" << std::endl;
    242 return inverse;
    243 }
    @@ -328,7 +322,7 @@ template<typename T >
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:47
    std::endl
    T endl(T... args)
    -
    is_square
    bool is_square(std::vector< std::vector< T > > const &A)
    Definition ordinary_least_squares_regressor.cpp:59
    +
    is_square
    bool is_square(std::vector< std::vector< T > > const &A)
    Definition ordinary_least_squares_regressor.cpp:59
    Here is the call graph for this function:
    @@ -348,8 +342,7 @@ template<typename T >
    std::vector< std::vector< T > > get_transpose ( - std::vector< std::vector< T > > const &  - A) + std::vector< std::vector< T > > const & A) @@ -384,8 +377,7 @@ template<typename T > bool is_square ( - std::vector< std::vector< T > > const &  - A) + std::vector< std::vector< T > > const & A) @@ -418,15 +410,14 @@ template<typename T > int main ( - void  - ) + void )

    main function

    423 {
    -
    424 ols_test();
    +
    424 ols_test();
    425
    426 size_t N = 0, F = 0;
    427
    @@ -456,7 +447,7 @@ template<typename T >
    451 std::cin >> Y[rows];
    452 }
    453
    -
    454 std::vector<float> beta = fit_OLS_regressor(data, Y);
    +
    454 std::vector<float> beta = fit_OLS_regressor(data, Y);
    455 std::cout << std::endl << std::endl << "beta:" << beta << std::endl;
    456
    457 size_t T = 0;
    @@ -473,16 +464,16 @@ template<typename T >
    468 data2[rows] = v;
    469 }
    470
    -
    471 std::vector<float> out = predict_OLS_regressor(data2, beta);
    +
    471 std::vector<float> out = predict_OLS_regressor(data2, beta);
    472 for (size_t rows = 0; rows < T; rows++) std::cout << out[rows] << std::endl;
    473
    474 return 0;
    475}
    data
    int data[MAX]
    test data
    Definition hash_search.cpp:24
    -
    ols_test
    void ols_test()
    Definition ordinary_least_squares_regressor.cpp:369
    -
    fit_OLS_regressor
    std::vector< float > fit_OLS_regressor(std::vector< std::vector< T > > const &X, std::vector< T > const &Y)
    Definition ordinary_least_squares_regressor.cpp:321
    -
    predict_OLS_regressor
    std::vector< float > predict_OLS_regressor(std::vector< std::vector< T > > const &X, std::vector< float > const &beta)
    Definition ordinary_least_squares_regressor.cpp:352
    +
    ols_test
    void ols_test()
    Definition ordinary_least_squares_regressor.cpp:369
    +
    fit_OLS_regressor
    std::vector< float > fit_OLS_regressor(std::vector< std::vector< T > > const &X, std::vector< T > const &Y)
    Definition ordinary_least_squares_regressor.cpp:321
    +
    predict_OLS_regressor
    std::vector< float > predict_OLS_regressor(std::vector< std::vector< T > > const &X, std::vector< float > const &beta)
    Definition ordinary_least_squares_regressor.cpp:352
    Here is the call graph for this function:
    @@ -500,7 +491,7 @@ Here is the call graph for this function:
    void ols_test ( - ) + ) @@ -517,14 +508,14 @@ Here is the call graph for this function:
    377 // create corresponding outputs
    378 std::vector<float> Y1({20, -4, -5, -4, 31});
    379 // perform regression modelling
    -
    380 std::vector<float> beta1 = fit_OLS_regressor(data1, Y1);
    +
    380 std::vector<float> beta1 = fit_OLS_regressor(data1, Y1);
    381 // create test data set with same features = x, x^2, x^3
    382 std::vector<std::vector<float>> test_data1(
    383 {{-2, 4, -8}, {2, 4, 8}, {-10, 100, -1000}, {10, 100, 1000}});
    384 // expected regression outputs
    385 std::vector<float> expected1({-1, -1, 95, 95});
    386 // predicted regression outputs
    -
    387 std::vector<float> out1 = predict_OLS_regressor(test_data1, beta1);
    +
    387 std::vector<float> out1 = predict_OLS_regressor(test_data1, beta1);
    388 // compare predicted results are within +-0.01 limit of expected
    389 for (size_t rows = 0; rows < out1.size(); rows++) {
    390 assert(std::abs(out1[rows] - expected1[rows]) < 0.01);
    @@ -539,14 +530,14 @@ Here is the call graph for this function:
    399 // create corresponding outputs
    400 std::vector<float> Y2({-200, -100, -100, 98, 152});
    401 // perform regression modelling
    -
    402 std::vector<float> beta2 = fit_OLS_regressor(data2, Y2);
    +
    402 std::vector<float> beta2 = fit_OLS_regressor(data2, Y2);
    403 // create test data set with same features = x, x^2, x^3
    404 std::vector<std::vector<float>> test_data2(
    405 {{-2, 4, -8}, {2, 4, 8}, {-10, 100, -1000}, {10, 100, 1000}});
    406 // expected regression outputs
    407 std::vector<float> expected2({-104, -88, -1000, 1000});
    408 // predicted regression outputs
    -
    409 std::vector<float> out2 = predict_OLS_regressor(test_data2, beta2);
    +
    409 std::vector<float> out2 = predict_OLS_regressor(test_data2, beta2);
    410 // compare predicted results are within +-0.01 limit of expected
    411 for (size_t rows = 0; rows < out2.size(); rows++) {
    412 assert(std::abs(out2[rows] - expected2[rows]) < 0.01);
    @@ -575,19 +566,12 @@ template<typename T > std::vector< float > operator* ( - float const  - scalar, + float const scalar, - std::vector< T > const &  - A  - - - - ) - + std::vector< T > const & A )
    @@ -623,19 +607,12 @@ template<typename T >
    std::vector< std::vector< T > > operator* ( - std::vector< std::vector< T > > const &  - A, + std::vector< std::vector< T > > const & A, - std::vector< std::vector< T > > const &  - B  - - - - ) - + std::vector< std::vector< T > > const & B )
    @@ -687,19 +664,12 @@ template<typename T >
    std::vector< T > operator* ( - std::vector< std::vector< T > > const &  - A, + std::vector< std::vector< T > > const & A, - std::vector< T > const &  - B  - - - - ) - + std::vector< T > const & B )
    @@ -742,19 +712,12 @@ template<typename T >
    std::vector< float > operator* ( - std::vector< T > const &  - A, + std::vector< T > const & A, - float const  - scalar  - - - - ) - + float const scalar )
    @@ -790,19 +753,12 @@ template<typename T >
    std::vector< T > operator+ ( - std::vector< T > const &  - A, + std::vector< T > const & A, - std::vector< T > const &  - B  - - - - ) - + std::vector< T > const & B )
    @@ -841,19 +797,12 @@ template<typename T >
    std::vector< T > operator- ( - std::vector< T > const &  - A, + std::vector< T > const & A, - std::vector< T > const &  - B  - - - - ) - + std::vector< T > const & B )
    @@ -892,19 +841,12 @@ template<typename T >
    std::vector< float > operator/ ( - std::vector< T > const &  - A, + std::vector< T > const & A, - float const  - scalar  - - - - ) - + float const scalar )
    @@ -926,19 +868,12 @@ template<typename T >
    std::ostream & operator<< ( - std::ostream &  - out, + std::ostream & out, - std::vector< std::vector< T > > const &  - v  - - - - ) - + std::vector< std::vector< T > > const & v )
    @@ -979,19 +914,12 @@ template<typename T >
    std::ostream & operator<< ( - std::ostream &  - out, + std::ostream & out, - std::vector< T > const &  - v  - - - - ) - + std::vector< T > const & v )
    @@ -1010,7 +938,7 @@ template<typename T >
    Here is the call graph for this function:
    -
    +
    @@ -1026,19 +954,12 @@ template<typename T > std::vector< float > predict_OLS_regressor ( - std::vector< std::vector< T > > const &  - X, + std::vector< std::vector< T > > const & X, - std::vector< float > const &  - beta  - - - - ) - + std::vector< float > const & beta )
    @@ -1075,7 +996,7 @@ template<typename T >
    diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.map index f1ac8ffb3..88856152a 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.map +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.map @@ -1,12 +1,11 @@ - - + - + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.md5 index d1de1b6e3..f8675eaba 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.md5 +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.md5 @@ -1 +1 @@ -ded1c6c7b820b18956d5e218787d834d \ No newline at end of file +eac8ef03d8b3ab0a2780b787ebecf913 \ No newline at end of file diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.svg index c34e1a4ac..a03db9aa5 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.svg +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.svg @@ -27,15 +27,6 @@     - - -Node1->Node1 - - - - - - Node2 @@ -82,9 +73,9 @@     - + Node1->Node4 - + @@ -100,9 +91,9 @@ - + Node1->Node5 - + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph_org.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph_org.svg index ff98b434d..ef94caa72 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph_org.svg +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph_org.svg @@ -17,15 +17,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -72,9 +63,9 @@ - + Node1->Node4 - + @@ -90,9 +81,9 @@ - + Node1->Node5 - + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.map index 059fd2b69..60618af51 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.map +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.map @@ -1,19 +1,11 @@ - - - - - - - - - - - - - - - - - + + + + + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.md5 index 0dbfa87e8..8dd7d0ae6 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.md5 +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.md5 @@ -1 +1 @@ -4371b43e4b72aa0697c94550342deacf \ No newline at end of file +bd440d320ba1184573c82b845d6b33d4 \ No newline at end of file diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.svg index 9d523b462..412e8e166 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.svg +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.svg @@ -4,8 +4,8 @@ - + - + operator<< Node1 - -operator<< + +operator<< @@ -31,8 +31,8 @@ Node2 - -std::left + +std::left @@ -40,17 +40,17 @@ Node1->Node2 - - + + Node3 - - -operator<< + + +std::setfill @@ -58,116 +58,44 @@ Node1->Node3 - - - - - - - -Node5 - - -std::setfill - - - - - -Node1->Node5 - - - - - - - - -Node6 - - -std::setw - - - - - -Node1->Node6 - - - - - - - - -Node7 - - -std::vector::size - - - - - -Node1->Node7 - - - - - - - - -Node3->Node2 - - - - - - - - -Node3->Node3 - - - + + Node4 - - -std::endl + + +std::setw - - -Node3->Node4 - - - + + +Node1->Node4 + + + - - -Node3->Node5 - - - + + +Node5 + + +std::vector::size - - -Node3->Node6 - - - + + +Node1->Node5 + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph_org.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph_org.svg index 3b783b9f8..61c191956 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph_org.svg +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + operator<< Node1 - -operator<< + +operator<< @@ -21,8 +21,8 @@ Node2 - -std::left + +std::left @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node3 - - -operator<< + + +std::setfill @@ -48,116 +48,44 @@ Node1->Node3 - - - - - - - -Node5 - - -std::setfill - - - - - -Node1->Node5 - - - - - - - - -Node6 - - -std::setw - - - - - -Node1->Node6 - - - - - - - - -Node7 - - -std::vector::size - - - - - -Node1->Node7 - - - - - - - - -Node3->Node2 - - - - - - - - -Node3->Node3 - - - + + Node4 - - -std::endl + + +std::setw - - -Node3->Node4 - - - + + +Node1->Node4 + + + - - -Node3->Node5 - - - + + +Node5 + + +std::vector::size - - -Node3->Node6 - - - + + +Node1->Node5 + + + diff --git a/dc/d3a/namespacesubset__sum.html b/dc/d3a/namespacesubset__sum.html index 9576c97e9..8a91f4934 100644 --- a/dc/d3a/namespacesubset__sum.html +++ b/dc/d3a/namespacesubset__sum.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: subset_sum Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('dc/d3a/namespacesubset__sum.html','../

    Functions for [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm. -More...

    +More...

    Detailed Description

    Functions for [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('dc/d3a/namespacesubset__sum.html','../ diff --git a/dc/d5a/rat__maze_8cpp.html b/dc/d5a/rat__maze_8cpp.html index 6b0577a7e..d9f63932f 100644 --- a/dc/d5a/rat__maze_8cpp.html +++ b/dc/d5a/rat__maze_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: backtracking/rat_maze.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -129,13 +131,13 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm

    Functions

    template<size_t size> -bool backtracking::rat_maze::solveMaze (int currposrow, int currposcol, const std::array< std::array< int, size >, size > &maze, std::array< std::array< int, size >, size > soln) +bool backtracking::rat_maze::solveMaze (int currposrow, int currposcol, const std::array< std::array< int, size >, size > &maze, std::array< std::array< int, size >, size > soln)  Solve rat maze problem.
      -static void test () +static void test ()  Self-test implementations.
      -int main () +int main ()  Main function.
      @@ -156,8 +158,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm int main ( - void  - ) + void ) @@ -166,10 +167,10 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm

    Main function.

    Returns
    0 on exit
    112 {
    -
    113 test(); // run self-test implementations
    +
    113 test(); // run self-test implementations
    114 return 0;
    115}
    -
    test
    static void test()
    Self-test implementations.
    Definition rat_maze.cpp:86
    +
    test
    static void test()
    Self-test implementations.
    Definition rat_maze.cpp:86
    Here is the call graph for this function:
    @@ -189,31 +190,22 @@ template<size_t size>
    bool backtracking::rat_maze::solveMaze ( - int  - currposrow, + int currposrow, - int  - currposcol, + int currposcol, - const std::array< std::array< int, size >, size > &  - maze, + const std::array< std::array< int, size >, size > & maze, - std::array< std::array< int, size >, size >  - soln  - - - - ) - + std::array< std::array< int, size >, size > soln )
    @@ -252,13 +244,13 @@ template<size_t size>
    61
    62 // if there exist a solution by moving one step ahead in a column
    63 if ((currposcol < size - 1) && maze[currposrow][currposcol + 1] == 1 &&
    -
    64 solveMaze(currposrow, currposcol + 1, maze, soln)) {
    +
    64 solveMaze(currposrow, currposcol + 1, maze, soln)) {
    65 return true;
    66 }
    67
    68 // if there exists a solution by moving one step ahead in a row
    69 if ((currposrow < size - 1) && maze[currposrow + 1][currposcol] == 1 &&
    -
    70 solveMaze(currposrow + 1, currposcol, maze, soln)) {
    +
    70 solveMaze(currposrow + 1, currposcol, maze, soln)) {
    71 return true;
    72 }
    73
    @@ -269,7 +261,7 @@ template<size_t size>
    78}
    std::endl
    T endl(T... args)
    -
    backtracking::rat_maze::solveMaze
    bool solveMaze(int currposrow, int currposcol, const std::array< std::array< int, size >, size > &maze, std::array< std::array< int, size >, size > soln)
    Solve rat maze problem.
    Definition rat_maze.cpp:47
    +
    backtracking::rat_maze::solveMaze
    bool solveMaze(int currposrow, int currposcol, const std::array< std::array< int, size >, size > &maze, std::array< std::array< int, size >, size > soln)
    Solve rat maze problem.
    Definition rat_maze.cpp:47
    Here is the call graph for this function:
    @@ -290,7 +282,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -334,7 +326,7 @@ Here is the call graph for this function: diff --git a/dc/d5a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info-members.html b/dc/d5a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info-members.html index f4bdba449..365e0a2e0 100644 --- a/dc/d5a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info-members.html +++ b/dc/d5a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -119,7 +121,7 @@ $(document).ready(function(){initNavTree('da/d70/structmachine__learning_1_1ayst diff --git a/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html b/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html index 06e4beb12..7d351a690 100644 --- a/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html +++ b/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,7 +117,7 @@ $(document).ready(function(){initNavTree('dd/de1/classothers_1_1recursive__tree_ diff --git a/dc/d61/classgraph_1_1_graph.html b/dc/d61/classgraph_1_1_graph.html index 8a100363f..449899c73 100644 --- a/dc/d61/classgraph_1_1_graph.html +++ b/dc/d61/classgraph_1_1_graph.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph::Graph< T > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,19 +115,19 @@ Inheritance diagram for graph::Graph< T >:
    Collaboration diagram for graph::Graph< T >:
    -
    +
    [legend]
    - + - + - + - +

    Public Member Functions

    void add_edge (T u, T v, bool bidir=true)
    void add_edge (T u, T v, bool bidir=true)
     
    std::map< T, bool > breadth_first_search (T src)
    std::map< T, bool > breadth_first_search (T src)
     
     Graph (size_t N, const std::vector< std::pair< int, int > > &undirected_edges)
     Graph (size_t N, const std::vector< std::pair< int, int > > &undirected_edges)
     Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid vertex indices.
     
    int number_of_vertices () const
    int number_of_vertices () const
     

    @@ -137,7 +139,7 @@ Public Attributes

    - +

    Private Attributes

    std::map< T, std::list< T > > adjacency_list
    std::map< T, std::list< T > > adjacency_list
     

    Detailed Description

    @@ -158,19 +160,12 @@ template<typename T > graph::Graph< T >::Graph ( - size_t  - N, + size_t N, - const std::vector< std::pair< int, int > > &  - undirected_edges  - - - - ) - + const std::vector< std::pair< int, int > > & undirected_edges ) @@ -189,13 +184,13 @@ template<typename T >
    62 {
    -
    63 neighbors.resize(N);
    +
    63 neighbors.resize(N);
    64 for (auto &edge : undirected_edges) {
    -
    65 neighbors[edge.first].push_back(edge.second);
    -
    66 neighbors[edge.second].push_back(edge.first);
    +
    65 neighbors[edge.first].push_back(edge.second);
    +
    66 neighbors[edge.second].push_back(edge.first);
    67 }
    68 }
    -
    graph::Graph::neighbors
    std::vector< std::vector< int > > neighbors
    for each vertex it stores a list indicies of its neighbors
    Definition lowest_common_ancestor.cpp:77
    +
    graph::Graph::neighbors
    std::vector< std::vector< int > > neighbors
    for each vertex it stores a list indicies of its neighbors
    Definition lowest_common_ancestor.cpp:77
    std::vector::push_back
    T push_back(T... args)
    std::vector::resize
    T resize(T... args)
    @@ -221,25 +216,17 @@ template<typename T >
    void graph::Graph< T >::add_edge ( - T  - u, + T u, - T  - v, + T v, - bool  - bidir = true  - - - - ) - + bool bidir = true ) @@ -260,13 +247,13 @@ template<typename T >
    81 * to make the graph unidirectional pass the third parameter of
    82 * add_edge as false which will
    83 */
    -
    84 adjacency_list[u].push_back(v); // u-->v edge added
    +
    84 adjacency_list[u].push_back(v); // u-->v edge added
    85 if (bidir == true) {
    86 // if graph is bidirectional
    -
    87 adjacency_list[v].push_back(u); // v-->u edge added
    +
    87 adjacency_list[v].push_back(u); // v-->u edge added
    88 }
    89 }
    -
    graph::Graph::adjacency_list
    std::map< T, std::list< T > > adjacency_list
    Definition breadth_first_search.cpp:69
    +
    graph::Graph::adjacency_list
    std::map< T, std::list< T > > adjacency_list
    Definition breadth_first_search.cpp:69
    @@ -284,8 +271,7 @@ template<typename T > std::map< T, bool > graph::Graph< T >::breadth_first_search ( - T  - src) + T src) @@ -311,10 +297,10 @@ template<typename T >
    98 std::map<T, bool> visited;
    99 /// initialise every possible vertex to map to false
    100 /// initially none of the vertices are unvisited
    -
    101 for (auto const &adjlist : adjacency_list) {
    +
    101 for (auto const &adjlist : adjacency_list) {
    102 visited[adjlist.first] = false;
    -
    103 for (auto const &node : adjacency_list[adjlist.first]) {
    -
    104 visited[node] = false;
    +
    103 for (auto const &node : adjacency_list[adjlist.first]) {
    +
    104 visited[node] = false;
    105 }
    106 }
    107
    @@ -331,7 +317,7 @@ template<typename T >
    118 T node = tracker.front();
    119 /// remove the node from the queue
    120 tracker.pop();
    -
    121 for (T const &neighbour : adjacency_list[node]) {
    +
    121 for (T const &neighbour : adjacency_list[node]) {
    122 /// check every vertex connected to the node which are still
    123 /// unvisited
    124 if (!visited[neighbour]) {
    @@ -344,6 +330,7 @@ template<typename T >
    131 }
    132 return visited;
    133 }
    +
    node
    struct node { int data; int height; struct node *left; struct node *right;} node
    for std::queue
    Definition avltree.cpp:13
    std::queue::empty
    T empty(T... args)
    std::queue::front
    T front(T... args)
    @@ -373,7 +360,7 @@ template<typename T > int graph::Graph< T >::number_of_vertices ( - ) + ) const @@ -384,7 +371,7 @@ template<typename T >

    Function to get the number of vertices in the graph

    Returns
    the number of vertices in the graph.
    -
    74{ return neighbors.size(); }
    +
    74{ return neighbors.size(); }
    std::vector::size
    T size(T... args)
    Here is the call graph for this function:
    @@ -430,7 +417,7 @@ template<typename T >
    diff --git a/dc/d64/md__coding_guidelines.html b/dc/d64/md__coding_guidelines.html index 1a04c8a46..386baa8a9 100644 --- a/dc/d64/md__coding_guidelines.html +++ b/dc/d64/md__coding_guidelines.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Code style convention + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -121,7 +123,7 @@ Code style conventions diff --git a/dc/d67/classgraph_1_1is__graph__bipartite_1_1_graph-members.html b/dc/d67/classgraph_1_1is__graph__bipartite_1_1_graph-members.html index 6205a9928..da10a7dd8 100644 --- a/dc/d67/classgraph_1_1is__graph__bipartite_1_1_graph-members.html +++ b/dc/d67/classgraph_1_1is__graph__bipartite_1_1_graph-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,7 +116,7 @@ $(document).ready(function(){initNavTree('de/d00/classgraph_1_1is__graph__bipart diff --git a/dc/d6d/power__of__2_8cpp.html b/dc/d6d/power__of__2_8cpp.html index 48e9e1629..01db9f5ca 100644 --- a/dc/d6d/power__of__2_8cpp.html +++ b/dc/d6d/power__of__2_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: bit_manipulation/power_of_2.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -125,10 +127,10 @@ Functions bool bit_manipulation::isPowerOfTwo (std ::int64_t n)  The main function implements check for power of 2.
      -static void test () +static void test ()  Self-test implementations.
      -int main () +int main ()  Main function.
      @@ -146,8 +148,7 @@ Functions int main ( - void  - ) + void ) @@ -156,10 +157,10 @@ Functions

    Main function.

    Returns
    0 on exit
    71 {
    -
    72 test(); // run self-test implementations
    +
    72 test(); // run self-test implementations
    73 return 0;
    74}
    -
    test
    static void test()
    Self-test implementations.
    Definition power_of_2.cpp:48
    +
    test
    static void test()
    Self-test implementations.
    Definition power_of_2.cpp:48
    Here is the call graph for this function:
    @@ -180,7 +181,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -229,7 +230,7 @@ Here is the call graph for this function:
    diff --git a/dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html b/dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html index 57afc06f0..b924cc9b0 100644 --- a/dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html +++ b/dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: std::is_arithmetic< uint256_t > Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -119,7 +121,7 @@ Collaboration diagram for std::is_arithmetic< uint256_t >:
    diff --git a/dc/d82/area_8cpp.html b/dc/d82/area_8cpp.html index d3bb5a8ba..3f34b676d 100644 --- a/dc/d82/area_8cpp.html +++ b/dc/d82/area_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/area.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -134,7 +136,7 @@ Functions  area of a rectangle (l * w)
      template<typename T > -T math::triangle_area (T base, T height) +T math::triangle_area (T base, T height)  area of a triangle (b * h / 2)
      template<typename T > @@ -142,7 +144,7 @@ Functions  area of a circle (pi
      template<typename T > -T math::parallelogram_area (T base, T height) +T math::parallelogram_area (T base, T height)  area of a parallelogram (b * h)
      template<typename T > @@ -154,13 +156,13 @@ Functions  surface area of a sphere ( 4 * pi * r^2)
      template<typename T > -T math::cylinder_surface_area (T radius, T height) +T math::cylinder_surface_area (T radius, T height)  surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)
      -static void test () +static void test ()  Self-test implementations.
      -int main () +int main ()  Main function.
      @@ -178,8 +180,7 @@ Functions int main ( - void  - ) + void ) @@ -188,14 +189,14 @@ Functions

    Main function.

    Returns
    0 on exit
    276 {
    -
    277 test(); // run self-test implementations
    +
    277 test(); // run self-test implementations
    278 return 0;
    279}
    -
    test
    static void test()
    Self-test implementations.
    Definition area.cpp:118
    +
    test
    static void test()
    Self-test implementations.
    Definition area.cpp:118
    Here is the call graph for this function:
    -
    +
    @@ -212,7 +213,7 @@ Here is the call graph for this function: static void test ( - ) + ) @@ -391,7 +392,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -402,7 +403,7 @@ Here is the call graph for this function: diff --git a/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map index 9bba3a559..ca472a12b 100644 --- a/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map +++ b/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -6,16 +6,23 @@ - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + diff --git a/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 index f95e3b8ad..cccbde95b 100644 --- a/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 +++ b/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -1 +1 @@ -7db520c7d584409e3680b4076c23e4fc \ No newline at end of file +6562ff2e4de0d19ae4123b3e9b23591f \ No newline at end of file diff --git a/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 0d6d9fd61..a15c82ad1 100644 --- a/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -4,8 +4,8 @@ - + - + test Node1 - -test + +test Node2 - - -lower + + +compare @@ -40,26 +40,44 @@ Node1->Node2 - - + + Node3 - - -std::string::length + + +lower - - -Node2->Node3 - - - + + +Node1->Node3 + + + + + + + + +Node4 + + +std::string::length + + + + + +Node3->Node4 + + + diff --git a/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index 58d288662..172ff8b1b 100644 --- a/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -4,25 +4,25 @@ - - + + test Node1 - -test + +test Node2 - - -lower + + +compare @@ -30,26 +30,44 @@ Node1->Node2 - - + + Node3 - - -std::string::length + + +lower - - -Node2->Node3 - - - + + +Node1->Node3 + + + + + + + + +Node4 + + +std::string::length + + + + + +Node3->Node4 + + + diff --git a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index a7b6a0e48..9263557b2 100644 --- a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -8,12 +8,14 @@ - - - - - - - - + + + + + + + + + + diff --git a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index a01b223cd..fafee452b 100644 --- a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -4d20f8c173a4bfff8ae4b30ae4448db7 \ No newline at end of file +f3306c3c2fde2db7bad014c639d54f71 \ No newline at end of file diff --git a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 946d30a92..54ff29357 100644 --- a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,8 +4,8 @@ - + - + main Node1 - -main + +main @@ -31,8 +31,8 @@ Node2 - -std::string::empty + +std::string::empty @@ -40,8 +40,8 @@ Node1->Node2 - - + + @@ -49,8 +49,8 @@ Node3 - -std::endl + +std::endl @@ -58,8 +58,8 @@ Node1->Node3 - - + + @@ -67,8 +67,8 @@ Node4 - -std::string::find + +std::string::find @@ -76,8 +76,8 @@ Node1->Node4 - - + + @@ -85,8 +85,8 @@ Node5 - -std::getline + +std::getline @@ -94,8 +94,8 @@ Node1->Node5 - - + + @@ -103,8 +103,8 @@ Node6 - -lower + +lower @@ -112,8 +112,8 @@ Node1->Node6 - - + + @@ -121,8 +121,8 @@ Node7 - -std::string::length + +std::string::length @@ -130,8 +130,8 @@ Node1->Node7 - - + + @@ -139,8 +139,8 @@ Node8 - -test + +test @@ -148,8 +148,8 @@ Node1->Node8 - - + + @@ -157,17 +157,35 @@ Node6->Node7 - - + + - + Node8->Node6 - - - + + + + + + + + +Node9 + + +compare + + + + + +Node8->Node9 + + + diff --git a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 5579436ef..fd7494cce 100644 --- a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + main Node1 - -main + +main @@ -21,8 +21,8 @@ Node2 - -std::string::empty + +std::string::empty @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -39,8 +39,8 @@ Node3 - -std::endl + +std::endl @@ -48,8 +48,8 @@ Node1->Node3 - - + + @@ -57,8 +57,8 @@ Node4 - -std::string::find + +std::string::find @@ -66,8 +66,8 @@ Node1->Node4 - - + + @@ -75,8 +75,8 @@ Node5 - -std::getline + +std::getline @@ -84,8 +84,8 @@ Node1->Node5 - - + + @@ -93,8 +93,8 @@ Node6 - -lower + +lower @@ -102,8 +102,8 @@ Node1->Node6 - - + + @@ -111,8 +111,8 @@ Node7 - -std::string::length + +std::string::length @@ -120,8 +120,8 @@ Node1->Node7 - - + + @@ -129,8 +129,8 @@ Node8 - -test + +test @@ -138,8 +138,8 @@ Node1->Node8 - - + + @@ -147,17 +147,35 @@ Node6->Node7 - - + + - + Node8->Node6 - - - + + + + + + + + +Node9 + + +compare + + + + + +Node8->Node9 + + + diff --git a/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html b/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html index 2c3f318d4..1a3dc7853 100644 --- a/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html +++ b/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -248,7 +250,7 @@ $(document).ready(function(){initNavTree('dc/dc4/_2_users_2runner_2work_2_c-_plu diff --git a/dc/dc5/namespacereverse__binary__tree.html b/dc/dc5/namespacereverse__binary__tree.html index 120679558..9b2dc2b0d 100644 --- a/dc/dc5/namespacereverse__binary__tree.html +++ b/dc/dc5/namespacereverse__binary__tree.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: reverse_binary_tree Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('dc/dc5/namespacereverse__binary__tree.

    Functions for the Reverse a Binary Tree implementation. -More...

    +More...

    Detailed Description

    Functions for the Reverse a Binary Tree implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('dc/dc5/namespacereverse__binary__tree. diff --git a/dc/dc5/paranthesis__matching_8cpp.html b/dc/dc5/paranthesis__matching_8cpp.html index 6da362d93..a422a2840 100644 --- a/dc/dc5/paranthesis__matching_8cpp.html +++ b/dc/dc5/paranthesis__matching_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/paranthesis_matching.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,25 +118,25 @@ Include dependency graph for paranthesis_matching.cpp:
    - +

    Macros

    #define MAX   100
    #define MAX   100
     
    - + - + - + - + - +

    Functions

    char opening (char ch)
    char opening (char ch)
     
    int main ()
    int main ()
     
    char stack [MAX]
    char stack [MAX]
     
    int stack_idx = -1
     pointer to track stack index
     
    void push (char ch)
    void push (char ch)
     push byte to stack variable
     
    char pop ()
    char pop ()
     pop a byte out of stack variable
     
    @@ -143,7 +145,7 @@ int stack_idx = -1
    Note
    Do not know the application of this, however.
    Implementation is C-type and does not utilize the C++ constructs
    -
    Todo:
    implement as a C++ class
    +
    Todo
    implement as a C++ class

    Macro Definition Documentation

    ◆ MAX

    @@ -170,8 +172,7 @@ Implementation is C-type and does not utilize the C++ constructs int main ( - void  - ) + void ) @@ -184,9 +185,9 @@ Implementation is C-type and does not utilize the C++ constructs
    55
    56 while (valid == 1 && i < exp.length()) {
    57 if (exp[i] == '(' || exp[i] == '{' || exp[i] == '[' || exp[i] == '<') {
    -
    58 push(exp[i]);
    -
    59 } else if (stack_idx >= 0 && stack[stack_idx] == opening(exp[i])) {
    -
    60 pop();
    +
    58 push(exp[i]);
    +
    59 } else if (stack_idx >= 0 && stack[stack_idx] == opening(exp[i])) {
    +
    60 pop();
    61 } else {
    62 valid = 0;
    63 }
    @@ -194,7 +195,7 @@ Implementation is C-type and does not utilize the C++ constructs
    65 }
    66
    67 // makes sure the stack is empty after processsing (above)
    -
    68 if (valid == 1 && stack_idx == -1) {
    +
    68 if (valid == 1 && stack_idx == -1) {
    69 std::cout << "\nCorrect Expression";
    70 } else {
    71 std::cout << "\nWrong Expression";
    @@ -207,10 +208,10 @@ Implementation is C-type and does not utilize the C++ constructs
    stack
    for std::invalid_argument
    Definition stack.hpp:19
    std::exp
    T exp(T... args)
    -
    pop
    char pop()
    pop a byte out of stack variable
    Definition paranthesis_matching.cpp:29
    -
    push
    void push(char ch)
    push byte to stack variable
    Definition paranthesis_matching.cpp:26
    -
    opening
    char opening(char ch)
    Definition paranthesis_matching.cpp:36
    -
    stack_idx
    int stack_idx
    pointer to track stack index
    Definition paranthesis_matching.cpp:23
    +
    pop
    char pop()
    pop a byte out of stack variable
    Definition paranthesis_matching.cpp:29
    +
    push
    void push(char ch)
    push byte to stack variable
    Definition paranthesis_matching.cpp:26
    +
    opening
    char opening(char ch)
    Definition paranthesis_matching.cpp:36
    +
    stack_idx
    int stack_idx
    pointer to track stack index
    Definition paranthesis_matching.cpp:23
    @@ -223,8 +224,7 @@ Implementation is C-type and does not utilize the C++ constructs char opening ( - char  - ch) + char ch) @@ -260,14 +260,14 @@ Implementation is C-type and does not utilize the C++ constructs char pop ( - ) + )

    pop a byte out of stack variable

    -
    29{ return stack[stack_idx--]; }
    +
    29{ return stack[stack_idx--]; }
    @@ -280,15 +280,14 @@ Implementation is C-type and does not utilize the C++ constructs void push ( - char  - ch) + char ch)

    push byte to stack variable

    -
    26{ stack[++stack_idx] = ch; }
    +
    26{ stack[++stack_idx] = ch; }
    @@ -300,7 +299,7 @@ Implementation is C-type and does not utilize the C++ constructs
    - +
    char stack[MAX]char stack[MAX]
    @@ -314,7 +313,7 @@ Implementation is C-type and does not utilize the C++ constructs diff --git a/dc/dd3/classbacktracking_1_1generate__parentheses-members.html b/dc/dd3/classbacktracking_1_1generate__parentheses-members.html index a1c73bc7b..23839bb6e 100644 --- a/dc/dd3/classbacktracking_1_1generate__parentheses-members.html +++ b/dc/dd3/classbacktracking_1_1generate__parentheses-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('df/de5/classbacktracking_1_1generate__ diff --git a/dc/dd4/classdata__structures_1_1_bloom_filter.html b/dc/dd4/classdata__structures_1_1_bloom_filter.html index 275e3f6f6..4c44363b6 100644 --- a/dc/dd4/classdata__structures_1_1_bloom_filter.html +++ b/dc/dd4/classdata__structures_1_1_bloom_filter.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures::BloomFilter< T > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,22 +108,22 @@ $(document).ready(function(){initNavTree('dc/dd4/classdata__structures_1_1_bloom

    Bloom filter template class. - More...

    + More...

    Collaboration diagram for data_structures::BloomFilter< T >:
    -
    +
    [legend]
    - + - + - +

    Public Member Functions

     BloomFilter (std::size_t, std::initializer_list< std::function< std::size_t(T)> >)
     BloomFilter (std::size_t, std::initializer_list< std::function< std::size_t(T)> >)
     Constructor for Bloom filter.
     
    void add (T)
    void add (T)
     Add function for Bloom filter.
     
    bool contains (T)
    bool contains (T)
     Check element function for Bloom filter.
     
    @@ -157,19 +159,12 @@ template<typename T > - - + - - - - - - - +
    data_structures::BloomFilter< T >::BloomFilter (std::size_t size, std::size_t size,
    std::initializer_list< std::function< std::size_t(T)> > funks 
    )std::initializer_list< std::function< std::size_t(T)> > funks )
    @@ -189,9 +184,9 @@ template<typename T >
    Returns
    none
    -
    124 : set(size), hashFunks(funks) {}
    -
    data_structures::BloomFilter::hashFunks
    std::vector< std::function< std::size_t(T)> > hashFunks
    hash functions for T type
    Definition bloom_filter.cpp:103
    -
    data_structures::BloomFilter::set
    Bitset set
    inner bitset for elements
    Definition bloom_filter.cpp:101
    +
    124 : set(size), hashFunks(funks) {}
    +
    data_structures::BloomFilter::hashFunks
    std::vector< std::function< std::size_t(T)> > hashFunks
    hash functions for T type
    Definition bloom_filter.cpp:103
    +
    data_structures::BloomFilter::set
    Bitset set
    inner bitset for elements
    Definition bloom_filter.cpp:101
    @@ -207,8 +202,7 @@ template<typename T > void data_structures::BloomFilter< T >::add ( - T  - x) + T x) @@ -229,8 +223,8 @@ template<typename T >
    Returns
    void
    134 {
    -
    135 for (std::size_t i = 0; i < hashFunks.size(); i++) {
    -
    136 set.add(hashFunks[i](x) % (sizeof(std::size_t) * set.size()));
    +
    135 for (std::size_t i = 0; i < hashFunks.size(); i++) {
    +
    136 set.add(hashFunks[i](x) % (sizeof(std::size_t) * set.size()));
    137 }
    138}
    data_structures::Bitset::add
    void add(std::size_t)
    Turn bit on position x to 1s.
    Definition bloom_filter.cpp:71
    @@ -256,8 +250,7 @@ template<typename T >
    bool data_structures::BloomFilter< T >::contains ( - T  - x) + T x) @@ -280,9 +273,9 @@ template<typename T >
    false if the element certainly does not appear in the filter
    149 {
    -
    150 for (std::size_t i = 0; i < hashFunks.size(); i++) {
    -
    151 if (set.contains(hashFunks[i](x) %
    -
    152 (sizeof(std::size_t) * set.size())) == false) {
    +
    150 for (std::size_t i = 0; i < hashFunks.size(); i++) {
    +
    151 if (set.contains(hashFunks[i](x) %
    +
    152 (sizeof(std::size_t) * set.size())) == false) {
    153 return false;
    154 }
    155 }
    @@ -306,7 +299,7 @@ Here is the call graph for this function:
    diff --git a/dc/dd5/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator-members.html b/dc/dd5/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator-members.html index 4592d2ee5..d3f9a5eb5 100644 --- a/dc/dd5/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator-members.html +++ b/dc/dd5/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -109,7 +111,7 @@ $(document).ready(function(){initNavTree('d3/d2a/structmachine__learning_1_1ayst diff --git a/dc/dd9/strand__sort_8cpp.html b/dc/dd9/strand__sort_8cpp.html index 877ba4653..50ec5243d 100644 --- a/dc/dd9/strand__sort_8cpp.html +++ b/dc/dd9/strand__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/strand_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,13 +128,13 @@ Namespaces

    Functions

    template<typename T > -std::list< T > sorting::strand::strand_sort (std::list< T > lst) +std::list< T > sorting::strand::strand_sort (std::list< T > lst)  Apply sorting.
      -static void test () +static void test ()  Function for testing.
      -int main () +int main ()  Main function.
      @@ -151,8 +153,7 @@ Functions int main ( - void  - ) + void ) @@ -161,10 +162,10 @@ Functions

    Main function.

    Returns
    0 on exit
    84 {
    -
    85 test();
    +
    85 test();
    86 return 0;
    87}
    -
    test
    static void test()
    Function for testing.
    Definition strand_sort.cpp:64
    +
    test
    static void test()
    Function for testing.
    Definition strand_sort.cpp:64
    Here is the call graph for this function:
    @@ -184,8 +185,7 @@ template<typename T >
    std::list< T > sorting::strand::strand_sort ( - std::list< T >  - lst) + std::list< T > lst) @@ -257,7 +257,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -278,7 +278,7 @@ Here is the call graph for this function:
    69 std::cout << item << " ";
    70 }
    71
    -
    72 lst = sorting::strand::strand_sort(lst); // Sort list.
    +
    72 lst = sorting::strand::strand_sort(lst); // Sort list.
    73
    74 std::cout << "\nAfter: ";
    75 for(auto item: lst) {
    @@ -286,7 +286,7 @@ Here is the call graph for this function:
    77 }
    78}
    -
    sorting::strand::strand_sort
    std::list< T > strand_sort(std::list< T > lst)
    Apply sorting.
    Definition strand_sort.cpp:36
    +
    sorting::strand::strand_sort
    std::list< T > strand_sort(std::list< T > lst)
    Apply sorting.
    Definition strand_sort.cpp:36
    @@ -296,7 +296,7 @@ Here is the call graph for this function: diff --git a/dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html b/dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html index 53b77e341..564ce8f99 100644 --- a/dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html +++ b/dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,7 +117,7 @@ $(document).ready(function(){initNavTree('db/d5b/structdata__structures_1_1stack diff --git a/dc/de1/recursive__tree__traversal_8cpp.html b/dc/de1/recursive__tree__traversal_8cpp.html index da71fad5d..c517d002c 100644 --- a/dc/de1/recursive__tree__traversal_8cpp.html +++ b/dc/de1/recursive__tree__traversal_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others/recursive_tree_traversal.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -136,19 +138,19 @@ Namespaces - + - + - + - + - +

    Functions

    void test1 ()
    void test1 ()
     1st test-case
     
    void test2 ()
    void test2 ()
     2nd test-case
     
    void test3 ()
    void test3 ()
     3rd test-case
     
    static void tests ()
    static void tests ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -180,8 +182,7 @@ Iterative Postorder Traversal of a tree int main ( - void  - ) + void ) @@ -190,10 +191,10 @@ Iterative Postorder Traversal of a tree

    Main function.

    Returns
    0 on exit
    373 {
    -
    374 tests(); // run self-test implementations
    +
    374 tests(); // run self-test implementations
    375 return 0;
    376}
    -
    tests
    static void tests()
    Self-test implementations.
    Definition recursive_tree_traversal.cpp:361
    +
    tests
    static void tests()
    Self-test implementations.
    Definition recursive_tree_traversal.cpp:361
    Here is the call graph for this function:
    @@ -211,7 +212,7 @@ Here is the call graph for this function:
    void test1 ( - ) + ) @@ -300,7 +301,7 @@ Here is the call graph for this function:
    void test2 ( - ) + ) @@ -380,7 +381,7 @@ Here is the call graph for this function: void test3 ( - ) + ) @@ -461,7 +462,7 @@ Here is the call graph for this function: static void tests ( - ) + ) @@ -476,15 +477,15 @@ Here is the call graph for this function:
    Returns
    void
    361 {
    362 std::cout << "1st test-case" << std::endl;
    -
    363 test1(); // run 1st test-case
    +
    363 test1(); // run 1st test-case
    364 std::cout << "2nd test-case" << std::endl;
    -
    365 test2(); // run 2nd test-case
    +
    365 test2(); // run 2nd test-case
    366 std::cout << "3rd test-case" << std::endl;
    -
    367 test3(); // run 3rd test-case
    +
    367 test3(); // run 3rd test-case
    368}
    -
    test2
    void test2()
    2nd test-case
    Definition recursive_tree_traversal.cpp:249
    -
    test1
    void test1()
    1st test-case
    Definition recursive_tree_traversal.cpp:191
    -
    test3
    void test3()
    3rd test-case
    Definition recursive_tree_traversal.cpp:306
    +
    test2
    void test2()
    2nd test-case
    Definition recursive_tree_traversal.cpp:249
    +
    test1
    void test1()
    1st test-case
    Definition recursive_tree_traversal.cpp:191
    +
    test3
    void test3()
    3rd test-case
    Definition recursive_tree_traversal.cpp:306
    Here is the call graph for this function:
    @@ -499,7 +500,7 @@ Here is the call graph for this function:
    diff --git a/dc/dea/classgraph_1_1_h_k_graph-members.html b/dc/dea/classgraph_1_1_h_k_graph-members.html index ea8f164a8..3bb378282 100644 --- a/dc/dea/classgraph_1_1_h_k_graph-members.html +++ b/dc/dea/classgraph_1_1_h_k_graph-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -122,7 +124,7 @@ $(document).ready(function(){initNavTree('d8/d69/classgraph_1_1_h_k_graph.html', diff --git a/dc/dec/struct_list_node-members.html b/dc/dec/struct_list_node-members.html index 7ea84b23a..ed9469454 100644 --- a/dc/dec/struct_list_node-members.html +++ b/dc/dec/struct_list_node-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,7 +115,7 @@ $(document).ready(function(){initNavTree('d7/da4/struct_list_node.html','../../' diff --git a/dc/dfb/atbash__cipher_8cpp.html b/dc/dfb/atbash__cipher_8cpp.html index 8bb1bb24b..697b127e1 100644 --- a/dc/dfb/atbash__cipher_8cpp.html +++ b/dc/dfb/atbash__cipher_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ciphers/atbash_cipher.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,19 +130,19 @@ Namespaces - + - + - +

    Functions

    std::string ciphers::atbash::atbash_cipher (const std::string &text)
    std::string ciphers::atbash::atbash_cipher (const std::string &text)
     atbash cipher encryption and decryption
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    - +

    Variables

    std::map< char, char > ciphers::atbash::atbash_cipher_map
    std::map< char, char > ciphers::atbash::atbash_cipher_map
     

    Detailed Description

    @@ -160,8 +162,7 @@ Algorithm std::string ciphers::atbash::atbash_cipher ( - const std::string &  - text) + const std::string & text) @@ -201,8 +202,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -211,10 +211,10 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    81 {
    -
    82 test(); // run self-test implementations
    +
    82 test(); // run self-test implementations
    83 return 0;
    84}
    -
    test
    static void test()
    Self-test implementations.
    Definition atbash_cipher.cpp:62
    +
    test
    static void test()
    Self-test implementations.
    Definition atbash_cipher.cpp:62
    Here is the call graph for this function:
    @@ -235,7 +235,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -252,8 +252,8 @@ Here is the call graph for this function:
    63 // 1st test
    64 std::string text = "Hello World";
    65 std::string expected = "Svool Dliow";
    -
    66 std::string encrypted_text = ciphers::atbash::atbash_cipher(text);
    -
    67 std::string decrypted_text = ciphers::atbash::atbash_cipher(encrypted_text);
    +
    66 std::string encrypted_text = ciphers::atbash::atbash_cipher(text);
    +
    67 std::string decrypted_text = ciphers::atbash::atbash_cipher(encrypted_text);
    68 assert(expected == encrypted_text);
    69 assert(text == decrypted_text);
    70 std::cout << "Original text: " << text << std::endl;
    @@ -262,7 +262,7 @@ Here is the call graph for this function:
    73 std::cout << ", Decrypted text: " << decrypted_text << std::endl;
    74 std::cout << "\nAll tests have successfully passed!\n";
    75}
    -
    ciphers::atbash::atbash_cipher
    std::string atbash_cipher(const std::string &text)
    atbash cipher encryption and decryption
    Definition atbash_cipher.cpp:47
    +
    ciphers::atbash::atbash_cipher
    std::string atbash_cipher(const std::string &text)
    atbash cipher encryption and decryption
    Definition atbash_cipher.cpp:47
    std::endl
    T endl(T... args)
    @@ -318,7 +318,7 @@ Here is the call graph for this function:
    diff --git a/dc/dfe/ternary__search_8cpp.html b/dc/dfe/ternary__search_8cpp.html index 93ed1fc4b..e37d423e0 100644 --- a/dc/dfe/ternary__search_8cpp.html +++ b/dc/dfe/ternary__search_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: search/ternary_search.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,9 +117,9 @@ Include dependency graph for ternary_search.cpp:
    - + - + @@ -126,15 +128,15 @@ Macros

    Macros

    #define absolutePrecision   10
    #define absolutePrecision   10
     
    #define _target   10
    #define _target   10
     
    #define MAX   10000000
    - + - + - + - + - +

    Functions

    void get_input ()
    void get_input ()
     
    int it_ternary_search (int left, int right, int A[], int target)
    int it_ternary_search (int left, int right, int A[], int target)
     
    int rec_ternary_search (int left, int right, int A[], int target)
    int rec_ternary_search (int left, int right, int A[], int target)
     
    void ternary_search (int N, int A[], int target)
    void ternary_search (int N, int A[], int target)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -185,12 +187,12 @@ Functions void get_input ( - ) + )
    -

    get_input function is to receive input from standard IO

    Todo:
    @christianbender Get input from STDIO or write input to memory as done above.
    +

    get_input function is to receive input from standard IO

    Todo
    @christianbender Get input from STDIO or write input to memory as done above.
    36{}
    @@ -204,31 +206,22 @@ Functions int it_ternary_search ( - int  - left, + int left, - int  - right, + int right, - int  - A[], + int A[], - int  - target  - - - - ) - + int target )
    @@ -247,16 +240,16 @@ Functions
    48 {
    49 while (1) {
    50 if (left < right) {
    -
    51 if (right - left < absolutePrecision) {
    -
    52 for (int i = left; i <= right; i++)
    +
    51 if (right - left < absolutePrecision) {
    +
    52 for (int i = left; i <= right; i++)
    53 if (A[i] == target)
    54 return i;
    55
    56 return -1;
    57 }
    58
    -
    59 int oneThird = (left + right) / 3 + 1;
    -
    60 int twoThird = (left + right) * 2 / 3 + 1;
    +
    59 int oneThird = (left + right) / 3 + 1;
    +
    60 int twoThird = (left + right) * 2 / 3 + 1;
    61
    62 if (A[oneThird] == target)
    63 return oneThird;
    @@ -266,16 +259,17 @@ Functions
    67 else if (target > A[twoThird])
    68 left = twoThird + 1;
    69 else if (target < A[oneThird])
    -
    70 right = oneThird - 1;
    +
    70 right = oneThird - 1;
    71
    72 else
    -
    73 left = oneThird + 1, right = twoThird - 1;
    +
    73 left = oneThird + 1, right = twoThird - 1;
    74 } else {
    75 return -1;
    76 }
    77 }
    78}
    -
    absolutePrecision
    #define absolutePrecision
    Definition ternary_search.cpp:22
    +
    std::right
    T right(T... args)
    +
    absolutePrecision
    #define absolutePrecision
    Definition ternary_search.cpp:22
    @@ -288,8 +282,7 @@ Functions int main ( - void  - ) + void ) @@ -298,14 +291,14 @@ Functions
    134 {
    135 int N = 21;
    136 int A[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 10};
    -
    137 get_input();
    -
    138 ternary_search(N, A, _target);
    +
    137 get_input();
    +
    138 ternary_search(N, A, _target);
    139 return 0;
    140}
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:47
    -
    _target
    #define _target
    Definition ternary_search.cpp:27
    -
    get_input
    void get_input()
    Definition ternary_search.cpp:36
    -
    ternary_search
    void ternary_search(int N, int A[], int target)
    Definition ternary_search.cpp:127
    +
    _target
    #define _target
    Definition ternary_search.cpp:27
    +
    get_input
    void get_input()
    Definition ternary_search.cpp:36
    +
    ternary_search
    void ternary_search(int N, int A[], int target)
    Definition ternary_search.cpp:127
    Here is the call graph for this function:
    @@ -323,31 +316,22 @@ Here is the call graph for this function:
    int rec_ternary_search ( - int  - left, + int left, - int  - right, + int right, - int  - A[], + int A[], - int  - target  - - - - ) - + int target )
    @@ -365,16 +349,16 @@ Here is the call graph for this function:
    -1 if target value not found
    90 {
    91 if (left < right) {
    -
    92 if (right - left < absolutePrecision) {
    -
    93 for (int i = left; i <= right; i++)
    +
    92 if (right - left < absolutePrecision) {
    +
    93 for (int i = left; i <= right; i++)
    94 if (A[i] == target)
    95 return i;
    96
    97 return -1;
    98 }
    99
    -
    100 int oneThird = (left + right) / 3 + 1;
    -
    101 int twoThird = (left + right) * 2 / 3 + 1;
    +
    100 int oneThird = (left + right) / 3 + 1;
    +
    101 int twoThird = (left + right) * 2 / 3 + 1;
    102
    103 if (A[oneThird] == target)
    104 return oneThird;
    @@ -382,16 +366,16 @@ Here is the call graph for this function:
    106 return twoThird;
    107
    108 if (target < A[oneThird])
    -
    109 return rec_ternary_search(left, oneThird - 1, A, target);
    +
    109 return rec_ternary_search(left, oneThird - 1, A, target);
    110 if (target > A[twoThird])
    -
    111 return rec_ternary_search(twoThird + 1, right, A, target);
    +
    111 return rec_ternary_search(twoThird + 1, right, A, target);
    112
    -
    113 return rec_ternary_search(oneThird + 1, twoThird - 1, A, target);
    +
    113 return rec_ternary_search(oneThird + 1, twoThird - 1, A, target);
    114 } else {
    115 return -1;
    116 }
    117}
    -
    rec_ternary_search
    int rec_ternary_search(int left, int right, int A[], int target)
    Definition ternary_search.cpp:90
    +
    rec_ternary_search
    int rec_ternary_search(int left, int right, int A[], int target)
    Definition ternary_search.cpp:90
    Here is the call graph for this function:
    @@ -409,25 +393,17 @@ Here is the call graph for this function:
    void ternary_search ( - int  - N, + int N, - int  - A[], + int A[], - int  - target  - - - - ) - + int target )
    @@ -440,13 +416,13 @@ Here is the call graph for this function:
    127 {
    -
    128 std::cout << it_ternary_search(0, N - 1, A, target) << '\t';
    -
    129 std::cout << rec_ternary_search(0, N - 1, A, target) << '\t';
    +
    128 std::cout << it_ternary_search(0, N - 1, A, target) << '\t';
    +
    129 std::cout << rec_ternary_search(0, N - 1, A, target) << '\t';
    130 std::cout << std::endl;
    131}
    std::endl
    T endl(T... args)
    -
    it_ternary_search
    int it_ternary_search(int left, int right, int A[], int target)
    Definition ternary_search.cpp:48
    +
    it_ternary_search
    int it_ternary_search(int left, int right, int A[], int target)
    Definition ternary_search.cpp:48
    Here is the call graph for this function:
    @@ -461,7 +437,7 @@ Here is the call graph for this function:
    diff --git a/dd/d03/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree-members.html b/dd/d03/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree-members.html index 6988bc0ab..79232bc02 100644 --- a/dd/d03/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree-members.html +++ b/dd/d03/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -117,7 +119,7 @@ $(document).ready(function(){initNavTree('de/dcf/classoperations__on__datastruct diff --git a/dd/d0c/hamiltons__cycle_8cpp.html b/dd/d0c/hamiltons__cycle_8cpp.html index 7afb6e65e..85b0dd19c 100644 --- a/dd/d0c/hamiltons__cycle_8cpp.html +++ b/dd/d0c/hamiltons__cycle_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph/hamiltons_cycle.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,15 +118,15 @@ Include dependency graph for hamiltons_cycle.cpp:
    - + - + - + - + - +

    Functions

    bool hamilton_cycle (const std::vector< std::vector< bool > > &routes)
    bool hamilton_cycle (const std::vector< std::vector< bool > > &routes)
     
    static void test1 ()
    static void test1 ()
     
    static void test2 ()
    static void test2 ()
     
    static void test3 ()
    static void test3 ()
     
    int main (int argc, char **argv)
    int main (int argc, char **argv)
     

    Detailed Description

    @@ -144,8 +146,7 @@ Functions bool hamilton_cycle ( - const std::vector< std::vector< bool > > &  - routes) + const std::vector< std::vector< bool > > & routes) @@ -163,14 +164,14 @@ Functions
    30 {
    31 const size_t n = routes.size();
    32 // height of dp array which is 2^n
    -
    33 const size_t height = 1 << n;
    -
    34 std::vector<std::vector<bool>> dp(height, std::vector<bool>(n, false));
    +
    33 const size_t height = 1 << n;
    +
    34 std::vector<std::vector<bool>> dp(height, std::vector<bool>(n, false));
    35
    36 // to fill in the [2^i, i] cells with true
    37 for (size_t i = 0; i < n; ++i) {
    38 dp[1 << i][i] = true;
    39 }
    -
    40 for (size_t i = 1; i < height; i++) {
    +
    40 for (size_t i = 1; i < height; i++) {
    41 std::vector<size_t> zeros, ones;
    42 // finding positions with 1s and 0s and separate them
    43 for (size_t pos = 0; pos < n; ++pos) {
    @@ -197,7 +198,7 @@ Functions
    64
    65 bool is_cycle = false;
    66 for (size_t i = 0; i < n; i++) {
    -
    67 is_cycle |= dp[height - 1][i];
    +
    67 is_cycle |= dp[height - 1][i];
    68 if (is_cycle) { // if true, all subsequent loop will be true. hence
    69 // break
    70 break;
    @@ -205,6 +206,7 @@ Functions
    72 }
    73 return is_cycle;
    74}
    +
    height
    int height(node *root)
    Definition avltree.cpp:38
    dp
    for std::vector
    Definition partition_problem.cpp:39
    std::vector::push_back
    T push_back(T... args)
    std::vector::size
    T size(T... args)
    @@ -212,7 +214,7 @@ Functions
    Here is the call graph for this function:
    -
    +
    @@ -226,19 +228,12 @@ Here is the call graph for this function: int main ( - int  - argc, + int argc, - char **  - argv  - - - - ) - + char ** argv )
    @@ -251,18 +246,18 @@ Here is the call graph for this function:
    142 {
    -
    143 test1();
    -
    144 test2();
    -
    145 test3();
    +
    143 test1();
    +
    144 test2();
    +
    145 test3();
    146 return 0;
    147}
    -
    test3
    static void test3()
    Definition hamiltons_cycle.cpp:122
    -
    test2
    static void test2()
    Definition hamiltons_cycle.cpp:103
    -
    test1
    static void test1()
    Definition hamiltons_cycle.cpp:81
    +
    test3
    static void test3()
    Definition hamiltons_cycle.cpp:122
    +
    test2
    static void test2()
    Definition hamiltons_cycle.cpp:103
    +
    test1
    static void test1()
    Definition hamiltons_cycle.cpp:81
    Here is the call graph for this function:
    -
    +
    @@ -279,7 +274,7 @@ Here is the call graph for this function: static void test1 ( - ) + ) @@ -289,7 +284,7 @@ Here is the call graph for this function:
    -

    this test is testing if hamilton_cycle returns true for graph: 1 -> 2 -> 3 -> 4

    Returns
    None
    +

    this test is testing if hamilton_cycle returns true for graph: 1 -> 2 -> 3 -> 4

    Returns
    None
    81 {
    82 std::vector<std::vector<bool>> arr{
    83 std::vector<bool>({true, true, false, false}),
    @@ -297,17 +292,17 @@ Here is the call graph for this function:
    85 std::vector<bool>({false, false, true, true}),
    86 std::vector<bool>({false, false, false, true})};
    87
    -
    88 bool ans = hamilton_cycle(arr);
    +
    88 bool ans = hamilton_cycle(arr);
    89 std::cout << "Test 1... ";
    90 assert(ans);
    91 std::cout << "passed\n";
    92}
    -
    hamilton_cycle
    bool hamilton_cycle(const std::vector< std::vector< bool > > &routes)
    Definition hamiltons_cycle.cpp:30
    +
    hamilton_cycle
    bool hamilton_cycle(const std::vector< std::vector< bool > > &routes)
    Definition hamiltons_cycle.cpp:30
    Here is the call graph for this function:
    -
    +
    @@ -324,7 +319,7 @@ Here is the call graph for this function: static void test2 ( - ) + ) @@ -334,7 +329,7 @@ Here is the call graph for this function:
    -

    this test is testing if hamilton_cycle returns false for
    +

    this test is testing if hamilton_cycle returns false for
    graph:

      1 -> 2 -> 3
       |
@@ -347,7 +342,7 @@ Here is the call graph for this function:
    107 std::vector<bool>({false, false, true, false}),
    108 std::vector<bool>({false, false, false, true})};
    109
    -
    110 bool ans = hamilton_cycle(arr);
    +
    110 bool ans = hamilton_cycle(arr);
    111
    112 std::cout << "Test 2... ";
    113 assert(!ans); // not a cycle
    @@ -356,7 +351,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -373,7 +368,7 @@ Here is the call graph for this function: static void test3 ( - ) + ) @@ -383,7 +378,7 @@ Here is the call graph for this function:
    -

    this test is testing if hamilton_cycle returns true for clique with 4 vertices

    Returns
    None
    +

    this test is testing if hamilton_cycle returns true for clique with 4 vertices

    Returns
    None
    122 {
    123 std::vector<std::vector<bool>> arr{
    124 std::vector<bool>({true, true, true, true}),
    @@ -391,7 +386,7 @@ Here is the call graph for this function:
    126 std::vector<bool>({true, true, true, true}),
    127 std::vector<bool>({true, true, true, true})};
    128
    -
    129 bool ans = hamilton_cycle(arr);
    +
    129 bool ans = hamilton_cycle(arr);
    130
    131 std::cout << "Test 3... ";
    132 assert(ans);
    @@ -400,7 +395,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -411,7 +406,7 @@ Here is the call graph for this function: diff --git a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.map b/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.map index cf4276ccc..ba0f1d6f1 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.map +++ b/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.map @@ -1,7 +1,12 @@ - - - - - + + + + + + + + + + diff --git a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.md5 b/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.md5 index cfbae6cad..76b512b67 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.md5 +++ b/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.md5 @@ -1 +1 @@ -a948bad6e6e75ee40c2518924c83cf4d \ No newline at end of file +054d18d4c71b0dfd606db7a2a6cd588b \ No newline at end of file diff --git a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.svg b/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.svg index 526fce17e..3b41efb48 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.svg +++ b/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.svg @@ -4,8 +4,8 @@ - + - + test3 Node1 - -test3 + +test3 @@ -31,8 +31,8 @@ Node2 - -hamilton_cycle + +hamilton_cycle @@ -40,17 +40,17 @@ Node1->Node2 - - + + Node3 - - -std::vector::push_back + + +height @@ -58,8 +58,53 @@ Node2->Node3 - - + + + + + + + +Node5 + + +std::vector::push_back + + + + + +Node2->Node5 + + + + + + + + +Node3->Node3 + + + + + + + + +Node4 + + +std::max + + + + + +Node3->Node4 + + + diff --git a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph_org.svg b/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph_org.svg index 72cdca233..2e137adb5 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph_org.svg +++ b/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + test3 Node1 - -test3 + +test3 @@ -21,8 +21,8 @@ Node2 - -hamilton_cycle + +hamilton_cycle @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node3 - - -std::vector::push_back + + +height @@ -48,8 +48,53 @@ Node2->Node3 - - + + + + + + + +Node5 + + +std::vector::push_back + + + + + +Node2->Node5 + + + + + + + + +Node3->Node3 + + + + + + + + +Node4 + + +std::max + + + + + +Node3->Node4 + + + diff --git a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map index e346c5e93..f7b1e8398 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map +++ b/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map @@ -2,14 +2,19 @@ - - - - + + + + - - - - + + + + + + + + + diff --git a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 index 418aed3b6..ea42e5c26 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 +++ b/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 @@ -1 +1 @@ -8490cfb34f9c65fb710651234a4240a5 \ No newline at end of file +6ecb8d665924611cb13dd8de8254c8fd \ No newline at end of file diff --git a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg index e55dce96e..292e037b1 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg +++ b/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg @@ -4,8 +4,8 @@ - + - + test2 Node1 - -test2 + +test2 @@ -31,8 +31,8 @@ Node2 - -hamilton_cycle + +hamilton_cycle @@ -40,17 +40,17 @@ Node1->Node2 - - + + Node3 - - -std::vector::push_back + + +height @@ -58,8 +58,53 @@ Node2->Node3 - - + + + + + + + +Node5 + + +std::vector::push_back + + + + + +Node2->Node5 + + + + + + + + +Node3->Node3 + + + + + + + + +Node4 + + +std::max + + + + + +Node3->Node4 + + + diff --git a/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg b/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg index 459bc75f7..0c710ab98 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg +++ b/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + test2 Node1 - -test2 + +test2 @@ -21,8 +21,8 @@ Node2 - -hamilton_cycle + +hamilton_cycle @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node3 - - -std::vector::push_back + + +height @@ -48,8 +48,53 @@ Node2->Node3 - - + + + + + + + +Node5 + + +std::vector::push_back + + + + + +Node2->Node5 + + + + + + + + +Node3->Node3 + + + + + + + + +Node4 + + +std::max + + + + + +Node3->Node4 + + + diff --git a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.map b/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.map index a1ddf0a70..2b6fdaa61 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.map +++ b/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.map @@ -1,5 +1,10 @@ - - - + + + + + + + + diff --git a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.md5 b/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.md5 index c519093b7..5ef745784 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.md5 +++ b/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.md5 @@ -1 +1 @@ -1b142c5ecdbd7ababf21d1809f0bb358 \ No newline at end of file +79190585701eca9074f0e0ae40b0bfd8 \ No newline at end of file diff --git a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.svg b/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.svg index 92a9472c2..3516c9d62 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.svg +++ b/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.svg @@ -4,8 +4,8 @@ - + - + hamilton_cycle Node1 - -hamilton_cycle + +hamilton_cycle Node2 - - -std::vector::push_back + + +height @@ -40,8 +40,53 @@ Node1->Node2 - - + + + + + + + +Node4 + + +std::vector::push_back + + + + + +Node1->Node4 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + diff --git a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph_org.svg b/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph_org.svg index ef2e278ce..8c24f1eb1 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph_org.svg +++ b/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph_org.svg @@ -4,25 +4,25 @@ - - + + hamilton_cycle Node1 - -hamilton_cycle + +hamilton_cycle Node2 - - -std::vector::push_back + + +height @@ -30,8 +30,53 @@ Node1->Node2 - - + + + + + + + +Node4 + + +std::vector::push_back + + + + + +Node1->Node4 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + diff --git a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map b/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map index b94cb2736..0e6c5a593 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map +++ b/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map @@ -1,7 +1,12 @@ - - - - - + + + + + + + + + + diff --git a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5 b/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5 index 57f79bcb5..fb79b3886 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5 +++ b/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5 @@ -1 +1 @@ -a2d46134d1967e8db3c4504d7c1145e6 \ No newline at end of file +457fcc21c15ac4cb4775f4f00aa99945 \ No newline at end of file diff --git a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg b/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg index f411894c5..9d3dbb0e4 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg +++ b/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg @@ -4,8 +4,8 @@ - + - + test1 Node1 - -test1 + +test1 @@ -31,8 +31,8 @@ Node2 - -hamilton_cycle + +hamilton_cycle @@ -40,17 +40,17 @@ Node1->Node2 - - + + Node3 - - -std::vector::push_back + + +height @@ -58,8 +58,53 @@ Node2->Node3 - - + + + + + + + +Node5 + + +std::vector::push_back + + + + + +Node2->Node5 + + + + + + + + +Node3->Node3 + + + + + + + + +Node4 + + +std::max + + + + + +Node3->Node4 + + + diff --git a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg b/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg index e67728cb3..4108bd47a 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg +++ b/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + test1 Node1 - -test1 + +test1 @@ -21,8 +21,8 @@ Node2 - -hamilton_cycle + +hamilton_cycle @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node3 - - -std::vector::push_back + + +height @@ -48,8 +48,53 @@ Node2->Node3 - - + + + + + + + +Node5 + + +std::vector::push_back + + + + + +Node2->Node5 + + + + + + + + +Node3->Node3 + + + + + + + + +Node4 + + +std::max + + + + + +Node3->Node4 + + + diff --git a/dd/d0d/insertion__sort_8cpp.html b/dd/d0d/insertion__sort_8cpp.html index 9a4a16d09..6173313c2 100644 --- a/dd/d0d/insertion__sort_8cpp.html +++ b/dd/d0d/insertion__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/insertion_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -132,12 +134,12 @@ Functions void sorting::insertionSort (std::vector< T > *arr)   template<typename T > -static void create_random_array (T *arr, int N) +static void create_random_array (T *arr, int N)  Create a random array objecthelper function to create a random array.
      -void tests () +void tests ()   -int main () +int main ()  

    Detailed Description

    @@ -183,19 +185,12 @@ template<typename T >
    static void create_random_array ( - T *  - arr, + T * arr, - int  - N  - - - - ) - + int N ) @@ -244,8 +239,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -255,7 +249,7 @@ Here is the call graph for this function:

    For user insteraction

    150 {
    151 /// Running predefined tests to test algorithm
    -
    152 tests();
    +
    152 tests();
    153
    154 /// For user insteraction
    155 size_t n;
    @@ -286,7 +280,7 @@ Here is the call graph for this function:
    std::endl
    T endl(T... args)
    -
    tests
    void tests()
    Definition insertion_sort.cpp:109
    +
    tests
    void tests()
    Definition insertion_sort.cpp:109
    sorting::insertionSort
    void insertionSort(T *arr, int n)
    Insertion Sort Function.
    Definition insertion_sort.cpp:59
    Here is the call graph for this function:
    @@ -305,7 +299,7 @@ Here is the call graph for this function: void tests ( - ) + ) @@ -338,21 +332,21 @@ Here is the call graph for this function:
    133
    134 int arr5[50];
    135 std::cout << "Test 5... ";
    -
    136 create_random_array(arr5, 50);
    +
    136 create_random_array(arr5, 50);
    137 sorting::insertionSort(arr5, 50);
    138 assert(std::is_sorted(arr5, arr5 + 50));
    139 std::cout << "passed" << std::endl;
    140
    141 float arr6[50];
    142 std::cout << "Test 6... ";
    -
    143 create_random_array(arr6, 50);
    +
    143 create_random_array(arr6, 50);
    144 sorting::insertionSort(arr6, 50);
    145 assert(std::is_sorted(arr6, arr6 + 50));
    146 std::cout << "passed" << std::endl;
    147}
    std::begin
    T begin(T... args)
    std::end
    T end(T... args)
    -
    create_random_array
    static void create_random_array(T *arr, int N)
    Create a random array objecthelper function to create a random array.
    Definition insertion_sort.cpp:101
    +
    create_random_array
    static void create_random_array(T *arr, int N)
    Create a random array objecthelper function to create a random array.
    Definition insertion_sort.cpp:101
    std::is_sorted
    T is_sorted(T... args)
    @@ -369,7 +363,7 @@ Here is the call graph for this function:
    diff --git a/dd/d12/vigenere__cipher_8cpp.html b/dd/d12/vigenere__cipher_8cpp.html index 8215e649e..571fca11e 100644 --- a/dd/d12/vigenere__cipher_8cpp.html +++ b/dd/d12/vigenere__cipher_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ciphers/vigenere_cipher.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,13 +128,13 @@ Namespaces - + - + - + - +

    Functions

    std::string ciphers::vigenere::encrypt (const std::string &text, const std::string &key)
    std::string ciphers::vigenere::encrypt (const std::string &text, const std::string &key)
     
    std::string ciphers::vigenere::decrypt (const std::string &text, const std::string &key)
    std::string ciphers::vigenere::decrypt (const std::string &text, const std::string &key)
     
    void test ()
    void test ()
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -164,19 +166,12 @@ This program implements Vigenère cipher for only uppercase English alphabet cha std::string ciphers::vigenere::decrypt ( - const std::string &  - text, + const std::string & text, - const std::string &  - key  - - - - ) - + const std::string & key )
    @@ -221,19 +216,12 @@ Here is the call graph for this function:
    std::string ciphers::vigenere::encrypt ( - const std::string &  - text, + const std::string & text, - const std::string &  - key  - - - - ) - + const std::string & key )
    @@ -275,8 +263,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -284,10 +271,10 @@ Here is the call graph for this function:

    Driver Code

    131 {
    132 // Testing
    -
    133 test();
    +
    133 test();
    134 return 0;
    135}
    -
    test
    void test()
    Definition vigenere_cipher.cpp:111
    +
    test
    void test()
    Definition vigenere_cipher.cpp:111
    Here is the call graph for this function:
    @@ -305,7 +292,7 @@ Here is the call graph for this function:
    void test ( - ) + ) @@ -314,16 +301,16 @@ Here is the call graph for this function:
    111 {
    112 // Test 1
    113 std::string text1 = "NIKOLATESLA";
    -
    114 std::string encrypted1 = ciphers::vigenere::encrypt(text1, "TESLA");
    -
    115 std::string decrypted1 = ciphers::vigenere::decrypt(encrypted1, "TESLA");
    +
    114 std::string encrypted1 = ciphers::vigenere::encrypt(text1, "TESLA");
    +
    115 std::string decrypted1 = ciphers::vigenere::decrypt(encrypted1, "TESLA");
    116 assert(text1 == decrypted1);
    117 std::cout << "Original text : " << text1;
    118 std::cout << " , Encrypted text (with key = TESLA) : " << encrypted1;
    119 std::cout << " , Decrypted text : "<< decrypted1 << std::endl;
    120 // Test 2
    121 std::string text2 = "GOOGLEIT";
    -
    122 std::string encrypted2 = ciphers::vigenere::encrypt(text2, "REALLY");
    -
    123 std::string decrypted2 = ciphers::vigenere::decrypt(encrypted2, "REALLY");
    +
    122 std::string encrypted2 = ciphers::vigenere::encrypt(text2, "REALLY");
    +
    123 std::string decrypted2 = ciphers::vigenere::decrypt(encrypted2, "REALLY");
    124 assert(text2 == decrypted2);
    125 std::cout << "Original text : " << text2;
    126 std::cout << " , Encrypted text (with key = REALLY) : " << encrypted2;
    @@ -331,8 +318,8 @@ Here is the call graph for this function:
    128}
    std::endl
    T endl(T... args)
    -
    ciphers::vigenere::decrypt
    std::string decrypt(const std::string &text, const std::string &key)
    Definition vigenere_cipher.cpp:92
    -
    ciphers::vigenere::encrypt
    std::string encrypt(const std::string &text, const std::string &key)
    Definition vigenere_cipher.cpp:73
    +
    ciphers::vigenere::decrypt
    std::string decrypt(const std::string &text, const std::string &key)
    Definition vigenere_cipher.cpp:92
    +
    ciphers::vigenere::encrypt
    std::string encrypt(const std::string &text, const std::string &key)
    Definition vigenere_cipher.cpp:73
    Here is the call graph for this function:
    @@ -347,7 +334,7 @@ Here is the call graph for this function:
    diff --git a/dd/d1b/structquery.html b/dd/d1b/structquery.html index d2958fffb..721587583 100644 --- a/dd/d1b/structquery.html +++ b/dd/d1b/structquery.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: query Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -125,7 +127,7 @@ int i diff --git a/dd/d1c/classhash__chain.html b/dd/d1c/classhash__chain.html index 05a579c13..2ff716099 100644 --- a/dd/d1c/classhash__chain.html +++ b/dd/d1c/classhash__chain.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: hash_chain Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,46 +109,41 @@ $(document).ready(function(){initNavTree('dd/d1c/classhash__chain.html','../../'

    Chain class with a given modulus. - More...

    + More...

    Collaboration diagram for hash_chain:
    -
    +
    [legend]
    - + - + - + - + - +

    Public Member Functions

     hash_chain (int mod)
     hash_chain (int mod)
     Construct a new chain object.
     
    void add (int x, int h)
    void add (int x, int h)
     create and add a new node with a give value and at a given height
     
    void display ()
    void display ()
     Display the chain.
     
    virtual int hash (int x) const
    virtual int hash (int x) const
     Compute the hash of a value for current chain.
     
    bool find (int x, int h) const
    bool find (int x, int h) const
     Find if a value and corresponding hash exist.
     
    - - - + + +

    Private Types

    -using Node = Node { int data{}
     data stored in the node
     
    using Node
     Define a linked node.
     
    - - - +std::vector< std::shared_ptr< Node > > 

    Private Attributes

    -std::shared_ptr< struct Node > next
     pointer to the next node
     
    -std::vector< std::shared_ptr< Node > > head
    head
     array of nodes
     
    @@ -156,7 +153,44 @@ int _mod

    Detailed Description

    Chain class with a given modulus.

    -

    Constructor & Destructor Documentation

    +

    Member Typedef Documentation

    + +

    ◆ Node

    + +
    +
    + + + + + +
    + + + + +
    using hash_chain::Node
    +     		+private
    +
    +Initial value:
    struct Node {
    +
    int data{};
    +
    std::shared_ptr<struct Node> next;
    +
    }
    +
    data
    int data[MAX]
    test data
    Definition hash_search.cpp:24
    + +
    Node
    Definition linkedlist_implentation_usingarray.cpp:14
    +
    +

    Define a linked node.

    +
    21 {
    +
    22 int data{}; ///< data stored in the node
    +
    23 std::shared_ptr<struct Node> next; ///< pointer to the next node
    +
    24 };
    +
    std::next
    T next(T... args)
    +
    +
    +
    +

    Constructor & Destructor Documentation

    ◆ hash_chain()

    @@ -169,8 +203,7 @@ int _mod hash_chain::hash_chain ( - int  - mod) + int mod) @@ -188,11 +221,11 @@ int _mod -
    35 : _mod(mod) {
    -
    36 while (mod--) head.push_back(nullptr);
    +
    35 : _mod(mod) {
    +
    36 while (mod--) head.push_back(nullptr);
    37 }
    -
    hash_chain::head
    std::vector< std::shared_ptr< Node > > head
    array of nodes
    Definition chaining.cpp:26
    -
    hash_chain::_mod
    int _mod
    modulus of the class
    Definition chaining.cpp:27
    +
    hash_chain::head
    std::vector< std::shared_ptr< Node > > head
    array of nodes
    Definition chaining.cpp:26
    +
    hash_chain::_mod
    int _mod
    modulus of the class
    Definition chaining.cpp:27
    std::vector::push_back
    T push_back(T... args)
    Here is the call graph for this function:
    @@ -215,19 +248,12 @@ Here is the call graph for this function:
    void hash_chain::add ( - int  - x, + int x, - int  - h  - - - - ) - + int h ) @@ -250,18 +276,16 @@ Here is the call graph for this function:
    47 std::shared_ptr<Node> temp(new Node);
    48 temp->data = x;
    49 temp->next = nullptr;
    -
    50 if (!head[h]) {
    -
    51 head[h] = temp;
    -
    52 curr = head[h];
    +
    50 if (!head[h]) {
    +
    51 head[h] = temp;
    +
    52 curr = head[h];
    53 } else {
    -
    54 curr = head[h];
    +
    54 curr = head[h];
    55 while (curr->next) curr = curr->next;
    56 curr->next = temp;
    57 }
    58 }
    h
    int h(int key)
    Definition hash_search.cpp:45
    - -
    Node
    Definition linkedlist_implentation_usingarray.cpp:14
    Here is the call graph for this function:
    @@ -282,7 +306,7 @@ Here is the call graph for this function:
    void hash_chain::display ( - ) + ) @@ -297,12 +321,12 @@ Here is the call graph for this function:
    63 {
    64 std::shared_ptr<Node> temp = nullptr;
    65 int i = 0;
    -
    66 for (i = 0; i < _mod; i++) {
    -
    67 if (!head[i]) {
    +
    66 for (i = 0; i < _mod; i++) {
    +
    67 if (!head[i]) {
    68 std::cout << "Key " << i << " is empty" << std::endl;
    69 } else {
    70 std::cout << "Key " << i << " has values = " << std::endl;
    -
    71 temp = head[i];
    +
    71 temp = head[i];
    72 while (temp->next) {
    73 std::cout << temp->data << " " << std::endl;
    74 temp = temp->next;
    @@ -334,19 +358,12 @@ Here is the call graph for this function:
    bool hash_chain::find ( - int  - x, + int x, - int  - h  - - - - ) - const + int h ) const @@ -368,8 +385,8 @@ Here is the call graph for this function:
    false if element not found
    101 {
    -
    102 std::shared_ptr<Node> temp = head[h];
    -
    103 if (!head[h]) {
    +
    102 std::shared_ptr<Node> temp = head[h];
    +
    103 if (!head[h]) {
    104 // index does not exist!
    105 std::cout << "Element not found" << std::endl;
    106 return false;
    @@ -414,8 +431,7 @@ Here is the call graph for this function:
    virtual int hash_chain::hash ( - int  - x) + int x) const @@ -435,7 +451,7 @@ Here is the call graph for this function:
    Returns
    modulus of x
    Note
    declared as a virtual so that custom implementations of the class can modify the hash function.
    -
    91{ return x % _mod; }
    +
    91{ return x % _mod; }
    @@ -448,7 +464,7 @@ Here is the call graph for this function: diff --git a/dd/d1c/classhash__chain.js b/dd/d1c/classhash__chain.js index 398599c99..d70ef6099 100644 --- a/dd/d1c/classhash__chain.js +++ b/dd/d1c/classhash__chain.js @@ -1,12 +1,11 @@ var classhash__chain = [ - [ "Node", "dd/d1c/classhash__chain.html#a28d3adffc0126beeef63bce0846fb8f5", null ], + [ "Node", "dd/d1c/classhash__chain.html#a8b204861e9470377c956d3b5cd313036", null ], [ "hash_chain", "dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595", null ], [ "add", "dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff", null ], [ "display", "dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed", null ], [ "find", "dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a", null ], [ "hash", "dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64", null ], [ "_mod", "dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2", null ], - [ "head", "dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0", null ], - [ "next", "dd/d1c/classhash__chain.html#a48236d44349c3ebce4774b706f4f8a0f", null ] + [ "head", "dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0", null ] ]; \ No newline at end of file diff --git a/dd/d1e/generate__parentheses_8cpp.html b/dd/d1e/generate__parentheses_8cpp.html index bcb16eead..7fa2c8ff4 100644 --- a/dd/d1e/generate__parentheses_8cpp.html +++ b/dd/d1e/generate__parentheses_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: backtracking/generate_parentheses.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -130,10 +132,10 @@ Namespaces - + - +

    Functions

    static void test ()
    static void test ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -151,8 +153,7 @@ Functions int main ( - void  - ) + void ) @@ -163,10 +164,10 @@ Functions
    Examples
    /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/iterative_factorial.cpp, /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp, /Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp, and /Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp.
    110 {
    -
    111 test(); // run self-test implementations
    +
    111 test(); // run self-test implementations
    112 return 0;
    113}
    -
    test
    static void test()
    Self-test implementations.
    Definition generate_parentheses.cpp:82
    +
    test
    static void test()
    Self-test implementations.
    Definition generate_parentheses.cpp:82
    Here is the call graph for this function:
    @@ -187,7 +188,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -243,7 +244,7 @@ Here is the call graph for this function:
    diff --git a/dd/d1f/classdsu.html b/dd/d1f/classdsu.html index 7f1c6401c..f0b9ac6d8 100644 --- a/dd/d1f/classdsu.html +++ b/dd/d1f/classdsu.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dsu Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('dd/d1f/classdsu.html','../../'); initR

    Disjoint sets union data structure, class based representation. - More...

    + More...

    Collaboration diagram for dsu:
    @@ -115,43 +117,43 @@ Collaboration diagram for dsu:
    - + - + - + - + - + - + - + - + - + - + - + - + - +

    Public Member Functions

     dsu (uint64_t n)
     dsu (uint64_t n)
     contructor for initialising all data members.
     
    uint64_t findSet (uint64_t i)
    uint64_t findSet (uint64_t i)
     Method to find the representative of the set to which i belongs to, T(n) = O(1)
     
    void UnionSet (uint64_t i, uint64_t j)
    void UnionSet (uint64_t i, uint64_t j)
     Method that combines two disjoint sets to which i and j belongs to and make a single set having a common representative.
     
    bool isSame (uint64_t i, uint64_t j)
    bool isSame (uint64_t i, uint64_t j)
     A utility function which check whether i and j belongs to same set or not.
     
    vector< uint64_t > get (uint64_t i)
    vector< uint64_t > get (uint64_t i)
     prints the minimum, maximum and size of the set to which i belongs to
     
    uint64_t size (uint64_t i)
    uint64_t size (uint64_t i)
     A utility function that returns the size of the set to which i belongs to.
     
    uint64_t get_max (uint64_t i)
    uint64_t get_max (uint64_t i)
     A utility function that returns the max element of the set to which i belongs to.
     
    uint64_t get_min (uint64_t i)
    uint64_t get_min (uint64_t i)
     A utility function that returns the min element of the set to which i belongs to.
     
     dsu (uint64_t n)
     dsu (uint64_t n)
     constructor for initialising all data members
     
    uint64_t findSet (uint64_t i)
    uint64_t findSet (uint64_t i)
     Method to find the representative of the set to which i belongs to, T(n) = O(logN)
     
    void unionSet (uint64_t i, uint64_t j)
    void unionSet (uint64_t i, uint64_t j)
     Method that combines two disjoint sets to which i and j belongs to and make a single set having a common representative.
     
    bool isSame (uint64_t i, uint64_t j)
    bool isSame (uint64_t i, uint64_t j)
     A utility function which check whether i and j belongs to same set or not.
     
    vector< uint64_t > getParents (uint64_t i)
    vector< uint64_t > getParents (uint64_t i)
     Method to print all the parents of i, or the path from i to representative.
     
    @@ -163,7 +165,7 @@ Private Attributes - + @@ -199,8 +201,7 @@ Private Attributes - - +
     
    vector< uint64_t > depth
     tracks the depth(rank) of i in the tree
     tracks the depth(rank) of i in the tree
     
    vector< uint64_t > setSize
    dsu::dsu (uint64_t n)uint64_t n)
    @@ -222,32 +223,32 @@ Private Attributes

    initially all have depth are equals to zero

    initially set size will be equals to one

    45 {
    -
    46 p.assign(n, 0);
    +
    46 p.assign(n, 0);
    47 /// initially, all of them are their own parents
    48 for (uint64_t i = 0; i < n; i++) {
    -
    49 p[i] = i;
    +
    49 p[i] = i;
    50 }
    51 /// initially all have depth are equals to zero
    -
    52 depth.assign(n, 0);
    -
    53 maxElement.assign(n, 0);
    -
    54 minElement.assign(n, 0);
    +
    52 depth.assign(n, 0);
    +
    53 maxElement.assign(n, 0);
    +
    54 minElement.assign(n, 0);
    55 for (uint64_t i = 0; i < n; i++) {
    -
    56 depth[i] = 0;
    -
    57 maxElement[i] = i;
    -
    58 minElement[i] = i;
    +
    56 depth[i] = 0;
    +
    57 maxElement[i] = i;
    +
    58 minElement[i] = i;
    59 }
    -
    60 setSize.assign(n, 0);
    +
    60 setSize.assign(n, 0);
    61 /// initially set size will be equals to one
    62 for (uint64_t i = 0; i < n; i++) {
    -
    63 setSize[i] = 1;
    +
    63 setSize[i] = 1;
    64 }
    65 }
    std::vector::assign
    T assign(T... args)
    -
    dsu::minElement
    vector< uint64_t > minElement
    minimum of each set to which i belongs to
    Definition dsu_path_compression.cpp:39
    -
    dsu::p
    vector< uint64_t > p
    keeps track of the parent of ith element
    Definition dsu_path_compression.cpp:35
    -
    dsu::maxElement
    vector< uint64_t > maxElement
    maximum of each set to which i belongs to
    Definition dsu_path_compression.cpp:38
    -
    dsu::depth
    vector< uint64_t > depth
    tracks the depth(rank) of i in the tree
    Definition dsu_path_compression.cpp:36
    -
    dsu::setSize
    vector< uint64_t > setSize
    size of each chunk(set)
    Definition dsu_path_compression.cpp:37
    +
    dsu::minElement
    vector< uint64_t > minElement
    minimum of each set to which i belongs to
    Definition dsu_path_compression.cpp:39
    +
    dsu::p
    vector< uint64_t > p
    keeps track of the parent of ith element
    Definition dsu_path_compression.cpp:35
    +
    dsu::maxElement
    vector< uint64_t > maxElement
    maximum of each set to which i belongs to
    Definition dsu_path_compression.cpp:38
    +
    dsu::depth
    vector< uint64_t > depth
    tracks the depth(rank) of i in the tree
    Definition dsu_path_compression.cpp:36
    +
    dsu::setSize
    vector< uint64_t > setSize
    size of each chunk(set)
    Definition dsu_path_compression.cpp:37
    Here is the call graph for this function:
    @@ -268,8 +269,7 @@ Here is the call graph for this function:
    dsu::dsu ( - uint64_t  - n) + uint64_t n) @@ -289,14 +289,14 @@ Here is the call graph for this function:

    initially all of them are their own parents

    44 {
    -
    45 p.assign(n, 0);
    +
    45 p.assign(n, 0);
    46 /// initially all of them are their own parents
    -
    47 depth.assign(n, 0);
    -
    48 setSize.assign(n, 0);
    +
    47 depth.assign(n, 0);
    +
    48 setSize.assign(n, 0);
    49 for (uint64_t i = 0; i < n; i++) {
    -
    50 p[i] = i;
    -
    51 depth[i] = 0;
    -
    52 setSize[i] = 1;
    +
    50 p[i] = i;
    +
    51 depth[i] = 0;
    +
    52 setSize[i] = 1;
    53 }
    54 }
    @@ -320,8 +320,7 @@ Here is the call graph for this function:
    uint64_t dsu::findSet ( - uint64_t  - i) + uint64_t i) @@ -343,12 +342,12 @@ Here is the call graph for this function:

    using path compression

    73 {
    74 /// using path compression
    -
    75 if (p[i] == i) {
    +
    75 if (p[i] == i) {
    76 return i;
    77 }
    -
    78 return (p[i] = findSet(p[i]));
    +
    78 return (p[i] = findSet(p[i]));
    79 }
    -
    dsu::findSet
    uint64_t findSet(uint64_t i)
    Method to find the representative of the set to which i belongs to, T(n) = O(1)
    Definition dsu_path_compression.cpp:73
    +
    dsu::findSet
    uint64_t findSet(uint64_t i)
    Method to find the representative of the set to which i belongs to, T(n) = O(1)
    Definition dsu_path_compression.cpp:73
    Here is the call graph for this function:
    @@ -369,8 +368,7 @@ Here is the call graph for this function:
    uint64_t dsu::findSet ( - uint64_t  - i) + uint64_t i) @@ -392,8 +390,8 @@ Here is the call graph for this function:

    using union-rank

    61 {
    62 /// using union-rank
    -
    63 while (i != p[i]) {
    -
    64 i = p[i];
    +
    63 while (i != p[i]) {
    +
    64 i = p[i];
    65 }
    66 return i;
    67 }
    @@ -412,8 +410,7 @@ Here is the call graph for this function:
    vector< uint64_t > dsu::get ( - uint64_t  - i) + uint64_t i) @@ -434,14 +431,14 @@ Here is the call graph for this function:
    Returns
    void
    135 {
    136 vector<uint64_t> ans;
    -
    137 ans.push_back(get_min(i));
    -
    138 ans.push_back(get_max(i));
    -
    139 ans.push_back(size(i));
    +
    137 ans.push_back(get_min(i));
    +
    138 ans.push_back(get_max(i));
    +
    139 ans.push_back(size(i));
    140 return ans;
    141 }
    -
    dsu::size
    uint64_t size(uint64_t i)
    A utility function that returns the size of the set to which i belongs to.
    Definition dsu_path_compression.cpp:148
    -
    dsu::get_max
    uint64_t get_max(uint64_t i)
    A utility function that returns the max element of the set to which i belongs to.
    Definition dsu_path_compression.cpp:155
    -
    dsu::get_min
    uint64_t get_min(uint64_t i)
    A utility function that returns the min element of the set to which i belongs to.
    Definition dsu_path_compression.cpp:162
    +
    dsu::size
    uint64_t size(uint64_t i)
    A utility function that returns the size of the set to which i belongs to.
    Definition dsu_path_compression.cpp:148
    +
    dsu::get_max
    uint64_t get_max(uint64_t i)
    A utility function that returns the max element of the set to which i belongs to.
    Definition dsu_path_compression.cpp:155
    +
    dsu::get_min
    uint64_t get_min(uint64_t i)
    A utility function that returns the min element of the set to which i belongs to.
    Definition dsu_path_compression.cpp:162
    Here is the call graph for this function:
    @@ -463,8 +460,7 @@ Here is the call graph for this function: uint64_t dsu::get_max ( - uint64_t  - i) + uint64_t i) @@ -483,7 +479,7 @@ Here is the call graph for this function:
    Returns
    maximum of the set to which i belongs to
    -
    155{ return maxElement[findSet(i)]; }
    +
    155{ return maxElement[findSet(i)]; }
    Here is the call graph for this function:
    @@ -504,8 +500,7 @@ Here is the call graph for this function:
    uint64_t dsu::get_min ( - uint64_t  - i) + uint64_t i) @@ -524,7 +519,7 @@ Here is the call graph for this function:
    Returns
    minimum of the set to which i belongs to
    -
    162{ return minElement[findSet(i)]; }
    +
    162{ return minElement[findSet(i)]; }
    Here is the call graph for this function:
    @@ -545,8 +540,7 @@ Here is the call graph for this function:
    vector< uint64_t > dsu::getParents ( - uint64_t  - i) + uint64_t i) @@ -567,9 +561,9 @@ Here is the call graph for this function:
    Returns
    void
    119 {
    120 vector<uint64_t> ans;
    -
    121 while (p[i] != i) {
    +
    121 while (p[i] != i) {
    122 ans.push_back(i);
    -
    123 i = p[i];
    +
    123 i = p[i];
    124 }
    125 ans.push_back(i);
    126 return ans;
    @@ -589,19 +583,12 @@ Here is the call graph for this function:
    bool dsu::isSame ( - uint64_t  - i, + uint64_t i, - uint64_t  - j  - - - - ) - + uint64_t j ) @@ -623,7 +610,7 @@ Here is the call graph for this function:
    false if element i and j are NOT in same set
    123 {
    -
    124 if (findSet(i) == findSet(j)) {
    +
    124 if (findSet(i) == findSet(j)) {
    125 return true;
    126 }
    127 return false;
    @@ -648,19 +635,12 @@ Here is the call graph for this function:
    bool dsu::isSame ( - uint64_t  - i, + uint64_t i, - uint64_t  - j  - - - - ) - + uint64_t j ) @@ -682,7 +662,7 @@ Here is the call graph for this function:
    false if element i and j are not in same set
    107 {
    -
    108 if (findSet(i) == findSet(j)) {
    +
    108 if (findSet(i) == findSet(j)) {
    109 return true;
    110 }
    111 return false;
    @@ -707,8 +687,7 @@ Here is the call graph for this function:
    uint64_t dsu::size ( - uint64_t  - i) + uint64_t i) @@ -727,7 +706,7 @@ Here is the call graph for this function:
    Returns
    size of the set to which i belongs to
    -
    148{ return setSize[findSet(i)]; }
    +
    148{ return setSize[findSet(i)]; }
    Here is the call graph for this function:
    @@ -748,19 +727,12 @@ Here is the call graph for this function:
    void dsu::UnionSet ( - uint64_t  - i, + uint64_t i, - uint64_t  - j  - - - - ) - + uint64_t j ) @@ -787,33 +759,33 @@ Here is the call graph for this function:

    changing the maximum elements

    87 {
    88 /// check if both belongs to the same set or not
    -
    89 if (isSame(i, j)) {
    +
    89 if (isSame(i, j)) {
    90 return;
    91 }
    92
    93 // we find the representative of the i and j
    -
    94 uint64_t x = findSet(i);
    -
    95 uint64_t y = findSet(j);
    +
    94 uint64_t x = findSet(i);
    +
    95 uint64_t y = findSet(j);
    96
    97 /// always keeping the min as x
    98 /// shallow tree
    -
    99 if (depth[x] > depth[y]) {
    +
    99 if (depth[x] > depth[y]) {
    100 std::swap(x, y);
    101 }
    102 /// making the shallower root's parent the deeper root
    -
    103 p[x] = y;
    +
    103 p[x] = y;
    104
    105 /// if same depth, then increase one's depth
    -
    106 if (depth[x] == depth[y]) {
    -
    107 depth[y]++;
    +
    106 if (depth[x] == depth[y]) {
    +
    107 depth[y]++;
    108 }
    109 /// total size of the resultant set
    -
    110 setSize[y] += setSize[x];
    +
    110 setSize[y] += setSize[x];
    111 /// changing the maximum elements
    -
    112 maxElement[y] = std::max(maxElement[x], maxElement[y]);
    -
    113 minElement[y] = std::min(minElement[x], minElement[y]);
    +
    112 maxElement[y] = std::max(maxElement[x], maxElement[y]);
    +
    113 minElement[y] = std::min(minElement[x], minElement[y]);
    114 }
    -
    dsu::isSame
    bool isSame(uint64_t i, uint64_t j)
    A utility function which check whether i and j belongs to same set or not.
    Definition dsu_path_compression.cpp:123
    +
    dsu::isSame
    bool isSame(uint64_t i, uint64_t j)
    A utility function which check whether i and j belongs to same set or not.
    Definition dsu_path_compression.cpp:123
    std::max
    T max(T... args)
    std::min
    T min(T... args)
    std::swap
    T swap(T... args)
    @@ -837,19 +809,12 @@ Here is the call graph for this function:
    void dsu::unionSet ( - uint64_t  - i, + uint64_t i, - uint64_t  - j  - - - - ) - + uint64_t j ) @@ -876,27 +841,27 @@ Here is the call graph for this function:

    total size of the resultant set

    75 {
    76 /// checks if both belongs to same set or not
    -
    77 if (isSame(i, j)) {
    +
    77 if (isSame(i, j)) {
    78 return;
    79 }
    80 /// we find representative of the i and j
    -
    81 uint64_t x = findSet(i);
    -
    82 uint64_t y = findSet(j);
    +
    81 uint64_t x = findSet(i);
    +
    82 uint64_t y = findSet(j);
    83
    84 /// always keeping the min as x
    85 /// in order to create a shallow tree
    -
    86 if (depth[x] > depth[y]) {
    +
    86 if (depth[x] > depth[y]) {
    87 std::swap(x, y);
    88 }
    89 /// making the shallower tree, root parent of the deeper root
    -
    90 p[x] = y;
    +
    90 p[x] = y;
    91
    92 /// if same depth, then increase one's depth
    -
    93 if (depth[x] == depth[y]) {
    -
    94 depth[y]++;
    +
    93 if (depth[x] == depth[y]) {
    +
    94 depth[y]++;
    95 }
    96 /// total size of the resultant set
    -
    97 setSize[y] += setSize[x];
    +
    97 setSize[y] += setSize[x];
    98 }
    Here is the call graph for this function:
    @@ -916,7 +881,7 @@ Here is the call graph for this function: diff --git a/dd/d21/namespacewindowed__median.html b/dd/d21/namespacewindowed__median.html index fd6d67456..6e294554a 100644 --- a/dd/d21/namespacewindowed__median.html +++ b/dd/d21/namespacewindowed__median.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: windowed_median Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('dd/d21/namespacewindowed__median.html'

    Functions for the Windowed Median algorithm implementation. -More...

    +More...

    Detailed Description

    Functions for the Windowed Median algorithm implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('dd/d21/namespacewindowed__median.html' diff --git a/dd/d24/namespacedynamic__programming.html b/dd/d24/namespacedynamic__programming.html index 31f24a2b9..1ac706ff0 100644 --- a/dd/d24/namespacedynamic__programming.html +++ b/dd/d24/namespacedynamic__programming.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -104,21 +106,21 @@ $(document).ready(function(){initNavTree('dd/d24/namespacedynamic__programming.h

    Dynamic Programming algorithms. -More...

    +More...

    - + - + - + - +

    Functions

    template<typename T >
    bool is_armstrong (const T &number)
    bool is_armstrong (const T &number)
     Checks if the given number is armstrong or not.
     
    uint64_t LIS (const std::vector< uint64_t > &a, const uint32_t &n)
    uint64_t LIS (const std::vector< uint64_t > &a, const uint32_t &n)
     Calculate the longest increasing subsequence for the specified numbers.
     
    std::string lps (const std::string &a)
    std::string lps (const std::string &a)
     Function that returns the longest palindromic subsequence of a string.
     
    int maxCircularSum (std::vector< int > &arr)
    int maxCircularSum (std::vector< int > &arr)
     returns the maximum contiguous circular sum of an array
     
    @@ -149,8 +151,7 @@ template<typename T >
    bool dynamic_programming::is_armstrong ( - const T &  - number) + const T & number) @@ -210,19 +211,12 @@ Here is the call graph for this function:
    uint64_t dynamic_programming::LIS ( - const std::vector< uint64_t > &  - a, + const std::vector< uint64_t > & a, - const uint32_t &  - n  - - - - ) - + const uint32_t & n )
    @@ -273,8 +267,7 @@ Here is the call graph for this function:
    std::string dynamic_programming::lps ( - const std::string &  - a) + const std::string & a) @@ -355,8 +348,7 @@ Here is the call graph for this function: int dynamic_programming::maxCircularSum ( - std::vector< int > &  - arr) + std::vector< int > & arr) @@ -417,7 +409,7 @@ Here is the call graph for this function: diff --git a/dd/d29/false__position_8cpp.html b/dd/d29/false__position_8cpp.html index 66554ad81..883d3c5b6 100644 --- a/dd/d29/false__position_8cpp.html +++ b/dd/d29/false__position_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/false_position.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -125,16 +127,16 @@ Namespaces - + - + - + - +

    Functions

    static float numerical_methods::false_position::eq (float x)
    static float numerical_methods::false_position::eq (float x)
     This function gives the value of f(x) for given x.
     
    static float numerical_methods::false_position::regula_falsi (float x1, float x2, float y1, float y2)
    static float numerical_methods::false_position::regula_falsi (float x1, float x2, float y1, float y2)
     This function finds root of the equation in given interval i.e. (x1,x2).
     
    void numerical_methods::false_position::printRoot (float root, const int16_t &count)
    void numerical_methods::false_position::printRoot (float root, const int16_t &count)
     This function prints roots of the equation.
     
    int main ()
    int main ()
     Main function.
     
    @@ -164,8 +166,7 @@ x_{i+1} = \frac{a_i\cdot f(b_i) - b_i\cdot f(a_i)}{f(b_i) - f(a_i)} static float numerical_methods::false_position::eq ( - float  - x) + float x) @@ -204,8 +205,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -219,30 +219,30 @@ Here is the call graph for this function:
    105 float range =
    106 100000; // Range in which we have to find the root. (-range,range)
    107 float gap = 0.5; // interval gap. lesser the gap more the accuracy
    -
    108 a = numerical_methods::false_position::eq((-1) * range);
    +
    108 a = numerical_methods::false_position::eq((-1) * range);
    109 i = ((-1) * range + gap);
    110 // while loop for selecting proper interval in provided range and with
    111 // provided interval gap.
    112 while (i <= range) {
    -
    113 b = numerical_methods::false_position::eq(i);
    +
    113 b = numerical_methods::false_position::eq(i);
    114 if (b == 0) {
    115 count++;
    -
    116 numerical_methods::false_position::printRoot(i, count);
    +
    116 numerical_methods::false_position::printRoot(i, count);
    117 }
    118 if (a * b < 0) {
    -
    119 root = numerical_methods::false_position::regula_falsi(i - gap, i,
    +
    119 root = numerical_methods::false_position::regula_falsi(i - gap, i,
    120 a, b);
    121 count++;
    -
    122 numerical_methods::false_position::printRoot(root, count);
    +
    122 numerical_methods::false_position::printRoot(root, count);
    123 }
    124 a = b;
    125 i += gap;
    126 }
    127 return 0;
    128}
    -
    numerical_methods::false_position::regula_falsi
    static float regula_falsi(float x1, float x2, float y1, float y2)
    This function finds root of the equation in given interval i.e. (x1,x2).
    Definition false_position.cpp:55
    -
    numerical_methods::false_position::eq
    static float eq(float x)
    This function gives the value of f(x) for given x.
    Definition false_position.cpp:44
    -
    numerical_methods::false_position::printRoot
    void printRoot(float root, const int16_t &count)
    This function prints roots of the equation.
    Definition false_position.cpp:84
    +
    numerical_methods::false_position::regula_falsi
    static float regula_falsi(float x1, float x2, float y1, float y2)
    This function finds root of the equation in given interval i.e. (x1,x2).
    Definition false_position.cpp:55
    +
    numerical_methods::false_position::eq
    static float eq(float x)
    This function gives the value of f(x) for given x.
    Definition false_position.cpp:44
    +
    numerical_methods::false_position::printRoot
    void printRoot(float root, const int16_t &count)
    This function prints roots of the equation.
    Definition false_position.cpp:84
    @@ -255,19 +255,12 @@ Here is the call graph for this function: void numerical_methods::false_position::printRoot ( - float  - root, + float root, - const int16_t &  - count  - - - - ) - + const int16_t & count )
    @@ -313,31 +306,22 @@ Here is the call graph for this function:
    static float numerical_methods::false_position::regula_falsi ( - float  - x1, + float x1, - float  - x2, + float x2, - float  - y1, + float y1, - float  - y2  - - - - ) - + float y2 ) @@ -377,7 +361,7 @@ Here is the call graph for this function:
    73 float x3 = 0, y3 = 0;
    74 x3 = x1 - (x1 - x2) * (y1) / (y1 - y2);
    75 y3 = eq(x3);
    -
    76 return regula_falsi(x2, x3, y2, y3);
    +
    76 return regula_falsi(x2, x3, y2, y3);
    77}
    eq
    static double eq(double i)
    Definition bisection_method.cpp:26
    @@ -394,7 +378,7 @@ Here is the call graph for this function:
    diff --git a/dd/d2f/class_trie.html b/dd/d2f/class_trie.html index 5ecd74973..76df9d4ae 100644 --- a/dd/d2f/class_trie.html +++ b/dd/d2f/class_trie.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Trie Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -121,24 +123,24 @@ Classes - + - + - + - +

    Public Member Functions

     Trie ()
     Trie ()
     constructor to initialise the root of the trie.
     
    void insert (const std::string &word)
    void insert (const std::string &word)
     
    bool search (const std::string &word)
    bool search (const std::string &word)
     
    void removeWord (const std::string &word)
    void removeWord (const std::string &word)
     
    - +

    Private Member Functions

    std::shared_ptr< TrieNode > removeWordHelper (const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)
    std::shared_ptr< TrieNode > removeWordHelper (const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)
     
    - +

    Static Private Member Functions

    static bool hasChildren (std::shared_ptr< TrieNode > node)
    static bool hasChildren (std::shared_ptr< TrieNode > node)
     
    - +

    @@ -168,7 +170,7 @@ static constexpr size_t 

    		AL
    Trie::Trie ())
    @@ -197,8 +199,7 @@ static constexpr size_t AL static bool Trie::hasChildren ( - std::shared_ptr< TrieNode >  - node) + std::shared_ptr< TrieNode > node) @@ -241,8 +242,7 @@ static constexpr size_t AL void Trie::insert ( - const std::string &  - word) + const std::string & word) @@ -288,8 +288,7 @@ static constexpr size_t AL void Trie::removeWord ( - const std::string &  - word) + const std::string & word) @@ -300,9 +299,9 @@ static constexpr size_t AL
    148 {
    -
    149 m_root = removeWordHelper(word, m_root, 0);
    +
    149 m_root = removeWordHelper(word, m_root, 0);
    150 }
    -
    Trie::removeWordHelper
    std::shared_ptr< TrieNode > removeWordHelper(const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)
    Definition trie_modern.cpp:64
    +
    Trie::removeWordHelper
    std::shared_ptr< TrieNode > removeWordHelper(const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)
    Definition trie_modern.cpp:64
    @@ -318,25 +317,17 @@ static constexpr size_t AL std::shared_ptr< TrieNode > Trie::removeWordHelper ( - const std::string &  - word, + const std::string & word, - std::shared_ptr< TrieNode >  - curr, + std::shared_ptr< TrieNode > curr, - size_t  - index  - - - - ) - + size_t index ) @@ -365,7 +356,7 @@ static constexpr size_t AL
    68 if (curr->isEndOfWord) {
    69 curr->isEndOfWord = false;
    70 }
    -
    71 if (hasChildren(curr)) {
    +
    71 if (hasChildren(curr)) {
    72 return curr;
    73 }
    74 return nullptr;
    @@ -380,7 +371,7 @@ static constexpr size_t AL
    83 }
    84
    85 curr->character[idx] =
    -
    86 removeWordHelper(word, curr->character[idx], index + 1);
    +
    86 removeWordHelper(word, curr->character[idx], index + 1);
    87
    88 // This if condition checks if the node has some childern.
    89 // The 1st if check, i.e. (curr->character[idx]) is checked specifically
    @@ -389,13 +380,13 @@ static constexpr size_t AL
    92 // abbey, str2 = abbex and we want to delete string "abbey", then in
    93 // this case, there would be no need to check all characters for the
    94 // chars a,b,b.
    -
    95 if (curr->character[idx] || hasChildren(curr)) {
    +
    95 if (curr->character[idx] || hasChildren(curr)) {
    96 return curr;
    97 }
    98 return nullptr;
    99 }
    -
    Trie::hasChildren
    static bool hasChildren(std::shared_ptr< TrieNode > node)
    Definition trie_modern.cpp:41
    +
    Trie::hasChildren
    static bool hasChildren(std::shared_ptr< TrieNode > node)
    Definition trie_modern.cpp:41
    std::move
    T move(T... args)
    std::string::size
    T size(T... args)
    @@ -419,8 +410,7 @@ Here is the call graph for this function: bool Trie::search ( - const std::string &  - word) + const std::string & word) @@ -465,7 +455,7 @@ False if word is not found in trie or isEndOfWord is set to false. diff --git a/dd/d40/classdata__structures_1_1tree__234_1_1_node.html b/dd/d40/classdata__structures_1_1tree__234_1_1_node.html index 998560e9c..32f3843d4 100644 --- a/dd/d40/classdata__structures_1_1tree__234_1_1_node.html +++ b/dd/d40/classdata__structures_1_1tree__234_1_1_node.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures::tree_234::Node Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('dd/d40/classdata__structures_1_1tree__

    2-3-4 tree node class - More...

    + More...

    Collaboration diagram for data_structures::tree_234::Node:
    @@ -115,76 +117,76 @@ Collaboration diagram for data_structures::tree_234::Node:
    - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - +

    Public Member Functions

     Node (int64_t item)
     Node (int64_t item)
     Node constructor.
     
    int8_t GetCount ()
    int8_t GetCount ()
     Get the item count that current saved in the node.
     
    void SetCount (int8_t c)
    void SetCount (int8_t c)
     Set the item count of the node.
     
    bool IsLeaf ()
    bool IsLeaf ()
     Check if node is a leaf.
     
    bool IsFull ()
    bool IsFull ()
     Check if node is a full (4-node)
     
    bool Is2Node ()
    bool Is2Node ()
     Check if node is a 2-node.
     
    bool Is34Node ()
    bool Is34Node ()
     Check if node is a 3-node or 4-node, this is useful when we delete item from 2-3-4 tree.
     
    bool Contains (int64_t item)
    bool Contains (int64_t item)
     Check if item is in the node.
     
    int8_t GetItemIndex (int64_t item)
    int8_t GetItemIndex (int64_t item)
     Get the index of the item in the node, 0-based.
     
    int64_t GetMaxItem ()
    int64_t GetMaxItem ()
     Get max item (rightmost) in the current node.
     
    int64_t GetMinItem ()
    int64_t GetMinItem ()
     get min item (leftmost) in the current node
     
    int64_t GetItem (int8_t index)
    int64_t GetItem (int8_t index)
     Get item of the \index index.
     
    void SetItem (int8_t index, int64_t new_item)
    void SetItem (int8_t index, int64_t new_item)
     Set item value at position of index.
     
    int InsertItem (int item)
    int InsertItem (int item)
     Insert item to the proper position of the node and return the position index.
     
    void InsertItemByIndex (int8_t index, int64_t item, Node *with_child, bool to_left=true)
    void InsertItemByIndex (int8_t index, int64_t item, Node *with_child, bool to_left=true)
     Insert a value to the index position.
     
    Node * RemoveItemByIndex (int8_t index, bool keep_left)
    Node * RemoveItemByIndex (int8_t index, bool keep_left)
     Insert a value to the index position.
     
    int8_t GetChildIndex (Node *child)
    int8_t GetChildIndex (Node *child)
     Get the child's index of the children array.
     
    Node * GetChild (int8_t index)
    Node * GetChild (int8_t index)
     Get the child pointer at position of index.
     
    void SetChild (int8_t index, Node *child)
    void SetChild (int8_t index, Node *child)
     Set child pointer to the position of index.
     
    Node * GetRightmostChild ()
    Node * GetRightmostChild ()
     Get rightmose child of the current node.
     
    Node * GetLeftmostChild ()
    Node * GetLeftmostChild ()
     Get leftmose child of the current node.
     
    Node * GetItemLeftChild (int8_t item_index)
    Node * GetItemLeftChild (int8_t item_index)
     Get left child of item at item_index.
     
    Node * GetItemRightChild (int8_t item_index)
    Node * GetItemRightChild (int8_t item_index)
     Get right child of item at item_index.
     
    Node * GetNextPossibleChild (int64_t item)
    Node * GetNextPossibleChild (int64_t item)
     Get next node which is possibly contains item.
     
    @@ -218,8 +220,7 @@ int8_t < - - +
    count = 0
    data_structures::tree_234::Node::Node (int64_t item)int64_t item)
    @@ -237,12 +238,12 @@ int8_t count = 0< -
    42 : count(1),
    -
    43 items({{item, 0, 0}}),
    -
    44 children({{nullptr, nullptr, nullptr, nullptr}}) {}
    -
    data_structures::tree_234::Node::items
    std::array< int64_t, 3 > items
    store items
    Definition tree_234.cpp:315
    -
    data_structures::tree_234::Node::count
    int8_t count
    track the current item count
    Definition tree_234.cpp:319
    -
    data_structures::tree_234::Node::children
    std::array< Node *, 4 > children
    store the children pointers
    Definition tree_234.cpp:317
    +
    42 : count(1),
    +
    43 items({{item, 0, 0}}),
    +
    44 children({{nullptr, nullptr, nullptr, nullptr}}) {}
    +
    data_structures::tree_234::Node::items
    std::array< int64_t, 3 > items
    store items
    Definition tree_234.cpp:315
    +
    data_structures::tree_234::Node::count
    int8_t count
    track the current item count
    Definition tree_234.cpp:319
    +
    data_structures::tree_234::Node::children
    std::array< Node *, 4 > children
    store the children pointers
    Definition tree_234.cpp:317
    @@ -259,8 +260,7 @@ int8_t count = 0< bool data_structures::tree_234::Node::Contains ( - int64_t  - item) + int64_t item) @@ -280,8 +280,8 @@ int8_t count = 0<
    Returns
    true if item in the node, otherwise false
    92 {
    -
    93 for (int8_t i = 0; i < count; i++) {
    -
    94 if (item == items[i]) {
    +
    93 for (int8_t i = 0; i < count; i++) {
    +
    94 if (item == items[i]) {
    95 return true;
    96 }
    97 }
    @@ -302,8 +302,7 @@ int8_t count = 0< Node * data_structures::tree_234::Node::GetChild ( - int8_t  - index) + int8_t index) @@ -322,7 +321,7 @@ int8_t count = 0<
    Returns
    the child pointer
    -
    252{ return children[index]; }
    +
    252{ return children[index]; }
    @@ -338,8 +337,7 @@ int8_t count = 0< int8_t data_structures::tree_234::Node::GetChildIndex ( - Node *  - child) + Node * child) @@ -359,8 +357,8 @@ int8_t count = 0<
    Returns
    the index of child
    237 {
    -
    238 for (int8_t i = 0; i < count + 1; i++) {
    -
    239 if (children[i] == child) {
    +
    238 for (int8_t i = 0; i < count + 1; i++) {
    +
    239 if (children[i] == child) {
    240 return i;
    241 }
    242 }
    @@ -382,7 +380,7 @@ int8_t count = 0< int8_t data_structures::tree_234::Node::GetCount ( - ) + ) @@ -395,7 +393,7 @@ int8_t count = 0<

    Get the item count that current saved in the node.

    Returns
    item count
    -
    50{ return count; }
    +
    50{ return count; }
    @@ -411,8 +409,7 @@ int8_t count = 0< int64_t data_structures::tree_234::Node::GetItem ( - int8_t  - index) + int8_t index) @@ -431,7 +428,7 @@ int8_t count = 0<
    Returns
    the item
    -
    133{ return items[index]; }
    +
    133{ return items[index]; }
    @@ -447,8 +444,7 @@ int8_t count = 0< int8_t data_structures::tree_234::Node::GetItemIndex ( - int64_t  - item) + int64_t item) @@ -468,8 +464,8 @@ int8_t count = 0<
    Returns
    0-based index of the item in the node, if not in the node, -1 is returned
    107 {
    -
    108 for (int8_t i = 0; i < count; i++) {
    -
    109 if (items[i] == item) {
    +
    108 for (int8_t i = 0; i < count; i++) {
    +
    109 if (items[i] == item) {
    110 return i;
    111 }
    112 }
    @@ -490,8 +486,7 @@ int8_t count = 0< Node * data_structures::tree_234::Node::GetItemLeftChild ( - int8_t  - item_index) + int8_t item_index) @@ -511,11 +506,11 @@ int8_t count = 0<
    Returns
    left child of items[index]'s
    278 {
    -
    279 if (item_index < 0 || item_index > count - 1) {
    +
    279 if (item_index < 0 || item_index > count - 1) {
    280 return nullptr;
    281 }
    282
    -
    283 return children[item_index];
    +
    283 return children[item_index];
    284 }
    @@ -532,8 +527,7 @@ int8_t count = 0< Node * data_structures::tree_234::Node::GetItemRightChild ( - int8_t  - item_index) + int8_t item_index) @@ -553,11 +547,11 @@ int8_t count = 0<
    Returns
    right child of items[index]'s
    291 {
    -
    292 if (item_index < 0 || item_index > count - 1) {
    +
    292 if (item_index < 0 || item_index > count - 1) {
    293 return nullptr;
    294 }
    295
    -
    296 return children[item_index + 1];
    +
    296 return children[item_index + 1];
    297 }
    @@ -574,7 +568,7 @@ int8_t count = 0< Node * data_structures::tree_234::Node::GetLeftmostChild ( - ) + ) @@ -587,7 +581,7 @@ int8_t count = 0<

    Get leftmose child of the current node.

    Returns
    the leftmost child
    -
    271{ return children[0]; }
    +
    271{ return children[0]; }
    @@ -603,7 +597,7 @@ int8_t count = 0< int64_t data_structures::tree_234::Node::GetMaxItem ( - ) + ) @@ -616,7 +610,7 @@ int8_t count = 0<

    Get max item (rightmost) in the current node.

    Returns
    max item
    -
    120{ return items[count - 1]; }
    +
    120{ return items[count - 1]; }
    @@ -632,7 +626,7 @@ int8_t count = 0< int64_t data_structures::tree_234::Node::GetMinItem ( - ) + ) @@ -645,7 +639,7 @@ int8_t count = 0<

    get min item (leftmost) in the current node

    Returns
    min item
    -
    126{ return items[0]; }
    +
    126{ return items[0]; }
    @@ -661,8 +655,7 @@ int8_t count = 0< Node * data_structures::tree_234::Node::GetNextPossibleChild ( - int64_t  - item) + int64_t item) @@ -683,12 +676,12 @@ int8_t count = 0<
    Returns
    the next node that possibly contains item
    304 {
    305 int i = 0;
    -
    306 for (i = 0; i < count; i++) {
    -
    307 if (items[i] > item) {
    +
    306 for (i = 0; i < count; i++) {
    +
    307 if (items[i] > item) {
    308 break;
    309 }
    310 }
    -
    311 return children[i];
    +
    311 return children[i];
    312 }
    @@ -705,7 +698,7 @@ int8_t count = 0< Node * data_structures::tree_234::Node::GetRightmostChild ( - ) + ) @@ -718,7 +711,7 @@ int8_t count = 0<

    Get rightmose child of the current node.

    Returns
    the rightmost child
    -
    265{ return children[count]; }
    +
    265{ return children[count]; }
    @@ -734,8 +727,7 @@ int8_t count = 0< int data_structures::tree_234::Node::InsertItem ( - int  - item) + int item) @@ -756,25 +748,25 @@ int8_t count = 0<
    Returns
    index where item is inserted, caller can use this index to update its left and right child
    163 {
    -
    164 assert(!IsFull());
    +
    164 assert(!IsFull());
    165
    -
    166 if (Contains(item)) {
    +
    166 if (Contains(item)) {
    167 return -1;
    168 }
    169
    170 int8_t i = 0;
    -
    171 for (i = 0; i < count; i++) {
    -
    172 if (items[i] > item) {
    +
    171 for (i = 0; i < count; i++) {
    +
    172 if (items[i] > item) {
    173 break;
    174 }
    175 }
    176
    -
    177 InsertItemByIndex(i, item, nullptr, true);
    +
    177 InsertItemByIndex(i, item, nullptr, true);
    178 return i;
    179 }
    -
    data_structures::tree_234::Node::Contains
    bool Contains(int64_t item)
    Check if item is in the node.
    Definition tree_234.cpp:92
    -
    data_structures::tree_234::Node::InsertItemByIndex
    void InsertItemByIndex(int8_t index, int64_t item, Node *with_child, bool to_left=true)
    Insert a value to the index position.
    Definition tree_234.cpp:189
    -
    data_structures::tree_234::Node::IsFull
    bool IsFull()
    Check if node is a full (4-node)
    Definition tree_234.cpp:73
    +
    data_structures::tree_234::Node::Contains
    bool Contains(int64_t item)
    Check if item is in the node.
    Definition tree_234.cpp:92
    +
    data_structures::tree_234::Node::InsertItemByIndex
    void InsertItemByIndex(int8_t index, int64_t item, Node *with_child, bool to_left=true)
    Insert a value to the index position.
    Definition tree_234.cpp:189
    +
    data_structures::tree_234::Node::IsFull
    bool IsFull()
    Check if node is a full (4-node)
    Definition tree_234.cpp:73
    Here is the call graph for this function:
    @@ -795,31 +787,22 @@ Here is the call graph for this function:
    void data_structures::tree_234::Node::InsertItemByIndex ( - int8_t  - index, + int8_t index, - int64_t  - item, + int64_t item, - Node *  - with_child, + Node * with_child, - bool  - to_left = true  - - - - ) - + bool to_left = true ) @@ -842,21 +825,21 @@ Here is the call graph for this function:
    190 {
    191 assert(count < 3 && index >= 0 && index < 3);
    192
    -
    193 for (int8_t i = count - 1; i >= index; i--) {
    -
    194 items[i + 1] = items[i];
    +
    193 for (int8_t i = count - 1; i >= index; i--) {
    +
    194 items[i + 1] = items[i];
    195 }
    196
    -
    197 items[index] = item;
    +
    197 items[index] = item;
    198
    199 int8_t start_index = to_left ? index : index + 1;
    200
    -
    201 for (int8_t i = count; i >= start_index; i--) {
    -
    202 children[i + 1] = children[i];
    +
    201 for (int8_t i = count; i >= start_index; i--) {
    +
    202 children[i + 1] = children[i];
    203 }
    204
    -
    205 children[start_index] = with_child;
    +
    205 children[start_index] = with_child;
    206
    -
    207 count++;
    +
    207 count++;
    208 }
    @@ -873,7 +856,7 @@ Here is the call graph for this function: bool data_structures::tree_234::Node::Is2Node ( - ) + ) @@ -886,7 +869,7 @@ Here is the call graph for this function:

    Check if node is a 2-node.

    Returns
    true if node is 2-node, otherwise false
    -
    79{ return count == 1; }
    +
    79{ return count == 1; }
    @@ -902,7 +885,7 @@ Here is the call graph for this function: bool data_structures::tree_234::Node::Is34Node ( - ) + ) @@ -915,7 +898,7 @@ Here is the call graph for this function:

    Check if node is a 3-node or 4-node, this is useful when we delete item from 2-3-4 tree.

    Returns
    true if node is 3-node or 4-node, false otherwise
    -
    85{ return count == 2 || count == 3; }
    +
    85{ return count == 2 || count == 3; }
    @@ -931,7 +914,7 @@ Here is the call graph for this function: bool data_structures::tree_234::Node::IsFull ( - ) + ) @@ -944,7 +927,7 @@ Here is the call graph for this function:

    Check if node is a full (4-node)

    Returns
    true if node is full (4-node), false otherwise
    -
    73{ return count == 3; }
    +
    73{ return count == 3; }
    @@ -960,7 +943,7 @@ Here is the call graph for this function: bool data_structures::tree_234::Node::IsLeaf ( - ) + ) @@ -973,7 +956,7 @@ Here is the call graph for this function:

    Check if node is a leaf.

    Returns
    true if node is leaf, false otherwise
    -
    67{ return children[0] == nullptr; }
    +
    67{ return children[0] == nullptr; }
    @@ -989,19 +972,12 @@ Here is the call graph for this function: Node * data_structures::tree_234::Node::RemoveItemByIndex ( - int8_t  - index, + int8_t index, - bool  - keep_left  - - - - ) - + bool keep_left ) @@ -1021,17 +997,17 @@ Here is the call graph for this function:
    Returns
    the removed child pointer
    217 {
    -
    218 assert(index >= 0 && index < count);
    -
    219 Node *removed_child = keep_left ? children[index + 1] : children[index];
    -
    220 for (int8_t i = index; i < count - 1; i++) {
    -
    221 items[i] = items[i + 1];
    +
    218 assert(index >= 0 && index < count);
    +
    219 Node *removed_child = keep_left ? children[index + 1] : children[index];
    +
    220 for (int8_t i = index; i < count - 1; i++) {
    +
    221 items[i] = items[i + 1];
    222 }
    223
    -
    224 for (int8_t i = keep_left ? index + 1 : index; i < count; i++) {
    -
    225 children[i] = children[i + 1];
    +
    224 for (int8_t i = keep_left ? index + 1 : index; i < count; i++) {
    +
    225 children[i] = children[i + 1];
    226 }
    227
    -
    228 count--;
    +
    228 count--;
    229 return removed_child;
    230 }
    Node
    Definition linkedlist_implentation_usingarray.cpp:14
    @@ -1050,19 +1026,12 @@ Here is the call graph for this function:
    void data_structures::tree_234::Node::SetChild ( - int8_t  - index, + int8_t index, - Node *  - child  - - - - ) - + Node * child ) @@ -1080,7 +1049,7 @@ Here is the call graph for this function: -
    259{ children[index] = child; }
    +
    259{ children[index] = child; }
    @@ -1096,8 +1065,7 @@ Here is the call graph for this function: void data_structures::tree_234::Node::SetCount ( - int8_t  - c) + int8_t c) @@ -1116,7 +1084,7 @@ Here is the call graph for this function: -
    61{ count = c; }
    +
    61{ count = c; }
    @@ -1132,19 +1100,12 @@ Here is the call graph for this function: void data_structures::tree_234::Node::SetItem ( - int8_t  - index, + int8_t index, - int64_t  - new_item  - - - - ) - + int64_t new_item ) @@ -1165,7 +1126,7 @@ Here is the call graph for this function:
    140 {
    141 assert(index >= 0 && index <= 2);
    142
    -
    143 items[index] = new_item;
    +
    143 items[index] = new_item;
    144 }
    @@ -1179,7 +1140,7 @@ Here is the call graph for this function: diff --git a/dd/d43/namespace_m_d5.html b/dd/d43/namespace_m_d5.html index b2493def3..0f962e923 100644 --- a/dd/d43/namespace_m_d5.html +++ b/dd/d43/namespace_m_d5.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: MD5 Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('dd/d43/namespace_m_d5.html','../../');

    Functions for the MD5 algorithm implementation. -More...

    +More...

    Detailed Description

    Functions for the MD5 algorithm implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('dd/d43/namespace_m_d5.html','../../'); diff --git a/dd/d47/namespacemath.html b/dd/d47/namespacemath.html index 8ce989412..3f2f14ac4 100644 --- a/dd/d47/namespacemath.html +++ b/dd/d47/namespacemath.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -99,183 +101,175 @@ $(document).ready(function(){initNavTree('dd/d47/namespacemath.html','../../');
    Typedefs | -Functions | -Variables
    +Functions
    math Namespace Reference

    for IO operations -More...

    +More...

    - - - + + +

    Typedefs

    -using Point = { double x
     structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1.
     
    using Point
     structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1.
     
    - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + -

    Functions

    uint64_t aliquot_sum (const uint64_t num)
    uint64_t aliquot_sum (const uint64_t num)
     to return the aliquot sum of a number
     
    double approximate_pi (const std::vector< Point > &pts)
    double approximate_pi (const std::vector< Point > &pts)
     This function uses the points in a given vector 'pts' (drawn at random) to return an approximation of the number π.
     
    template<typename T >
    T square_area (T length)
    T square_area (T length)
     area of a square (l * l)
     
    template<typename T >
    T rect_area (T length, T width)
    T rect_area (T length, T width)
     area of a rectangle (l * w)
     
    template<typename T >
    T triangle_area (T base, T height)
    T triangle_area (T base, T height)
     area of a triangle (b * h / 2)
     
    template<typename T >
    T circle_area (T radius)
    T circle_area (T radius)
     area of a circle (pi
     
    template<typename T >
    T parallelogram_area (T base, T height)
    T parallelogram_area (T base, T height)
     area of a parallelogram (b * h)
     
    template<typename T >
    T cube_surface_area (T length)
    T cube_surface_area (T length)
     surface area of a cube ( 6 * (l
     
    template<typename T >
    T sphere_surface_area (T radius)
    T sphere_surface_area (T radius)
     surface area of a sphere ( 4 * pi * r^2)
     
    template<typename T >
    T cylinder_surface_area (T radius, T height)
    T cylinder_surface_area (T radius, T height)
     surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)
     
    int sum_of_divisor (int num)
    int sum_of_divisor (int num)
     Function to calculate the sum of all the proper divisor of an integer.
     
    bool are_amicable (int x, int y)
    bool are_amicable (int x, int y)
     Function to check whether the pair is amicable or not.
     
    bool is_factorial (uint64_t n)
    bool is_factorial (uint64_t n)
     Function to check if the given number is factorial of some number or not.
     
    bool is_prime (int64_t num)
    bool is_prime (int64_t num)
     Function to check if the given number is prime or not.
     
    void sieve (std::vector< bool > *vec)
    void sieve (std::vector< bool > *vec)
     Performs the sieve.
     
    void print_primes (std::vector< bool > const &primes)
    void print_primes (std::vector< bool > const &primes)
     Prints all the indexes of true values in the passed std::vector.
     
    uint64_t phiFunction (uint64_t n)
    uint64_t phiFunction (uint64_t n)
     Function to calculate Euler's Totient.
     
    uint64_t factorial (uint8_t n)
    uint64_t factorial (uint8_t n)
     function to find factorial of given number
     
    double integral_approx (double lb, double ub, const std::function< double(double)> &func, double delta=.0001)
    double integral_approx (double lb, double ub, const std::function< double(double)> &func, double delta=.0001)
     Computes integral approximation.
     
    void test_eval (double approx, double expected, double threshold)
    void test_eval (double approx, double expected, double threshold)
     Wrapper to evaluate if the approximated value is within .XX% threshold of the exact value.
     
    uint64_t iterativeFactorial (uint8_t n)
    uint64_t iterativeFactorial (uint8_t n)
     Calculates the factorial iteratively.
     
    uint64_t largestPower (uint32_t n, const uint16_t &p)
    uint64_t largestPower (uint32_t n, const uint16_t &p)
     Function to calculate largest power.
     
    uint64_t lcmSum (const uint16_t &num)
    uint64_t lcmSum (const uint16_t &num)
     
    bool magic_number (const uint64_t &n)
    bool magic_number (const uint64_t &n)
     
    uint64_t power (uint64_t a, uint64_t b, uint64_t c)
    uint64_t power (uint64_t a, uint64_t b, uint64_t c)
     This function calculates a raised to exponent b under modulo c using modular exponentiation.
     
    template<class T >
    T n_choose_r (T n, T r)
    T n_choose_r (T n, T r)
     This is the function implementation of \( \binom{n}{r} \).
     
    template<typename T >
    T square_perimeter (T length)
    T square_perimeter (T length)
     perimeter of a square (4 * l)
     
    template<typename T >
    T rect_perimeter (T length, T width)
    T rect_perimeter (T length, T width)
     perimeter of a rectangle ( 2(l + w) )
     
    template<typename T >
    T triangle_perimeter (T base, T height, T hypotenuse)
    T triangle_perimeter (T base, T height, T hypotenuse)
     perimeter of a triangle (a + b + c)
     
    template<typename T >
    T circle_perimeter (T radius)
    T circle_perimeter (T radius)
     perimeter of a circle (2 * pi * r)
     
    template<typename T >
    T parallelogram_perimeter (T base, T height)
    T parallelogram_perimeter (T base, T height)
     perimeter of a parallelogram 2(b + h)
     
    template<typename T >
    T cube_surface_perimeter (T length)
    T cube_surface_perimeter (T length)
     surface perimeter of a cube ( 12
     
    template<typename T >
    T n_polygon_surface_perimeter (T sides, T length)
    T n_polygon_surface_perimeter (T sides, T length)
     surface perimeter of a n-polygon ( n * l)
     
    template<typename T >
    T cylinder_surface_perimeter (T radius, T height)
    T cylinder_surface_perimeter (T radius, T height)
     surface perimeter of a cylinder (2 * radius + 2 * height)
     
    int power_of_two (int n)
    int power_of_two (int n)
     This function finds whether a number is power of 2 or not.
     
    std::array< std::complex< long double >, 2 > quadraticEquation (long double a, long double b, long double c)
    std::array< std::complex< long double >, 2 > quadraticEquation (long double a, long double b, long double c)
     Quadratic equation calculator.
     
    uint64_t binomialCoeffSum (uint64_t n)
    uint64_t binomialCoeffSum (uint64_t n)
     
    template<typename T >
    T cube_volume (T length)
    T cube_volume (T length)
     The volume of a cube
     
    template<typename T >
    T rect_prism_volume (T length, T width, T height)
    T rect_prism_volume (T length, T width, T height)
     The volume of a rectangular prism.
     
    template<typename T >
    T cone_volume (T radius, T height, double PI=3.14)
    T cone_volume (T radius, T height, double PI=3.14)
     The volume of a cone
     
    template<typename T >
    T triangle_prism_volume (T base, T height, T depth)
    T triangle_prism_volume (T base, T height, T depth)
     The volume of a triangular prism.
     
    template<typename T >
    T pyramid_volume (T length, T width, T height)
    T pyramid_volume (T length, T width, T height)
     The volume of a pyramid
     
    template<typename T >
    T sphere_volume (T radius, double PI=3.14)
    T sphere_volume (T radius, double PI=3.14)
     The volume of a sphere
     
    template<typename T >
    T cylinder_volume (T radius, T height, double PI=3.14)
    T cylinder_volume (T radius, T height, double PI=3.14)
     The volume of a cylinder
     
    - - -

    -Variables

    -double y
     

    Detailed Description

    for IO operations

    @@ -319,7 +313,32 @@ Algorithm

    Mathematical algorithms

    for assert for std::pow for std::uint32_t

    Mathematical algorithms

    -

    Function Documentation

    +

    Typedef Documentation

    + +

    ◆ Point

    + +
    +
    + + + + +
    using math::Point
    +
    +Initial value:
    struct {
    +
    double x;
    +
    double y;
    +
    }
    +
    +

    structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1.

    +
    35 {
    +
    36 double x;
    +
    37 double y;
    +
    38};
    +
    +
    +
    +

    Function Documentation

    ◆ aliquot_sum()

    @@ -329,8 +348,7 @@ Algorithm uint64_t math::aliquot_sum ( - const uint64_t  - num) + const uint64_t num) @@ -371,8 +389,7 @@ Algorithm double math::approximate_pi ( - const std::vector< Point > &  - pts) + const std::vector< Point > & pts) @@ -414,19 +431,12 @@ Here is the call graph for this function: bool math::are_amicable ( - int  - x, + int x, - int  - y  - - - - ) - + int y )
    @@ -443,9 +453,9 @@ Here is the call graph for this function:
    false if the pair is not amicable
    58 {
    -
    59 return (sum_of_divisor(x) == y) && (sum_of_divisor(y) == x);
    +
    59 return (sum_of_divisor(x) == y) && (sum_of_divisor(y) == x);
    60}
    -
    math::sum_of_divisor
    int sum_of_divisor(int num)
    Function to calculate the sum of all the proper divisor of an integer.
    Definition check_amicable_pair.cpp:31
    +
    math::sum_of_divisor
    int sum_of_divisor(int num)
    Function to calculate the sum of all the proper divisor of an integer.
    Definition check_amicable_pair.cpp:31
    Here is the call graph for this function:
    @@ -463,8 +473,7 @@ Here is the call graph for this function:
    uint64_t math::binomialCoeffSum ( - uint64_t  - n) + uint64_t n) @@ -494,8 +503,7 @@ template<typename T > T math::circle_area ( - T  - radius) + T radius) @@ -529,8 +537,7 @@ template<typename T > T math::circle_perimeter ( - T  - radius) + T radius) @@ -561,25 +568,17 @@ template<typename T > T math::cone_volume ( - T  - radius, + T radius, - T  - height, + T height, - double  - PI = 3.14  - - - - ) - + double PI = 3.14 )
    @@ -595,13 +594,14 @@ template<typename T >
    Returns
    The volume of the cone
    53 {
    -
    54 return std::pow(radius, 2) * PI * height / 3;
    +
    54 return std::pow(radius, 2) * PI * height / 3;
    55}
    +
    height
    int height(node *root)
    Definition avltree.cpp:38
    std::pow
    T pow(T... args)
    Here is the call graph for this function:
    -
    +
    @@ -617,8 +617,7 @@ template<typename T > T math::cube_surface_area ( - T  - length) + T length) @@ -652,8 +651,7 @@ template<typename T > T math::cube_surface_perimeter ( - T  - length) + T length) @@ -687,8 +685,7 @@ template<typename T > T math::cube_volume ( - T  - length) + T length) @@ -724,19 +721,12 @@ template<typename T > T math::cylinder_surface_area ( - T  - radius, + T radius, - T  - height  - - - - ) - + T height )
    @@ -751,9 +741,14 @@ template<typename T >
    Returns
    surface area of the cylinder
    109 {
    -
    110 return 2 * M_PI * radius * height + 2 * M_PI * pow(radius, 2);
    +
    110 return 2 * M_PI * radius * height + 2 * M_PI * pow(radius, 2);
    111}
    -
    +
    +Here is the call graph for this function:
    +
    +
    +
    + @@ -767,19 +762,12 @@ template<typename T > T math::cylinder_surface_perimeter ( - T  - radius, + T radius, - T  - height  - - - - ) - + T height )
    @@ -794,9 +782,14 @@ template<typename T >
    Returns
    surface perimeter of the cylinder
    111 {
    -
    112 return (2 * radius) + (2 * height);
    +
    112 return (2 * radius) + (2 * height);
    113}
    -
    +
    +Here is the call graph for this function:
    +
    +
    +
    + @@ -810,25 +803,17 @@ template<typename T > T math::cylinder_volume ( - T  - radius, + T radius, - T  - height, + T height, - double  - PI = 3.14  - - - - ) - + double PI = 3.14 )
    @@ -844,12 +829,12 @@ template<typename T >
    Returns
    The volume of the cylinder
    103 {
    -
    104 return PI * std::pow(radius, 2) * height;
    +
    104 return PI * std::pow(radius, 2) * height;
    105}
    Here is the call graph for this function:
    -
    +
    @@ -863,8 +848,7 @@ Here is the call graph for this function: uint64_t math::factorial ( - uint8_t  - n) + uint8_t n) @@ -885,10 +869,10 @@ Here is the call graph for this function:
    33 if (n == 0) {
    34 return 1;
    35 }
    -
    36 return n * factorial(n - 1);
    +
    36 return n * factorial(n - 1);
    37}
    -
    math::factorial
    uint64_t factorial(uint8_t n)
    function to find factorial of given number
    Definition factorial.cpp:29
    +
    math::factorial
    uint64_t factorial(uint8_t n)
    function to find factorial of given number
    Definition factorial.cpp:29
    Here is the call graph for this function:
    @@ -906,31 +890,22 @@ Here is the call graph for this function:
    double math::integral_approx ( - double  - lb, + double lb, - double  - ub, + double ub, - const std::function< double(double)> &  - func, + const std::function< double(double)> & func, - double  - delta = .0001  - - - - ) - + double delta = .0001 )
    @@ -968,8 +943,7 @@ Here is the call graph for this function:
    bool math::is_factorial ( - uint64_t  - n) + uint64_t n) @@ -1021,8 +995,7 @@ false if number is not a factorial bool math::is_prime ( - int64_t  - num) + int64_t num) @@ -1076,8 +1049,7 @@ false if number is not a prime. uint64_t math::iterativeFactorial ( - uint8_t  - n) + uint8_t n) @@ -1122,19 +1094,12 @@ false if number is not a prime. uint64_t math::largestPower ( - uint32_t  - n, + uint32_t n, - const uint16_t &  - p  - - - - ) - + const uint16_t & p )
    @@ -1172,8 +1137,7 @@ false if number is not a prime. uint64_t math::lcmSum ( - const uint16_t &  - num) + const uint16_t & num) @@ -1227,8 +1191,7 @@ false if number is not a prime. bool math::magic_number ( - const uint64_t &  - n) + const uint64_t & n) @@ -1267,19 +1230,12 @@ template<class T >
    T math::n_choose_r ( - T  - n, + T n, - T  - r  - - - - ) - + T r )
    @@ -1325,19 +1281,12 @@ template<typename T >
    T math::n_polygon_surface_perimeter ( - T  - sides, + T sides, - T  - length  - - - - ) - + T length )
    @@ -1368,19 +1317,12 @@ template<typename T >
    T math::parallelogram_area ( - T  - base, + T base, - T  - height  - - - - ) - + T height )
    @@ -1395,9 +1337,14 @@ template<typename T >
    Returns
    area of the parallelogram
    75 {
    -
    76 return base * height;
    +
    76 return base * height;
    77}
    -
    +
    +Here is the call graph for this function:
    +
    +
    +
    + @@ -1411,19 +1358,12 @@ template<typename T > T math::parallelogram_perimeter ( - T  - base, + T base, - T  - height  - - - - ) - + T height )
    @@ -1438,9 +1378,14 @@ template<typename T >
    Returns
    perimeter of the parallelogram
    75 {
    -
    76 return 2 * (base + height);
    +
    76 return 2 * (base + height);
    77}
    -
    +
    +Here is the call graph for this function:
    +
    +
    +
    + @@ -1452,8 +1397,7 @@ template<typename T > uint64_t math::phiFunction ( - uint64_t  - n) + uint64_t n) @@ -1490,25 +1434,17 @@ template<typename T > uint64_t math::power ( - uint64_t  - a, + uint64_t a, - uint64_t  - b, + uint64_t b, - uint64_t  - c  - - - - ) - + uint64_t c )
    @@ -1558,8 +1494,7 @@ template<typename T >
    int math::power_of_two ( - int  - n) + int n) @@ -1599,8 +1534,7 @@ template<typename T > void math::print_primes ( - std::vector< bool > const &  - primes) + std::vector< bool > const & primes) @@ -1643,25 +1577,17 @@ template<typename T > T math::pyramid_volume ( - T  - length, + T length, - T  - width, + T width, - T  - height  - - - - ) - + T height )
    @@ -1677,9 +1603,14 @@ template<typename T >
    Returns
    The volume of the pyramid
    80 {
    -
    81 return length * width * height / 3;
    +
    81 return length * width * height / 3;
    82}
    -
    +
    +Here is the call graph for this function:
    +
    +
    +
    + @@ -1691,25 +1622,17 @@ template<typename T > std::array< std::complex< long double >, 2 > math::quadraticEquation ( - long double  - a, + long double a, - long double  - b, + long double b, - long double  - c  - - - - ) - + long double c )
    @@ -1784,19 +1707,12 @@ template<typename T >
    T math::rect_area ( - T  - length, + T length, - T  - width  - - - - ) - + T width )
    @@ -1827,19 +1743,12 @@ template<typename T >
    T math::rect_perimeter ( - T  - length, + T length, - T  - width  - - - - ) - + T width )
    @@ -1870,25 +1779,17 @@ template<typename T >
    T math::rect_prism_volume ( - T  - length, + T length, - T  - width, + T width, - T  - height  - - - - ) - + T height )
    @@ -1904,9 +1805,14 @@ template<typename T >
    Returns
    The volume of the rectangular prism
    41 {
    -
    42 return length * width * height;
    +
    42 return length * width * height;
    43}
    -
    +
    +Here is the call graph for this function:
    +
    +
    +
    + @@ -1918,8 +1824,7 @@ template<typename T > void math::sieve ( - std::vector< bool > *  - vec) + std::vector< bool > * vec) @@ -1964,8 +1869,7 @@ template<typename T > T math::sphere_surface_area ( - T  - radius) + T radius) @@ -1996,19 +1900,12 @@ template<typename T > T math::sphere_volume ( - T  - radius, + T radius, - double  - PI = 3.14  - - - - ) - + double PI = 3.14 )
    @@ -2044,8 +1941,7 @@ template<typename T >
    T math::square_area ( - T  - length) + T length) @@ -2076,8 +1972,7 @@ template<typename T > T math::square_perimeter ( - T  - length) + T length) @@ -2106,8 +2001,7 @@ template<typename T > int math::sum_of_divisor ( - int  - num) + int num) @@ -2152,25 +2046,17 @@ template<typename T > void math::test_eval ( - double  - approx, + double approx, - double  - expected, + double expected, - double  - threshold  - - - - ) - + double threshold )
    @@ -2202,19 +2088,12 @@ template<typename T >
    T math::triangle_area ( - T  - base, + T base, - T  - height  - - - - ) - + T height )
    @@ -2229,9 +2108,14 @@ template<typename T >
    Returns
    area of the triangle
    52 {
    -
    53 return base * height / 2;
    +
    53 return base * height / 2;
    54}
    -
    +
    +Here is the call graph for this function:
    +
    +
    +
    + @@ -2245,25 +2129,17 @@ template<typename T > T math::triangle_perimeter ( - T  - base, + T base, - T  - height, + T height, - T  - hypotenuse  - - - - ) - + T hypotenuse )
    @@ -2278,9 +2154,14 @@ template<typename T >
    Returns
    perimeter of the triangle
    52 {
    -
    53 return base + height + hypotenuse;
    +
    53 return base + height + hypotenuse;
    54}
    -
    +
    +Here is the call graph for this function:
    +
    +
    +
    + @@ -2294,25 +2175,17 @@ template<typename T > T math::triangle_prism_volume ( - T  - base, + T base, - T  - height, + T height, - T  - depth  - - - - ) - + T depth )
    @@ -2328,9 +2201,14 @@ template<typename T >
    Returns
    The volume of the triangular prism
    67 {
    -
    68 return base * height * depth / 2;
    +
    68 return base * height * depth / 2;
    69}
    -
    +
    +Here is the call graph for this function:
    +
    +
    +
    + @@ -2339,7 +2217,7 @@ template<typename T > diff --git a/dd/d47/namespacemath.js b/dd/d47/namespacemath.js index 66b88dec2..4d5ec3ee8 100644 --- a/dd/d47/namespacemath.js +++ b/dd/d47/namespacemath.js @@ -1,6 +1,6 @@ var namespacemath = [ - [ "Point", "dd/d47/namespacemath.html#a937dc0c826acf3e6c0d2785527f7e9d7", null ], + [ "Point", "dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85", null ], [ "aliquot_sum", "dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf", null ], [ "approximate_pi", "dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188", null ], [ "are_amicable", "dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec", null ], diff --git a/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.map b/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.map new file mode 100644 index 000000000..75cd2f318 --- /dev/null +++ b/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.md5 b/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.md5 new file mode 100644 index 000000000..a4dfd65f0 --- /dev/null +++ b/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.md5 @@ -0,0 +1 @@ +c05fe5822fb8081a031f69cf7259db85 \ No newline at end of file diff --git a/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.svg b/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.svg new file mode 100644 index 000000000..75305d9a7 --- /dev/null +++ b/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.svg @@ -0,0 +1,92 @@ + + + + + + + + + + + +math::parallelogram_perimeter + + +Node1 + + +math::parallelogram +_perimeter + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph_org.svg b/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph_org.svg new file mode 100644 index 000000000..01616f394 --- /dev/null +++ b/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph_org.svg @@ -0,0 +1,67 @@ + + + + + + +math::parallelogram_perimeter + + +Node1 + + +math::parallelogram +_perimeter + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + diff --git a/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.map b/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.map new file mode 100644 index 000000000..b1c07859b --- /dev/null +++ b/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.md5 b/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.md5 new file mode 100644 index 000000000..94f7c15a4 --- /dev/null +++ b/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.md5 @@ -0,0 +1 @@ +325e5824634ed33154b84be5401e645c \ No newline at end of file diff --git a/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.svg b/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.svg new file mode 100644 index 000000000..129056270 --- /dev/null +++ b/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.svg @@ -0,0 +1,92 @@ + + + + + + + + + + + +math::cylinder_surface_perimeter + + +Node1 + + +math::cylinder_surface +_perimeter + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph_org.svg b/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph_org.svg new file mode 100644 index 000000000..adaca29fe --- /dev/null +++ b/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph_org.svg @@ -0,0 +1,67 @@ + + + + + + +math::cylinder_surface_perimeter + + +Node1 + + +math::cylinder_surface +_perimeter + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + diff --git a/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.map b/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.map new file mode 100644 index 000000000..7d3a38966 --- /dev/null +++ b/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.md5 b/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.md5 new file mode 100644 index 000000000..66ceeb647 --- /dev/null +++ b/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.md5 @@ -0,0 +1 @@ +2a58e73e090b32e13251525b65db17e4 \ No newline at end of file diff --git a/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.svg b/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.svg new file mode 100644 index 000000000..fdb006986 --- /dev/null +++ b/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.svg @@ -0,0 +1,92 @@ + + + + + + + + + + + +math::triangle_prism_volume + + +Node1 + + +math::triangle_prism +_volume + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph_org.svg b/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph_org.svg new file mode 100644 index 000000000..1c439cebc --- /dev/null +++ b/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph_org.svg @@ -0,0 +1,67 @@ + + + + + + +math::triangle_prism_volume + + +Node1 + + +math::triangle_prism +_volume + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + diff --git a/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.map b/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.map new file mode 100644 index 000000000..bf5e1762c --- /dev/null +++ b/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.md5 b/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.md5 new file mode 100644 index 000000000..1399f2368 --- /dev/null +++ b/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.md5 @@ -0,0 +1 @@ +191dd02c79d537f80689e673fa553dcf \ No newline at end of file diff --git a/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.svg b/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.svg new file mode 100644 index 000000000..f945deab7 --- /dev/null +++ b/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.svg @@ -0,0 +1,91 @@ + + + + + + + + + + + +math::triangle_perimeter + + +Node1 + + +math::triangle_perimeter + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph_org.svg b/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph_org.svg new file mode 100644 index 000000000..02d77a98f --- /dev/null +++ b/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph_org.svg @@ -0,0 +1,66 @@ + + + + + + +math::triangle_perimeter + + +Node1 + + +math::triangle_perimeter + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + diff --git a/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.map b/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.map new file mode 100644 index 000000000..22ded6048 --- /dev/null +++ b/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.md5 b/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.md5 new file mode 100644 index 000000000..acf93cd9d --- /dev/null +++ b/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.md5 @@ -0,0 +1 @@ +3e9f60973e0ce5359bc63fadc050f876 \ No newline at end of file diff --git a/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.svg b/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.svg new file mode 100644 index 000000000..76dd3c5cf --- /dev/null +++ b/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.svg @@ -0,0 +1,91 @@ + + + + + + + + + + + +math::rect_prism_volume + + +Node1 + + +math::rect_prism_volume + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph_org.svg b/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph_org.svg new file mode 100644 index 000000000..73b0471f3 --- /dev/null +++ b/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph_org.svg @@ -0,0 +1,66 @@ + + + + + + +math::rect_prism_volume + + +Node1 + + +math::rect_prism_volume + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + diff --git a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.map b/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.map index 10d268a22..83063a8ad 100644 --- a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.map +++ b/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.map @@ -1,5 +1,10 @@ - - - + + + + + + + + diff --git a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.md5 b/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.md5 index 7ac9e6356..92e070588 100644 --- a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.md5 +++ b/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.md5 @@ -1 +1 @@ -9480071347f42d3d83bd7dce16b3cd9e \ No newline at end of file +012763b871fcd828b383cf67a6734c86 \ No newline at end of file diff --git a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.svg b/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.svg index 8d9ac9b0b..530777d4a 100644 --- a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.svg +++ b/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.svg @@ -4,8 +4,8 @@ - + - + math::cone_volume Node1 - -math::cone_volume + +math::cone_volume Node2 - - -std::pow + + +height @@ -40,8 +40,53 @@ Node1->Node2 - - + + + + + + + +Node4 + + +std::pow + + + + + +Node1->Node4 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + diff --git a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph_org.svg b/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph_org.svg index 860b7924b..2a2eb074c 100644 --- a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph_org.svg +++ b/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph_org.svg @@ -4,25 +4,25 @@ - - + + math::cone_volume Node1 - -math::cone_volume + +math::cone_volume Node2 - - -std::pow + + +height @@ -30,8 +30,53 @@ Node1->Node2 - - + + + + + + + +Node4 + + +std::pow + + + + + +Node1->Node4 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + diff --git a/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.map b/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.map new file mode 100644 index 000000000..8c4ca8717 --- /dev/null +++ b/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.md5 b/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.md5 new file mode 100644 index 000000000..a48242d45 --- /dev/null +++ b/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.md5 @@ -0,0 +1 @@ +f2e905a032266c284362f085007ec880 \ No newline at end of file diff --git a/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.svg b/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.svg new file mode 100644 index 000000000..0198ac56d --- /dev/null +++ b/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.svg @@ -0,0 +1,91 @@ + + + + + + + + + + + +math::parallelogram_area + + +Node1 + + +math::parallelogram_area + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph_org.svg b/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph_org.svg new file mode 100644 index 000000000..56d64f0fa --- /dev/null +++ b/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph_org.svg @@ -0,0 +1,66 @@ + + + + + + +math::parallelogram_area + + +Node1 + + +math::parallelogram_area + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + diff --git a/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.map b/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.map new file mode 100644 index 000000000..67e5a3f5d --- /dev/null +++ b/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.md5 b/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.md5 new file mode 100644 index 000000000..f4be1433f --- /dev/null +++ b/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.md5 @@ -0,0 +1 @@ +41bf653d9d48bb32d29822ad79a4e137 \ No newline at end of file diff --git a/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.svg b/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.svg new file mode 100644 index 000000000..86974df8c --- /dev/null +++ b/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.svg @@ -0,0 +1,91 @@ + + + + + + + + + + + +math::pyramid_volume + + +Node1 + + +math::pyramid_volume + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph_org.svg b/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph_org.svg new file mode 100644 index 000000000..62abdc561 --- /dev/null +++ b/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph_org.svg @@ -0,0 +1,66 @@ + + + + + + +math::pyramid_volume + + +Node1 + + +math::pyramid_volume + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + diff --git a/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.map b/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.map new file mode 100644 index 000000000..45721859d --- /dev/null +++ b/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.md5 b/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.md5 new file mode 100644 index 000000000..5f297feea --- /dev/null +++ b/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.md5 @@ -0,0 +1 @@ +727be8c14feaa480af95e69e6d213653 \ No newline at end of file diff --git a/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.svg b/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.svg new file mode 100644 index 000000000..06080762b --- /dev/null +++ b/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.svg @@ -0,0 +1,91 @@ + + + + + + + + + + + +math::triangle_area + + +Node1 + + +math::triangle_area + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph_org.svg b/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph_org.svg new file mode 100644 index 000000000..896e550cc --- /dev/null +++ b/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph_org.svg @@ -0,0 +1,66 @@ + + + + + + +math::triangle_area + + +Node1 + + +math::triangle_area + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + diff --git a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.map b/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.map index 87d4915b9..bfaae621c 100644 --- a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.map +++ b/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.map @@ -1,5 +1,10 @@ - - - + + + + + + + + diff --git a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.md5 b/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.md5 index 204a6e733..9247a8e13 100644 --- a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.md5 +++ b/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.md5 @@ -1 +1 @@ -b259412c3b04fdab0a1ae9bf2ea2caac \ No newline at end of file +6eac59b3843310a1d8039173f5678002 \ No newline at end of file diff --git a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.svg b/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.svg index 5fa66d483..385696212 100644 --- a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.svg +++ b/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.svg @@ -4,8 +4,8 @@ - + - + math::cylinder_volume Node1 - -math::cylinder_volume + +math::cylinder_volume Node2 - - -std::pow + + +height @@ -40,8 +40,53 @@ Node1->Node2 - - + + + + + + + +Node4 + + +std::pow + + + + + +Node1->Node4 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + diff --git a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph_org.svg b/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph_org.svg index 986950f77..c20b6e4bd 100644 --- a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph_org.svg +++ b/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph_org.svg @@ -4,25 +4,25 @@ - - + + math::cylinder_volume Node1 - -math::cylinder_volume + +math::cylinder_volume Node2 - - -std::pow + + +height @@ -30,8 +30,53 @@ Node1->Node2 - - + + + + + + + +Node4 + + +std::pow + + + + + +Node1->Node4 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + diff --git a/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.map b/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.map new file mode 100644 index 000000000..bdf906cf0 --- /dev/null +++ b/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.md5 b/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.md5 new file mode 100644 index 000000000..c0546fe08 --- /dev/null +++ b/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.md5 @@ -0,0 +1 @@ +457884b1c2bae6638428084835dd60ff \ No newline at end of file diff --git a/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.svg b/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.svg new file mode 100644 index 000000000..4bb8d2a7c --- /dev/null +++ b/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.svg @@ -0,0 +1,91 @@ + + + + + + + + + + + +math::cylinder_surface_area + + +Node1 + + +math::cylinder_surface_area + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph_org.svg b/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph_org.svg new file mode 100644 index 000000000..7c77871b1 --- /dev/null +++ b/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph_org.svg @@ -0,0 +1,66 @@ + + + + + + +math::cylinder_surface_area + + +Node1 + + +math::cylinder_surface_area + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + + + + +Node2->Node2 + + + + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + + + + diff --git a/dd/d4f/class_solution.html b/dd/d4f/class_solution.html index c11862dde..370922034 100644 --- a/dd/d4f/class_solution.html +++ b/dd/d4f/class_solution.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Solution Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,12 +115,12 @@ Collaboration diagram for Solution:
    - +

    Public Member Functions

    std::vector< std::vector< int > > search_bridges (int n, const std::vector< std::vector< int > > &connections)
    std::vector< std::vector< int > > search_bridges (int n, const std::vector< std::vector< int > > &connections)
     
    - +

    Private Member Functions

    void dfs (int current_node, int parent)
    void dfs (int current_node, int parent)
     
    - - + - - - - - - - +

    @@ -155,19 +157,12 @@ int 

    		timer = 0
    void Solution::dfs (int current_node, int current_node,
    int parent 
    )int parent )
    @@ -212,19 +207,12 @@ int timer = 0 std::vector< std::vector< int > > Solution::search_bridges ( - int  - n, + int n, - const std::vector< std::vector< int > > &  - connections  - - - - ) - + const std::vector< std::vector< int > > & connections ) @@ -259,7 +247,7 @@ int timer = 0
    • Solution
      • -
    • Generated by doxygen 1.9.8
      • +
    • Generated by doxygen 1.10.0
    diff --git a/dd/d51/classstack-members.html b/dd/d51/classstack-members.html index b923be072..4df683c55 100644 --- a/dd/d51/classstack-members.html +++ b/dd/d51/classstack-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -119,7 +121,7 @@ $(document).ready(function(){initNavTree('d1/dc2/classstack.html','../../'); ini diff --git a/dd/d53/structdouble__hashing_1_1_entry-members.html b/dd/d53/structdouble__hashing_1_1_entry-members.html index 8aecc80f1..fe3d55fb7 100644 --- a/dd/d53/structdouble__hashing_1_1_entry-members.html +++ b/dd/d53/structdouble__hashing_1_1_entry-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -110,7 +112,7 @@ $(document).ready(function(){initNavTree('d9/dde/structdouble__hashing_1_1_entry diff --git a/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html b/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html index eac2043e1..2f0c53304 100644 --- a/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html +++ b/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: strings::boyer_moore::pattern Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -105,7 +107,7 @@ $(document).ready(function(){initNavTree('dd/d5a/structstrings_1_1boyer__moore_1

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

    + More...

    Collaboration diagram for strings::boyer_moore::pattern:
    @@ -117,9 +119,9 @@ Public Attributes std::string pat   -std::vector< size_t > bad_char +std::vector< size_t > bad_char   -std::vector< size_t > good_suffix +std::vector< size_t > good_suffix  

    Detailed Description

    @@ -164,7 +166,7 @@ Public Attributes diff --git a/dd/d65/lu__decompose_8cpp.html b/dd/d65/lu__decompose_8cpp.html index 4c73684f5..ee07f348c 100644 --- a/dd/d65/lu__decompose_8cpp.html +++ b/dd/d65/lu__decompose_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/lu_decompose.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -119,13 +121,13 @@ Include dependency graph for lu_decompose.cpp:

    Functions

    template<typename T > -std::ostream & operator<< (std::ostream &out, matrix< T > const &v) +std::ostream & operator<< (std::ostream &out, matrix< T > const &v)   -void test1 () +void test1 ()   -void test2 () +void test2 ()   -int main (int argc, char **argv) +int main (int argc, char **argv)  

    Detailed Description

    @@ -141,19 +143,12 @@ Functions int main ( - int  - argc, + int argc, - char **  - argv  - - - - ) - + char ** argv )
    @@ -161,12 +156,12 @@ Functions
    84 {
    85 std::srand(std::time(NULL)); // random number initializer
    86
    -
    87 test1();
    -
    88 test2();
    +
    87 test1();
    +
    88 test2();
    89 return 0;
    90}
    -
    test2
    void test2()
    Definition lu_decompose.cpp:66
    -
    test1
    void test1()
    Definition lu_decompose.cpp:36
    +
    test2
    void test2()
    Definition lu_decompose.cpp:66
    +
    test1
    void test1()
    Definition lu_decompose.cpp:36
    std::srand
    T srand(T... args)
    std::time
    T time(T... args)
    @@ -188,19 +183,12 @@ template<typename T >
    std::ostream & operator<< ( - std::ostream &  - out, + std::ostream & out, - matrix< T > const &  - v  - - - - ) - + matrix< T > const & v )
    @@ -226,7 +214,7 @@ template<typename T >
    Here is the call graph for this function:
    -
    +
    @@ -240,12 +228,12 @@ Here is the call graph for this function: void test1 ( - ) + )
    -

    Test LU decomposition

    Todo:
    better ways to self-check a matrix output?
    +

    Test LU decomposition

    Todo
    better ways to self-check a matrix output?
    36 {
    37 int mat_size = 3; // default matrix size
    38 const int range = 50;
    @@ -297,7 +285,7 @@ Here is the call graph for this function:
    void test2 ( - ) + ) @@ -334,7 +322,7 @@ Here is the call graph for this function:
    diff --git a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.map b/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.map index 1ed93ed00..501d33718 100644 --- a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.map +++ b/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.map @@ -1,20 +1,13 @@ - - - - - - - - - - - - - - - - - - + + + + + + + + + + + diff --git a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.md5 b/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.md5 index 0abd45eb8..75081c87e 100644 --- a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.md5 +++ b/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.md5 @@ -1 +1 @@ -f99976aef9ebd4ac65c02741d274fc7b \ No newline at end of file +58ca71fcfc592d99f44ef2bc0f19eadc \ No newline at end of file diff --git a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.svg b/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.svg index 86e71b02d..bc983258b 100644 --- a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.svg +++ b/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.svg @@ -4,8 +4,8 @@ - + - + operator<< Node1 - -operator<< + +operator<< @@ -31,8 +31,8 @@ Node2 - -std::endl + +std::endl @@ -40,8 +40,8 @@ Node1->Node2 - - + + @@ -49,8 +49,8 @@ Node3 - -std::left + +std::left @@ -58,17 +58,17 @@ Node1->Node3 - - + + Node4 - - -operator<< + + +std::setfill @@ -76,107 +76,44 @@ Node1->Node4 - - + + Node5 - - -std::setfill + + +std::setw - + Node1->Node5 - - - + + + Node6 - - -std::setw - - - - - -Node1->Node6 - - - - - - - - -Node7 - + std::vector::size - - -Node1->Node7 - - - - - - - - -Node4->Node2 - - - - - - - - -Node4->Node3 - - - - - - - - -Node4->Node4 - - - - - - - - -Node4->Node5 - - - - - - - - -Node4->Node6 - - - + + +Node1->Node6 + + + diff --git a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph_org.svg b/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph_org.svg index 6e5dfed77..f236a4614 100644 --- a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph_org.svg +++ b/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + operator<< Node1 - -operator<< + +operator<< @@ -21,8 +21,8 @@ Node2 - -std::endl + +std::endl @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -39,8 +39,8 @@ Node3 - -std::left + +std::left @@ -48,17 +48,17 @@ Node1->Node3 - - + + Node4 - - -operator<< + + +std::setfill @@ -66,107 +66,44 @@ Node1->Node4 - - + + Node5 - - -std::setfill + + +std::setw - + Node1->Node5 - - - + + + Node6 - - -std::setw - - - - - -Node1->Node6 - - - - - - - - -Node7 - + std::vector::size - - -Node1->Node7 - - - - - - - - -Node4->Node2 - - - - - - - - -Node4->Node3 - - - - - - - - -Node4->Node4 - - - - - - - - -Node4->Node5 - - - - - - - - -Node4->Node6 - - - + + +Node1->Node6 + + + diff --git a/dd/d69/namespacerange__queries.html b/dd/d69/namespacerange__queries.html index 4ce8f8947..6b91c1579 100644 --- a/dd/d69/namespacerange__queries.html +++ b/dd/d69/namespacerange__queries.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: range_queries Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -104,7 +106,7 @@ $(document).ready(function(){initNavTree('dd/d69/namespacerange__queries.html','

    Algorithms and Data Structures that support range queries and updates. -More...

    +More...

    @@ -129,7 +131,7 @@ Classes diff --git a/dd/d73/namespaceiterative__tree__traversals.html b/dd/d73/namespaceiterative__tree__traversals.html index ec14a494f..35b5613d2 100644 --- a/dd/d73/namespaceiterative__tree__traversals.html +++ b/dd/d73/namespaceiterative__tree__traversals.html @@ -3,16 +3,18 @@ - +Algorithms_in_C++: iterative_tree_traversals Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({

    Classes

    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('dd/d73/namespaceiterative__tree__trave

    Functions for the Traversal of the Tree algorithm. -More...

    +More...

    Detailed Description

    Functions for the Traversal of the Tree algorithm.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('dd/d73/namespaceiterative__tree__trave diff --git a/dd/d74/namespaceinorder__successor__of__bst.html b/dd/d74/namespaceinorder__successor__of__bst.html index dc6739b27..c3c49ec21 100644 --- a/dd/d74/namespaceinorder__successor__of__bst.html +++ b/dd/d74/namespaceinorder__successor__of__bst.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: inorder_successor_of_bst Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('dd/d74/namespaceinorder__successor__of

    Functions for the Inorder successor of a binary search tree implementation. -More...

    +More...

    Detailed Description

    Functions for the Inorder successor of a binary search tree implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('dd/d74/namespaceinorder__successor__of diff --git a/dd/d7a/classdouble__linked__list-members.html b/dd/d7a/classdouble__linked__list-members.html index c9616971f..f890d035a 100644 --- a/dd/d7a/classdouble__linked__list-members.html +++ b/dd/d7a/classdouble__linked__list-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,7 +116,7 @@ $(document).ready(function(){initNavTree('d9/dee/classdouble__linked__list.html' diff --git a/dd/d81/namespacecaesar.html b/dd/d81/namespacecaesar.html index 7001d4164..126de2630 100644 --- a/dd/d81/namespacecaesar.html +++ b/dd/d81/namespacecaesar.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: caesar Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('dd/d81/namespacecaesar.html','../../')

    Functions for Caesar cipher algorithm. -More...

    +More...

    Detailed Description

    Functions for Caesar cipher algorithm.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('dd/d81/namespacecaesar.html','../../') diff --git a/dd/d8a/namespacegeometric__dist.html b/dd/d8a/namespacegeometric__dist.html index a9d65e45c..ff9e15eff 100644 --- a/dd/d8a/namespacegeometric__dist.html +++ b/dd/d8a/namespacegeometric__dist.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: geometric_dist Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('dd/d8a/namespacegeometric__dist.html',

    Functions for the Geometric Distribution algorithm implementation. -More...

    +More...

    Detailed Description

    Functions for the Geometric Distribution algorithm implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('dd/d8a/namespacegeometric__dist.html', diff --git a/dd/d92/memory__game_8cpp.html b/dd/d92/memory__game_8cpp.html index 0fba3c7f6..8270b5421 100644 --- a/dd/d92/memory__game_8cpp.html +++ b/dd/d92/memory__game_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: games/memory_game.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -121,38 +123,38 @@ Include dependency graph for memory_game.cpp:

    Functions

    template<typename T > -constexpr T SLEEP (T seconds) +constexpr T SLEEP (T seconds)  for sleep()
      template<typename T > -bool games::memory_game::is_number (const T &input) +bool games::memory_game::is_number (const T &input)  Utility function to verify if the given input is a number or not. This is very useful to prevent the program being stuck in a loop.
      template<typename T > -void games::memory_game::init (std::vector< T > *table) +void games::memory_game::init (std::vector< T > *table)  Initializes the table with the letters.
      template<typename T > -void games::memory_game::print_table (const std::vector< T > &table) +void games::memory_game::print_table (const std::vector< T > &table)  Utility function to print the table.
      template<typename T > -void games::memory_game::reset_data (const std::vector< T > &table, int *answer, int *old_answer, int *memory_count) +void games::memory_game::reset_data (const std::vector< T > &table, int *answer, int *old_answer, int *memory_count)  Utility function that resets the data if the user enters an invalid value.
      template<typename T > -void games::memory_game::ask_data (const std::vector< T > &table, int *answer, int *old_answer, int *memory_count) +void games::memory_game::ask_data (const std::vector< T > &table, int *answer, int *old_answer, int *memory_count)  Function that asks the user for their input in the table they previously chose.
      template<typename T > -bool games::memory_game::match (const std::vector< T > &table, std::vector< T > *table_empty, const int &answer, bool *first_time, int *old_answer, int *memory_count) +bool games::memory_game::match (const std::vector< T > &table, std::vector< T > *table_empty, const int &answer, bool *first_time, int *old_answer, int *memory_count)  Checks if the two values given by the user match.
      template<typename T > -void games::memory_game::assign_results (std::vector< T > *table_empty, std::vector< T > *table, int *answer, bool *first_time, int *old_answer, int *memory_count) +void games::memory_game::assign_results (std::vector< T > *table_empty, std::vector< T > *table, int *answer, bool *first_time, int *old_answer, int *memory_count)  Function to assign the results to the table.
      -int main () +int main ()  Main function.
      @@ -173,31 +175,22 @@ template<typename T > void games::memory_game::ask_data ( - const std::vector< T > &  - table, + const std::vector< T > & table, - int *  - answer, + int * answer, - int *  - old_answer, + int * old_answer, - int *  - memory_count  - - - - ) - + int * memory_count )
    @@ -221,14 +214,14 @@ template<typename T >
    Returns
    void
    162 {
    163 (*old_answer) = (*answer);
    -
    164 print_table(table);
    +
    164 print_table(table);
    165
    166 std::cout << "\n\nType your response here (number index):\n";
    167 std::cin >> (*answer);
    168
    -
    169 if (!is_number((*answer))) {
    +
    169 if (!is_number((*answer))) {
    170 std::cout << "\nYou must enter a valid number.\n\n";
    -
    171 reset_data(table, answer, old_answer, memory_count);
    +
    171 reset_data(table, answer, old_answer, memory_count);
    172 }
    173
    174 // Increase the memory count, which will be later on used for checking if
    @@ -238,12 +231,12 @@ template<typename T >
    178 if (((*answer) > table.size()) || ((*answer) < 1)) {
    179 std::cout << "\nYou can't check a value that doesn't exist (or an "
    180 "invalid number).\n\n";
    -
    181 reset_data(table, answer, old_answer, memory_count);
    +
    181 reset_data(table, answer, old_answer, memory_count);
    182 }
    183
    184 if ((*old_answer) == (*answer)) {
    185 std::cout << "\nYou can't check the same value twice.\n\n";
    -
    186 reset_data(table, answer, old_answer, memory_count);
    +
    186 reset_data(table, answer, old_answer, memory_count);
    187 }
    188
    189 // If two matches are answered already, but the user checkes a non-answered
    @@ -252,14 +245,14 @@ template<typename T >
    192 if ((table[(*answer) - 1] != 0) &&
    193 ((table[(*old_answer)] == 0) || (table[(*old_answer)] != 0))) {
    194 std::cout << "\nYou can't check the same value twice.\n\n";
    -
    195 reset_data(table, answer, old_answer, memory_count);
    +
    195 reset_data(table, answer, old_answer, memory_count);
    196 }
    197}
    -
    games::memory_game::is_number
    bool is_number(const T &input)
    Utility function to verify if the given input is a number or not. This is very useful to prevent the ...
    Definition memory_game.cpp:62
    -
    games::memory_game::print_table
    void print_table(const std::vector< T > &table)
    Utility function to print the table.
    Definition memory_game.cpp:123
    -
    games::memory_game::reset_data
    void reset_data(const std::vector< T > &, int *, int *, int *)
    Utility function that resets the data if the user enters an invalid value.
    Definition memory_game.cpp:211
    +
    games::memory_game::is_number
    bool is_number(const T &input)
    Utility function to verify if the given input is a number or not. This is very useful to prevent the ...
    Definition memory_game.cpp:62
    +
    games::memory_game::print_table
    void print_table(const std::vector< T > &table)
    Utility function to print the table.
    Definition memory_game.cpp:123
    +
    games::memory_game::reset_data
    void reset_data(const std::vector< T > &, int *, int *, int *)
    Utility function that resets the data if the user enters an invalid value.
    Definition memory_game.cpp:211
    Here is the call graph for this function:
    @@ -279,43 +272,32 @@ template<typename T >
    void games::memory_game::assign_results ( - std::vector< T > *  - table_empty, + std::vector< T > * table_empty, - std::vector< T > *  - table, + std::vector< T > * table, - int *  - answer, + int * answer, - bool *  - first_time, + bool * first_time, - int *  - old_answer, + int * old_answer, - int *  - memory_count  - - - - ) - + int * memory_count )
    @@ -345,7 +327,7 @@ template<typename T >
    294 // keep older values already answered.
    295 for (int i = 0; i < (*table).size() + 1; i++) {
    296 if (i == (*answer)) {
    -
    297 if (match((*table), table_empty, (*answer), first_time, old_answer,
    +
    297 if (match((*table), table_empty, (*answer), first_time, old_answer,
    298 memory_count) == true) {
    299 (*table_empty)[i - 1] = (*table)[i - 1];
    300 (*first_time) = true;
    @@ -366,7 +348,7 @@ template<typename T >
    315 if ((*table_empty)[i] == 0) {
    316 break;
    317 } else if (i == (*table).size() - 1) {
    -
    318 print_table((*table));
    +
    318 print_table((*table));
    319
    320 std::cout << "\n\nYou won. Congratulations! Do you want to play "
    321 "again? (y/n)\n";
    @@ -381,15 +363,15 @@ template<typename T >
    330 (*table_empty)[i] = 0;
    331 }
    332
    -
    333 init(table);
    +
    333 init(table);
    334 } else if (try_again == 'n') {
    335 std::cout << "\nThanks for playing the game!\n";
    -
    336 SLEEP(3);
    +
    336 SLEEP(3);
    337
    338 exit(0);
    339 } else {
    340 std::cout << "\nInvalid input (exitting...).\n";
    -
    341 SLEEP(3);
    +
    341 SLEEP(3);
    342
    343 exit(0);
    344 }
    @@ -397,16 +379,16 @@ template<typename T >
    346 }
    347
    348 // Ask data again.
    -
    349 ask_data((*table_empty), answer, old_answer, memory_count);
    -
    350 assign_results(table_empty, table, answer, first_time, old_answer,
    +
    349 ask_data((*table_empty), answer, old_answer, memory_count);
    +
    350 assign_results(table_empty, table, answer, first_time, old_answer,
    351 memory_count);
    352}
    std::exit
    T exit(T... args)
    -
    games::memory_game::match
    bool match(const std::vector< T > &table, std::vector< T > *table_empty, const int &answer, bool *first_time, int *old_answer, int *memory_count)
    Checks if the two values given by the user match.
    Definition memory_game.cpp:235
    -
    games::memory_game::assign_results
    void assign_results(std::vector< T > *table_empty, std::vector< T > *table, int *answer, bool *first_time, int *old_answer, int *memory_count)
    Function to assign the results to the table.
    Definition memory_game.cpp:289
    -
    games::memory_game::ask_data
    void ask_data(const std::vector< T > &table, int *answer, int *old_answer, int *memory_count)
    Function that asks the user for their input in the table they previously chose.
    Definition memory_game.cpp:161
    -
    SLEEP
    constexpr T SLEEP(T seconds)
    for sleep()
    Definition memory_game.cpp:36
    -
    games::memory_game::init
    void init(std::vector< T > *table)
    Initializes the table with the letters.
    Definition memory_game.cpp:80
    +
    games::memory_game::match
    bool match(const std::vector< T > &table, std::vector< T > *table_empty, const int &answer, bool *first_time, int *old_answer, int *memory_count)
    Checks if the two values given by the user match.
    Definition memory_game.cpp:235
    +
    games::memory_game::assign_results
    void assign_results(std::vector< T > *table_empty, std::vector< T > *table, int *answer, bool *first_time, int *old_answer, int *memory_count)
    Function to assign the results to the table.
    Definition memory_game.cpp:289
    +
    games::memory_game::ask_data
    void ask_data(const std::vector< T > &table, int *answer, int *old_answer, int *memory_count)
    Function that asks the user for their input in the table they previously chose.
    Definition memory_game.cpp:161
    +
    SLEEP
    constexpr T SLEEP(T seconds)
    for sleep()
    Definition memory_game.cpp:36
    +
    games::memory_game::init
    void init(std::vector< T > *table)
    Initializes the table with the letters.
    Definition memory_game.cpp:80
    Here is the call graph for this function:
    @@ -426,8 +408,7 @@ template<typename T >
    void games::memory_game::init ( - std::vector< T > *  - table) + std::vector< T > * table) @@ -508,8 +489,7 @@ template<typename T > bool games::memory_game::is_number ( - const T &  - input) + const T & input) @@ -558,8 +538,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -589,54 +568,51 @@ Here is the call graph for this function:
    373 ///< (previous answered values do not count).
    374
    375 std::cout << "\tMEMORY GAME\n";
    -
    376 std::cout << std::boolalpha;
    -
    377 std::cout << std::is_literal_type<void>::value;
    -
    378
    -
    379 do {
    -
    380 std::cout << "\n1. 4x2 (1)";
    -
    381 std::cout << "\n2. 5x2 (2)";
    -
    382 std::cout << "\n3. 7x2 (3)\n";
    -
    383
    -
    384 std::cout << "\nChoose table size: ";
    -
    385 std::cin >> selection;
    -
    386 } while ((selection < 1 || selection > 3) &&
    -
    387 (!games::memory_game::is_number(selection)));
    -
    388
    -
    389 switch (selection) {
    -
    390 case 1:
    -
    391 size = 8;
    -
    392 break;
    -
    393 case 2:
    -
    394 size = 10;
    -
    395 break;
    -
    396 case 3:
    -
    397 size = 14;
    -
    398 break;
    -
    399 default:
    -
    400 size = 10;
    -
    401 break;
    -
    402 }
    -
    403
    -
    404 std::vector<char> table(size);
    -
    405 std::vector<char> table_empty(size);
    +
    376
    +
    377 do {
    +
    378 std::cout << "\n1. 4x2 (1)";
    +
    379 std::cout << "\n2. 5x2 (2)";
    +
    380 std::cout << "\n3. 7x2 (3)\n";
    +
    381
    +
    382 std::cout << "\nChoose table size: ";
    +
    383 std::cin >> selection;
    +
    384 } while ((selection < 1 || selection > 3) &&
    +
    385 (!games::memory_game::is_number(selection)));
    +
    386
    +
    387 switch (selection) {
    +
    388 case 1:
    +
    389 size = 8;
    +
    390 break;
    +
    391 case 2:
    +
    392 size = 10;
    +
    393 break;
    +
    394 case 3:
    +
    395 size = 14;
    +
    396 break;
    +
    397 default:
    +
    398 size = 10;
    +
    399 break;
    +
    400 }
    +
    401
    +
    402 std::vector<char> table(size);
    +
    403 std::vector<char> table_empty(size);
    +
    404
    +
    405 std::cout << "\n";
    406
    -
    407 std::cout << "\n";
    -
    408
    -
    409 games::memory_game::init(&table);
    -
    410 games::memory_game::ask_data(table_empty, &response, &old_answer,
    -
    411 &memory_count);
    -
    412 games::memory_game::assign_results(&table_empty, &table, &response,
    -
    413 &first_time, &old_answer, &memory_count);
    -
    414
    -
    415 return 0;
    -
    416}
    -
    std::boolalpha
    T boolalpha(T... args)
    +
    407 games::memory_game::init(&table);
    +
    408 games::memory_game::ask_data(table_empty, &response, &old_answer,
    +
    409 &memory_count);
    +
    410 games::memory_game::assign_results(&table_empty, &table, &response,
    +
    411 &first_time, &old_answer, &memory_count);
    +
    412
    +
    413 return 0;
    +
    414}
    std::srand
    T srand(T... args)
    std::time
    T time(T... args)
    Here is the call graph for this function:
    -
    +
    @@ -652,43 +628,32 @@ template<typename T > bool games::memory_game::match ( - const std::vector< T > &  - table, + const std::vector< T > & table, - std::vector< T > *  - table_empty, + std::vector< T > * table_empty, - const int &  - answer, + const int & answer, - bool *  - first_time, + bool * first_time, - int *  - old_answer, + int * old_answer, - int *  - memory_count  - - - - ) - + int * memory_count )
    @@ -766,8 +731,7 @@ template<typename T >
    void games::memory_game::print_table ( - const std::vector< T > &  - table) + const std::vector< T > & table) @@ -826,31 +790,22 @@ template<typename T > void games::memory_game::reset_data ( - const std::vector< T > &  - table, + const std::vector< T > & table, - int *  - answer, + int * answer, - int *  - old_answer, + int * old_answer, - int *  - memory_count  - - - - ) - + int * memory_count )
    @@ -876,7 +831,7 @@ template<typename T >
    213 (*answer) = (*old_answer);
    214 (*memory_count)--;
    215
    -
    216 ask_data(table, answer, old_answer, memory_count);
    +
    216 ask_data(table, answer, old_answer, memory_count);
    217}
    Here is the call graph for this function:
    @@ -900,8 +855,7 @@ template<typename T > constexpr T SLEEP ( - T  - seconds) + T seconds) @@ -926,7 +880,7 @@ template<typename T > diff --git a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index b52ac3594..5f7549bb4 100644 --- a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,9 +1,7 @@ - - - - - - - + + + + + diff --git a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 1eb6be00f..5d6fe90c0 100644 --- a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -b8e4f71dc9d503f5b8bee34bb4a244ee \ No newline at end of file +e94af648a79fe2c0d40e38e210c152fd \ No newline at end of file diff --git a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 6f4e0e566..f262ed777 100644 --- a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,8 +4,8 @@ - + - + main Node1 - -main + +main Node2 - - -std::boolalpha + + +std::srand @@ -40,17 +40,17 @@ Node1->Node2 - - + + Node3 - - -std::srand + + +std::time @@ -58,26 +58,8 @@ Node1->Node3 - - - - - - - -Node4 - - -std::time - - - - - -Node1->Node4 - - - + + diff --git a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index dcf18a0c6..7827e3d29 100644 --- a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -4,25 +4,25 @@ - - + + main Node1 - -main + +main Node2 - - -std::boolalpha + + +std::srand @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node3 - - -std::srand + + +std::time @@ -48,26 +48,8 @@ Node1->Node3 - - - - - - - -Node4 - - -std::time - - - - - -Node1->Node4 - - - + + diff --git a/dd/d95/classdata__structures_1_1_segment_tree.html b/dd/d95/classdata__structures_1_1_segment_tree.html index a9f4a8c3d..76a8ccb2e 100644 --- a/dd/d95/classdata__structures_1_1_segment_tree.html +++ b/dd/d95/classdata__structures_1_1_segment_tree.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures::SegmentTree< T > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,31 +109,31 @@ $(document).ready(function(){initNavTree('dd/d95/classdata__structures_1_1_segme

    class representation of the segment tree - More...

    + More...

    - + - + - +

    Public Member Functions

     SegmentTree (int n)
     SegmentTree (int n)
     
    void update (int pos, T val)
    void update (int pos, T val)
     Updates a value at a certain position.
     
    T range_comb (int l, int r)
    T range_comb (int l, int r)
     Returns comb across all values between l and r.
     
    - + - + - + - +

    Private Member Functions

    T comb (T x, T y)
    T comb (T x, T y)
     Any associative function that combines x and y.
     
    int mid (int l, int r)
    int mid (int l, int r)
     Gives the midpoint between two integers.
     
    void update (int i, int l, int r, int pos, T val)
    void update (int i, int l, int r, int pos, T val)
     Helper method for update method below.
     
    T range_comb (int i, int l, int r, int tl, int tr)
    T range_comb (int i, int l, int r, int tl, int tr)
     Helper method for range_comb method below.
     
    @@ -174,8 +176,7 @@ template<class T > - - +
    data_structures::SegmentTree< T >::SegmentTree (int n)int n)
    @@ -185,10 +186,10 @@ template<class T >
    -
    87: t(n * 4, ID), size(n) {}
    -
    data_structures::SegmentTree::ID
    const T ID
    Comb(ID, x) = x.
    Definition segment_tree.cpp:32
    -
    data_structures::SegmentTree::size
    int size
    Number of elements available for querying in the tree.
    Definition segment_tree.cpp:34
    -
    data_structures::SegmentTree::t
    std::vector< T > t
    Vector to represent the tree.
    Definition segment_tree.cpp:33
    +
    87: t(n * 4, ID), size(n) {}
    +
    data_structures::SegmentTree::ID
    const T ID
    Comb(ID, x) = x.
    Definition segment_tree.cpp:32
    +
    data_structures::SegmentTree::size
    int size
    Number of elements available for querying in the tree.
    Definition segment_tree.cpp:34
    +
    data_structures::SegmentTree::t
    std::vector< T > t
    Vector to represent the tree.
    Definition segment_tree.cpp:33
    @@ -207,19 +208,12 @@ template<class T > T data_structures::SegmentTree< T >::comb ( - T  - x, + T x, - T  - y  - - - - ) - + T y ) @@ -258,19 +252,12 @@ template<class T > int data_structures::SegmentTree< T >::mid ( - int  - l, + int l, - int  - r  - - - - ) - + int r ) @@ -310,37 +297,27 @@ template<class T > T data_structures::SegmentTree< T >::range_comb ( - int  - i, + int i, - int  - l, + int l, - int  - r, + int r, - int  - tl, + int tl, - int  - tr  - - - - ) - + int tr ) @@ -363,14 +340,14 @@ template<class T >
    Returns
    The comb operation applied to all values between tl and tr
    80 {
    -
    81 if(l == tl && r == tr) return t[i];
    +
    81 if(l == tl && r == tr) return t[i];
    82 if(tl > tr) return 0;
    -
    83 int m = mid(l, r);
    -
    84 return comb(range_comb(i * 2, l, m, tl, std::min(tr, m)), range_comb(i * 2 + 1, m + 1, r, std::max(tl, m + 1), tr));
    +
    83 int m = mid(l, r);
    +
    84 return comb(range_comb(i * 2, l, m, tl, std::min(tr, m)), range_comb(i * 2 + 1, m + 1, r, std::max(tl, m + 1), tr));
    85 }
    -
    data_structures::SegmentTree::mid
    int mid(int l, int r)
    Gives the midpoint between two integers.
    Definition segment_tree.cpp:51
    -
    data_structures::SegmentTree::comb
    T comb(T x, T y)
    Any associative function that combines x and y.
    Definition segment_tree.cpp:42
    -
    data_structures::SegmentTree::range_comb
    T range_comb(int i, int l, int r, int tl, int tr)
    Helper method for range_comb method below.
    Definition segment_tree.cpp:80
    +
    data_structures::SegmentTree::mid
    int mid(int l, int r)
    Gives the midpoint between two integers.
    Definition segment_tree.cpp:51
    +
    data_structures::SegmentTree::comb
    T comb(T x, T y)
    Any associative function that combines x and y.
    Definition segment_tree.cpp:42
    +
    data_structures::SegmentTree::range_comb
    T range_comb(int i, int l, int r, int tl, int tr)
    Helper method for range_comb method below.
    Definition segment_tree.cpp:80
    std::max
    T max(T... args)
    std::min
    T min(T... args)
    @@ -395,19 +372,12 @@ template<class T >
    T data_structures::SegmentTree< T >::range_comb ( - int  - l, + int l, - int  - r  - - - - ) - + int r ) @@ -427,7 +397,7 @@ template<class T >
    Returns
    The value of the comb operations
    102 {
    -
    103 return range_comb(1, 1, size, l, r);
    +
    103 return range_comb(1, 1, size, l, r);
    104 }
    Here is the call graph for this function:
    @@ -451,37 +421,27 @@ template<class T > void data_structures::SegmentTree< T >::update ( - int  - i, + int i, - int  - l, + int l, - int  - r, + int r, - int  - pos, + int pos, - T  - val  - - - - ) - + T val ) @@ -503,15 +463,15 @@ template<class T >
    62 {
    -
    63 if(l == r) t[i] = val;
    +
    63 if(l == r) t[i] = val;
    64 else {
    -
    65 int m = mid(l, r);
    -
    66 if(pos <= m) update(i * 2, l, m, pos, val);
    -
    67 else update(i * 2 + 1, m + 1, r, pos, val);
    -
    68 t[i] = comb(t[i * 2], t[i * 2 + 1]);
    +
    65 int m = mid(l, r);
    +
    66 if(pos <= m) update(i * 2, l, m, pos, val);
    +
    67 else update(i * 2 + 1, m + 1, r, pos, val);
    +
    68 t[i] = comb(t[i * 2], t[i * 2 + 1]);
    69 }
    70 }
    -
    data_structures::SegmentTree::update
    void update(int i, int l, int r, int pos, T val)
    Helper method for update method below.
    Definition segment_tree.cpp:62
    +
    data_structures::SegmentTree::update
    void update(int i, int l, int r, int pos, T val)
    Helper method for update method below.
    Definition segment_tree.cpp:62
    Here is the call graph for this function:
    @@ -534,19 +494,12 @@ template<class T >
    void data_structures::SegmentTree< T >::update ( - int  - pos, + int pos, - T  - val  - - - - ) - + T val ) @@ -565,7 +518,7 @@ template<class T >
    93 {
    -
    94 update(1, 1, size, pos, val);
    +
    94 update(1, 1, size, pos, val);
    95 }
    Here is the call graph for this function:
    @@ -584,7 +537,7 @@ Here is the call graph for this function: diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html index 00af2e903..2986cbd0c 100644 --- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html +++ b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: machine_learning::aystar_search::EightPuzzle< N > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -108,65 +110,65 @@ $(document).ready(function(){initNavTree('dd/d9c/classmachine__learning_1_1aysta

    A class defining EightPuzzle/15-Puzzle game. - More...

    + More...

    Collaboration diagram for machine_learning::aystar_search::EightPuzzle< N >:
    -
    +
    [legend]
    - + - + - + - + - + - + - + - + - + - + - + - + - +

    Public Member Functions

    uint32_t get (size_t i, size_t j) const
    uint32_t get (size_t i, size_t j) const
     get the value from i units from right and j units from left side of the board
     
    std::array< std::array< uint32_t, N >, N > get_state ()
    std::array< std::array< uint32_t, N >, N > get_state ()
     Returns the current state of the board.
     
    size_t get_size () const
    size_t get_size () const
     returns the size of the EightPuzzle (number of row / column)
     
     EightPuzzle ()
     EightPuzzle ()
     Default constructor for EightPuzzle.
     
     EightPuzzle (const std::array< std::array< uint32_t, N >, N > &init)
     EightPuzzle (const std::array< std::array< uint32_t, N >, N > &init)
     Parameterized Constructor for EightPuzzle.
     
     EightPuzzle (const EightPuzzle< N > &A)
     EightPuzzle (const EightPuzzle< N > &A)
     Copy constructor.
     
     EightPuzzle (const EightPuzzle< N > &&A) noexcept
     EightPuzzle (const EightPuzzle< N > &&A) noexcept
     Move constructor.
     
     ~EightPuzzle ()=default
     Destructor of EightPuzzle.
     
    EightPuzzle & operator= (const EightPuzzle &A)
    EightPuzzle & operator= (const EightPuzzle &A)
     Copy assignment operator.
     
    EightPuzzle & operator= (EightPuzzle &&A) noexcept
    EightPuzzle & operator= (EightPuzzle &&A) noexcept
     Move assignment operator.
     
    std::vector< EightPuzzle< N > > generate_possible_moves ()
    std::vector< EightPuzzle< N > > generate_possible_moves ()
     Find all possible states after processing all possible moves, given the current state of the puzzle.
     
    bool operator== (const EightPuzzle< N > &check) const
    bool operator== (const EightPuzzle< N > &check) const
     check whether two boards are equal
     
    bool operator< (const EightPuzzle< N > &check) const
    bool operator< (const EightPuzzle< N > &check) const
     check whether one board is lexicographically smaller
     
    bool operator<= (const EightPuzzle< N > &check) const
    bool operator<= (const EightPuzzle< N > &check) const
     check whether one board is lexicographically smaller or equal
     
    - + - +

    Private Member Functions

    std::pair< uint32_t, uint32_t > find_zero ()
    std::pair< uint32_t, uint32_t > find_zero ()
     A helper array to evaluate the next state from current state;.
     
    bool in_range (const uint32_t value) const
    bool in_range (const uint32_t value) const
     check whether the index value is bounded within the puzzle area
     
    @@ -175,13 +177,13 @@ Private Attributes - +
    std::array< std::array< uint32_t, N >, N > board
     
    std::vector< std::pair< int8_t, int8_t > > moves
    std::vector< std::pair< int8_t, int8_t > > moves
     N x N array to store the current state of the Puzzle.
     
    - +

    Friends

    std::ostream & operator<< (std::ostream &op, const EightPuzzle< N > &SomeState)
    std::ostream & operator<< (std::ostream &op, const EightPuzzle< N > &SomeState)
     friend operator to display EightPuzzle<>
     
    @@ -209,7 +211,7 @@ template<size_t N = 3>
    machine_learning::aystar_search::EightPuzzle< N >::EightPuzzle ( - ) + ) @@ -246,8 +248,7 @@ template<size_t N = 3>
    machine_learning::aystar_search::EightPuzzle< N >::EightPuzzle ( - const std::array< std::array< uint32_t, N >, N > &  - init) + const std::array< std::array< uint32_t, N >, N > & init) @@ -283,8 +284,7 @@ template<size_t N = 3> machine_learning::aystar_search::EightPuzzle< N >::EightPuzzle ( - const EightPuzzle< N > &  - A) + const EightPuzzle< N > & A) @@ -320,8 +320,7 @@ template<size_t N = 3> machine_learning::aystar_search::EightPuzzle< N >::EightPuzzle ( - const EightPuzzle< N > &&  - A) + const EightPuzzle< N > && A) @@ -359,7 +358,7 @@ template<size_t N = 3> std::pair< uint32_t, uint32_t > machine_learning::aystar_search::EightPuzzle< N >::find_zero ( - ) + ) @@ -399,7 +398,7 @@ template<size_t N = 3> std::vector< EightPuzzle< N > > machine_learning::aystar_search::EightPuzzle< N >::generate_possible_moves ( - ) + ) @@ -414,12 +413,12 @@ template<size_t N = 3>
    Returns
    list of vector containing all possible next moves
    Note
    the implementation is compulsory to create A* search
    176 {
    -
    177 auto zero_pos = find_zero();
    +
    177 auto zero_pos = find_zero();
    178 // vector which will contain all possible state from current state
    179 std::vector<EightPuzzle<N>> NewStates;
    -
    180 for (auto &move : moves) {
    -
    181 if (in_range(zero_pos.first + move.first) &&
    -
    182 in_range(zero_pos.second + move.second)) {
    +
    180 for (auto &move : moves) {
    +
    181 if (in_range(zero_pos.first + move.first) &&
    +
    182 in_range(zero_pos.second + move.second)) {
    183 // swap with the possible moves
    184 std::array<std::array<uint32_t, N>, N> new_config = board;
    185 std::swap(new_config[zero_pos.first][zero_pos.second],
    @@ -433,9 +432,9 @@ template<size_t N = 3>
    193 return NewStates;
    194 }
    -
    machine_learning::aystar_search::EightPuzzle::in_range
    bool in_range(const uint32_t value) const
    check whether the index value is bounded within the puzzle area
    Definition a_star_search.cpp:90
    -
    machine_learning::aystar_search::EightPuzzle::find_zero
    std::pair< uint32_t, uint32_t > find_zero()
    A helper array to evaluate the next state from current state;.
    Definition a_star_search.cpp:75
    -
    machine_learning::aystar_search::EightPuzzle::moves
    std::vector< std::pair< int8_t, int8_t > > moves
    N x N array to store the current state of the Puzzle.
    Definition a_star_search.cpp:64
    +
    machine_learning::aystar_search::EightPuzzle::in_range
    bool in_range(const uint32_t value) const
    check whether the index value is bounded within the puzzle area
    Definition a_star_search.cpp:90
    +
    machine_learning::aystar_search::EightPuzzle::find_zero
    std::pair< uint32_t, uint32_t > find_zero()
    A helper array to evaluate the next state from current state;.
    Definition a_star_search.cpp:75
    +
    machine_learning::aystar_search::EightPuzzle::moves
    std::vector< std::pair< int8_t, int8_t > > moves
    N x N array to store the current state of the Puzzle.
    Definition a_star_search.cpp:64
    std::vector::emplace_back
    T emplace_back(T... args)
    std::swap
    T swap(T... args)
    @@ -461,19 +460,12 @@ template<size_t N = 3> uint32_t machine_learning::aystar_search::EightPuzzle< N >::get ( - size_t  - i, + size_t i, - size_t  - j  - - - - ) - const + size_t j ) const @@ -495,7 +487,7 @@ template<size_t N = 3>
    -1 if invalid i or j position
    102 {
    -
    103 if (in_range(i) && in_range(j)) {
    +
    103 if (in_range(i) && in_range(j)) {
    104 return board[i][j];
    105 }
    106 return -1;
    @@ -522,7 +514,7 @@ template<size_t N = 3>
    size_t machine_learning::aystar_search::EightPuzzle< N >::get_size ( - ) + ) const @@ -553,7 +545,7 @@ template<size_t N = 3> std::array< std::array< uint32_t, N >, N > machine_learning::aystar_search::EightPuzzle< N >::get_state ( - ) + ) @@ -583,8 +575,7 @@ template<size_t N = 3> bool machine_learning::aystar_search::EightPuzzle< N >::in_range ( - const uint32_t  - value) + const uint32_t value) const @@ -621,8 +612,7 @@ template<size_t N = 3> bool machine_learning::aystar_search::EightPuzzle< N >::operator< ( - const EightPuzzle< N > &  - check) + const EightPuzzle< N > & check) const @@ -663,8 +653,7 @@ template<size_t N = 3> bool machine_learning::aystar_search::EightPuzzle< N >::operator<= ( - const EightPuzzle< N > &  - check) + const EightPuzzle< N > & check) const @@ -704,8 +693,7 @@ template<size_t N = 3> EightPuzzle & machine_learning::aystar_search::EightPuzzle< N >::operator= ( - const EightPuzzle< N > &  - A) + const EightPuzzle< N > & A) @@ -744,8 +732,7 @@ template<size_t N = 3> EightPuzzle & machine_learning::aystar_search::EightPuzzle< N >::operator= ( - EightPuzzle< N > &&  - A) + EightPuzzle< N > && A) @@ -789,8 +776,7 @@ template<size_t N = 3> bool machine_learning::aystar_search::EightPuzzle< N >::operator== ( - const EightPuzzle< N > &  - check) + const EightPuzzle< N > & check) const @@ -834,19 +820,12 @@ template<size_t N = 3> std::ostream & operator<< ( - std::ostream &  - op, + std::ostream & op, - const EightPuzzle< N > &  - SomeState  - - - - ) - + const EightPuzzle< N > & SomeState ) @@ -925,7 +904,7 @@ template<size_t N = 3> diff --git a/dd/da0/todo.html b/dd/da0/todo.html index e74bbef06..6fd93cd7b 100644 --- a/dd/da0/todo.html +++ b/dd/da0/todo.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Todo List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -136,7 +138,7 @@ $(document).ready(function(){initNavTree('dd/da0/todo.html','../../'); initResiz diff --git a/dd/da8/pigeonhole__sort_8cpp.html b/dd/da8/pigeonhole__sort_8cpp.html index d43119f50..6fd61e69a 100644 --- a/dd/da8/pigeonhole__sort_8cpp.html +++ b/dd/da8/pigeonhole__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/pigeonhole_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,13 +129,13 @@ Functions template<std::size_t N> std::array< int, N > sorting::pigeonSort (std::array< int, N > arr)   -static void test_1 () +static void test_1 ()   -static void test_2 () +static void test_2 ()   -static void test_3 () +static void test_3 ()   -int main () +int main ()  

    Detailed Description

    @@ -151,23 +153,22 @@ Functions int main ( - void  - ) + void )

    Main function

    127 {
    -
    128 test_1();
    -
    129 test_2();
    -
    130 test_3();
    +
    128 test_1();
    +
    129 test_2();
    +
    130 test_3();
    131
    132 return 0;
    133}
    -
    test_1
    static void test_1()
    Definition pigeonhole_sort.cpp:68
    -
    test_2
    static void test_2()
    Definition pigeonhole_sort.cpp:88
    -
    test_3
    static void test_3()
    Definition pigeonhole_sort.cpp:109
    +
    test_1
    static void test_1()
    Definition pigeonhole_sort.cpp:68
    +
    test_2
    static void test_2()
    Definition pigeonhole_sort.cpp:88
    +
    test_3
    static void test_3()
    Definition pigeonhole_sort.cpp:109
    Here is the call graph for this function:
    @@ -188,7 +189,7 @@ Here is the call graph for this function:
    static void test_1 ( - ) + ) @@ -239,7 +240,7 @@ Here is the call graph for this function:
    static void test_2 ( - ) + ) @@ -285,7 +286,7 @@ Here is the call graph for this function: static void test_3 ( - ) + ) @@ -324,7 +325,7 @@ Here is the call graph for this function: diff --git a/dd/da8/struct_segment_intersection-members.html b/dd/da8/struct_segment_intersection-members.html index 5750a6684..8f7dcac5c 100644 --- a/dd/da8/struct_segment_intersection-members.html +++ b/dd/da8/struct_segment_intersection-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d4/db4/struct_segment_intersection.htm diff --git a/dd/dae/namespacecount__of__set__bits.html b/dd/dae/namespacecount__of__set__bits.html index b70291a89..b74731392 100644 --- a/dd/dae/namespacecount__of__set__bits.html +++ b/dd/dae/namespacecount__of__set__bits.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: count_of_set_bits Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('dd/dae/namespacecount__of__set__bits.h

    Functions for the count sets bits implementation. -More...

    +More...

    Detailed Description

    Functions for the count sets bits implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('dd/dae/namespacecount__of__set__bits.h diff --git a/dd/dae/structquadratic__probing_1_1_entry-members.html b/dd/dae/structquadratic__probing_1_1_entry-members.html index 972eb8930..31dc64fe7 100644 --- a/dd/dae/structquadratic__probing_1_1_entry-members.html +++ b/dd/dae/structquadratic__probing_1_1_entry-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -110,7 +112,7 @@ $(document).ready(function(){initNavTree('da/dd1/structquadratic__probing_1_1_en diff --git a/dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html b/dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html index 41088e3ef..6ba3c5d11 100644 --- a/dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html +++ b/dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -251,7 +253,7 @@ $(document).ready(function(){initNavTree('dd/db0/_2_users_2runner_2work_2_c-_plu diff --git a/dd/db6/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix-members.html b/dd/db6/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix-members.html index b18df31ab..e9073d642 100644 --- a/dd/db6/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix-members.html +++ b/dd/db6/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,7 +129,7 @@ $(document).ready(function(){initNavTree('dc/d13/classdivide__and__conquer_1_1st diff --git a/dd/db6/structbinary__search__tree_1_1bst__node.html b/dd/db6/structbinary__search__tree_1_1bst__node.html index 228c8b3d3..98131027c 100644 --- a/dd/db6/structbinary__search__tree_1_1bst__node.html +++ b/dd/db6/structbinary__search__tree_1_1bst__node.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: binary_search_tree< T >::bst_node Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,25 +108,25 @@ $(document).ready(function(){initNavTree('dd/db6/structbinary__search__tree_1_1b

    A struct to represent a node in the Binary Search Tree. - More...

    + More...

    Collaboration diagram for binary_search_tree< T >::bst_node:
    -
    +
    [legend]
    - +

    Public Member Functions

     bst_node (T _value)
     bst_node (T _value)
     
    - + - + - +

    Public Attributes

    T value
    T value
     
    std::unique_ptr< bst_node > left
    std::unique_ptr< bst_node > left
     
    std::unique_ptr< bst_node > right
    std::unique_ptr< bst_node > right
     

    Detailed Description

    @@ -145,8 +147,7 @@ template<class T >
    binary_search_tree< T >::bst_node::bst_node ( - T  - _value) + T _value) @@ -163,13 +164,12 @@ template<class T >
    35 {
    -
    36 value = _value;
    -
    37 left = nullptr;
    -
    38 right = nullptr;
    +
    36 value = _value;
    +
    37 left = nullptr;
    +
    38 right = nullptr;
    39 }
    -
    binary_search_tree::bst_node::right
    std::unique_ptr< bst_node > right
    Definition binary_search_tree2.cpp:28
    -
    binary_search_tree::bst_node::value
    T value
    Definition binary_search_tree2.cpp:26
    -
    binary_search_tree::bst_node::left
    std::unique_ptr< bst_node > left
    Definition binary_search_tree2.cpp:27
    +
    binary_search_tree::bst_node::right
    std::unique_ptr< bst_node > right
    Definition binary_search_tree2.cpp:28
    +
    binary_search_tree::bst_node::value
    T value
    Definition binary_search_tree2.cpp:26
    @@ -234,7 +234,7 @@ template<class T > diff --git a/dd/dba/namespacedivide__and__conquer.html b/dd/dba/namespacedivide__and__conquer.html index 64f4591e7..768c2519c 100644 --- a/dd/dba/namespacedivide__and__conquer.html +++ b/dd/dba/namespacedivide__and__conquer.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: divide_and_conquer Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('dd/dba/namespacedivide__and__conquer.h

    for std::vector -More...

    +More...

    Detailed Description

    for std::vector

    Strassen's algorithm is one of the methods for multiplying two matrices. It is one of the faster algorithms for larger matrices than naive multiplication method.

    @@ -117,7 +119,7 @@ $(document).ready(function(){initNavTree('dd/dba/namespacedivide__and__conquer.h diff --git a/dd/dbb/struct_test_case-members.html b/dd/dbb/struct_test_case-members.html index 3aaf64e7a..d47c4c8ee 100644 --- a/dd/dbb/struct_test_case-members.html +++ b/dd/dbb/struct_test_case-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('da/d86/struct_test_case.html','../../' diff --git a/dd/dca/class_f_c_f_s.html b/dd/dca/class_f_c_f_s.html index aec109f71..5ccca8f32 100644 --- a/dd/dca/class_f_c_f_s.html +++ b/dd/dca/class_f_c_f_s.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: FCFS< S, T, E > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,28 +108,28 @@ $(document).ready(function(){initNavTree('dd/dca/class_f_c_f_s.html','../../');

    Class which implements the FCFS scheduling algorithm. - More...

    + More...

    Collaboration diagram for FCFS< S, T, E >:
    -
    +
    [legend]
    - + - + - +

    Public Member Functions

    void addProcess (S id, T arrival, E burst)
    void addProcess (S id, T arrival, E burst)
     Adds the process to the ready queue if it isn't already there.
     
    vector< tuple< S, T, E, double, double, double > > scheduleForFcfs ()
    vector< tuple< S, T, E, double, double, double > > scheduleForFcfs ()
     Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algorithm.
     
    void printResult ()
    void printResult ()
     Utility function for printing the status of each process after execution.
     
    - + @@ -162,25 +164,17 @@ template<typename S , typename T , typename E > - - + - - + - - - - - - - +

    Private Attributes

    priority_queue< tuple< S, T, E, double, double, double >, vector< tuple< S, T, E, double, double, double > >, Compare< S, T, E > > schedule
    priority_queue< tuple< S, T, E, double, double, double >, vector< tuple< S, T, E, double, double, double > >, Compare< S, T, E > > schedule
     
    vector< tuple< S, T, E, double, double, double > > result
    void FCFS< S, T, E >::addProcess (S id, S id,
    T arrival, T arrival,
    E burst 
    )E burst )
    @@ -204,16 +198,15 @@ template<typename S , typename T , typename E >
    130 // Add if a process with process ID as id is not found in idList.
    131 if (idList.find(id) == idList.end()) {
    132 tuple<S, T, E, double, double, double> t =
    -
    133 make_tuple(id, arrival, burst, 0, 0, 0);
    -
    134 schedule.push(t);
    +
    133 make_tuple(id, arrival, burst, 0, 0, 0);
    +
    134 schedule.push(t);
    135 idList.insert(id);
    136 }
    137 }
    -
    FCFS::schedule
    priority_queue< tuple< S, T, E, double, double, double >, vector< tuple< S, T, E, double, double, double > >, Compare< S, T, E > > schedule
    Definition fcfs_scheduling.cpp:111
    +
    FCFS::schedule
    priority_queue< tuple< S, T, E, double, double, double >, vector< tuple< S, T, E, double, double, double > >, Compare< S, T, E > > schedule
    Definition fcfs_scheduling.cpp:111
    std::unordered_set::end
    T end(T... args)
    std::unordered_set::find
    T find(T... args)
    std::unordered_set::insert
    T insert(T... args)
    -
    std::make_tuple
    T make_tuple(T... args)
    Here is the call graph for this function:
    @@ -237,7 +230,7 @@ template<typename S , typename T , typename E > void FCFS< S, T, E >::printResult ( - ) + ) @@ -297,7 +290,7 @@ template<typename S , typename T , typename E > vector< tuple< S, T, E, double, double, double > > FCFS< S, T, E >::scheduleForFcfs ( - ) + ) @@ -316,8 +309,8 @@ template<typename S , typename T , typename E >
    155 // Variable to keep track of time elapsed so far
    156 double timeElapsed = 0;
    157
    -
    158 while (!schedule.empty()) {
    -
    159 tuple<S, T, E, double, double, double> cur = schedule.top();
    +
    158 while (!schedule.empty()) {
    +
    159 tuple<S, T, E, double, double, double> cur = schedule.top();
    160
    161 // If the current process arrived at time t2, the last process
    162 // completed its execution at time t1, and t2 > t1.
    @@ -339,7 +332,7 @@ template<typename S , typename T , typename E >
    178 get<5>(cur) = get<4>(cur) - get<2>(cur);
    179
    180 result.push_back(cur);
    -
    181 schedule.pop();
    +
    181 schedule.pop();
    182 }
    183 return result;
    184 }
    @@ -381,7 +374,7 @@ template<typename S , typename T , typename E > diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html index 04e8bb0a3..e5cf2d2e7 100644 --- a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html +++ b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others::recursive_tree_traversals::BT Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('dd/de1/classothers_1_1recursive__tree_

    BT used to make the entire structure of the binary tree and the functions associated with the binary tree. - More...

    + More...

    Collaboration diagram for others::recursive_tree_traversals::BT:
    @@ -115,15 +117,15 @@ Collaboration diagram for others::recursive_tree_traversals::BT:
    - + - + - + - +

    Public Member Functions

    Node * createNewNode (uint64_t)
    Node * createNewNode (uint64_t)
     will allocate the memory for a node and, along the data and return the node.
     
    std::vector< uint64_t > inorder (Node *)
    std::vector< uint64_t > inorder (Node *)
     
    std::vector< uint64_t > preorder (Node *)
    std::vector< uint64_t > preorder (Node *)
     preorder function that will perform the preorder traversal recursively, and return the resultant vector that contain the preorder traversal of a tree.
     
    std::vector< uint64_t > postorder (Node *)
    std::vector< uint64_t > postorder (Node *)
     postorder function that will perform the postorder traversal recursively, and return the result vector that contain the postorder traversal of a tree.
     
    @@ -151,8 +153,7 @@ Public Attributes - - +
    Node * others::recursive_tree_traversals::BT::createNewNode (uint64_t data)uint64_t data)
    @@ -170,8 +171,9 @@ Public Attributes
    117 Node *node = new Node();
    118 node->data = data;
    119 node->left = node->right = nullptr;
    -
    120 return node;
    +
    120 return node;
    121}
    +
    node
    struct node { int data; int height; struct node *left; struct node *right;} node
    for std::queue
    Definition avltree.cpp:13
    data
    int data[MAX]
    test data
    Definition hash_search.cpp:24
    Node
    Definition linkedlist_implentation_usingarray.cpp:14
    node
    Definition binary_search_tree.cpp:11
    @@ -187,8 +189,7 @@ Public Attributes std::vector< uint64_t > others::recursive_tree_traversals::BT::inorder ( - Node *  - root) + Node * root) @@ -218,8 +219,7 @@ Public Attributes std::vector< uint64_t > others::recursive_tree_traversals::BT::postorder ( - Node *  - root) + Node * root) @@ -238,14 +238,14 @@ Public Attributes
    172 return {};
    173 }
    174
    -
    175 postorder(root->left); // Traverse the left subtree
    -
    176 postorder(root->right); // Traverse the right subtree
    +
    175 postorder(root->left); // Traverse the left subtree
    +
    176 postorder(root->right); // Traverse the right subtree
    177 BT::postorder_result.push_back(
    178 root->data); // Display the data part of the root (or current node)
    179
    180 return postorder_result;
    181}
    -
    others::recursive_tree_traversals::BT::postorder
    std::vector< uint64_t > postorder(Node *)
    postorder function that will perform the postorder traversal recursively, and return the result vecto...
    Definition recursive_tree_traversal.cpp:170
    +
    others::recursive_tree_traversals::BT::postorder
    std::vector< uint64_t > postorder(Node *)
    postorder function that will perform the postorder traversal recursively, and return the result vecto...
    Definition recursive_tree_traversal.cpp:170
    Here is the call graph for this function:
    @@ -263,8 +263,7 @@ Here is the call graph for this function:
    std::vector< uint64_t > others::recursive_tree_traversals::BT::preorder ( - Node *  - root) + Node * root) @@ -285,12 +284,12 @@ Here is the call graph for this function:
    154
    155 BT::preorder_result.push_back(
    156 root->data); // Display the data part of the root (or current node)
    -
    157 preorder(root->left); // Traverse the left subtree
    -
    158 preorder(root->right); // Traverse the right subtree
    +
    157 preorder(root->left); // Traverse the left subtree
    +
    158 preorder(root->right); // Traverse the right subtree
    159
    160 return preorder_result;
    161}
    -
    others::recursive_tree_traversals::BT::preorder
    std::vector< uint64_t > preorder(Node *)
    preorder function that will perform the preorder traversal recursively, and return the resultant vect...
    Definition recursive_tree_traversal.cpp:150
    +
    others::recursive_tree_traversals::BT::preorder
    std::vector< uint64_t > preorder(Node *)
    preorder function that will perform the preorder traversal recursively, and return the resultant vect...
    Definition recursive_tree_traversal.cpp:150
    Here is the call graph for this function:
    @@ -308,7 +307,7 @@ Here is the call graph for this function:
    diff --git a/dd/dfc/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d-members.html b/dd/dfc/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d-members.html index 04c448efd..a0aa4550f 100644 --- a/dd/dfc/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d-members.html +++ b/dd/dfc/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -143,7 +145,7 @@ $(document).ready(function(){initNavTree('d2/d8a/classrange__queries_1_1heavy__l diff --git a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html index d08dbb5e4..eddc38b4b 100644 --- a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html +++ b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph::is_graph_bipartite::Graph Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('de/d00/classgraph_1_1is__graph__bipart

    Class for representing graph as an adjacency list. - More...

    + More...

    Collaboration diagram for graph::is_graph_bipartite::Graph:
    @@ -115,13 +117,13 @@ Collaboration diagram for graph::is_graph_bipartite::Graph:
    - + - + - +

    Public Member Functions

     Graph (int size)
     Graph (int size)
     Constructor that initializes the graph on creation.
     
    void addEdge (int u, int v)
    void addEdge (int u, int v)
     Function that add an edge between two nodes or vertices of graph.
     
    bool is_bipartite ()
    bool is_bipartite ()
     function to add edges to our graph
     
    @@ -155,8 +157,7 @@ int  - - +
    n
    graph::is_graph_bipartite::Graph::Graph (int size)int size)
    @@ -175,13 +176,13 @@ int n
    65 {
    -
    66 n = size;
    -
    67 adj.resize(n);
    -
    68 side.resize(n, -1);
    +
    66 n = size;
    +
    67 adj.resize(n);
    +
    68 side.resize(n, -1);
    69 }
    -
    graph::is_graph_bipartite::Graph::side
    std::vector< int > side
    stores the side of the vertex
    Definition is_graph_bipartite.cpp:58
    -
    graph::is_graph_bipartite::Graph::adj
    std::vector< std::vector< int > > adj
    adj stores the graph as an adjacency list
    Definition is_graph_bipartite.cpp:56
    -
    graph::is_graph_bipartite::Graph::n
    int n
    size of the graph
    Definition is_graph_bipartite.cpp:53
    +
    graph::is_graph_bipartite::Graph::side
    std::vector< int > side
    stores the side of the vertex
    Definition is_graph_bipartite.cpp:58
    +
    graph::is_graph_bipartite::Graph::adj
    std::vector< std::vector< int > > adj
    adj stores the graph as an adjacency list
    Definition is_graph_bipartite.cpp:56
    +
    graph::is_graph_bipartite::Graph::n
    int n
    size of the graph
    Definition is_graph_bipartite.cpp:53
    std::vector::resize
    T resize(T... args)
    Here is the call graph for this function:
    @@ -201,19 +202,12 @@ Here is the call graph for this function:
    void Graph::addEdge ( - int  - u, + int u, - int  - v  - - - - ) - + int v )
    @@ -227,8 +221,8 @@ Here is the call graph for this function:
    83 {
    -
    84 adj[u - 1].push_back(v - 1);
    -
    85 adj[v - 1].push_back(u - 1);
    +
    84 adj[u - 1].push_back(v - 1);
    +
    85 adj[v - 1].push_back(u - 1);
    86}
    std::vector::push_back
    T push_back(T... args)
    @@ -248,7 +242,7 @@ Here is the call graph for this function:
    bool Graph::is_bipartite ( - ) + ) @@ -263,19 +257,19 @@ Here is the call graph for this function:
    106 {
    107 bool check = true;
    108 std::queue<int> q;
    -
    109 for (int current_edge = 0; current_edge < n; ++current_edge) {
    -
    110 if (side[current_edge] == -1) {
    +
    109 for (int current_edge = 0; current_edge < n; ++current_edge) {
    +
    110 if (side[current_edge] == -1) {
    111 q.push(current_edge);
    -
    112 side[current_edge] = 0;
    +
    112 side[current_edge] = 0;
    113 while (q.size()) {
    114 int current = q.front();
    115 q.pop();
    -
    116 for (auto neighbour : adj[current]) {
    -
    117 if (side[neighbour] == -1) {
    -
    118 side[neighbour] = (1 ^ side[current]);
    +
    116 for (auto neighbour : adj[current]) {
    +
    117 if (side[neighbour] == -1) {
    +
    118 side[neighbour] = (1 ^ side[current]);
    119 q.push(neighbour);
    120 } else {
    -
    121 check &= (side[neighbour] != side[current]);
    +
    121 check &= (side[neighbour] != side[current]);
    122 }
    123 }
    124 }
    @@ -297,7 +291,7 @@ Here is the call graph for this function:
    diff --git a/de/d07/cycle__sort_8cpp.html b/de/d07/cycle__sort_8cpp.html index 11e698741..11933a524 100644 --- a/de/d07/cycle__sort_8cpp.html +++ b/de/d07/cycle__sort_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting/cycle_sort.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,13 +130,13 @@ Namespaces

    Functions

    template<typename T > -std::vector< T > sorting::cycle_sort::cycleSort (const std::vector< T > &in_arr) +std::vector< T > sorting::cycle_sort::cycleSort (const std::vector< T > &in_arr)  The main function implements cycleSort.
      -static void test () +static void test ()  Test implementations.
      -int main () +int main ()  Main function.
      @@ -153,8 +155,7 @@ template<typename T >
    std::vector< T > sorting::cycle_sort::cycleSort ( - const std::vector< T > &  - in_arr) + const std::vector< T > & in_arr) @@ -240,8 +241,7 @@ Here is the call graph for this function: int main ( - void  - ) + void ) @@ -250,10 +250,10 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    127 {
    -
    128 test(); // execute the test
    +
    128 test(); // execute the test
    129 return 0;
    130}
    -
    test
    static void test()
    Test implementations.
    Definition cycle_sort.cpp:91
    +
    test
    static void test()
    Test implementations.
    Definition cycle_sort.cpp:91
    Here is the call graph for this function:
    @@ -274,7 +274,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -292,14 +292,14 @@ Here is the call graph for this function:
    93 // [4, 3, 2, 1] return [1, 2, 3, 4]
    94 std::vector<uint32_t> array1 = {4, 3, 2, 1};
    95 std::cout << "Test 1... ";
    -
    96 std::vector<uint32_t> arr1 = sorting::cycle_sort::cycleSort(array1);
    +
    96 std::vector<uint32_t> arr1 = sorting::cycle_sort::cycleSort(array1);
    97 assert(std::is_sorted(std::begin(arr1), std::end(arr1)));
    98 std::cout << "passed" << std::endl;
    99
    100 // [4.3, -6.5, -7.4, 0, 2.7, 1.8] return [-7.4, -6.5, 0, 1.8, 2.7, 4.3]
    101 std::vector<double> array2 = {4.3, -6.5, -7.4, 0, 2.7, 1.8};
    102 std::cout << "Test 2... ";
    -
    103 std::vector<double> arr2 = sorting::cycle_sort::cycleSort(array2);
    +
    103 std::vector<double> arr2 = sorting::cycle_sort::cycleSort(array2);
    104 assert(std::is_sorted(std::begin(arr2), std::end(arr2)));
    105 std::cout << "passed" << std::endl;
    106
    @@ -307,20 +307,20 @@ Here is the call graph for this function:
    108 // [3, 3, 3, 3] return [3, 3, 3, 3]
    109 std::vector<uint32_t> array3 = {3, 3, 3, 3};
    110 std::cout << "Test 3... ";
    -
    111 std::vector<uint32_t> arr3 = sorting::cycle_sort::cycleSort(array3);
    +
    111 std::vector<uint32_t> arr3 = sorting::cycle_sort::cycleSort(array3);
    112 assert(std::is_sorted(std::begin(arr3), std::end(arr3)));
    113 std::cout << "passed" << std::endl;
    114
    115 // [9, 4, 6, 8, 14, 3] return [9, 4, 6, 8, 14, 3]
    116 std::vector<uint32_t> array4 = {3, 4, 6, 8, 9, 14};
    117 std::cout << "Test 4... ";
    -
    118 std::vector<uint32_t> arr4 = sorting::cycle_sort::cycleSort(array4);
    +
    118 std::vector<uint32_t> arr4 = sorting::cycle_sort::cycleSort(array4);
    119 assert(std::is_sorted(std::begin(arr4), std::end(arr4)));
    120 std::cout << "passed" << std::endl;
    121}
    std::begin
    T begin(T... args)
    -
    sorting::cycle_sort::cycleSort
    std::vector< T > cycleSort(const std::vector< T > &in_arr)
    The main function implements cycleSort.
    Definition cycle_sort.cpp:37
    +
    sorting::cycle_sort::cycleSort
    std::vector< T > cycleSort(const std::vector< T > &in_arr)
    The main function implements cycleSort.
    Definition cycle_sort.cpp:37
    std::end
    T end(T... args)
    std::endl
    T endl(T... args)
    std::is_sorted
    T is_sorted(T... args)
    @@ -338,7 +338,7 @@ Here is the call graph for this function: diff --git a/de/d0a/namespacemerge__insertion.html b/de/d0a/namespacemerge__insertion.html index 80bd1f5bb..2795cb4af 100644 --- a/de/d0a/namespacemerge__insertion.html +++ b/de/d0a/namespacemerge__insertion.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: merge_insertion Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('de/d0a/namespacemerge__insertion.html'

    Combined Intersion-Merge sorting algorithm. -More...

    +More...

    Detailed Description

    Combined Intersion-Merge sorting algorithm.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('de/d0a/namespacemerge__insertion.html' diff --git a/de/d0d/classrange__queries_1_1fenwick__tree.html b/de/d0d/classrange__queries_1_1fenwick__tree.html index c3c967322..dc0a87ca2 100644 --- a/de/d0d/classrange__queries_1_1fenwick__tree.html +++ b/de/d0d/classrange__queries_1_1fenwick__tree.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: range_queries::fenwick_tree Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('de/d0d/classrange__queries_1_1fenwick_

    The class that initializes the Fenwick Tree. - More...

    + More...

    Collaboration diagram for range_queries::fenwick_tree:
    @@ -117,28 +119,28 @@ Collaboration diagram for range_queries::fenwick_tree:

    Public Member Functions

    template<typename T > - fenwick_tree (const std::vector< T > &arr) + fenwick_tree (const std::vector< T > &arr)  Class Constructor.
      template<typename T > - fenwick_tree (T x) + fenwick_tree (T x)  Class Constructor.
      template<typename T > -void update (T id, T val) +void update (T id, T val)  Updates the value of an element in original array and accordingly updates the values in BIT array.
      template<typename T > -int sum (T id) +int sum (T id)  Returns the sum of elements in range from 0 to ID.
      -int sum_range (int l, int r) +int sum_range (int l, int r)  Returns the prefix sum in range from L to R.
      - +

    Private Member Functions

    int offset (int x)
    int offset (int x)
     Returns the highest power of two which is not more than x.
     
    @@ -148,7 +150,7 @@ Private Attributes size_t  - +
    n = 0
     No. of elements present in input array.
     
    std::vector< int > bit {}
    std::vector< int > bit {}
     Array that represents Binary Indexed Tree.
     
    @@ -169,8 +171,7 @@ template<typename T >
    range_queries::fenwick_tree::fenwick_tree ( - const std::vector< T > &  - arr) + const std::vector< T > & arr) @@ -195,16 +196,16 @@ template<typename T >
    Returns
    void
    -
    50 : n(arr.size()) {
    -
    51 bit.assign(n + 1, 0);
    -
    52 for (int i = 0; i < n; ++i) {
    -
    53 update(i, arr[i]);
    +
    50 : n(arr.size()) {
    +
    51 bit.assign(n + 1, 0);
    +
    52 for (int i = 0; i < n; ++i) {
    +
    53 update(i, arr[i]);
    54 }
    55 }
    std::vector::assign
    T assign(T... args)
    -
    range_queries::fenwick_tree::update
    void update(T id, T val)
    Updates the value of an element in original array and accordingly updates the values in BIT array.
    Definition fenwick_tree.cpp:75
    -
    range_queries::fenwick_tree::bit
    std::vector< int > bit
    Array that represents Binary Indexed Tree.
    Definition fenwick_tree.cpp:34
    -
    range_queries::fenwick_tree::n
    size_t n
    No. of elements present in input array.
    Definition fenwick_tree.cpp:33
    +
    range_queries::fenwick_tree::update
    void update(T id, T val)
    Updates the value of an element in original array and accordingly updates the values in BIT array.
    Definition fenwick_tree.cpp:75
    +
    range_queries::fenwick_tree::bit
    std::vector< int > bit
    Array that represents Binary Indexed Tree.
    Definition fenwick_tree.cpp:34
    +
    range_queries::fenwick_tree::n
    size_t n
    No. of elements present in input array.
    Definition fenwick_tree.cpp:33
    std::vector::size
    T size(T... args)
    Here is the call graph for this function:
    @@ -228,8 +229,7 @@ template<typename T >
    range_queries::fenwick_tree::fenwick_tree ( - T  - x) + T x) @@ -254,7 +254,7 @@ template<typename T >
    Returns
    void
    -
    64: n(x) { bit.assign(n + 1, 0); }
    +
    64: n(x) { bit.assign(n + 1, 0); }
    Here is the call graph for this function:
    @@ -276,8 +276,7 @@ Here is the call graph for this function:
    int range_queries::fenwick_tree::offset ( - int  - x) + int x) @@ -314,8 +313,7 @@ template<typename T >
    int range_queries::fenwick_tree::sum ( - T  - id) + T id) @@ -344,12 +342,12 @@ template<typename T >
    91 id++;
    92 T res = 0;
    93 while (id > 0) {
    -
    94 res += bit[id];
    -
    95 id -= offset(id);
    +
    94 res += bit[id];
    +
    95 id -= offset(id);
    96 }
    97 return res;
    98 }
    -
    range_queries::fenwick_tree::offset
    int offset(int x)
    Returns the highest power of two which is not more than x.
    Definition fenwick_tree.cpp:41
    +
    range_queries::fenwick_tree::offset
    int offset(int x)
    Returns the highest power of two which is not more than x.
    Definition fenwick_tree.cpp:41
    Here is the call graph for this function:
    @@ -370,19 +368,12 @@ Here is the call graph for this function:
    int range_queries::fenwick_tree::sum_range ( - int  - l, + int l, - int  - r  - - - - ) - + int r ) @@ -401,8 +392,8 @@ Here is the call graph for this function:
    Returns
    Sum of elements in range from L to R.
    -
    106{ return sum(r) - sum(l - 1); }
    -
    range_queries::fenwick_tree::sum
    int sum(T id)
    Returns the sum of elements in range from 0 to ID.
    Definition fenwick_tree.cpp:90
    +
    106{ return sum(r) - sum(l - 1); }
    +
    range_queries::fenwick_tree::sum
    int sum(T id)
    Returns the sum of elements in range from 0 to ID.
    Definition fenwick_tree.cpp:90
    Here is the call graph for this function:
    @@ -425,19 +416,12 @@ template<typename T >
    void range_queries::fenwick_tree::update ( - T  - id, + T id, - T  - val  - - - - ) - + T val ) @@ -464,9 +448,9 @@ template<typename T >
    Returns
    void
    75 {
    76 id++;
    -
    77 while (id <= n) {
    -
    78 bit[id] += val;
    -
    79 id += offset(id);
    +
    77 while (id <= n) {
    +
    78 bit[id] += val;
    +
    79 id += offset(id);
    80 }
    81 }
    @@ -512,7 +496,7 @@ Here is the call graph for this function:
    diff --git a/de/d0d/fibonacci__search_8cpp.html b/de/d0d/fibonacci__search_8cpp.html index b6ef56444..6b5a24b3e 100644 --- a/de/d0d/fibonacci__search_8cpp.html +++ b/de/d0d/fibonacci__search_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: search/fibonacci_search.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -118,16 +120,16 @@ Include dependency graph for fibonacci_search.cpp:
    - + - + - + - +

    Functions

    int fibonacci_search (const std::vector< int > &arr, int value)
    int fibonacci_search (const std::vector< int > &arr, int value)
     using fibonacci search algorithm finds an index of a given element in a sorted array
     
    bool no_occurence_tests ()
    bool no_occurence_tests ()
     random tests for checking performance when an array doesn't contain an element
     
    bool random_tests ()
    bool random_tests ()
     random tests which cover cases when we have one, multiple or zero occurences of the value we're looking for
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -143,19 +145,12 @@ Functions int fibonacci_search ( - const std::vector< int > &  - arr, + const std::vector< int > & arr, - int  - value  - - - - ) - + int value )
    @@ -235,20 +230,19 @@ Here is the call graph for this function:
    int main ( - void  - ) + void )

    Main Function testing the algorithm

    123 {
    -
    124 assert(no_occurence_tests());
    -
    125 assert(random_tests());
    +
    124 assert(no_occurence_tests());
    +
    125 assert(random_tests());
    126 return 0;
    127}
    -
    random_tests
    bool random_tests()
    random tests which cover cases when we have one, multiple or zero occurences of the value we're looki...
    Definition fibonacci_search.cpp:96
    -
    no_occurence_tests
    bool no_occurence_tests()
    random tests for checking performance when an array doesn't contain an element
    Definition fibonacci_search.cpp:72
    +
    random_tests
    bool random_tests()
    random tests which cover cases when we have one, multiple or zero occurences of the value we're looki...
    Definition fibonacci_search.cpp:96
    +
    no_occurence_tests
    bool no_occurence_tests()
    random tests for checking performance when an array doesn't contain an element
    Definition fibonacci_search.cpp:72
    Here is the call graph for this function:
    @@ -266,7 +260,7 @@ Here is the call graph for this function:
    bool no_occurence_tests ( - ) + ) @@ -288,7 +282,7 @@ Here is the call graph for this function:
    84 std::remove(arr.begin(), arr.end(), rand_value);
    85 }
    86 sort(arr.begin(), arr.end());
    -
    87 index = fibonacci_search(arr, rand_value);
    +
    87 index = fibonacci_search(arr, rand_value);
    88 passed = passed && (index == -1);
    89 }
    90 return passed;
    @@ -296,7 +290,7 @@ Here is the call graph for this function:
    std::vector::begin
    T begin(T... args)
    std::vector::clear
    T clear(T... args)
    std::vector::end
    T end(T... args)
    -
    fibonacci_search
    int fibonacci_search(const std::vector< int > &arr, int value)
    using fibonacci search algorithm finds an index of a given element in a sorted array
    Definition fibonacci_search.cpp:23
    +
    fibonacci_search
    int fibonacci_search(const std::vector< int > &arr, int value)
    using fibonacci search algorithm finds an index of a given element in a sorted array
    Definition fibonacci_search.cpp:23
    std::find
    T find(T... args)
    std::vector::push_back
    T push_back(T... args)
    std::rand
    T rand(T... args)
    @@ -320,7 +314,7 @@ Here is the call graph for this function: bool random_tests ( - ) + ) @@ -339,7 +333,7 @@ Here is the call graph for this function:
    105 }
    106 rand_value = std::rand() % 1000;
    107 std::sort(arr.begin(), arr.end());
    -
    108 index = fibonacci_search(arr, rand_value);
    +
    108 index = fibonacci_search(arr, rand_value);
    109 if(index != -1){
    110 real_value = arr[index];
    111 passed = passed && (real_value == rand_value);
    @@ -363,7 +357,7 @@ Here is the call graph for this function: diff --git a/de/d1e/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p-members.html b/de/d1e/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p-members.html index 9e02d6c86..f94463fa5 100644 --- a/de/d1e/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p-members.html +++ b/de/d1e/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,7 +116,7 @@ $(document).ready(function(){initNavTree('d6/dc1/classmath_1_1ncr__modulo__p_1_1 diff --git a/de/d23/disjoint__set_8cpp.html b/de/d23/disjoint__set_8cpp.html index 5ea432ec2..1a82f07b6 100644 --- a/de/d23/disjoint__set_8cpp.html +++ b/de/d23/disjoint__set_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/disjoint_set.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,15 +118,15 @@ Include dependency graph for disjoint_set.cpp:
    - + - + - + - + - +

    Functions

    void CreateSet (int n)
    void CreateSet (int n)
     
    int Find (int x)
    int Find (int x)
     
    bool InSameUnion (int x, int y)
    bool InSameUnion (int x, int y)
     
    void Union (int x, int y)
    void Union (int x, int y)
     
    int main ()
    int main ()
     
    - - +

    @@ -150,8 +152,7 @@ Variables

    void CreateSet (int n)int n)
    @@ -182,8 +183,7 @@ Variables int Find ( - int  - x) + int x) @@ -199,9 +199,9 @@ Variables
    54 if (root[x] == x) {
    55 return x;
    56 }
    -
    57 return root[x] = Find(root[x]);
    +
    57 return root[x] = Find(root[x]);
    58}
    -
    Find
    int Find(int x)
    Definition disjoint_set.cpp:53
    +
    Find
    int Find(int x)
    Definition disjoint_set.cpp:53
    Here is the call graph for this function:
    @@ -219,19 +219,12 @@ Here is the call graph for this function:
    bool InSameUnion ( - int  - x, + int x, - int  - y  - - - - ) - + int y )
    @@ -242,7 +235,7 @@ Here is the call graph for this function:
    -
    67{ return Find(x) == Find(y); }
    +
    67{ return Find(x) == Find(y); }
    Here is the call graph for this function:
    @@ -260,8 +253,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -270,7 +262,7 @@ Here is the call graph for this function:
    93 {
    94 // tests CreateSet & Find
    95 int n = 100;
    -
    96 CreateSet(n);
    +
    96 CreateSet(n);
    97 for (int i = 1; i <= 100; ++i) {
    98 if (root[i] != i) {
    99 cout << "Fail" << endl;
    @@ -279,20 +271,20 @@ Here is the call graph for this function:
    102 }
    103 // tests InSameUnion & Union
    104 cout << "1 and 2 are initially not in the same subset" << endl;
    -
    105 if (InSameUnion(1, 2)) {
    +
    105 if (InSameUnion(1, 2)) {
    106 cout << "Fail" << endl;
    107 }
    -
    108 Union(1, 2);
    +
    108 Union(1, 2);
    109 cout << "1 and 2 are now in the same subset" << endl;
    -
    110 if (!InSameUnion(1, 2)) {
    +
    110 if (!InSameUnion(1, 2)) {
    111 cout << "Fail" << endl;
    112 }
    113 return 0;
    114}
    -
    CreateSet
    void CreateSet(int n)
    Definition disjoint_set.cpp:37
    -
    InSameUnion
    bool InSameUnion(int x, int y)
    Definition disjoint_set.cpp:67
    -
    Union
    void Union(int x, int y)
    Definition disjoint_set.cpp:78
    +
    CreateSet
    void CreateSet(int n)
    Definition disjoint_set.cpp:37
    +
    InSameUnion
    bool InSameUnion(int x, int y)
    Definition disjoint_set.cpp:67
    +
    Union
    void Union(int x, int y)
    Definition disjoint_set.cpp:78
    endl
    #define endl
    Definition matrix_exponentiation.cpp:36
    Here is the call graph for this function:
    @@ -311,19 +303,12 @@ Here is the call graph for this function: void Union ( - int  - x, + int x, - int  - y  - - - - ) - + int y )
    @@ -335,7 +320,7 @@ Here is the call graph for this function:
    78 {
    -
    79 int a = Find(x), b = Find(y);
    +
    79 int a = Find(x), b = Find(y);
    80 if (a != b) {
    81 if (rank[a] < rank[b]) {
    82 root[a] = b;
    @@ -361,7 +346,7 @@ Here is the call graph for this function:
    diff --git a/de/d33/circular__linked__list_8cpp.html b/de/d33/circular__linked__list_8cpp.html index c65f9e5d8..8dec62102 100644 --- a/de/d33/circular__linked__list_8cpp.html +++ b/de/d33/circular__linked__list_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: operations_on_datastructures/circular_linked_list.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -154,10 +156,10 @@ Functions void tests::test5 ()  A Test to check a shift of zero.
      -static void test () +static void test ()  Function to test the correctness of the Circular Linked List.
      -int main () +int main ()  main function
      @@ -174,8 +176,7 @@ Functions int main ( - void  - ) + void ) @@ -184,10 +185,10 @@ Functions

    main function

    Returns
    0 on exit
    345 {
    -
    346 test(); // run self-test implementations
    +
    346 test(); // run self-test implementations
    347 return 0;
    348}
    -
    test
    static void test()
    Function to test the correctness of the Circular Linked List.
    Definition circular_linked_list.cpp:333
    +
    test
    static void test()
    Function to test the correctness of the Circular Linked List.
    Definition circular_linked_list.cpp:333
    Here is the call graph for this function:
    @@ -208,7 +209,7 @@ Here is the call graph for this function:
    static void test ( - ) + ) @@ -247,7 +248,7 @@ Here is the call graph for this function:
    diff --git a/de/d36/classdata__structures_1_1_bloom_filter-members.html b/de/d36/classdata__structures_1_1_bloom_filter-members.html index eb5ef2c3a..242c36d59 100644 --- a/de/d36/classdata__structures_1_1_bloom_filter-members.html +++ b/de/d36/classdata__structures_1_1_bloom_filter-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,7 +115,7 @@ $(document).ready(function(){initNavTree('dc/dd4/classdata__structures_1_1_bloom diff --git a/de/d36/namespacen__bonacci.html b/de/d36/namespacen__bonacci.html index a6e1cf1fb..d59f8648d 100644 --- a/de/d36/namespacen__bonacci.html +++ b/de/d36/namespacen__bonacci.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: n_bonacci Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('de/d36/namespacen__bonacci.html','../.

    Functions for the N-bonacci implementation. -More...

    +More...

    Detailed Description

    Functions for the N-bonacci implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('de/d36/namespacen__bonacci.html','../. diff --git a/de/d41/namespacekaratsuba__algorithm.html b/de/d41/namespacekaratsuba__algorithm.html index 670a4abe7..eacd646ff 100644 --- a/de/d41/namespacekaratsuba__algorithm.html +++ b/de/d41/namespacekaratsuba__algorithm.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: karatsuba_algorithm Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('de/d41/namespacekaratsuba__algorithm.h

    Functions for the Karatsuba algorithm for fast multiplication implementation. -More...

    +More...

    Detailed Description

    Functions for the Karatsuba algorithm for fast multiplication implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('de/d41/namespacekaratsuba__algorithm.h diff --git a/de/d47/string__fibonacci_8cpp.html b/de/d47/string__fibonacci_8cpp.html index c2d33e33a..11c911c25 100644 --- a/de/d47/string__fibonacci_8cpp.html +++ b/de/d47/string__fibonacci_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/string_fibonacci.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,11 +117,11 @@ Include dependency graph for string_fibonacci.cpp:
    - + - + - +

    Functions

    std::string add (std::string a, std::string b)
    std::string add (std::string a, std::string b)
     
    void fib_Accurate (uint64_t n)
    void fib_Accurate (uint64_t n)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -136,19 +138,12 @@ Functions std::string add ( - std::string  - a, + std::string a, - std::string  - b  - - - - ) - + std::string b )
    @@ -220,8 +215,7 @@ Here is the call graph for this function:
    void fib_Accurate ( - uint64_t  - n) + uint64_t n) @@ -237,14 +231,14 @@ Here is the call graph for this function:
    70 std::string fibMinus1 = "1";
    71 std::string fibMinus2 = "0";
    72 for (uint64_t i = 0; i < n; i++) {
    -
    73 tmp = add(fibMinus1, fibMinus2);
    +
    73 tmp = add(fibMinus1, fibMinus2);
    74 fibMinus2 = fibMinus1;
    75 fibMinus1 = tmp;
    76 }
    77 std::cout << fibMinus2;
    78}
    -
    add
    std::string add(std::string a, std::string b)
    Definition string_fibonacci.cpp:24
    +
    add
    std::string add(std::string a, std::string b)
    Definition string_fibonacci.cpp:24
    Here is the call graph for this function:
    @@ -262,8 +256,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -274,12 +267,12 @@ Here is the call graph for this function:
    83 std::cout << "Enter whatever number N you want to find the fibonacci of\n";
    84 std::cin >> n;
    85 std::cout << n << " th Fibonacci is \n";
    -
    86 fib_Accurate(n);
    +
    86 fib_Accurate(n);
    87
    88 return 0;
    89}
    -
    fib_Accurate
    void fib_Accurate(uint64_t n)
    Definition string_fibonacci.cpp:68
    +
    fib_Accurate
    void fib_Accurate(uint64_t n)
    Definition string_fibonacci.cpp:68
    Here is the call graph for this function:
    @@ -294,7 +287,7 @@ Here is the call graph for this function:
    diff --git a/de/d48/struct_trie_1_1_trie_node.html b/de/d48/struct_trie_1_1_trie_node.html index ceab4366e..92e4f94c8 100644 --- a/de/d48/struct_trie_1_1_trie_node.html +++ b/de/d48/struct_trie_1_1_trie_node.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Trie::TrieNode Struct Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -111,9 +113,9 @@ Collaboration diagram for Trie::TrieNode:
    - + - +

    Public Attributes

    std::shared_ptr< TrieNode > character [ALPHABETS] {nullptr}
    std::shared_ptr< TrieNode > character [ALPHABETS] {nullptr}
     
    bool isEndOfWord {false}
    bool isEndOfWord {false}
     

    Detailed Description

    @@ -158,7 +160,7 @@ Public Attributes diff --git a/de/d4a/class_compare.html b/de/d4a/class_compare.html index 5d9d5763e..e0f34ad16 100644 --- a/de/d4a/class_compare.html +++ b/de/d4a/class_compare.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Compare< S, T, E > Class Template Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -105,12 +107,12 @@ $(document).ready(function(){initNavTree('de/d4a/class_compare.html','../../');

    Comparator class for priority queue. - More...

    + More...

    - - + +

    Public Member Functions

    bool operator() (tuple< S, T, E, double, double, double > &t1, tuple< S, T, E, double, double, double > &t2)
     A comparator function that checks whether to swap the two tuples or not. to https://www.geeksforgeeks.org/comparator-class-in-c-with-examples/ for detailed description of comparator.
    bool operator() (tuple< S, T, E, double, double, double > &t1, tuple< S, T, E, double, double, double > &t2)
     A comparator function that checks whether to swap the two tuples or not. to https://www.geeksforgeeks.org/comparator-class-in-c-with-examples/ for detailed description of comparator.
     

    Detailed Description

    @@ -139,19 +141,12 @@ template<typename S , typename T , typename E >
    bool Compare< S, T, E >::operator() ( - tuple< S, T, E, double, double, double > &  - t1, + tuple< S, T, E, double, double, double > & t1, - tuple< S, T, E, double, double, double > &  - t2  - - - - ) - + tuple< S, T, E, double, double, double > & t2 ) @@ -161,7 +156,7 @@ template<typename S , typename T , typename E >
    -

    A comparator function that checks whether to swap the two tuples or not. to https://www.geeksforgeeks.org/comparator-class-in-c-with-examples/ for detailed description of comparator.

    +

    A comparator function that checks whether to swap the two tuples or not. to https://www.geeksforgeeks.org/comparator-class-in-c-with-examples/ for detailed description of comparator.

    Parameters
    @@ -195,7 +190,7 @@ false if the tuples SHOULDN'T be swapped diff --git a/de/d6a/knuth__morris__pratt_8cpp.html b/de/d6a/knuth__morris__pratt_8cpp.html index 69adf0dfa..2379c48ff 100644 --- a/de/d6a/knuth__morris__pratt_8cpp.html +++ b/de/d6a/knuth__morris__pratt_8cpp.html @@ -3,16 +3,18 @@ - +Algorithms_in_C++: strings/knuth_morris_pratt.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    t1First tuple
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,7 +129,7 @@ Functions   bool string_search::kmp (const std::string &pattern, const std::string &text)   -int main () +int main ()  

    Detailed Description

    @@ -146,8 +148,7 @@ Functions int main ( - void  - ) + void ) @@ -157,7 +158,7 @@ Functions
    77 std::string text = "alskfjaldsabc1abc1abc12k23adsfabcabc";
    78 std::string pattern = "abc1abc12l";
    79
    -
    80 if (kmp(pattern, text) == true) {
    +
    80 if (kmp(pattern, text) == true) {
    81 std::cout << "Found" << std::endl;
    82 } else {
    83 std::cout << "Not Found" << std::endl;
    @@ -165,7 +166,7 @@ Functions
    85
    86 text = "abcabc";
    87 pattern = "bca";
    -
    88 if (kmp(pattern, text) == true) {
    +
    88 if (kmp(pattern, text) == true) {
    89 std::cout << "Found" << std::endl;
    90 } else {
    91 std::cout << "Not Found" << std::endl;
    @@ -176,7 +177,6 @@ Functions
    std::endl
    T endl(T... args)
    -
    string_search::kmp
    bool kmp(const std::string &pattern, const std::string &text)
    Definition knuth_morris_pratt.cpp:56
    Here is the call graph for this function:
    @@ -191,7 +191,7 @@ Here is the call graph for this function:
    diff --git a/de/d6b/namespacerandom__pivot__quick__sort.html b/de/d6b/namespacerandom__pivot__quick__sort.html index 5775cb6e7..e3041b0a9 100644 --- a/de/d6b/namespacerandom__pivot__quick__sort.html +++ b/de/d6b/namespacerandom__pivot__quick__sort.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: random_pivot_quick_sort Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('de/d6b/namespacerandom__pivot__quick__

    Functions for the Random Pivot Quick Sort implementation. -More...

    +More...

    Detailed Description

    Functions for the Random Pivot Quick Sort implementation.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('de/d6b/namespacerandom__pivot__quick__ diff --git a/de/d72/geometric__dist_8cpp.html b/de/d72/geometric__dist_8cpp.html index 4a65ddfb2..ae064e8b3 100644 --- a/de/d72/geometric__dist_8cpp.html +++ b/de/d72/geometric__dist_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: probability/geometric_dist.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -138,16 +140,16 @@ Namespaces - + - + - + - +

    Functions

    float probability::geometric_dist::generate_uniform ()
    float probability::geometric_dist::generate_uniform ()
     Returns a random number between [0,1].
     
    void sample_test (const probability::geometric_dist::geometric_distribution &dist)
    void sample_test (const probability::geometric_dist::geometric_distribution &dist)
     Tests the sampling method of the geometric distribution.
     
    static void test ()
    static void test ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -166,7 +168,7 @@ Functions float probability::geometric_dist::generate_uniform ( - ) + ) @@ -175,9 +177,8 @@ Functions

    Returns a random number between [0,1].

    Returns
    A uniformly distributed random number between 0 (included) and 1 (included)
    48 {
    -
    49 return static_cast<float>(rand()) / static_cast<float>(RAND_MAX);
    +
    49 return static_cast<float>(rand()) / static_cast<float>(RAND_MAX);
    50}
    -
    std::rand
    T rand(T... args)
    Here is the call graph for this function:
    @@ -195,8 +196,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -205,12 +205,11 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    256 {
    -
    257 srand(time(nullptr));
    -
    258 test(); // run self-test implementations
    +
    257 srand(time(nullptr));
    +
    258 test(); // run self-test implementations
    259 return 0;
    260}
    -
    test
    static void test()
    Self-test implementations.
    Definition geometric_dist.cpp:197
    -
    std::srand
    T srand(T... args)
    +
    test
    static void test()
    Self-test implementations.
    Definition geometric_dist.cpp:197
    std::time
    T time(T... args)
    Here is the call graph for this function:
    @@ -229,8 +228,7 @@ Here is the call graph for this function: void sample_test ( - const probability::geometric_dist::geometric_distribution &  - dist) + const probability::geometric_dist::geometric_distribution & dist) @@ -296,7 +294,7 @@ Here is the call graph for this function: static void test ( - ) + ) @@ -327,7 +325,7 @@ Here is the call graph for this function:
    212 assert(std::abs(dist.range_tries(3) - 0.49f) < threshold);
    213 assert(std::abs(dist.range_tries(5, 11) - 0.2203267f) < threshold);
    214 std::cout << "All tests passed" << std::endl;
    -
    215 sample_test(dist);
    +
    215 sample_test(dist);
    216
    217 dist = probability::geometric_dist::geometric_distribution(0.5f);
    218
    @@ -344,7 +342,7 @@ Here is the call graph for this function:
    229 assert(std::abs(dist.range_tries(3) - 0.25f) < threshold);
    230 assert(std::abs(dist.range_tries(5, 11) - 0.062011f) < threshold);
    231 std::cout << "All tests passed" << std::endl;
    -
    232 sample_test(dist);
    +
    232 sample_test(dist);
    233
    234 dist = probability::geometric_dist::geometric_distribution(0.8f);
    235
    @@ -361,10 +359,10 @@ Here is the call graph for this function:
    246 assert(std::abs(dist.range_tries(3) - 0.04f) < threshold);
    247 assert(std::abs(dist.range_tries(5, 11) - 0.00159997f) < threshold);
    248 std::cout << "All tests have successfully passed!" << std::endl;
    -
    249 sample_test(dist);
    +
    249 sample_test(dist);
    250}
    probability::geometric_dist::geometric_distribution
    A class to model the geometric distribution.
    Definition geometric_dist.cpp:55
    -
    sample_test
    void sample_test(const probability::geometric_dist::geometric_distribution &dist)
    Tests the sampling method of the geometric distribution.
    Definition geometric_dist.cpp:165
    +
    sample_test
    void sample_test(const probability::geometric_dist::geometric_distribution &dist)
    Tests the sampling method of the geometric distribution.
    Definition geometric_dist.cpp:165
    Here is the call graph for this function:
    @@ -379,7 +377,7 @@ Here is the call graph for this function:
    diff --git a/de/d75/qr__eigen__values_8cpp.html b/de/d75/qr__eigen__values_8cpp.html index b0d455e9e..688bbc79d 100644 --- a/de/d75/qr__eigen__values_8cpp.html +++ b/de/d75/qr__eigen__values_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods/qr_eigen_values.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,22 +129,22 @@ Namespaces - +

    Macros

    #define LIMS   9
    #define LIMS   9
     
    - + - + - + - + - +

    Functions

    void create_matrix (std::valarray< std::valarray< double > > *A)
    void create_matrix (std::valarray< std::valarray< double > > *A)
     
    void mat_mul (const std::valarray< std::valarray< double > > &A, const std::valarray< std::valarray< double > > &B, std::valarray< std::valarray< double > > *OUT)
    void mat_mul (const std::valarray< std::valarray< double > > &A, const std::valarray< std::valarray< double > > &B, std::valarray< std::valarray< double > > *OUT)
     
    std::valarray< double > qr_algorithm::eigen_values (std::valarray< std::valarray< double > > *A, bool print_intermediates=false)
     
    void test1 ()
    void test1 ()
     
    void test2 ()
    void test2 ()
     
    int main (int argc, char **argv)
    int main (int argc, char **argv)
     

    Detailed Description

    @@ -174,8 +176,7 @@ Functions void create_matrix ( - std::valarray< std::valarray< double > > *  - A) + std::valarray< std::valarray< double > > * A) @@ -188,23 +189,23 @@ Functions
    28 {
    -
    29 int i, j, tmp, lim2 = LIMS >> 1;
    +
    29 int i, j, tmp, lim2 = LIMS >> 1;
    30 int N = A->size();
    31
    32#ifdef _OPENMP
    33#pragma omp for
    34#endif
    35 for (i = 0; i < N; i++) {
    -
    36 A[0][i][i] = (std::rand() % LIMS) - lim2;
    +
    36 A[0][i][i] = (std::rand() % LIMS) - lim2;
    37 for (j = i + 1; j < N; j++) {
    -
    38 tmp = (std::rand() % LIMS) - lim2;
    +
    38 tmp = (std::rand() % LIMS) - lim2;
    39 A[0][i][j] = tmp; // summetrically distribute random values
    40 A[0][j][i] = tmp;
    41 }
    42 }
    43}
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:47
    -
    LIMS
    #define LIMS
    Definition qr_eigen_values.cpp:20
    +
    LIMS
    #define LIMS
    Definition qr_eigen_values.cpp:20
    std::rand
    T rand(T... args)
    Here is the call graph for this function:
    @@ -223,19 +224,12 @@ Here is the call graph for this function:
    int main ( - int  - argc, + int argc, - char **  - argv  - - - - ) - + char ** argv )
    @@ -245,8 +239,8 @@ Here is the call graph for this function:
    245 if (argc == 2) {
    246 mat_size = atoi(argv[1]);
    247 } else { // if invalid input argument is given run tests
    -
    248 test1();
    -
    249 test2();
    +
    248 test1();
    +
    249 test2();
    250 std::cout << "Usage: ./qr_eigen_values [mat_size]\n";
    251 return 0;
    252 }
    @@ -268,7 +262,7 @@ Here is the call graph for this function:
    268 }
    269
    270 /* create a random matrix */
    -
    271 create_matrix(&A);
    +
    271 create_matrix(&A);
    272
    273 std::cout << A << "\n";
    274
    @@ -288,9 +282,9 @@ Here is the call graph for this function:
    std::fprintf
    T fprintf(T... args)
    mat_size
    ll mat_size
    Definition matrix_exponentiation.cpp:45
    qr_algorithm::eigen_values
    std::valarray< double > eigen_values(std::valarray< std::valarray< double > > *A, bool print_intermediates=false)
    Definition qr_eigen_values.cpp:98
    -
    test2
    void test2()
    Definition qr_eigen_values.cpp:210
    -
    test1
    void test1()
    Definition qr_eigen_values.cpp:177
    -
    create_matrix
    void create_matrix(std::valarray< std::valarray< double > > *A)
    Definition qr_eigen_values.cpp:28
    +
    test2
    void test2()
    Definition qr_eigen_values.cpp:210
    +
    test1
    void test1()
    Definition qr_eigen_values.cpp:177
    +
    create_matrix
    void create_matrix(std::valarray< std::valarray< double > > *A)
    Definition qr_eigen_values.cpp:28
    std::srand
    T srand(T... args)
    std::time
    T time(T... args)
    @@ -311,25 +305,17 @@ Here is the call graph for this function: void mat_mul ( - const std::valarray< std::valarray< double > > &  - A, + const std::valarray< std::valarray< double > > & A, - const std::valarray< std::valarray< double > > &  - B, + const std::valarray< std::valarray< double > > & B, - std::valarray< std::valarray< double > > *  - OUT  - - - - ) - + std::valarray< std::valarray< double > > * OUT )
    @@ -379,7 +365,7 @@ Here is the call graph for this function:
    void test1 ( - ) + ) @@ -417,7 +403,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -431,7 +417,7 @@ Here is the call graph for this function: void test2 ( - ) + ) @@ -478,7 +464,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -489,7 +475,7 @@ Here is the call graph for this function: diff --git a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map index 9b914112a..e5e6fa92d 100644 --- a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map +++ b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map @@ -1,21 +1,20 @@ - - - - - + + + + + - - - - - - - - - - - - - + + + + + + + + + + + + diff --git a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 index 0fbd89994..15a0ec6ab 100644 --- a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 +++ b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 @@ -1 +1 @@ -9f940a68fa5de41ac287b0b159fc133e \ No newline at end of file +f59cea11e5cbb6d520cc654b2095871e \ No newline at end of file diff --git a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg index 5b6c6d3ec..c9e8dd870 100644 --- a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg +++ b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg @@ -4,7 +4,7 @@ - + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + FCFS< S, T, E > Node1 - -FCFS< S, T, E > + +FCFS< S, T, E > @@ -67,13 +31,13 @@ var sectionId = 'dynsection-0'; Node2 - -std::priority_queue -< std::tuple< S, T, - E, double, double, double - >, std::vector< std::tuple -< S, T, E, double, double, - double > >, Compare< S, T, E > > + +std::priority_queue +< std::tuple< S, T, + E, double, double, double + >, std::vector< std::tuple +< S, T, E, double, double, + double > >, Compare< S, T, E > > @@ -81,19 +45,18 @@ var sectionId = 'dynsection-0'; Node2->Node1 - - + + - schedule + schedule Node3 - - -std::tuple< S, T, E, - double, double, double > + + +T @@ -101,20 +64,20 @@ var sectionId = 'dynsection-0'; Node3->Node2 - - + + - elements + elements Node4 - -std::vector< std::tuple -< S, T, E, double, double, - double > > + +std::vector< std::tuple +< S, T, E, double, double, + double > > @@ -122,28 +85,28 @@ var sectionId = 'dynsection-0'; Node3->Node4 - - + + - elements + elements Node4->Node1 - - + + - result + result Node5 - -std::unordered_set< S > + +std::unordered_set< S > @@ -151,35 +114,14 @@ var sectionId = 'dynsection-0'; Node5->Node1 - - + + - idList + idList - - - - - - - - - - - - - - - - - - - + Algorithms_in_C++: numerical_methods/successive_approximation.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,11 +117,11 @@ Include dependency graph for successive_approximation.cpp:
    - + - + - +

    Functions

    static float eq (float y)
    static float eq (float y)
     
    static float eqd (float y)
    static float eqd (float y)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -137,8 +139,7 @@ Functions static float eq ( - float  - y) + float y) @@ -168,8 +169,7 @@ Functions static float eqd ( - float  - y) + float y) @@ -195,8 +195,7 @@ Functions int main ( - void  - ) + void ) @@ -207,7 +206,7 @@ Functions
    22 int i, n;
    23
    24 for (i = 0; i < 10; i++) {
    -
    25 sum = eq(y);
    +
    25 sum = eq(y);
    26 std::cout << "value of equation at " << i << " " << sum << "\n";
    27 y++;
    28 }
    @@ -217,7 +216,7 @@ Functions
    32 std::cin >> n;
    33
    34 for (i = 0; i <= n; i++) {
    -
    35 x2 = eqd(x1);
    +
    35 x2 = eqd(x1);
    36 std::cout << "\nenter the x2->" << x2;
    37 x1 = x2;
    38 }
    @@ -226,8 +225,8 @@ Functions
    machine_learning::sum
    T sum(const std::vector< std::valarray< T > > &A)
    Definition vector_ops.hpp:232
    -
    eq
    static float eq(float y)
    Definition successive_approximation.cpp:12
    -
    eqd
    static float eqd(float y)
    Definition successive_approximation.cpp:17
    +
    eq
    static float eq(float y)
    Definition successive_approximation.cpp:12
    +
    eqd
    static float eqd(float y)
    Definition successive_approximation.cpp:17
    Here is the call graph for this function:
    @@ -242,7 +241,7 @@ Here is the call graph for this function:
    diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp.html b/df/dcb/greedy__algorithms_2dijkstra_8cpp.html index 96540057c..7734f1bad 100644 --- a/df/dcb/greedy__algorithms_2dijkstra_8cpp.html +++ b/df/dcb/greedy__algorithms_2dijkstra_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: greedy_algorithms/dijkstra.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -131,19 +133,19 @@ Namespaces - + - + - + - + - +

    Functions

    int greedy_algorithms::dijkstra::minimum_distance (std::vector< int > mdist, std::vector< bool > vset, int V)
    int greedy_algorithms::dijkstra::minimum_distance (std::vector< int > mdist, std::vector< bool > vset, int V)
     Utility function that finds the vertex with the minimum distance in mdist.
     
    void greedy_algorithms::dijkstra::print (std::vector< int > dist, int V)
    void greedy_algorithms::dijkstra::print (std::vector< int > dist, int V)
     Utility function to print the distances to vertices.
     
    void greedy_algorithms::dijkstra::dijkstra (Graph graph, int src)
    void greedy_algorithms::dijkstra::dijkstra (Graph graph, int src)
     The main function that finds the shortest path from a given source to all other vertices using Dijkstra's Algorithm.
     
    static void tests ()
    static void tests ()
     Self-test implementations.
     
    int main ()
    int main ()
     Main function.
     
    @@ -164,19 +166,12 @@ Functions void greedy_algorithms::dijkstra::dijkstra ( - Graph  - graph, + Graph graph, - int  - src  - - - - ) - + int src )
    @@ -206,7 +201,7 @@ Functions
    136
    137 // iterate to find the shortest path
    138 for (int count = 0; count < V - 1; count++) {
    -
    139 int u = minimum_distance(mdist, vset, V);
    +
    139 int u = minimum_distance(mdist, vset, V);
    140
    141 vset[u] = true;
    142
    @@ -220,7 +215,7 @@ Functions
    150
    151 print(mdist, V);
    152}
    -
    greedy_algorithms::dijkstra::minimum_distance
    int minimum_distance(std::vector< int > mdist, std::vector< bool > vset, int V)
    Utility function that finds the vertex with the minimum distance in mdist.
    Definition dijkstra.cpp:82
    +
    greedy_algorithms::dijkstra::minimum_distance
    int minimum_distance(std::vector< int > mdist, std::vector< bool > vset, int V)
    Utility function that finds the vertex with the minimum distance in mdist.
    Definition dijkstra.cpp:82
    graph
    Graph Algorithms.
    @@ -240,8 +235,7 @@ Here is the call graph for this function:
    int main ( - void  - ) + void ) @@ -271,25 +265,17 @@ Here is the call graph for this function: int greedy_algorithms::dijkstra::minimum_distance ( - std::vector< int >  - mdist, + std::vector< int > mdist, - std::vector< bool >  - vset, + std::vector< bool > vset, - int  - V  - - - - ) - + int V )
    @@ -332,19 +318,12 @@ Here is the call graph for this function:
    void greedy_algorithms::dijkstra::print ( - std::vector< int >  - dist, + std::vector< int > dist, - int  - V  - - - - ) - + int V )
    @@ -386,7 +365,7 @@ Here is the call graph for this function:
    static void tests ( - ) + ) @@ -443,7 +422,7 @@ Here is the call graph for this function: diff --git a/df/dcb/namespacestrings.html b/df/dcb/namespacestrings.html index 832f58bc3..d4ccbecf3 100644 --- a/df/dcb/namespacestrings.html +++ b/df/dcb/namespacestrings.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: strings Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('df/dcb/namespacestrings.html','../../'

    Algorithms with strings. -More...

    +More...

    Detailed Description

    Algorithms with strings.

    for std::vector STL

    @@ -114,7 +116,7 @@ $(document).ready(function(){initNavTree('df/dcb/namespacestrings.html','../../' diff --git a/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html b/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html index 3c8fa9c79..14d3bf2ad 100644 --- a/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html +++ b/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -310,7 +312,7 @@ $(document).ready(function(){initNavTree('df/dcd/_2_users_2runner_2work_2_c-_plu diff --git a/df/dce/namespacegraph.html b/df/dce/namespacegraph.html index 8fe7cb601..bb22f152c 100644 --- a/df/dce/namespacegraph.html +++ b/df/dce/namespacegraph.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -105,7 +107,7 @@ $(document).ready(function(){initNavTree('df/dce/namespacegraph.html','../../');

    Graph Algorithms. -More...

    +More...

    @@ -121,37 +123,37 @@ Classes

    Classes

    - + - + - + - + - + - + - + - + - + - + - +

    Functions

    void addEdge (std::vector< std::vector< int > > *adj, int u, int v)
    void addEdge (std::vector< std::vector< int > > *adj, int u, int v)
     Function that add edge between two nodes or vertices of graph.
     
    void explore (const std::vector< std::vector< int > > *adj, int u, std::vector< bool > *visited)
    void explore (const std::vector< std::vector< int > > *adj, int u, std::vector< bool > *visited)
     Utility function for depth first seach algorithm this function explores the vertex which is passed into.
     
    int getConnectedComponents (const std::vector< std::vector< int > > *adj)
    int getConnectedComponents (const std::vector< std::vector< int > > *adj)
     Function that perfoms depth first search algorithm on graph and calculated the number of connected components.
     
    void addEdge (std::vector< std::vector< size_t > > *adj, size_t u, size_t v)
    void addEdge (std::vector< std::vector< size_t > > *adj, size_t u, size_t v)
     Adds and edge between two vertices of graph say u and v in this case.
     
    void explore (const std::vector< std::vector< size_t > > &adj, size_t v, std::vector< bool > *visited)
    void explore (const std::vector< std::vector< size_t > > &adj, size_t v, std::vector< bool > *visited)
     Explores the given vertex, exploring a vertex means traversing over all the vertices which are connected to the vertex that is currently being explored.
     
    void depth_first_search (const std::vector< std::vector< size_t > > &adj, size_t start)
    void depth_first_search (const std::vector< std::vector< size_t > > &adj, size_t start)
     initiates depth first search algorithm.
     
    void addEdge (std::vector< std::vector< std::pair< int, int > > > *adj, int u, int v, int w)
    void addEdge (std::vector< std::vector< std::pair< int, int > > > *adj, int u, int v, int w)
     Function that add edge between two nodes or vertices of graph.
     
    int dijkstra (std::vector< std::vector< std::pair< int, int > > > *adj, int s, int t)
    int dijkstra (std::vector< std::vector< std::pair< int, int > > > *adj, int s, int t)
     Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and returns the shortest distance of target from the source.
     
    bool checkBipartite (const std::vector< std::vector< int64_t > > &graph, int64_t index, std::vector< int64_t > *visited)
    bool checkBipartite (const std::vector< std::vector< int64_t > > &graph, int64_t index, std::vector< int64_t > *visited)
     function to check whether the passed graph is bipartite or not
     
    bool isBipartite (const std::vector< std::vector< int64_t > > &graph)
    bool isBipartite (const std::vector< std::vector< int64_t > > &graph)
     returns true if the given graph is bipartite else returns false
     
    int TravellingSalesmanProblem (std::vector< std::vector< uint32_t > > *cities, int32_t src, uint32_t V)
    int TravellingSalesmanProblem (std::vector< std::vector< uint32_t > > *cities, int32_t src, uint32_t V)
     Function calculates the minimum path distance that will cover all the cities starting from the source.
     
    @@ -176,25 +178,17 @@ Functions void graph::addEdge ( - std::vector< std::vector< int > > *  - adj, + std::vector< std::vector< int > > * adj, - int  - u, + int u, - int  - v  - - - - ) - + int v )
    @@ -224,25 +218,17 @@ Functions void graph::addEdge ( - std::vector< std::vector< size_t > > *  - adj, + std::vector< std::vector< size_t > > * adj, - size_t  - u, + size_t u, - size_t  - v  - - - - ) - + size_t v )
    @@ -279,31 +265,22 @@ Functions void graph::addEdge ( - std::vector< std::vector< std::pair< int, int > > > *  - adj, + std::vector< std::vector< std::pair< int, int > > > * adj, - int  - u, + int u, - int  - v, + int v, - int  - w  - - - - ) - + int w )
    @@ -338,25 +315,17 @@ Here is the call graph for this function:
    bool graph::checkBipartite ( - const std::vector< std::vector< int64_t > > &  - graph, + const std::vector< std::vector< int64_t > > & graph, - int64_t  - index, + int64_t index, - std::vector< int64_t > *  - visited  - - - - ) - + std::vector< int64_t > * visited )
    @@ -426,19 +395,12 @@ Here is the call graph for this function:
    void graph::depth_first_search ( - const std::vector< std::vector< size_t > > &  - adj, + const std::vector< std::vector< size_t > > & adj, - size_t  - start  - - - - ) - + size_t start )
    @@ -455,9 +417,9 @@ Here is the call graph for this function:
    101 size_t vertices = adj.size();
    102
    103 std::vector<bool> visited(vertices, false);
    -
    104 explore(adj, start, &visited);
    +
    104 explore(adj, start, &visited);
    105}
    -
    graph::explore
    void explore(const std::vector< std::vector< int > > *adj, int u, std::vector< bool > *visited)
    Utility function for depth first seach algorithm this function explores the vertex which is passed in...
    Definition connected_components.cpp:59
    +
    graph::explore
    void explore(const std::vector< std::vector< int > > *adj, int u, std::vector< bool > *visited)
    Utility function for depth first seach algorithm this function explores the vertex which is passed in...
    Definition connected_components.cpp:59
    std::vector::size
    T size(T... args)
    @@ -477,25 +439,17 @@ Here is the call graph for this function:
    int graph::dijkstra ( - std::vector< std::vector< std::pair< int, int > > > *  - adj, + std::vector< std::vector< std::pair< int, int > > > * adj, - int  - s, + int s, - int  - t  - - - - ) - + int t )
    @@ -587,25 +541,17 @@ Here is the call graph for this function:
    void graph::explore ( - const std::vector< std::vector< int > > *  - adj, + const std::vector< std::vector< int > > * adj, - int  - u, + int u, - std::vector< bool > *  - visited  - - - - ) - + std::vector< bool > * visited )
    @@ -623,7 +569,7 @@ Here is the call graph for this function:
    61 (*visited)[u] = true;
    62 for (auto v : (*adj)[u]) {
    63 if (!(*visited)[v]) {
    -
    64 explore(adj, v, visited);
    +
    64 explore(adj, v, visited);
    65 }
    66 }
    67}
    @@ -644,25 +590,17 @@ Here is the call graph for this function: void graph::explore ( - const std::vector< std::vector< size_t > > &  - adj, + const std::vector< std::vector< size_t > > & adj, - size_t  - v, + size_t v, - std::vector< bool > *  - visited  - - - - ) - + std::vector< bool > * visited )
    @@ -681,7 +619,7 @@ Here is the call graph for this function:
    83 (*visited)[v] = true;
    84 for (auto x : adj[v]) {
    85 if (!(*visited)[x]) {
    -
    86 explore(adj, x, visited);
    +
    86 explore(adj, x, visited);
    87 }
    88 }
    89}
    @@ -703,8 +641,7 @@ Here is the call graph for this function: int graph::getConnectedComponents ( - const std::vector< std::vector< int > > *  - adj) + const std::vector< std::vector< int > > * adj) @@ -725,7 +662,7 @@ Here is the call graph for this function:
    81
    82 for (int i = 0; i < n; i++) {
    83 if (!visited[i]) {
    -
    84 explore(adj, i, &visited);
    +
    84 explore(adj, i, &visited);
    85 connected_components++;
    86 }
    87 }
    @@ -748,8 +685,7 @@ Here is the call graph for this function: bool graph::isBipartite ( - const std::vector< std::vector< int64_t > > &  - graph) + const std::vector< std::vector< int64_t > > & graph) @@ -776,14 +712,14 @@ Here is the call graph for this function:
    83 /// whether the sub-graph of that node is a bipartite
    84 /// or not
    85 {
    -
    86 if (!checkBipartite(graph, i, &visited)) {
    +
    86 if (!checkBipartite(graph, i, &visited)) {
    87 return false;
    88 }
    89 }
    90 }
    91 return true;
    92}
    -
    graph::checkBipartite
    bool checkBipartite(const std::vector< std::vector< int64_t > > &graph, int64_t index, std::vector< int64_t > *visited)
    function to check whether the passed graph is bipartite or not
    Definition is_graph_bipartite2.cpp:36
    +
    graph::checkBipartite
    bool checkBipartite(const std::vector< std::vector< int64_t > > &graph, int64_t index, std::vector< int64_t > *visited)
    function to check whether the passed graph is bipartite or not
    Definition is_graph_bipartite2.cpp:36
    Here is the call graph for this function:
    @@ -801,25 +737,17 @@ Here is the call graph for this function:
    int graph::TravellingSalesmanProblem ( - std::vector< std::vector< uint32_t > > *  - cities, + std::vector< std::vector< uint32_t > > * cities, - int32_t  - src, + int32_t src, - uint32_t  - V  - - - - ) - + uint32_t V )
    @@ -883,7 +811,7 @@ Here is the call graph for this function:
    diff --git a/df/dd0/queue__using__two__stacks_8cpp.html b/df/dd0/queue__using__two__stacks_8cpp.html index 48ed34642..be80b3651 100644 --- a/df/dd0/queue__using__two__stacks_8cpp.html +++ b/df/dd0/queue__using__two__stacks_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/queue_using_two_stacks.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,9 +115,9 @@ Include dependency graph for queue_using_two_stacks.cpp:
    - + - +

    Functions

    void queue_test ()
    void queue_test ()
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -131,18 +133,17 @@ Functions int main ( - void  - ) + void )

    Main function, calls testing function

    141 {
    -
    142 queue_test();
    +
    142 queue_test();
    143 return 0;
    144}
    -
    queue_test
    void queue_test()
    Definition queue_using_two_stacks.cpp:101
    +
    queue_test
    void queue_test()
    Definition queue_using_two_stacks.cpp:101
    Here is the call graph for this function:
    @@ -160,7 +161,7 @@ Here is the call graph for this function:
    void queue_test ( - ) + ) @@ -212,7 +213,7 @@ Here is the call graph for this function:
    diff --git a/df/dd7/structlinkedlist-members.html b/df/dd7/structlinkedlist-members.html index 37cc6499c..4a5eca35f 100644 --- a/df/dd7/structlinkedlist-members.html +++ b/df/dd7/structlinkedlist-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -110,7 +112,7 @@ $(document).ready(function(){initNavTree('d0/dff/structlinkedlist.html','../../' diff --git a/df/ddb/structdata__structures_1_1treap_1_1_treap-members.html b/df/ddb/structdata__structures_1_1treap_1_1_treap-members.html index 405f48fc4..6e80b060f 100644 --- a/df/ddb/structdata__structures_1_1treap_1_1_treap-members.html +++ b/df/ddb/structdata__structures_1_1treap_1_1_treap-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,7 +130,7 @@ $(document).ready(function(){initNavTree('d5/d95/structdata__structures_1_1treap diff --git a/df/ddd/connected__components_8cpp.html b/df/ddd/connected__components_8cpp.html index b4a61b4ff..8966bb04e 100644 --- a/df/ddd/connected__components_8cpp.html +++ b/df/ddd/connected__components_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph/connected_components.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -133,9 +135,9 @@ Functions int graph::getConnectedComponents (const std::vector< std::vector< int > > *adj)  Function that perfoms depth first search algorithm on graph and calculated the number of connected components.
      -void tests () +void tests ()   -int main () +int main ()  

    Detailed Description

    @@ -161,8 +163,7 @@ Example - Here is graph with 3 connected components int main ( - void  - ) + void ) @@ -171,7 +172,7 @@ Example - Here is graph with 3 connected components

    running predefined tests

    127 {
    128 /// running predefined tests
    -
    129 tests();
    +
    129 tests();
    130
    131 int vertices = int(), edges = int();
    132 std::cout << "Enter the number of vertices : ";
    @@ -193,7 +194,7 @@ Example - Here is graph with 3 connected components
    148}
    -
    tests
    void tests()
    Definition connected_components.cpp:93
    +
    tests
    void tests()
    Definition connected_components.cpp:93
    std::endl
    T endl(T... args)
    graph::getConnectedComponents
    int getConnectedComponents(const std::vector< std::vector< int > > *adj)
    Function that perfoms depth first search algorithm on graph and calculated the number of connected co...
    Definition connected_components.cpp:77
    graph::addEdge
    void addEdge(std::vector< std::vector< int > > *adj, int u, int v)
    Function that add edge between two nodes or vertices of graph.
    Definition connected_components.cpp:46
    @@ -215,7 +216,7 @@ Here is the call graph for this function:
    void tests ( - ) + ) @@ -267,7 +268,7 @@ Here is the call graph for this function:
    diff --git a/df/de3/classqueue-members.html b/df/de3/classqueue-members.html index d0823d430..d638150cf 100644 --- a/df/de3/classqueue-members.html +++ b/df/de3/classqueue-members.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Member List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -121,7 +123,7 @@ $(document).ready(function(){initNavTree('db/da9/classqueue.html','../../'); ini diff --git a/df/de5/classbacktracking_1_1generate__parentheses.html b/df/de5/classbacktracking_1_1generate__parentheses.html index 166fd9da7..ce01a8f36 100644 --- a/df/de5/classbacktracking_1_1generate__parentheses.html +++ b/df/de5/classbacktracking_1_1generate__parentheses.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: backtracking::generate_parentheses Class Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('df/de5/classbacktracking_1_1generate__

    generate_parentheses class - More...

    + More...

    Collaboration diagram for backtracking::generate_parentheses:
    @@ -116,13 +118,13 @@ Collaboration diagram for backtracking::generate_parentheses:
    - +

    Public Member Functions

    std::vector< std::string > generate (int n)
    std::vector< std::string > generate (int n)
     wrapper interface
     
    - +

    Private Member Functions

    void makeStrings (std::string str, int n, int closed, int open)
    void makeStrings (std::string str, int n, int closed, int open)
     function that adds parenthesis to the string.
     
    @@ -145,8 +147,7 @@ Private Attributes - - +
    std::vector< std::string > backtracking::generate_parentheses::generate (int n)int n)
    @@ -161,14 +162,14 @@ Private Attributes
    Returns
    all well-formed pattern of parentheses
    70 {
    -
    71 backtracking::generate_parentheses::res.clear();
    +
    71 backtracking::generate_parentheses::res.clear();
    72 std::string str = "(";
    -
    73 generate_parentheses::makeStrings(str, n, 0, 1);
    -
    74 return res;
    +
    73 generate_parentheses::makeStrings(str, n, 0, 1);
    +
    74 return res;
    75}
    -
    backtracking::generate_parentheses::res
    std::vector< std::string > res
    Contains all possible valid patterns.
    Definition generate_parentheses.cpp:28
    -
    backtracking::generate_parentheses::makeStrings
    void makeStrings(std::string str, int n, int closed, int open)
    function that adds parenthesis to the string.
    Definition generate_parentheses.cpp:45
    +
    backtracking::generate_parentheses::res
    std::vector< std::string > res
    Contains all possible valid patterns.
    Definition generate_parentheses.cpp:28
    +
    backtracking::generate_parentheses::makeStrings
    void makeStrings(std::string str, int n, int closed, int open)
    function that adds parenthesis to the string.
    Definition generate_parentheses.cpp:45
    std::vector::clear
    T clear(T... args)
    Here is the call graph for this function:
    @@ -190,31 +191,22 @@ Here is the call graph for this function:
    void backtracking::generate_parentheses::makeStrings ( - std::string  - str, + std::string str, - int  - n, + int n, - int  - closed, + int closed, - int  - open  - - - - ) - + int open ) @@ -244,12 +236,12 @@ Here is the call graph for this function:
    53 }
    54
    55 if (str.length() == 2 * n) {
    -
    56 res.push_back(str);
    +
    56 res.push_back(str);
    57 return;
    58 }
    59
    -
    60 makeStrings(str + ')', n, closed + 1, open);
    -
    61 makeStrings(str + '(', n, closed, open + 1);
    +
    60 makeStrings(str + ')', n, closed + 1, open);
    +
    61 makeStrings(str + '(', n, closed, open + 1);
    62}
    std::vector::push_back
    T push_back(T... args)
    std::string::length
    T length(T... args)
    @@ -270,7 +262,7 @@ Here is the call graph for this function: diff --git a/df/dea/namespacefalse__position.html b/df/dea/namespacefalse__position.html index 2f8ba6d52..cc0f96f92 100644 --- a/df/dea/namespacefalse__position.html +++ b/df/dea/namespacefalse__position.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: false_position Namespace Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('df/dea/namespacefalse__position.html',

    Functions for [False Position] (https://en.wikipedia.org/wiki/Regula_falsi) method. -More...

    +More...

    Detailed Description

    Functions for [False Position] (https://en.wikipedia.org/wiki/Regula_falsi) method.

    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('df/dea/namespacefalse__position.html', diff --git a/df/def/power__for__huge__numbers_8cpp.html b/df/def/power__for__huge__numbers_8cpp.html index d0a974389..63a7d0da1 100644 --- a/df/def/power__for__huge__numbers_8cpp.html +++ b/df/def/power__for__huge__numbers_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math/power_for_huge_numbers.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,16 +117,16 @@ Include dependency graph for power_for_huge_numbers.cpp:
    - +

    Macros

    #define MAX   100000
    #define MAX   100000
     
    - + - + - +

    Functions

    int multiply (int x, int res[], int res_size)
    int multiply (int x, int res[], int res_size)
     
    void power (int x, int n)
    void power (int x, int n)
     
    int main ()
    int main ()
     

    Detailed Description

    @@ -155,8 +157,7 @@ Functions int main ( - void  - ) + void ) @@ -168,12 +169,12 @@ Functions
    85 std::cin >> base;
    86 std::cout << "Enter exponent ";
    87 std::cin >> exponent;
    -
    88 power(base, exponent);
    +
    88 power(base, exponent);
    89 return 0;
    90}
    -
    power
    void power(int x, int n)
    Definition power_for_huge_numbers.cpp:56
    +
    power
    void power(int x, int n)
    Definition power_for_huge_numbers.cpp:56
    Here is the call graph for this function:
    @@ -191,25 +192,17 @@ Here is the call graph for this function:
    int multiply ( - int  - x, + int x, - int  - res[], + int res[], - int  - res_size  - - - - ) - + int res_size )
    @@ -259,19 +252,12 @@ Here is the call graph for this function:
    void power ( - int  - x, + int x, - int  - n  - - - - ) - + int n )
    @@ -289,7 +275,7 @@ Here is the call graph for this function:
    60 return;
    61 }
    62
    -
    63 int res[MAX];
    +
    63 int res[MAX];
    64 int res_size = 0;
    65 int temp = x;
    66
    @@ -301,13 +287,13 @@ Here is the call graph for this function:
    72
    73 // Multiply x n times
    74 // (x^n = x*x*x....n times)
    -
    75 for (int i = 2; i <= n; i++) res_size = multiply(x, res, res_size);
    +
    75 for (int i = 2; i <= n; i++) res_size = multiply(x, res, res_size);
    76
    77 std::cout << x << "^" << n << " = ";
    78 for (int i = res_size - 1; i >= 0; i--) std::cout << res[i];
    79}
    -
    MAX
    #define MAX
    Definition power_for_huge_numbers.cpp:10
    -
    multiply
    int multiply(int x, int res[], int res_size)
    Definition power_for_huge_numbers.cpp:25
    +
    MAX
    #define MAX
    Definition power_for_huge_numbers.cpp:10
    +
    multiply
    int multiply(int x, int res[], int res_size)
    Definition power_for_huge_numbers.cpp:25
    Here is the call graph for this function:
    @@ -322,7 +308,7 @@ Here is the call graph for this function:
    diff --git a/df/dfb/minimax_8cpp.html b/df/dfb/minimax_8cpp.html index 3c2879a4c..a3013228d 100644 --- a/df/dfb/minimax_8cpp.html +++ b/df/dfb/minimax_8cpp.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: backtracking/minimax.cpp File Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -125,10 +127,10 @@ Namespaces

    Functions

    template<size_t T> -int backtracking::minimax (int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height) +int backtracking::minimax (int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)  Check which is the maximum/minimum number in the array.
      -int main () +int main ()  Main function.
      @@ -148,8 +150,7 @@ Functions int main ( - void  - ) + void ) @@ -159,13 +160,14 @@ Functions
    Returns
    0 on exit
    56 {
    57 std::array<int, 8> scores = {90, 23, 6, 33, 21, 65, 123, 34423};
    -
    58 double height = log2(scores.size());
    +
    58 double height = log2(scores.size());
    59
    60 std::cout << "Optimal value: "
    -
    61 << backtracking::minimax(0, 0, true, scores, height) << std::endl;
    +
    61 << backtracking::minimax(0, 0, true, scores, height) << std::endl;
    62 return 0;
    63}
    +
    height
    int height(node *root)
    Definition avltree.cpp:38
    std::endl
    T endl(T... args)
    backtracking::minimax
    int minimax(int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)
    Check which is the maximum/minimum number in the array.
    Definition minimax.cpp:39
    @@ -173,7 +175,7 @@ Functions
    Here is the call graph for this function:
    -
    +
    @@ -184,7 +186,7 @@ Here is the call graph for this function: diff --git a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 8875ddd1e..5f018e57b 100644 --- a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,14 +1,19 @@ - + - - - - - - - - - - + + + + + + + + + + + + + + + diff --git a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index f8a3336cc..9553d9439 100644 --- a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -da93c30b761d011adaa0883495ff7037 \ No newline at end of file +5733f15115d6a3b35636bada4c01d808 \ No newline at end of file diff --git a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index e1296192d..583f0c209 100644 --- a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,8 +4,8 @@ - + - + main Node1 - -main + +main @@ -31,8 +31,8 @@ Node2 - -std::endl + +std::endl @@ -40,17 +40,17 @@ Node1->Node2 - - + + Node3 - - -backtracking::minimax + + +height @@ -58,35 +58,53 @@ Node1->Node3 - - + + - - -Node6 - + + +Node5 + + +backtracking::minimax + + + + + +Node1->Node5 + + + + + + + + +Node7 + std::array::size - - -Node1->Node6 - - - + + +Node1->Node7 + + + - + Node3->Node3 - - - + + + @@ -94,35 +112,62 @@ Node4 - -std::max + +std::max - + Node3->Node4 - - - + + + - - -Node5 - - -std::min + + +Node5->Node3 + + + - - -Node3->Node5 - - - + + +Node5->Node4 + + + + + + + + +Node5->Node5 + + + + + + + + +Node6 + + +std::min + + + + + +Node5->Node6 + + + diff --git a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index ec03cdaa7..4902a049f 100644 --- a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + main Node1 - -main + +main @@ -21,8 +21,8 @@ Node2 - -std::endl + +std::endl @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node3 - - -backtracking::minimax + + +height @@ -48,35 +48,53 @@ Node1->Node3 - - + + - - -Node6 - + + +Node5 + + +backtracking::minimax + + + + + +Node1->Node5 + + + + + + + + +Node7 + std::array::size - - -Node1->Node6 - - - + + +Node1->Node7 + + + - + Node3->Node3 - - - + + + @@ -84,35 +102,62 @@ Node4 - -std::max + +std::max - + Node3->Node4 - - - + + + - - -Node5 - - -std::min + + +Node5->Node3 + + + - - -Node3->Node5 - - - + + +Node5->Node4 + + + + + + + + +Node5->Node5 + + + + + + + + +Node6 + + +std::min + + + + + +Node5->Node6 + + + diff --git a/dir_000002_000016.html b/dir_000002_000016.html index 161a5d618..9af08a177 100644 --- a/dir_000002_000016.html +++ b/dir_000002_000016.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ciphers -> numerical_methods Relation + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -103,7 +105,7 @@ $(document).ready(function(){initNavTree('dir_4d6e05837bf820fb089a8a8cdf2f42b7.h diff --git a/dir_074119ce3a874b57120c49a0cc4bb5ad.html b/dir_074119ce3a874b57120c49a0cc4bb5ad.html index 5f90a3ddc..7e6076c1e 100644 --- a/dir_074119ce3a874b57120c49a0cc4bb5ad.html +++ b/dir_074119ce3a874b57120c49a0cc4bb5ad.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: range_queries Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,7 +130,7 @@ Files diff --git a/dir_0eaa691bd54ab0922ca7f50599de6d22.html b/dir_0eaa691bd54ab0922ca7f50599de6d22.html index 51102ad84..e87a1f3e6 100644 --- a/dir_0eaa691bd54ab0922ca7f50599de6d22.html +++ b/dir_0eaa691bd54ab0922ca7f50599de6d22.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: greedy_algorithms Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -122,7 +124,7 @@ Files diff --git a/dir_12552d7fa429bf94a2e32e5cf39f7e69.html b/dir_12552d7fa429bf94a2e32e5cf39f7e69.html index 88bf8fde8..c95cba3d4 100644 --- a/dir_12552d7fa429bf94a2e32e5cf39f7e69.html +++ b/dir_12552d7fa429bf94a2e32e5cf39f7e69.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graph Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -146,7 +148,7 @@ Files diff --git a/dir_19b2bf9199a15c634a08b1ede1dd896a.html b/dir_19b2bf9199a15c634a08b1ede1dd896a.html index 0b8ca59d6..b0e5a54a7 100644 --- a/dir_19b2bf9199a15c634a08b1ede1dd896a.html +++ b/dir_19b2bf9199a15c634a08b1ede1dd896a.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: search Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -149,7 +151,7 @@ Files diff --git a/dir_296d53ceaeaa7e099814a6def439fe8a.html b/dir_296d53ceaeaa7e099814a6def439fe8a.html index 2f22bb94c..ed6462ae0 100644 --- a/dir_296d53ceaeaa7e099814a6def439fe8a.html +++ b/dir_296d53ceaeaa7e099814a6def439fe8a.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: math Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -285,7 +287,7 @@ N)\) time, with precision fixed using
    • math
      • -
    • Generated by doxygen 1.9.8
      • +
    • Generated by doxygen 1.10.0
    diff --git a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html index 57b5cf05b..c90568e08 100644 --- a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html +++ b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -188,7 +190,7 @@ Files diff --git a/dir_3343723ae086de42ee4ca9774da3a13f.html b/dir_3343723ae086de42ee4ca9774da3a13f.html index bbe5ac184..6f0210768 100644 --- a/dir_3343723ae086de42ee4ca9774da3a13f.html +++ b/dir_3343723ae086de42ee4ca9774da3a13f.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: machine_learning Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -131,7 +133,7 @@ Files diff --git a/dir_35422be6552f1b3672c1b6c4aba2da64.html b/dir_35422be6552f1b3672c1b6c4aba2da64.html index 663432971..1ca19f244 100644 --- a/dir_35422be6552f1b3672c1b6c4aba2da64.html +++ b/dir_35422be6552f1b3672c1b6c4aba2da64.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: operations_on_datastructures Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -134,7 +136,7 @@ Files diff --git a/dir_4b6f782e158b0b98da980a0e11a23a15.html b/dir_4b6f782e158b0b98da980a0e11a23a15.html index e8d71cbf3..bd7ce81c7 100644 --- a/dir_4b6f782e158b0b98da980a0e11a23a15.html +++ b/dir_4b6f782e158b0b98da980a0e11a23a15.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: games Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,7 +115,7 @@ Files diff --git a/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html b/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html index 2540c7c89..396c982c0 100644 --- a/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html +++ b/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: ciphers Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -143,7 +145,7 @@ Files diff --git a/dir_59dc24c326e2a72d1164f014b22de83d.html b/dir_59dc24c326e2a72d1164f014b22de83d.html index 909924d5a..f266fa7c1 100644 --- a/dir_59dc24c326e2a72d1164f014b22de83d.html +++ b/dir_59dc24c326e2a72d1164f014b22de83d.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: physics Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,7 +115,7 @@ Files diff --git a/dir_73a3cc5065b223eb41b02873c0e19f0e.html b/dir_73a3cc5065b223eb41b02873c0e19f0e.html index 7cd253471..9bc2a3a05 100644 --- a/dir_73a3cc5065b223eb41b02873c0e19f0e.html +++ b/dir_73a3cc5065b223eb41b02873c0e19f0e.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: strings Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -131,7 +133,7 @@ Files diff --git a/dir_82e494173a87936756866de2fa774307.html b/dir_82e494173a87936756866de2fa774307.html index 94cd1076d..134c9f72b 100644 --- a/dir_82e494173a87936756866de2fa774307.html +++ b/dir_82e494173a87936756866de2fa774307.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: probability Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -128,7 +130,7 @@ Files diff --git a/dir_8a20dd5bfd5341a725342bf72b6b686f.html b/dir_8a20dd5bfd5341a725342bf72b6b686f.html index 484e1a282..3ed2118a4 100644 --- a/dir_8a20dd5bfd5341a725342bf72b6b686f.html +++ b/dir_8a20dd5bfd5341a725342bf72b6b686f.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: dynamic_programming Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -158,7 +160,7 @@ Files diff --git a/dir_93bc990c5cceb745f78af6949e9ef947.html b/dir_93bc990c5cceb745f78af6949e9ef947.html index bb1a1989a..a0be4cc9e 100644 --- a/dir_93bc990c5cceb745f78af6949e9ef947.html +++ b/dir_93bc990c5cceb745f78af6949e9ef947.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: divide_and_conquer Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,7 +115,7 @@ Files diff --git a/dir_9510827d0b234b3cc54b29892f217477.html b/dir_9510827d0b234b3cc54b29892f217477.html index d2c45da0d..b60ce04da 100644 --- a/dir_9510827d0b234b3cc54b29892f217477.html +++ b/dir_9510827d0b234b3cc54b29892f217477.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: others Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -178,7 +180,7 @@ Files diff --git a/dir_9c6faab82c22511b50177aa2e38e2780.html b/dir_9c6faab82c22511b50177aa2e38e2780.html index bda8111bb..15b9bb14e 100644 --- a/dir_9c6faab82c22511b50177aa2e38e2780.html +++ b/dir_9c6faab82c22511b50177aa2e38e2780.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: numerical_methods Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -179,7 +181,7 @@ Files diff --git a/dir_bb1b521853a9c46347182a9d10420771.html b/dir_bb1b521853a9c46347182a9d10420771.html index 45a2d3d8b..751870ec6 100644 --- a/dir_bb1b521853a9c46347182a9d10420771.html +++ b/dir_bb1b521853a9c46347182a9d10420771.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: sorting Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -187,7 +189,7 @@ Files diff --git a/dir_c11585dfcef32a26e29098facab6c144.html b/dir_c11585dfcef32a26e29098facab6c144.html index 69a766716..040bcc516 100644 --- a/dir_c11585dfcef32a26e29098facab6c144.html +++ b/dir_c11585dfcef32a26e29098facab6c144.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: backtracking Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -147,7 +149,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm diff --git a/dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html b/dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html index d2e748260..0bdffd01a 100644 --- a/dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html +++ b/dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: cpu_scheduling_algorithms Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,7 +115,7 @@ Files diff --git a/dir_e3380d2178455503f266746fb14246a5.html b/dir_e3380d2178455503f266746fb14246a5.html index 00f9f7f58..44248ad00 100644 --- a/dir_e3380d2178455503f266746fb14246a5.html +++ b/dir_e3380d2178455503f266746fb14246a5.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: geometry Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -118,7 +120,7 @@ Files diff --git a/dir_e79632891301b850df87e9c0030293fa.html b/dir_e79632891301b850df87e9c0030293fa.html index 38e608499..d03646dc6 100644 --- a/dir_e79632891301b850df87e9c0030293fa.html +++ b/dir_e79632891301b850df87e9c0030293fa.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: graphics Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,7 +115,7 @@ Files diff --git a/dir_ece9b94c107bbaa1dd68197a8c9983b9.html b/dir_ece9b94c107bbaa1dd68197a8c9983b9.html index 52d792494..e124c1841 100644 --- a/dir_ece9b94c107bbaa1dd68197a8c9983b9.html +++ b/dir_ece9b94c107bbaa1dd68197a8c9983b9.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: hashing Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -131,7 +133,7 @@ Files diff --git a/dir_f1797d0c2a0a12033e7d74efffeb14e1.html b/dir_f1797d0c2a0a12033e7d74efffeb14e1.html index a101b24f2..d3541fd18 100644 --- a/dir_f1797d0c2a0a12033e7d74efffeb14e1.html +++ b/dir_f1797d0c2a0a12033e7d74efffeb14e1.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: data_structures/cll Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -117,7 +119,7 @@ Files diff --git a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html index 70e493ef6..5e2056fa5 100644 --- a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html +++ b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: bit_manipulation Directory Reference + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -137,7 +139,7 @@ Files diff --git a/doxygen.css b/doxygen.css index 009a9b554..7b7d851b8 100644 --- a/doxygen.css +++ b/doxygen.css @@ -1,4 +1,4 @@ -/* The standard CSS for doxygen 1.9.8*/ +/* The standard CSS for doxygen 1.10.0*/ html { /* page base colors */ @@ -145,6 +145,7 @@ html { --fragment-lineno-link-bg-color: #D8D8D8; --fragment-lineno-link-hover-fg-color: #4665A2; --fragment-lineno-link-hover-bg-color: #C8C8C8; +--fragment-copy-ok-color: #2EC82E; --tooltip-foreground-color: black; --tooltip-background-color: white; --tooltip-border-color: gray; @@ -168,6 +169,28 @@ html { --font-family-icon: Arial,Helvetica; --font-family-tooltip: Roboto,sans-serif; +/** special sections */ +--warning-color-bg: #f8d1cc; +--warning-color-hl: #b61825; +--warning-color-text: #75070f; +--note-color-bg: #faf3d8; +--note-color-hl: #f3a600; +--note-color-text: #5f4204; +--todo-color-bg: #e4f3ff; +--todo-color-hl: #1879C4; +--todo-color-text: #274a5c; +--test-color-bg: #e8e8ff; +--test-color-hl: #3939C4; +--test-color-text: #1a1a5c; +--deprecated-color-bg: #ecf0f3; +--deprecated-color-hl: #5b6269; +--deprecated-color-text: #43454a; +--bug-color-bg: #e4dafd; +--bug-color-hl: #5b2bdd; +--bug-color-text: #2a0d72; +--invariant-color-bg: #d8f1e3; +--invariant-color-hl: #44b86f; +--invariant-color-text: #265532; } @media (prefers-color-scheme: dark) { @@ -309,7 +332,7 @@ html { --code-link-color: #79C0FF; --code-external-link-color: #79C0FF; --fragment-foreground-color: #C9D1D9; ---fragment-background-color: black; +--fragment-background-color: #090D16; --fragment-border-color: #30363D; --fragment-lineno-border-color: #30363D; --fragment-lineno-background-color: black; @@ -318,6 +341,7 @@ html { --fragment-lineno-link-bg-color: #303030; --fragment-lineno-link-hover-fg-color: #8E96A1; --fragment-lineno-link-hover-bg-color: #505050; +--fragment-copy-ok-color: #0EA80E; --tooltip-foreground-color: #C9D1D9; --tooltip-background-color: #202020; --tooltip-border-color: #C9D1D9; @@ -341,6 +365,28 @@ html { --font-family-icon: Arial,Helvetica; --font-family-tooltip: Roboto,sans-serif; +/** special sections */ +--warning-color-bg: #2e1917; +--warning-color-hl: #ad2617; +--warning-color-text: #f5b1aa; +--note-color-bg: #3b2e04; +--note-color-hl: #f1b602; +--note-color-text: #ceb670; +--todo-color-bg: #163750; +--todo-color-hl: #1982D2; +--todo-color-text: #dcf0fa; +--test-color-bg: #121258; +--test-color-hl: #4242cf; +--test-color-text: #c0c0da; +--deprecated-color-bg: #2e323b; +--deprecated-color-hl: #738396; +--deprecated-color-text: #abb0bd; +--bug-color-bg: #2a2536; +--bug-color-hl: #7661b3; +--bug-color-text: #ae9ed6; +--invariant-color-bg: #303a35; +--invariant-color-hl: #76ce96; +--invariant-color-text: #cceed5; }} body { background-color: var(--page-background-color); @@ -357,8 +403,6 @@ body, table, div, p, dl { /* @group Heading Levels */ .title { - font-weight: 400; - font-size: 14px; font-family: var(--font-family-normal); line-height: 28px; font-size: 150%; @@ -556,7 +600,13 @@ a { } a:hover { - text-decoration: underline; + text-decoration: none; + background: linear-gradient(to bottom, transparent 0,transparent calc(100% - 1px), currentColor 100%); +} + +a:hover > span.arrow { + text-decoration: none; + background : var(--nav-background-color); } a.el { @@ -632,30 +682,63 @@ ul.multicol { .fragment { text-align: left; direction: ltr; - overflow-x: auto; /*Fixed: fragment lines overlap floating elements*/ + overflow-x: auto; overflow-y: hidden; + position: relative; + min-height: 12px; + margin: 10px 0px; + padding: 10px 10px; + border: 1px solid var(--fragment-border-color); + border-radius: 4px; + background-color: var(--fragment-background-color); + color: var(--fragment-foreground-color); } pre.fragment { - border: 1px solid var(--fragment-border-color); - background-color: var(--fragment-background-color); - color: var(--fragment-foreground-color); - padding: 4px 6px; - margin: 4px 8px 4px 2px; - overflow: auto; - word-wrap: break-word; - font-size: 9pt; - line-height: 125%; - font-family: var(--font-family-monospace); - font-size: 105%; + word-wrap: break-word; + font-size: 10pt; + line-height: 125%; + font-family: var(--font-family-monospace); } -div.fragment { - padding: 0 0 1px 0; /*Fixed: last line underline overlap border*/ - margin: 4px 8px 4px 2px; - color: var(--fragment-foreground-color); - background-color: var(--fragment-background-color); - border: 1px solid var(--fragment-border-color); +.clipboard { + width: 24px; + height: 24px; + right: 5px; + top: 5px; + opacity: 0; + position: absolute; + display: inline; + overflow: auto; + fill: var(--fragment-foreground-color); + justify-content: center; + align-items: center; + cursor: pointer; +} + +.clipboard.success { + border: 1px solid var(--fragment-foreground-color); + border-radius: 4px; +} + +.fragment:hover .clipboard, .clipboard.success { + opacity: .28; +} + +.clipboard:hover, .clipboard.success { + opacity: 1 !important; +} + +.clipboard:active:not([class~=success]) svg { + transform: scale(.91); +} + +.clipboard.success svg { + fill: var(--fragment-copy-ok-color); +} + +.clipboard.success { + border-color: var(--fragment-copy-ok-color); } div.line { @@ -778,10 +861,6 @@ img.light-mode-visible { display: none; } -img.formulaDsp { - -} - img.formulaInl, img.inline { vertical-align: middle; } @@ -1081,17 +1160,25 @@ dl.reflist dd { .paramtype { white-space: nowrap; + padding: 0px; + padding-bottom: 1px; } .paramname { - color: var(--memdef-param-name-color); white-space: nowrap; + padding: 0px; + padding-bottom: 1px; + margin-left: 2px; } + .paramname em { + color: var(--memdef-param-name-color); font-style: normal; + margin-right: 1px; } -.paramname code { - line-height: 14px; + +.paramname .paramdefval { + font-family: var(--font-family-monospace); } .params, .retval, .exception, .tparams { @@ -1425,7 +1512,6 @@ table.fieldtable { { height:32px; display:block; - text-decoration: none; outline: none; color: var(--nav-text-normal-color); font-family: var(--font-family-nav); @@ -1514,7 +1600,8 @@ dl { padding: 0 0 0 0; } -/* dl.note, dl.warning, dl.attention, dl.pre, dl.post, dl.invariant, dl.deprecated, dl.todo, dl.test, dl.bug, dl.examples */ +/* + dl.section { margin-left: 0px; padding-left: 0px; @@ -1569,8 +1656,101 @@ dl.bug { border-color: #C08050; } +*/ + +dl.bug dt a, dl.deprecated dt a, dl.todo dt a, dl.test a { + font-weight: bold !important; +} + +dl.warning, dl.attention, dl.note, dl.deprecated, dl.bug, +dl.invariant, dl.pre, dl.post, dl.todo, dl.test, dl.remark { + padding: 10px; + margin: 10px 0px; + overflow: hidden; + margin-left: 0; + border-radius: 4px; +} + dl.section dd { - margin-bottom: 6px; + margin-bottom: 2px; +} + +dl.warning, dl.attention { + background: var(--warning-color-bg); + border-left: 8px solid var(--warning-color-hl); + color: var(--warning-color-text); +} + +dl.warning dt, dl.attention dt { + color: var(--warning-color-hl); +} + +dl.note, dl.remark { + background: var(--note-color-bg); + border-left: 8px solid var(--note-color-hl); + color: var(--note-color-text); +} + +dl.note dt, dl.remark dt { + color: var(--note-color-hl); +} + +dl.todo { + background: var(--todo-color-bg); + border-left: 8px solid var(--todo-color-hl); + color: var(--todo-color-text); +} + +dl.todo dt { + color: var(--todo-color-hl); +} + +dl.test { + background: var(--test-color-bg); + border-left: 8px solid var(--test-color-hl); + color: var(--test-color-text); +} + +dl.test dt { + color: var(--test-color-hl); +} + +dl.bug dt a { + color: var(--bug-color-hl) !important; +} + +dl.bug { + background: var(--bug-color-bg); + border-left: 8px solid var(--bug-color-hl); + color: var(--bug-color-text); +} + +dl.bug dt a { + color: var(--bug-color-hl) !important; +} + +dl.deprecated { + background: var(--deprecated-color-bg); + border-left: 8px solid var(--deprecated-color-hl); + color: var(--deprecated-color-text); +} + +dl.deprecated dt a { + color: var(--deprecated-color-hl) !important; +} + +dl.section dd, dl.bug dd, dl.deprecated dd, dl.todo dd, dl.test dd { + margin-inline-start: 0px; +} + +dl.invariant, dl.pre, dl.post { + background: var(--invariant-color-bg); + border-left: 8px solid var(--invariant-color-hl); + color: var(--invariant-color-text); +} + +dl.invariant dt, dl.pre dt, dl.post dt { + color: var(--invariant-color-hl); } @@ -1585,12 +1765,12 @@ dl.section dd { vertical-align: bottom; border-collapse: separate; } - + #projectlogo img -{ +{ border: 0px none; } - + #projectalign { vertical-align: middle; diff --git a/doxygen_crawl.html b/doxygen_crawl.html new file mode 100644 index 000000000..635330350 --- /dev/null +++ b/doxygen_crawl.html @@ -0,0 +1,908 @@ + + + +Validator / crawler helper + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/dynsections.js b/dynsections.js index b73c82889..8f493264f 100644 --- a/dynsections.js +++ b/dynsections.js @@ -22,171 +22,173 @@ @licend The above is the entire license notice for the JavaScript code in this file */ -function toggleVisibility(linkObj) -{ - var base = $(linkObj).attr('id'); - var summary = $('#'+base+'-summary'); - var content = $('#'+base+'-content'); - var trigger = $('#'+base+'-trigger'); - var src=$(trigger).attr('src'); - if (content.is(':visible')===true) { - content.hide(); - summary.show(); - $(linkObj).addClass('closed').removeClass('opened'); - $(trigger).attr('src',src.substring(0,src.length-8)+'closed.png'); - } else { - content.show(); - summary.hide(); - $(linkObj).removeClass('closed').addClass('opened'); - $(trigger).attr('src',src.substring(0,src.length-10)+'open.png'); - } - return false; -} -function updateStripes() -{ - $('table.directory tr'). - removeClass('even').filter(':visible:even').addClass('even'); - $('table.directory tr'). - removeClass('odd').filter(':visible:odd').addClass('odd'); -} +let dynsection = { -function toggleLevel(level) -{ - $('table.directory tr').each(function() { - var l = this.id.split('_').length-1; - var i = $('#img'+this.id.substring(3)); - var a = $('#arr'+this.id.substring(3)); - if (l'); - // add vertical lines to other rows - $('span[class=lineno]').not(':eq(0)').append(''); - // add toggle controls to lines with fold divs - $('div[class=foldopen]').each(function() { - // extract specific id to use - var id = $(this).attr('id').replace('foldopen',''); - // extract start and end foldable fragment attributes - var start = $(this).attr('data-start'); - var end = $(this).attr('data-end'); - // replace normal fold span with controls for the first line of a foldable fragment - $(this).find('span[class=fold]:first').replaceWith(''); - // append div for folded (closed) representation - $(this).after(''); - // extract the first line from the "open" section to represent closed content - var line = $(this).children().first().clone(); - // remove any glow that might still be active on the original line - $(line).removeClass('glow'); - if (start) { - // if line already ends with a start marker (e.g. trailing {), remove it - $(line).html($(line).html().replace(new RegExp('\\s*'+start+'\\s*$','g'),'')); - } - // replace minus with plus symbol - $(line).find('span[class=fold]').css('background-image',plusImg[relPath]); - // append ellipsis - $(line).append(' '+start+'…'+end); - // insert constructed line into closed div - $('#foldclosed'+id).html(line); - }); -} + this.updateStripes(); + }, + toggleFolder : function(id) { + // the clicked row + const currentRow = $('#row_'+id); + + // all rows after the clicked row + const rows = currentRow.nextAll("tr"); + + const re = new RegExp('^row_'+id+'\\d+_$', "i"); //only one sub + + // only match elements AFTER this one (can't hide elements before) + const childRows = rows.filter(function() { return this.id.match(re); }); + + // first row is visible we are HIDING + if (childRows.filter(':first').is(':visible')===true) { + // replace down arrow by right arrow for current row + const currentRowSpans = currentRow.find("span"); + currentRowSpans.filter(".iconfopen").removeClass("iconfopen").addClass("iconfclosed"); + currentRowSpans.filter(".arrow").html('►'); + rows.filter("[id^=row_"+id+"]").hide(); // hide all children + } else { // we are SHOWING + // replace right arrow by down arrow for current row + const currentRowSpans = currentRow.find("span"); + currentRowSpans.filter(".iconfclosed").removeClass("iconfclosed").addClass("iconfopen"); + currentRowSpans.filter(".arrow").html('▼'); + // replace down arrows by right arrows for child rows + const childRowsSpans = childRows.find("span"); + childRowsSpans.filter(".iconfopen").removeClass("iconfopen").addClass("iconfclosed"); + childRowsSpans.filter(".arrow").html('►'); + childRows.show(); //show all children + } + this.updateStripes(); + }, + + toggleInherit : function(id) { + const rows = $('tr.inherit.'+id); + const img = $('tr.inherit_header.'+id+' img'); + const src = $(img).attr('src'); + if (rows.filter(':first').is(':visible')===true) { + rows.css('display','none'); + $(img).attr('src',src.substring(0,src.length-8)+'closed.png'); + } else { + rows.css('display','table-row'); // using show() causes jump in firefox + $(img).attr('src',src.substring(0,src.length-10)+'open.png'); + } + }, +}; + +let codefold = { + opened : true, + + // in case HTML_COLORSTYLE is LIGHT or DARK the vars will be replaced, so we write them out explicitly and use double quotes + plusImg: [ "var(--fold-plus-image)", "var(--fold-plus-image-relpath)" ], + minusImg: [ "var(--fold-minus-image)", "var(--fold-minus-image-relpath)" ], + + // toggle all folding blocks + toggle_all : function(relPath) { + if (this.opened) { + $('#fold_all').css('background-image',this.plusImg[relPath]); + $('div[id^=foldopen]').hide(); + $('div[id^=foldclosed]').show(); + } else { + $('#fold_all').css('background-image',this.minusImg[relPath]); + $('div[id^=foldopen]').show(); + $('div[id^=foldclosed]').hide(); + } + this.opened=!this.opened; + }, + + // toggle single folding block + toggle : function(id) { + $('#foldopen'+id).toggle(); + $('#foldclosed'+id).toggle(); + }, + + init : function(relPath) { + $('span[class=lineno]').css({ + 'padding-right':'4px', + 'margin-right':'2px', + 'display':'inline-block', + 'width':'54px', + 'background':'linear-gradient(var(--fold-line-color),var(--fold-line-color)) no-repeat 46px/2px 100%' + }); + // add global toggle to first line + $('span[class=lineno]:first').append(''); + // add vertical lines to other rows + $('span[class=lineno]').not(':eq(0)').append(''); + // add toggle controls to lines with fold divs + $('div[class=foldopen]').each(function() { + // extract specific id to use + const id = $(this).attr('id').replace('foldopen',''); + // extract start and end foldable fragment attributes + const start = $(this).attr('data-start'); + const end = $(this).attr('data-end'); + // replace normal fold span with controls for the first line of a foldable fragment + $(this).find('span[class=fold]:first').replaceWith(''); + // append div for folded (closed) representation + $(this).after(''); + // extract the first line from the "open" section to represent closed content + const line = $(this).children().first().clone(); + // remove any glow that might still be active on the original line + $(line).removeClass('glow'); + if (start) { + // if line already ends with a start marker (e.g. trailing {), remove it + $(line).html($(line).html().replace(new RegExp('\\s*'+start+'\\s*$','g'),'')); + } + // replace minus with plus symbol + $(line).find('span[class=fold]').css('background-image',codefold.plusImg[relPath]); + // append ellipsis + $(line).append(' '+start+'…'+end); + // insert constructed line into closed div + $('#foldclosed'+id).html(line); + }); + }, +}; /* @license-end */ diff --git a/examples.html b/examples.html index f49b8a776..4ab4d6fb8 100644 --- a/examples.html +++ b/examples.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Examples + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('examples.html',''); initResizable(); } diff --git a/files.html b/files.html index b084b7bd8..b6fc6d88e 100644 --- a/files.html +++ b/files.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -101,8 +103,8 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
    Here is a list of all documented files with brief descriptions:
    -
    [detail level 123]
    - +
    [detail level 123]
     ► backtracking
    + @@ -116,7 +118,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm - + @@ -126,7 +128,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm - + @@ -137,10 +139,10 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm - + - - + + @@ -167,9 +169,9 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm - + - + @@ -186,13 +188,13 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm - + - + - + @@ -205,14 +207,14 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm - + - + - + @@ -220,7 +222,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm - + @@ -228,7 +230,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm - + @@ -290,7 +292,7 @@ N)\) time, with precision fixed using diff --git a/functions.html b/functions.html index fc1fd1094..de0671410 100644 --- a/functions.html +++ b/functions.html @@ -3,16 +3,18 @@ - +Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
     ► backtracking
     ► bit_manipulation
     ► bit_manipulation
     ► ciphers
     ► ciphers
     ► cpu_scheduling_algorithms
     ► cpu_scheduling_algorithms
     ► data_structures
     ► data_structures
     ► divide_and_conquer
     ► divide_and_conquer
     ► dynamic_programming
     ► dynamic_programming
     ► games
     ► games
     ► geometry
     ► geometry
     ► graph
     ► graph
     ► graphics
     ► graphics
     ► greedy_algorithms
     ► greedy_algorithms
     ► hashing
     ► hashing
     ► machine_learning
     ► machine_learning
     ► math
     ► math
     sum_of_digits.cppA C++ Program to find the Sum of Digits of input integer
     ► numerical_methods
     ► numerical_methods
     qr_eigen_values.cppCompute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method
     ► operations_on_datastructures
     ► operations_on_datastructures
     reverse_binary_tree.cppImplementation for the Reversing a Binary Tree recursively algorithm
     ► others
     ► others
     stairs_pattern.cppThis program is use to print the following pattern
     ► physics
     ► physics
     ► probability
     ► probability
     ► range_queries
     ► range_queries
     ► search
     ► search
     sublist_search.cppImplementation of the Sublist Search Algorithm
     ► sorting
     ► sorting
     strand_sort.cppImplementation of Strand Sort algorithm
     ► strings
     ► strings
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -120,7 +122,7 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable(); diff --git a/functions_a.html b/functions_a.html index aa98cd1c7..df1d1e45d 100644 --- a/functions_a.html +++ b/functions_a.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -124,7 +126,7 @@ $(document).ready(function(){initNavTree('functions_a.html',''); initResizable() diff --git a/functions_b.html b/functions_b.html index 3ad5fea74..784fd37fa 100644 --- a/functions_b.html +++ b/functions_b.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -118,7 +120,7 @@ $(document).ready(function(){initNavTree('functions_b.html',''); initResizable() diff --git a/functions_c.html b/functions_c.html index bbd7a82a9..e3622aa88 100644 --- a/functions_c.html +++ b/functions_c.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -129,7 +131,7 @@ $(document).ready(function(){initNavTree('functions_c.html',''); initResizable() diff --git a/functions_d.html b/functions_d.html index 9266c5c08..f5f5d0e8c 100644 --- a/functions_d.html +++ b/functions_d.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -136,7 +138,7 @@ $(document).ready(function(){initNavTree('functions_d.html',''); initResizable() diff --git a/functions_e.html b/functions_e.html index 7dab5d0e6..bdba9f29a 100644 --- a/functions_e.html +++ b/functions_e.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -121,7 +123,7 @@ $(document).ready(function(){initNavTree('functions_e.html',''); initResizable() diff --git a/functions_f.html b/functions_f.html index 9747322e8..70dca750a 100644 --- a/functions_f.html +++ b/functions_f.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -117,7 +119,7 @@ $(document).ready(function(){initNavTree('functions_f.html',''); initResizable() diff --git a/functions_func.html b/functions_func.html index 8d5c2fbf2..0115ad860 100644 --- a/functions_func.html +++ b/functions_func.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,7 +116,7 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl diff --git a/functions_func_a.html b/functions_func_a.html index a30628a8d..6564980b7 100644 --- a/functions_func_a.html +++ b/functions_func_a.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -118,7 +120,7 @@ $(document).ready(function(){initNavTree('functions_func_a.html',''); initResiza diff --git a/functions_func_b.html b/functions_func_b.html index add1020c6..b579c40a3 100644 --- a/functions_func_b.html +++ b/functions_func_b.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,7 +117,7 @@ $(document).ready(function(){initNavTree('functions_func_b.html',''); initResiza diff --git a/functions_func_c.html b/functions_func_c.html index 4631b73ce..b36842efb 100644 --- a/functions_func_c.html +++ b/functions_func_c.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -122,7 +124,7 @@ $(document).ready(function(){initNavTree('functions_func_c.html',''); initResiza diff --git a/functions_func_d.html b/functions_func_d.html index 8182e9370..919bed25f 100644 --- a/functions_func_d.html +++ b/functions_func_d.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -132,7 +134,7 @@ $(document).ready(function(){initNavTree('functions_func_d.html',''); initResiza diff --git a/functions_func_e.html b/functions_func_e.html index d28ed4758..26416cd74 100644 --- a/functions_func_e.html +++ b/functions_func_e.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -119,7 +121,7 @@ $(document).ready(function(){initNavTree('functions_func_e.html',''); initResiza diff --git a/functions_func_f.html b/functions_func_f.html index cfb2c6df3..8d172f400 100644 --- a/functions_func_f.html +++ b/functions_func_f.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -115,7 +117,7 @@ $(document).ready(function(){initNavTree('functions_func_f.html',''); initResiza diff --git a/functions_func_g.html b/functions_func_g.html index d7e2a96bc..350c7b4bf 100644 --- a/functions_func_g.html +++ b/functions_func_g.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -156,7 +158,7 @@ $(document).ready(function(){initNavTree('functions_func_g.html',''); initResiza diff --git a/functions_func_h.html b/functions_func_h.html index 5fbd6a837..e54e83d8e 100644 --- a/functions_func_h.html +++ b/functions_func_h.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,7 +115,7 @@ $(document).ready(function(){initNavTree('functions_func_h.html',''); initResiza diff --git a/functions_func_i.html b/functions_func_i.html index 52e34811b..61421df65 100644 --- a/functions_func_i.html +++ b/functions_func_i.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -106,8 +108,8 @@ $(document).ready(function(){initNavTree('functions_func_i.html',''); initResiza
  • init() : range_queries::heavy_light_decomposition::HLD< X >, range_queries::heavy_light_decomposition::Tree< X >
  • inOrderIterative() : others::iterative_tree_traversals::BinaryTree
  • insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list< N >, data_structures::treap::Treap
    • -
  • Insert() : data_structures::tree_234::Tree234
    • -
  • insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie, operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
    • +
  • Insert() : data_structures::tree_234::Tree234
    • +
  • insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie, operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
  • Insert() : operations_on_datastructures::trie_operations::Tnode
  • insert() : probability::windowed_median::WindowedMedian, Trie
  • insertElement() : data_structures::SkipList
    • @@ -136,7 +138,7 @@ $(document).ready(function(){initNavTree('functions_func_i.html',''); initResiza diff --git a/functions_func_k.html b/functions_func_k.html index fd2053cd1..7ec4b49b1 100644 --- a/functions_func_k.html +++ b/functions_func_k.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -108,7 +110,7 @@ $(document).ready(function(){initNavTree('functions_func_k.html',''); initResiza diff --git a/functions_func_l.html b/functions_func_l.html index eabdf6854..6f96b5ce6 100644 --- a/functions_func_l.html +++ b/functions_func_l.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -122,7 +124,7 @@ $(document).ready(function(){initNavTree('functions_func_l.html',''); initResiza diff --git a/functions_func_m.html b/functions_func_m.html index a0a1c7cd2..c0c227402 100644 --- a/functions_func_m.html +++ b/functions_func_m.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -118,7 +120,7 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza diff --git a/functions_func_n.html b/functions_func_n.html index 1c5c408fb..8f7321f7a 100644 --- a/functions_func_n.html +++ b/functions_func_n.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,7 +118,7 @@ $(document).ready(function(){initNavTree('functions_func_n.html',''); initResiza diff --git a/functions_func_o.html b/functions_func_o.html index 5057154c0..a8fabd377 100644 --- a/functions_func_o.html +++ b/functions_func_o.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -147,7 +149,7 @@ $(document).ready(function(){initNavTree('functions_func_o.html',''); initResiza diff --git a/functions_func_p.html b/functions_func_p.html index db75d5c82..c93f7b61b 100644 --- a/functions_func_p.html +++ b/functions_func_p.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -124,7 +126,7 @@ $(document).ready(function(){initNavTree('functions_func_p.html',''); initResiza diff --git a/functions_func_q.html b/functions_func_q.html index 91cf878d2..88036bbb9 100644 --- a/functions_func_q.html +++ b/functions_func_q.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('functions_func_q.html',''); initResiza diff --git a/functions_func_r.html b/functions_func_r.html index e64149064..5af290e12 100644 --- a/functions_func_r.html +++ b/functions_func_r.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -125,7 +127,7 @@ $(document).ready(function(){initNavTree('functions_func_r.html',''); initResiza diff --git a/functions_func_s.html b/functions_func_s.html index d3f556eee..5d3661f98 100644 --- a/functions_func_s.html +++ b/functions_func_s.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -138,7 +140,7 @@ $(document).ready(function(){initNavTree('functions_func_s.html',''); initResiza diff --git a/functions_func_t.html b/functions_func_t.html index 635b98863..0e8f425ec 100644 --- a/functions_func_t.html +++ b/functions_func_t.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -124,7 +126,7 @@ $(document).ready(function(){initNavTree('functions_func_t.html',''); initResiza diff --git a/functions_func_u.html b/functions_func_u.html index 5bee8d40b..d9fe14ede 100644 --- a/functions_func_u.html +++ b/functions_func_u.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('functions_func_u.html',''); initResiza diff --git a/functions_func_v.html b/functions_func_v.html index fceb24d2d..e7df20387 100644 --- a/functions_func_v.html +++ b/functions_func_v.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -110,7 +112,7 @@ $(document).ready(function(){initNavTree('functions_func_v.html',''); initResiza diff --git a/functions_func_w.html b/functions_func_w.html index 959ca6fe5..306304524 100644 --- a/functions_func_w.html +++ b/functions_func_w.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('functions_func_w.html',''); initResiza diff --git a/functions_func_~.html b/functions_func_~.html index e856c0575..2cd217d60 100644 --- a/functions_func_~.html +++ b/functions_func_~.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Functions + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,7 +116,7 @@ $(document).ready(function(){initNavTree('functions_func_~.html',''); initResiza diff --git a/functions_g.html b/functions_g.html index 945633682..47384a564 100644 --- a/functions_g.html +++ b/functions_g.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -157,7 +159,7 @@ $(document).ready(function(){initNavTree('functions_g.html',''); initResizable() diff --git a/functions_h.html b/functions_h.html index 6a1d3450f..3201025a3 100644 --- a/functions_h.html +++ b/functions_h.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -123,7 +125,7 @@ $(document).ready(function(){initNavTree('functions_h.html',''); initResizable() diff --git a/functions_i.html b/functions_i.html index fefb140e2..281d7a1a5 100644 --- a/functions_i.html +++ b/functions_i.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,8 +109,8 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
  • init() : range_queries::heavy_light_decomposition::HLD< X >, range_queries::heavy_light_decomposition::Tree< X >
  • inOrderIterative() : others::iterative_tree_traversals::BinaryTree
  • insert() : binary_search_tree< T >, data_structures::linked_list::list, data_structures::list_array::list< N >, data_structures::treap::Treap
    • -
  • Insert() : data_structures::tree_234::Tree234
    • -
  • insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie, operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
    • +
  • Insert() : data_structures::tree_234::Tree234
    • +
  • insert() : data_structures::trie, data_structures::trie_using_hashmap::Trie, operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
  • Insert() : operations_on_datastructures::trie_operations::Tnode
  • insert() : probability::windowed_median::WindowedMedian, Trie
  • insertElement() : data_structures::SkipList
    • @@ -139,7 +141,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable() diff --git a/functions_k.html b/functions_k.html index e85d6a866..891d88965 100644 --- a/functions_k.html +++ b/functions_k.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -109,7 +111,7 @@ $(document).ready(function(){initNavTree('functions_k.html',''); initResizable() diff --git a/functions_l.html b/functions_l.html index 88636e8d1..97c822ce6 100644 --- a/functions_l.html +++ b/functions_l.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -126,7 +128,7 @@ $(document).ready(function(){initNavTree('functions_l.html',''); initResizable() diff --git a/functions_m.html b/functions_m.html index 9a2127ad2..73b32d93b 100644 --- a/functions_m.html +++ b/functions_m.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -124,7 +126,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable() diff --git a/functions_n.html b/functions_n.html index fd33c27fc..7dd314bd6 100644 --- a/functions_n.html +++ b/functions_n.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -108,8 +110,8 @@ $(document).ready(function(){initNavTree('functions_n.html',''); initResizable()
  • NeuralNetwork() : machine_learning::neural_network::NeuralNetwork
  • new_val() : statistics::stats_computer1< T >, statistics::stats_computer2< T >
  • newKid() : range_queries::perSegTree
    • -
  • next : data_structures::linked_list::Node, hash_chain, list, ListNode, operations_on_datastructures::circular_linked_list::Node, search::sublist_search::Node
    • -
  • Node() : data_structures::Node, data_structures::tree_234::Node, hash_chain, operations_on_datastructures::circular_linked_list::Node, operations_on_datastructures::reverse_binary_tree::Node
    • +
  • next : data_structures::linked_list::Node, list, ListNode, operations_on_datastructures::circular_linked_list::Node, search::sublist_search::Node
    • +
  • Node() : data_structures::Node, data_structures::tree_234::Node, hash_chain, operations_on_datastructures::circular_linked_list::Node, operations_on_datastructures::reverse_binary_tree::Node
  • NUM_CHARS : data_structures::trie
  • num_digits() : large_number
  • number_of_vertices() : graph::Graph< T >
    • @@ -120,7 +122,7 @@ $(document).ready(function(){initNavTree('functions_n.html',''); initResizable() diff --git a/functions_o.html b/functions_o.html index 4eca8cbbc..0ed3d9a29 100644 --- a/functions_o.html +++ b/functions_o.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -147,7 +149,7 @@ $(document).ready(function(){initNavTree('functions_o.html',''); initResizable() diff --git a/functions_p.html b/functions_p.html index a8d3ca442..df31702f8 100644 --- a/functions_p.html +++ b/functions_p.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -135,7 +137,7 @@ $(document).ready(function(){initNavTree('functions_p.html',''); initResizable() diff --git a/functions_q.html b/functions_q.html index acc1ae97e..fd57e4023 100644 --- a/functions_q.html +++ b/functions_q.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -109,7 +111,7 @@ $(document).ready(function(){initNavTree('functions_q.html',''); initResizable() diff --git a/functions_r.html b/functions_r.html index 824a658b0..7e76a6dd3 100644 --- a/functions_r.html +++ b/functions_r.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -130,7 +132,7 @@ $(document).ready(function(){initNavTree('functions_r.html',''); initResizable() diff --git a/functions_rela.html b/functions_rela.html index 68f6aae3f..39bdd4a89 100644 --- a/functions_rela.html +++ b/functions_rela.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Related Symbols + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -109,7 +111,7 @@ $(document).ready(function(){initNavTree('functions_rela.html',''); initResizabl diff --git a/functions_s.html b/functions_s.html index 17e175d94..8fcc922b7 100644 --- a/functions_s.html +++ b/functions_s.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -149,7 +151,7 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable() diff --git a/functions_t.html b/functions_t.html index bd3a97bcf..1c2375da9 100644 --- a/functions_t.html +++ b/functions_t.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -134,7 +136,7 @@ $(document).ready(function(){initNavTree('functions_t.html',''); initResizable() diff --git a/functions_type.html b/functions_type.html index b5e798707..97efbd4f3 100644 --- a/functions_type.html +++ b/functions_type.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Typedefs + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -99,14 +101,14 @@ $(document).ready(function(){initNavTree('functions_type.html',''); initResizabl
    Here is a list of all documented typedefs with links to the class documentation for each member:
    diff --git a/functions_u.html b/functions_u.html index 2e973ac13..28586f14a 100644 --- a/functions_u.html +++ b/functions_u.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,7 +115,7 @@ $(document).ready(function(){initNavTree('functions_u.html',''); initResizable() diff --git a/functions_v.html b/functions_v.html index 057739067..f7f28a2e7 100644 --- a/functions_v.html +++ b/functions_v.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('functions_v.html',''); initResizable() diff --git a/functions_vars.html b/functions_vars.html index 66cd65f22..db9ac2db1 100644 --- a/functions_vars.html +++ b/functions_vars.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members - Variables + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -211,7 +213,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl

    - n -

    @@ -313,7 +315,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl diff --git a/functions_w.html b/functions_w.html index b68822f06..37761b401 100644 --- a/functions_w.html +++ b/functions_w.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -109,7 +111,7 @@ $(document).ready(function(){initNavTree('functions_w.html',''); initResizable() diff --git a/functions_x.html b/functions_x.html index ced657437..1cdada005 100644 --- a/functions_x.html +++ b/functions_x.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -108,7 +110,7 @@ $(document).ready(function(){initNavTree('functions_x.html',''); initResizable() diff --git a/functions_y.html b/functions_y.html index d2177a3f4..d575cb6e7 100644 --- a/functions_y.html +++ b/functions_y.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -109,7 +111,7 @@ $(document).ready(function(){initNavTree('functions_y.html',''); initResizable() diff --git a/functions_~.html b/functions_~.html index 8d38ee00c..e0af5ea92 100644 --- a/functions_~.html +++ b/functions_~.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,7 +116,7 @@ $(document).ready(function(){initNavTree('functions_~.html',''); initResizable() diff --git a/globals.html b/globals.html index 7ddb64b80..dc82a28d5 100644 --- a/globals.html +++ b/globals.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -109,7 +111,7 @@ $(document).ready(function(){initNavTree('globals.html',''); initResizable(); }) diff --git a/globals_a.html b/globals_a.html index 616186d68..f55be33ac 100644 --- a/globals_a.html +++ b/globals_a.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,7 +118,7 @@ $(document).ready(function(){initNavTree('globals_a.html',''); initResizable(); diff --git a/globals_b.html b/globals_b.html index a8ac725e3..5a2fce249 100644 --- a/globals_b.html +++ b/globals_b.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -117,7 +119,7 @@ $(document).ready(function(){initNavTree('globals_b.html',''); initResizable(); diff --git a/globals_c.html b/globals_c.html index 30cc03567..f0b84402c 100644 --- a/globals_c.html +++ b/globals_c.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -121,7 +123,7 @@ $(document).ready(function(){initNavTree('globals_c.html',''); initResizable(); diff --git a/globals_d.html b/globals_d.html index fb1d57fd0..cd3d0d096 100644 --- a/globals_d.html +++ b/globals_d.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,7 +116,7 @@ $(document).ready(function(){initNavTree('globals_d.html',''); initResizable(); diff --git a/globals_defs.html b/globals_defs.html index d971aef35..c200407af 100644 --- a/globals_defs.html +++ b/globals_defs.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -120,7 +122,7 @@ $(document).ready(function(){initNavTree('globals_defs.html',''); initResizable( diff --git a/globals_e.html b/globals_e.html index 697a0b19a..42f930460 100644 --- a/globals_e.html +++ b/globals_e.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,7 +116,7 @@ $(document).ready(function(){initNavTree('globals_e.html',''); initResizable(); diff --git a/globals_f.html b/globals_f.html index facd450f5..f33294e95 100644 --- a/globals_f.html +++ b/globals_f.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -129,7 +131,7 @@ $(document).ready(function(){initNavTree('globals_f.html',''); initResizable(); diff --git a/globals_func.html b/globals_func.html index 77489a7aa..3da79d191 100644 --- a/globals_func.html +++ b/globals_func.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable( diff --git a/globals_func_a.html b/globals_func_a.html index c9e4e4e6c..1c4ec06f2 100644 --- a/globals_func_a.html +++ b/globals_func_a.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('globals_func_a.html',''); initResizabl diff --git a/globals_func_b.html b/globals_func_b.html index a667159ce..4edaa6788 100644 --- a/globals_func_b.html +++ b/globals_func_b.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,7 +118,7 @@ $(document).ready(function(){initNavTree('globals_func_b.html',''); initResizabl diff --git a/globals_func_c.html b/globals_func_c.html index 5b2de1bbb..17cb8a366 100644 --- a/globals_func_c.html +++ b/globals_func_c.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -119,7 +121,7 @@ $(document).ready(function(){initNavTree('globals_func_c.html',''); initResizabl diff --git a/globals_func_d.html b/globals_func_d.html index 927a68a4d..7f957fc4d 100644 --- a/globals_func_d.html +++ b/globals_func_d.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,7 +115,7 @@ $(document).ready(function(){initNavTree('globals_func_d.html',''); initResizabl diff --git a/globals_func_e.html b/globals_func_e.html index b6325fc49..c0ac22aec 100644 --- a/globals_func_e.html +++ b/globals_func_e.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('globals_func_e.html',''); initResizabl diff --git a/globals_func_f.html b/globals_func_f.html index 48e5df7ba..9021746f6 100644 --- a/globals_func_f.html +++ b/globals_func_f.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,7 +129,7 @@ $(document).ready(function(){initNavTree('globals_func_f.html',''); initResizabl diff --git a/globals_func_g.html b/globals_func_g.html index ebed97dfb..17c40a03b 100644 --- a/globals_func_g.html +++ b/globals_func_g.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -119,7 +121,7 @@ $(document).ready(function(){initNavTree('globals_func_g.html',''); initResizabl diff --git a/globals_func_h.html b/globals_func_h.html index 03b1e1831..57f43248d 100644 --- a/globals_func_h.html +++ b/globals_func_h.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('globals_func_h.html',''); initResizabl diff --git a/globals_func_i.html b/globals_func_i.html index cd51da359..4664d6fcd 100644 --- a/globals_func_i.html +++ b/globals_func_i.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -108,8 +110,8 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
  • InterpolationSearch() : interpolation_search2.cpp
  • is_happy() : happy_number.cpp
  • is_square() : ordinary_least_squares_regressor.cpp
    • -
  • IsPrime() : primality_test.cpp
  • isPrime() : modular_inverse_fermat_little_theorem.cpp
    • +
  • IsPrime() : primality_test.cpp
  • it_ternary_search() : ternary_search.cpp
    • @@ -117,7 +119,7 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl diff --git a/globals_func_j.html b/globals_func_j.html index 50debd9a6..fcd2d43ca 100644 --- a/globals_func_j.html +++ b/globals_func_j.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('globals_func_j.html',''); initResizabl diff --git a/globals_func_l.html b/globals_func_l.html index 6c7802f8f..c5aac6168 100644 --- a/globals_func_l.html +++ b/globals_func_l.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,7 +116,7 @@ $(document).ready(function(){initNavTree('globals_func_l.html',''); initResizabl diff --git a/globals_func_m.html b/globals_func_m.html index a60d4f24b..d5269874e 100644 --- a/globals_func_m.html +++ b/globals_func_m.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -121,7 +123,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl diff --git a/globals_func_n.html b/globals_func_n.html index eec320d09..e3273ab24 100644 --- a/globals_func_n.html +++ b/globals_func_n.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -109,7 +111,7 @@ $(document).ready(function(){initNavTree('globals_func_n.html',''); initResizabl diff --git a/globals_func_o.html b/globals_func_o.html index ce3364354..e35722c5e 100644 --- a/globals_func_o.html +++ b/globals_func_o.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,7 +116,7 @@ $(document).ready(function(){initNavTree('globals_func_o.html',''); initResizabl diff --git a/globals_func_p.html b/globals_func_p.html index 5f485dbb4..5f3f9dea1 100644 --- a/globals_func_p.html +++ b/globals_func_p.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -123,7 +125,7 @@ $(document).ready(function(){initNavTree('globals_func_p.html',''); initResizabl diff --git a/globals_func_q.html b/globals_func_q.html index 5a1894e97..753400dc9 100644 --- a/globals_func_q.html +++ b/globals_func_q.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -108,7 +110,7 @@ $(document).ready(function(){initNavTree('globals_func_q.html',''); initResizabl diff --git a/globals_func_r.html b/globals_func_r.html index 77461c920..c3be113e1 100644 --- a/globals_func_r.html +++ b/globals_func_r.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('globals_func_r.html',''); initResizabl diff --git a/globals_func_s.html b/globals_func_s.html index 869072e89..a2cebf229 100644 --- a/globals_func_s.html +++ b/globals_func_s.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -111,8 +113,8 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl
  • show_array() : bogo_sort.cpp
  • show_data() : shell_sort2.cpp
  • show_pascal() : pascal_triangle.cpp
    • -
  • sieve() : sieve_of_eratosthenes.cpp
  • Sieve() : primes_up_to_billion.cpp
    • +
  • sieve() : sieve_of_eratosthenes.cpp
  • SieveOfEratosthenes() : prime_factorization.cpp
  • SLEEP() : memory_game.cpp
  • sortcol() : fcfs_scheduling.cpp
    • @@ -128,7 +130,7 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl diff --git a/globals_func_t.html b/globals_func_t.html index 79bffd837..1b18ae4a6 100644 --- a/globals_func_t.html +++ b/globals_func_t.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -149,7 +151,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl diff --git a/globals_func_u.html b/globals_func_u.html index 002c23d4f..808b7d073 100644 --- a/globals_func_u.html +++ b/globals_func_u.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('globals_func_u.html',''); initResizabl diff --git a/globals_func_z.html b/globals_func_z.html index 86a3c269a..864fba617 100644 --- a/globals_func_z.html +++ b/globals_func_z.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('globals_func_z.html',''); initResizabl diff --git a/globals_g.html b/globals_g.html index d6cc7ffae..ade18734b 100644 --- a/globals_g.html +++ b/globals_g.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -120,7 +122,7 @@ $(document).ready(function(){initNavTree('globals_g.html',''); initResizable(); diff --git a/globals_h.html b/globals_h.html index 30ede3493..99a069943 100644 --- a/globals_h.html +++ b/globals_h.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,7 +115,7 @@ $(document).ready(function(){initNavTree('globals_h.html',''); initResizable(); diff --git a/globals_i.html b/globals_i.html index 901772bf9..cf47c372c 100644 --- a/globals_i.html +++ b/globals_i.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -109,9 +111,9 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
  • InterpolationSearch() : interpolation_search2.cpp
  • is_happy() : happy_number.cpp
  • is_square() : ordinary_least_squares_regressor.cpp
    • -
  • isprime : prime_factorization.cpp
    • -
  • IsPrime() : primality_test.cpp
  • isPrime() : modular_inverse_fermat_little_theorem.cpp
    • +
  • IsPrime() : primality_test.cpp
    • +
  • isprime : prime_factorization.cpp
  • it_ternary_search() : ternary_search.cpp
    • @@ -119,7 +121,7 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable(); diff --git a/globals_j.html b/globals_j.html index b998534df..6d2553080 100644 --- a/globals_j.html +++ b/globals_j.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('globals_j.html',''); initResizable(); diff --git a/globals_l.html b/globals_l.html index 9275b5c2a..a98d72a85 100644 --- a/globals_l.html +++ b/globals_l.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -117,7 +119,7 @@ $(document).ready(function(){initNavTree('globals_l.html',''); initResizable(); diff --git a/globals_m.html b/globals_m.html index a880b3601..7a660933d 100644 --- a/globals_m.html +++ b/globals_m.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -103,7 +105,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
  • main() : generate_parentheses.cpp, graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solver.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, find_non_repeating_number.cpp, hamming_distance.cpp, next_higher_number_with_same_number_of_set_bits.cpp, power_of_2.cpp, set_kth_bit.cpp, travelling_salesman_using_bit_manipulation.cpp, a1z26_cipher.cpp, atbash_cipher.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, avltree.cpp, bloom_filter.cpp, disjoint_set.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, reverse_a_linked_list.cpp, segment_tree.cpp, skip_list.cpp, sparse_table.cpp, treap.cpp, tree_234.cpp, trie_modern.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, armstrong_number.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_common_string.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, maximum_circular_subarray.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, subset_sum.cpp, word_break.cpp, memory_game.cpp, jarvis_algorithm.cpp, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, spirograph.cpp, boruvkas_minimum_spanning_tree.cpp, dijkstra.cpp, jumpgame.cpp, kruskals_minimum_spanning_tree.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, sha256.cpp, adaline_learning.cpp, k_nearest_neighbors.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, aliquot_sum.cpp, approximate_pi.cpp, area.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eratosthenes.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, integral_approximation2.cpp, inv_sqrt.cpp, iterative_factorial.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, perimeter.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, quadratic_equations_complex_numbers.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, bisection_method.cpp, brent_method_extrema.cpp, composite_simpson_rule.cpp, false_position.cpp, fast_fourier_transform.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, gram_schmidt.cpp, inverse_fast_fourier_transform.cpp, lu_decompose.cpp, midpoint_integral_method.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.cpp, array_left_rotation.cpp, array_right_rotation.cpp, circular_linked_list.cpp, inorder_successor_of_bst.cpp, intersection_of_two_arrays.cpp, reverse_binary_tree.cpp, trie_multiple_search.cpp, union_of_two_arrays.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, kadanes3.cpp, kelvin_to_celsius.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, recursive_tree_traversal.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, ground_to_ground_projectile_motion.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, geometric_dist.cpp, poisson_dist.cpp, windowed_median.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, sparse_table.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, median_search2.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, stooge_sort.cpp, strand_sort.cpp, wave_sort.cpp, boyer_moore.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
  • mat_mul() : qr_eigen_values.cpp
  • mat_size : matrix_exponentiation.cpp
    • -
  • matrix : lu_decomposition.h
    • +
  • matrix : lu_decomposition.h
  • MAX : fibonacci_fast.cpp, power_for_huge_numbers.cpp, paranthesis_matching.cpp, hash_search.cpp, ternary_search.cpp
  • MAX_ITER : adaline_learning.cpp
  • MAX_ITERATIONS : bisection_method.cpp, newton_raphson_method.cpp
    • @@ -127,7 +129,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable(); diff --git a/globals_n.html b/globals_n.html index 7ab6f47ce..fe98baeb6 100644 --- a/globals_n.html +++ b/globals_n.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('globals_n.html',''); initResizable();

    - n -

    @@ -110,7 +112,7 @@ $(document).ready(function(){initNavTree('globals_n.html',''); initResizable(); diff --git a/globals_o.html b/globals_o.html index 5381fd35d..6211bd770 100644 --- a/globals_o.html +++ b/globals_o.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -114,7 +116,7 @@ $(document).ready(function(){initNavTree('globals_o.html',''); initResizable(); diff --git a/globals_p.html b/globals_p.html index 59c5d173e..5b975de8e 100644 --- a/globals_p.html +++ b/globals_p.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -127,7 +129,7 @@ $(document).ready(function(){initNavTree('globals_p.html',''); initResizable(); diff --git a/globals_q.html b/globals_q.html index 3cad5b07c..5f1aced21 100644 --- a/globals_q.html +++ b/globals_q.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -108,7 +110,7 @@ $(document).ready(function(){initNavTree('globals_q.html',''); initResizable(); diff --git a/globals_r.html b/globals_r.html index 8834889f1..8931997f1 100644 --- a/globals_r.html +++ b/globals_r.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('globals_r.html',''); initResizable(); diff --git a/globals_s.html b/globals_s.html index 709fff0bf..103cc4642 100644 --- a/globals_s.html +++ b/globals_s.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -111,8 +113,8 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
  • show_array() : bogo_sort.cpp
  • show_data() : shell_sort2.cpp
  • show_pascal() : pascal_triangle.cpp
    • -
  • sieve() : sieve_of_eratosthenes.cpp
  • Sieve() : primes_up_to_billion.cpp
    • +
  • sieve() : sieve_of_eratosthenes.cpp
  • SieveOfEratosthenes() : prime_factorization.cpp
  • SLEEP() : memory_game.cpp
  • sortcol() : fcfs_scheduling.cpp
    • @@ -130,7 +132,7 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable(); diff --git a/globals_t.html b/globals_t.html index 5d0e77f6e..e11290250 100644 --- a/globals_t.html +++ b/globals_t.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -150,7 +152,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable(); diff --git a/globals_type.html b/globals_type.html index ce6fe54ca..6c70b6208 100644 --- a/globals_type.html +++ b/globals_type.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -99,15 +101,15 @@ $(document).ready(function(){initNavTree('globals_type.html',''); initResizable(
    Here is a list of all documented typedefs with links to the documentation:
    diff --git a/globals_u.html b/globals_u.html index 599442e16..2c47e9477 100644 --- a/globals_u.html +++ b/globals_u.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('globals_u.html',''); initResizable(); diff --git a/globals_vars.html b/globals_vars.html index a44b486ff..5a28cf494 100644 --- a/globals_vars.html +++ b/globals_vars.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -124,7 +126,7 @@ $(document).ready(function(){initNavTree('globals_vars.html',''); initResizable( diff --git a/globals_w.html b/globals_w.html index 367fdbb7c..96eb4c691 100644 --- a/globals_w.html +++ b/globals_w.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('globals_w.html',''); initResizable(); diff --git a/globals_z.html b/globals_z.html index b103457dc..0b8d02551 100644 --- a/globals_z.html +++ b/globals_z.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: File Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('globals_z.html',''); initResizable(); diff --git a/graph_legend.html b/graph_legend.html index e6b52eeb0..81c778797 100644 --- a/graph_legend.html +++ b/graph_legend.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Graph Legend + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -165,7 +167,7 @@ A yellow dashed arrow denotes a relation between a template instance and the tem diff --git a/hierarchy.html b/hierarchy.html index 8c2c443ad..00c7a1569 100644 --- a/hierarchy.html +++ b/hierarchy.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Hierarchy + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -103,7 +105,7 @@ $(document).ready(function(){initNavTree('hierarchy.html',''); initResizable();

    Go to the graphical class hierarchy

    This inheritance list is sorted roughly, but not completely, alphabetically:
    -
    [detail level 12]
    +
    [detail level 12]
    @@ -136,7 +138,7 @@ This inheritance list is sorted roughly, but not completely, alphabetically: - + @@ -183,13 +185,13 @@ This inheritance list is sorted roughly, but not completely, alphabetically: - - + + - + @@ -205,14 +207,14 @@ This inheritance list is sorted roughly, but not completely, alphabetically: - + - + @@ -229,7 +231,7 @@ This inheritance list is sorted roughly, but not completely, alphabetically: diff --git a/hierarchy.js b/hierarchy.js index 93b1ed10f..c00ecba7a 100644 --- a/hierarchy.js +++ b/hierarchy.js @@ -80,8 +80,8 @@ var hierarchy = [ "geometry::jarvis::Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ], [ "Point", "d8/dc8/struct_point.html", null ], [ "query", "dd/d1b/structquery.html", null ], - [ "Queue", "dc/db5/struct_queue.html", null ], [ "queue< ValueType >", "db/da9/classqueue.html", null ], + [ "Queue", "dc/db5/struct_queue.html", null ], [ "data_structures::queue_using_array::Queue_Array", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html", null ], [ "RBtree", "d8/d72/class_r_btree.html", null ], [ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", null ], diff --git a/index.html b/index.html index 58ac8443e..13ee31906 100644 --- a/index.html +++ b/index.html @@ -3,16 +3,18 @@ - +Algorithms_in_C++: The Algorithms - C++ + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
     Cmachine_learning::adaline
     Cmachine_learning::aystar_search::AyStarSearch< Puzzle >A class defining A* search algorithm. for some initial state and final state
     Cbinary_search_tree< T >The Binary Search Tree class
     Cbacktracking::generate_parenthesesGenerate_parentheses class
     Cprobability::geometric_dist::geometric_distributionA class to model the geometric distribution
     CGraph
     ►Cgraph::Graph< T >
     ►Cgraph::Graph< T >
     Cgraph::is_graph_bipartite::GraphClass for representing graph as an adjacency list
     Cgreedy_algorithms::dijkstra::GraphWrapper class for storing a graph
     Cgeometry::jarvis::Point
     CPoint
     Cquery
     CQueue
     Cqueue< ValueType >
     Cqueue< ValueType >
     CQueue
     Cdata_structures::queue_using_array::Queue_ArrayQueue_Array class containing the main data and also index of head and tail of the array
     CRBtree
     CSegmentIntersection
     Cdata_structures::SegmentTree< T >Class representation of the segment tree
     ►Crange_queries::heavy_light_decomposition::SG< X >Segment Tree, to store heavy chains
     ►Crange_queries::heavy_light_decomposition::SG< X >Segment Tree, to store heavy chains
     Cdata_structures::SkipList
     CSolution
     Coperations_on_datastructures::trie_operations::TnodeClass defining the structure of trie node and containing the methods to perform operations on them
     Ctower
     Cdata_structures::treap::TreapStruct representation of the treap
     ►Crange_queries::heavy_light_decomposition::Tree< X >A Basic Tree, which supports binary lifting
     ►Crange_queries::heavy_light_decomposition::Tree< X >A Basic Tree, which supports binary lifting
     Cdata_structures::tree_234::Tree2342-3-4 tree class
     Cdata_structures::trieTrie implementation for small-case English alphabets a-z
     Cdata_structures::trie_using_hashmap::TrieTrie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix
     CTrie
     CTrie::TrieNode
     ►Cstd::true_type [external]
     ►Cstd::true_type [external]
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -125,12 +127,13 @@ Documentation Contributions

    As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.

    + diff --git a/inherits.html b/inherits.html index 639b8687b..2d8ae1914 100644 --- a/inherits.html +++ b/inherits.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Class Hierarchy + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -217,7 +219,7 @@ $(document).ready(function(){initNavTree('hierarchy.html',''); initResizable(); diff --git a/menu.js b/menu.js index b0b26936a..717761d01 100644 --- a/menu.js +++ b/menu.js @@ -24,13 +24,12 @@ */ function initMenu(relPath,searchEnabled,serverSide,searchPage,search) { function makeTree(data,relPath) { - var result=''; + let result=''; if ('children' in data) { result+='
      '; - for (var i in data.children) { - var url; - var link; - link = data.children[i].url; + for (let i in data.children) { + let url; + const link = data.children[i].url; if (link.substring(0,1)=='^') { url = link.substring(1); } else { @@ -44,7 +43,7 @@ function initMenu(relPath,searchEnabled,serverSide,searchPage,search) { } return result; } - var searchBoxHtml; + let searchBoxHtml; if (searchEnabled) { if (serverSide) { searchBoxHtml='
      '+ @@ -88,29 +87,28 @@ function initMenu(relPath,searchEnabled,serverSide,searchPage,search) { if (searchBoxHtml) { $('#main-menu').append('
    • '); } - var $mainMenuState = $('#main-menu-state'); - var prevWidth = 0; + const $mainMenuState = $('#main-menu-state'); + let prevWidth = 0; if ($mainMenuState.length) { - function initResizableIfExists() { + const initResizableIfExists = function() { if (typeof initResizable==='function') initResizable(); } // animate mobile menu - $mainMenuState.change(function(e) { - var $menu = $('#main-menu'); - var options = { duration: 250, step: initResizableIfExists }; + $mainMenuState.change(function() { + const $menu = $('#main-menu'); + let options = { duration: 250, step: initResizableIfExists }; if (this.checked) { - options['complete'] = function() { $menu.css('display', 'block') }; + options['complete'] = () => $menu.css('display', 'block'); $menu.hide().slideDown(options); } else { - options['complete'] = function() { $menu.css('display', 'none') }; + options['complete'] = () => $menu.css('display', 'none'); $menu.show().slideUp(options); } }); // set default menu visibility - function resetState() { - var $menu = $('#main-menu'); - var $mainMenuState = $('#main-menu-state'); - var newWidth = $(window).outerWidth(); + const resetState = function() { + const $menu = $('#main-menu'); + const newWidth = $(window).outerWidth(); if (newWidth!=prevWidth) { if ($(window).outerWidth()<768) { $mainMenuState.prop('checked',false); $menu.hide(); diff --git a/namespacemembers.html b/namespacemembers.html index 2c186f7be..fb4d2bfc6 100644 --- a/namespacemembers.html +++ b/namespacemembers.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Namespace Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
      - + @@ -71,7 +73,7 @@ $(function() {
    @@ -248,7 +250,7 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza
  • parallelogram_perimeter() : math
  • phiFunction() : math
  • pigeonSort() : sorting
    • -
  • Point : ciphers::elliptic_curve_key_exchange, math
    • +
  • Point : ciphers::elliptic_curve_key_exchange, math
  • pop_back() : machine_learning
  • pop_front() : machine_learning
  • power() : math
    • @@ -341,7 +343,7 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza diff --git a/namespacemembers_func.html b/namespacemembers_func.html index 61f3b6b4d..1435e7e47 100644 --- a/namespacemembers_func.html +++ b/namespacemembers_func.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Namespace Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -336,7 +338,7 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR diff --git a/namespacemembers_type.html b/namespacemembers_type.html index 982c09cc0..9c8b2d59d 100644 --- a/namespacemembers_type.html +++ b/namespacemembers_type.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Namespace Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -98,14 +100,14 @@ $(document).ready(function(){initNavTree('namespacemembers_type.html',''); initR
    Here is a list of all documented namespace typedefs with links to the namespaces they belong to:
    diff --git a/namespacemembers_vars.html b/namespacemembers_vars.html index 657ec27cb..e6106b77c 100644 --- a/namespacemembers_vars.html +++ b/namespacemembers_vars.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Namespace Members + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({ - + @@ -71,7 +73,7 @@ $(function() {
    @@ -108,7 +110,7 @@ $(document).ready(function(){initNavTree('namespacemembers_vars.html',''); initR diff --git a/namespaces.html b/namespaces.html index 6f306640b..d0845407a 100644 --- a/namespaces.html +++ b/namespaces.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Namespace List + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -101,13 +103,13 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
    Here is a list of all documented namespaces with brief descriptions:
    -
    [detail level 123]
    +
    [detail level 123]
    - + @@ -115,8 +117,8 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable(); - - + + @@ -126,7 +128,7 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable(); - + @@ -135,9 +137,9 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable(); - + - + @@ -146,18 +148,18 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable(); \mathrm{F}(n+1) + .. + \mathrm{F}(m)\) - + - + - + - + @@ -173,17 +175,17 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable(); - + - + - + @@ -200,31 +202,31 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable(); - - + + - + - + - + - + - + @@ -234,10 +236,10 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm - + - + @@ -247,7 +249,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm - + @@ -274,7 +276,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm diff --git a/navtree.js b/navtree.js index 93dd3d462..884b79b6d 100644 --- a/navtree.js +++ b/navtree.js @@ -22,538 +22,461 @@ @licend The above is the entire license notice for the JavaScript code in this file */ -var navTreeSubIndices = new Array(); -var arrowDown = '▼'; -var arrowRight = '►'; -function getData(varName) -{ - var i = varName.lastIndexOf('/'); - var n = i>=0 ? varName.substring(i+1) : varName; - return eval(n.replace(/\-/g,'_')); -} +function initNavTree(toroot,relpath) { + let navTreeSubIndices = []; + const ARROW_DOWN = '▼'; + const ARROW_RIGHT = '►'; + const NAVPATH_COOKIE_NAME = ''+'navpath'; -function stripPath(uri) -{ - return uri.substring(uri.lastIndexOf('/')+1); -} - -function stripPath2(uri) -{ - var i = uri.lastIndexOf('/'); - var s = uri.substring(i+1); - var m = uri.substring(0,i+1).match(/\/d\w\/d\w\w\/$/); - return m ? uri.substring(i-6) : s; -} - -function hashValue() -{ - return $(location).attr('hash').substring(1).replace(/[^\w\-]/g,''); -} - -function hashUrl() -{ - return '#'+hashValue(); -} - -function pathName() -{ - return $(location).attr('pathname').replace(/[^-A-Za-z0-9+&@#/%?=~_|!:,.;\(\)]/g, ''); -} - -function localStorageSupported() -{ - try { - return 'localStorage' in window && window['localStorage'] !== null && window.localStorage.getItem; + const getData = function(varName) { + const i = varName.lastIndexOf('/'); + const n = i>=0 ? varName.substring(i+1) : varName; + return eval(n.replace(/-/g,'_')); } - catch(e) { - return false; + + const stripPath = function(uri) { + return uri.substring(uri.lastIndexOf('/')+1); } -} -function storeLink(link) -{ - if (!$("#nav-sync").hasClass('sync') && localStorageSupported()) { - window.localStorage.setItem('navpath',link); + const stripPath2 = function(uri) { + const i = uri.lastIndexOf('/'); + const s = uri.substring(i+1); + const m = uri.substring(0,i+1).match(/\/d\w\/d\w\w\/$/); + return m ? uri.substring(i-6) : s; } -} -function deleteLink() -{ - if (localStorageSupported()) { - window.localStorage.setItem('navpath',''); + const hashValue = function() { + return $(location).attr('hash').substring(1).replace(/[^\w-]/g,''); } -} -function cachedLink() -{ - if (localStorageSupported()) { - return window.localStorage.getItem('navpath'); - } else { - return ''; + const hashUrl = function() { + return '#'+hashValue(); } -} -function getScript(scriptName,func) -{ - var head = document.getElementsByTagName("head")[0]; - var script = document.createElement('script'); - script.id = scriptName; - script.type = 'text/javascript'; - script.onload = func; - script.src = scriptName+'.js'; - head.appendChild(script); -} + const pathName = function() { + return $(location).attr('pathname').replace(/[^-A-Za-z0-9+&@#/%?=~_|!:,.;()]/g, ''); + } -function createIndent(o,domNode,node,level) -{ - var level=-1; - var n = node; - while (n.parentNode) { level++; n=n.parentNode; } - if (node.childrenData) { - var imgNode = document.createElement("span"); - imgNode.className = 'arrow'; - imgNode.style.paddingLeft=(16*level).toString()+'px'; - imgNode.innerHTML=arrowRight; - node.plus_img = imgNode; - node.expandToggle = document.createElement("a"); - node.expandToggle.href = "javascript:void(0)"; - node.expandToggle.onclick = function() { - if (node.expanded) { - $(node.getChildrenUL()).slideUp("fast"); - node.plus_img.innerHTML=arrowRight; - node.expanded = false; - } else { - expandNode(o, node, false, true); - } + const storeLink = function(link) { + if (!$("#nav-sync").hasClass('sync')) { + Cookie.writeSetting(NAVPATH_COOKIE_NAME,link,0); } - node.expandToggle.appendChild(imgNode); - domNode.appendChild(node.expandToggle); - } else { - var span = document.createElement("span"); - span.className = 'arrow'; - span.style.width = 16*(level+1)+'px'; - span.innerHTML = ' '; - domNode.appendChild(span); } -} -var animationInProgress = false; - -function gotoAnchor(anchor,aname,updateLocation) -{ - var pos, docContent = $('#doc-content'); - var ancParent = $(anchor.parent()); - if (ancParent.hasClass('memItemLeft') || - ancParent.hasClass('memtitle') || - ancParent.hasClass('fieldname') || - ancParent.hasClass('fieldtype') || - ancParent.is(':header')) - { - pos = ancParent.position().top; - } else if (anchor.position()) { - pos = anchor.position().top; + const deleteLink = function() { + Cookie.eraseSetting(NAVPATH_COOKIE_NAME); } - if (pos) { - var dist = Math.abs(Math.min( - pos-docContent.offset().top, - docContent[0].scrollHeight- - docContent.height()-docContent.scrollTop())); - animationInProgress=true; - docContent.animate({ - scrollTop: pos + docContent.scrollTop() - docContent.offset().top - },Math.max(50,Math.min(500,dist)),function(){ - if (updateLocation) window.location.href=aname; - animationInProgress=false; - }); + + const cachedLink = function() { + return Cookie.readSetting(NAVPATH_COOKIE_NAME,''); } -} -function newNode(o, po, text, link, childrenData, lastNode) -{ - var node = new Object(); - node.children = Array(); - node.childrenData = childrenData; - node.depth = po.depth + 1; - node.relpath = po.relpath; - node.isLast = lastNode; + const getScript = function(scriptName,func) { + const head = document.getElementsByTagName("head")[0]; + const script = document.createElement('script'); + script.id = scriptName; + script.type = 'text/javascript'; + script.onload = func; + script.src = scriptName+'.js'; + head.appendChild(script); + } - node.li = document.createElement("li"); - po.getChildrenUL().appendChild(node.li); - node.parentNode = po; - - node.itemDiv = document.createElement("div"); - node.itemDiv.className = "item"; - - node.labelSpan = document.createElement("span"); - node.labelSpan.className = "label"; - - createIndent(o,node.itemDiv,node,0); - node.itemDiv.appendChild(node.labelSpan); - node.li.appendChild(node.itemDiv); - - var a = document.createElement("a"); - node.labelSpan.appendChild(a); - node.label = document.createTextNode(text); - node.expanded = false; - a.appendChild(node.label); - if (link) { - var url; - if (link.substring(0,1)=='^') { - url = link.substring(1); - link = url; - } else { - url = node.relpath+link; - } - a.className = stripPath(link.replace('#',':')); - if (link.indexOf('#')!=-1) { - var aname = '#'+link.split('#')[1]; - var srcPage = stripPath(pathName()); - var targetPage = stripPath(link.split('#')[0]); - a.href = srcPage!=targetPage ? url : "javascript:void(0)"; - a.onclick = function(){ - storeLink(link); - if (!$(a).parent().parent().hasClass('selected')) - { - $('.item').removeClass('selected'); - $('.item').removeAttr('id'); - $(a).parent().parent().addClass('selected'); - $(a).parent().parent().attr('id','selected'); + const createIndent = function(o,domNode,node) { + let level=-1; + let n = node; + while (n.parentNode) { level++; n=n.parentNode; } + if (node.childrenData) { + const imgNode = document.createElement("span"); + imgNode.className = 'arrow'; + imgNode.style.paddingLeft=(16*level).toString()+'px'; + imgNode.innerHTML=ARROW_RIGHT; + node.plus_img = imgNode; + node.expandToggle = document.createElement("a"); + node.expandToggle.href = "javascript:void(0)"; + node.expandToggle.onclick = function() { + if (node.expanded) { + $(node.getChildrenUL()).slideUp("fast"); + node.plus_img.innerHTML=ARROW_RIGHT; + node.expanded = false; + } else { + expandNode(o, node, false, true); } - var anchor = $(aname); - gotoAnchor(anchor,aname,true); - }; + } + node.expandToggle.appendChild(imgNode); + domNode.appendChild(node.expandToggle); } else { - a.href = url; - a.onclick = function() { storeLink(link); } + let span = document.createElement("span"); + span.className = 'arrow'; + span.style.width = 16*(level+1)+'px'; + span.innerHTML = ' '; + domNode.appendChild(span); } - } else { - if (childrenData != null) - { + } + + let animationInProgress = false; + + const gotoAnchor = function(anchor,aname) { + let pos, docContent = $('#doc-content'); + let ancParent = $(anchor.parent()); + if (ancParent.hasClass('memItemLeft') || ancParent.hasClass('memtitle') || + ancParent.hasClass('fieldname') || ancParent.hasClass('fieldtype') || + ancParent.is(':header')) { + pos = ancParent.position().top; + } else if (anchor.position()) { + pos = anchor.position().top; + } + if (pos) { + const dcOffset = docContent.offset().top; + const dcHeight = docContent.height(); + const dcScrHeight = docContent[0].scrollHeight + const dcScrTop = docContent.scrollTop(); + let dist = Math.abs(Math.min(pos-dcOffset,dcScrHeight-dcHeight-dcScrTop)); + animationInProgress = true; + docContent.animate({ + scrollTop: pos + dcScrTop - dcOffset + },Math.max(50,Math.min(500,dist)),function() { + window.location.href=aname; + animationInProgress=false; + }); + } + } + + const newNode = function(o, po, text, link, childrenData, lastNode) { + const node = { + children : [], + childrenData : childrenData, + depth : po.depth + 1, + relpath : po.relpath, + isLast : lastNode, + li : document.createElement("li"), + parentNode : po, + itemDiv : document.createElement("div"), + labelSpan : document.createElement("span"), + label : document.createTextNode(text), + expanded : false, + childrenUL : null, + getChildrenUL : function() { + if (!this.childrenUL) { + this.childrenUL = document.createElement("ul"); + this.childrenUL.className = "children_ul"; + this.childrenUL.style.display = "none"; + this.li.appendChild(node.childrenUL); + } + return node.childrenUL; + }, + }; + + node.itemDiv.className = "item"; + node.labelSpan.className = "label"; + createIndent(o,node.itemDiv,node); + node.itemDiv.appendChild(node.labelSpan); + node.li.appendChild(node.itemDiv); + + const a = document.createElement("a"); + node.labelSpan.appendChild(a); + po.getChildrenUL().appendChild(node.li); + a.appendChild(node.label); + if (link) { + let url; + if (link.substring(0,1)=='^') { + url = link.substring(1); + link = url; + } else { + url = node.relpath+link; + } + a.className = stripPath(link.replace('#',':')); + if (link.indexOf('#')!=-1) { + const aname = '#'+link.split('#')[1]; + const srcPage = stripPath(pathName()); + const targetPage = stripPath(link.split('#')[0]); + a.href = srcPage!=targetPage ? url : aname; + a.onclick = function() { + storeLink(link); + aPPar = $(a).parent().parent(); + if (!aPPar.hasClass('selected')) { + $('.item').removeClass('selected'); + $('.item').removeAttr('id'); + aPPar.addClass('selected'); + aPPar.attr('id','selected'); + } + const anchor = $(aname); + gotoAnchor(anchor,aname); + }; + } else { + a.href = url; + a.onclick = () => storeLink(link); + } + } else if (childrenData != null) { a.className = "nolink"; a.href = "javascript:void(0)"; a.onclick = node.expandToggle.onclick; } + return node; } - node.childrenUL = null; - node.getChildrenUL = function() { - if (!node.childrenUL) { - node.childrenUL = document.createElement("ul"); - node.childrenUL.className = "children_ul"; - node.childrenUL.style.display = "none"; - node.li.appendChild(node.childrenUL); - } - return node.childrenUL; - }; - - return node; -} - -function showRoot() -{ - var headerHeight = $("#top").height(); - var footerHeight = $("#nav-path").height(); - var windowHeight = $(window).height() - headerHeight - footerHeight; - (function (){ // retry until we can scroll to the selected item - try { - var navtree=$('#nav-tree'); - navtree.scrollTo('#selected',100,{offset:-windowHeight/2}); - } catch (err) { - setTimeout(arguments.callee, 0); - } - })(); -} - -function expandNode(o, node, imm, setFocus) -{ - if (node.childrenData && !node.expanded) { - if (typeof(node.childrenData)==='string') { - var varName = node.childrenData; - getScript(node.relpath+varName,function(){ - node.childrenData = getData(varName); - expandNode(o, node, imm, setFocus); - }); - } else { - if (!node.childrenVisited) { - getNode(o, node); + const showRoot = function() { + const headerHeight = $("#top").height(); + const footerHeight = $("#nav-path").height(); + const windowHeight = $(window).height() - headerHeight - footerHeight; + (function() { // retry until we can scroll to the selected item + try { + const navtree=$('#nav-tree'); + navtree.scrollTo('#selected',100,{offset:-windowHeight/2}); + } catch (err) { + setTimeout(arguments.callee, 0); } - $(node.getChildrenUL()).slideDown("fast"); - node.plus_img.innerHTML = arrowDown; - node.expanded = true; - if (setFocus) { - $(node.expandToggle).focus(); - } - } + })(); } -} -function glowEffect(n,duration) -{ - n.addClass('glow').delay(duration).queue(function(next){ - $(this).removeClass('glow');next(); - }); -} - -function highlightAnchor() -{ - var aname = hashUrl(); - var anchor = $(aname); - if (anchor.parent().attr('class')=='memItemLeft'){ - var rows = $('.memberdecls tr[class$="'+hashValue()+'"]'); - glowEffect(rows.children(),300); // member without details - } else if (anchor.parent().attr('class')=='fieldname'){ - glowEffect(anchor.parent().parent(),1000); // enum value - } else if (anchor.parent().attr('class')=='fieldtype'){ - glowEffect(anchor.parent().parent(),1000); // struct field - } else if (anchor.parent().is(":header")) { - glowEffect(anchor.parent(),1000); // section header - } else { - glowEffect(anchor.next(),1000); // normal member - } -} - -function selectAndHighlight(hash,n) -{ - var a; - if (hash) { - var link=stripPath(pathName())+':'+hash.substring(1); - a=$('.item a[class$="'+link+'"]'); - } - if (a && a.length) { - a.parent().parent().addClass('selected'); - a.parent().parent().attr('id','selected'); - highlightAnchor(); - } else if (n) { - $(n.itemDiv).addClass('selected'); - $(n.itemDiv).attr('id','selected'); - } - var topOffset=5; - if (typeof page_layout!=='undefined' && page_layout==1) { - topOffset+=$('#top').outerHeight(); - } - if ($('#nav-tree-contents .item:first').hasClass('selected')) { - topOffset+=25; - } - $('#nav-sync').css('top',topOffset+'px'); - showRoot(); -} - -function showNode(o, node, index, hash) -{ - if (node && node.childrenData) { - if (typeof(node.childrenData)==='string') { - var varName = node.childrenData; - getScript(node.relpath+varName,function(){ - node.childrenData = getData(varName); - showNode(o,node,index,hash); - }); - } else { - if (!node.childrenVisited) { - getNode(o, node); - } - $(node.getChildrenUL()).css({'display':'block'}); - node.plus_img.innerHTML = arrowDown; - node.expanded = true; - var n = node.children[o.breadcrumbs[index]]; - if (index+11) hash = '#'+parts[1].replace(/[^\w\-]/g,''); - else hash=''; - } - if (hash.match(/^#l\d+$/)) { - var anchor=$('a[name='+hash.substring(1)+']'); - glowEffect(anchor.parent(),1000); // line number - hash=''; // strip line number anchors - } - var url=root+hash; - var i=-1; - while (NAVTREEINDEX[i+1]<=url) i++; - if (i==-1) { i=0; root=NAVTREE[0][1]; } // fallback: show index - if (navTreeSubIndices[i]) { - gotoNode(o,i,root,hash,relpath) - } else { - getScript(relpath+'navtreeindex'+i,function(){ - navTreeSubIndices[i] = eval('NAVTREEINDEX'+i); - if (navTreeSubIndices[i]) { - gotoNode(o,i,root,hash,relpath); + const removeToInsertLater = function(element) { + const parentNode = element.parentNode; + const nextSibling = element.nextSibling; + parentNode.removeChild(element); + return function() { + if (nextSibling) { + parentNode.insertBefore(element, nextSibling); + } else { + parentNode.appendChild(element); } - }); + }; } -} -function showSyncOff(n,relpath) -{ - n.html(''); -} - -function showSyncOn(n,relpath) -{ - n.html(''); -} - -function toggleSyncButton(relpath) -{ - var navSync = $('#nav-sync'); - if (navSync.hasClass('sync')) { - navSync.removeClass('sync'); - showSyncOff(navSync,relpath); - storeLink(stripPath2(pathName())+hashUrl()); - } else { - navSync.addClass('sync'); - showSyncOn(navSync,relpath); - deleteLink(); - } -} - -var loadTriggered = false; -var readyTriggered = false; -var loadObject,loadToRoot,loadUrl,loadRelPath; - -$(window).on('load',function(){ - if (readyTriggered) { // ready first - navTo(loadObject,loadToRoot,loadUrl,loadRelPath); - showRoot(); - } - loadTriggered=true; -}); - -function initNavTree(toroot,relpath) -{ - var o = new Object(); - o.toroot = toroot; - o.node = new Object(); - o.node.li = document.getElementById("nav-tree-contents"); - o.node.childrenData = NAVTREE; - o.node.children = new Array(); - o.node.childrenUL = document.createElement("ul"); - o.node.getChildrenUL = function() { return o.node.childrenUL; }; - o.node.li.appendChild(o.node.childrenUL); - o.node.depth = 0; - o.node.relpath = relpath; - o.node.expanded = false; - o.node.isLast = true; - o.node.plus_img = document.createElement("span"); - o.node.plus_img.className = 'arrow'; - o.node.plus_img.innerHTML = arrowRight; - - if (localStorageSupported()) { - var navSync = $('#nav-sync'); - if (cachedLink()) { - showSyncOff(navSync,relpath); - navSync.removeClass('sync'); - } else { - showSyncOn(navSync,relpath); + const getNode = function(o, po) { + const insertFunction = removeToInsertLater(po.li); + po.childrenVisited = true; + const l = po.childrenData.length-1; + for (let i in po.childrenData) { + const nodeData = po.childrenData[i]; + po.children[i] = newNode(o, po, nodeData[0], nodeData[1], nodeData[2], i==l); } - navSync.click(function(){ toggleSyncButton(relpath); }); + insertFunction(); } - if (loadTriggered) { // load before ready - navTo(o,toroot,hashUrl(),relpath); - showRoot(); - } else { // ready before load - loadObject = o; - loadToRoot = toroot; - loadUrl = hashUrl(); - loadRelPath = relpath; - readyTriggered=true; + const gotoNode = function(o,subIndex,root,hash,relpath) { + const nti = navTreeSubIndices[subIndex][root+hash]; + o.breadcrumbs = $.extend(true, [], nti ? nti : navTreeSubIndices[subIndex][root]); + if (!o.breadcrumbs && root!=NAVTREE[0][1]) { // fallback: show index + navTo(o,NAVTREE[0][1],"",relpath); + $('.item').removeClass('selected'); + $('.item').removeAttr('id'); + } + if (o.breadcrumbs) { + o.breadcrumbs.unshift(0); // add 0 for root node + showNode(o, o.node, 0, hash); + } } - $(window).bind('hashchange', function(){ - if (window.location.hash && window.location.hash.length>1){ - var a; - if ($(location).attr('hash')){ - var clslink=stripPath(pathName())+':'+hashValue(); - a=$('.item a[class$="'+clslink.replace(/1 ? '#'+parts[1].replace(/[^\w-]/g,'') : ''; + } + if (hash.match(/^#l\d+$/)) { + const anchor=$('a[name='+hash.substring(1)+']'); + glowEffect(anchor.parent(),1000); // line number + hash=''; // strip line number anchors + } + const url=root+hash; + let i=-1; + while (NAVTREEINDEX[i+1]<=url) i++; + if (i==-1) { i=0; root=NAVTREE[0][1]; } // fallback: show index + if (navTreeSubIndices[i]) { + gotoNode(o,i,root,hash,relpath) + } else { + getScript(relpath+'navtreeindex'+i,function() { + navTreeSubIndices[i] = eval('NAVTREEINDEX'+i); + if (navTreeSubIndices[i]) { + gotoNode(o,i,root,hash,relpath); + } + }); + } + } + + const showSyncOff = function(n,relpath) { + n.html(''); + } + + const showSyncOn = function(n,relpath) { + n.html(''); + } + + const o = { + toroot : toroot, + node : { + childrenData : NAVTREE, + children : [], + childrenUL : document.createElement("ul"), + getChildrenUL : function() { return this.childrenUL }, + li : document.getElementById("nav-tree-contents"), + depth : 0, + relpath : relpath, + expanded : false, + isLast : true, + plus_img : document.createElement("span"), + }, + }; + o.node.li.appendChild(o.node.childrenUL); + o.node.plus_img.className = 'arrow'; + o.node.plus_img.innerHTML = ARROW_RIGHT; + + const navSync = $('#nav-sync'); + if (cachedLink()) { + showSyncOff(navSync,relpath); + navSync.removeClass('sync'); + } else { + showSyncOn(navSync,relpath); + } + + navSync.click(() => { + const navSync = $('#nav-sync'); + if (navSync.hasClass('sync')) { + navSync.removeClass('sync'); + showSyncOff(navSync,relpath); + storeLink(stripPath2(pathName())+hashUrl()); + } else { + navSync.addClass('sync'); + showSyncOn(navSync,relpath); + deleteLink(); + } + }); + + navTo(o,toroot,hashUrl(),relpath); + showRoot(); + + $(window).bind('hashchange', () => { + if (window.location.hash && window.location.hash.length>1) { + let a; + if ($(location).attr('hash')) { + const clslink=stripPath(pathName())+':'+hashValue(); + a=$('.item a[class$="'+clslink.replace(/ - + Algorithms_in_C++: Related Pages + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
     Na1z26Functions for A1Z26 encryption and decryption implementation
     NabbreviationFunctions for Abbreviation implementation
     NactivationsVarious activation functions used in Neural network
     NatbashFunctions for the Atbash Cipher implementation
     Naystar_searchFunctions for A* Search implementation
     ►NbacktrackingFor vector container
     ►NbacktrackingFor vector container
     Nbase64_encodingFunctions for Base64 Encoding and Decoding implementation
     Nbidirectional_dijkstraFunctions for [Bidirectional Dijkstra Shortest Path] (https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra) algorithm
     Nbit_manipulationFor IO operations
     Nboruvkas_minimum_spanning_treeFunctions for the [Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) implementation
     NcaesarFunctions for Caesar cipher algorithm
     ►NciphersAlgorithms for encryption and decryption
     ►NciphersAlgorithms for encryption and decryption
     Ncircular_linked_listFunctions for the Circular Linked List implementation
     Ncut_rodImplementation of cutting a rod problem
     Ncycle_detectionFunctions for the Floyd's Cycle Detection algorithm
     Ncycle_sortFunctions for Cycle sort algorithm
     ►Ndata_structuresFor IO operations
     ►Ndata_structuresFor IO operations
     Ndepth_first_searchFunctions for Depth First Search algorithm
     Ndisjoint_unionFunctions for Disjoint union implementation
     ►Ndivide_and_conquerFor std::vector
     ►Ndivide_and_conquerFor std::vector
     Ndnf_sortFunctions for the DNF sort implementation
     ►Ndouble_hashingAn implementation of hash table using double hashing algorithm
     ►Ndouble_hashingAn implementation of hash table using double hashing algorithm
     NdpFor std::vector
     Ndynamic_programmingDynamic Programming algorithms
     Nfind_non_repeating_integerFunctions to find the non repeating integer in an array of repeating integers. Single Number
     Ngeometric_distFunctions for the Geometric Distribution algorithm implementation
     ►NgeometryFor std::vector
     ►NgeometryFor std::vector
     Ngram_schmidtFunctions for Gram Schmidt Orthogonalisation Process
     ►NgraphGraph Algorithms
     ►NgraphGraph Algorithms
     Ngraph_coloringFunctions for the Graph Coloring algorithm,
     ►Ngreedy_algorithmsFor std::vector
     ►Ngreedy_algorithmsFor std::vector
     Nground_to_ground_projectile_motionFunctions for the Ground to ground projectile motion equation
     Nhamming_distanceFunctions for Hamming distance implementation
     ►NhashingHashing algorithms
     ►NhashingHashing algorithms
     Nheavy_light_decompositionHeavy light decomposition algorithm
     NhorspoolFunctions for Horspool's algorithm
     Nhouse_robberFunctions for the House Robber algorithm
     NKnapsackImplementation of 0-1 Knapsack problem
     Nknight_tourFunctions for the Knight's tour algorithm
     NlayersThis namespace contains layers used in MLP
     ►Nlinear_probingAn implementation of hash table using linear probing algorithm
     ►Nlinear_probingAn implementation of hash table using linear probing algorithm
     Nlinear_recurrence_matrixFunctions for Linear Recurrence Matrix implementation
     Nlinked_listFunctions for singly linked list algorithm
     Nlist_arrayFunctions for Dynamic Array algorithm
     Nlru_cacheImplementation of the LRU caching algorithm
     ►Nmachine_learningA* search algorithm
     ►Nmachine_learningA* search algorithm
     Nmagic_sequenceFunctions for the Magic sequence implementation
     NmanacherFunctions for Manacher's Algorithm implementation
     ►NmathFor IO operations
     ►NmathFor IO operations
     NMD5Functions for the MD5 algorithm implementation
     Nmedian_searchFunctions for Median search algorithm
     Nmerge_insertionCombined Intersion-Merge sorting algorithm
     Nncr_modulo_pFunctions for nCr modulo p implementation
     Nneural_networkNeural Network or Multilayer Perceptron
     Nnumerical_methodsFor assert
     ►Noperations_on_datastructuresFor std::vector
     ►NothersFor vector
     ►Noperations_on_datastructuresFor std::vector
     ►NothersFor vector
     Npalindrome_partitioningFunctions for Palindrome Partitioning algorithm
     Npancake_sortFunctions for Pancake sort algorithm
     NphysicsFor IO operations
     Npostfix_expressionFunctions for Postfix Expression algorithm
     Nprefix_sum_arrayRange sum queries using prefix-sum-array
     ►NprobabilityProbability algorithms
     ►NprobabilityProbability algorithms
     Nqr_algorithmFunctions to compute QR decomposition of any rectangular matrix
     ►Nquadratic_probingAn implementation of hash table using quadratic probing algorithm
     ►Nquadratic_probingAn implementation of hash table using quadratic probing algorithm
     Nqueue_using_arrayFunctions for [Queue using Array] (https://www.geeksforgeeks.org/array-implementation-of-queue-simple/) implementation
     Nquick_sortFunctions for the Quick sort implementation in C++
     Nradix_sortFunctions for Radix sort algorithm
     Nrandom_pivot_quick_sortFunctions for the Random Pivot Quick Sort implementation
     ►Nrange_queriesAlgorithms and Data Structures that support range queries and updates
     ►Nrange_queriesAlgorithms and Data Structures that support range queries and updates
     Nrat_mazeFunctions for Rat in a Maze algorithm
     Nreverse_binary_treeFunctions for the Reverse a Binary Tree implementation
     Nrunge_kuttaFunctions for Runge Kutta fourth order method
     NsaddlebackFunction for implementing Saddleback Algorithm
     ►NsearchFor std::vector
     ►NsearchFor std::vector
     Nselection_sort_recursiveFunctions for the Selection sort implementation using recursion
     NsetKthBitFunctions for the [From the right, set the Kth bit in the binary representation of N] (https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/) implementation
     NSHAFunctions for the SHA-1 algorithm implementation
     Nsparse_tableFunctions for Implementation of Sparse Table
     Nspirograph
     Nstack_using_queueFunctions for the Stack Using Queue implementation
     ►NstatisticsStatistical algorithms
     ►NstatisticsStatistical algorithms
     ►NstdSTL namespace
     ►NstdSTL namespace
     NstrandFunctions for Strand Sort algorithm
     Nstrassens_multiplicationNamespace for performing strassen's multiplication
     Nstring_searchString search algorithms
     ►NstringsAlgorithms with strings
     ►NstringsAlgorithms with strings
     Nsubarray_sumFunctions for the Subset sum implementation
     Nsublist_searchFunctions for the Sublist Search implementation
     Nsubset_sumFunctions for [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -116,7 +118,7 @@ $(document).ready(function(){initNavTree('pages.html',''); initResizable(); }); diff --git a/resize.js b/resize.js index aaeb6fc0a..6ad2ae80e 100644 --- a/resize.js +++ b/resize.js @@ -22,61 +22,21 @@ @licend The above is the entire license notice for the JavaScript code in this file */ -var once=1; -function initResizable() -{ - var cookie_namespace = 'doxygen'; - var sidenav,navtree,content,header,barWidth=6,desktop_vp=768,titleHeight; - function readSetting(cookie) - { - if (window.chrome) { - var val = localStorage.getItem(cookie_namespace+'_width'); - if (val) return val; - } else { - var myCookie = cookie_namespace+"_"+cookie+"="; - if (document.cookie) { - var index = document.cookie.indexOf(myCookie); - if (index != -1) { - var valStart = index + myCookie.length; - var valEnd = document.cookie.indexOf(";", valStart); - if (valEnd == -1) { - valEnd = document.cookie.length; - } - var val = document.cookie.substring(valStart, valEnd); - return val; - } - } - } - return 250; - } +function initResizable() { + let sidenav,navtree,content,header,footer,barWidth=6; + const RESIZE_COOKIE_NAME = ''+'width'; - function writeSetting(cookie, val) - { - if (window.chrome) { - localStorage.setItem(cookie_namespace+"_width",val); - } else { - var date = new Date(); - date.setTime(date.getTime()+(10*365*24*60*60*1000)); // default expiration is one week - expiration = date.toGMTString(); - document.cookie = cookie_namespace + "_" + cookie + "=" + val + "; SameSite=Lax; expires=" + expiration+"; path=/"; - } - } - - function resizeWidth() - { - var windowWidth = $(window).width() + "px"; - var sidenavWidth = $(sidenav).outerWidth(); + function resizeWidth() { + const sidenavWidth = $(sidenav).outerWidth(); content.css({marginLeft:parseInt(sidenavWidth)+"px"}); if (typeof page_layout!=='undefined' && page_layout==1) { footer.css({marginLeft:parseInt(sidenavWidth)+"px"}); } - writeSetting('width',sidenavWidth-barWidth); + Cookie.writeSetting(RESIZE_COOKIE_NAME,sidenavWidth-barWidth); } - function restoreWidth(navWidth) - { - var windowWidth = $(window).width() + "px"; + function restoreWidth(navWidth) { content.css({marginLeft:parseInt(navWidth)+barWidth+"px"}); if (typeof page_layout!=='undefined' && page_layout==1) { footer.css({marginLeft:parseInt(navWidth)+barWidth+"px"}); @@ -84,12 +44,11 @@ function initResizable() sidenav.css({width:navWidth + "px"}); } - function resizeHeight() - { - var headerHeight = header.outerHeight(); - var footerHeight = footer.outerHeight(); - var windowHeight = $(window).height(); - var contentHeight,navtreeHeight,sideNavHeight; + function resizeHeight() { + const headerHeight = header.outerHeight(); + const footerHeight = footer.outerHeight(); + const windowHeight = $(window).height(); + let contentHeight,navtreeHeight,sideNavHeight; if (typeof page_layout==='undefined' || page_layout==0) { /* DISABLE_INDEX=NO */ contentHeight = windowHeight - headerHeight - footerHeight; navtreeHeight = contentHeight; @@ -107,19 +66,17 @@ function initResizable() } } - function collapseExpand() - { - var newWidth; + function collapseExpand() { + let newWidth; if (sidenav.width()>0) { newWidth=0; - } - else { - var width = readSetting('width'); + } else { + const width = Cookie.readSetting(RESIZE_COOKIE_NAME,250); newWidth = (width>250 && width<$(window).width()) ? width : 250; } restoreWidth(newWidth); - var sidenavWidth = $(sidenav).outerWidth(); - writeSetting('width',sidenavWidth-barWidth); + const sidenavWidth = $(sidenav).outerWidth(); + Cookie.writeSetting(RESIZE_COOKIE_NAME,sidenavWidth-barWidth); } header = $("#top"); @@ -127,29 +84,26 @@ function initResizable() content = $("#doc-content"); navtree = $("#nav-tree"); footer = $("#nav-path"); - $(".side-nav-resizable").resizable({resize: function(e, ui) { resizeWidth(); } }); + $(".side-nav-resizable").resizable({resize: () => resizeWidth() }); $(sidenav).resizable({ minWidth: 0 }); - $(window).resize(function() { resizeHeight(); }); - var device = navigator.userAgent.toLowerCase(); - var touch_device = device.match(/(iphone|ipod|ipad|android)/); + $(window).resize(() => resizeHeight()); + const device = navigator.userAgent.toLowerCase(); + const touch_device = device.match(/(iphone|ipod|ipad|android)/); if (touch_device) { /* wider split bar for touch only devices */ $(sidenav).css({ paddingRight:'20px' }); $('.ui-resizable-e').css({ width:'20px' }); $('#nav-sync').css({ right:'34px' }); barWidth=20; } - var width = readSetting('width'); + const width = Cookie.readSetting(RESIZE_COOKIE_NAME,250); if (width) { restoreWidth(width); } else { resizeWidth(); } resizeHeight(); - var url = location.href; - var i=url.indexOf("#"); + const url = location.href; + const i=url.indexOf("#"); if (i>=0) window.location.hash=url.substr(i); - var _preventDefault = function(evt) { evt.preventDefault(); }; + const _preventDefault = (evt) => evt.preventDefault(); $("#splitbar").bind("dragstart", _preventDefault).bind("selectstart", _preventDefault); - if (once) { - $(".ui-resizable-handle").dblclick(collapseExpand); - once=0 - } + $(".ui-resizable-handle").dblclick(collapseExpand); $(window).on('load',resizeHeight); } /* @license-end */ diff --git a/search/all_10.js b/search/all_10.js index 53d3a3fb7..ff8651357 100644 --- a/search/all_10.js +++ b/search/all_10.js @@ -6,21 +6,21 @@ var searchData= ['kadane_3',['kadane',['../d6/d74/namespacekadane.html',1,'']]], ['kadane2_2ecpp_4',['kadane2.cpp',['../db/dca/kadane2_8cpp.html',1,'']]], ['kadanes3_2ecpp_5',['kadanes3.cpp',['../de/dcd/kadanes3_8cpp.html',1,'']]], - ['karatsuba_5falgorithm_6',['karatsuba_algorithm',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#a7a890d2f26855ada3b9f1d43aec70a86',1,'divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm()'],['../de/d41/namespacekaratsuba__algorithm.html',1,'karatsuba_algorithm']]], + ['karatsuba_5falgorithm_6',['karatsuba_algorithm',['../de/d41/namespacekaratsuba__algorithm.html',1,'karatsuba_algorithm'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#a7a890d2f26855ada3b9f1d43aec70a86',1,'divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm()']]], ['karatsuba_5falgorithm_5ffor_5ffast_5fmultiplication_2ecpp_7',['karatsuba_algorithm_for_fast_multiplication.cpp',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html',1,'']]], ['kelvin_5fto_5fcelsius_8',['kelvin_to_celsius',['../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec',1,'others']]], ['kelvin_5fto_5fcelsius_2ecpp_9',['kelvin_to_celsius.cpp',['../db/d6b/kelvin__to__celsius_8cpp.html',1,'']]], - ['key_10',['key',['../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248',1,'double_hashing::Entry::key'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04',1,'data_structures::treap::Treap::key'],['../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c',1,'list::key'],['../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a',1,'linear_probing::Entry::key'],['../d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68',1,'data_structures::Node::key'],['../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8',1,'quadratic_probing::Entry::key']]], - ['key_5fcomp_11',['key_comp',['http://en.cppreference.com/w/cpp/container/map/key_comp.html',0,'std::map::key_comp()'],['http://en.cppreference.com/w/cpp/container/set/key_comp.html',0,'std::set::key_comp()'],['http://en.cppreference.com/w/cpp/container/multiset/key_comp.html',0,'std::multiset::key_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/key_comp.html',0,'std::multimap::key_comp()']]], - ['key_5feq_12',['key_eq',['http://en.cppreference.com/w/cpp/container/unordered_set/key_eq.html',0,'std::unordered_set::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/key_eq.html',0,'std::unordered_multimap::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/key_eq.html',0,'std::unordered_multiset::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_map/key_eq.html',0,'std::unordered_map::key_eq()']]], + ['key_10',['key',['../d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68',1,'data_structures::Node::key'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04',1,'data_structures::treap::Treap::key'],['../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248',1,'double_hashing::Entry::key'],['../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a',1,'linear_probing::Entry::key'],['../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8',1,'quadratic_probing::Entry::key'],['../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c',1,'list::key']]], + ['key_5fcomp_11',['key_comp',['http://en.cppreference.com/w/cpp/container/multiset/key_comp.html',0,'std::multiset::key_comp()'],['http://en.cppreference.com/w/cpp/container/set/key_comp.html',0,'std::set::key_comp()'],['http://en.cppreference.com/w/cpp/container/map/key_comp.html',0,'std::map::key_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/key_comp.html',0,'std::multimap::key_comp()']]], + ['key_5feq_12',['key_eq',['http://en.cppreference.com/w/cpp/container/unordered_map/key_eq.html',0,'std::unordered_map::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/key_eq.html',0,'std::unordered_multimap::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/key_eq.html',0,'std::unordered_multiset::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_set/key_eq.html',0,'std::unordered_set::key_eq()']]], ['kill_5fdependency_13',['kill_dependency',['http://en.cppreference.com/w/cpp/atomic/kill_dependency.html',0,'std']]], ['kilo_14',['kilo',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], ['kmp_15',['kmp',['../d9/d03/namespacestring__search.html#a26a58225ce7d3fa9d4c2f5349a65ed93',1,'string_search']]], ['knapsack_16',['Knapsack',['../d7/daf/namespace_knapsack.html',1,'']]], ['knight_5ftour_17',['knight_tour',['../d1/db6/namespaceknight__tour.html',1,'']]], ['knight_5ftour_2ecpp_18',['knight_tour.cpp',['../d1/d2a/knight__tour_8cpp.html',1,'']]], - ['knn_19',['knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html',1,'machine_learning::k_nearest_neighbors::Knn'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b',1,'machine_learning::k_nearest_neighbors::Knn::Knn(const Knn &model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e',1,'machine_learning::k_nearest_neighbors::Knn::Knn(Knn &&)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200',1,'machine_learning::k_nearest_neighbors::Knn::Knn(std::vector< std::vector< double > > &X, std::vector< int > &Y)']]], - ['knuth_5fb_20',['knuth_b',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::knuth_b::knuth_b()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std::knuth_b']]], + ['knn_19',['Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html',1,'machine_learning::k_nearest_neighbors::Knn'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200',1,'machine_learning::k_nearest_neighbors::Knn::Knn(std::vector< std::vector< double > > &X, std::vector< int > &Y)'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b',1,'machine_learning::k_nearest_neighbors::Knn::Knn(const Knn &model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e',1,'machine_learning::k_nearest_neighbors::Knn::Knn(Knn &&)=default']]], + ['knuth_5fb_20',['knuth_b',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std::knuth_b'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::knuth_b::knuth_b()']]], ['knuth_5fmorris_5fpratt_2ecpp_21',['knuth_morris_pratt.cpp',['../de/d6a/knuth__morris__pratt_8cpp.html',1,'']]], ['kohonen_5fsom_22',['kohonen_som',['../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576',1,'machine_learning']]], ['kohonen_5fsom_5ftopology_2ecpp_23',['kohonen_som_topology.cpp',['../d4/def/kohonen__som__topology_8cpp.html',1,'']]], diff --git a/search/all_11.js b/search/all_11.js index 75c7f0304..3acc6de3e 100644 --- a/search/all_11.js +++ b/search/all_11.js @@ -5,7 +5,7 @@ var searchData= ['labs_2',['labs',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]], ['lambda_3',['lambda',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/lambda.html',0,'std::exponential_distribution']]], ['large_5ffactorial_2ecpp_4',['large_factorial.cpp',['../d6/d9d/large__factorial_8cpp.html',1,'']]], - ['large_5fnumber_5',['large_number',['../db/d82/classlarge__number.html',1,'large_number'],['../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f',1,'large_number::large_number(std::vector< unsigned char > &vec)'],['../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a',1,'large_number::large_number(int n)'],['../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872',1,'large_number::large_number(const large_number &a)'],['../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337',1,'large_number::large_number()']]], + ['large_5fnumber_5',['large_number',['../db/d82/classlarge__number.html',1,'large_number'],['../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337',1,'large_number::large_number()'],['../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a',1,'large_number::large_number(int n)'],['../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872',1,'large_number::large_number(const large_number &a)'],['../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f',1,'large_number::large_number(std::vector< unsigned char > &vec)']]], ['large_5fnumber_2eh_6',['large_number.h',['../d4/d86/large__number_8h.html',1,'']]], ['largest_5fpower_2ecpp_7',['largest_power.cpp',['../d5/d7a/largest__power_8cpp.html',1,'']]], ['largestpower_8',['largestPower',['../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f',1,'math']]], @@ -22,85 +22,89 @@ var searchData= ['learning_19',['Machine Learning',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58',1,'']]], ['learning_20algorithms_20',['Machine Learning Algorithms',['../d9/d66/group__machine__learning.html',1,'']]], ['least_5fcommon_5fmultiple_2ecpp_21',['least_common_multiple.cpp',['../d4/d21/least__common__multiple_8cpp.html',1,'']]], - ['left_22',['left',['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e',1,'others::iterative_tree_traversals::Node::left'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3',1,'others::recursive_tree_traversals::Node::left'],['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::left()'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352',1,'operations_on_datastructures::reverse_binary_tree::Node::left'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::left'],['../dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788',1,'binary_search_tree::bst_node::left'],['../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca',1,'MinHeap::left()']]], - ['leftrotate_23',['leftrotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e',1,'data_structures::tree_234::Tree234::LeftRotate()'],['../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6',1,'leftRotate(): avltree.cpp']]], - ['leftrotate32bits_24',['leftrotate32bits',['../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d',1,'hashing::md5::leftRotate32bits()'],['../d8/d7a/sha1_8cpp.html#acf6bd970f29a68702bdbdfe8338e45e0',1,'hashing::sha1::leftRotate32bits()']]], - ['lenghtline_25',['LenghtLine',['../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a',1,'smallest_circle.cpp']]], - ['length_26',['length',['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::csub_match::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::ssub_match::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::smatch::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::length()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/length.html',0,'std::regex_traits::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wssub_match::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wcmatch::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::cmatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::sub_match::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wsmatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wcsub_match::length()'],['http://en.cppreference.com/w/cpp/string/char_traits/length.html',0,'std::char_traits::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::match_results::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::length()']]], - ['length_5ferror_27',['length_error',['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std::length_error'],['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std::length_error::length_error()']]], - ['less_28',['less',['http://en.cppreference.com/w/cpp/utility/functional/less.html',0,'std']]], - ['less_5fequal_29',['less_equal',['http://en.cppreference.com/w/cpp/utility/functional/less_equal.html',0,'std']]], - ['level_30',['level',['../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3',1,'graph::RootedTree::level'],['../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650',1,'data_structures::SkipList::level']]], - ['levelorder_31',['levelOrder',['../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59',1,'avltree.cpp']]], - ['lexicographical_5fcompare_32',['lexicographical_compare',['http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare.html',0,'std']]], - ['lgamma_33',['lgamma',['http://en.cppreference.com/w/cpp/numeric/math/lgamma.html',0,'std']]], - ['lift_34',['lift',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3',1,'range_queries::heavy_light_decomposition::Tree']]], - ['lims_35',['LIMS',['../de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.cpp']]], - ['line_5fsegment_5fintersection_2ecpp_36',['line_segment_intersection.cpp',['../d8/d6c/line__segment__intersection_8cpp.html',1,'']]], - ['linear_5fcongruential_5fengine_37',['linear_congruential_engine',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::linear_congruential_engine::linear_congruential_engine()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std::linear_congruential_engine']]], - ['linear_5fprobing_38',['linear_probing',['../d8/d89/namespacelinear__probing.html',1,'']]], - ['linear_5fprobing_5fhash_5ftable_2ecpp_39',['linear_probing_hash_table.cpp',['../d1/dc7/linear__probing__hash__table_8cpp.html',1,'']]], - ['linear_5frecurrence_5fmatrix_40',['linear_recurrence_matrix',['../d9/dd1/namespacelinear__recurrence__matrix.html',1,'']]], - ['linear_5fsearch_2ecpp_41',['linear_search.cpp',['../d9/d02/linear__search_8cpp.html',1,'']]], - ['linearprobe_42',['linearProbe',['../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746',1,'linear_probing']]], - ['linearsearch_43',['linearsearch',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9',1,'data_structures::list_array::list::LinearSearch()'],['../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84',1,'LinearSearch(): linear_search.cpp']]], - ['link_44',['link',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html',1,'data_structures::linked_list::link'],['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb',1,'data_structures::linked_list::link::link()'],['../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6',1,'link: hash_search.cpp']]], - ['linked_5flist_45',['linked_list',['../d3/db0/namespacelinked__list.html',1,'']]], - ['linked_5flist_2ecpp_46',['linked_list.cpp',['../da/dc3/linked__list_8cpp.html',1,'']]], - ['linkedlist_47',['linkedlist',['../d0/dff/structlinkedlist.html',1,'']]], - ['linkedlist_5fimplentation_5fusingarray_2ecpp_48',['linkedlist_implentation_usingarray.cpp',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html',1,'']]], - ['lis_49',['LIS',['../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079',1,'dynamic_programming']]], - ['list_50',['list',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac681c278055081ac11decb6060b300de',1,'data_structures::linked_list::list::list()'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html',1,'data_structures::list_array::list< N >'],['http://en.cppreference.com/w/cpp/container/list.html',0,'std::list< T >'],['http://en.cppreference.com/w/cpp/container/list/list.html',0,'std::list::list()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826',1,'data_structures::linked_list::list::list()'],['../d8/d10/structlist.html',1,'list'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html',1,'data_structures::linked_list::list'],['../dd/da0/todo.html',1,'Todo List']]], - ['list_3c_20int_20_3e_51',['list< int >',['http://en.cppreference.com/w/cpp/container/list.html',0,'std']]], - ['list_3c_20uint64_5ft_20_3e_52',['list< uint64_t >',['http://en.cppreference.com/w/cpp/container/list.html',0,'std']]], - ['list_5farray_53',['list_array',['../d9/d27/namespacelist__array.html',1,'']]], - ['list_5farray_2ecpp_54',['list_array.cpp',['../d7/d00/list__array_8cpp.html',1,'']]], - ['listnode_55',['listnode',['../d7/da4/struct_list_node.html#a3cfee2eb667c332dc32595208164ef0a',1,'ListNode::ListNode()=default'],['../d7/da4/struct_list_node.html#afc97c5b9d2e7cc82d0718245688f6ff9',1,'ListNode::ListNode(int x, ListNode *next)'],['../d7/da4/struct_list_node.html#aaad9b553e2f936726f5b35ff2734125d',1,'ListNode::ListNode(int x)'],['../d7/da4/struct_list_node.html',1,'ListNode']]], - ['ll_56',['ll',['../d7/d35/matrix__exponentiation_8cpp.html#ae1d1ec9482079231e898236e2b23c9ba',1,'matrix_exponentiation.cpp']]], - ['llabs_57',['llabs',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]], - ['llrint_58',['llrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], - ['llround_59',['llround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], - ['load_60',['load',['http://en.cppreference.com/w/cpp/atomic/atomic/load.html',0,'std::atomic']]], - ['load_5ffactor_61',['load_factor',['http://en.cppreference.com/w/cpp/container/unordered_set/load_factor.html',0,'std::unordered_set::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/load_factor.html',0,'std::unordered_multiset::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/load_factor.html',0,'std::unordered_multimap::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_map/load_factor.html',0,'std::unordered_map::load_factor()']]], - ['load_5fmodel_62',['load_model',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58ed20abf6ce3744535bd8b5bb9e741b',1,'machine_learning::neural_network::NeuralNetwork']]], - ['locale_63',['locale',['http://en.cppreference.com/w/cpp/locale/locale/locale.html',0,'std::locale::locale()'],['http://en.cppreference.com/w/cpp/locale/locale.html',0,'std::locale']]], - ['localeconv_64',['localeconv',['http://en.cppreference.com/w/cpp/locale/localeconv.html',0,'std']]], - ['locally_65',['Building Locally',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37',1,'']]], - ['localtime_66',['localtime',['http://en.cppreference.com/w/cpp/chrono/c/localtime.html',0,'std']]], - ['lock_67',['lock',['http://en.cppreference.com/w/cpp/memory/weak_ptr/lock.html',0,'std::weak_ptr::lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/lock.html',0,'std::mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/lock.html',0,'std::timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/lock.html',0,'std::unique_lock::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/lock.html',0,'std::recursive_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/lock.html',0,'std::recursive_timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/lock.html',0,'std::shared_lock::lock()'],['http://en.cppreference.com/w/cpp/thread/lock.html',0,'std::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock.html',0,'std::shared_timed_mutex::lock()']]], - ['lock_5fguard_68',['lock_guard',['http://en.cppreference.com/w/cpp/thread/lock_guard/lock_guard.html',0,'std::lock_guard::lock_guard()'],['http://en.cppreference.com/w/cpp/thread/lock_guard.html',0,'std::lock_guard< T >']]], - ['lock_5fshared_69',['lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock_shared.html',0,'std::shared_timed_mutex']]], - ['log_70',['log',['http://en.cppreference.com/w/cpp/numeric/math/log.html',0,'std::log()'],['../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058',1,'lru_tests::log()'],['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3',1,'data_structures::sparse_table::Sparse_table::LOG'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)']]], - ['log10_71',['log10',['http://en.cppreference.com/w/cpp/numeric/math/log10.html',0,'std']]], - ['log1p_72',['log1p',['http://en.cppreference.com/w/cpp/numeric/math/log1p.html',0,'std']]], - ['logb_73',['logb',['http://en.cppreference.com/w/cpp/numeric/math/logb.html',0,'std']]], - ['logic_74',['Logic',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]], - ['logic_5ferror_75',['logic_error',['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std::logic_error::logic_error()'],['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std::logic_error']]], - ['logical_5fand_76',['logical_and',['http://en.cppreference.com/w/cpp/utility/functional/logical_and.html',0,'std']]], - ['logical_5fnot_77',['logical_not',['http://en.cppreference.com/w/cpp/utility/functional/logical_not.html',0,'std']]], - ['logical_5for_78',['logical_or',['http://en.cppreference.com/w/cpp/utility/functional/logical_or.html',0,'std']]], - ['lognormal_5fdistribution_79',['lognormal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution.html',0,'std::lognormal_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/lognormal_distribution.html',0,'std::lognormal_distribution::lognormal_distribution()']]], - ['longest_5fcommon_5fstring_2ecpp_80',['longest_common_string.cpp',['../da/d0d/longest__common__string_8cpp.html',1,'']]], - ['longest_5fcommon_5fstring_5flength_81',['longest_common_string_length',['../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5',1,'longest_common_string.cpp']]], - ['longest_5fincreasing_5fsubsequence_2ecpp_82',['longest_increasing_subsequence.cpp',['../d7/d57/longest__increasing__subsequence_8cpp.html',1,'']]], - ['longest_5fpalindromic_5fsubsequence_2ecpp_83',['longest_palindromic_subsequence.cpp',['../d0/d77/longest__palindromic__subsequence_8cpp.html',1,'']]], - ['longjmp_84',['longjmp',['http://en.cppreference.com/w/cpp/utility/program/longjmp.html',0,'std']]], - ['lookup_5fclassname_85',['lookup_classname',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_classname.html',0,'std::regex_traits']]], - ['lookup_5fcollatename_86',['lookup_collatename',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_collatename.html',0,'std::regex_traits']]], - ['lower_87',['lower',['../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9',1,'lower(): text_search.cpp'],['../d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1',1,'uint256_t::lower()'],['../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd',1,'uint128_t::lower()']]], - ['lower_5fbound_88',['lower_bound',['http://en.cppreference.com/w/cpp/container/set/lower_bound.html',0,'std::set::lower_bound()'],['http://en.cppreference.com/w/cpp/algorithm/lower_bound.html',0,'std::lower_bound()'],['http://en.cppreference.com/w/cpp/container/multiset/lower_bound.html',0,'std::multiset::lower_bound()'],['http://en.cppreference.com/w/cpp/container/map/lower_bound.html',0,'std::map::lower_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/lower_bound.html',0,'std::multimap::lower_bound()']]], - ['lowest_89',['lowest',['http://en.cppreference.com/w/cpp/types/numeric_limits/lowest.html',0,'std::numeric_limits']]], - ['lowest_5fcommon_5fancestor_90',['lowest_common_ancestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488',1,'graph::LowestCommonAncestor']]], - ['lowest_5fcommon_5fancestor_2ecpp_91',['lowest_common_ancestor.cpp',['../de/dde/lowest__common__ancestor_8cpp.html',1,'']]], - ['lowestcommonancestor_92',['lowestcommonancestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html',1,'graph::LowestCommonAncestor'],['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93',1,'graph::LowestCommonAncestor::LowestCommonAncestor()']]], - ['lps_93',['lps',['../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412',1,'dynamic_programming']]], - ['lrint_94',['lrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], - ['lround_95',['lround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], - ['lru_5fcache_96',['lru_cache',['../d8/dcd/namespacelru__cache.html',1,'']]], - ['lru_5fcache_2ecpp_97',['lru_cache.cpp',['../d3/db3/lru__cache_8cpp.html',1,'']]], - ['lrucache_98',['lrucache',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4',1,'others::lru_cache::LRUCache::LRUCache()'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html',1,'others::lru_cache::LRUCache']]], - ['lt_99',['lt',['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits']]], - ['lu_5fdecompose_2ecpp_100',['lu_decompose.cpp',['../dd/d65/lu__decompose_8cpp.html',1,'']]], - ['lu_5fdecomposition_101',['lu_decomposition',['../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509',1,'lu_decomposition.h']]], - ['lu_5fdecomposition_2eh_102',['lu_decomposition.h',['../d1/dbe/lu__decomposition_8h.html',1,'']]] + ['left_22',['left',['../dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788',1,'binary_search_tree::bst_node::left'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::left'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352',1,'operations_on_datastructures::reverse_binary_tree::Node::left'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e',1,'others::iterative_tree_traversals::Node::left'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3',1,'others::recursive_tree_traversals::Node::left'],['../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca',1,'MinHeap::left()'],['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::left()']]], + ['leftrotate_23',['LeftRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e',1,'data_structures::tree_234::Tree234']]], + ['leftrotate_24',['leftRotate',['../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6',1,'avltree.cpp']]], + ['leftrotate32bits_25',['leftRotate32bits',['../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d',1,'hashing::md5::leftRotate32bits()'],['../d8/d7a/sha1_8cpp.html#acf6bd970f29a68702bdbdfe8338e45e0',1,'hashing::sha1::leftRotate32bits()']]], + ['lenghtline_26',['LenghtLine',['../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a',1,'smallest_circle.cpp']]], + ['length_27',['length',['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::match_results::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::length()'],['http://en.cppreference.com/w/cpp/string/char_traits/length.html',0,'std::char_traits::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wsmatch::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wcsub_match::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::smatch::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wcmatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wssub_match::length()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/length.html',0,'std::regex_traits::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::csub_match::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::ssub_match::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::cmatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::sub_match::length()']]], + ['length_5ferror_28',['length_error',['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std::length_error'],['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std::length_error::length_error()']]], + ['less_29',['less',['http://en.cppreference.com/w/cpp/utility/functional/less.html',0,'std']]], + ['less_5fequal_30',['less_equal',['http://en.cppreference.com/w/cpp/utility/functional/less_equal.html',0,'std']]], + ['level_31',['level',['../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650',1,'data_structures::SkipList::level'],['../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3',1,'graph::RootedTree::level']]], + ['levelorder_32',['levelOrder',['../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59',1,'avltree.cpp']]], + ['lexicographical_5fcompare_33',['lexicographical_compare',['http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare.html',0,'std']]], + ['lgamma_34',['lgamma',['http://en.cppreference.com/w/cpp/numeric/math/lgamma.html',0,'std']]], + ['lift_35',['lift',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3',1,'range_queries::heavy_light_decomposition::Tree']]], + ['lims_36',['LIMS',['../de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.cpp']]], + ['line_5fsegment_5fintersection_2ecpp_37',['line_segment_intersection.cpp',['../d8/d6c/line__segment__intersection_8cpp.html',1,'']]], + ['linear_5fcongruential_5fengine_38',['linear_congruential_engine',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std::linear_congruential_engine'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::linear_congruential_engine::linear_congruential_engine()']]], + ['linear_5fprobing_39',['linear_probing',['../d8/d89/namespacelinear__probing.html',1,'']]], + ['linear_5fprobing_5fhash_5ftable_2ecpp_40',['linear_probing_hash_table.cpp',['../d1/dc7/linear__probing__hash__table_8cpp.html',1,'']]], + ['linear_5frecurrence_5fmatrix_41',['linear_recurrence_matrix',['../d9/dd1/namespacelinear__recurrence__matrix.html',1,'']]], + ['linear_5fsearch_2ecpp_42',['linear_search.cpp',['../d9/d02/linear__search_8cpp.html',1,'']]], + ['linearprobe_43',['linearProbe',['../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746',1,'linear_probing']]], + ['linearsearch_44',['LinearSearch',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9',1,'data_structures::list_array::list::LinearSearch()'],['../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84',1,'LinearSearch(): linear_search.cpp']]], + ['link_45',['link',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html',1,'data_structures::linked_list::link'],['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb',1,'data_structures::linked_list::link::link()'],['../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6',1,'link: hash_search.cpp']]], + ['linked_5flist_46',['linked_list',['../d3/db0/namespacelinked__list.html',1,'']]], + ['linked_5flist_2ecpp_47',['linked_list.cpp',['../da/dc3/linked__list_8cpp.html',1,'']]], + ['linkedlist_48',['linkedlist',['../d0/dff/structlinkedlist.html',1,'']]], + ['linkedlist_5fimplentation_5fusingarray_2ecpp_49',['linkedlist_implentation_usingarray.cpp',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html',1,'']]], + ['lis_50',['LIS',['../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079',1,'dynamic_programming']]], + ['list_51',['list',['../d1/def/classdata__structures_1_1linked__list_1_1list.html',1,'data_structures::linked_list::list'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html',1,'data_structures::list_array::list< N >'],['../d8/d10/structlist.html',1,'list'],['http://en.cppreference.com/w/cpp/container/list.html',0,'std::list< T >'],['http://en.cppreference.com/w/cpp/container/list/list.html',0,'std::list::list()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826',1,'data_structures::linked_list::list::list()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac681c278055081ac11decb6060b300de',1,'data_structures::linked_list::list::list(const list &other)']]], + ['list_52',['Todo List',['../dd/da0/todo.html',1,'']]], + ['list_3c_20int_20_3e_53',['list< int >',['http://en.cppreference.com/w/cpp/container/list.html',0,'std']]], + ['list_3c_20uint64_5ft_20_3e_54',['list< uint64_t >',['http://en.cppreference.com/w/cpp/container/list.html',0,'std']]], + ['list_5farray_55',['list_array',['../d9/d27/namespacelist__array.html',1,'']]], + ['list_5farray_2ecpp_56',['list_array.cpp',['../d7/d00/list__array_8cpp.html',1,'']]], + ['listnode_57',['ListNode',['../d7/da4/struct_list_node.html',1,'ListNode'],['../d7/da4/struct_list_node.html#a3cfee2eb667c332dc32595208164ef0a',1,'ListNode::ListNode()=default'],['../d7/da4/struct_list_node.html#aaad9b553e2f936726f5b35ff2734125d',1,'ListNode::ListNode(int x)'],['../d7/da4/struct_list_node.html#afc97c5b9d2e7cc82d0718245688f6ff9',1,'ListNode::ListNode(int x, ListNode *next)']]], + ['ll_58',['ll',['../d7/d35/matrix__exponentiation_8cpp.html#ae1d1ec9482079231e898236e2b23c9ba',1,'matrix_exponentiation.cpp']]], + ['llabs_59',['llabs',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]], + ['llrint_60',['llrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], + ['llround_61',['llround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], + ['load_62',['load',['http://en.cppreference.com/w/cpp/atomic/atomic/load.html',0,'std::atomic']]], + ['load_5ffactor_63',['load_factor',['http://en.cppreference.com/w/cpp/container/unordered_map/load_factor.html',0,'std::unordered_map::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/load_factor.html',0,'std::unordered_multimap::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/load_factor.html',0,'std::unordered_multiset::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_set/load_factor.html',0,'std::unordered_set::load_factor()']]], + ['load_5fmodel_64',['load_model',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58ed20abf6ce3744535bd8b5bb9e741b',1,'machine_learning::neural_network::NeuralNetwork']]], + ['locale_65',['locale',['http://en.cppreference.com/w/cpp/locale/locale.html',0,'std::locale'],['http://en.cppreference.com/w/cpp/locale/locale/locale.html',0,'std::locale::locale()']]], + ['localeconv_66',['localeconv',['http://en.cppreference.com/w/cpp/locale/localeconv.html',0,'std']]], + ['locally_67',['Building Locally',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37',1,'']]], + ['localtime_68',['localtime',['http://en.cppreference.com/w/cpp/chrono/c/localtime.html',0,'std']]], + ['lock_69',['lock',['http://en.cppreference.com/w/cpp/memory/weak_ptr/lock.html',0,'std::weak_ptr::lock()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/lock.html',0,'std::unique_lock::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/lock.html',0,'std::recursive_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/lock.html',0,'std::recursive_timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/lock.html',0,'std::shared_lock::lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/lock.html',0,'std::timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/lock.html',0,'std::mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock.html',0,'std::shared_timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/lock.html',0,'std::lock(T... args)']]], + ['lock_5fguard_70',['lock_guard',['http://en.cppreference.com/w/cpp/thread/lock_guard.html',0,'std::lock_guard< T >'],['http://en.cppreference.com/w/cpp/thread/lock_guard/lock_guard.html',0,'std::lock_guard::lock_guard()']]], + ['lock_5fshared_71',['lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock_shared.html',0,'std::shared_timed_mutex']]], + ['log_72',['log',['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)']]], + ['log_73',['LOG',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3',1,'data_structures::sparse_table::Sparse_table']]], + ['log_74',['log',['http://en.cppreference.com/w/cpp/numeric/math/log.html',0,'std::log()'],['../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058',1,'lru_tests::log()']]], + ['log10_75',['log10',['http://en.cppreference.com/w/cpp/numeric/math/log10.html',0,'std']]], + ['log1p_76',['log1p',['http://en.cppreference.com/w/cpp/numeric/math/log1p.html',0,'std']]], + ['logb_77',['logb',['http://en.cppreference.com/w/cpp/numeric/math/logb.html',0,'std']]], + ['logic_78',['Logic',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]], + ['logic_5ferror_79',['logic_error',['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std::logic_error'],['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std::logic_error::logic_error()']]], + ['logical_5fand_80',['logical_and',['http://en.cppreference.com/w/cpp/utility/functional/logical_and.html',0,'std']]], + ['logical_5fnot_81',['logical_not',['http://en.cppreference.com/w/cpp/utility/functional/logical_not.html',0,'std']]], + ['logical_5for_82',['logical_or',['http://en.cppreference.com/w/cpp/utility/functional/logical_or.html',0,'std']]], + ['lognormal_5fdistribution_83',['lognormal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution.html',0,'std::lognormal_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/lognormal_distribution.html',0,'std::lognormal_distribution::lognormal_distribution()']]], + ['longest_5fcommon_5fstring_2ecpp_84',['longest_common_string.cpp',['../da/d0d/longest__common__string_8cpp.html',1,'']]], + ['longest_5fcommon_5fstring_5flength_85',['longest_common_string_length',['../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5',1,'longest_common_string.cpp']]], + ['longest_5fincreasing_5fsubsequence_2ecpp_86',['longest_increasing_subsequence.cpp',['../d7/d57/longest__increasing__subsequence_8cpp.html',1,'']]], + ['longest_5fpalindromic_5fsubsequence_2ecpp_87',['longest_palindromic_subsequence.cpp',['../d0/d77/longest__palindromic__subsequence_8cpp.html',1,'']]], + ['longjmp_88',['longjmp',['http://en.cppreference.com/w/cpp/utility/program/longjmp.html',0,'std']]], + ['lookup_5fclassname_89',['lookup_classname',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_classname.html',0,'std::regex_traits']]], + ['lookup_5fcollatename_90',['lookup_collatename',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_collatename.html',0,'std::regex_traits']]], + ['lower_91',['lower',['../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd',1,'uint128_t::lower()'],['../d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1',1,'uint256_t::lower()'],['../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9',1,'lower(): text_search.cpp']]], + ['lower_5fbound_92',['lower_bound',['http://en.cppreference.com/w/cpp/container/multiset/lower_bound.html',0,'std::multiset::lower_bound()'],['http://en.cppreference.com/w/cpp/container/set/lower_bound.html',0,'std::set::lower_bound()'],['http://en.cppreference.com/w/cpp/container/map/lower_bound.html',0,'std::map::lower_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/lower_bound.html',0,'std::multimap::lower_bound()'],['http://en.cppreference.com/w/cpp/algorithm/lower_bound.html',0,'std::lower_bound()']]], + ['lowest_93',['lowest',['http://en.cppreference.com/w/cpp/types/numeric_limits/lowest.html',0,'std::numeric_limits']]], + ['lowest_5fcommon_5fancestor_94',['lowest_common_ancestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488',1,'graph::LowestCommonAncestor']]], + ['lowest_5fcommon_5fancestor_2ecpp_95',['lowest_common_ancestor.cpp',['../de/dde/lowest__common__ancestor_8cpp.html',1,'']]], + ['lowestcommonancestor_96',['LowestCommonAncestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html',1,'graph::LowestCommonAncestor'],['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93',1,'graph::LowestCommonAncestor::LowestCommonAncestor()']]], + ['lps_97',['lps',['../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412',1,'dynamic_programming']]], + ['lrint_98',['lrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], + ['lround_99',['lround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], + ['lru_5fcache_100',['lru_cache',['../d8/dcd/namespacelru__cache.html',1,'']]], + ['lru_5fcache_2ecpp_101',['lru_cache.cpp',['../d3/db3/lru__cache_8cpp.html',1,'']]], + ['lrucache_102',['LRUCache',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html',1,'others::lru_cache::LRUCache'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4',1,'others::lru_cache::LRUCache::LRUCache()']]], + ['lt_103',['lt',['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits']]], + ['lu_5fdecompose_2ecpp_104',['lu_decompose.cpp',['../dd/d65/lu__decompose_8cpp.html',1,'']]], + ['lu_5fdecomposition_105',['lu_decomposition',['../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509',1,'lu_decomposition.h']]], + ['lu_5fdecomposition_2eh_106',['lu_decomposition.h',['../d1/dbe/lu__decomposition_8h.html',1,'']]] ]; diff --git a/search/all_12.js b/search/all_12.js index 727ac92b2..c600aef4f 100644 --- a/search/all_12.js +++ b/search/all_12.js @@ -1,184 +1,190 @@ var searchData= [ - ['m_0',['m',['../d6/d42/data__structures_2sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e',1,'data_structures::sparse_table::M'],['../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74',1,'graph::HKGraph::m'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/params.html',0,'std::lognormal_distribution::m()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::m()']]], - ['machine_20learning_1',['Machine Learning',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58',1,'']]], - ['machine_20learning_20algorithms_2',['Machine Learning Algorithms',['../d9/d66/group__machine__learning.html',1,'']]], - ['machine_5flearning_3',['machine_learning',['../d8/d77/namespacemachine__learning.html',1,'']]], - ['mag_4',['mag',['../df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8',1,'math::vector_cross']]], - ['magic_5fnumber_5',['magic_number',['../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0',1,'math']]], - ['magic_5fnumber_2ecpp_6',['magic_number.cpp',['../d9/d44/magic__number_8cpp.html',1,'']]], - ['magic_5fsequence_7',['magic_sequence',['../d8/d93/namespacemagic__sequence.html',1,'']]], - ['main_8',['main',['../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linked_list.cpp'],['../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): z_function.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): rabin_karp.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): manacher_algorithm.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knuth_morris_pratt.cpp'],['../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): horspool.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brute_force_string_searching.cpp'],['../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boyer_moore.cpp'],['../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wave_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): strand_sort.cpp'],['../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stooge_sort.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): selection_sort_recursive.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_bubble_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): random_pivot_quick_sort.cpp'],['../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): radix_sort2.cpp'],['../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_3.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pigeonhole_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pancake_sort.cpp'],['../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_insertion_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heap_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gnome_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dnf_sort.cpp'],['../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cycle_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_inversions.cpp'],['../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): comb_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bogo_sort.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_insertion_sort.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ncr_modulo_p.cpp'],['../dd/d1e/generate__parentheses_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): generate_parentheses.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): text_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ternary_search.cpp'],['../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sublist_search.cpp'],['../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): saddleback_search.cpp'],['../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search2.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search2.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hash_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): floyd_cycle_detection_algo.cpp'],['../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_search.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_search.cpp'],['../d4/d96/range__queries_2sparse__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_table.cpp'],['../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segtree.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prefix_sum_array.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): persistent_seg_tree_lazy_prop.cpp'],['../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heavy_light_decomposition.cpp'],['../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): graph_coloring.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fenwick_tree.cpp'],['../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): windowed_median.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): poisson_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): geometric_dist.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binomial_dist.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bayes_theorem.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): addition_rule.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ground_to_ground_projectile_motion.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_important_functions.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): tower_of_hanoi.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stairs_pattern.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): spiral_print.cpp'],['../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knight_tour.cpp'],['../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): minimax.cpp'],['../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens.cpp'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens_all_solution_optimised.cpp'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): nqueen_print_all_solutions.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_matrix.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): smallest_circle.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_tree_traversal.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primality_test.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): postfix_evaluation.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pascal_triangle.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_of_number.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): matrix_exponentiation.cpp'],['../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kelvin_to_celsius.cpp'],['../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadanes3.cpp'],['../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_tree_traversals.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): happy_number.cpp'],['../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_integer_input.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): decimal_to_roman_numeral.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): decimal_to_hexadecimal.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): buzz_number.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): union_of_two_arrays.cpp'],['../d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): trie_multiple_search.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_binary_tree.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): intersection_of_two_arrays.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): inorder_successor_of_bst.cpp'],['../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): circular_linked_list.cpp'],['../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_right_rotation.cpp'],['../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_left_rotation.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): successive_approximation.cpp'],['../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rungekutta.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): newton_raphson_method.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): midpoint_integral_method.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): inverse_fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gram_schmidt.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): golden_search_extrema.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gaussian_elimination.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): fast_fourier_transform.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): false_position.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): composite_simpson_rule.cpp'],['../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brent_method_extrema.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bisection_method.cpp'],['../dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): babylonian_method.cpp'],['../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): volume.cpp'],['../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_cross_product.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_digits.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_binomial_coefficient.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): string_fibonacci.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sqrt_double.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sieve_of_eratosthenes.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_equations_complex_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primes_up_to_billion.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_numbers.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_factorization.cpp'],['../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_two.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_for_huge_numbers.cpp'],['../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): perimeter.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): number_of_positive_divisors.cpp'],['../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rat_maze.cpp'],['../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): n_choose_r.cpp'],['../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_bonacci.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_simple.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_fermat_little_theorem.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_exponentiation.cpp'],['../df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): modular_division.cpp'],['../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): miller_rabin.cpp'],['../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): magic_number.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): least_common_multiple.cpp'],['../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lcm_sum.cpp'],['../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): largest_power.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): large_factorial.cpp'],['../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_factorial.cpp'],['../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): inv_sqrt.cpp'],['../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation2.cpp'],['../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_recursive_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_of_n_numbers.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_iterative_euclidean.cpp'],['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): finding_number_of_digits_in_a_number.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_sum.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_matrix_exponentiation.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_fast.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_power.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): factorial.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): extended_euclid_algorithm.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eulers_totient_function.cpp'],['../d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eratosthenes.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_factorial.cpp'],['../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): complex_numbers.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_prime.cpp'],['../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_factorial.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_amicable_pair.cpp'],['../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): binomial_calculate.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_exponent.cpp'],['../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): area.cpp'],['../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): approximate_pi.cpp'],['../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): aliquot_sum.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ordinary_least_squares_regressor.cpp'],['../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): neural_network.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): k_nearest_neighbors.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.cpp'],['../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha256.cpp'],['../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha1.cpp'],['../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_probing_hash_table.cpp'],['../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): md5.cpp'],['../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_probing_hash_table.cpp'],['../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_hash_hash_table.cpp'],['../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): chaining.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kruskals_minimum_spanning_tree.cpp'],['../df/d64/jumpgame_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jumpgame.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boruvkas_minimum_spanning_tree.cpp'],['../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): spirograph.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_problem.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lowest_common_ancestor.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): is_graph_bipartite.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hopcroft_karp.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): hamiltons_cycle.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search_with_stack.cpp'],['../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components_with_dsu.cpp'],['../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components.cpp'],['../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): breadth_first_search.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bidirectional_dijkstra.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): line_segment_intersection.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jarvis_algorithm.cpp'],['../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): memory_game.cpp'],['../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): word_break.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): shortest_common_supersequence.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_partitioning.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): minimum_edit_distance.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): maximum_circular_subarray.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_palindromic_subsequence.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): longest_increasing_subsequence.cpp'],['../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_common_string.cpp'],['../db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadane2.cpp'],['../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): house_robber.cpp'],['../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cut_rod.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): coin_change_topdown.cpp'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): armstrong_number.cpp'],['../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): abbreviation.cpp'],['../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): 0_1_knapsack.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_using_hashmap.cpp'],['../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_tree.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_modern.cpp'],['../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): tree_234.cpp'],['../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): treap.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sparse_table.cpp'],['../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): skip_list.cpp'],['../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segment_tree.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_a_linked_list.cpp'],['../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_two_stacks.cpp'],['../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_array.cpp'],['../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): list_array.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linkedlist_implentation_usingarray.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_union_rank.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_path_compression.cpp'],['../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): disjoint_set.cpp'],['../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bloom_filter.cpp'],['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): avltree.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fcfs_scheduling.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): xor_cipher.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vigenere_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): morse_code.cpp'],['../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hill_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): elliptic_curve_key_exchange.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): caesar_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): atbash_cipher.cpp'],['../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): a1z26_cipher.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_using_bit_manipulation.cpp'],['../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): set_kth_bit.cpp'],['../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_2.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): next_higher_number_with_same_number_of_set_bits.cpp'],['../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hamming_distance.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): find_non_repeating_number.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_set_bits.cpp'],['../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_bits_flip.cpp'],['../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wildcard_matching.cpp'],['../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sudoku_solver.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subarray_sum.cpp']]], - ['main_5fq_9',['main_q',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6',1,'data_structures::stack_using_queue::Stack']]], - ['maintainer_20reviewer_10',['Maintainer/reviewer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24',1,'']]], - ['maintainers_11',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]], - ['make_5fexception_5fptr_12',['make_exception_ptr',['http://en.cppreference.com/w/cpp/error/make_exception_ptr.html',0,'std']]], - ['make_5fheap_13',['make_heap',['http://en.cppreference.com/w/cpp/algorithm/make_heap.html',0,'std']]], - ['make_5fmove_5fiterator_14',['make_move_iterator',['http://en.cppreference.com/w/cpp/iterator/make_move_iterator.html',0,'std']]], - ['make_5foptional_15',['make_optional',['http://en.cppreference.com/w/cpp/experimental/optional/make_optional.html',0,'std::experimental']]], - ['make_5fpair_16',['make_pair',['http://en.cppreference.com/w/cpp/utility/pair/make_pair.html',0,'std']]], - ['make_5fready_5fat_5fthread_5fexit_17',['make_ready_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/packaged_task/make_ready_at_thread_exit.html',0,'std::packaged_task']]], - ['make_5fset_18',['make_set',['../d8/d99/connected__components__with__dsu_8cpp.html#ae91ed94113c56191b75fe45f688d6e62',1,'graph::disjoint_union']]], - ['make_5fshared_19',['make_shared',['http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html',0,'std']]], - ['make_5fsigned_20',['make_signed',['http://en.cppreference.com/w/cpp/types/make_signed.html',0,'std']]], - ['make_5ftuple_21',['make_tuple',['http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html',0,'std']]], - ['make_5funsigned_22',['make_unsigned',['http://en.cppreference.com/w/cpp/types/make_unsigned.html',0,'std']]], - ['makebst_23',['makeBST',['../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9',1,'operations_on_datastructures::inorder_traversal_of_bst']]], - ['makelinkedlist_24',['makeLinkedList',['../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53',1,'search::sublist_search']]], - ['makenode_25',['makeNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702',1,'operations_on_datastructures::inorder_traversal_of_bst']]], - ['makestrings_26',['makeStrings',['../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec',1,'backtracking::generate_parentheses']]], - ['making_20changes_27',['Making Changes',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26',1,'']]], - ['malloc_28',['malloc',['http://en.cppreference.com/w/cpp/memory/c/malloc.html',0,'std']]], - ['manacher_29',['manacher',['../d8/dc6/namespacemanacher.html',1,'manacher'],['../d3/d39/manacher__algorithm_8cpp.html#a95e6a2976bb2f332898f373941d52098',1,'strings::manacher::manacher()']]], - ['manacher_5falgorithm_2ecpp_30',['manacher_algorithm.cpp',['../d3/d39/manacher__algorithm_8cpp.html',1,'']]], - ['manipulation_31',['Bit Manipulation',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46',1,'']]], - ['map_32',['map',['http://en.cppreference.com/w/cpp/container/map/map.html',0,'std::map::map()'],['http://en.cppreference.com/w/cpp/container/map.html',0,'std::map< K, T >']]], - ['map_3c_20t_2c_20std_3a_3alist_3c_20t_20_3e_20_3e_33',['map< T, std::list< T > >',['http://en.cppreference.com/w/cpp/container/map.html',0,'std']]], - ['map_3c_20unsigned_20int_2c_20std_3a_3avector_3c_20unsigned_20int_20_3e_20_3e_34',['map< unsigned int, std::vector< unsigned int > >',['http://en.cppreference.com/w/cpp/container/map.html',0,'std']]], - ['mark_5fcount_35',['mark_count',['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::regex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::basic_regex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::wregex::mark_count()']]], - ['mask_36',['mask',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype_byname::mask'],['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype::mask'],['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype_base::mask']]], - ['mat_5fmul_37',['mat_mul',['../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590',1,'ciphers::HillCipher::mat_mul()'],['../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae',1,'mat_mul(const std::valarray< std::valarray< double > > &A, const std::valarray< std::valarray< double > > &B, std::valarray< std::valarray< double > > *OUT): qr_eigen_values.cpp']]], - ['mat_5fsize_38',['mat_size',['../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54',1,'matrix_exponentiation.cpp']]], - ['match_39',['match',['../dd/d92/memory__game_8cpp.html#a370760f2b328ad341bcb77d82fa17b01',1,'games::memory_game']]], - ['match_5fresults_40',['match_results',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::match_results'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::match_results::match_results()']]], - ['matching_41',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]], - ['matching_20and_20not_20matching_20edges_42',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]], - ['math_43',['math',['../dd/d47/namespacemath.html',1,'math'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59',1,'Math']]], - ['matrix_44',['matrix',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html',1,'divide_and_conquer::strassens_multiplication::Matrix< T, typename >'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer rows, const Integer cols)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer size)'],['../d1/dbe/lu__decomposition_8h.html#aed8766713ee9b561a4acdcdff5f90ea5',1,'matrix: lu_decomposition.h']]], - ['matrix_5fexponentiation_2ecpp_45',['matrix_exponentiation.cpp',['../d7/d35/matrix__exponentiation_8cpp.html',1,'']]], - ['max_46',['max',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/max.html',0,'std::student_t_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/max.html',0,'std::extreme_value_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/max.html',0,'std::lognormal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/max.html',0,'std::discrete_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux48::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/max.html',0,'std::piecewise_constant_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937_64::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mersenne_twister_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/max.html',0,'std::random_device::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::subtract_with_carry_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/max.html',0,'std::cauchy_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/max.html',0,'std::binomial_distribution::max()'],['../dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: ternary_search.cpp'],['../d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: hash_search.cpp'],['../dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: paranthesis_matching.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: power_for_huge_numbers.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: fibonacci_fast.cpp'],['http://en.cppreference.com/w/cpp/algorithm/max.html',0,'std::max()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/max.html',0,'std::poisson_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/max.html',0,'std::bernoulli_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::discard_block_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/max.html',0,'std::exponential_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/max.html',0,'std::uniform_real_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/max.html',0,'std::geometric_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux24_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/max.html',0,'std::independent_bits_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/max.html',0,'std::normal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand::max()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/max.html',0,'std::weibull_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux48_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/max.html',0,'std::negative_binomial_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937::max()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/max.html',0,'std::chi_squared_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/max.html',0,'std::gamma_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/max.html',0,'std::piecewise_linear_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::shuffle_order_engine::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::minutes::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::seconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::duration::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::milliseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::hours::max()'],['http://en.cppreference.com/w/cpp/chrono/time_point/max.html',0,'std::chrono::time_point::max()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/max.html',0,'std::chrono::duration_values::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::microseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::nanoseconds::max()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/max.html',0,'std::numeric_limits::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/max.html',0,'std::uniform_int_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/max.html',0,'std::fisher_f_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux24::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::linear_congruential_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::knuth_b::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand0::max()']]], - ['max_5falign_5ft_47',['max_align_t',['http://en.cppreference.com/w/cpp/types/max_align_t.html',0,'std']]], - ['max_5fbucket_5fcount_48',['max_bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_set/max_bucket_count.html',0,'std::unordered_set::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_map/max_bucket_count.html',0,'std::unordered_map::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_bucket_count.html',0,'std::unordered_multimap::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_bucket_count.html',0,'std::unordered_multiset::max_bucket_count()']]], - ['max_5felement_49',['max_element',['http://en.cppreference.com/w/cpp/algorithm/max_element.html',0,'std']]], - ['max_5fheight_50',['max_height',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa554429def63077ab7a550c0affbfefa',1,'physics::ground_to_ground_projectile_motion']]], - ['max_5fiter_51',['MAX_ITER',['../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1',1,'adaline_learning.cpp']]], - ['max_5fiterations_52',['max_iterations',['../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'MAX_ITERATIONS: bisection_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d',1,'MAX_ITERATIONS: newton_raphson_method.cpp']]], - ['max_5flength_53',['max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::max_length()']]], - ['max_5flevel_54',['MAX_LEVEL',['../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a',1,'data_structures']]], - ['max_5fload_5ffactor_55',['max_load_factor',['http://en.cppreference.com/w/cpp/container/unordered_map/max_load_factor.html',0,'std::unordered_map::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_load_factor.html',0,'std::unordered_multimap::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_load_factor.html',0,'std::unordered_multiset::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_load_factor.html',0,'std::unordered_set::max_load_factor()']]], - ['max_5fsize_56',['max_size',['http://en.cppreference.com/w/cpp/container/multimap/max_size.html',0,'std::multimap::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::match_results::max_size()'],['http://en.cppreference.com/w/cpp/container/vector/max_size.html',0,'std::vector::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator_traits/max_size.html',0,'std::allocator_traits::max_size()'],['http://en.cppreference.com/w/cpp/container/multiset/max_size.html',0,'std::multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::string::max_size()'],['../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8',1,'max_size: queue_using_array.cpp'],['http://en.cppreference.com/w/cpp/container/dynarray/max_size.html',0,'std::dynarray::max_size()'],['http://en.cppreference.com/w/cpp/container/set/max_size.html',0,'std::set::max_size()'],['http://en.cppreference.com/w/cpp/container/array/max_size.html',0,'std::array::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/max_size.html',0,'std::unordered_map::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_size.html',0,'std::unordered_set::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::cmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/map/max_size.html',0,'std::map::max_size()'],['http://en.cppreference.com/w/cpp/container/list/max_size.html',0,'std::list::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u32string::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u16string::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_size.html',0,'std::unordered_multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::wstring::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::basic_string::max_size()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/max_size.html',0,'std::scoped_allocator_adaptor::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator/max_size.html',0,'std::allocator::max_size()'],['http://en.cppreference.com/w/cpp/container/deque/max_size.html',0,'std::deque::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wcmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/forward_list/max_size.html',0,'std::forward_list::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_size.html',0,'std::unordered_multimap::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::smatch::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wsmatch::max_size()']]], - ['max_5fsubarray_5fsum_57',['max_subarray_sum',['../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147',1,'kadanes3.cpp']]], - ['maxcircularsum_58',['maxCircularSum',['../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb',1,'dynamic_programming']]], - ['maxelement_59',['maxElement',['../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53',1,'dsu']]], - ['maximum_20cardinality_20matching_60',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]], - ['maximum_5fcircular_5fsubarray_2ecpp_61',['maximum_circular_subarray.cpp',['../db/dfb/maximum__circular__subarray_8cpp.html',1,'']]], - ['maxknapsackvalue_62',['maxKnapsackValue',['../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1',1,'dynamic_programming::knapsack']]], - ['maxnode_63',['maxNode',['../d0/dd2/treap_8cpp.html#ad939ec178d0069aeea14b7d6d7d12099',1,'data_structures::treap']]], - ['maxprofitbycuttingrod_64',['maxProfitByCuttingRod',['../d6/d10/cut__rod_8cpp.html#a1cc523a30c18c63eac58220c3c494cfa',1,'dynamic_programming::cut_rod']]], - ['maxsubarray_65',['maxSubArray',['../db/dca/kadane2_8cpp.html#af3029007a422a914a85c0b0122f1c7b4',1,'dynamic_programming::kadane']]], - ['mblen_66',['mblen',['http://en.cppreference.com/w/cpp/string/multibyte/mblen.html',0,'std']]], - ['mbrlen_67',['mbrlen',['http://en.cppreference.com/w/cpp/string/multibyte/mbrlen.html',0,'std']]], - ['mbrtoc16_68',['mbrtoc16',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc16.html',0,'std']]], - ['mbrtoc32_69',['mbrtoc32',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc32.html',0,'std']]], - ['mbrtowc_70',['mbrtowc',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtowc.html',0,'std']]], - ['mbsinit_71',['mbsinit',['http://en.cppreference.com/w/cpp/string/multibyte/mbsinit.html',0,'std']]], - ['mbsrtowcs_72',['mbsrtowcs',['http://en.cppreference.com/w/cpp/string/multibyte/mbsrtowcs.html',0,'std']]], - ['mbstate_5ft_73',['mbstate_t',['http://en.cppreference.com/w/cpp/string/multibyte/mbstate_t.html',0,'std']]], - ['mbstowcs_74',['mbstowcs',['http://en.cppreference.com/w/cpp/string/multibyte/mbstowcs.html',0,'std']]], - ['mbtowc_75',['mbtowc',['http://en.cppreference.com/w/cpp/string/multibyte/mbtowc.html',0,'std']]], - ['md5_76',['MD5',['../dd/d43/namespace_m_d5.html',1,'']]], - ['md5_2ecpp_77',['md5.cpp',['../d5/d96/md5_8cpp.html',1,'']]], - ['mean_78',['mean',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/mean.html',0,'std::poisson_distribution::mean()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution::mean()'],['../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b',1,'statistics::stats_computer1::mean()'],['../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e',1,'statistics::stats_computer2::mean()']]], - ['median_5fof_5fmedians_79',['median_of_medians',['../d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae',1,'search::median_search']]], - ['median_5fsearch_80',['median_search',['../da/dd4/namespacemedian__search.html',1,'']]], - ['median_5fsearch_2ecpp_81',['median_search.cpp',['../d9/d69/median__search_8cpp.html',1,'']]], - ['median_5fsearch2_2ecpp_82',['median_search2.cpp',['../d8/dfa/median__search2_8cpp.html',1,'']]], - ['mega_83',['mega',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], - ['mem_5ffn_84',['mem_fn',['http://en.cppreference.com/w/cpp/utility/functional/mem_fn.html',0,'std']]], - ['memchr_85',['memchr',['http://en.cppreference.com/w/cpp/string/byte/memchr.html',0,'std']]], - ['memcmp_86',['memcmp',['http://en.cppreference.com/w/cpp/string/byte/memcmp.html',0,'std']]], - ['memcpy_87',['memcpy',['http://en.cppreference.com/w/cpp/string/byte/memcpy.html',0,'std']]], - ['memmove_88',['memmove',['http://en.cppreference.com/w/cpp/string/byte/memmove.html',0,'std']]], - ['memory_5fgame_2ecpp_89',['memory_game.cpp',['../dd/d92/memory__game_8cpp.html',1,'']]], - ['memset_90',['memset',['http://en.cppreference.com/w/cpp/string/byte/memset.html',0,'std']]], - ['merge_91',['merge',['http://en.cppreference.com/w/cpp/container/list/merge.html',0,'std::list::merge()'],['http://en.cppreference.com/w/cpp/algorithm/merge.html',0,'std::merge()'],['http://en.cppreference.com/w/cpp/container/forward_list/merge.html',0,'std::forward_list::merge()'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9',1,'data_structures::tree_234::Tree234::Merge()'],['../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079',1,'sorting::merge()'],['../de/d7b/merge__insertion__sort_8cpp.html#af4de4067a9a866ffd985c5b5055ccedf',1,'sorting::merge_insertion::merge()'],['../d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f',1,'sorting::inversion::merge()'],['../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73',1,'merge(int *arr, int l, int m, int r): merge_sort.cpp']]], - ['merge_5finsertion_92',['merge_insertion',['../de/d0a/namespacemerge__insertion.html',1,'']]], - ['merge_5finsertion_5fsort_2ecpp_93',['merge_insertion_sort.cpp',['../de/d7b/merge__insertion__sort_8cpp.html',1,'']]], - ['merge_5fsort_2ecpp_94',['merge_sort.cpp',['../d5/df4/merge__sort_8cpp.html',1,'']]], - ['mergenode_95',['MergeNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805',1,'data_structures::tree_234::Tree234']]], - ['mergenodenotfull_96',['MergeNodeNotFull',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95',1,'data_structures::tree_234::Tree234']]], - ['mergesort_97',['mergesort',['../de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674',1,'sorting::merge_insertion::mergeSort()'],['../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7',1,'mergeSort(): merge_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661',1,'sorting::inversion::mergeSort()']]], - ['mersenne_5ftwister_5fengine_98',['mersenne_twister_engine',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std::mersenne_twister_engine'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mersenne_twister_engine::mersenne_twister_engine()']]], - ['message_99',['message',['http://en.cppreference.com/w/cpp/error/error_condition/message.html',0,'std::error_condition::message()'],['http://en.cppreference.com/w/cpp/error/error_category/message.html',0,'std::error_category::message()'],['http://en.cppreference.com/w/cpp/error/error_code/message.html',0,'std::error_code::message()']]], - ['messages_100',['messages',['http://en.cppreference.com/w/cpp/locale/messages/messages.html',0,'std::messages::messages()'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages']]], - ['messages_5fbase_101',['messages_base',['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std']]], - ['messages_5fbyname_102',['messages_byname',['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname'],['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname::messages_byname()']]], - ['method_201_3a_20use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_103',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], - ['method_202_3a_20search_20from_20the_20root_20node_104',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md93',1,'']]], - ['method1_105',['method1',['../df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11',1,'decimal_to_binary.cpp']]], - ['method2_106',['method2',['../df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7',1,'decimal_to_binary.cpp']]], - ['methods_107',['Numerical Methods',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60',1,'']]], - ['micro_108',['micro',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], - ['microseconds_109',['microseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::microseconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::microseconds::microseconds()']]], - ['mid_110',['mid',['../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141',1,'data_structures::SegmentTree']]], - ['middlenode_111',['middleNode',['../d8/dfa/median__search2_8cpp.html#a5fefe132a0c3ee780ebc703f37ebce6a',1,'search::median_search2']]], - ['midpoint_112',['midpoint',['../df/d11/midpoint__integral__method_8cpp.html#a7072493d1f0f8a91b2a71d4cc456c09c',1,'numerical_methods::midpoint_rule']]], - ['midpoint_5feuler_113',['midpoint_euler',['../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985',1,'ode_midpoint_euler.cpp']]], - ['midpoint_5feuler_5fstep_114',['midpoint_euler_step',['../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812',1,'ode_midpoint_euler.cpp']]], - ['midpoint_5fintegral_5fmethod_2ecpp_115',['midpoint_integral_method.cpp',['../df/d11/midpoint__integral__method_8cpp.html',1,'']]], - ['midpoint_5frule_116',['midpoint_rule',['../d9/daa/namespacemidpoint__rule.html',1,'']]], - ['miller_5frabin_2ecpp_117',['miller_rabin.cpp',['../d6/d42/miller__rabin_8cpp.html',1,'']]], - ['miller_5frabin_5fprimality_5ftest_118',['miller_rabin_primality_test',['../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce',1,'miller_rabin.cpp']]], - ['miller_5ftest_119',['miller_test',['../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506',1,'miller_rabin.cpp']]], - ['milli_120',['milli',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], - ['milliseconds_121',['milliseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::milliseconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::milliseconds::milliseconds()']]], - ['min_122',['min',['http://en.cppreference.com/w/cpp/numeric/random/random_device/min.html',0,'std::random_device::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::discard_block_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/min.html',0,'std::piecewise_constant_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux48::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mersenne_twister_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/min.html',0,'std::independent_bits_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/min.html',0,'std::discrete_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/min.html',0,'std::normal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/min.html',0,'std::student_t_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/min.html',0,'std::lognormal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/min.html',0,'std::extreme_value_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux24_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937_64::min()'],['http://en.cppreference.com/w/cpp/algorithm/min.html',0,'std::min()'],['../da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347',1,'dynamic_programming::minimum_edit_distance::min()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/min.html',0,'std::geometric_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand::min()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/min.html',0,'std::weibull_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux48_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/min.html',0,'std::negative_binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::subtract_with_carry_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/min.html',0,'std::cauchy_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/min.html',0,'std::binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/min.html',0,'std::gamma_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand0::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::knuth_b::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::linear_congruential_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux24::min()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/min.html',0,'std::fisher_f_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/min.html',0,'std::uniform_int_distribution::min()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/min.html',0,'std::numeric_limits::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::nanoseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::microseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/min.html',0,'std::chrono::duration_values::min()'],['http://en.cppreference.com/w/cpp/chrono/time_point/min.html',0,'std::chrono::time_point::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::hours::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::milliseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::duration::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::seconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::minutes::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::shuffle_order_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/min.html',0,'std::uniform_real_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/min.html',0,'std::exponential_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/min.html',0,'std::poisson_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/min.html',0,'std::bernoulli_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/min.html',0,'std::chi_squared_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/min.html',0,'std::piecewise_linear_distribution::min()']]], - ['min_5fdistance_123',['MIN_DISTANCE',['../d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786',1,'machine_learning']]], - ['min_5felement_124',['min_element',['http://en.cppreference.com/w/cpp/algorithm/min_element.html',0,'std']]], - ['mincoins_125',['mincoins',['../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a',1,'dynamic_programming::mincoins_topdown']]], - ['mincoins_5ftopdown_126',['mincoins_topdown',['../d5/db8/namespacemincoins__topdown.html',1,'']]], - ['minelement_127',['minElement',['../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63',1,'dsu']]], - ['minheap_128',['minheap',['../d2/d05/class_min_heap.html',1,'MinHeap'],['../d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820',1,'MinHeap::MinHeap(int cap)']]], - ['minheapify_129',['MinHeapify',['../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad',1,'MinHeap']]], - ['minheapnode_130',['MinHeapNode',['../d5/d29/struct_min_heap_node.html',1,'']]], - ['minimax_131',['minimax',['../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50',1,'backtracking']]], - ['minimax_2ecpp_132',['minimax.cpp',['../df/dfb/minimax_8cpp.html',1,'']]], - ['minimum_133',['Minimum',['../d4/d12/namespace_minimum.html',1,'']]], - ['minimum_5fdistance_134',['minimum_distance',['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#af6cb29ca6dc5771439f6ea7262058a71',1,'greedy_algorithms::dijkstra']]], - ['minimum_5fedit_5fdistance_2ecpp_135',['minimum_edit_distance.cpp',['../da/d52/minimum__edit__distance_8cpp.html',1,'']]], - ['minmax_136',['minmax',['http://en.cppreference.com/w/cpp/algorithm/minmax.html',0,'std']]], - ['minmax_5felement_137',['minmax_element',['http://en.cppreference.com/w/cpp/algorithm/minmax_element.html',0,'std']]], - ['minmax_5fscaler_138',['minmax_scaler',['../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26',1,'machine_learning']]], - ['minstd_5frand_139',['minstd_rand',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std::minstd_rand'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand::minstd_rand()']]], - ['minstd_5frand0_140',['minstd_rand0',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std::minstd_rand0'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand0::minstd_rand0()']]], - ['minus_141',['minus',['http://en.cppreference.com/w/cpp/utility/functional/minus.html',0,'std']]], - ['minutes_142',['minutes',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::minutes::minutes()'],['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::minutes']]], - ['minvalue_143',['minValue',['../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e',1,'avltree.cpp']]], - ['mismatch_144',['mismatch',['http://en.cppreference.com/w/cpp/algorithm/mismatch.html',0,'std']]], - ['mktime_145',['mktime',['http://en.cppreference.com/w/cpp/chrono/c/mktime.html',0,'std']]], - ['mod_5fdivision_146',['mod_division',['../df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7',1,'math::modular_division']]], - ['modf_147',['modf',['http://en.cppreference.com/w/cpp/numeric/math/modf.html',0,'std']]], - ['modinverse_148',['modInverse',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a0431ec5c876e1154d8e1e5f89e1ab34a',1,'math::ncr_modulo_p::NCRModuloP']]], - ['modular_5fdivision_149',['modular_division',['../d1/d64/namespacemodular__division.html',1,'']]], - ['modular_5fdivision_2ecpp_150',['modular_division.cpp',['../df/d72/modular__division_8cpp.html',1,'']]], - ['modular_5fexponentiation_151',['modular_exponentiation',['../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29',1,'miller_rabin.cpp']]], - ['modular_5fexponentiation_2ecpp_152',['modular_exponentiation.cpp',['../d0/d6d/modular__exponentiation_8cpp.html',1,'']]], - ['modular_5finverse_5ffermat_5flittle_5ftheorem_2ecpp_153',['modular_inverse_fermat_little_theorem.cpp',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html',1,'']]], - ['modular_5finverse_5fsimple_2ecpp_154',['modular_inverse_simple.cpp',['../d6/d2d/modular__inverse__simple_8cpp.html',1,'']]], - ['modulus_155',['modulus',['http://en.cppreference.com/w/cpp/utility/functional/modulus.html',0,'std']]], - ['money_5fbase_156',['money_base',['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std']]], - ['money_5fget_157',['money_get',['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get'],['http://en.cppreference.com/w/cpp/locale/money_get/money_get.html',0,'std::money_get::money_get()']]], - ['money_5fput_158',['money_put',['http://en.cppreference.com/w/cpp/locale/money_put/money_put.html',0,'std::money_put::money_put()'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put']]], - ['moneypunct_159',['moneypunct',['http://en.cppreference.com/w/cpp/locale/moneypunct/moneypunct.html',0,'std::moneypunct::moneypunct()'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct']]], - ['moneypunct_5fbyname_160',['moneypunct_byname',['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std::moneypunct_byname'],['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std::moneypunct_byname::moneypunct_byname()']]], - ['monte_5fcarlo_161',['monte_carlo',['../d0/da4/namespacemonte__carlo.html',1,'']]], - ['month_162',['month',['../d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde',1,'EasterYearMonthDay']]], - ['morse_163',['morse',['../d6/d8d/namespacemorse.html',1,'']]], - ['morse_5fcode_2ecpp_164',['morse_code.cpp',['../d8/d76/morse__code_8cpp.html',1,'']]], - ['morse_5fto_5fchar_165',['morse_to_char',['../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829',1,'ciphers::morse']]], - ['mov_166',['mov',['../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d',1,'tower_of_hanoi.cpp']]], - ['move_167',['move',['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wiostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wfstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostream::move()'],['http://en.cppreference.com/w/cpp/string/char_traits/move.html',0,'std::char_traits::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::fstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::strstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ios::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_fstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wstringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wofstream::move()'],['http://en.cppreference.com/w/cpp/utility/move.html',0,'std::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostream::move()']]], - ['move_5fbackward_168',['move_backward',['http://en.cppreference.com/w/cpp/algorithm/move_backward.html',0,'std']]], - ['move_5fif_5fnoexcept_169',['move_if_noexcept',['http://en.cppreference.com/w/cpp/utility/move_if_noexcept.html',0,'std']]], - ['move_5fiterator_170',['move_iterator',['http://en.cppreference.com/w/cpp/iterator/move_iterator.html',0,'std']]], - ['moves_171',['moves',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71',1,'machine_learning::aystar_search::EightPuzzle']]], - ['mst_172',['mst',['../d1/d77/structmst.html',1,'']]], - ['mt19937_173',['mt19937',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937::mt19937()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std::mt19937']]], - ['mt19937_5f64_174',['mt19937_64',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std::mt19937_64'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937_64::mt19937_64()']]], - ['multimap_175',['multimap',['http://en.cppreference.com/w/cpp/container/multimap.html',0,'std::multimap< K, T >'],['http://en.cppreference.com/w/cpp/container/multimap/multimap.html',0,'std::multimap::multimap()']]], - ['multiplies_176',['multiplies',['http://en.cppreference.com/w/cpp/utility/functional/multiplies.html',0,'std']]], - ['multiply_177',['multiply',['../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252',1,'multiply(const vector< vector< ll > > &A, const vector< vector< ll > > &B): matrix_exponentiation.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9',1,'multiply(int x, int res[], int res_size): power_for_huge_numbers.cpp'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2',1,'ciphers::elliptic_curve_key_exchange::multiply()'],['../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9',1,'machine_learning::multiply()'],['../de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e',1,'math::fibonacci_sum::multiply()'],['../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc',1,'large_number::multiply()']]], - ['multiset_178',['multiset',['http://en.cppreference.com/w/cpp/container/multiset/multiset.html',0,'std::multiset::multiset()'],['http://en.cppreference.com/w/cpp/container/multiset.html',0,'std::multiset< K >']]], - ['multiset_3c_20int_20_3e_179',['multiset< int >',['http://en.cppreference.com/w/cpp/container/multiset.html',0,'std']]], - ['mutex_180',['mutex',['http://en.cppreference.com/w/cpp/thread/mutex/mutex.html',0,'std::mutex::mutex()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/mutex.html',0,'std::shared_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/mutex.html',0,'std::unique_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/mutex.html',0,'std::mutex']]] + ['m_0',['m',['../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74',1,'graph::HKGraph::m'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/params.html',0,'std::lognormal_distribution::m()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::m()']]], + ['m_1',['M',['../d6/d42/data__structures_2sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e',1,'data_structures::sparse_table']]], + ['machine_20learning_2',['Machine Learning',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58',1,'']]], + ['machine_20learning_20algorithms_3',['Machine Learning Algorithms',['../d9/d66/group__machine__learning.html',1,'']]], + ['machine_5flearning_4',['machine_learning',['../d8/d77/namespacemachine__learning.html',1,'']]], + ['mag_5',['mag',['../df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8',1,'math::vector_cross']]], + ['magic_5fnumber_6',['magic_number',['../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0',1,'math']]], + ['magic_5fnumber_2ecpp_7',['magic_number.cpp',['../d9/d44/magic__number_8cpp.html',1,'']]], + ['magic_5fsequence_8',['magic_sequence',['../d8/d93/namespacemagic__sequence.html',1,'']]], + ['main_9',['main',['../dd/d1e/generate__parentheses_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): generate_parentheses.cpp'],['../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): graph_coloring.cpp'],['../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knight_tour.cpp'],['../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): minimax.cpp'],['../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens.cpp'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens_all_solution_optimised.cpp'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): nqueen_print_all_solutions.cpp'],['../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subarray_sum.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sudoku_solver.cpp'],['../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_bits_flip.cpp'],['../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_set_bits.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): elliptic_curve_key_exchange.cpp'],['../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hill_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fcfs_scheduling.cpp'],['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): avltree.cpp'],['../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bloom_filter.cpp'],['../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): disjoint_set.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_union_rank.cpp'],['../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linked_list.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linkedlist_implentation_usingarray.cpp'],['../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): list_array.cpp'],['../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_array.cpp'],['../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_two_stacks.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segment_tree.cpp'],['../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): skip_list.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): treap.cpp'],['../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): tree_234.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_modern.cpp'],['../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): abbreviation.cpp'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): armstrong_number.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): house_robber.cpp'],['../db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadane2.cpp'],['../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_common_string.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): shortest_common_supersequence.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): word_break.cpp'],['../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): memory_game.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jarvis_algorithm.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): line_segment_intersection.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components_with_dsu.cpp'],['../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): hamiltons_cycle.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hopcroft_karp.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): is_graph_bipartite.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_problem.cpp'],['../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): spirograph.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boruvkas_minimum_spanning_tree.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../df/d64/jumpgame_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jumpgame.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kruskals_minimum_spanning_tree.cpp'],['../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): chaining.cpp'],['../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_hash_hash_table.cpp'],['../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_probing_hash_table.cpp'],['../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): md5.cpp'],['../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_probing_hash_table.cpp'],['../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha1.cpp'],['../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha256.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): k_nearest_neighbors.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.cpp'],['../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): neural_network.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ordinary_least_squares_regressor.cpp'],['../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): aliquot_sum.cpp'],['../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): approximate_pi.cpp'],['../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): area.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_exponent.cpp'],['../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eulers_totient_function.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): extended_euclid_algorithm.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): factorial.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_power.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_fast.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_sum.cpp'],['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): finding_number_of_digits_in_a_number.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_recursive_euclidean.cpp'],['../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation.cpp'],['../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_factorial.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): large_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lcm_sum.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): miller_rabin.cpp'],['../df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): n_choose_r.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): number_of_positive_divisors.cpp'],['../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): perimeter.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_for_huge_numbers.cpp'],['../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_two.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_factorization.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primes_up_to_billion.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_equations_complex_numbers.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sieve_of_eratosthenes.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sqrt_double.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): string_fibonacci.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): babylonian_method.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bisection_method.cpp'],['../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brent_method_extrema.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): composite_simpson_rule.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): false_position.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): fast_fourier_transform.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gaussian_elimination.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): golden_search_extrema.cpp'],['../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): inverse_fast_fourier_transform.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): midpoint_integral_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): newton_raphson_method.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.cpp'],['../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rungekutta.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): successive_approximation.cpp'],['../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): union_of_two_arrays.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): buzz_number.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): decimal_to_hexadecimal.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): decimal_to_roman_numeral.cpp'],['../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_integer_input.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): happy_number.cpp'],['../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_tree_traversals.cpp'],['../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadanes3.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kelvin_to_celsius.cpp'],['../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): matrix_exponentiation.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_of_number.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pascal_triangle.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): postfix_evaluation.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primality_test.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): smallest_circle.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_matrix.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): spiral_print.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stairs_pattern.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): tower_of_hanoi.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_important_functions.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ground_to_ground_projectile_motion.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): addition_rule.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bayes_theorem.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binomial_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): geometric_dist.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): poisson_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): windowed_median.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fenwick_tree.cpp'],['../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heavy_light_decomposition.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segtree.cpp'],['../d4/d96/range__queries_2sparse__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_table.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_search.cpp'],['../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): floyd_cycle_detection_algo.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hash_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search2.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_search.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sublist_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ternary_search.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bogo_sort.cpp'],['../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): comb_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heap_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_insertion_sort.cpp'],['../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pancake_sort.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pigeonhole_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort.cpp'],['../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_3.cpp'],['../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): radix_sort2.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): selection_sort_recursive.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.cpp'],['../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stooge_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wave_sort.cpp'],['../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boyer_moore.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brute_force_string_searching.cpp'],['../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): horspool.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knuth_morris_pratt.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): manacher_algorithm.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): rabin_karp.cpp'],['../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): z_function.cpp']]], + ['main_5fq_10',['main_q',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6',1,'data_structures::stack_using_queue::Stack']]], + ['maintainer_20reviewer_11',['Maintainer/reviewer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24',1,'']]], + ['maintainers_12',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]], + ['make_5fexception_5fptr_13',['make_exception_ptr',['http://en.cppreference.com/w/cpp/error/make_exception_ptr.html',0,'std']]], + ['make_5fheap_14',['make_heap',['http://en.cppreference.com/w/cpp/algorithm/make_heap.html',0,'std']]], + ['make_5fmove_5fiterator_15',['make_move_iterator',['http://en.cppreference.com/w/cpp/iterator/make_move_iterator.html',0,'std']]], + ['make_5foptional_16',['make_optional',['http://en.cppreference.com/w/cpp/experimental/optional/make_optional.html',0,'std::experimental']]], + ['make_5fpair_17',['make_pair',['http://en.cppreference.com/w/cpp/utility/pair/make_pair.html',0,'std']]], + ['make_5fready_5fat_5fthread_5fexit_18',['make_ready_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/packaged_task/make_ready_at_thread_exit.html',0,'std::packaged_task']]], + ['make_5fset_19',['make_set',['../d8/d99/connected__components__with__dsu_8cpp.html#ae91ed94113c56191b75fe45f688d6e62',1,'graph::disjoint_union']]], + ['make_5fshared_20',['make_shared',['http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html',0,'std']]], + ['make_5fsigned_21',['make_signed',['http://en.cppreference.com/w/cpp/types/make_signed.html',0,'std']]], + ['make_5ftuple_22',['make_tuple',['http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html',0,'std']]], + ['make_5funsigned_23',['make_unsigned',['http://en.cppreference.com/w/cpp/types/make_unsigned.html',0,'std']]], + ['makebst_24',['makeBST',['../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9',1,'operations_on_datastructures::inorder_traversal_of_bst']]], + ['makelinkedlist_25',['makeLinkedList',['../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53',1,'search::sublist_search']]], + ['makenode_26',['makeNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702',1,'operations_on_datastructures::inorder_traversal_of_bst']]], + ['makestrings_27',['makeStrings',['../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec',1,'backtracking::generate_parentheses']]], + ['making_20changes_28',['Making Changes',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26',1,'']]], + ['malloc_29',['malloc',['http://en.cppreference.com/w/cpp/memory/c/malloc.html',0,'std']]], + ['manacher_30',['manacher',['../d8/dc6/namespacemanacher.html',1,'manacher'],['../d3/d39/manacher__algorithm_8cpp.html#a95e6a2976bb2f332898f373941d52098',1,'strings::manacher::manacher()']]], + ['manacher_5falgorithm_2ecpp_31',['manacher_algorithm.cpp',['../d3/d39/manacher__algorithm_8cpp.html',1,'']]], + ['manipulation_32',['Bit Manipulation',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46',1,'']]], + ['map_33',['map',['http://en.cppreference.com/w/cpp/container/map.html',0,'std::map< K, T >'],['http://en.cppreference.com/w/cpp/container/map/map.html',0,'std::map::map()']]], + ['map_3c_20t_2c_20std_3a_3alist_3c_20t_20_3e_20_3e_34',['map< T, std::list< T > >',['http://en.cppreference.com/w/cpp/container/map.html',0,'std']]], + ['map_3c_20unsigned_20int_2c_20std_3a_3avector_3c_20unsigned_20int_20_3e_20_3e_35',['map< unsigned int, std::vector< unsigned int > >',['http://en.cppreference.com/w/cpp/container/map.html',0,'std']]], + ['mark_5fcount_36',['mark_count',['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::regex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::basic_regex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::wregex::mark_count()']]], + ['mask_37',['mask',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype::mask'],['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype_base::mask'],['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype_byname::mask']]], + ['mat_5fmul_38',['mat_mul',['../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590',1,'ciphers::HillCipher::mat_mul()'],['../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae',1,'mat_mul(const std::valarray< std::valarray< double > > &A, const std::valarray< std::valarray< double > > &B, std::valarray< std::valarray< double > > *OUT): qr_eigen_values.cpp']]], + ['mat_5fsize_39',['mat_size',['../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54',1,'matrix_exponentiation.cpp']]], + ['match_40',['match',['../dd/d92/memory__game_8cpp.html#a370760f2b328ad341bcb77d82fa17b01',1,'games::memory_game']]], + ['match_5fresults_41',['match_results',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::match_results'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::match_results::match_results()']]], + ['matching_42',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]], + ['matching_20and_20not_20matching_20edges_43',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]], + ['math_44',['math',['../dd/d47/namespacemath.html',1,'']]], + ['math_45',['Math',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59',1,'']]], + ['matrix_46',['Matrix',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html',1,'divide_and_conquer::strassens_multiplication::Matrix< T, typename >'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer size)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer rows, const Integer cols)']]], + ['matrix_47',['matrix',['../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4',1,'lu_decomposition.h']]], + ['matrix_5fexponentiation_2ecpp_48',['matrix_exponentiation.cpp',['../d7/d35/matrix__exponentiation_8cpp.html',1,'']]], + ['max_49',['max',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/max.html',0,'std::student_t_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937_64::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux24_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/max.html',0,'std::extreme_value_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/max.html',0,'std::lognormal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/max.html',0,'std::discrete_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux48::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/max.html',0,'std::piecewise_constant_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/max.html',0,'std::poisson_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/max.html',0,'std::bernoulli_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::discard_block_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/max.html',0,'std::exponential_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/max.html',0,'std::uniform_real_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/max.html',0,'std::geometric_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mersenne_twister_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/max.html',0,'std::independent_bits_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/max.html',0,'std::normal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand::max()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/max.html',0,'std::weibull_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux48_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/max.html',0,'std::negative_binomial_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937::max()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/max.html',0,'std::chi_squared_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/max.html',0,'std::piecewise_linear_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::shuffle_order_engine::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::minutes::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::seconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::duration::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::milliseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::hours::max()'],['http://en.cppreference.com/w/cpp/chrono/time_point/max.html',0,'std::chrono::time_point::max()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/max.html',0,'std::chrono::duration_values::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::microseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::nanoseconds::max()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/max.html',0,'std::numeric_limits::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/max.html',0,'std::uniform_int_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/max.html',0,'std::fisher_f_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux24::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::linear_congruential_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::knuth_b::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand0::max()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/max.html',0,'std::gamma_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/max.html',0,'std::binomial_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/max.html',0,'std::cauchy_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::subtract_with_carry_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/max.html',0,'std::random_device::max()']]], + ['max_50',['MAX',['../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: fibonacci_fast.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: power_for_huge_numbers.cpp'],['../dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: paranthesis_matching.cpp'],['../d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: hash_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: ternary_search.cpp']]], + ['max_51',['max',['http://en.cppreference.com/w/cpp/algorithm/max.html',0,'std']]], + ['max_5falign_5ft_52',['max_align_t',['http://en.cppreference.com/w/cpp/types/max_align_t.html',0,'std']]], + ['max_5fbucket_5fcount_53',['max_bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_map/max_bucket_count.html',0,'std::unordered_map::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_bucket_count.html',0,'std::unordered_multimap::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_bucket_count.html',0,'std::unordered_multiset::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_bucket_count.html',0,'std::unordered_set::max_bucket_count()']]], + ['max_5felement_54',['max_element',['http://en.cppreference.com/w/cpp/algorithm/max_element.html',0,'std']]], + ['max_5fheight_55',['max_height',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa554429def63077ab7a550c0affbfefa',1,'physics::ground_to_ground_projectile_motion']]], + ['max_5fiter_56',['MAX_ITER',['../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1',1,'adaline_learning.cpp']]], + ['max_5fiterations_57',['MAX_ITERATIONS',['../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'MAX_ITERATIONS: bisection_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d',1,'MAX_ITERATIONS: newton_raphson_method.cpp']]], + ['max_5flength_58',['max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::max_length()']]], + ['max_5flevel_59',['MAX_LEVEL',['../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a',1,'data_structures']]], + ['max_5fload_5ffactor_60',['max_load_factor',['http://en.cppreference.com/w/cpp/container/unordered_map/max_load_factor.html',0,'std::unordered_map::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_load_factor.html',0,'std::unordered_multimap::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_load_factor.html',0,'std::unordered_multiset::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_load_factor.html',0,'std::unordered_set::max_load_factor()']]], + ['max_5fsize_61',['max_size',['http://en.cppreference.com/w/cpp/container/dynarray/max_size.html',0,'std::dynarray::max_size()'],['http://en.cppreference.com/w/cpp/container/vector/max_size.html',0,'std::vector::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::match_results::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator_traits/max_size.html',0,'std::allocator_traits::max_size()'],['http://en.cppreference.com/w/cpp/container/multiset/max_size.html',0,'std::multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::string::max_size()'],['http://en.cppreference.com/w/cpp/container/set/max_size.html',0,'std::set::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/max_size.html',0,'std::unordered_map::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wsmatch::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::smatch::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_size.html',0,'std::unordered_multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/forward_list/max_size.html',0,'std::forward_list::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wcmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/deque/max_size.html',0,'std::deque::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator/max_size.html',0,'std::allocator::max_size()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/max_size.html',0,'std::scoped_allocator_adaptor::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::basic_string::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::wstring::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_size.html',0,'std::unordered_multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u16string::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u32string::max_size()'],['http://en.cppreference.com/w/cpp/container/list/max_size.html',0,'std::list::max_size()'],['http://en.cppreference.com/w/cpp/container/map/max_size.html',0,'std::map::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::cmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_size.html',0,'std::unordered_set::max_size()'],['http://en.cppreference.com/w/cpp/container/multimap/max_size.html',0,'std::multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/array/max_size.html',0,'std::array::max_size()'],['../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8',1,'max_size: queue_using_array.cpp']]], + ['max_5fsubarray_5fsum_62',['max_subarray_sum',['../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147',1,'kadanes3.cpp']]], + ['maxcircularsum_63',['maxCircularSum',['../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb',1,'dynamic_programming']]], + ['maxelement_64',['maxElement',['../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53',1,'dsu']]], + ['maximum_20cardinality_20matching_65',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]], + ['maximum_5fcircular_5fsubarray_2ecpp_66',['maximum_circular_subarray.cpp',['../db/dfb/maximum__circular__subarray_8cpp.html',1,'']]], + ['maxknapsackvalue_67',['maxKnapsackValue',['../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1',1,'dynamic_programming::knapsack']]], + ['maxnode_68',['maxNode',['../d0/dd2/treap_8cpp.html#ad939ec178d0069aeea14b7d6d7d12099',1,'data_structures::treap']]], + ['maxprofitbycuttingrod_69',['maxProfitByCuttingRod',['../d6/d10/cut__rod_8cpp.html#a1cc523a30c18c63eac58220c3c494cfa',1,'dynamic_programming::cut_rod']]], + ['maxsubarray_70',['maxSubArray',['../db/dca/kadane2_8cpp.html#af3029007a422a914a85c0b0122f1c7b4',1,'dynamic_programming::kadane']]], + ['mblen_71',['mblen',['http://en.cppreference.com/w/cpp/string/multibyte/mblen.html',0,'std']]], + ['mbrlen_72',['mbrlen',['http://en.cppreference.com/w/cpp/string/multibyte/mbrlen.html',0,'std']]], + ['mbrtoc16_73',['mbrtoc16',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc16.html',0,'std']]], + ['mbrtoc32_74',['mbrtoc32',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc32.html',0,'std']]], + ['mbrtowc_75',['mbrtowc',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtowc.html',0,'std']]], + ['mbsinit_76',['mbsinit',['http://en.cppreference.com/w/cpp/string/multibyte/mbsinit.html',0,'std']]], + ['mbsrtowcs_77',['mbsrtowcs',['http://en.cppreference.com/w/cpp/string/multibyte/mbsrtowcs.html',0,'std']]], + ['mbstate_5ft_78',['mbstate_t',['http://en.cppreference.com/w/cpp/string/multibyte/mbstate_t.html',0,'std']]], + ['mbstowcs_79',['mbstowcs',['http://en.cppreference.com/w/cpp/string/multibyte/mbstowcs.html',0,'std']]], + ['mbtowc_80',['mbtowc',['http://en.cppreference.com/w/cpp/string/multibyte/mbtowc.html',0,'std']]], + ['md5_81',['MD5',['../dd/d43/namespace_m_d5.html',1,'']]], + ['md5_2ecpp_82',['md5.cpp',['../d5/d96/md5_8cpp.html',1,'']]], + ['mean_83',['mean',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/mean.html',0,'std::poisson_distribution::mean()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution::mean()'],['../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b',1,'statistics::stats_computer1::mean()'],['../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e',1,'statistics::stats_computer2::mean()']]], + ['median_5fof_5fmedians_84',['median_of_medians',['../d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae',1,'search::median_search']]], + ['median_5fsearch_85',['median_search',['../da/dd4/namespacemedian__search.html',1,'']]], + ['median_5fsearch_2ecpp_86',['median_search.cpp',['../d9/d69/median__search_8cpp.html',1,'']]], + ['median_5fsearch2_2ecpp_87',['median_search2.cpp',['../d8/dfa/median__search2_8cpp.html',1,'']]], + ['mega_88',['mega',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['mem_5ffn_89',['mem_fn',['http://en.cppreference.com/w/cpp/utility/functional/mem_fn.html',0,'std']]], + ['memchr_90',['memchr',['http://en.cppreference.com/w/cpp/string/byte/memchr.html',0,'std']]], + ['memcmp_91',['memcmp',['http://en.cppreference.com/w/cpp/string/byte/memcmp.html',0,'std']]], + ['memcpy_92',['memcpy',['http://en.cppreference.com/w/cpp/string/byte/memcpy.html',0,'std']]], + ['memmove_93',['memmove',['http://en.cppreference.com/w/cpp/string/byte/memmove.html',0,'std']]], + ['memory_5fgame_2ecpp_94',['memory_game.cpp',['../dd/d92/memory__game_8cpp.html',1,'']]], + ['memset_95',['memset',['http://en.cppreference.com/w/cpp/string/byte/memset.html',0,'std']]], + ['merge_96',['Merge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9',1,'data_structures::tree_234::Tree234']]], + ['merge_97',['merge',['http://en.cppreference.com/w/cpp/container/forward_list/merge.html',0,'std::forward_list::merge()'],['http://en.cppreference.com/w/cpp/container/list/merge.html',0,'std::list::merge()'],['http://en.cppreference.com/w/cpp/algorithm/merge.html',0,'std::merge()'],['../d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f',1,'sorting::inversion::merge()'],['../de/d7b/merge__insertion__sort_8cpp.html#af4de4067a9a866ffd985c5b5055ccedf',1,'sorting::merge_insertion::merge()'],['../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73',1,'merge(): merge_sort.cpp'],['../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079',1,'sorting::merge()']]], + ['merge_5finsertion_98',['merge_insertion',['../de/d0a/namespacemerge__insertion.html',1,'']]], + ['merge_5finsertion_5fsort_2ecpp_99',['merge_insertion_sort.cpp',['../de/d7b/merge__insertion__sort_8cpp.html',1,'']]], + ['merge_5fsort_2ecpp_100',['merge_sort.cpp',['../d5/df4/merge__sort_8cpp.html',1,'']]], + ['mergenode_101',['MergeNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805',1,'data_structures::tree_234::Tree234']]], + ['mergenodenotfull_102',['MergeNodeNotFull',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95',1,'data_structures::tree_234::Tree234']]], + ['mergesort_103',['mergeSort',['../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661',1,'sorting::inversion::mergeSort()'],['../de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674',1,'sorting::merge_insertion::mergeSort()'],['../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7',1,'mergeSort(): merge_sort.cpp']]], + ['mersenne_5ftwister_5fengine_104',['mersenne_twister_engine',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std::mersenne_twister_engine'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mersenne_twister_engine::mersenne_twister_engine()']]], + ['message_105',['message',['http://en.cppreference.com/w/cpp/error/error_code/message.html',0,'std::error_code::message()'],['http://en.cppreference.com/w/cpp/error/error_category/message.html',0,'std::error_category::message()'],['http://en.cppreference.com/w/cpp/error/error_condition/message.html',0,'std::error_condition::message()']]], + ['messages_106',['messages',['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages'],['http://en.cppreference.com/w/cpp/locale/messages/messages.html',0,'std::messages::messages()']]], + ['messages_5fbase_107',['messages_base',['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std']]], + ['messages_5fbyname_108',['messages_byname',['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname'],['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname::messages_byname()']]], + ['method_201_3a_20use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_109',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], + ['method_202_3a_20search_20from_20the_20root_20node_110',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md93',1,'']]], + ['method1_111',['method1',['../df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11',1,'decimal_to_binary.cpp']]], + ['method2_112',['method2',['../df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7',1,'decimal_to_binary.cpp']]], + ['methods_113',['Numerical Methods',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60',1,'']]], + ['micro_114',['micro',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['microseconds_115',['microseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::microseconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::microseconds::microseconds()']]], + ['mid_116',['mid',['../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141',1,'data_structures::SegmentTree']]], + ['middlenode_117',['middleNode',['../d8/dfa/median__search2_8cpp.html#a5fefe132a0c3ee780ebc703f37ebce6a',1,'search::median_search2']]], + ['midpoint_118',['midpoint',['../df/d11/midpoint__integral__method_8cpp.html#a7072493d1f0f8a91b2a71d4cc456c09c',1,'numerical_methods::midpoint_rule']]], + ['midpoint_5feuler_119',['midpoint_euler',['../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985',1,'ode_midpoint_euler.cpp']]], + ['midpoint_5feuler_5fstep_120',['midpoint_euler_step',['../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812',1,'ode_midpoint_euler.cpp']]], + ['midpoint_5fintegral_5fmethod_2ecpp_121',['midpoint_integral_method.cpp',['../df/d11/midpoint__integral__method_8cpp.html',1,'']]], + ['midpoint_5frule_122',['midpoint_rule',['../d9/daa/namespacemidpoint__rule.html',1,'']]], + ['miller_5frabin_2ecpp_123',['miller_rabin.cpp',['../d6/d42/miller__rabin_8cpp.html',1,'']]], + ['miller_5frabin_5fprimality_5ftest_124',['miller_rabin_primality_test',['../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce',1,'miller_rabin.cpp']]], + ['miller_5ftest_125',['miller_test',['../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506',1,'miller_rabin.cpp']]], + ['milli_126',['milli',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['milliseconds_127',['milliseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::milliseconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::milliseconds::milliseconds()']]], + ['min_128',['min',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/min.html',0,'std::student_t_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937_64::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux24_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/min.html',0,'std::extreme_value_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/min.html',0,'std::lognormal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/min.html',0,'std::discrete_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux48::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/min.html',0,'std::piecewise_constant_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/min.html',0,'std::poisson_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/min.html',0,'std::bernoulli_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::discard_block_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/min.html',0,'std::exponential_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/min.html',0,'std::uniform_real_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/min.html',0,'std::geometric_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mersenne_twister_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/min.html',0,'std::independent_bits_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/min.html',0,'std::normal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand::min()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/min.html',0,'std::weibull_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux48_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/min.html',0,'std::negative_binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937::min()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/min.html',0,'std::chi_squared_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/min.html',0,'std::piecewise_linear_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::shuffle_order_engine::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::minutes::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::seconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::duration::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::milliseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::hours::min()'],['http://en.cppreference.com/w/cpp/chrono/time_point/min.html',0,'std::chrono::time_point::min()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/min.html',0,'std::chrono::duration_values::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::microseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::nanoseconds::min()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/min.html',0,'std::numeric_limits::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/min.html',0,'std::uniform_int_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/min.html',0,'std::fisher_f_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux24::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::linear_congruential_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::knuth_b::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand0::min()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/min.html',0,'std::gamma_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/min.html',0,'std::binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/min.html',0,'std::cauchy_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::subtract_with_carry_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/min.html',0,'std::random_device::min()'],['http://en.cppreference.com/w/cpp/algorithm/min.html',0,'std::min()'],['../da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347',1,'dynamic_programming::minimum_edit_distance::min()']]], + ['min_5fdistance_129',['MIN_DISTANCE',['../d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786',1,'machine_learning']]], + ['min_5felement_130',['min_element',['http://en.cppreference.com/w/cpp/algorithm/min_element.html',0,'std']]], + ['mincoins_131',['mincoins',['../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a',1,'dynamic_programming::mincoins_topdown']]], + ['mincoins_5ftopdown_132',['mincoins_topdown',['../d5/db8/namespacemincoins__topdown.html',1,'']]], + ['minelement_133',['minElement',['../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63',1,'dsu']]], + ['minheap_134',['MinHeap',['../d2/d05/class_min_heap.html',1,'MinHeap'],['../d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820',1,'MinHeap::MinHeap(int cap)']]], + ['minheapify_135',['MinHeapify',['../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad',1,'MinHeap']]], + ['minheapnode_136',['MinHeapNode',['../d5/d29/struct_min_heap_node.html',1,'']]], + ['minimax_137',['minimax',['../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50',1,'backtracking']]], + ['minimax_2ecpp_138',['minimax.cpp',['../df/dfb/minimax_8cpp.html',1,'']]], + ['minimum_139',['Minimum',['../d4/d12/namespace_minimum.html',1,'']]], + ['minimum_5fdistance_140',['minimum_distance',['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#af6cb29ca6dc5771439f6ea7262058a71',1,'greedy_algorithms::dijkstra']]], + ['minimum_5fedit_5fdistance_2ecpp_141',['minimum_edit_distance.cpp',['../da/d52/minimum__edit__distance_8cpp.html',1,'']]], + ['minmax_142',['minmax',['http://en.cppreference.com/w/cpp/algorithm/minmax.html',0,'std']]], + ['minmax_5felement_143',['minmax_element',['http://en.cppreference.com/w/cpp/algorithm/minmax_element.html',0,'std']]], + ['minmax_5fscaler_144',['minmax_scaler',['../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26',1,'machine_learning']]], + ['minstd_5frand_145',['minstd_rand',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std::minstd_rand'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand::minstd_rand()']]], + ['minstd_5frand0_146',['minstd_rand0',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std::minstd_rand0'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand0::minstd_rand0()']]], + ['minus_147',['minus',['http://en.cppreference.com/w/cpp/utility/functional/minus.html',0,'std']]], + ['minutes_148',['minutes',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::minutes'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::minutes::minutes()']]], + ['minvalue_149',['minValue',['../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e',1,'avltree.cpp']]], + ['mismatch_150',['mismatch',['http://en.cppreference.com/w/cpp/algorithm/mismatch.html',0,'std']]], + ['mktime_151',['mktime',['http://en.cppreference.com/w/cpp/chrono/c/mktime.html',0,'std']]], + ['mod_5fdivision_152',['mod_division',['../df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7',1,'math::modular_division']]], + ['modf_153',['modf',['http://en.cppreference.com/w/cpp/numeric/math/modf.html',0,'std']]], + ['modinverse_154',['modInverse',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a0431ec5c876e1154d8e1e5f89e1ab34a',1,'math::ncr_modulo_p::NCRModuloP']]], + ['modular_5fdivision_155',['modular_division',['../d1/d64/namespacemodular__division.html',1,'']]], + ['modular_5fdivision_2ecpp_156',['modular_division.cpp',['../df/d72/modular__division_8cpp.html',1,'']]], + ['modular_5fexponentiation_157',['modular_exponentiation',['../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29',1,'miller_rabin.cpp']]], + ['modular_5fexponentiation_2ecpp_158',['modular_exponentiation.cpp',['../d0/d6d/modular__exponentiation_8cpp.html',1,'']]], + ['modular_5finverse_5ffermat_5flittle_5ftheorem_2ecpp_159',['modular_inverse_fermat_little_theorem.cpp',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html',1,'']]], + ['modular_5finverse_5fsimple_2ecpp_160',['modular_inverse_simple.cpp',['../d6/d2d/modular__inverse__simple_8cpp.html',1,'']]], + ['modulus_161',['modulus',['http://en.cppreference.com/w/cpp/utility/functional/modulus.html',0,'std']]], + ['money_5fbase_162',['money_base',['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std']]], + ['money_5fget_163',['money_get',['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get'],['http://en.cppreference.com/w/cpp/locale/money_get/money_get.html',0,'std::money_get::money_get()']]], + ['money_5fput_164',['money_put',['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put'],['http://en.cppreference.com/w/cpp/locale/money_put/money_put.html',0,'std::money_put::money_put()']]], + ['moneypunct_165',['moneypunct',['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct'],['http://en.cppreference.com/w/cpp/locale/moneypunct/moneypunct.html',0,'std::moneypunct::moneypunct()']]], + ['moneypunct_5fbyname_166',['moneypunct_byname',['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std::moneypunct_byname'],['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std::moneypunct_byname::moneypunct_byname()']]], + ['monte_5fcarlo_167',['monte_carlo',['../d0/da4/namespacemonte__carlo.html',1,'']]], + ['month_168',['month',['../d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde',1,'EasterYearMonthDay']]], + ['morse_169',['morse',['../d6/d8d/namespacemorse.html',1,'']]], + ['morse_5fcode_2ecpp_170',['morse_code.cpp',['../d8/d76/morse__code_8cpp.html',1,'']]], + ['morse_5fto_5fchar_171',['morse_to_char',['../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829',1,'ciphers::morse']]], + ['mov_172',['mov',['../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d',1,'tower_of_hanoi.cpp']]], + ['move_173',['move',['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::fstream::move()'],['http://en.cppreference.com/w/cpp/string/char_traits/move.html',0,'std::char_traits::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ios::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_fstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::strstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wiostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wfstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wstringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ifstream::move()'],['http://en.cppreference.com/w/cpp/utility/move.html',0,'std::move(T... args)']]], + ['move_5fbackward_174',['move_backward',['http://en.cppreference.com/w/cpp/algorithm/move_backward.html',0,'std']]], + ['move_5fif_5fnoexcept_175',['move_if_noexcept',['http://en.cppreference.com/w/cpp/utility/move_if_noexcept.html',0,'std']]], + ['move_5fiterator_176',['move_iterator',['http://en.cppreference.com/w/cpp/iterator/move_iterator.html',0,'std']]], + ['moves_177',['moves',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71',1,'machine_learning::aystar_search::EightPuzzle']]], + ['mst_178',['mst',['../d1/d77/structmst.html',1,'']]], + ['mt19937_179',['mt19937',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std::mt19937'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937::mt19937()']]], + ['mt19937_5f64_180',['mt19937_64',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std::mt19937_64'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937_64::mt19937_64()']]], + ['multimap_181',['multimap',['http://en.cppreference.com/w/cpp/container/multimap.html',0,'std::multimap< K, T >'],['http://en.cppreference.com/w/cpp/container/multimap/multimap.html',0,'std::multimap::multimap()']]], + ['multiplies_182',['multiplies',['http://en.cppreference.com/w/cpp/utility/functional/multiplies.html',0,'std']]], + ['multiply_183',['multiply',['../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc',1,'large_number::multiply()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2',1,'ciphers::elliptic_curve_key_exchange::multiply()'],['../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9',1,'machine_learning::multiply()'],['../de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e',1,'math::fibonacci_sum::multiply()'],['../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9',1,'multiply(int x, int res[], int res_size): power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252',1,'multiply(const vector< vector< ll > > &A, const vector< vector< ll > > &B): matrix_exponentiation.cpp']]], + ['multiset_184',['multiset',['http://en.cppreference.com/w/cpp/container/multiset.html',0,'std::multiset< K >'],['http://en.cppreference.com/w/cpp/container/multiset/multiset.html',0,'std::multiset::multiset()']]], + ['multiset_3c_20int_20_3e_185',['multiset< int >',['http://en.cppreference.com/w/cpp/container/multiset.html',0,'std']]], + ['mutex_186',['mutex',['http://en.cppreference.com/w/cpp/thread/mutex.html',0,'std::mutex'],['http://en.cppreference.com/w/cpp/thread/unique_lock/mutex.html',0,'std::unique_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/mutex.html',0,'std::shared_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/mutex/mutex.html',0,'std::mutex::mutex()']]] ]; diff --git a/search/all_13.js b/search/all_13.js index 15f55276b..4c82b9fa3 100644 --- a/search/all_13.js +++ b/search/all_13.js @@ -1,100 +1,106 @@ var searchData= [ - ['n_0',['n',['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::n()'],['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635',1,'data_structures::sparse_table::Sparse_table::n'],['../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c',1,'graph::HKGraph::n'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef',1,'graph::is_graph_bipartite::Graph::n'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6',1,'range_queries::fenwick_tree::n'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/n.html',0,'std::student_t_distribution::n()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/n.html',0,'std::chi_squared_distribution::n()'],['../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d',1,'data_structures::sparse_table::N']]], - ['n_5fbonacci_1',['n_bonacci',['../db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d',1,'math::n_bonacci::N_bonacci()'],['../de/d36/namespacen__bonacci.html',1,'n_bonacci']]], - ['n_5fbonacci_2ecpp_2',['n_bonacci.cpp',['../db/d27/n__bonacci_8cpp.html',1,'']]], - ['n_5fchoose_5fr_3',['n_choose_r',['../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967',1,'math']]], - ['n_5fchoose_5fr_2ecpp_4',['n_choose_r.cpp',['../d1/dbb/n__choose__r_8cpp.html',1,'']]], - ['n_5fpolygon_5fsurface_5fperimeter_5',['n_polygon_surface_perimeter',['../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f',1,'math']]], - ['n_5fqueens_6',['n_queens',['../d3/da1/namespacen__queens.html',1,'']]], - ['n_5fqueens_2ecpp_7',['n_queens.cpp',['../d4/d3e/n__queens_8cpp.html',1,'']]], - ['n_5fqueens_5fall_5fsolution_5foptimised_2ecpp_8',['n_queens_all_solution_optimised.cpp',['../da/dac/n__queens__all__solution__optimised_8cpp.html',1,'']]], - ['n_5fqueens_5fall_5fsolutions_9',['n_queens_all_solutions',['../df/d44/namespacen__queens__all__solutions.html',1,'']]], - ['n_5fqueens_5foptimized_10',['n_queens_optimized',['../d8/d14/namespacen__queens__optimized.html',1,'']]], - ['naive_5fmultiplication_11',['naive_multiplication',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50',1,'divide_and_conquer::strassens_multiplication::Matrix']]], - ['name_12',['name',['http://en.cppreference.com/w/cpp/types/type_index/name.html',0,'std::type_index::name()'],['http://en.cppreference.com/w/cpp/error/error_category/name.html',0,'std::error_category::name()'],['http://en.cppreference.com/w/cpp/types/type_info/name.html',0,'std::type_info::name()'],['http://en.cppreference.com/w/cpp/locale/locale/name.html',0,'std::locale::name()']]], - ['name_20guidelines_13',['File Name guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'']]], - ['nan_14',['nan',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]], - ['nanf_15',['nanf',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]], - ['nanl_16',['nanl',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]], - ['nano_17',['nano',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], - ['nanoseconds_18',['nanoseconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::nanoseconds::nanoseconds()'],['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::nanoseconds']]], - ['narrow_19',['narrow',['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::strstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wiostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_fstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ios::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::fstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istringstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wfstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wstringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ofstream::narrow()']]], - ['native_5fhandle_20',['native_handle',['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/native_handle.html',0,'std::recursive_timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/native_handle.html',0,'std::timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/thread/native_handle.html',0,'std::thread::native_handle()'],['http://en.cppreference.com/w/cpp/thread/mutex/native_handle.html',0,'std::mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/native_handle.html',0,'std::recursive_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/condition_variable_any/native_handle.html',0,'std::condition_variable_any::native_handle()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/native_handle.html',0,'std::condition_variable::native_handle()']]], - ['ncr_21',['ncr',['../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a',1,'nCr(): binomial_dist.cpp'],['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a6b95277f5f527beacc8d0f3bc91fcd08',1,'math::ncr_modulo_p::NCRModuloP::ncr()']]], - ['ncr_5fmodulo_5fp_22',['ncr_modulo_p',['../d4/db9/namespacencr__modulo__p.html',1,'']]], - ['ncr_5fmodulo_5fp_2ecpp_23',['ncr_modulo_p.cpp',['../de/dab/ncr__modulo__p_8cpp.html',1,'']]], - ['ncrmodulop_24',['ncrmodulop',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#af3d41271912f9fa50b774c96c51874b9',1,'math::ncr_modulo_p::NCRModuloP::NCRModuloP()'],['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html',1,'math::ncr_modulo_p::NCRModuloP']]], - ['nearbyint_25',['nearbyint',['http://en.cppreference.com/w/cpp/numeric/math/nearbyint.html',0,'std']]], - ['neg_5fformat_26',['neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::neg_format()']]], - ['negate_27',['negate',['http://en.cppreference.com/w/cpp/utility/functional/negate.html',0,'std']]], - ['negative_5fbinomial_5fdistribution_28',['negative_binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution.html',0,'std::negative_binomial_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/negative_binomial_distribution.html',0,'std::negative_binomial_distribution::negative_binomial_distribution()']]], - ['negative_5fsign_29',['negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::negative_sign()']]], - ['neighbors_30',['neighbors',['../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a',1,'graph::Graph']]], - ['nested_5fexception_31',['nested_exception',['http://en.cppreference.com/w/cpp/error/nested_exception.html',0,'std::nested_exception'],['http://en.cppreference.com/w/cpp/error/nested_exception/nested_exception.html',0,'std::nested_exception::nested_exception(T... args)']]], - ['nested_5fptr_32',['nested_ptr',['http://en.cppreference.com/w/cpp/error/nested_exception/nested_ptr.html',0,'std::nested_exception']]], - ['neural_5fnetwork_33',['neural_network',['../d0/d2e/namespaceneural__network.html',1,'']]], - ['neural_5fnetwork_2ecpp_34',['neural_network.cpp',['../d2/d58/neural__network_8cpp.html',1,'']]], - ['neuralnetwork_35',['neuralnetwork',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4c6f63ab965317f9471518ee931b89',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector< std::pair< int, std::string > > &config, const std::vector< std::vector< std::valarray< double > > > &kernels)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const NeuralNetwork &model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork()=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html',1,'machine_learning::neural_network::NeuralNetwork'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a173bb71780af6953ec2e307a4c74b025',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(NeuralNetwork &&)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a62151b0398a2536be60d950e10ffe9a8',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector< std::pair< int, std::string > > &config)']]], - ['new_20directory_36',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], - ['new_5fhandler_37',['new_handler',['http://en.cppreference.com/w/cpp/memory/new/new_handler.html',0,'std']]], - ['new_5fval_38',['new_val',['../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534',1,'statistics::stats_computer2::new_val()'],['../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2',1,'statistics::stats_computer1::new_val()']]], - ['newkid_39',['newKid',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817',1,'range_queries::perSegTree']]], - ['newton_5fraphson_5fmethod_2ecpp_40',['newton_raphson_method.cpp',['../de/dd3/newton__raphson__method_8cpp.html',1,'']]], - ['next_41',['next',['../dd/d1c/classhash__chain.html#a48236d44349c3ebce4774b706f4f8a0f',1,'hash_chain::next'],['../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e',1,'data_structures::linked_list::Node::next'],['../d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f',1,'list::next'],['../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1',1,'ListNode::next'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a',1,'search::sublist_search::Node::next'],['http://en.cppreference.com/w/cpp/iterator/next.html',0,'std::next()'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77',1,'operations_on_datastructures::circular_linked_list::Node::next']]], - ['next_5fhigher_5fnumber_42',['next_higher_number',['../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e',1,'bit_manipulation']]], - ['next_5fhigher_5fnumber_5fwith_5fsame_5fnumber_5fof_5fset_5fbits_2ecpp_43',['next_higher_number_with_same_number_of_set_bits.cpp',['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html',1,'']]], - ['next_5fpermutation_44',['next_permutation',['http://en.cppreference.com/w/cpp/algorithm/next_permutation.html',0,'std']]], - ['nextafter_45',['nextafter',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]], - ['nexttoward_46',['nexttoward',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]], - ['no_5foccurence_5ftests_47',['no_occurence_tests',['../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d',1,'fibonacci_search.cpp']]], - ['no_5fof_5fconnected_5fcomponents_48',['no_of_connected_components',['../d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141',1,'graph::disjoint_union']]], - ['noboolalpha_49',['noboolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]], - ['node_50',['node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md93',1,'Method 2: Search from the root node'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html',1,'data_structures::tree_234::Node'],['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html',1,'data_structures::trie_using_hashmap::Trie::Node'],['../d5/da1/structnode.html',1,'node'],['../db/d8b/struct_node.html',1,'Node< ValueType >'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html',1,'operations_on_datastructures::circular_linked_list::Node'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html',1,'operations_on_datastructures::inorder_traversal_of_bst::Node'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html',1,'operations_on_datastructures::reverse_binary_tree::Node'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html',1,'others::iterative_tree_traversals::Node'],['../dd/d1c/classhash__chain.html#a28d3adffc0126beeef63bce0846fb8f5',1,'hash_chain::Node'],['../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78',1,'data_structures::Node::Node()'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670',1,'data_structures::tree_234::Node::Node()'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5',1,'operations_on_datastructures::circular_linked_list::Node::Node()'],['../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555',1,'node: hash_search.cpp'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3',1,'operations_on_datastructures::reverse_binary_tree::Node::Node()'],['../d8/dee/avltree_8cpp.html#a3e7e4d8f7f8e212c1d31fe6b5d5da66a',1,'node: avltree.cpp'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95',1,'operations_on_datastructures::circular_linked_list::Node::Node()'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html',1,'search::sublist_search::Node'],['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html',1,'range_queries::perSegTree::Node'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html',1,'others::recursive_tree_traversals::Node'],['../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html',1,'data_structures::linked_list::Node'],['../d9/d49/structdata__structures_1_1_node.html',1,'data_structures::Node']]], - ['node_20does_20not_20have_20a_20right_20node_20subtree_51',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], - ['node_20has_20the_20right_20node_20subtree_52',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], - ['node_2ehpp_53',['node.hpp',['../d3/d09/node_8hpp.html',1,'']]], - ['node_3c_20value_5ftype_20_3e_54',['Node< value_type >',['../db/d8b/struct_node.html',1,'']]], - ['nodes_55',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], - ['non_5frecursive_5fmerge_5fsort_56',['non_recursive_merge_sort',['../d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534',1,'sorting::non_recursive_merge_sort(const Iterator first, const size_t n)'],['../d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last)'],['../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)']]], - ['non_5frecursive_5fmerge_5fsort_2ecpp_57',['non_recursive_merge_sort.cpp',['../d0/db6/non__recursive__merge__sort_8cpp.html',1,'']]], - ['none_58',['none',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], - ['none_5fof_59',['none_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], - ['normal_5fdistribution_60',['normal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/normal_distribution.html',0,'std::normal_distribution::normal_distribution()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution.html',0,'std::normal_distribution']]], - ['noshowbase_61',['noshowbase',['http://en.cppreference.com/w/cpp/io/manip/showbase.html',0,'std']]], - ['noshowpoint_62',['noshowpoint',['http://en.cppreference.com/w/cpp/io/manip/showpoint.html',0,'std']]], - ['noshowpos_63',['noshowpos',['http://en.cppreference.com/w/cpp/io/manip/showpos.html',0,'std']]], - ['noskipws_64',['noskipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]], - ['not_20have_20a_20right_20node_20subtree_65',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], - ['not_20matching_20edges_66',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]], - ['not1_67',['not1',['http://en.cppreference.com/w/cpp/utility/functional/not1.html',0,'std']]], - ['not2_68',['not2',['http://en.cppreference.com/w/cpp/utility/functional/not2.html',0,'std']]], - ['not_5feof_69',['not_eof',['http://en.cppreference.com/w/cpp/string/char_traits/not_eof.html',0,'std::char_traits']]], - ['not_5fequal_5fto_70',['not_equal_to',['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std']]], - ['nothrow_5ft_71',['nothrow_t',['http://en.cppreference.com/w/cpp/memory/new/nothrow_t.html',0,'std']]], - ['notify_5fall_72',['notify_all',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_all.html',0,'std::condition_variable_any::notify_all()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_all.html',0,'std::condition_variable::notify_all()']]], - ['notify_5fall_5fat_5fthread_5fexit_73',['notify_all_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/notify_all_at_thread_exit.html',0,'std']]], - ['notify_5fone_74',['notify_one',['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_one.html',0,'std::condition_variable::notify_one()'],['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_one.html',0,'std::condition_variable_any::notify_one()']]], - ['nounitbuf_75',['nounitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], - ['nouppercase_76',['nouppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], - ['now_77',['now',['http://en.cppreference.com/w/cpp/chrono/steady_clock/now.html',0,'std::chrono::steady_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/system_clock/now.html',0,'std::chrono::system_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html',0,'std::chrono::high_resolution_clock::now()']]], - ['nqueen_5fprint_5fall_5fsolutions_2ecpp_78',['nqueen_print_all_solutions.cpp',['../d7/d24/nqueen__print__all__solutions_8cpp.html',1,'']]], - ['nqueensol_79',['nqueensol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f',1,'backtracking::n_queens_optimized::NQueenSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108',1,'backtracking::n_queens_all_solutions::NQueenSol()']]], - ['nth_5felement_80',['nth_element',['http://en.cppreference.com/w/cpp/algorithm/nth_element.html',0,'std']]], - ['nullptr_5ft_81',['nullptr_t',['http://en.cppreference.com/w/cpp/types/nullptr_t.html',0,'std']]], - ['num_5fchars_82',['NUM_CHARS',['../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191',1,'data_structures::trie']]], - ['num_5fdigits_83',['num_digits',['../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93',1,'large_number']]], - ['num_5fget_84',['num_get',['http://en.cppreference.com/w/cpp/locale/num_get/num_get.html',0,'std::num_get::num_get()'],['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get']]], - ['num_5fput_85',['num_put',['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put'],['http://en.cppreference.com/w/cpp/locale/num_put/num_put.html',0,'std::num_put::num_put()']]], - ['number_5fof_5fpositive_5fdivisors_86',['number_of_positive_divisors',['../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb',1,'number_of_positive_divisors.cpp']]], - ['number_5fof_5fpositive_5fdivisors_2ecpp_87',['number_of_positive_divisors.cpp',['../d0/da2/number__of__positive__divisors_8cpp.html',1,'']]], - ['number_5fof_5fsubsets_88',['number_of_subsets',['../d0/dfe/backtracking_2subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99',1,'backtracking::subset_sum']]], - ['number_5fof_5fvertices_89',['number_of_vertices',['../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904',1,'graph::Graph']]], - ['numberofchildren_90',['numberOfChildren',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0',1,'operations_on_datastructures::trie_operations::Tnode']]], - ['numberofciphersinfactorialn_91',['numberOfCiphersInFactorialN',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0',1,'bit_manipulation::count_of_trailing_ciphers_in_factorial_n']]], - ['numeric_5flimits_92',['numeric_limits',['http://en.cppreference.com/w/cpp/types/numeric_limits.html',0,'std']]], - ['numerical_20methods_93',['Numerical Methods',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60',1,'']]], - ['numerical_5fmethods_94',['numerical_methods',['../d1/de0/namespacenumerical__methods.html',1,'']]], - ['numpunct_95',['numpunct',['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct'],['http://en.cppreference.com/w/cpp/locale/numpunct/numpunct.html',0,'std::numpunct::numpunct()']]], - ['numpunct_5fbyname_96',['numpunct_byname',['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std::numpunct_byname::numpunct_byname()'],['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std::numpunct_byname']]] + ['n_0',['n',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635',1,'data_structures::sparse_table::Sparse_table::n'],['../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c',1,'graph::HKGraph::n'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef',1,'graph::is_graph_bipartite::Graph::n'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6',1,'range_queries::fenwick_tree::n'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/n.html',0,'std::student_t_distribution::n()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/n.html',0,'std::chi_squared_distribution::n()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::n()']]], + ['n_1',['N',['../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d',1,'data_structures::sparse_table']]], + ['n_5fbonacci_2',['n_bonacci',['../de/d36/namespacen__bonacci.html',1,'']]], + ['n_5fbonacci_3',['N_bonacci',['../db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d',1,'math::n_bonacci']]], + ['n_5fbonacci_2ecpp_4',['n_bonacci.cpp',['../db/d27/n__bonacci_8cpp.html',1,'']]], + ['n_5fchoose_5fr_5',['n_choose_r',['../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967',1,'math']]], + ['n_5fchoose_5fr_2ecpp_6',['n_choose_r.cpp',['../d1/dbb/n__choose__r_8cpp.html',1,'']]], + ['n_5fpolygon_5fsurface_5fperimeter_7',['n_polygon_surface_perimeter',['../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f',1,'math']]], + ['n_5fqueens_8',['n_queens',['../d3/da1/namespacen__queens.html',1,'']]], + ['n_5fqueens_2ecpp_9',['n_queens.cpp',['../d4/d3e/n__queens_8cpp.html',1,'']]], + ['n_5fqueens_5fall_5fsolution_5foptimised_2ecpp_10',['n_queens_all_solution_optimised.cpp',['../da/dac/n__queens__all__solution__optimised_8cpp.html',1,'']]], + ['n_5fqueens_5fall_5fsolutions_11',['n_queens_all_solutions',['../df/d44/namespacen__queens__all__solutions.html',1,'']]], + ['n_5fqueens_5foptimized_12',['n_queens_optimized',['../d8/d14/namespacen__queens__optimized.html',1,'']]], + ['naive_5fmultiplication_13',['naive_multiplication',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50',1,'divide_and_conquer::strassens_multiplication::Matrix']]], + ['name_14',['name',['http://en.cppreference.com/w/cpp/locale/locale/name.html',0,'std::locale::name()'],['http://en.cppreference.com/w/cpp/error/error_category/name.html',0,'std::error_category::name()'],['http://en.cppreference.com/w/cpp/types/type_info/name.html',0,'std::type_info::name()'],['http://en.cppreference.com/w/cpp/types/type_index/name.html',0,'std::type_index::name()']]], + ['name_20guidelines_15',['File Name guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'']]], + ['nan_16',['nan',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]], + ['nanf_17',['nanf',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]], + ['nanl_18',['nanl',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]], + ['nano_19',['nano',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['nanoseconds_20',['nanoseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::nanoseconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::nanoseconds::nanoseconds()']]], + ['narrow_21',['narrow',['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ofstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::fstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ios::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_fstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::strstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wiostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istringstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wfstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wstringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ifstream::narrow()']]], + ['native_5fhandle_22',['native_handle',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/native_handle.html',0,'std::condition_variable_any::native_handle()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/native_handle.html',0,'std::condition_variable::native_handle()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/native_handle.html',0,'std::recursive_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/native_handle.html',0,'std::recursive_timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/thread/native_handle.html',0,'std::thread::native_handle()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/native_handle.html',0,'std::timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/mutex/native_handle.html',0,'std::mutex::native_handle()']]], + ['ncr_23',['ncr',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a6b95277f5f527beacc8d0f3bc91fcd08',1,'math::ncr_modulo_p::NCRModuloP']]], + ['ncr_24',['nCr',['../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a',1,'binomial_dist.cpp']]], + ['ncr_5fmodulo_5fp_25',['ncr_modulo_p',['../d4/db9/namespacencr__modulo__p.html',1,'']]], + ['ncr_5fmodulo_5fp_2ecpp_26',['ncr_modulo_p.cpp',['../de/dab/ncr__modulo__p_8cpp.html',1,'']]], + ['ncrmodulop_27',['NCRModuloP',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html',1,'math::ncr_modulo_p::NCRModuloP'],['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#af3d41271912f9fa50b774c96c51874b9',1,'math::ncr_modulo_p::NCRModuloP::NCRModuloP()']]], + ['nearbyint_28',['nearbyint',['http://en.cppreference.com/w/cpp/numeric/math/nearbyint.html',0,'std']]], + ['neg_5fformat_29',['neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::neg_format()']]], + ['negate_30',['negate',['http://en.cppreference.com/w/cpp/utility/functional/negate.html',0,'std']]], + ['negative_5fbinomial_5fdistribution_31',['negative_binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution.html',0,'std::negative_binomial_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/negative_binomial_distribution.html',0,'std::negative_binomial_distribution::negative_binomial_distribution()']]], + ['negative_5fsign_32',['negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::negative_sign()']]], + ['neighbors_33',['neighbors',['../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a',1,'graph::Graph']]], + ['nested_5fexception_34',['nested_exception',['http://en.cppreference.com/w/cpp/error/nested_exception.html',0,'std::nested_exception'],['http://en.cppreference.com/w/cpp/error/nested_exception/nested_exception.html',0,'std::nested_exception::nested_exception(T... args)']]], + ['nested_5fptr_35',['nested_ptr',['http://en.cppreference.com/w/cpp/error/nested_exception/nested_ptr.html',0,'std::nested_exception']]], + ['neural_5fnetwork_36',['neural_network',['../d0/d2e/namespaceneural__network.html',1,'']]], + ['neural_5fnetwork_2ecpp_37',['neural_network.cpp',['../d2/d58/neural__network_8cpp.html',1,'']]], + ['neuralnetwork_38',['NeuralNetwork',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html',1,'machine_learning::neural_network::NeuralNetwork'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4c6f63ab965317f9471518ee931b89',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector< std::pair< int, std::string > > &config, const std::vector< std::vector< std::valarray< double > > > &kernels)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork()=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a62151b0398a2536be60d950e10ffe9a8',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector< std::pair< int, std::string > > &config)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const NeuralNetwork &model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a173bb71780af6953ec2e307a4c74b025',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(NeuralNetwork &&)=default']]], + ['new_20directory_39',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], + ['new_5fhandler_40',['new_handler',['http://en.cppreference.com/w/cpp/memory/new/new_handler.html',0,'std']]], + ['new_5fval_41',['new_val',['../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2',1,'statistics::stats_computer1::new_val()'],['../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534',1,'statistics::stats_computer2::new_val()']]], + ['newkid_42',['newKid',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817',1,'range_queries::perSegTree']]], + ['newton_5fraphson_5fmethod_2ecpp_43',['newton_raphson_method.cpp',['../de/dd3/newton__raphson__method_8cpp.html',1,'']]], + ['next_44',['next',['../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e',1,'data_structures::linked_list::Node::next'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77',1,'operations_on_datastructures::circular_linked_list::Node::next'],['../d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f',1,'list::next'],['../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1',1,'ListNode::next'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a',1,'search::sublist_search::Node::next'],['http://en.cppreference.com/w/cpp/iterator/next.html',0,'std::next()']]], + ['next_5fhigher_5fnumber_45',['next_higher_number',['../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e',1,'bit_manipulation']]], + ['next_5fhigher_5fnumber_5fwith_5fsame_5fnumber_5fof_5fset_5fbits_2ecpp_46',['next_higher_number_with_same_number_of_set_bits.cpp',['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html',1,'']]], + ['next_5fpermutation_47',['next_permutation',['http://en.cppreference.com/w/cpp/algorithm/next_permutation.html',0,'std']]], + ['nextafter_48',['nextafter',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]], + ['nexttoward_49',['nexttoward',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]], + ['no_5foccurence_5ftests_50',['no_occurence_tests',['../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d',1,'fibonacci_search.cpp']]], + ['no_5fof_5fconnected_5fcomponents_51',['no_of_connected_components',['../d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141',1,'graph::disjoint_union']]], + ['noboolalpha_52',['noboolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]], + ['node_53',['Node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md93',1,'Method 2: Search from the root node'],['../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html',1,'data_structures::linked_list::Node'],['../d9/d49/structdata__structures_1_1_node.html',1,'data_structures::Node'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html',1,'data_structures::tree_234::Node'],['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html',1,'data_structures::trie_using_hashmap::Trie::Node']]], + ['node_54',['node',['../d5/da1/structnode.html',1,'']]], + ['node_55',['Node',['../db/d8b/struct_node.html',1,'Node< ValueType >'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html',1,'operations_on_datastructures::circular_linked_list::Node'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html',1,'operations_on_datastructures::inorder_traversal_of_bst::Node'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html',1,'operations_on_datastructures::reverse_binary_tree::Node'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html',1,'others::iterative_tree_traversals::Node'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html',1,'others::recursive_tree_traversals::Node'],['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html',1,'range_queries::perSegTree::Node'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html',1,'search::sublist_search::Node'],['../dd/d1c/classhash__chain.html#a8b204861e9470377c956d3b5cd313036',1,'hash_chain::Node'],['../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78',1,'data_structures::Node::Node()'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670',1,'data_structures::tree_234::Node::Node()'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5',1,'operations_on_datastructures::circular_linked_list::Node::Node(int64_t _data)'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95',1,'operations_on_datastructures::circular_linked_list::Node::Node(int64_t _data, Node *_next)'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3',1,'operations_on_datastructures::reverse_binary_tree::Node::Node()']]], + ['node_56',['node',['../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287',1,'node: avltree.cpp'],['../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555',1,'node: hash_search.cpp']]], + ['node_20does_20not_20have_20a_20right_20node_20subtree_57',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['node_20has_20the_20right_20node_20subtree_58',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['node_2ehpp_59',['node.hpp',['../d3/d09/node_8hpp.html',1,'']]], + ['node_3c_20value_5ftype_20_3e_60',['Node< value_type >',['../db/d8b/struct_node.html',1,'']]], + ['nodes_61',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], + ['non_5frecursive_5fmerge_5fsort_62',['non_recursive_merge_sort',['../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)'],['../d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534',1,'sorting::non_recursive_merge_sort(const Iterator first, const size_t n)'],['../d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last)']]], + ['non_5frecursive_5fmerge_5fsort_2ecpp_63',['non_recursive_merge_sort.cpp',['../d0/db6/non__recursive__merge__sort_8cpp.html',1,'']]], + ['none_64',['none',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], + ['none_5fof_65',['none_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], + ['normal_5fdistribution_66',['normal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution.html',0,'std::normal_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/normal_distribution.html',0,'std::normal_distribution::normal_distribution()']]], + ['noshowbase_67',['noshowbase',['http://en.cppreference.com/w/cpp/io/manip/showbase.html',0,'std']]], + ['noshowpoint_68',['noshowpoint',['http://en.cppreference.com/w/cpp/io/manip/showpoint.html',0,'std']]], + ['noshowpos_69',['noshowpos',['http://en.cppreference.com/w/cpp/io/manip/showpos.html',0,'std']]], + ['noskipws_70',['noskipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]], + ['not_20have_20a_20right_20node_20subtree_71',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['not_20matching_20edges_72',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]], + ['not1_73',['not1',['http://en.cppreference.com/w/cpp/utility/functional/not1.html',0,'std']]], + ['not2_74',['not2',['http://en.cppreference.com/w/cpp/utility/functional/not2.html',0,'std']]], + ['not_5feof_75',['not_eof',['http://en.cppreference.com/w/cpp/string/char_traits/not_eof.html',0,'std::char_traits']]], + ['not_5fequal_5fto_76',['not_equal_to',['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std']]], + ['nothrow_5ft_77',['nothrow_t',['http://en.cppreference.com/w/cpp/memory/new/nothrow_t.html',0,'std']]], + ['notify_5fall_78',['notify_all',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_all.html',0,'std::condition_variable_any::notify_all()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_all.html',0,'std::condition_variable::notify_all()']]], + ['notify_5fall_5fat_5fthread_5fexit_79',['notify_all_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/notify_all_at_thread_exit.html',0,'std']]], + ['notify_5fone_80',['notify_one',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_one.html',0,'std::condition_variable_any::notify_one()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_one.html',0,'std::condition_variable::notify_one()']]], + ['nounitbuf_81',['nounitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], + ['nouppercase_82',['nouppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], + ['now_83',['now',['http://en.cppreference.com/w/cpp/chrono/steady_clock/now.html',0,'std::chrono::steady_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/system_clock/now.html',0,'std::chrono::system_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html',0,'std::chrono::high_resolution_clock::now()']]], + ['nqueen_5fprint_5fall_5fsolutions_2ecpp_84',['nqueen_print_all_solutions.cpp',['../d7/d24/nqueen__print__all__solutions_8cpp.html',1,'']]], + ['nqueensol_85',['NQueenSol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f',1,'backtracking::n_queens_optimized::NQueenSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108',1,'backtracking::n_queens_all_solutions::NQueenSol()']]], + ['nth_5felement_86',['nth_element',['http://en.cppreference.com/w/cpp/algorithm/nth_element.html',0,'std']]], + ['nullptr_5ft_87',['nullptr_t',['http://en.cppreference.com/w/cpp/types/nullptr_t.html',0,'std']]], + ['num_5fchars_88',['NUM_CHARS',['../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191',1,'data_structures::trie']]], + ['num_5fdigits_89',['num_digits',['../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93',1,'large_number']]], + ['num_5fget_90',['num_get',['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get'],['http://en.cppreference.com/w/cpp/locale/num_get/num_get.html',0,'std::num_get::num_get()']]], + ['num_5fput_91',['num_put',['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put'],['http://en.cppreference.com/w/cpp/locale/num_put/num_put.html',0,'std::num_put::num_put()']]], + ['number_5fof_5fpositive_5fdivisors_92',['number_of_positive_divisors',['../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb',1,'number_of_positive_divisors.cpp']]], + ['number_5fof_5fpositive_5fdivisors_2ecpp_93',['number_of_positive_divisors.cpp',['../d0/da2/number__of__positive__divisors_8cpp.html',1,'']]], + ['number_5fof_5fsubsets_94',['number_of_subsets',['../d0/dfe/backtracking_2subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99',1,'backtracking::subset_sum']]], + ['number_5fof_5fvertices_95',['number_of_vertices',['../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904',1,'graph::Graph']]], + ['numberofchildren_96',['numberOfChildren',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0',1,'operations_on_datastructures::trie_operations::Tnode']]], + ['numberofciphersinfactorialn_97',['numberOfCiphersInFactorialN',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0',1,'bit_manipulation::count_of_trailing_ciphers_in_factorial_n']]], + ['numeric_5flimits_98',['numeric_limits',['http://en.cppreference.com/w/cpp/types/numeric_limits.html',0,'std']]], + ['numerical_20methods_99',['Numerical Methods',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60',1,'']]], + ['numerical_5fmethods_100',['numerical_methods',['../d1/de0/namespacenumerical__methods.html',1,'']]], + ['numpunct_101',['numpunct',['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct'],['http://en.cppreference.com/w/cpp/locale/numpunct/numpunct.html',0,'std::numpunct::numpunct()']]], + ['numpunct_5fbyname_102',['numpunct_byname',['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std::numpunct_byname'],['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std::numpunct_byname::numpunct_byname()']]] ]; diff --git a/search/all_14.js b/search/all_14.js index d5ef7795c..5af7c1ec0 100644 --- a/search/all_14.js +++ b/search/all_14.js @@ -5,7 +5,7 @@ var searchData= ['ode_5fmidpoint_5feuler_2ecpp_2',['ode_midpoint_euler.cpp',['../d6/dd3/ode__midpoint__euler_8cpp.html',1,'']]], ['ode_5fsemi_5fimplicit_5feuler_2ecpp_3',['ode_semi_implicit_euler.cpp',['../d3/d06/ode__semi__implicit__euler_8cpp.html',1,'']]], ['of_20a_20program_4',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]], - ['of_20a_20tree_5',['of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md96',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md102',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Preorder Traversal of a tree']]], + ['of_20a_20tree_5',['Of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md96',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md102',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Preorder Traversal of a tree']]], ['of_20conduct_6',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], ['of_20parent_20nodes_7',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], ['offset_8',['offset',['../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801',1,'range_queries::fenwick_tree']]], @@ -13,56 +13,56 @@ var searchData= ['ols_5ftest_10',['ols_test',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d',1,'ordinary_least_squares_regressor.cpp']]], ['on_20datastructures_11',['Operations On Datastructures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61',1,'']]], ['on_5fsegment_12',['on_segment',['../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf',1,'SegmentIntersection']]], - ['once_5fflag_13',['once_flag',['http://en.cppreference.com/w/cpp/thread/once_flag.html',0,'std::once_flag::once_flag()'],['http://en.cppreference.com/w/cpp/thread/once_flag.html',0,'std::once_flag']]], - ['open_14',['open',['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::wfilebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::basic_ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::fstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::basic_filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::basic_fstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::ifstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::wifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::basic_ifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::wfstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::wofstream::open()']]], + ['once_5fflag_13',['once_flag',['http://en.cppreference.com/w/cpp/thread/once_flag.html',0,'std::once_flag'],['http://en.cppreference.com/w/cpp/thread/once_flag.html',0,'std::once_flag::once_flag()']]], + ['open_14',['open',['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::basic_ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::fstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::basic_filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::basic_fstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::wfilebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::wifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::basic_ifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::wfstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::wofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::ifstream::open()']]], ['open_20addressing_15',['Open Addressing',['../d4/d39/group__open__addressing.html',1,'']]], ['opening_16',['opening',['../dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21',1,'paranthesis_matching.cpp']]], ['operations_20on_20datastructures_17',['Operations On Datastructures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61',1,'']]], ['operations_5fon_5fdatastructures_18',['operations_on_datastructures',['../da/d6d/namespaceoperations__on__datastructures.html',1,'']]], ['operator_20auto_5fptr_3c_20y_20_3e_19',['operator auto_ptr< Y >',['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator_auto_ptr.html',0,'std::auto_ptr']]], - ['operator_20bool_20',['operator bool',['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator_bool.html',0,'std::unique_lock::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ios::operator bool()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator_bool.html',0,'std::shared_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator_bool.html',0,'std::unique_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator_bool.html',0,'std::shared_lock::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_code/operator_bool.html',0,'std::error_code::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::strstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator_bool.html',0,'std::function::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator_bool.html',0,'std::error_condition::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wiostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator_bool.html',0,'std::experimental::optional::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wfstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wstringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::operator bool()'],['../db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e',1,'uint128_t::operator bool()'],['../d1/d83/classuint256__t.html#a28aa5786bbfce1b00398a8d38691bdaa',1,'uint256_t::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::operator bool()']]], - ['operator_20string_5ftype_21',['operator string_type',['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::operator string_type()']]], - ['operator_20t_22',['operator t',['../d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363',1,'uint256_t::operator T()'],['../db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639',1,'uint128_t::operator T()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_T.html',0,'std::atomic::operator T()']]], + ['operator_20bool_20',['operator bool',['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator_bool.html',0,'std::unique_lock::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ios::operator bool()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator_bool.html',0,'std::shared_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator_bool.html',0,'std::unique_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator_bool.html',0,'std::shared_lock::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_code/operator_bool.html',0,'std::error_code::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::strstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator_bool.html',0,'std::function::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator_bool.html',0,'std::error_condition::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wiostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator_bool.html',0,'std::experimental::optional::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wfstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wstringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::operator bool()'],['../db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e',1,'uint128_t::operator bool()'],['../d1/d83/classuint256__t.html#a28aa5786bbfce1b00398a8d38691bdaa',1,'uint256_t::operator bool()']]], + ['operator_20string_5ftype_21',['operator string_type',['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::operator string_type()']]], + ['operator_20t_22',['operator T',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_T.html',0,'std::atomic::operator T()'],['../db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639',1,'uint128_t::operator T()'],['../d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363',1,'uint256_t::operator T()']]], ['operator_20t_26_23',['operator T&',['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper']]], ['operator_20uint128_5ft_24',['operator uint128_t',['../d1/d83/classuint256__t.html#ad5bd38b2d3becca998457af1124d6e8b',1,'uint256_t']]], - ['operator_21_25',['operator!',['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::strstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wiostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wfstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wstringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ifstream::operator!()'],['../db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d',1,'uint128_t::operator!()'],['../d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c',1,'uint256_t::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ios::operator!()']]], - ['operator_21_3d_26',['operator!=',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator!=()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator!=()'],['../db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e',1,'uint128_t::operator!=(const uint128_t &other)'],['../db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696',1,'uint128_t::operator!=(const T other)'],['../d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547',1,'uint256_t::operator!=(const uint256_t &other)'],['../d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb',1,'uint256_t::operator!=(const T &other)'],['../db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94',1,'large_number::operator!='],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator!=()']]], + ['operator_21_25',['operator!',['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ios::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::strstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wiostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wfstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wstringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ifstream::operator!()'],['../db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d',1,'uint128_t::operator!()'],['../d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c',1,'uint256_t::operator!()']]], + ['operator_21_3d_26',['operator!=',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator!=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator!=()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator!=()'],['../db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e',1,'uint128_t::operator!=(const uint128_t &other)'],['../db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696',1,'uint128_t::operator!=(const T other)'],['../d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547',1,'uint256_t::operator!=(const uint256_t &other)'],['../d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb',1,'uint256_t::operator!=(const T &other)'],['../db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94',1,'large_number::operator!='],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator!=()']]], ['operator_25_27',['operator%',['../db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066',1,'uint128_t::operator%(const uint128_t &p)'],['../db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad',1,'uint128_t::operator%(const T &p)'],['../d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2',1,'uint256_t::operator%(const uint256_t &p)'],['../d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc',1,'uint256_t::operator%(const T &p)']]], - ['operator_25_3d_28',['operator%=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator%=()'],['../db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2',1,'uint128_t::operator%=(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40',1,'uint128_t::operator%=(const T &p)'],['../d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb',1,'uint256_t::operator%=(const uint256_t &p)'],['../d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d',1,'uint256_t::operator%=(const T &p)'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator%=()']]], - ['operator_26_29',['operator&',['../d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839',1,'uint256_t::operator&()'],['../db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244',1,'uint128_t::operator&(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4',1,'uint128_t::operator&(const T p)'],['../d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8',1,'uint256_t::operator&(const T &p)']]], - ['operator_26_26_30',['operator&&',['../d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963',1,'uint256_t::operator&&()'],['../db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a',1,'uint128_t::operator&&(const T b)'],['../db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1',1,'uint128_t::operator&&(const uint128_t &b)'],['../d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409',1,'uint256_t::operator&&(const T &b)']]], - ['operator_26_3d_31',['operator&=',['../d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d',1,'uint256_t::operator&=(const uint256_t &p)'],['../d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5',1,'uint256_t::operator&=(const T p)'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator&=()'],['../db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050',1,'uint128_t::operator&=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator&=()'],['../db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640',1,'uint128_t::operator&=()']]], - ['operator_28_29_32',['operator()',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937_64::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/operator().html',0,'std::extreme_value_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/operator().html',0,'std::lognormal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std::greater_equal::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/operator().html',0,'std::discrete_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux48::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/operator().html',0,'std::piecewise_constant_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less_equal.html',0,'std::less_equal::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_or.html',0,'std::logical_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::discard_block_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/operator().html',0,'std::exponential_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mersenne_twister_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/negate.html',0,'std::negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std::not_equal_to::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/operator().html',0,'std::independent_bits_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/operator().html',0,'std::normal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand::operator()()'],['http://en.cppreference.com/w/cpp/locale/locale/operator().html',0,'std::locale::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/equal_to.html',0,'std::equal_to::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std::divides::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/operator().html',0,'std::weibull_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less.html',0,'std::less::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/multiplies.html',0,'std::multiplies::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator().html',0,'std::reference_wrapper::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux48_base::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_not.html',0,'std::bit_not::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/operator().html',0,'std::chi_squared_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/operator().html',0,'std::piecewise_linear_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/hash/operator().html',0,'std::hash::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::shuffle_order_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std::greater::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_and.html',0,'std::bit_and::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/operator().html',0,'std::uniform_int_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/operator().html',0,'std::fisher_f_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux24::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std::plus::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_or.html',0,'std::bit_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator().html',0,'std::function::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/minus.html',0,'std::minus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::linear_congruential_engine::operator()()'],['http://en.cppreference.com/w/cpp/memory/owner_less.html',0,'std::owner_less::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::knuth_b::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand0::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_not.html',0,'std::logical_not::operator()()'],['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/operator().html',0,'std::gamma_distribution::operator()()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator().html',0,'std::packaged_task::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/operator().html',0,'std::cauchy_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::subtract_with_carry_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/operator().html',0,'std::random_device::operator()()'],['../db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733',1,'uint128_t::operator()()'],['../d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b',1,'uint256_t::operator()()'],['../de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c',1,'Compare::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_and.html',0,'std::logical_and::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/modulus.html',0,'std::modulus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/operator().html',0,'std::student_t_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux24_base::operator()()']]], - ['operator_2a_33',['operator*',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator*.html',0,'std::raw_storage_iterator::operator*()'],['../db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30',1,'uint128_t::operator*(const T p)'],['../db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860',1,'uint128_t::operator*(const uint128_t &p)'],['../d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616',1,'uint256_t::operator*(const T &p)'],['../d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967',1,'uint256_t::operator*(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Matrix< Number > &other) const'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Number other) const'],['../da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d',1,'Complex::operator*()'],['../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695',1,'machine_learning::operator*()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a42535e20e97d85aa61271e0894cc0359',1,'operator*(): ordinary_least_squares_regressor.cpp'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator*()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a207b3a99fd5974d3117e0b0ac0aad234',1,'operator*(float const scalar, std::vector< T > const &A): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a865e8d26a01962cc93aca66e71346f37',1,'operator*(std::vector< std::vector< T > > const &A, std::vector< T > const &B): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713',1,'operator*(std::vector< std::vector< T > > const &A, std::vector< std::vector< T > > const &B): ordinary_least_squares_regressor.cpp'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator*()']]], - ['operator_2a_3d_34',['operator*=',['../db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295',1,'uint128_t::operator*=()'],['../d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028',1,'uint256_t::operator*=(const T &p)'],['../d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21',1,'uint256_t::operator*=(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*=()'],['../db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350',1,'large_number::operator*=()'],['../db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092',1,'uint128_t::operator*=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator*=()']]], - ['operator_2b_35',['operator+',['../db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606',1,'uint128_t::operator+()'],['../d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f',1,'uint256_t::operator+()'],['../db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d',1,'uint128_t::operator+()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+()'],['../da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c',1,'Complex::operator+()'],['../db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46',1,'large_number::operator+'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f',1,'operator+(): ordinary_least_squares_regressor.cpp'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator+()'],['../d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75',1,'uint256_t::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator+()'],['../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2',1,'machine_learning::operator+()']]], - ['operator_2b_2b_36',['operator++',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator_arith.html',0,'std::raw_storage_iterator::operator++()'],['../db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e',1,'uint128_t::operator++()'],['../db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6',1,'uint128_t::operator++(int)'],['../d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9',1,'uint256_t::operator++()'],['../d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c',1,'uint256_t::operator++(int)'],['../db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a',1,'large_number::operator++()'],['../db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687',1,'large_number::operator++(int)'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++()']]], - ['operator_2b_2b_28int_29_37',['operator++(int)',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++(int)()']]], - ['operator_2b_3d_38',['operator+=',['../d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1',1,'uint256_t::operator+=(const T &p)'],['../d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e',1,'uint256_t::operator+=(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+=()'],['../db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf',1,'large_number::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator+=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator+=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator+=()'],['../db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004',1,'uint128_t::operator+=(const T p)'],['../db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb',1,'uint128_t::operator+=(const uint128_t &p)'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator+=()']]], - ['operator_2d_39',['operator-',['../d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4',1,'uint256_t::operator-(const T &p)'],['../d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d',1,'uint256_t::operator-(const uint256_t &p)'],['../d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06',1,'uint256_t::operator-()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-()'],['../da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da',1,'Complex::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator-()'],['../db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3',1,'uint128_t::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator-()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator-()'],['../db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec',1,'uint128_t::operator-(const T &p)'],['../db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c',1,'uint128_t::operator-(const uint128_t &p)'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4a6a560dbdd0177633783b72db37dc19',1,'operator-(): ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3',1,'machine_learning::operator-()']]], - ['operator_2d_2d_40',['operator--',['../d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13',1,'uint256_t::operator--(int p)'],['../d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183',1,'uint256_t::operator--()'],['../db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414',1,'uint128_t::operator--(int p)'],['../db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed',1,'uint128_t::operator--()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator--()']]], - ['operator_2d_2d_28int_29_41',['operator--(int)',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator--(int)()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator--(int)()']]], - ['operator_2d_3d_42',['operator-=',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator-=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator-=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator-=()'],['../db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798',1,'uint128_t::operator-=(const T &p)'],['../db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8',1,'uint128_t::operator-=(const uint128_t &p)'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator-=()'],['../d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7',1,'uint256_t::operator-=(const T p)'],['../d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45',1,'uint256_t::operator-=(const uint256_t &p)']]], - ['operator_2d_3e_43',['operator->',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator->()']]], - ['operator_2f_44',['operator/',['../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5',1,'machine_learning::operator/()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7a2d742b9a3ae7b85292e1f86428bb4f',1,'operator/(): ordinary_least_squares_regressor.cpp'],['../db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee',1,'uint128_t::operator/(const uint128_t &p)'],['../db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94',1,'uint128_t::operator/(const T p)'],['../d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6',1,'uint256_t::operator/(const T &p)'],['../d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df',1,'uint256_t::operator/(const uint256_t &p)'],['../da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90',1,'Complex::operator/()']]], - ['operator_2f_3d_45',['operator/=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator/=()'],['../db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b',1,'uint128_t::operator/=()'],['../d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4',1,'uint256_t::operator/=(const uint256_t &p)'],['../d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259',1,'uint256_t::operator/=(const T &p)'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator/=()'],['../db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db',1,'uint128_t::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator/=()']]], - ['operator_3c_46',['operator<',['../db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4',1,'uint128_t::operator<()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator<()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator<()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator<()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba',1,'machine_learning::aystar_search::EightPuzzle::operator<()'],['../d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056',1,'uint256_t::operator<(const T &other)'],['../d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96',1,'uint256_t::operator<(const uint256_t &other)'],['../db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc',1,'uint128_t::operator<()']]], - ['operator_3c_3c_47',['operator<<',['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wiostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostrstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wfstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_iostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wstringstream::operator<<()'],['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#af2142b27241b28f835e8ce78d7d6463c',1,'ciphers::elliptic_curve_key_exchange::Point::operator<<'],['../db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190',1,'uint128_t::operator<<(const T p)'],['../db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953',1,'uint128_t::operator<<'],['../d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5',1,'uint256_t::operator<<(const T &p)'],['../d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a',1,'uint256_t::operator<<'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742',1,'machine_learning::aystar_search::EightPuzzle::operator<<'],['../d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa',1,'machine_learning::adaline::operator<<'],['../db/d82/classlarge__number.html#a13282908dfc4888392ed3d1fc6aae492',1,'large_number::operator<<'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::strstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::fstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_fstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::iostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::stringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_stringstream::operator<<()'],['../d2/d3b/namespaceqr__algorithm.html#a257425cb2365359da51c6fe6741834d8',1,'qr_algorithm::operator<<(std::ostream &out, std::valarray< T > const &v)'],['../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834',1,'qr_algorithm::operator<<(std::ostream &out, std::valarray< std::valarray< T > > const &v)'],['../dd/d65/lu__decompose_8cpp.html#a575c989afcc78e875031cd4273e62a3e',1,'operator<<(std::ostream &out, matrix< T > const &v): lu_decompose.cpp'],['../d5/d67/complex__numbers_8cpp.html#a44d5f25b573e870accdf26fd32b8484d',1,'operator<<(std::ostream &os, const Complex &num): complex_numbers.cpp'],['../d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269',1,'machine_learning::operator<<(std::ostream &out, const std::valarray< T > &A)'],['../d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35',1,'machine_learning::operator<<(std::ostream &out, const std::pair< T, T > &A)'],['../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7',1,'machine_learning::operator<<(std::ostream &out, std::vector< std::valarray< T > > const &A)'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ab1ad727903d7817c2758d25bcb52cbc8',1,'operator<<(std::ostream &out, std::vector< T > const &v): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4',1,'operator<<(std::ostream &out, std::vector< std::vector< T > > const &v): ordinary_least_squares_regressor.cpp'],['../d7/db9/hill__cipher_8cpp.html#a34bfcd756610834acac501f9eea1e2eb',1,'operator<<(std::ostream &out, matrix< T > const &v): hill_cipher.cpp'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_ltlt.html',0,'std::thread::id::operator<<()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator<<(T... args)']]], - ['operator_3c_3c_3d_48',['operator<<=',['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator<<=()'],['../db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a',1,'uint128_t::operator<<=()'],['../d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5',1,'uint256_t::operator<<=(const T &p)']]], - ['operator_3c_3d_49',['operator<=',['../d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88',1,'uint256_t::operator<=()'],['../db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c',1,'uint128_t::operator<=()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator<=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator<=()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator<=()'],['../d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2',1,'uint256_t::operator<=()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee',1,'machine_learning::aystar_search::EightPuzzle::operator<=()'],['../db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a',1,'uint128_t::operator<=()']]], - ['operator_3d_50',['operator=',['http://en.cppreference.com/w/cpp/container/stack/operator=.html',0,'std::stack::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_future/operator=.html',0,'std::shared_future::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::wstreambuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::stringstream::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/operator=.html',0,'std::unordered_multimap::operator=()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator=.html',0,'std::unique_ptr::operator=()'],['http://en.cppreference.com/w/cpp/container/forward_list/operator=.html',0,'std::forward_list::operator=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator=.html',0,'std::locale::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator=.html',0,'std::shared_lock::operator=()'],['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/operator=.html',0,'std::enable_shared_from_this::operator=()'],['http://en.cppreference.com/w/cpp/thread/future/operator=.html',0,'std::future::operator=()'],['http://en.cppreference.com/w/cpp/utility/pair/operator=.html',0,'std::pair::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wsregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/error/error_code/operator=.html',0,'std::error_code::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::wifstream::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator=.html',0,'std::reference_wrapper::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::minutes::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::seconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::duration::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::milliseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::hours::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::microseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::nanoseconds::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::basic_stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/container/deque/operator=.html',0,'std::deque::operator=()'],['http://en.cppreference.com/w/cpp/thread/promise/operator=.html',0,'std::promise::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::basic_streambuf::operator=()'],['http://en.cppreference.com/w/cpp/container/queue/operator=.html',0,'std::queue::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator=.html',0,'std::atomic::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::basic_stringstream::operator=()'],['http://en.cppreference.com/w/cpp/thread/thread/operator=.html',0,'std::thread::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::basic_string::operator=()'],['http://en.cppreference.com/w/cpp/container/priority_queue/operator=.html',0,'std::priority_queue::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::wostringstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::cregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::wstring::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/operator=.html',0,'std::unordered_multiset::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wsregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator=.html',0,'std::function::operator=()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator=.html',0,'std::error_condition::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::filebuf::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u16string::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u32string::operator=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator=.html',0,'std::complex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::ofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::basic_istringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::basic_ifstream::operator=()'],['http://en.cppreference.com/w/cpp/container/list/operator=.html',0,'std::list::operator=()'],['http://en.cppreference.com/w/cpp/container/map/operator=.html',0,'std::map::operator=()'],['http://en.cppreference.com/w/cpp/error/exception/operator=.html',0,'std::exception::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::streambuf::operator=()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator=.html',0,'std::experimental::optional::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wcregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::regex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::istringstream::operator=()'],['http://en.cppreference.com/w/cpp/error/nested_exception/operator=.html',0,'std::nested_exception::operator=()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator=.html',0,'std::auto_ptr::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::sregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator=.html',0,'std::packaged_task::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_set/operator=.html',0,'std::unordered_set::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::wfstream::operator=()'],['http://en.cppreference.com/w/cpp/container/multimap/operator=.html',0,'std::multimap::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/operator=.html',0,'std::atomic_flag::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::wofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::wstringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::wistringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::ifstream::operator=()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator=.html',0,'std::raw_storage_iterator::operator=()'],['../db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544',1,'uint128_t::operator=(const T &p)'],['../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74',1,'uint128_t::operator=(const std::string &p)'],['../db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5',1,'uint128_t::operator=(const uint128_t &p)=default'],['../db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a',1,'uint128_t::operator=(uint128_t &&p)=default'],['../d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc',1,'uint256_t::operator=(const uint256_t &p)=default'],['../d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c',1,'uint256_t::operator=(const T &p)'],['../d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2',1,'uint256_t::operator=(const std::string &p)'],['../d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638',1,'uint256_t::operator=(uint256_t &&p)=default'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab164909ee7eadc4ab186d850e716abdf',1,'data_structures::linked_list::list::operator=()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2',1,'machine_learning::aystar_search::EightPuzzle::operator=(const EightPuzzle &A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101',1,'machine_learning::aystar_search::EightPuzzle::operator=(EightPuzzle &&A) noexcept'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(const Info &A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(Info &&A) noexcept'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a',1,'machine_learning::k_nearest_neighbors::Knn::operator=(const Knn &model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563',1,'machine_learning::k_nearest_neighbors::Knn::operator=(Knn &&)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2',1,'machine_learning::neural_network::layers::DenseLayer::operator=(const DenseLayer &layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114',1,'machine_learning::neural_network::layers::DenseLayer::operator=(DenseLayer &&)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f',1,'machine_learning::neural_network::NeuralNetwork::operator=(const NeuralNetwork &model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2c49bfebf9b859d5ceb26035d3003601',1,'machine_learning::neural_network::NeuralNetwork::operator=(NeuralNetwork &&)=default'],['../da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac',1,'Complex::operator=()'],['../db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b',1,'large_number::operator=()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(const CircularLinkedList &other)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(CircularLinkedList &&other) noexcept'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::wfilebuf::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::cregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::wregex::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wcregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::basic_fstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc::operator=()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator=.html',0,'std::shared_ptr::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::sregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/utility/tuple/operator=.html',0,'std::tuple::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::wstringbuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::basic_filebuf::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::basic_regex::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_map/operator=.html',0,'std::unordered_map::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::regex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::basic_ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator=.html',0,'std::unique_lock::operator=()'],['http://en.cppreference.com/w/cpp/container/set/operator=.html',0,'std::set::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::string::operator=()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/operator=.html',0,'std::weak_ptr::operator=()'],['http://en.cppreference.com/w/cpp/container/multiset/operator=.html',0,'std::multiset::operator=()'],['http://en.cppreference.com/w/cpp/container/vector/operator=.html',0,'std::vector::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::regex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::fstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::basic_ofstream::operator=()']]], - ['operator_3d_3d_51',['operator==',['../d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261',1,'uint256_t::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator==()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator==()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator==()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator==()'],['../d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89',1,'operator==(): complex_numbers.cpp'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator==()'],['../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca',1,'large_number::operator=='],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915',1,'machine_learning::aystar_search::EightPuzzle::operator==()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator==()'],['../d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484',1,'uint256_t::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator==()'],['../db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896',1,'uint128_t::operator==(const T other)'],['../db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e',1,'uint128_t::operator==(const uint128_t &other)'],['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446',1,'ciphers::elliptic_curve_key_exchange::Point::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator==()']]], - ['operator_3e_52',['operator>',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator>()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator>()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator>()'],['../db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e',1,'uint128_t::operator>()'],['../d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d',1,'uint256_t::operator>(const uint256_t &other)'],['../d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13',1,'uint256_t::operator>(const T &other)'],['../db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440',1,'uint128_t::operator>(const uint128_t &other)']]], - ['operator_3e_3d_53',['operator>=',['../db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481',1,'uint128_t::operator>=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator>=()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator>=()'],['../d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad',1,'uint256_t::operator>=(const uint256_t &other)'],['../d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad',1,'uint256_t::operator>=(const T &other)'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator>=()'],['../db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292',1,'uint128_t::operator>=()']]], - ['operator_3e_3e_54',['operator>>',['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wiostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::fstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_fstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::iostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::stringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wifstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::strstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_stringstream::operator>>()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istrstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_ifstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wfstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_iostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wstringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::ifstream::operator>>()'],['../db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848',1,'uint128_t::operator>>()'],['../d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51',1,'uint256_t::operator>>()'],['../d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797',1,'statistics::stats_computer1::operator>>'],['../d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a',1,'statistics::stats_computer2::operator>>']]], + ['operator_25_3d_28',['operator%=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator%=()'],['../db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2',1,'uint128_t::operator%=(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40',1,'uint128_t::operator%=(const T &p)'],['../d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb',1,'uint256_t::operator%=(const uint256_t &p)'],['../d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d',1,'uint256_t::operator%=(const T &p)']]], + ['operator_26_29',['operator&',['../db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244',1,'uint128_t::operator&(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4',1,'uint128_t::operator&(const T p)'],['../d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8',1,'uint256_t::operator&(const T &p)'],['../d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839',1,'uint256_t::operator&(const uint256_t &p)']]], + ['operator_26_26_30',['operator&&',['../db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1',1,'uint128_t::operator&&(const uint128_t &b)'],['../db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a',1,'uint128_t::operator&&(const T b)'],['../d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963',1,'uint256_t::operator&&(const uint256_t &b)'],['../d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409',1,'uint256_t::operator&&(const T &b)']]], + ['operator_26_3d_31',['operator&=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator&=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator&=()'],['../db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050',1,'uint128_t::operator&=(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640',1,'uint128_t::operator&=(const T p)'],['../d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d',1,'uint256_t::operator&=(const uint256_t &p)'],['../d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5',1,'uint256_t::operator&=(const T p)']]], + ['operator_28_29_32',['operator()',['http://en.cppreference.com/w/cpp/utility/functional/logical_and.html',0,'std::logical_and::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/modulus.html',0,'std::modulus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/operator().html',0,'std::student_t_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937_64::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux24_base::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/operator().html',0,'std::extreme_value_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/operator().html',0,'std::lognormal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std::greater_equal::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/operator().html',0,'std::discrete_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux48::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/operator().html',0,'std::piecewise_constant_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less_equal.html',0,'std::less_equal::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_or.html',0,'std::logical_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::discard_block_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/operator().html',0,'std::exponential_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mersenne_twister_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/negate.html',0,'std::negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std::not_equal_to::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/operator().html',0,'std::independent_bits_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/operator().html',0,'std::normal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand::operator()()'],['http://en.cppreference.com/w/cpp/locale/locale/operator().html',0,'std::locale::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/equal_to.html',0,'std::equal_to::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std::divides::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/operator().html',0,'std::weibull_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less.html',0,'std::less::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/multiplies.html',0,'std::multiplies::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator().html',0,'std::reference_wrapper::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux48_base::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_not.html',0,'std::bit_not::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/operator().html',0,'std::chi_squared_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/operator().html',0,'std::piecewise_linear_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/hash/operator().html',0,'std::hash::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::shuffle_order_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std::greater::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_and.html',0,'std::bit_and::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/operator().html',0,'std::uniform_int_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/operator().html',0,'std::fisher_f_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux24::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std::plus::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_or.html',0,'std::bit_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator().html',0,'std::function::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/minus.html',0,'std::minus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::linear_congruential_engine::operator()()'],['http://en.cppreference.com/w/cpp/memory/owner_less.html',0,'std::owner_less::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::knuth_b::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand0::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_not.html',0,'std::logical_not::operator()()'],['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/operator().html',0,'std::gamma_distribution::operator()()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator().html',0,'std::packaged_task::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/operator().html',0,'std::cauchy_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::subtract_with_carry_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/operator().html',0,'std::random_device::operator()()'],['../db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733',1,'uint128_t::operator()()'],['../d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b',1,'uint256_t::operator()()'],['../de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c',1,'Compare::operator()()']]], + ['operator_2a_33',['operator*',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator*.html',0,'std::raw_storage_iterator::operator*()'],['../db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30',1,'uint128_t::operator*(const T p)'],['../db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860',1,'uint128_t::operator*(const uint128_t &p)'],['../d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616',1,'uint256_t::operator*(const T &p)'],['../d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967',1,'uint256_t::operator*(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Matrix< Number > &other) const'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Number other) const'],['../da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d',1,'Complex::operator*()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713',1,'operator*(std::vector< std::vector< T > > const &A, std::vector< std::vector< T > > const &B): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a865e8d26a01962cc93aca66e71346f37',1,'operator*(std::vector< std::vector< T > > const &A, std::vector< T > const &B): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a207b3a99fd5974d3117e0b0ac0aad234',1,'operator*(float const scalar, std::vector< T > const &A): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a42535e20e97d85aa61271e0894cc0359',1,'operator*(std::vector< T > const &A, float const scalar): ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695',1,'machine_learning::operator*()']]], + ['operator_2a_3d_34',['operator*=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator*=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator*=()'],['../db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092',1,'uint128_t::operator*=(const T p)'],['../db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295',1,'uint128_t::operator*=(const uint128_t &p)'],['../d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028',1,'uint256_t::operator*=(const T &p)'],['../d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21',1,'uint256_t::operator*=(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*=()'],['../db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350',1,'large_number::operator*=()']]], + ['operator_2b_35',['operator+',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator+()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator+()'],['../db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d',1,'uint128_t::operator+(const T p)'],['../db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606',1,'uint128_t::operator+(const uint128_t &p)'],['../d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f',1,'uint256_t::operator+(const T &p)'],['../d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75',1,'uint256_t::operator+(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+()'],['../da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c',1,'Complex::operator+()'],['../db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46',1,'large_number::operator+'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f',1,'operator+(): ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2',1,'machine_learning::operator+()']]], + ['operator_2b_2b_36',['operator++',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator_arith.html',0,'std::raw_storage_iterator::operator++()'],['../db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e',1,'uint128_t::operator++()'],['../db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6',1,'uint128_t::operator++(int)'],['../d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9',1,'uint256_t::operator++()'],['../d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c',1,'uint256_t::operator++(int)'],['../db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a',1,'large_number::operator++()'],['../db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687',1,'large_number::operator++(int)']]], + ['operator_2b_2b_28int_29_37',['operator++(int)',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++(int)()']]], + ['operator_2b_3d_38',['operator+=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator+=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator+=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator+=()'],['../db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004',1,'uint128_t::operator+=(const T p)'],['../db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb',1,'uint128_t::operator+=(const uint128_t &p)'],['../d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1',1,'uint256_t::operator+=(const T &p)'],['../d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e',1,'uint256_t::operator+=(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+=()'],['../db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf',1,'large_number::operator+=()']]], + ['operator_2d_39',['operator-',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator-()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator-()'],['../db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec',1,'uint128_t::operator-(const T &p)'],['../db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c',1,'uint128_t::operator-(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3',1,'uint128_t::operator-()'],['../d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4',1,'uint256_t::operator-(const T &p)'],['../d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d',1,'uint256_t::operator-(const uint256_t &p)'],['../d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06',1,'uint256_t::operator-()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-()'],['../da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da',1,'Complex::operator-()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4a6a560dbdd0177633783b72db37dc19',1,'operator-(): ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3',1,'machine_learning::operator-()']]], + ['operator_2d_2d_40',['operator--',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator--()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator--()'],['../db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed',1,'uint128_t::operator--()'],['../db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414',1,'uint128_t::operator--(int p)'],['../d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183',1,'uint256_t::operator--()'],['../d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13',1,'uint256_t::operator--(int p)']]], + ['operator_2d_2d_28int_29_41',['operator--(int)',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator--(int)()']]], + ['operator_2d_3d_42',['operator-=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator-=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator-=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator-=()'],['../db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798',1,'uint128_t::operator-=(const T &p)'],['../db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8',1,'uint128_t::operator-=(const uint128_t &p)'],['../d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7',1,'uint256_t::operator-=(const T p)'],['../d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45',1,'uint256_t::operator-=(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-=()']]], + ['operator_2d_3e_43',['operator->',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator->()']]], + ['operator_2f_44',['operator/',['../db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee',1,'uint128_t::operator/(const uint128_t &p)'],['../db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94',1,'uint128_t::operator/(const T p)'],['../d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6',1,'uint256_t::operator/(const T &p)'],['../d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df',1,'uint256_t::operator/(const uint256_t &p)'],['../da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90',1,'Complex::operator/()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7a2d742b9a3ae7b85292e1f86428bb4f',1,'operator/(): ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5',1,'machine_learning::operator/()']]], + ['operator_2f_3d_45',['operator/=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator/=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator/=()'],['../db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db',1,'uint128_t::operator/=(const uint128_t &p)'],['../db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b',1,'uint128_t::operator/=(const T p)'],['../d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4',1,'uint256_t::operator/=(const uint256_t &p)'],['../d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259',1,'uint256_t::operator/=(const T &p)']]], + ['operator_3c_46',['operator<',['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator<()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator<()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator<()'],['../db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4',1,'uint128_t::operator<(const uint128_t &other)'],['../db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc',1,'uint128_t::operator<(const T other)'],['../d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96',1,'uint256_t::operator<(const uint256_t &other)'],['../d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056',1,'uint256_t::operator<(const T &other)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba',1,'machine_learning::aystar_search::EightPuzzle::operator<()']]], + ['operator_3c_3c_47',['operator<<',['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::fstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_fstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::iostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::stringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::strstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_stringstream::operator<<()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator<<()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_ltlt.html',0,'std::thread::id::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wiostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostrstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wfstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_iostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wstringstream::operator<<()'],['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#af2142b27241b28f835e8ce78d7d6463c',1,'ciphers::elliptic_curve_key_exchange::Point::operator<<'],['../db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190',1,'uint128_t::operator<<(const T p)'],['../db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953',1,'uint128_t::operator<<'],['../d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5',1,'uint256_t::operator<<(const T &p)'],['../d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a',1,'uint256_t::operator<<'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742',1,'machine_learning::aystar_search::EightPuzzle::operator<<'],['../d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa',1,'machine_learning::adaline::operator<<'],['../db/d82/classlarge__number.html#a13282908dfc4888392ed3d1fc6aae492',1,'large_number::operator<<'],['../d7/db9/hill__cipher_8cpp.html#a34bfcd756610834acac501f9eea1e2eb',1,'operator<<(std::ostream &out, matrix< T > const &v): hill_cipher.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4',1,'operator<<(std::ostream &out, std::vector< std::vector< T > > const &v): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ab1ad727903d7817c2758d25bcb52cbc8',1,'operator<<(std::ostream &out, std::vector< T > const &v): ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7',1,'machine_learning::operator<<(std::ostream &out, std::vector< std::valarray< T > > const &A)'],['../d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35',1,'machine_learning::operator<<(std::ostream &out, const std::pair< T, T > &A)'],['../d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269',1,'machine_learning::operator<<(std::ostream &out, const std::valarray< T > &A)'],['../d5/d67/complex__numbers_8cpp.html#a44d5f25b573e870accdf26fd32b8484d',1,'operator<<(std::ostream &os, const Complex &num): complex_numbers.cpp'],['../dd/d65/lu__decompose_8cpp.html#a575c989afcc78e875031cd4273e62a3e',1,'operator<<(std::ostream &out, matrix< T > const &v): lu_decompose.cpp'],['../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834',1,'qr_algorithm::operator<<(std::ostream &out, std::valarray< std::valarray< T > > const &v)'],['../d2/d3b/namespaceqr__algorithm.html#a257425cb2365359da51c6fe6741834d8',1,'qr_algorithm::operator<<(std::ostream &out, std::valarray< T > const &v)']]], + ['operator_3c_3c_3d_48',['operator<<=',['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator<<=()'],['../db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a',1,'uint128_t::operator<<=()'],['../d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5',1,'uint256_t::operator<<=()']]], + ['operator_3c_3d_49',['operator<=',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator<=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator<=()'],['../db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a',1,'uint128_t::operator<=(const uint128_t &other)'],['../db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c',1,'uint128_t::operator<=(const T other)'],['../d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88',1,'uint256_t::operator<=(const uint256_t &other)'],['../d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2',1,'uint256_t::operator<=(const T &other)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee',1,'machine_learning::aystar_search::EightPuzzle::operator<=()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator<=()']]], + ['operator_3d_50',['operator=',['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::basic_ofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::fstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::regex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/container/vector/operator=.html',0,'std::vector::operator=()'],['http://en.cppreference.com/w/cpp/container/multiset/operator=.html',0,'std::multiset::operator=()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/operator=.html',0,'std::weak_ptr::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::string::operator=()'],['http://en.cppreference.com/w/cpp/container/set/operator=.html',0,'std::set::operator=()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator=.html',0,'std::unique_lock::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::basic_ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::regex::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_map/operator=.html',0,'std::unordered_map::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::basic_regex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::basic_filebuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::wstringbuf::operator=()'],['http://en.cppreference.com/w/cpp/utility/tuple/operator=.html',0,'std::tuple::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::sregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator=.html',0,'std::shared_ptr::operator=()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::basic_fstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wcregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::wregex::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::cregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::wfilebuf::operator=()'],['http://en.cppreference.com/w/cpp/container/stack/operator=.html',0,'std::stack::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_future/operator=.html',0,'std::shared_future::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::wstreambuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::stringstream::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/operator=.html',0,'std::unordered_multimap::operator=()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator=.html',0,'std::unique_ptr::operator=()'],['http://en.cppreference.com/w/cpp/container/forward_list/operator=.html',0,'std::forward_list::operator=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator=.html',0,'std::locale::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator=.html',0,'std::shared_lock::operator=()'],['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/operator=.html',0,'std::enable_shared_from_this::operator=()'],['http://en.cppreference.com/w/cpp/thread/future/operator=.html',0,'std::future::operator=()'],['http://en.cppreference.com/w/cpp/utility/pair/operator=.html',0,'std::pair::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wsregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/error/error_code/operator=.html',0,'std::error_code::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::wifstream::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator=.html',0,'std::reference_wrapper::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::minutes::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::seconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::duration::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::milliseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::hours::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::microseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::nanoseconds::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::basic_stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/container/deque/operator=.html',0,'std::deque::operator=()'],['http://en.cppreference.com/w/cpp/thread/promise/operator=.html',0,'std::promise::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::basic_streambuf::operator=()'],['http://en.cppreference.com/w/cpp/container/queue/operator=.html',0,'std::queue::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator=.html',0,'std::atomic::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::basic_stringstream::operator=()'],['http://en.cppreference.com/w/cpp/thread/thread/operator=.html',0,'std::thread::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::basic_string::operator=()'],['http://en.cppreference.com/w/cpp/container/priority_queue/operator=.html',0,'std::priority_queue::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::wostringstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::cregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::wstring::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/operator=.html',0,'std::unordered_multiset::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wsregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator=.html',0,'std::function::operator=()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator=.html',0,'std::error_condition::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::filebuf::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u16string::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u32string::operator=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator=.html',0,'std::complex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::ofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::basic_istringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::basic_ifstream::operator=()'],['http://en.cppreference.com/w/cpp/container/list/operator=.html',0,'std::list::operator=()'],['http://en.cppreference.com/w/cpp/container/map/operator=.html',0,'std::map::operator=()'],['http://en.cppreference.com/w/cpp/error/exception/operator=.html',0,'std::exception::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::streambuf::operator=()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator=.html',0,'std::experimental::optional::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wcregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::regex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::istringstream::operator=()'],['http://en.cppreference.com/w/cpp/error/nested_exception/operator=.html',0,'std::nested_exception::operator=()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator=.html',0,'std::auto_ptr::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::sregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator=.html',0,'std::packaged_task::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_set/operator=.html',0,'std::unordered_set::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::wfstream::operator=()'],['http://en.cppreference.com/w/cpp/container/multimap/operator=.html',0,'std::multimap::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/operator=.html',0,'std::atomic_flag::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::wofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::wstringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::wistringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::ifstream::operator=()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator=.html',0,'std::raw_storage_iterator::operator=()'],['../db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544',1,'uint128_t::operator=(const T &p)'],['../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74',1,'uint128_t::operator=(const std::string &p)'],['../db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5',1,'uint128_t::operator=(const uint128_t &p)=default'],['../db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a',1,'uint128_t::operator=(uint128_t &&p)=default'],['../d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc',1,'uint256_t::operator=(const uint256_t &p)=default'],['../d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c',1,'uint256_t::operator=(const T &p)'],['../d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2',1,'uint256_t::operator=(const std::string &p)'],['../d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638',1,'uint256_t::operator=(uint256_t &&p)=default'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab164909ee7eadc4ab186d850e716abdf',1,'data_structures::linked_list::list::operator=()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2',1,'machine_learning::aystar_search::EightPuzzle::operator=(const EightPuzzle &A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101',1,'machine_learning::aystar_search::EightPuzzle::operator=(EightPuzzle &&A) noexcept'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(const Info &A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(Info &&A) noexcept'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a',1,'machine_learning::k_nearest_neighbors::Knn::operator=(const Knn &model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563',1,'machine_learning::k_nearest_neighbors::Knn::operator=(Knn &&)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2',1,'machine_learning::neural_network::layers::DenseLayer::operator=(const DenseLayer &layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114',1,'machine_learning::neural_network::layers::DenseLayer::operator=(DenseLayer &&)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f',1,'machine_learning::neural_network::NeuralNetwork::operator=(const NeuralNetwork &model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2c49bfebf9b859d5ceb26035d3003601',1,'machine_learning::neural_network::NeuralNetwork::operator=(NeuralNetwork &&)=default'],['../da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac',1,'Complex::operator=()'],['../db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b',1,'large_number::operator=()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(const CircularLinkedList &other)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(CircularLinkedList &&other) noexcept']]], + ['operator_3d_3d_51',['operator==',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator==()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator==()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator==()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator==()'],['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446',1,'ciphers::elliptic_curve_key_exchange::Point::operator==()'],['../db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e',1,'uint128_t::operator==(const uint128_t &other)'],['../db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896',1,'uint128_t::operator==(const T other)'],['../d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261',1,'uint256_t::operator==(const uint256_t &other)'],['../d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484',1,'uint256_t::operator==(const T &other)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator==()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915',1,'machine_learning::aystar_search::EightPuzzle::operator==()'],['../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca',1,'large_number::operator=='],['../d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89',1,'operator==(): complex_numbers.cpp']]], + ['operator_3e_52',['operator>',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator>()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator>()'],['../db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440',1,'uint128_t::operator>(const uint128_t &other)'],['../db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e',1,'uint128_t::operator>(const T other)'],['../d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d',1,'uint256_t::operator>(const uint256_t &other)'],['../d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13',1,'uint256_t::operator>(const T &other)'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator>()']]], + ['operator_3e_3d_53',['operator>=',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator>=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator>=()'],['../db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292',1,'uint128_t::operator>=(const uint128_t &other)'],['../db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481',1,'uint128_t::operator>=(const T other)'],['../d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad',1,'uint256_t::operator>=(const uint256_t &other)'],['../d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad',1,'uint256_t::operator>=(const T &other)'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator>=()']]], + ['operator_3e_3e_54',['operator>>',['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::fstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_fstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::iostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::stringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wifstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::strstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_stringstream::operator>>()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istrstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wiostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_ifstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wfstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_iostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wstringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::ifstream::operator>>()'],['../db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848',1,'uint128_t::operator>>()'],['../d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51',1,'uint256_t::operator>>()'],['../d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797',1,'statistics::stats_computer1::operator>>'],['../d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a',1,'statistics::stats_computer2::operator>>']]], ['operator_3e_3e_3d_55',['operator>>=',['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator>>=()'],['../db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9',1,'uint128_t::operator>>=()'],['../d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78',1,'uint256_t::operator>>=()']]], - ['operator_5b_5d_56',['operator[]',['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::match_results::operator[]()'],['http://en.cppreference.com/w/cpp/container/map/operator_at.html',0,'std::map::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::cmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/array/operator_at.html',0,'std::array::operator[]()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37',1,'divide_and_conquer::strassens_multiplication::Matrix::operator[]()'],['../db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08',1,'large_number::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::smatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wsmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/unordered_map/operator_at.html',0,'std::unordered_map::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::string::operator[]()'],['http://en.cppreference.com/w/cpp/container/deque/operator_at.html',0,'std::deque::operator[]()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_at.html',0,'std::bitset::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::basic_string::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::wstring::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u16string::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wcmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/dynarray/operator_at.html',0,'std::dynarray::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u32string::operator[]()'],['http://en.cppreference.com/w/cpp/container/vector/operator_at.html',0,'std::vector::operator[]()']]], - ['operator_5e_57',['operator^',['../d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7',1,'uint256_t::operator^()'],['../db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37',1,'uint128_t::operator^(const T p)'],['../db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b',1,'uint128_t::operator^(const uint128_t &p)'],['../d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e',1,'uint256_t::operator^()']]], - ['operator_5e_3d_58',['operator^=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator^=()'],['../d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7',1,'uint256_t::operator^=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator^=()'],['../db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a',1,'uint128_t::operator^=(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67',1,'uint128_t::operator^=(const T &p)'],['../d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3',1,'uint256_t::operator^=()']]], - ['operator_7c_59',['operator|',['../db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304',1,'uint128_t::operator|()'],['../d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2',1,'uint256_t::operator|()'],['../db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd',1,'uint128_t::operator|()'],['../d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf',1,'uint256_t::operator|(const T &p)']]], - ['operator_7c_3d_60',['operator|=',['../d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b',1,'uint256_t::operator|=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator|=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator|=()'],['../db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d',1,'uint128_t::operator|=(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee',1,'uint128_t::operator|=(const T p)'],['../d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc',1,'uint256_t::operator|=(const uint256_t &p)']]], - ['operator_7c_7c_61',['operator||',['../d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7',1,'uint256_t::operator||()'],['../db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03',1,'uint128_t::operator||()'],['../d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7',1,'uint256_t::operator||()'],['../db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503',1,'uint128_t::operator||()']]], - ['operator_7e_62',['operator~',['../da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d',1,'Complex::operator~()'],['../d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2',1,'uint256_t::operator~()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator~()'],['../db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f',1,'uint128_t::operator~()']]], + ['operator_5b_5d_56',['operator[]',['http://en.cppreference.com/w/cpp/container/dynarray/operator_at.html',0,'std::dynarray::operator[]()'],['http://en.cppreference.com/w/cpp/container/vector/operator_at.html',0,'std::vector::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::match_results::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::string::operator[]()'],['http://en.cppreference.com/w/cpp/container/unordered_map/operator_at.html',0,'std::unordered_map::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wsmatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::smatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wcmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/deque/operator_at.html',0,'std::deque::operator[]()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_at.html',0,'std::bitset::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::basic_string::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::wstring::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u16string::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u32string::operator[]()'],['http://en.cppreference.com/w/cpp/container/map/operator_at.html',0,'std::map::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::cmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/array/operator_at.html',0,'std::array::operator[]()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37',1,'divide_and_conquer::strassens_multiplication::Matrix::operator[]()'],['../db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08',1,'large_number::operator[]()']]], + ['operator_5e_57',['operator^',['../db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37',1,'uint128_t::operator^(const T p)'],['../db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b',1,'uint128_t::operator^(const uint128_t &p)'],['../d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e',1,'uint256_t::operator^(const T &p)'],['../d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7',1,'uint256_t::operator^(const uint256_t &p)']]], + ['operator_5e_3d_58',['operator^=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator^=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator^=()'],['../db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a',1,'uint128_t::operator^=(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67',1,'uint128_t::operator^=(const T &p)'],['../d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7',1,'uint256_t::operator^=(const uint256_t &p)'],['../d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3',1,'uint256_t::operator^=(const T &p)']]], + ['operator_7c_59',['operator|',['../db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304',1,'uint128_t::operator|(const T p)'],['../db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd',1,'uint128_t::operator|(const uint128_t &p)'],['../d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf',1,'uint256_t::operator|(const T &p)'],['../d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2',1,'uint256_t::operator|(const uint256_t &p)']]], + ['operator_7c_3d_60',['operator|=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator|=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator|=()'],['../db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d',1,'uint128_t::operator|=(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee',1,'uint128_t::operator|=(const T p)'],['../d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b',1,'uint256_t::operator|=(const T &p)'],['../d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc',1,'uint256_t::operator|=(const uint256_t &p)']]], + ['operator_7c_7c_61',['operator||',['../db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03',1,'uint128_t::operator||(const uint128_t &b)'],['../db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503',1,'uint128_t::operator||(const T b)'],['../d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7',1,'uint256_t::operator||(const uint256_t &b)'],['../d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7',1,'uint256_t::operator||(const T &b)']]], + ['operator_7e_62',['operator~',['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator~()'],['../db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f',1,'uint128_t::operator~()'],['../d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2',1,'uint256_t::operator~()'],['../da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d',1,'Complex::operator~()']]], ['optional_63',['optional',['http://en.cppreference.com/w/cpp/experimental/optional.html',0,'std::experimental::optional'],['http://en.cppreference.com/w/cpp/experimental/optional/optional.html',0,'std::experimental::optional::optional()']]], ['ordinary_20differential_20equations_64',['Ordinary Differential Equations',['../d6/d60/group__ode.html',1,'']]], ['ordinary_5fleast_5fsquares_5fregressor_2ecpp_65',['ordinary_least_squares_regressor.cpp',['../dc/d38/ordinary__least__squares__regressor_8cpp.html',1,'']]], @@ -70,20 +70,21 @@ var searchData= ['ostream_67',['ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std::ostream'],['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::ostream::ostream()']]], ['ostream_5fiterator_68',['ostream_iterator',['http://en.cppreference.com/w/cpp/iterator/ostream_iterator.html',0,'std']]], ['ostreambuf_5fiterator_69',['ostreambuf_iterator',['http://en.cppreference.com/w/cpp/iterator/ostreambuf_iterator.html',0,'std']]], - ['ostringstream_70',['ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::ostringstream::ostringstream()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std::ostringstream']]], - ['ostrstream_71',['ostrstream',['http://en.cppreference.com/w/cpp/io/ostrstream/ostrstream.html',0,'std::ostrstream::ostrstream()'],['http://en.cppreference.com/w/cpp/io/ostrstream.html',0,'std::ostrstream']]], + ['ostringstream_70',['ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std::ostringstream'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::ostringstream::ostringstream()']]], + ['ostrstream_71',['ostrstream',['http://en.cppreference.com/w/cpp/io/ostrstream.html',0,'std::ostrstream'],['http://en.cppreference.com/w/cpp/io/ostrstream/ostrstream.html',0,'std::ostrstream::ostrstream()']]], ['otherhashfxn_72',['otherHashFxn',['../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082',1,'double_hashing']]], - ['others_73',['others',['../d0/d6f/namespaceothers.html',1,'others'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62',1,'Others']]], - ['our_20pledge_74',['Our Pledge',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md5',1,'']]], - ['our_20standards_75',['Our Standards',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md6',1,'']]], - ['out_76',['out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::out()']]], - ['out_5fof_5frange_77',['out_of_range',['http://en.cppreference.com/w/cpp/error/out_of_range.html',0,'std::out_of_range'],['http://en.cppreference.com/w/cpp/error/out_of_range.html',0,'std::out_of_range::out_of_range()']]], - ['outer_5fallocator_78',['outer_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/outer_allocator.html',0,'std::scoped_allocator_adaptor']]], - ['output_5fiterator_5ftag_79',['output_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], - ['overflow_80',['overflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_streambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::strstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::streambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wfilebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstreambuf::overflow()']]], - ['overflow_5ferror_81',['overflow_error',['http://en.cppreference.com/w/cpp/error/overflow_error.html',0,'std::overflow_error'],['http://en.cppreference.com/w/cpp/error/overflow_error.html',0,'std::overflow_error::overflow_error()']]], - ['overview_82',['Overview',['../index.html#autotoc_md104',1,'']]], - ['owner_5fbefore_83',['owner_before',['http://en.cppreference.com/w/cpp/memory/weak_ptr/owner_before.html',0,'std::weak_ptr::owner_before()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/owner_before.html',0,'std::shared_ptr::owner_before()']]], - ['owner_5fless_84',['owner_less',['http://en.cppreference.com/w/cpp/memory/owner_less.html',0,'std']]], - ['owns_5flock_85',['owns_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock/owns_lock.html',0,'std::shared_lock::owns_lock()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/owns_lock.html',0,'std::unique_lock::owns_lock()']]] + ['others_73',['others',['../d0/d6f/namespaceothers.html',1,'']]], + ['others_74',['Others',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62',1,'']]], + ['our_20pledge_75',['Our Pledge',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md5',1,'']]], + ['our_20standards_76',['Our Standards',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md6',1,'']]], + ['out_77',['out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::out()']]], + ['out_5fof_5frange_78',['out_of_range',['http://en.cppreference.com/w/cpp/error/out_of_range.html',0,'std::out_of_range'],['http://en.cppreference.com/w/cpp/error/out_of_range.html',0,'std::out_of_range::out_of_range()']]], + ['outer_5fallocator_79',['outer_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/outer_allocator.html',0,'std::scoped_allocator_adaptor']]], + ['output_5fiterator_5ftag_80',['output_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], + ['overflow_81',['overflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wfilebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::strstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_streambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::streambuf::overflow()']]], + ['overflow_5ferror_82',['overflow_error',['http://en.cppreference.com/w/cpp/error/overflow_error.html',0,'std::overflow_error'],['http://en.cppreference.com/w/cpp/error/overflow_error.html',0,'std::overflow_error::overflow_error()']]], + ['overview_83',['Overview',['../index.html#autotoc_md104',1,'']]], + ['owner_5fbefore_84',['owner_before',['http://en.cppreference.com/w/cpp/memory/weak_ptr/owner_before.html',0,'std::weak_ptr::owner_before()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/owner_before.html',0,'std::shared_ptr::owner_before()']]], + ['owner_5fless_85',['owner_less',['http://en.cppreference.com/w/cpp/memory/owner_less.html',0,'std']]], + ['owns_5flock_86',['owns_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/owns_lock.html',0,'std::unique_lock::owns_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/owns_lock.html',0,'std::shared_lock::owns_lock()']]] ]; diff --git a/search/all_15.js b/search/all_15.js index b31497bfe..49f056fa7 100644 --- a/search/all_15.js +++ b/search/all_15.js @@ -5,7 +5,7 @@ var searchData= ['pagefault_2',['pageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a09cbe562b0c396329607f5d388d57c9c',1,'others::lru_cache::LRUCache']]], ['pageframe_3',['pageFrame',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a1aafd0444b410e0fcb66287e9954c893',1,'others::lru_cache::LRUCache']]], ['pagemap_4',['pageMap',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c',1,'others::lru_cache::LRUCache']]], - ['pair_5',['pair',['http://en.cppreference.com/w/cpp/utility/pair/pair.html',0,'std::pair::pair()'],['http://en.cppreference.com/w/cpp/utility/pair.html',0,'std::pair']]], + ['pair_5',['pair',['http://en.cppreference.com/w/cpp/utility/pair.html',0,'std::pair< T1, T2 >'],['http://en.cppreference.com/w/cpp/utility/pair/pair.html',0,'std::pair::pair()']]], ['pair_3c_20int8_5ft_2c_20int8_5ft_20_3e_6',['pair< int8_t, int8_t >',['http://en.cppreference.com/w/cpp/utility/pair.html',0,'std']]], ['pair_5fu_7',['pair_u',['../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b',1,'graph::HKGraph']]], ['pair_5fv_8',['pair_v',['../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77',1,'graph::HKGraph']]], @@ -18,7 +18,7 @@ var searchData= ['pancakesort_15',['pancakeSort',['../d3/d92/pancake__sort_8cpp.html#abff90bc0f54e4f8ea5f0330471781bd5',1,'sorting::pancake_sort']]], ['parallelogram_5farea_16',['parallelogram_area',['../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f',1,'math']]], ['parallelogram_5fperimeter_17',['parallelogram_perimeter',['../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3',1,'math']]], - ['param_18',['param',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/param.html',0,'std::poisson_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/param.html',0,'std::lognormal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/param.html',0,'std::piecewise_constant_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/param.html',0,'std::student_t_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/param.html',0,'std::bernoulli_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/param.html',0,'std::exponential_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/param.html',0,'std::uniform_real_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/param.html',0,'std::geometric_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/param.html',0,'std::normal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/param.html',0,'std::extreme_value_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/param.html',0,'std::weibull_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/param.html',0,'std::negative_binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/param.html',0,'std::piecewise_linear_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/param.html',0,'std::cauchy_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/param.html',0,'std::binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/param.html',0,'std::gamma_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/param.html',0,'std::discrete_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/param.html',0,'std::uniform_int_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/param.html',0,'std::chi_squared_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/param.html',0,'std::seed_seq::param()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/param.html',0,'std::fisher_f_distribution::param()']]], + ['param_18',['param',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/param.html',0,'std::student_t_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/param.html',0,'std::extreme_value_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/param.html',0,'std::lognormal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/param.html',0,'std::discrete_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/param.html',0,'std::piecewise_constant_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/param.html',0,'std::poisson_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/param.html',0,'std::bernoulli_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/param.html',0,'std::exponential_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/param.html',0,'std::uniform_real_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/param.html',0,'std::geometric_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/param.html',0,'std::normal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/param.html',0,'std::weibull_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/param.html',0,'std::negative_binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/param.html',0,'std::chi_squared_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/param.html',0,'std::piecewise_linear_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/param.html',0,'std::uniform_int_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/param.html',0,'std::fisher_f_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/param.html',0,'std::seed_seq::param()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/param.html',0,'std::gamma_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/param.html',0,'std::binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/param.html',0,'std::cauchy_distribution::param()']]], ['parameter_19',['Parameter',['..//Users/runner/work/C-Plus-Plus/C-Plus-Plus/dynamic_programming/catalan_numbers.cpp#autotoc_md71',1,'']]], ['paranthesis_5fmatching_2ecpp_20',['paranthesis_matching.cpp',['../dc/dc5/paranthesis__matching_8cpp.html',1,'']]], ['parent_21',['parent',['../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43',1,'graph::RootedTree']]], @@ -26,20 +26,20 @@ var searchData= ['partial_5fsort_23',['partial_sort',['http://en.cppreference.com/w/cpp/algorithm/partial_sort.html',0,'std']]], ['partial_5fsort_5fcopy_24',['partial_sort_copy',['http://en.cppreference.com/w/cpp/algorithm/partial_sort_copy.html',0,'std']]], ['partial_5fsum_25',['partial_sum',['http://en.cppreference.com/w/cpp/algorithm/partial_sum.html',0,'std']]], - ['partition_26',['partition',['../d1/d21/quick__sort_8cpp.html#a1b2a2cc2d319240f3b65c5b2f479ed82',1,'sorting::quick_sort::partition()'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a3d1c39e1ff42c04fb8ec0c0b9411cd3e',1,'sorting::random_pivot_quick_sort::partition()'],['http://en.cppreference.com/w/cpp/algorithm/partition.html',0,'std::partition(T... args)']]], + ['partition_26',['partition',['http://en.cppreference.com/w/cpp/algorithm/partition.html',0,'std::partition()'],['../d1/d21/quick__sort_8cpp.html#a1b2a2cc2d319240f3b65c5b2f479ed82',1,'sorting::quick_sort::partition()'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a3d1c39e1ff42c04fb8ec0c0b9411cd3e',1,'sorting::random_pivot_quick_sort::partition()']]], ['partition_5fcopy_27',['partition_copy',['http://en.cppreference.com/w/cpp/algorithm/partition_copy.html',0,'std']]], ['partition_5fpoint_28',['partition_point',['http://en.cppreference.com/w/cpp/algorithm/partition_point.html',0,'std']]], ['pascal_5ftriangle_29',['pascal_triangle',['../dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd',1,'pascal_triangle.cpp']]], ['pascal_5ftriangle_2ecpp_30',['pascal_triangle.cpp',['../dc/d1a/pascal__triangle_8cpp.html',1,'']]], ['pat_5ftest_31',['pat_test',['../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2',1,'boyer_moore.cpp']]], ['paths_32',['Augmenting paths',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md81',1,'']]], - ['pattern_33',['pattern',['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_put::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_get::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_base::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::moneypunct::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::moneypunct_byname::pattern'],['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html',1,'strings::boyer_moore::pattern']]], + ['pattern_33',['pattern',['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_base::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_get::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_put::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::moneypunct::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::moneypunct_byname::pattern'],['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html',1,'strings::boyer_moore::pattern']]], ['pb_34',['pb',['../d7/d35/matrix__exponentiation_8cpp.html#a276c5a0e984cf60015b27252fe04fe6b',1,'matrix_exponentiation.cpp']]], - ['pbackfail_35',['pbackfail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wfilebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::strstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::streambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_streambuf::pbackfail()']]], - ['pbase_36',['pbase',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::pbase()']]], - ['pbump_37',['pbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::streambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_streambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::strstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wfilebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstringbuf::pbump()']]], - ['pcount_38',['pcount',['http://en.cppreference.com/w/cpp/io/ostrstream/pcount.html',0,'std::ostrstream::pcount()'],['http://en.cppreference.com/w/cpp/io/strstream/pcount.html',0,'std::strstream::pcount()'],['http://en.cppreference.com/w/cpp/io/strstreambuf/pcount.html',0,'std::strstreambuf::pcount()']]], - ['peek_39',['peek',['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wiostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::ifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istrstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_stringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::stringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_ifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wfstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wstringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::strstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::fstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_fstream::peek()']]], + ['pbackfail_35',['pbackfail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wfilebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::strstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_streambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::streambuf::pbackfail()']]], + ['pbase_36',['pbase',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::pbase()']]], + ['pbump_37',['pbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wfilebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::strstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_streambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::streambuf::pbump()']]], + ['pcount_38',['pcount',['http://en.cppreference.com/w/cpp/io/strstreambuf/pcount.html',0,'std::strstreambuf::pcount()'],['http://en.cppreference.com/w/cpp/io/strstream/pcount.html',0,'std::strstream::pcount()'],['http://en.cppreference.com/w/cpp/io/ostrstream/pcount.html',0,'std::ostrstream::pcount()']]], + ['peek_39',['peek',['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::fstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_fstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::stringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::strstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_stringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istrstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wiostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_ifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wfstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wstringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::ifstream::peek()']]], ['perimeter_2ecpp_40',['perimeter.cpp',['../d3/dfe/perimeter_8cpp.html',1,'']]], ['permanent_20ban_41',['4. Permanent Ban',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md14',1,'']]], ['perror_42',['perror',['http://en.cppreference.com/w/cpp/io/c/perror.html',0,'std']]], @@ -47,119 +47,124 @@ var searchData= ['persistent_5fseg_5ftree_5flazy_5fprop_2ecpp_44',['persistent_seg_tree_lazy_prop.cpp',['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html',1,'']]], ['peta_45',['peta',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], ['phifunction_46',['phiFunction',['../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5',1,'math']]], - ['physics_47',['physics',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63',1,'Physics'],['../d5/dd0/namespacephysics.html',1,'physics']]], - ['pico_48',['pico',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], - ['piecewise_5fconstant_5fdistribution_49',['piecewise_constant_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/piecewise_constant_distribution.html',0,'std::piecewise_constant_distribution::piecewise_constant_distribution()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution.html',0,'std::piecewise_constant_distribution']]], - ['piecewise_5fconstruct_5ft_50',['piecewise_construct_t',['http://en.cppreference.com/w/cpp/utility/piecewise_construct_t.html',0,'std']]], - ['piecewise_5flinear_5fdistribution_51',['piecewise_linear_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/piecewise_linear_distribution.html',0,'std::piecewise_linear_distribution::piecewise_linear_distribution()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution.html',0,'std::piecewise_linear_distribution']]], - ['pigeonhole_5fsort_2ecpp_52',['pigeonhole_sort.cpp',['../dd/da8/pigeonhole__sort_8cpp.html',1,'']]], - ['pigeonsort_53',['pigeonSort',['../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3',1,'sorting']]], - ['placeholders_54',['placeholders',['http://en.cppreference.com/w/cpp/utility/functional/placeholders.html',0,'std']]], - ['pledge_55',['Our Pledge',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md5',1,'']]], - ['plus_56',['plus',['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std']]], - ['point_57',['point',['../d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a',1,'Point::Point()'],['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html',1,'ciphers::elliptic_curve_key_exchange::Point'],['../d7/d48/structgeometry_1_1grahamscan_1_1_point.html',1,'geometry::grahamscan::Point'],['../d9/d5a/structgeometry_1_1jarvis_1_1_point.html',1,'geometry::jarvis::Point'],['../d8/dc8/struct_point.html',1,'Point'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#af0a6e3521629c25c2b5d620f26429830',1,'ciphers::elliptic_curve_key_exchange::Point'],['../dd/d47/namespacemath.html#a937dc0c826acf3e6c0d2785527f7e9d7',1,'math::Point']]], - ['pointer_20store_20the_20address_20of_20parent_20nodes_58',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], - ['pointer_5fsafety_59',['pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/pointer_safety.html',0,'std']]], - ['pointer_5fto_60',['pointer_to',['http://en.cppreference.com/w/cpp/memory/pointer_traits/pointer_to.html',0,'std::pointer_traits']]], - ['pointer_5ftraits_61',['pointer_traits',['http://en.cppreference.com/w/cpp/memory/pointer_traits.html',0,'std']]], - ['pointincircle_62',['PointInCircle',['../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad',1,'smallest_circle.cpp']]], - ['poisson_5fdist_2ecpp_63',['poisson_dist.cpp',['../d9/d24/poisson__dist_8cpp.html',1,'']]], - ['poisson_5fdistribution_64',['poisson_distribution',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/poisson_distribution.html',0,'std::poisson_distribution::poisson_distribution()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution.html',0,'std::poisson_distribution']]], - ['poisson_5fexpected_65',['poisson_expected',['../d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71',1,'poisson_dist.cpp']]], - ['poisson_5frange_5fsuccesses_66',['poisson_range_successes',['../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a',1,'poisson_dist.cpp']]], - ['poisson_5frate_67',['poisson_rate',['../d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8',1,'poisson_dist.cpp']]], - ['poisson_5fx_5fsuccesses_68',['poisson_x_successes',['../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1',1,'poisson_dist.cpp']]], - ['poly_5ffunction_69',['poly_function',['../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569',1,'durand_kerner_roots.cpp']]], - ['pop_70',['pop',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb',1,'data_structures::stack_using_queue::Stack::pop()'],['../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664',1,'pop(): paranthesis_matching.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#a421baa2002a64bc0bfc3e1b64800d734',1,'others::postfix_expression::pop()'],['../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0',1,'stack::pop()'],['http://en.cppreference.com/w/cpp/container/priority_queue/pop.html',0,'std::priority_queue::pop()'],['http://en.cppreference.com/w/cpp/container/queue/pop.html',0,'std::queue::pop()'],['http://en.cppreference.com/w/cpp/container/stack/pop.html',0,'std::stack::pop()']]], - ['pop_5fback_71',['pop_back',['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::wstring::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u16string::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u32string::pop_back()'],['http://en.cppreference.com/w/cpp/container/list/pop_back.html',0,'std::list::pop_back()'],['http://en.cppreference.com/w/cpp/container/vector/pop_back.html',0,'std::vector::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::string::pop_back()'],['../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d',1,'machine_learning::pop_back()'],['http://en.cppreference.com/w/cpp/container/deque/pop_back.html',0,'std::deque::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::basic_string::pop_back()']]], - ['pop_5ffront_72',['pop_front',['http://en.cppreference.com/w/cpp/container/deque/pop_front.html',0,'std::deque::pop_front()'],['http://en.cppreference.com/w/cpp/container/list/pop_front.html',0,'std::list::pop_front()'],['../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093',1,'machine_learning::pop_front()'],['http://en.cppreference.com/w/cpp/container/forward_list/pop_front.html',0,'std::forward_list::pop_front()']]], - ['pop_5fheap_73',['pop_heap',['http://en.cppreference.com/w/cpp/algorithm/pop_heap.html',0,'std']]], - ['populate_5fparents_74',['populate_parents',['../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e',1,'graph::RootedTree']]], - ['populate_5fup_75',['populate_up',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356',1,'graph::LowestCommonAncestor']]], - ['pos_5fformat_76',['pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::pos_format()']]], - ['position_77',['position',['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::smatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wsmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::match_results::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wcmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::cmatch::position()']]], - ['positive_5fsign_78',['positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::positive_sign()']]], - ['postfix_5fevaluation_79',['postfix_evaluation',['../d7/d75/postfix__evaluation_8cpp.html#ae38bd3a177a6d61da3859a281233bbe1',1,'others::postfix_expression']]], - ['postfix_5fevaluation_2ecpp_80',['postfix_evaluation.cpp',['../d7/d75/postfix__evaluation_8cpp.html',1,'']]], - ['postfix_5fexpression_81',['postfix_expression',['../d4/de6/namespacepostfix__expression.html',1,'']]], - ['postorder_82',['postorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5',1,'others::recursive_tree_traversals::BT']]], - ['postorder_20traversal_20of_20a_20tree_83',['postorder traversal of a tree',['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md102',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Postorder Traversal of a tree']]], - ['postorderiterative_84',['postOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25',1,'others::iterative_tree_traversals::BinaryTree']]], - ['pow_85',['pow',['http://en.cppreference.com/w/cpp/numeric/math/pow.html',0,'std']]], - ['power_86',['power',['../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec',1,'power(const vector< vector< ll > > &A, ll p): matrix_exponentiation.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f',1,'power(int x, int n): power_for_huge_numbers.cpp'],['../df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179',1,'math::modular_division::power()'],['../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d',1,'math::power()'],['../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311',1,'math::fibonacci_sum::power()']]], - ['power_5ffor_5fhuge_5fnumbers_2ecpp_87',['power_for_huge_numbers.cpp',['../df/def/power__for__huge__numbers_8cpp.html',1,'']]], - ['power_5fof_5f2_2ecpp_88',['power_of_2.cpp',['../dc/d6d/power__of__2_8cpp.html',1,'']]], - ['power_5fof_5ftwo_89',['power_of_two',['../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb',1,'math']]], - ['power_5fof_5ftwo_2ecpp_90',['power_of_two.cpp',['../d4/d38/power__of__two_8cpp.html',1,'']]], - ['pptr_91',['pptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::pptr()']]], - ['precision_92',['precision',['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ios_base::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::iostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ios::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::strstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wfstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wiostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wstringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_iostream::precision()']]], - ['predict_93',['predict',['../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3',1,'machine_learning::adaline::predict()'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a62e152db014cd4de675fa906e5ef2861',1,'machine_learning::k_nearest_neighbors::Knn::predict()']]], - ['predict_5fols_5fregressor_94',['predict_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493',1,'ordinary_least_squares_regressor.cpp']]], - ['predict_5fwords_95',['predict_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4',1,'data_structures::trie_using_hashmap::Trie']]], - ['prefix_96',['prefix',['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wcmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wsmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::match_results::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::smatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::cmatch::prefix()']]], - ['prefix_5fsum_5farray_97',['prefix_sum_array',['../d7/d88/namespaceprefix__sum__array.html',1,'']]], - ['prefix_5fsum_5farray_2ecpp_98',['prefix_sum_array.cpp',['../d1/d9e/prefix__sum__array_8cpp.html',1,'']]], - ['preorder_99',['preorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb',1,'others::recursive_tree_traversals::BT']]], - ['preorder_20traversal_20of_20a_20tree_100',['preorder traversal of a tree',['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Preorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Preorder Traversal of a tree']]], - ['preorderiterative_101',['preOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae',1,'others::iterative_tree_traversals::BinaryTree']]], - ['prev_102',['prev',['http://en.cppreference.com/w/cpp/iterator/prev.html',0,'std']]], - ['prev_5fpermutation_103',['prev_permutation',['http://en.cppreference.com/w/cpp/algorithm/prev_permutation.html',0,'std']]], - ['primality_5ftest_2ecpp_104',['primality_test.cpp',['../da/d7b/primality__test_8cpp.html',1,'']]], - ['prime_105',['prime',['../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95',1,'prime: primes_up_to_billion.cpp'],['../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8',1,'PRIME: rabin_karp.cpp']]], - ['prime_20factorization_106',['Prime factorization',['../d7/d7f/section.html',1,'']]], - ['prime_5ffactorization_107',['prime_factorization',['../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46',1,'prime_factorization.cpp']]], - ['prime_5ffactorization_2ecpp_108',['prime_factorization.cpp',['../db/d0d/prime__factorization_8cpp.html',1,'']]], - ['prime_5fnumbers_109',['prime_numbers',['../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe',1,'prime_factorization.cpp']]], - ['prime_5fnumbers_2ecpp_110',['prime_numbers.cpp',['../de/d9b/prime__numbers_8cpp.html',1,'']]], - ['primes_111',['primes',['../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a',1,'prime_numbers.cpp']]], - ['primes_5fup_5fto_5fbillion_2ecpp_112',['primes_up_to_billion.cpp',['../d4/d9c/primes__up__to__billion_8cpp.html',1,'']]], - ['print_113',['print',['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a7341d7c76a6145e991cdd231f689fca8',1,'greedy_algorithms::dijkstra::print()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9',1,'print(): sieve_of_eratosthenes.cpp'],['../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20',1,'operations_on_datastructures::print()'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165',1,'data_structures::tree_234::Tree234::Print()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::print()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print()']]], - ['print_5fprimes_114',['print_primes',['../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4',1,'math']]], - ['print_5ftable_115',['print_table',['../dd/d92/memory__game_8cpp.html#ac589ef65abb0a6b9a7116ee0f9fd5280',1,'games::memory_game']]], - ['printarray_116',['printArray',['../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767',1,'heap_sort.cpp']]], - ['printf_117',['printf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], - ['printinorder_118',['printInorder',['../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4',1,'operations_on_datastructures::inorder_traversal_of_bst']]], - ['printlinkedlist_119',['printLinkedList',['../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2',1,'search::sublist_search']]], - ['printmat_120',['printMat',['../d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac',1,'backtracking::sudoku_solver']]], - ['printnode_121',['PrintNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be',1,'data_structures::tree_234::Tree234']]], - ['printresult_122',['printResult',['../dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793',1,'FCFS']]], - ['printroot_123',['printRoot',['../dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345',1,'numerical_methods::false_position']]], - ['printsol_124',['printsol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905',1,'backtracking::n_queens_optimized::PrintSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aebd5e11fab6dab282efccfb61beb0bd9',1,'backtracking::n_queens_all_solutions::PrintSol()']]], - ['printsolution_125',['printsolution',['../d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07',1,'backtracking::graph_coloring::printSolution()'],['../d4/d3e/n__queens_8cpp.html#a40ae0c7fd04eb20e7f3bff13fc6a5808',1,'backtracking::n_queens::printSolution()']]], - ['priority_126',['priority',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723',1,'data_structures::treap::Treap']]], - ['priority_5fqueue_127',['priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue/priority_queue.html',0,'std::priority_queue::priority_queue()'],['http://en.cppreference.com/w/cpp/container/priority_queue.html',0,'std::priority_queue< T >']]], - ['priority_5fqueue_3c_20std_3a_3atuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_2c_20std_3a_3avector_3c_20std_3a_3atuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_20_3e_2c_20compare_3c_20s_2c_20t_2c_20e_20_3e_20_3e_128',['priority_queue< std::tuple< S, T, E, double, double, double >, std::vector< std::tuple< S, T, E, double, double, double > >, Compare< S, T, E > >',['http://en.cppreference.com/w/cpp/container/priority_queue.html',0,'std']]], - ['probabilities_129',['probabilities',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/probabilities.html',0,'std::discrete_distribution']]], - ['probability_130',['probability',['../d4/ded/namespaceprobability.html',1,'probability'],['../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61',1,'data_structures::PROBABILITY'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64',1,'Probability']]], - ['probability_5fdensity_131',['probability_density',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1',1,'probability::geometric_dist::geometric_distribution']]], - ['problem_132',['problem',['../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_semi_implicit_euler.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_midpoint_euler.cpp']]], - ['program_133',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]], - ['programming_134',['Dynamic Programming',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51',1,'']]], - ['projection_135',['projection',['../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc',1,'numerical_methods::gram_schmidt']]], - ['promise_136',['promise',['http://en.cppreference.com/w/cpp/thread/promise/promise.html',0,'std::promise::promise()'],['http://en.cppreference.com/w/cpp/thread/promise.html',0,'std::promise']]], - ['psucc_137',['psucc',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081',1,'data_structures::linked_list::link']]], - ['ptrdiff_5ft_138',['ptrdiff_t',['http://en.cppreference.com/w/cpp/types/ptrdiff_t.html',0,'std']]], - ['ptrs_139',['ptrs',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5',1,'range_queries::perSegTree']]], - ['pubimbue_140',['pubimbue',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::pubimbue()']]], - ['pubseekoff_141',['pubseekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::pubseekoff(T... args)']]], - ['pubseekpos_142',['pubseekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::pubseekpos()']]], - ['pubsetbuf_143',['pubsetbuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::pubsetbuf()']]], - ['pubsync_144',['pubsync',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::pubsync()']]], - ['pull_20requests_145',['Pull Requests',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36',1,'']]], - ['push_146',['push',['../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea',1,'others::postfix_expression::push()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2',1,'data_structures::stack_using_queue::Stack::push()'],['../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095',1,'push(): paranthesis_matching.cpp'],['../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d',1,'stack::push()'],['http://en.cppreference.com/w/cpp/container/stack/push.html',0,'std::stack::push()'],['http://en.cppreference.com/w/cpp/container/queue/push.html',0,'std::queue::push()'],['http://en.cppreference.com/w/cpp/container/priority_queue/push.html',0,'std::priority_queue::push()']]], - ['push_5fback_147',['push_back',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ad585670a392c7e842c992d088093dff5',1,'data_structures::linked_list::list::push_back()'],['http://en.cppreference.com/w/cpp/container/list/push_back.html',0,'std::list::push_back()'],['http://en.cppreference.com/w/cpp/container/vector/push_back.html',0,'std::vector::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::string::push_back()'],['http://en.cppreference.com/w/cpp/container/deque/push_back.html',0,'std::deque::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::basic_string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::wstring::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u16string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u32string::push_back()']]], - ['push_5ffront_148',['push_front',['http://en.cppreference.com/w/cpp/container/forward_list/push_front.html',0,'std::forward_list::push_front()'],['http://en.cppreference.com/w/cpp/container/deque/push_front.html',0,'std::deque::push_front()'],['http://en.cppreference.com/w/cpp/container/list/push_front.html',0,'std::list::push_front()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9c73f393e984f93f33852334d1a04be0',1,'data_structures::linked_list::list::push_front()']]], - ['push_5fheap_149',['push_heap',['http://en.cppreference.com/w/cpp/algorithm/push_heap.html',0,'std']]], - ['put_150',['put',['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::fstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_fstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::iostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wiostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::stringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::strstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_stringstream::put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ofstream::put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostrstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wfstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_iostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wstringstream::put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostream::put()']]], - ['put_5fmoney_151',['put_money',['http://en.cppreference.com/w/cpp/io/manip/put_money.html',0,'std']]], - ['put_5ftime_152',['put_time',['http://en.cppreference.com/w/cpp/io/manip/put_time.html',0,'std']]], - ['putback_153',['putback',['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wiostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wfstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wstringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::ifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::strstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istrstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_ifstream::putback()']]], - ['putc_154',['putc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]], - ['putchar_155',['putchar',['http://en.cppreference.com/w/cpp/io/c/putchar.html',0,'std']]], - ['putprober_156',['putprober',['../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b',1,'double_hashing::putProber()'],['../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541',1,'linear_probing::putProber()'],['../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b',1,'quadratic_probing::putProber()']]], - ['puts_157',['puts',['http://en.cppreference.com/w/cpp/io/c/puts.html',0,'std']]], - ['putwchar_158',['putwchar',['http://en.cppreference.com/w/cpp/io/c/putwchar.html',0,'std']]], - ['pvalue_159',['pvalue',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936',1,'data_structures::linked_list::link']]], - ['pword_160',['pword',['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wiostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ios::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ios_base::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::strstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wfstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wstringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ifstream::pword()']]], - ['pyramid_5fvolume_161',['pyramid_volume',['../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c',1,'math']]] + ['physics_47',['physics',['../d5/dd0/namespacephysics.html',1,'']]], + ['physics_48',['Physics',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63',1,'']]], + ['pico_49',['pico',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['piecewise_5fconstant_5fdistribution_50',['piecewise_constant_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution.html',0,'std::piecewise_constant_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/piecewise_constant_distribution.html',0,'std::piecewise_constant_distribution::piecewise_constant_distribution()']]], + ['piecewise_5fconstruct_5ft_51',['piecewise_construct_t',['http://en.cppreference.com/w/cpp/utility/piecewise_construct_t.html',0,'std']]], + ['piecewise_5flinear_5fdistribution_52',['piecewise_linear_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution.html',0,'std::piecewise_linear_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/piecewise_linear_distribution.html',0,'std::piecewise_linear_distribution::piecewise_linear_distribution()']]], + ['pigeonhole_5fsort_2ecpp_53',['pigeonhole_sort.cpp',['../dd/da8/pigeonhole__sort_8cpp.html',1,'']]], + ['pigeonsort_54',['pigeonSort',['../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3',1,'sorting']]], + ['placeholders_55',['placeholders',['http://en.cppreference.com/w/cpp/utility/functional/placeholders.html',0,'std']]], + ['pledge_56',['Our Pledge',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md5',1,'']]], + ['plus_57',['plus',['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std']]], + ['point_58',['Point',['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html',1,'ciphers::elliptic_curve_key_exchange::Point'],['../d7/d48/structgeometry_1_1grahamscan_1_1_point.html',1,'geometry::grahamscan::Point'],['../d9/d5a/structgeometry_1_1jarvis_1_1_point.html',1,'geometry::jarvis::Point'],['../d8/dc8/struct_point.html',1,'Point'],['../d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a',1,'Point::Point()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#af0a6e3521629c25c2b5d620f26429830',1,'ciphers::elliptic_curve_key_exchange::Point'],['../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85',1,'math::Point']]], + ['pointer_20store_20the_20address_20of_20parent_20nodes_59',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], + ['pointer_5fsafety_60',['pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/pointer_safety.html',0,'std']]], + ['pointer_5fto_61',['pointer_to',['http://en.cppreference.com/w/cpp/memory/pointer_traits/pointer_to.html',0,'std::pointer_traits']]], + ['pointer_5ftraits_62',['pointer_traits',['http://en.cppreference.com/w/cpp/memory/pointer_traits.html',0,'std']]], + ['pointincircle_63',['PointInCircle',['../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad',1,'smallest_circle.cpp']]], + ['poisson_5fdist_2ecpp_64',['poisson_dist.cpp',['../d9/d24/poisson__dist_8cpp.html',1,'']]], + ['poisson_5fdistribution_65',['poisson_distribution',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution.html',0,'std::poisson_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/poisson_distribution.html',0,'std::poisson_distribution::poisson_distribution()']]], + ['poisson_5fexpected_66',['poisson_expected',['../d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71',1,'poisson_dist.cpp']]], + ['poisson_5frange_5fsuccesses_67',['poisson_range_successes',['../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a',1,'poisson_dist.cpp']]], + ['poisson_5frate_68',['poisson_rate',['../d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8',1,'poisson_dist.cpp']]], + ['poisson_5fx_5fsuccesses_69',['poisson_x_successes',['../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1',1,'poisson_dist.cpp']]], + ['poly_5ffunction_70',['poly_function',['../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569',1,'durand_kerner_roots.cpp']]], + ['pop_71',['pop',['http://en.cppreference.com/w/cpp/container/stack/pop.html',0,'std::stack::pop()'],['http://en.cppreference.com/w/cpp/container/queue/pop.html',0,'std::queue::pop()'],['http://en.cppreference.com/w/cpp/container/priority_queue/pop.html',0,'std::priority_queue::pop()'],['../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0',1,'stack::pop()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb',1,'data_structures::stack_using_queue::Stack::pop()'],['../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664',1,'pop(): paranthesis_matching.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#a421baa2002a64bc0bfc3e1b64800d734',1,'others::postfix_expression::pop()']]], + ['pop_5fback_72',['pop_back',['http://en.cppreference.com/w/cpp/container/vector/pop_back.html',0,'std::vector::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::string::pop_back()'],['http://en.cppreference.com/w/cpp/container/deque/pop_back.html',0,'std::deque::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::basic_string::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::wstring::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u16string::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u32string::pop_back()'],['http://en.cppreference.com/w/cpp/container/list/pop_back.html',0,'std::list::pop_back()'],['../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d',1,'machine_learning::pop_back()']]], + ['pop_5ffront_73',['pop_front',['http://en.cppreference.com/w/cpp/container/forward_list/pop_front.html',0,'std::forward_list::pop_front()'],['http://en.cppreference.com/w/cpp/container/deque/pop_front.html',0,'std::deque::pop_front()'],['http://en.cppreference.com/w/cpp/container/list/pop_front.html',0,'std::list::pop_front()'],['../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093',1,'machine_learning::pop_front()']]], + ['pop_5fheap_74',['pop_heap',['http://en.cppreference.com/w/cpp/algorithm/pop_heap.html',0,'std']]], + ['populate_5fparents_75',['populate_parents',['../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e',1,'graph::RootedTree']]], + ['populate_5fup_76',['populate_up',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356',1,'graph::LowestCommonAncestor']]], + ['pos_5fformat_77',['pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::pos_format()']]], + ['position_78',['position',['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::match_results::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wsmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::smatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wcmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::cmatch::position()']]], + ['positive_5fsign_79',['positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::positive_sign()']]], + ['postfix_5fevaluation_80',['postfix_evaluation',['../d7/d75/postfix__evaluation_8cpp.html#ae38bd3a177a6d61da3859a281233bbe1',1,'others::postfix_expression']]], + ['postfix_5fevaluation_2ecpp_81',['postfix_evaluation.cpp',['../d7/d75/postfix__evaluation_8cpp.html',1,'']]], + ['postfix_5fexpression_82',['postfix_expression',['../d4/de6/namespacepostfix__expression.html',1,'']]], + ['postorder_83',['postorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5',1,'others::recursive_tree_traversals::BT']]], + ['postorder_20traversal_20of_20a_20tree_84',['Postorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md102',1,'Iterative Postorder Traversal of a tree']]], + ['postorderiterative_85',['postOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25',1,'others::iterative_tree_traversals::BinaryTree']]], + ['pow_86',['pow',['http://en.cppreference.com/w/cpp/numeric/math/pow.html',0,'std']]], + ['power_87',['power',['../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311',1,'math::fibonacci_sum::power()'],['../df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179',1,'math::modular_division::power()'],['../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d',1,'math::power()'],['../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f',1,'power(int x, int n): power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec',1,'power(const vector< vector< ll > > &A, ll p): matrix_exponentiation.cpp']]], + ['power_5ffor_5fhuge_5fnumbers_2ecpp_88',['power_for_huge_numbers.cpp',['../df/def/power__for__huge__numbers_8cpp.html',1,'']]], + ['power_5fof_5f2_2ecpp_89',['power_of_2.cpp',['../dc/d6d/power__of__2_8cpp.html',1,'']]], + ['power_5fof_5ftwo_90',['power_of_two',['../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb',1,'math']]], + ['power_5fof_5ftwo_2ecpp_91',['power_of_two.cpp',['../d4/d38/power__of__two_8cpp.html',1,'']]], + ['pptr_92',['pptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::pptr()']]], + ['precision_93',['precision',['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ios::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::iostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ios_base::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::strstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wiostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wfstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_iostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wstringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ifstream::precision()']]], + ['predict_94',['predict',['../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3',1,'machine_learning::adaline::predict()'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a62e152db014cd4de675fa906e5ef2861',1,'machine_learning::k_nearest_neighbors::Knn::predict()']]], + ['predict_5fols_5fregressor_95',['predict_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493',1,'ordinary_least_squares_regressor.cpp']]], + ['predict_5fwords_96',['predict_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4',1,'data_structures::trie_using_hashmap::Trie']]], + ['prefix_97',['prefix',['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::match_results::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wsmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::smatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wcmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::cmatch::prefix()']]], + ['prefix_5fsum_5farray_98',['prefix_sum_array',['../d7/d88/namespaceprefix__sum__array.html',1,'']]], + ['prefix_5fsum_5farray_2ecpp_99',['prefix_sum_array.cpp',['../d1/d9e/prefix__sum__array_8cpp.html',1,'']]], + ['preorder_100',['preorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb',1,'others::recursive_tree_traversals::BT']]], + ['preorder_20traversal_20of_20a_20tree_101',['Preorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Preorder Traversal of a tree']]], + ['preorderiterative_102',['preOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae',1,'others::iterative_tree_traversals::BinaryTree']]], + ['prev_103',['prev',['http://en.cppreference.com/w/cpp/iterator/prev.html',0,'std']]], + ['prev_5fpermutation_104',['prev_permutation',['http://en.cppreference.com/w/cpp/algorithm/prev_permutation.html',0,'std']]], + ['primality_5ftest_2ecpp_105',['primality_test.cpp',['../da/d7b/primality__test_8cpp.html',1,'']]], + ['prime_106',['prime',['../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95',1,'primes_up_to_billion.cpp']]], + ['prime_107',['PRIME',['../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8',1,'rabin_karp.cpp']]], + ['prime_20factorization_108',['Prime factorization',['../d7/d7f/section.html',1,'']]], + ['prime_5ffactorization_109',['prime_factorization',['../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46',1,'prime_factorization.cpp']]], + ['prime_5ffactorization_2ecpp_110',['prime_factorization.cpp',['../db/d0d/prime__factorization_8cpp.html',1,'']]], + ['prime_5fnumbers_111',['prime_numbers',['../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe',1,'prime_factorization.cpp']]], + ['prime_5fnumbers_2ecpp_112',['prime_numbers.cpp',['../de/d9b/prime__numbers_8cpp.html',1,'']]], + ['primes_113',['primes',['../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a',1,'prime_numbers.cpp']]], + ['primes_5fup_5fto_5fbillion_2ecpp_114',['primes_up_to_billion.cpp',['../d4/d9c/primes__up__to__billion_8cpp.html',1,'']]], + ['print_115',['Print',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165',1,'data_structures::tree_234::Tree234']]], + ['print_116',['print',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print(Node *root)'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::print()'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a7341d7c76a6145e991cdd231f689fca8',1,'greedy_algorithms::dijkstra::print()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9',1,'print(): sieve_of_eratosthenes.cpp'],['../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20',1,'operations_on_datastructures::print()']]], + ['print_5fprimes_117',['print_primes',['../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4',1,'math']]], + ['print_5ftable_118',['print_table',['../dd/d92/memory__game_8cpp.html#ac589ef65abb0a6b9a7116ee0f9fd5280',1,'games::memory_game']]], + ['printarray_119',['printArray',['../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767',1,'heap_sort.cpp']]], + ['printf_120',['printf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['printinorder_121',['printInorder',['../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4',1,'operations_on_datastructures::inorder_traversal_of_bst']]], + ['printlinkedlist_122',['printLinkedList',['../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2',1,'search::sublist_search']]], + ['printmat_123',['printMat',['../d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac',1,'backtracking::sudoku_solver']]], + ['printnode_124',['PrintNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be',1,'data_structures::tree_234::Tree234']]], + ['printresult_125',['printResult',['../dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793',1,'FCFS']]], + ['printroot_126',['printRoot',['../dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345',1,'numerical_methods::false_position']]], + ['printsol_127',['PrintSol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905',1,'backtracking::n_queens_optimized::PrintSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aebd5e11fab6dab282efccfb61beb0bd9',1,'backtracking::n_queens_all_solutions::PrintSol()']]], + ['printsolution_128',['printSolution',['../d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07',1,'backtracking::graph_coloring::printSolution()'],['../d4/d3e/n__queens_8cpp.html#a40ae0c7fd04eb20e7f3bff13fc6a5808',1,'backtracking::n_queens::printSolution()']]], + ['priority_129',['priority',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723',1,'data_structures::treap::Treap']]], + ['priority_5fqueue_130',['priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue.html',0,'std::priority_queue< T >'],['http://en.cppreference.com/w/cpp/container/priority_queue/priority_queue.html',0,'std::priority_queue::priority_queue()']]], + ['priority_5fqueue_3c_20std_3a_3atuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_2c_20std_3a_3avector_3c_20std_3a_3atuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_20_3e_2c_20compare_3c_20s_2c_20t_2c_20e_20_3e_20_3e_131',['priority_queue< std::tuple< S, T, E, double, double, double >, std::vector< std::tuple< S, T, E, double, double, double > >, Compare< S, T, E > >',['http://en.cppreference.com/w/cpp/container/priority_queue.html',0,'std']]], + ['probabilities_132',['probabilities',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/probabilities.html',0,'std::discrete_distribution']]], + ['probability_133',['probability',['../d4/ded/namespaceprobability.html',1,'']]], + ['probability_134',['PROBABILITY',['../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61',1,'data_structures']]], + ['probability_135',['Probability',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64',1,'']]], + ['probability_5fdensity_136',['probability_density',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1',1,'probability::geometric_dist::geometric_distribution']]], + ['problem_137',['problem',['../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_semi_implicit_euler.cpp']]], + ['program_138',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]], + ['programming_139',['Dynamic Programming',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51',1,'']]], + ['projection_140',['projection',['../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc',1,'numerical_methods::gram_schmidt']]], + ['promise_141',['promise',['http://en.cppreference.com/w/cpp/thread/promise.html',0,'std::promise'],['http://en.cppreference.com/w/cpp/thread/promise/promise.html',0,'std::promise::promise()']]], + ['psucc_142',['psucc',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081',1,'data_structures::linked_list::link']]], + ['ptrdiff_5ft_143',['ptrdiff_t',['http://en.cppreference.com/w/cpp/types/ptrdiff_t.html',0,'std']]], + ['ptrs_144',['ptrs',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5',1,'range_queries::perSegTree']]], + ['pubimbue_145',['pubimbue',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::pubimbue()']]], + ['pubseekoff_146',['pubseekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::pubseekoff()']]], + ['pubseekpos_147',['pubseekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::pubseekpos()']]], + ['pubsetbuf_148',['pubsetbuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::pubsetbuf()']]], + ['pubsync_149',['pubsync',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::pubsync()']]], + ['pull_20requests_150',['Pull Requests',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36',1,'']]], + ['push_151',['push',['http://en.cppreference.com/w/cpp/container/stack/push.html',0,'std::stack::push()'],['http://en.cppreference.com/w/cpp/container/queue/push.html',0,'std::queue::push()'],['http://en.cppreference.com/w/cpp/container/priority_queue/push.html',0,'std::priority_queue::push()'],['../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d',1,'stack::push()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2',1,'data_structures::stack_using_queue::Stack::push()'],['../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095',1,'push(): paranthesis_matching.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea',1,'others::postfix_expression::push()']]], + ['push_5fback_152',['push_back',['http://en.cppreference.com/w/cpp/container/vector/push_back.html',0,'std::vector::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::string::push_back()'],['http://en.cppreference.com/w/cpp/container/deque/push_back.html',0,'std::deque::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::basic_string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::wstring::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u16string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u32string::push_back()'],['http://en.cppreference.com/w/cpp/container/list/push_back.html',0,'std::list::push_back()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ad585670a392c7e842c992d088093dff5',1,'data_structures::linked_list::list::push_back()']]], + ['push_5ffront_153',['push_front',['http://en.cppreference.com/w/cpp/container/forward_list/push_front.html',0,'std::forward_list::push_front()'],['http://en.cppreference.com/w/cpp/container/deque/push_front.html',0,'std::deque::push_front()'],['http://en.cppreference.com/w/cpp/container/list/push_front.html',0,'std::list::push_front()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9c73f393e984f93f33852334d1a04be0',1,'data_structures::linked_list::list::push_front()']]], + ['push_5fheap_154',['push_heap',['http://en.cppreference.com/w/cpp/algorithm/push_heap.html',0,'std']]], + ['put_155',['put',['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::fstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostringstream::put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_fstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::iostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::stringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::strstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_stringstream::put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wiostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ofstream::put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostrstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wfstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_iostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wstringstream::put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::put()']]], + ['put_5fmoney_156',['put_money',['http://en.cppreference.com/w/cpp/io/manip/put_money.html',0,'std']]], + ['put_5ftime_157',['put_time',['http://en.cppreference.com/w/cpp/io/manip/put_time.html',0,'std']]], + ['putback_158',['putback',['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::strstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istrstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wiostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_ifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wfstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wstringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::ifstream::putback()']]], + ['putc_159',['putc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]], + ['putchar_160',['putchar',['http://en.cppreference.com/w/cpp/io/c/putchar.html',0,'std']]], + ['putprober_161',['putProber',['../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b',1,'double_hashing::putProber()'],['../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541',1,'linear_probing::putProber()'],['../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b',1,'quadratic_probing::putProber()']]], + ['puts_162',['puts',['http://en.cppreference.com/w/cpp/io/c/puts.html',0,'std']]], + ['putwchar_163',['putwchar',['http://en.cppreference.com/w/cpp/io/c/putwchar.html',0,'std']]], + ['pvalue_164',['pvalue',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936',1,'data_structures::linked_list::link']]], + ['pword_165',['pword',['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ios::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ios_base::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::strstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wiostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wfstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wstringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ifstream::pword()']]], + ['pyramid_5fvolume_166',['pyramid_volume',['../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c',1,'math']]] ]; diff --git a/search/all_16.js b/search/all_16.js index 2f8ec01ff..1ffb1c3c2 100644 --- a/search/all_16.js +++ b/search/all_16.js @@ -12,21 +12,23 @@ var searchData= ['quadraticequation_9',['quadraticEquation',['../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb',1,'math']]], ['quadraticprobe_10',['quadraticProbe',['../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf',1,'quadratic_probing']]], ['queries_11',['Range Queries',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65',1,'']]], - ['query_12',['query',['../dd/d1b/structquery.html',1,'query'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab',1,'range_queries::heavy_light_decomposition::HLD::query()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571',1,'range_queries::perSegTree::query(const uint32_t &l, const uint32_t &r, const uint32_t &version)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4',1,'range_queries::perSegTree::query(const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, std::shared_ptr< Node > const &curr)'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a1fda852e6e522707fd97f61cdb0a2591',1,'range_queries::heavy_light_decomposition::SG::query()'],['../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d',1,'query(): segtree.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#a7c8fd967c36dbba5fdf9c71faed604cf',1,'range_queries::prefix_sum_array::query()'],['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039',1,'data_structures::sparse_table::Sparse_table::query()']]], - ['queue_13',['queue',['http://en.cppreference.com/w/cpp/container/queue/queue.html',0,'std::queue::queue()'],['../dc/db5/struct_queue.html',1,'Queue'],['http://en.cppreference.com/w/cpp/container/queue.html',0,'std::queue< T >'],['../db/da9/classqueue.html',1,'queue< ValueType >']]], - ['queue_3c_20int64_5ft_20_3e_14',['queue< int64_t >',['http://en.cppreference.com/w/cpp/container/queue.html',0,'std']]], - ['queue_5farray_15',['Queue_Array',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html',1,'data_structures::queue_using_array']]], - ['queue_5ftest_16',['queue_test',['../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863',1,'queue_using_two_stacks.cpp']]], - ['queue_5fusing_5farray_17',['queue_using_array',['../d9/d70/namespacequeue__using__array.html',1,'']]], - ['queue_5fusing_5farray_2ecpp_18',['queue_using_array.cpp',['../d8/df0/queue__using__array_8cpp.html',1,'']]], - ['queue_5fusing_5ftwo_5fstacks_2ecpp_19',['queue_using_two_stacks.cpp',['../df/dd0/queue__using__two__stacks_8cpp.html',1,'']]], - ['queuefront_20',['queueFront',['../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094',1,'queue']]], - ['queuerear_21',['queueRear',['../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143',1,'queue']]], - ['quick_5fexit_22',['quick_exit',['http://en.cppreference.com/w/cpp/utility/program/quick_exit.html',0,'std']]], - ['quick_5fsort_23',['quick_sort',['../d1/d21/quick__sort_8cpp.html#a53adad7e4d83e1495df25fe8dbb4cc05',1,'sorting::quick_sort::quick_sort()'],['../d0/d2b/namespacequick__sort.html',1,'quick_sort'],['../d1/d21/quick__sort_8cpp.html#a5e6213e8008356ac6eda9427f3f4b394',1,'sorting::quick_sort::quick_sort()']]], - ['quick_5fsort_2ecpp_24',['quick_sort.cpp',['../d1/d21/quick__sort_8cpp.html',1,'']]], - ['quick_5fsort_5f3_2ecpp_25',['quick_sort_3.cpp',['../d3/d4c/quick__sort__3_8cpp.html',1,'']]], - ['quicksort_26',['quicksort',['../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168',1,'sorting::quicksort(std::vector< T > *arr, int32_t low, int32_t high)'],['../d5/d91/namespacesorting.html#a6eb67c2f91c98cf4464f75b5882022de',1,'sorting::quicksort(std::vector< T > arr, int32_t low, int32_t high)']]], - ['quicksortrp_27',['quickSortRP',['../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5',1,'sorting::random_pivot_quick_sort']]], - ['quiet_5fnan_28',['quiet_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/quiet_NaN.html',0,'std::numeric_limits']]] + ['query_12',['query',['../dd/d1b/structquery.html',1,'query'],['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039',1,'data_structures::sparse_table::Sparse_table::query()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a1fda852e6e522707fd97f61cdb0a2591',1,'range_queries::heavy_light_decomposition::SG::query()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab',1,'range_queries::heavy_light_decomposition::HLD::query()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4',1,'range_queries::perSegTree::query(const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, std::shared_ptr< Node > const &curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571',1,'range_queries::perSegTree::query(const uint32_t &l, const uint32_t &r, const uint32_t &version)'],['../d1/d9e/prefix__sum__array_8cpp.html#a7c8fd967c36dbba5fdf9c71faed604cf',1,'range_queries::prefix_sum_array::query()'],['../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d',1,'query(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos): segtree.cpp']]], + ['queue_13',['queue',['../db/da9/classqueue.html',1,'']]], + ['queue_14',['Queue',['../dc/db5/struct_queue.html',1,'']]], + ['queue_15',['queue',['http://en.cppreference.com/w/cpp/container/queue.html',0,'std::queue< T >'],['http://en.cppreference.com/w/cpp/container/queue/queue.html',0,'std::queue::queue()']]], + ['queue_3c_20int64_5ft_20_3e_16',['queue< int64_t >',['http://en.cppreference.com/w/cpp/container/queue.html',0,'std']]], + ['queue_5farray_17',['Queue_Array',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html',1,'data_structures::queue_using_array']]], + ['queue_5ftest_18',['queue_test',['../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863',1,'queue_using_two_stacks.cpp']]], + ['queue_5fusing_5farray_19',['queue_using_array',['../d9/d70/namespacequeue__using__array.html',1,'']]], + ['queue_5fusing_5farray_2ecpp_20',['queue_using_array.cpp',['../d8/df0/queue__using__array_8cpp.html',1,'']]], + ['queue_5fusing_5ftwo_5fstacks_2ecpp_21',['queue_using_two_stacks.cpp',['../df/dd0/queue__using__two__stacks_8cpp.html',1,'']]], + ['queuefront_22',['queueFront',['../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094',1,'queue']]], + ['queuerear_23',['queueRear',['../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143',1,'queue']]], + ['quick_5fexit_24',['quick_exit',['http://en.cppreference.com/w/cpp/utility/program/quick_exit.html',0,'std']]], + ['quick_5fsort_25',['quick_sort',['../d0/d2b/namespacequick__sort.html',1,'quick_sort'],['../d1/d21/quick__sort_8cpp.html#a5e6213e8008356ac6eda9427f3f4b394',1,'sorting::quick_sort::quick_sort(std::vector< T > *arr, const int &low, const int &high)'],['../d1/d21/quick__sort_8cpp.html#a53adad7e4d83e1495df25fe8dbb4cc05',1,'sorting::quick_sort::quick_sort(std::vector< T > arr, const int &low, const int &high)']]], + ['quick_5fsort_2ecpp_26',['quick_sort.cpp',['../d1/d21/quick__sort_8cpp.html',1,'']]], + ['quick_5fsort_5f3_2ecpp_27',['quick_sort_3.cpp',['../d3/d4c/quick__sort__3_8cpp.html',1,'']]], + ['quicksort_28',['quicksort',['../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168',1,'sorting::quicksort(std::vector< T > *arr, int32_t low, int32_t high)'],['../d5/d91/namespacesorting.html#a6eb67c2f91c98cf4464f75b5882022de',1,'sorting::quicksort(std::vector< T > arr, int32_t low, int32_t high)']]], + ['quicksortrp_29',['quickSortRP',['../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5',1,'sorting::random_pivot_quick_sort']]], + ['quiet_5fnan_30',['quiet_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/quiet_NaN.html',0,'std::numeric_limits']]] ]; diff --git a/search/all_17.js b/search/all_17.js index 779609a9c..6a38def83 100644 --- a/search/all_17.js +++ b/search/all_17.js @@ -7,7 +7,7 @@ var searchData= ['radix_5fsort2_2ecpp_4',['radix_sort2.cpp',['../d8/d61/radix__sort2_8cpp.html',1,'']]], ['raise_5',['raise',['http://en.cppreference.com/w/cpp/utility/program/raise.html',0,'std']]], ['rand_6',['rand',['http://en.cppreference.com/w/cpp/numeric/random/rand.html',0,'std']]], - ['rand_5frange_7',['rand_range',['../d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395',1,'ciphers::HillCipher::rand_range(matrix< T2 > *M, T1 a, T1 b)'],['../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9',1,'ciphers::HillCipher::rand_range(T1 a, T1 b)']]], + ['rand_5frange_7',['rand_range',['../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9',1,'ciphers::HillCipher::rand_range(T1 a, T1 b)'],['../d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395',1,'ciphers::HillCipher::rand_range(matrix< T2 > *M, T1 a, T1 b)']]], ['random_5faccess_5fiterator_5ftag_8',['random_access_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], ['random_5fdevice_9',['random_device',['http://en.cppreference.com/w/cpp/numeric/random/random_device.html',0,'std::random_device'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/random_device.html',0,'std::random_device::random_device()']]], ['random_5fpivot_5fquick_5fsort_10',['random_pivot_quick_sort',['../de/d6b/namespacerandom__pivot__quick__sort.html',1,'']]], @@ -18,14 +18,14 @@ var searchData= ['randomlevel_15',['randomLevel',['../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4',1,'data_structures::SkipList']]], ['range_20queries_16',['Range Queries',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65',1,'']]], ['range_5fcomb_17',['range_comb',['../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52',1,'data_structures::SegmentTree::range_comb(int i, int l, int r, int tl, int tr)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b',1,'data_structures::SegmentTree::range_comb(int l, int r)']]], - ['range_5ferror_18',['range_error',['http://en.cppreference.com/w/cpp/error/range_error.html',0,'std::range_error::range_error()'],['http://en.cppreference.com/w/cpp/error/range_error.html',0,'std::range_error']]], + ['range_5ferror_18',['range_error',['http://en.cppreference.com/w/cpp/error/range_error.html',0,'std::range_error'],['http://en.cppreference.com/w/cpp/error/range_error.html',0,'std::range_error::range_error()']]], ['range_5fqueries_19',['range_queries',['../dd/d69/namespacerange__queries.html',1,'']]], ['range_5ftries_20',['range_tries',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69',1,'probability::geometric_dist::geometric_distribution']]], ['rank_21',['rank',['http://en.cppreference.com/w/cpp/types/rank.html',0,'std']]], - ['ranlux24_22',['ranlux24',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::ranlux24::ranlux24()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std::ranlux24']]], - ['ranlux24_5fbase_23',['ranlux24_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::ranlux24_base::ranlux24_base()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std::ranlux24_base']]], - ['ranlux48_24',['ranlux48',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::ranlux48::ranlux48()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std::ranlux48']]], - ['ranlux48_5fbase_25',['ranlux48_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::ranlux48_base::ranlux48_base()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std::ranlux48_base']]], + ['ranlux24_22',['ranlux24',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std::ranlux24'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::ranlux24::ranlux24()']]], + ['ranlux24_5fbase_23',['ranlux24_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std::ranlux24_base'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::ranlux24_base::ranlux24_base()']]], + ['ranlux48_24',['ranlux48',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std::ranlux48'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::ranlux48::ranlux48()']]], + ['ranlux48_5fbase_25',['ranlux48_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std::ranlux48_base'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::ranlux48_base::ranlux48_base()']]], ['rat_5fmaze_26',['rat_maze',['../d9/d60/namespacerat__maze.html',1,'']]], ['rat_5fmaze_2ecpp_27',['rat_maze.cpp',['../dc/d5a/rat__maze_8cpp.html',1,'']]], ['ratio_28',['ratio',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], @@ -39,15 +39,15 @@ var searchData= ['ratio_5fmultiply_36',['ratio_multiply',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_multiply.html',0,'std']]], ['ratio_5fnot_5fequal_37',['ratio_not_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_not_equal.html',0,'std']]], ['ratio_5fsubtract_38',['ratio_subtract',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_subtract.html',0,'std']]], - ['raw_5fstorage_5fiterator_39',['raw_storage_iterator',['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/raw_storage_iterator.html',0,'std::raw_storage_iterator::raw_storage_iterator()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator.html',0,'std::raw_storage_iterator']]], - ['rbegin_40',['rbegin',['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::rbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::rbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::rbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::rbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::rbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::rbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::rbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::rbegin()'],['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::rbegin()']]], + ['raw_5fstorage_5fiterator_39',['raw_storage_iterator',['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator.html',0,'std::raw_storage_iterator'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/raw_storage_iterator.html',0,'std::raw_storage_iterator::raw_storage_iterator()']]], + ['rbegin_40',['rbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::rbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::rbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::rbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::rbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::rbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::rbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::rbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::rbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::rbegin()']]], ['rbtree_41',['RBtree',['../d8/d72/class_r_btree.html',1,'']]], - ['rdbuf_42',['rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wiostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wstringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_iostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wfstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::strstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/rdbuf.html',0,'std::wbuffer_convert::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ios::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::iostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostream::rdbuf()']]], - ['rdstate_43',['rdstate',['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wstringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wfstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wiostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::strstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ios::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostream::rdstate()']]], - ['read_44',['read',['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::ifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wstringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wfstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_ifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wiostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istrstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::strstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_fstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::fstream::read()']]], - ['readsome_45',['readsome',['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::strstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istrstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wiostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_ifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wfstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wstringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::ifstream::readsome()']]], + ['rdbuf_42',['rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/rdbuf.html',0,'std::wbuffer_convert::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ios::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::iostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::strstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wiostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wfstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_iostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wstringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ifstream::rdbuf()']]], + ['rdstate_43',['rdstate',['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ios::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::strstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wiostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wfstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wstringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ifstream::rdstate()']]], + ['read_44',['read',['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::fstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_fstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::strstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istrstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wiostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_ifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wfstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wstringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::ifstream::read()']]], + ['readsome_45',['readsome',['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::strstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istrstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wiostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_ifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wfstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wstringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::ifstream::readsome()']]], ['ready_46',['ready',['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::match_results::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::wsmatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::smatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::wcmatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::cmatch::ready()']]], - ['real_47',['real',['../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6',1,'Complex::real()'],['http://en.cppreference.com/w/cpp/numeric/complex/real.html',0,'std::complex::real()']]], + ['real_47',['real',['http://en.cppreference.com/w/cpp/numeric/complex/real.html',0,'std::complex::real()'],['../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6',1,'Complex::real()']]], ['realloc_48',['realloc',['http://en.cppreference.com/w/cpp/memory/c/realloc.html',0,'std']]], ['realtime_5fstats_2ecpp_49',['realtime_stats.cpp',['../d0/d08/realtime__stats_8cpp.html',1,'']]], ['rear_50',['rear',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85',1,'data_structures::queue_using_array::Queue_Array']]], @@ -64,90 +64,92 @@ var searchData= ['ref_61',['ref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]], ['refer_62',['refer',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602',1,'others::lru_cache::LRUCache']]], ['reference_63',['reference',['http://en.cppreference.com/w/cpp/utility/bitset/reference.html',0,'std::bitset']]], - ['reference_5fwrapper_64',['reference_wrapper',['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/reference_wrapper.html',0,'std::reference_wrapper::reference_wrapper()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper.html',0,'std::reference_wrapper']]], + ['reference_5fwrapper_64',['reference_wrapper',['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper.html',0,'std::reference_wrapper'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/reference_wrapper.html',0,'std::reference_wrapper::reference_wrapper()']]], ['regex_65',['regex',['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std::regex'],['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::regex::regex()']]], - ['regex_5ferror_66',['regex_error',['http://en.cppreference.com/w/cpp/regex/regex_error/regex_error.html',0,'std::regex_error::regex_error()'],['http://en.cppreference.com/w/cpp/regex/regex_error.html',0,'std::regex_error']]], - ['regex_5fiterator_67',['regex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::regex_iterator::regex_iterator()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::regex_iterator']]], + ['regex_5ferror_66',['regex_error',['http://en.cppreference.com/w/cpp/regex/regex_error.html',0,'std::regex_error'],['http://en.cppreference.com/w/cpp/regex/regex_error/regex_error.html',0,'std::regex_error::regex_error()']]], + ['regex_5fiterator_67',['regex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::regex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::regex_iterator::regex_iterator()']]], ['regex_5fmatch_68',['regex_match',['http://en.cppreference.com/w/cpp/regex/regex_match.html',0,'std']]], ['regex_5freplace_69',['regex_replace',['http://en.cppreference.com/w/cpp/regex/regex_replace.html',0,'std']]], ['regex_5fsearch_70',['regex_search',['http://en.cppreference.com/w/cpp/regex/regex_search.html',0,'std']]], - ['regex_5ftoken_5fiterator_71',['regex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::regex_token_iterator::regex_token_iterator()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::regex_token_iterator']]], - ['regex_5ftraits_72',['regex_traits',['http://en.cppreference.com/w/cpp/regex/regex_traits/regex_traits.html',0,'std::regex_traits::regex_traits()'],['http://en.cppreference.com/w/cpp/regex/regex_traits.html',0,'std::regex_traits']]], - ['register_5fcallback_73',['register_callback',['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ios::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ios_base::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::strstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wiostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wfstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wstringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostream::register_callback()']]], + ['regex_5ftoken_5fiterator_71',['regex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::regex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::regex_token_iterator::regex_token_iterator()']]], + ['regex_5ftraits_72',['regex_traits',['http://en.cppreference.com/w/cpp/regex/regex_traits.html',0,'std::regex_traits'],['http://en.cppreference.com/w/cpp/regex/regex_traits/regex_traits.html',0,'std::regex_traits::regex_traits()']]], + ['register_5fcallback_73',['register_callback',['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ios::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ios_base::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::strstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wiostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wfstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wstringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ifstream::register_callback()']]], ['regula_5ffalsi_74',['regula_falsi',['../dd/d29/false__position_8cpp.html#a7d69b49dc37da1c02b3ab8c7fe783494',1,'numerical_methods::false_position']]], - ['rehash_75',['rehash',['http://en.cppreference.com/w/cpp/container/unordered_map/rehash.html',0,'std::unordered_map::rehash()'],['../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0',1,'linear_probing::rehash()'],['../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486',1,'quadratic_probing::rehash()'],['../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d',1,'double_hashing::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/rehash.html',0,'std::unordered_multimap::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/rehash.html',0,'std::unordered_multiset::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_set/rehash.html',0,'std::unordered_set::rehash()']]], - ['release_76',['release',['http://en.cppreference.com/w/cpp/memory/auto_ptr/release.html',0,'std::auto_ptr::release()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/release.html',0,'std::unique_ptr::release()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/release.html',0,'std::shared_lock::release()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/release.html',0,'std::unique_lock::release()']]], + ['rehash_75',['rehash',['http://en.cppreference.com/w/cpp/container/unordered_map/rehash.html',0,'std::unordered_map::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/rehash.html',0,'std::unordered_multimap::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/rehash.html',0,'std::unordered_multiset::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_set/rehash.html',0,'std::unordered_set::rehash()'],['../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d',1,'double_hashing::rehash()'],['../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0',1,'linear_probing::rehash()'],['../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486',1,'quadratic_probing::rehash()']]], + ['release_76',['release',['http://en.cppreference.com/w/cpp/thread/unique_lock/release.html',0,'std::unique_lock::release()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/release.html',0,'std::unique_ptr::release()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/release.html',0,'std::shared_lock::release()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/release.html',0,'std::auto_ptr::release()']]], ['relu_77',['relu',['../d2/d58/neural__network_8cpp.html#af8f264600754602b6a9ea19cc690e50e',1,'machine_learning::neural_network::activations']]], ['remainder_78',['remainder',['http://en.cppreference.com/w/cpp/numeric/math/remainder.html',0,'std']]], - ['removalinfo_79',['removalinfo',['../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824',1,'double_hashing::removalInfo()'],['../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30',1,'quadratic_probing::removalInfo()'],['../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0',1,'linear_probing::removalInfo()']]], - ['remove_80',['remove',['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove()'],['../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28',1,'linear_probing::remove()'],['../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a',1,'quadratic_probing::remove()'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6',1,'data_structures::list_array::list::remove()'],['../d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb',1,'binary_search_tree::remove(T rm_value)'],['../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153',1,'binary_search_tree::remove(std::unique_ptr< bst_node > &parent, std::unique_ptr< bst_node > &node, T rm_value)'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove()'],['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove()'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11',1,'data_structures::tree_234::Tree234::Remove()'],['../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931',1,'double_hashing::remove()']]], - ['remove_5fall_5fextents_81',['remove_all_extents',['http://en.cppreference.com/w/cpp/types/remove_all_extents.html',0,'std']]], - ['remove_5fconst_82',['remove_const',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]], - ['remove_5fcopy_83',['remove_copy',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]], - ['remove_5fcopy_5fif_84',['remove_copy_if',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]], - ['remove_5fcv_85',['remove_cv',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]], - ['remove_5fextent_86',['remove_extent',['http://en.cppreference.com/w/cpp/types/remove_extent.html',0,'std']]], - ['remove_5fif_87',['remove_if',['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove_if()'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove_if()'],['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove_if(T... args)']]], - ['remove_5fpointer_88',['remove_pointer',['http://en.cppreference.com/w/cpp/types/remove_pointer.html',0,'std']]], - ['remove_5freference_89',['remove_reference',['http://en.cppreference.com/w/cpp/types/remove_reference.html',0,'std']]], - ['remove_5fvolatile_90',['remove_volatile',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]], - ['removeitembyindex_91',['RemoveItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8',1,'data_structures::tree_234::Node']]], - ['removepremerge_92',['RemovePreMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4',1,'data_structures::tree_234::Tree234']]], - ['removewordhelper_93',['removeWordHelper',['../dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d',1,'Trie']]], - ['remquo_94',['remquo',['http://en.cppreference.com/w/cpp/numeric/math/remquo.html',0,'std']]], - ['rename_95',['rename',['http://en.cppreference.com/w/cpp/io/c/rename.html',0,'std']]], - ['rend_96',['rend',['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::rend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::rend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::rend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::rend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::rend()'],['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::rend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::rend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::rend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::rend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::rend()']]], - ['replace_97',['replace',['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::wstring::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::basic_string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u16string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u32string::replace()'],['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std::replace(T... args)']]], - ['replace_5fcopy_98',['replace_copy',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]], - ['replace_5fcopy_5fif_99',['replace_copy_if',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]], - ['replace_5fif_100',['replace_if',['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std']]], - ['requests_101',['Pull Requests',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36',1,'']]], - ['res_102',['res',['../df/de5/classbacktracking_1_1generate__parentheses.html#ab35b9b6d2886abed3d6fb05c2be1c508',1,'backtracking::generate_parentheses']]], - ['reserve_103',['reserve',['http://en.cppreference.com/w/cpp/container/unordered_map/reserve.html',0,'std::unordered_map::reserve()'],['http://en.cppreference.com/w/cpp/container/vector/reserve.html',0,'std::vector::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/reserve.html',0,'std::unordered_multimap::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::basic_string::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::wstring::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/reserve.html',0,'std::unordered_multiset::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u16string::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u32string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_set/reserve.html',0,'std::unordered_set::reserve()']]], - ['reset_104',['reset',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/reset.html',0,'std::piecewise_linear_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/reset.html',0,'std::chi_squared_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/reset.html',0,'std::negative_binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/reset.html',0,'std::weibull_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/reset.html',0,'std::unique_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/reset.html',0,'std::normal_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/reset.html',0,'std::geometric_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/reset.html',0,'std::uniform_real_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/reset.html',0,'std::exponential_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/reset.html',0,'std::shared_ptr::reset()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/reset.html',0,'std::packaged_task::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/reset.html',0,'std::poisson_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/reset.html',0,'std::piecewise_constant_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/reset.html',0,'std::discrete_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/reset.html',0,'std::weak_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/reset.html',0,'std::lognormal_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/reset.html',0,'std::extreme_value_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/reset.html',0,'std::student_t_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/reset.html',0,'std::uniform_int_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/reset.html',0,'std::fisher_f_distribution::reset()'],['http://en.cppreference.com/w/cpp/utility/bitset/reset.html',0,'std::bitset::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/reset.html',0,'std::bernoulli_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/reset.html',0,'std::binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/reset.html',0,'std::auto_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/reset.html',0,'std::gamma_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/reset.html',0,'std::cauchy_distribution::reset()']]], - ['reset_5fdata_105',['reset_data',['../dd/d92/memory__game_8cpp.html#adc62ebb75853446656e24932bdc6dd6b',1,'games::memory_game']]], - ['resetiosflags_106',['resetiosflags',['http://en.cppreference.com/w/cpp/io/manip/resetiosflags.html',0,'std']]], - ['resize_107',['resize',['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::basic_string::resize()'],['http://en.cppreference.com/w/cpp/container/forward_list/resize.html',0,'std::forward_list::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::wstring::resize()'],['http://en.cppreference.com/w/cpp/container/list/resize.html',0,'std::list::resize()'],['http://en.cppreference.com/w/cpp/container/deque/resize.html',0,'std::deque::resize()'],['http://en.cppreference.com/w/cpp/container/vector/resize.html',0,'std::vector::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u32string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u16string::resize()']]], - ['responsibilities_108',['Enforcement Responsibilities',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md7',1,'']]], - ['result_109',['result',['../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa',1,'math::fibonacci_sum']]], - ['result_5fof_110',['result_of',['http://en.cppreference.com/w/cpp/types/result_of.html',0,'std']]], - ['rethrow_5fexception_111',['rethrow_exception',['http://en.cppreference.com/w/cpp/error/rethrow_exception.html',0,'std']]], - ['rethrow_5fif_5fnested_112',['rethrow_if_nested',['http://en.cppreference.com/w/cpp/error/rethrow_if_nested.html',0,'std']]], - ['rethrow_5fnested_113',['rethrow_nested',['http://en.cppreference.com/w/cpp/error/nested_exception/rethrow_nested.html',0,'std::nested_exception']]], - ['return_5ftemporary_5fbuffer_114',['return_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/return_temporary_buffer.html',0,'std']]], - ['returns_115',['Returns',['..//Users/runner/work/C-Plus-Plus/C-Plus-Plus/dynamic_programming/catalan_numbers.cpp#autotoc_md72',1,'']]], - ['reverse_116',['reverse',['http://en.cppreference.com/w/cpp/container/list/reverse.html',0,'std::list::reverse()'],['../d3/d92/pancake__sort_8cpp.html#a99e27ad84ad43df9977776b1a8d5416e',1,'sorting::pancake_sort::reverse()'],['http://en.cppreference.com/w/cpp/container/forward_list/reverse.html',0,'std::forward_list::reverse()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse()'],['http://en.cppreference.com/w/cpp/algorithm/reverse.html',0,'std::reverse()']]], - ['reverse_5fa_5flinked_5flist_2ecpp_117',['reverse_a_linked_list.cpp',['../d6/d05/reverse__a__linked__list_8cpp.html',1,'']]], - ['reverse_5fbinary_118',['reverse_binary',['../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb',1,'miller_rabin.cpp']]], - ['reverse_5fbinary_5ftree_119',['reverse_binary_tree',['../dc/dc5/namespacereverse__binary__tree.html',1,'']]], - ['reverse_5fbinary_5ftree_2ecpp_120',['reverse_binary_tree.cpp',['../d4/db6/reverse__binary__tree_8cpp.html',1,'']]], - ['reverse_5fcopy_121',['reverse_copy',['http://en.cppreference.com/w/cpp/algorithm/reverse_copy.html',0,'std']]], - ['reverse_5fiterator_122',['reverse_iterator',['http://en.cppreference.com/w/cpp/iterator/reverse_iterator.html',0,'std']]], - ['reverse_5fstr_123',['reverse_str',['../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541',1,'longest_common_string.cpp']]], - ['reversebinarytree_124',['reverseBinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]], - ['reverselist_125',['reverseList',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70',1,'data_structures::linked_list::list']]], - ['reviewer_126',['Maintainer/reviewer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24',1,'']]], - ['reviewers_20and_20maintainers_127',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]], - ['rewind_128',['rewind',['http://en.cppreference.com/w/cpp/io/c/rewind.html',0,'std']]], - ['rfind_129',['rfind',['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::basic_string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u16string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u32string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::wstring::rfind()']]], - ['right_130',['right',['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088',1,'range_queries::perSegTree::Node::right'],['../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e',1,'MinHeap::right()'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143',1,'others::iterative_tree_traversals::Node::right'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::right'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256',1,'operations_on_datastructures::reverse_binary_tree::Node::right'],['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::right()'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83',1,'others::recursive_tree_traversals::Node::right'],['../dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df',1,'binary_search_tree::bst_node::right']]], - ['right_20node_20subtree_131',['right node subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'Case 2: The given node does not have a right node/subtree']]], - ['right_5frotate_132',['right_rotate',['../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c',1,'hashing::sha256']]], - ['rightrotate_133',['rightrotate',['../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c',1,'rightRotate(): avltree.cpp'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9',1,'data_structures::tree_234::Tree234::RightRotate()']]], - ['rint_134',['rint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], - ['root_135',['root',['../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe',1,'graph::RootedTree::root'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::root'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::root'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c',1,'data_structures::treap::Treap::root']]], - ['root_20node_136',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md93',1,'']]], - ['root_5f_137',['root_',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36',1,'data_structures::tree_234::Tree234::root_'],['../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50',1,'binary_search_tree::root_']]], - ['root_5fnode_138',['root_node',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248',1,'data_structures::trie_using_hashmap::Trie']]], - ['rootedtree_139',['rootedtree',['../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d',1,'graph::RootedTree::RootedTree()'],['../d0/d58/classgraph_1_1_rooted_tree.html',1,'graph::RootedTree']]], - ['rotate_140',['rotate',['http://en.cppreference.com/w/cpp/algorithm/rotate.html',0,'std::rotate()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29',1,'data_structures::treap::Treap::rotate()']]], - ['rotate_5fcopy_141',['rotate_copy',['http://en.cppreference.com/w/cpp/algorithm/rotate_copy.html',0,'std']]], - ['round_142',['round',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], - ['round_5ferror_143',['round_error',['http://en.cppreference.com/w/cpp/types/numeric_limits/round_error.html',0,'std::numeric_limits']]], - ['run_5ftests_144',['run_tests',['../d3/db3/lru__cache_8cpp.html#a6a3be6d8871b1f5dc03688da8f3ee9e6',1,'lru_tests']]], - ['runge_5fkutta_145',['runge_kutta',['../d2/de7/namespacerunge__kutta.html',1,'']]], - ['rungekutta_146',['rungeKutta',['../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856',1,'numerical_methods::runge_kutta']]], - ['rungekutta_2ecpp_147',['rungekutta.cpp',['../d1/da6/rungekutta_8cpp.html',1,'']]], - ['runtests_148',['runtests',['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()']]], - ['runtime_5ferror_149',['runtime_error',['http://en.cppreference.com/w/cpp/error/runtime_error.html',0,'std::runtime_error::runtime_error()'],['http://en.cppreference.com/w/cpp/error/runtime_error.html',0,'std::runtime_error']]] + ['removalinfo_79',['removalInfo',['../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824',1,'double_hashing::removalInfo()'],['../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0',1,'linear_probing::removalInfo()'],['../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30',1,'quadratic_probing::removalInfo()']]], + ['remove_80',['Remove',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11',1,'data_structures::tree_234::Tree234']]], + ['remove_81',['remove',['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove()'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove()'],['../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153',1,'binary_search_tree::remove(std::unique_ptr< bst_node > &parent, std::unique_ptr< bst_node > &node, T rm_value)'],['../d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb',1,'binary_search_tree::remove(T rm_value)'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6',1,'data_structures::list_array::list::remove()'],['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove()'],['../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931',1,'double_hashing::remove()'],['../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28',1,'linear_probing::remove()'],['../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a',1,'quadratic_probing::remove()']]], + ['remove_5fall_5fextents_82',['remove_all_extents',['http://en.cppreference.com/w/cpp/types/remove_all_extents.html',0,'std']]], + ['remove_5fconst_83',['remove_const',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]], + ['remove_5fcopy_84',['remove_copy',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]], + ['remove_5fcopy_5fif_85',['remove_copy_if',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]], + ['remove_5fcv_86',['remove_cv',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]], + ['remove_5fextent_87',['remove_extent',['http://en.cppreference.com/w/cpp/types/remove_extent.html',0,'std']]], + ['remove_5fif_88',['remove_if',['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove_if()'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove_if()'],['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove_if(T... args)']]], + ['remove_5fpointer_89',['remove_pointer',['http://en.cppreference.com/w/cpp/types/remove_pointer.html',0,'std']]], + ['remove_5freference_90',['remove_reference',['http://en.cppreference.com/w/cpp/types/remove_reference.html',0,'std']]], + ['remove_5fvolatile_91',['remove_volatile',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]], + ['removeitembyindex_92',['RemoveItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8',1,'data_structures::tree_234::Node']]], + ['removepremerge_93',['RemovePreMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4',1,'data_structures::tree_234::Tree234']]], + ['removewordhelper_94',['removeWordHelper',['../dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d',1,'Trie']]], + ['remquo_95',['remquo',['http://en.cppreference.com/w/cpp/numeric/math/remquo.html',0,'std']]], + ['rename_96',['rename',['http://en.cppreference.com/w/cpp/io/c/rename.html',0,'std']]], + ['rend_97',['rend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::rend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::rend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::rend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::rend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::rend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::rend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::rend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::rend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::rend()']]], + ['replace_98',['replace',['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::basic_string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::wstring::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u16string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u32string::replace()'],['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std::replace(T... args)']]], + ['replace_5fcopy_99',['replace_copy',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]], + ['replace_5fcopy_5fif_100',['replace_copy_if',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]], + ['replace_5fif_101',['replace_if',['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std']]], + ['requests_102',['Pull Requests',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36',1,'']]], + ['res_103',['res',['../df/de5/classbacktracking_1_1generate__parentheses.html#ab35b9b6d2886abed3d6fb05c2be1c508',1,'backtracking::generate_parentheses']]], + ['reserve_104',['reserve',['http://en.cppreference.com/w/cpp/container/vector/reserve.html',0,'std::vector::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_map/reserve.html',0,'std::unordered_map::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/reserve.html',0,'std::unordered_multimap::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::basic_string::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::wstring::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/reserve.html',0,'std::unordered_multiset::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u16string::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u32string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_set/reserve.html',0,'std::unordered_set::reserve()']]], + ['reset_105',['reset',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/reset.html',0,'std::student_t_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/reset.html',0,'std::extreme_value_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/reset.html',0,'std::lognormal_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/reset.html',0,'std::weak_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/reset.html',0,'std::discrete_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/reset.html',0,'std::piecewise_constant_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/reset.html',0,'std::poisson_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/reset.html',0,'std::bernoulli_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/reset.html',0,'std::shared_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/reset.html',0,'std::exponential_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/reset.html',0,'std::uniform_real_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/reset.html',0,'std::geometric_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/reset.html',0,'std::normal_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/reset.html',0,'std::unique_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/reset.html',0,'std::weibull_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/reset.html',0,'std::negative_binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/reset.html',0,'std::chi_squared_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/reset.html',0,'std::piecewise_linear_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/reset.html',0,'std::uniform_int_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/reset.html',0,'std::fisher_f_distribution::reset()'],['http://en.cppreference.com/w/cpp/utility/bitset/reset.html',0,'std::bitset::reset()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/reset.html',0,'std::auto_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/reset.html',0,'std::gamma_distribution::reset()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/reset.html',0,'std::packaged_task::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/reset.html',0,'std::binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/reset.html',0,'std::cauchy_distribution::reset()']]], + ['reset_5fdata_106',['reset_data',['../dd/d92/memory__game_8cpp.html#adc62ebb75853446656e24932bdc6dd6b',1,'games::memory_game']]], + ['resetiosflags_107',['resetiosflags',['http://en.cppreference.com/w/cpp/io/manip/resetiosflags.html',0,'std']]], + ['resize_108',['resize',['http://en.cppreference.com/w/cpp/container/vector/resize.html',0,'std::vector::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::string::resize()'],['http://en.cppreference.com/w/cpp/container/forward_list/resize.html',0,'std::forward_list::resize()'],['http://en.cppreference.com/w/cpp/container/deque/resize.html',0,'std::deque::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::basic_string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::wstring::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u16string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u32string::resize()'],['http://en.cppreference.com/w/cpp/container/list/resize.html',0,'std::list::resize()']]], + ['responsibilities_109',['Enforcement Responsibilities',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md7',1,'']]], + ['result_110',['result',['../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa',1,'math::fibonacci_sum']]], + ['result_5fof_111',['result_of',['http://en.cppreference.com/w/cpp/types/result_of.html',0,'std']]], + ['rethrow_5fexception_112',['rethrow_exception',['http://en.cppreference.com/w/cpp/error/rethrow_exception.html',0,'std']]], + ['rethrow_5fif_5fnested_113',['rethrow_if_nested',['http://en.cppreference.com/w/cpp/error/rethrow_if_nested.html',0,'std']]], + ['rethrow_5fnested_114',['rethrow_nested',['http://en.cppreference.com/w/cpp/error/nested_exception/rethrow_nested.html',0,'std::nested_exception']]], + ['return_5ftemporary_5fbuffer_115',['return_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/return_temporary_buffer.html',0,'std']]], + ['returns_116',['Returns',['..//Users/runner/work/C-Plus-Plus/C-Plus-Plus/dynamic_programming/catalan_numbers.cpp#autotoc_md72',1,'']]], + ['reverse_117',['reverse',['http://en.cppreference.com/w/cpp/container/forward_list/reverse.html',0,'std::forward_list::reverse()'],['http://en.cppreference.com/w/cpp/container/list/reverse.html',0,'std::list::reverse()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse()'],['http://en.cppreference.com/w/cpp/algorithm/reverse.html',0,'std::reverse()'],['../d3/d92/pancake__sort_8cpp.html#a99e27ad84ad43df9977776b1a8d5416e',1,'sorting::pancake_sort::reverse()']]], + ['reverse_5fa_5flinked_5flist_2ecpp_118',['reverse_a_linked_list.cpp',['../d6/d05/reverse__a__linked__list_8cpp.html',1,'']]], + ['reverse_5fbinary_119',['reverse_binary',['../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb',1,'miller_rabin.cpp']]], + ['reverse_5fbinary_5ftree_120',['reverse_binary_tree',['../dc/dc5/namespacereverse__binary__tree.html',1,'']]], + ['reverse_5fbinary_5ftree_2ecpp_121',['reverse_binary_tree.cpp',['../d4/db6/reverse__binary__tree_8cpp.html',1,'']]], + ['reverse_5fcopy_122',['reverse_copy',['http://en.cppreference.com/w/cpp/algorithm/reverse_copy.html',0,'std']]], + ['reverse_5fiterator_123',['reverse_iterator',['http://en.cppreference.com/w/cpp/iterator/reverse_iterator.html',0,'std']]], + ['reverse_5fstr_124',['reverse_str',['../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541',1,'longest_common_string.cpp']]], + ['reversebinarytree_125',['reverseBinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]], + ['reverselist_126',['reverseList',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70',1,'data_structures::linked_list::list']]], + ['reviewer_127',['Maintainer/reviewer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24',1,'']]], + ['reviewers_20and_20maintainers_128',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]], + ['rewind_129',['rewind',['http://en.cppreference.com/w/cpp/io/c/rewind.html',0,'std']]], + ['rfind_130',['rfind',['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::basic_string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::wstring::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u16string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u32string::rfind()']]], + ['right_131',['right',['../dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df',1,'binary_search_tree::bst_node::right'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::right'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256',1,'operations_on_datastructures::reverse_binary_tree::Node::right'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143',1,'others::iterative_tree_traversals::Node::right'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83',1,'others::recursive_tree_traversals::Node::right'],['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088',1,'range_queries::perSegTree::Node::right'],['../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e',1,'MinHeap::right()'],['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::right()']]], + ['right_20node_20subtree_132',['Right node subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'Case 2: The given node does not have a right node/subtree']]], + ['right_5frotate_133',['right_rotate',['../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c',1,'hashing::sha256']]], + ['rightrotate_134',['RightRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9',1,'data_structures::tree_234::Tree234']]], + ['rightrotate_135',['rightRotate',['../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c',1,'avltree.cpp']]], + ['rint_136',['rint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], + ['root_137',['root',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c',1,'data_structures::treap::Treap::root'],['../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe',1,'graph::RootedTree::root'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::root'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::root']]], + ['root_20node_138',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md93',1,'']]], + ['root_5f_139',['root_',['../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50',1,'binary_search_tree::root_'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36',1,'data_structures::tree_234::Tree234::root_']]], + ['root_5fnode_140',['root_node',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248',1,'data_structures::trie_using_hashmap::Trie']]], + ['rootedtree_141',['RootedTree',['../d0/d58/classgraph_1_1_rooted_tree.html',1,'graph::RootedTree'],['../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d',1,'graph::RootedTree::RootedTree()']]], + ['rotate_142',['rotate',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29',1,'data_structures::treap::Treap::rotate()'],['http://en.cppreference.com/w/cpp/algorithm/rotate.html',0,'std::rotate(T... args)']]], + ['rotate_5fcopy_143',['rotate_copy',['http://en.cppreference.com/w/cpp/algorithm/rotate_copy.html',0,'std']]], + ['round_144',['round',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], + ['round_5ferror_145',['round_error',['http://en.cppreference.com/w/cpp/types/numeric_limits/round_error.html',0,'std::numeric_limits']]], + ['run_5ftests_146',['run_tests',['../d3/db3/lru__cache_8cpp.html#a6a3be6d8871b1f5dc03688da8f3ee9e6',1,'lru_tests']]], + ['runge_5fkutta_147',['runge_kutta',['../d2/de7/namespacerunge__kutta.html',1,'']]], + ['rungekutta_148',['rungeKutta',['../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856',1,'numerical_methods::runge_kutta']]], + ['rungekutta_2ecpp_149',['rungekutta.cpp',['../d1/da6/rungekutta_8cpp.html',1,'']]], + ['runtests_150',['runTests',['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()']]], + ['runtime_5ferror_151',['runtime_error',['http://en.cppreference.com/w/cpp/error/runtime_error.html',0,'std::runtime_error'],['http://en.cppreference.com/w/cpp/error/runtime_error.html',0,'std::runtime_error::runtime_error()']]] ]; diff --git a/search/all_18.js b/search/all_18.js index 6fc926624..f9874939a 100644 --- a/search/all_18.js +++ b/search/all_18.js @@ -8,14 +8,14 @@ var searchData= ['safe_5fsubstr_5',['safe_substr',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6',1,'divide_and_conquer::karatsuba_algorithm']]], ['sample_5ftest_6',['sample_test',['../de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6',1,'geometric_dist.cpp']]], ['save_5f2d_5fdata_7',['save_2d_data',['../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c',1,'kohonen_som_topology.cpp']]], - ['save_5fexact_5fsolution_8',['save_exact_solution',['../d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0): ode_midpoint_euler.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0): ode_forward_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0): ode_semi_implicit_euler.cpp']]], + ['save_5fexact_5fsolution_8',['save_exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0): ode_semi_implicit_euler.cpp']]], ['save_5fmodel_9',['save_model',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4f14e473bb0722c6490b9dc8da5982aa',1,'machine_learning::neural_network::NeuralNetwork']]], ['save_5fnd_5fdata_10',['save_nd_data',['../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67',1,'kohonen_som_trace.cpp']]], ['save_5fu_5fmatrix_11',['save_u_matrix',['../d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07',1,'machine_learning']]], - ['sbumpc_12',['sbumpc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_filebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::streambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::filebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_streambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_stringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::strstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wfilebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::stringbuf::sbumpc()']]], + ['sbumpc_12',['sbumpc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_filebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::stringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wfilebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::strstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_stringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_streambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::filebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::streambuf::sbumpc()']]], ['scalbln_13',['scalbln',['http://en.cppreference.com/w/cpp/numeric/math/scalbn.html',0,'std']]], ['scalbn_14',['scalbn',['http://en.cppreference.com/w/cpp/numeric/math/scalbn.html',0,'std']]], - ['scan_5fis_15',['scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::scan_is()']]], + ['scan_5fis_15',['scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::scan_is()']]], ['scanf_16',['scanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]], ['schedule_17',['schedule',['../dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46',1,'FCFS']]], ['scheduleforfcfs_18',['scheduleForFcfs',['../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91',1,'FCFS']]], @@ -24,308 +24,314 @@ var searchData= ['scope_21',['Scope',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md8',1,'']]], ['scoped_5fallocator_5fadaptor_22',['scoped_allocator_adaptor',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor.html',0,'std::scoped_allocator_adaptor'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/scoped_allocator_adaptor.html',0,'std::scoped_allocator_adaptor::scoped_allocator_adaptor()']]], ['scs_23',['scs',['../d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6',1,'dynamic_programming::shortest_common_supersequence']]], - ['search_24',['search',['../d3/db2/boyer__moore_8cpp.html#a15703b553faed0d28202c10808cf9738',1,'strings::boyer_moore::search()'],['http://en.cppreference.com/w/cpp/algorithm/search.html',0,'std::search()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a098be172c737f236763afdb8cada4835',1,'data_structures::linked_list::list::search()'],['../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206',1,'Trie::search()'],['../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63',1,'data_structures::trie::search(const std::shared_ptr< trie > &root, const std::string &str, int index)'],['../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d',1,'data_structures::trie::search(const std::string &str, int index)'],['../d9/dca/namespacesearch.html',1,'search'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f',1,'data_structures::trie_using_hashmap::Trie::search()'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66',1,'Search']]], - ['search_20from_20the_20root_20node_25',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md93',1,'']]], - ['search_5fn_26',['search_n',['http://en.cppreference.com/w/cpp/algorithm/search_n.html',0,'std']]], - ['searchelement_27',['searchElement',['../d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4',1,'data_structures::SkipList']]], - ['searchfreqsuggestions_28',['SearchFreqSuggestions',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503',1,'operations_on_datastructures::trie_operations::Tnode']]], - ['searchingprober_29',['searchingprober',['../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6',1,'quadratic_probing::searchingProber()'],['../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77',1,'linear_probing::searchingProber()'],['../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6',1,'double_hashing::searchingProber()']]], - ['searchpresence_30',['SearchPresence',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023',1,'operations_on_datastructures::trie_operations::Tnode']]], - ['searchsuggestions_31',['SearchSuggestions',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c',1,'operations_on_datastructures::trie_operations::Tnode']]], - ['seconds_32',['seconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::seconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::seconds::seconds()']]], - ['seed_33',['seed',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mersenne_twister_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/seed.html',0,'std::independent_bits_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux48_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::shuffle_order_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux24::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::linear_congruential_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::knuth_b::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand0::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::subtract_with_carry_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937_64::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::discard_block_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux48::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux24_base::seed()']]], - ['seed_5fseq_34',['seed_seq',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq.html',0,'std::seed_seq'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/seed_seq.html',0,'std::seed_seq::seed_seq()']]], - ['seekg_35',['seekg',['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::strstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istrstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wiostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_ifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wfstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wstringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::ifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistream::seekg()']]], - ['seekoff_36',['seekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::seekoff()']]], - ['seekp_37',['seekp',['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wstringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_iostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::iostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::strstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wfstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostrstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wiostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostringstream::seekp()']]], - ['seekpos_38',['seekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::seekpos()']]], - ['segment_5ftree_2ecpp_39',['segment_tree.cpp',['../de/dd1/segment__tree_8cpp.html',1,'']]], - ['segmentintersection_40',['SegmentIntersection',['../d4/db4/struct_segment_intersection.html',1,'']]], - ['segmenttree_41',['SegmentTree',['../dd/d95/classdata__structures_1_1_segment_tree.html',1,'data_structures']]], - ['segtree_2ecpp_42',['segtree.cpp',['../d2/d45/segtree_8cpp.html',1,'']]], - ['select_5fon_5fcontainer_5fcopy_5fconstruction_43',['select_on_container_copy_construction',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/select_on_container_copy_construction.html',0,'std::scoped_allocator_adaptor::select_on_container_copy_construction()'],['http://en.cppreference.com/w/cpp/memory/allocator_traits/select_on_container_copy_construction.html',0,'std::allocator_traits::select_on_container_copy_construction()']]], - ['selection_5fsort_5frecursive_44',['selection_sort_recursive',['../df/d4a/namespaceselection__sort__recursive.html',1,'']]], - ['selection_5fsort_5frecursive_2ecpp_45',['selection_sort_recursive.cpp',['../d4/d9f/selection__sort__recursive_8cpp.html',1,'']]], - ['selectionsortrecursive_46',['selectionSortRecursive',['../d4/d9f/selection__sort__recursive_8cpp.html#ab6f7b33a070e376e1f4374e534435e89',1,'sorting::selection_sort_recursive']]], - ['selectiontop_5f3_47',['SelectionTop_3',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6',1,'operations_on_datastructures::trie_operations::Tnode']]], - ['self_20test_20examples_48',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]], - ['semi_5fimplicit_5feuler_49',['semi_implicit_euler',['../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089',1,'ode_semi_implicit_euler.cpp']]], - ['semi_5fimplicit_5feuler_5fstep_50',['semi_implicit_euler_step',['../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f',1,'ode_semi_implicit_euler.cpp']]], - ['sentry_51',['sentry',['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_fstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_iostream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_stringstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::fstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::iostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::stringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::strstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wfstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wstringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wiostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry']]], - ['set_52',['set',['http://en.cppreference.com/w/cpp/container/set.html',0,'std::set< K >'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119',1,'data_structures::BloomFilter::set'],['http://en.cppreference.com/w/cpp/utility/bitset/set.html',0,'std::bitset::set()'],['http://en.cppreference.com/w/cpp/container/set/set.html',0,'std::set::set()']]], - ['set_5fdifference_53',['set_difference',['http://en.cppreference.com/w/cpp/algorithm/set_difference.html',0,'std']]], - ['set_5fexception_54',['set_exception',['http://en.cppreference.com/w/cpp/thread/promise/set_exception.html',0,'std::promise']]], - ['set_5fexception_5fat_5fthread_5fexit_55',['set_exception_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/promise/set_exception_at_thread_exit.html',0,'std::promise']]], - ['set_5fintersection_56',['set_intersection',['http://en.cppreference.com/w/cpp/algorithm/set_intersection.html',0,'std']]], - ['set_5fkth_5fbit_2ecpp_57',['set_kth_bit.cpp',['../d5/db5/set__kth__bit_8cpp.html',1,'']]], - ['set_5fnew_5fhandler_58',['set_new_handler',['http://en.cppreference.com/w/cpp/memory/new/set_new_handler.html',0,'std']]], - ['set_5fnode_5fval_59',['set_node_val',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70',1,'range_queries::heavy_light_decomposition::Tree']]], - ['set_5frdbuf_60',['set_rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ios::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wiostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wfstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wstringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::strstream::set_rdbuf()']]], - ['set_5fsret_5finit_61',['set_sret_init',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ad3b942be27a1b0fe3cff6cb6edf01294',1,'range_queries::heavy_light_decomposition::SG']]], - ['set_5fsymmetric_5fdifference_62',['set_symmetric_difference',['http://en.cppreference.com/w/cpp/algorithm/set_symmetric_difference.html',0,'std']]], - ['set_5fterminate_63',['set_terminate',['http://en.cppreference.com/w/cpp/error/set_terminate.html',0,'std']]], - ['set_5funexpected_64',['set_unexpected',['http://en.cppreference.com/w/cpp/error/set_unexpected.html',0,'std']]], - ['set_5funion_65',['set_union',['http://en.cppreference.com/w/cpp/algorithm/set_union.html',0,'std']]], - ['set_5fvalue_66',['set_value',['http://en.cppreference.com/w/cpp/thread/promise/set_value.html',0,'std::promise']]], - ['set_5fvalue_5fat_5fthread_5fexit_67',['set_value_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/promise/set_value_at_thread_exit.html',0,'std::promise']]], - ['setbase_68',['setbase',['http://en.cppreference.com/w/cpp/io/manip/setbase.html',0,'std']]], - ['setbuf_69',['setbuf',['http://en.cppreference.com/w/cpp/io/c/setbuf.html',0,'std::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::setbuf()']]], - ['setchild_70',['SetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74',1,'data_structures::tree_234::Node']]], - ['setcount_71',['SetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1',1,'data_structures::tree_234::Node']]], - ['setf_72',['setf',['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wfstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::strstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ios_base::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ios::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wiostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wstringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistringstream::setf()']]], - ['setfill_73',['setfill',['http://en.cppreference.com/w/cpp/io/manip/setfill.html',0,'std']]], - ['setg_74',['setg',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_streambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::strstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wfilebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::streambuf::setg()']]], - ['setiosflags_75',['setiosflags',['http://en.cppreference.com/w/cpp/io/manip/setiosflags.html',0,'std']]], - ['setitem_76',['SetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc',1,'data_structures::tree_234::Node']]], - ['setkthbit_77',['setkthbit',['../d5/db5/set__kth__bit_8cpp.html#ad4d0ffd9331242c42a28834ee19f5fd9',1,'bit_manipulation::set_kth_bit::setKthBit()'],['../d8/d88/namespaceset_kth_bit.html',1,'setKthBit']]], - ['setlocale_78',['setlocale',['http://en.cppreference.com/w/cpp/locale/setlocale.html',0,'std']]], - ['setp_79',['setp',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wfilebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::strstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_streambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_stringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::streambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::stringbuf::setp()']]], - ['setprecision_80',['setprecision',['http://en.cppreference.com/w/cpp/io/manip/setprecision.html',0,'std']]], - ['setsize_81',['setSize',['../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55',1,'dsu']]], - ['setstate_82',['setstate',['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostrstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wfstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wstringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wiostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ios::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::strstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istrstream::setstate()']]], - ['setvbuf_83',['setvbuf',['http://en.cppreference.com/w/cpp/io/c/setvbuf.html',0,'std']]], - ['setw_84',['setw',['http://en.cppreference.com/w/cpp/io/manip/setw.html',0,'std']]], - ['sg_85',['sg',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html',1,'range_queries::heavy_light_decomposition::SG< X >'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1',1,'range_queries::heavy_light_decomposition::SG::SG()']]], - ['sgetc_86',['sgetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wfilebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstreambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::strstreambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_streambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::streambuf::sgetc()']]], - ['sgetn_87',['sgetn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::stringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::strstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::streambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wfilebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_streambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_stringbuf::sgetn()']]], - ['sgn_88',['sgn',['../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2',1,'bisection_method.cpp']]], - ['sha_89',['SHA',['../de/dd3/namespace_s_h_a.html',1,'']]], - ['sha1_2ecpp_90',['sha1.cpp',['../d8/d7a/sha1_8cpp.html',1,'']]], - ['sha256_91',['sha256',['../d4/d08/sha256_8cpp.html#a55475649a2bb7aae15de0716a217f43a',1,'hashing::sha256']]], - ['sha256_2ecpp_92',['sha256.cpp',['../d4/d08/sha256_8cpp.html',1,'']]], - ['share_93',['share',['http://en.cppreference.com/w/cpp/thread/future/share.html',0,'std::future']]], - ['shared_5ffrom_5fthis_94',['shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/shared_from_this.html',0,'std::enable_shared_from_this']]], - ['shared_5ffuture_95',['shared_future',['http://en.cppreference.com/w/cpp/thread/shared_future.html',0,'std::shared_future'],['http://en.cppreference.com/w/cpp/thread/shared_future/shared_future.html',0,'std::shared_future::shared_future()']]], - ['shared_5flock_96',['shared_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock/shared_lock.html',0,'std::shared_lock::shared_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock.html',0,'std::shared_lock< T >']]], - ['shared_5fptr_97',['shared_ptr',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std::shared_ptr< T >'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/shared_ptr.html',0,'std::shared_ptr::shared_ptr()']]], - ['shared_5fptr_3c_20data_5fstructures_3a_3alinked_5flist_3a_3alink_20_3e_98',['shared_ptr< data_structures::linked_list::link >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20data_5fstructures_3a_3anode_20_3e_99',['shared_ptr< data_structures::Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20data_5fstructures_3a_3atrie_5fusing_5fhashmap_3a_3atrie_3a_3anode_20_3e_100',['shared_ptr< data_structures::trie_using_hashmap::Trie::Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20machine_5flearning_3a_3aaystar_5fsearch_3a_3aaystarsearch_3a_3ainfo_20_3e_101',['shared_ptr< machine_learning::aystar_search::AyStarSearch::Info >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20node_20_3e_102',['shared_ptr< Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20node_3c_20value_5ftype_20_3e_20_3e_103',['shared_ptr< Node< value_type > >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20node_3c_20valuetype_20_3e_20_3e_104',['shared_ptr< Node< ValueType > >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20puzzle_20_3e_105',['shared_ptr< Puzzle >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20range_5fqueries_3a_3apersegtree_3a_3anode_20_3e_106',['shared_ptr< range_queries::perSegTree::Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20struct_20node_20_3e_107',['shared_ptr< struct Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['search_24',['search',['../d9/dca/namespacesearch.html',1,'search'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a098be172c737f236763afdb8cada4835',1,'data_structures::linked_list::list::search()'],['../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206',1,'Trie::search()'],['../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63',1,'data_structures::trie::search(const std::shared_ptr< trie > &root, const std::string &str, int index)'],['../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d',1,'data_structures::trie::search(const std::string &str, int index)'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f',1,'data_structures::trie_using_hashmap::Trie::search()'],['http://en.cppreference.com/w/cpp/algorithm/search.html',0,'std::search()'],['../d3/db2/boyer__moore_8cpp.html#a15703b553faed0d28202c10808cf9738',1,'strings::boyer_moore::search()']]], + ['search_25',['Search',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66',1,'']]], + ['search_20from_20the_20root_20node_26',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md93',1,'']]], + ['search_5fn_27',['search_n',['http://en.cppreference.com/w/cpp/algorithm/search_n.html',0,'std']]], + ['searchelement_28',['searchElement',['../d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4',1,'data_structures::SkipList']]], + ['searchfreqsuggestions_29',['SearchFreqSuggestions',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503',1,'operations_on_datastructures::trie_operations::Tnode']]], + ['searchingprober_30',['searchingProber',['../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6',1,'double_hashing::searchingProber()'],['../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77',1,'linear_probing::searchingProber()'],['../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6',1,'quadratic_probing::searchingProber()']]], + ['searchpresence_31',['SearchPresence',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023',1,'operations_on_datastructures::trie_operations::Tnode']]], + ['searchsuggestions_32',['SearchSuggestions',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c',1,'operations_on_datastructures::trie_operations::Tnode']]], + ['seconds_33',['seconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::seconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::seconds::seconds()']]], + ['seed_34',['seed',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937_64::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux24_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux48::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::discard_block_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mersenne_twister_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/seed.html',0,'std::independent_bits_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux48_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::shuffle_order_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux24::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::linear_congruential_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::knuth_b::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand0::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::subtract_with_carry_engine::seed()']]], + ['seed_5fseq_35',['seed_seq',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq.html',0,'std::seed_seq'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/seed_seq.html',0,'std::seed_seq::seed_seq()']]], + ['seekg_36',['seekg',['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::strstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istrstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wiostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_ifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wfstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wstringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::ifstream::seekg()']]], + ['seekoff_37',['seekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::seekoff()']]], + ['seekp_38',['seekp',['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::iostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::strstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wiostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostrstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wfstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_iostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wstringstream::seekp()']]], + ['seekpos_39',['seekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::seekpos()']]], + ['segment_5ftree_2ecpp_40',['segment_tree.cpp',['../de/dd1/segment__tree_8cpp.html',1,'']]], + ['segmentintersection_41',['SegmentIntersection',['../d4/db4/struct_segment_intersection.html',1,'']]], + ['segmenttree_42',['SegmentTree',['../dd/d95/classdata__structures_1_1_segment_tree.html',1,'data_structures']]], + ['segtree_2ecpp_43',['segtree.cpp',['../d2/d45/segtree_8cpp.html',1,'']]], + ['select_5fon_5fcontainer_5fcopy_5fconstruction_44',['select_on_container_copy_construction',['http://en.cppreference.com/w/cpp/memory/allocator_traits/select_on_container_copy_construction.html',0,'std::allocator_traits::select_on_container_copy_construction()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/select_on_container_copy_construction.html',0,'std::scoped_allocator_adaptor::select_on_container_copy_construction()']]], + ['selection_5fsort_5frecursive_45',['selection_sort_recursive',['../df/d4a/namespaceselection__sort__recursive.html',1,'']]], + ['selection_5fsort_5frecursive_2ecpp_46',['selection_sort_recursive.cpp',['../d4/d9f/selection__sort__recursive_8cpp.html',1,'']]], + ['selectionsortrecursive_47',['selectionSortRecursive',['../d4/d9f/selection__sort__recursive_8cpp.html#ab6f7b33a070e376e1f4374e534435e89',1,'sorting::selection_sort_recursive']]], + ['selectiontop_5f3_48',['SelectionTop_3',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6',1,'operations_on_datastructures::trie_operations::Tnode']]], + ['self_20test_20examples_49',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]], + ['semi_5fimplicit_5feuler_50',['semi_implicit_euler',['../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089',1,'ode_semi_implicit_euler.cpp']]], + ['semi_5fimplicit_5feuler_5fstep_51',['semi_implicit_euler_step',['../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f',1,'ode_semi_implicit_euler.cpp']]], + ['sentry_52',['sentry',['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_fstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_iostream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_stringstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::fstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::iostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::stringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::strstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wfstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wiostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wstringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::sentry()']]], + ['set_53',['set',['http://en.cppreference.com/w/cpp/container/set.html',0,'std::set< K >'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119',1,'data_structures::BloomFilter::set'],['http://en.cppreference.com/w/cpp/container/set/set.html',0,'std::set::set()'],['http://en.cppreference.com/w/cpp/utility/bitset/set.html',0,'std::bitset::set()']]], + ['set_5fdifference_54',['set_difference',['http://en.cppreference.com/w/cpp/algorithm/set_difference.html',0,'std']]], + ['set_5fexception_55',['set_exception',['http://en.cppreference.com/w/cpp/thread/promise/set_exception.html',0,'std::promise']]], + ['set_5fexception_5fat_5fthread_5fexit_56',['set_exception_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/promise/set_exception_at_thread_exit.html',0,'std::promise']]], + ['set_5fintersection_57',['set_intersection',['http://en.cppreference.com/w/cpp/algorithm/set_intersection.html',0,'std']]], + ['set_5fkth_5fbit_2ecpp_58',['set_kth_bit.cpp',['../d5/db5/set__kth__bit_8cpp.html',1,'']]], + ['set_5fnew_5fhandler_59',['set_new_handler',['http://en.cppreference.com/w/cpp/memory/new/set_new_handler.html',0,'std']]], + ['set_5fnode_5fval_60',['set_node_val',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70',1,'range_queries::heavy_light_decomposition::Tree']]], + ['set_5frdbuf_61',['set_rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ios::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::strstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wiostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wfstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wstringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ifstream::set_rdbuf()']]], + ['set_5fsret_5finit_62',['set_sret_init',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ad3b942be27a1b0fe3cff6cb6edf01294',1,'range_queries::heavy_light_decomposition::SG']]], + ['set_5fsymmetric_5fdifference_63',['set_symmetric_difference',['http://en.cppreference.com/w/cpp/algorithm/set_symmetric_difference.html',0,'std']]], + ['set_5fterminate_64',['set_terminate',['http://en.cppreference.com/w/cpp/error/set_terminate.html',0,'std']]], + ['set_5funexpected_65',['set_unexpected',['http://en.cppreference.com/w/cpp/error/set_unexpected.html',0,'std']]], + ['set_5funion_66',['set_union',['http://en.cppreference.com/w/cpp/algorithm/set_union.html',0,'std']]], + ['set_5fvalue_67',['set_value',['http://en.cppreference.com/w/cpp/thread/promise/set_value.html',0,'std::promise']]], + ['set_5fvalue_5fat_5fthread_5fexit_68',['set_value_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/promise/set_value_at_thread_exit.html',0,'std::promise']]], + ['setbase_69',['setbase',['http://en.cppreference.com/w/cpp/io/manip/setbase.html',0,'std']]], + ['setbuf_70',['setbuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/c/setbuf.html',0,'std::setbuf()']]], + ['setchild_71',['SetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74',1,'data_structures::tree_234::Node']]], + ['setcount_72',['SetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1',1,'data_structures::tree_234::Node']]], + ['setf_73',['setf',['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ios::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ios_base::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::strstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wiostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wfstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wstringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ifstream::setf()']]], + ['setfill_74',['setfill',['http://en.cppreference.com/w/cpp/io/manip/setfill.html',0,'std']]], + ['setg_75',['setg',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wfilebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::strstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_streambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::streambuf::setg()']]], + ['setiosflags_76',['setiosflags',['http://en.cppreference.com/w/cpp/io/manip/setiosflags.html',0,'std']]], + ['setitem_77',['SetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc',1,'data_structures::tree_234::Node']]], + ['setkthbit_78',['setKthBit',['../d8/d88/namespaceset_kth_bit.html',1,'setKthBit'],['../d5/db5/set__kth__bit_8cpp.html#ad4d0ffd9331242c42a28834ee19f5fd9',1,'bit_manipulation::set_kth_bit::setKthBit()']]], + ['setlocale_79',['setlocale',['http://en.cppreference.com/w/cpp/locale/setlocale.html',0,'std']]], + ['setp_80',['setp',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::stringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wfilebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::strstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_stringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_streambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::streambuf::setp()']]], + ['setprecision_81',['setprecision',['http://en.cppreference.com/w/cpp/io/manip/setprecision.html',0,'std']]], + ['setsize_82',['setSize',['../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55',1,'dsu']]], + ['setstate_83',['setstate',['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ios::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::strstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istrstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wiostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostrstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wfstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wstringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ifstream::setstate()']]], + ['setvbuf_84',['setvbuf',['http://en.cppreference.com/w/cpp/io/c/setvbuf.html',0,'std']]], + ['setw_85',['setw',['http://en.cppreference.com/w/cpp/io/manip/setw.html',0,'std']]], + ['sg_86',['SG',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html',1,'range_queries::heavy_light_decomposition::SG< X >'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1',1,'range_queries::heavy_light_decomposition::SG::SG()']]], + ['sgetc_87',['sgetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wfilebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstreambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::strstreambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_streambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::streambuf::sgetc()']]], + ['sgetn_88',['sgetn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::stringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wfilebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::strstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_stringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_streambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::streambuf::sgetn()']]], + ['sgn_89',['sgn',['../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2',1,'bisection_method.cpp']]], + ['sha_90',['SHA',['../de/dd3/namespace_s_h_a.html',1,'']]], + ['sha1_2ecpp_91',['sha1.cpp',['../d8/d7a/sha1_8cpp.html',1,'']]], + ['sha256_92',['sha256',['../d4/d08/sha256_8cpp.html#a55475649a2bb7aae15de0716a217f43a',1,'hashing::sha256']]], + ['sha256_2ecpp_93',['sha256.cpp',['../d4/d08/sha256_8cpp.html',1,'']]], + ['share_94',['share',['http://en.cppreference.com/w/cpp/thread/future/share.html',0,'std::future']]], + ['shared_5ffrom_5fthis_95',['shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/shared_from_this.html',0,'std::enable_shared_from_this']]], + ['shared_5ffuture_96',['shared_future',['http://en.cppreference.com/w/cpp/thread/shared_future.html',0,'std::shared_future'],['http://en.cppreference.com/w/cpp/thread/shared_future/shared_future.html',0,'std::shared_future::shared_future()']]], + ['shared_5flock_97',['shared_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock.html',0,'std::shared_lock< T >'],['http://en.cppreference.com/w/cpp/thread/shared_lock/shared_lock.html',0,'std::shared_lock::shared_lock()']]], + ['shared_5fptr_98',['shared_ptr',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std::shared_ptr< T >'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/shared_ptr.html',0,'std::shared_ptr::shared_ptr()']]], + ['shared_5fptr_3c_20data_5fstructures_3a_3alinked_5flist_3a_3alink_20_3e_99',['shared_ptr< data_structures::linked_list::link >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5fptr_3c_20data_5fstructures_3a_3anode_20_3e_100',['shared_ptr< data_structures::Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5fptr_3c_20data_5fstructures_3a_3atrie_5fusing_5fhashmap_3a_3atrie_3a_3anode_20_3e_101',['shared_ptr< data_structures::trie_using_hashmap::Trie::Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5fptr_3c_20machine_5flearning_3a_3aaystar_5fsearch_3a_3aaystarsearch_3a_3ainfo_20_3e_102',['shared_ptr< machine_learning::aystar_search::AyStarSearch::Info >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5fptr_3c_20node_20_3e_103',['shared_ptr< Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5fptr_3c_20node_3c_20value_5ftype_20_3e_20_3e_104',['shared_ptr< Node< value_type > >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5fptr_3c_20node_3c_20valuetype_20_3e_20_3e_105',['shared_ptr< Node< ValueType > >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5fptr_3c_20puzzle_20_3e_106',['shared_ptr< Puzzle >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5fptr_3c_20range_5fqueries_3a_3apersegtree_3a_3anode_20_3e_107',['shared_ptr< range_queries::perSegTree::Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], ['shared_5fptr_3c_20trie_3a_3atrienode_20_3e_108',['shared_ptr< Trie::TrieNode >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], ['shared_5ftimed_5fmutex_109',['shared_timed_mutex',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex.html',0,'std::shared_timed_mutex'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/shared_timed_mutex.html',0,'std::shared_timed_mutex::shared_timed_mutex()']]], - ['shell_5fsort_110',['shell_sort',['../d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331',1,'sorting::shell_sort(std::vector< T > *arr)'],['../d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924',1,'sorting::shell_sort(T(&arr)[N])'],['../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa',1,'sorting::shell_sort(T *arr, size_t LEN)']]], + ['shell_5fsort_110',['shell_sort',['../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa',1,'sorting::shell_sort(T *arr, size_t LEN)'],['../d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924',1,'sorting::shell_sort(T(&arr)[N])'],['../d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331',1,'sorting::shell_sort(std::vector< T > *arr)']]], ['shell_5fsort2_2ecpp_111',['shell_sort2.cpp',['../d4/d7a/shell__sort2_8cpp.html',1,'']]], ['shift_5fleft_112',['shift_left',['../da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8',1,'operations_on_datastructures']]], ['shift_5fright_113',['shift_right',['../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86',1,'operations_on_datastructures']]], ['shortest_5fcommon_5fsupersequence_114',['shortest_common_supersequence',['../d3/deb/namespaceshortest__common__supersequence.html',1,'']]], ['shortest_5fcommon_5fsupersequence_2ecpp_115',['shortest_common_supersequence.cpp',['../d7/d65/shortest__common__supersequence_8cpp.html',1,'']]], ['shortest_5fpath_5fdistance_116',['Shortest_Path_Distance',['../d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6',1,'graph::bidirectional_dijkstra']]], - ['show_117',['show',['../d1/d21/quick__sort_8cpp.html#aeccefcf6fcca62c54939c5ec9a93109b',1,'sorting::quick_sort::show()'],['../d2/d26/count__inversions_8cpp.html#a851ca6a0391d14fb49a97d55e4377497',1,'sorting::inversion::show()'],['../d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07',1,'show(): merge_sort.cpp'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e',1,'data_structures::list_array::list::show()'],['../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed',1,'show(const struct tower *const F, const struct tower *const T, const struct tower *const U): tower_of_hanoi.cpp']]], + ['show_117',['show',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e',1,'data_structures::list_array::list::show()'],['../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed',1,'show(): tower_of_hanoi.cpp'],['../d2/d26/count__inversions_8cpp.html#a851ca6a0391d14fb49a97d55e4377497',1,'sorting::inversion::show()'],['../d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07',1,'show(): merge_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#aeccefcf6fcca62c54939c5ec9a93109b',1,'sorting::quick_sort::show()']]], ['show_5farray_118',['show_array',['../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859',1,'bogo_sort.cpp']]], - ['show_5fdata_119',['show_data',['../d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6',1,'show_data(T(&arr)[N]): shell_sort2.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246',1,'show_data(T *arr, size_t LEN): shell_sort2.cpp']]], + ['show_5fdata_119',['show_data',['../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246',1,'show_data(T *arr, size_t LEN): shell_sort2.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6',1,'show_data(T(&arr)[N]): shell_sort2.cpp']]], ['show_5fpascal_120',['show_pascal',['../dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c',1,'pascal_triangle.cpp']]], ['showarray_121',['showArray',['../d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10',1,'sorting::random_pivot_quick_sort']]], ['showbase_122',['showbase',['http://en.cppreference.com/w/cpp/io/manip/showbase.html',0,'std']]], - ['showmanyc_123',['showmanyc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_streambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::filebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::streambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::strstreambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_filebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wfilebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstreambuf::showmanyc()']]], + ['showmanyc_123',['showmanyc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_filebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wfilebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstreambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::strstreambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_streambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::filebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::streambuf::showmanyc()']]], ['showpoint_124',['showpoint',['http://en.cppreference.com/w/cpp/io/manip/showpoint.html',0,'std']]], ['showpos_125',['showpos',['http://en.cppreference.com/w/cpp/io/manip/showpos.html',0,'std']]], - ['shrink_5fto_5ffit_126',['shrink_to_fit',['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u16string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::basic_string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::wstring::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html',0,'std::vector::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/container/deque/shrink_to_fit.html',0,'std::deque::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u32string::shrink_to_fit()']]], + ['shrink_5fto_5ffit_126',['shrink_to_fit',['http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html',0,'std::vector::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/container/deque/shrink_to_fit.html',0,'std::deque::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::basic_string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::wstring::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u16string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u32string::shrink_to_fit()']]], ['shuffle_127',['shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std::shuffle()'],['../d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5',1,'sorting::shuffle()']]], ['shuffle_5forder_5fengine_128',['shuffle_order_engine',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std::shuffle_order_engine'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::shuffle_order_engine::shuffle_order_engine()']]], ['side_129',['side',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6',1,'graph::is_graph_bipartite::Graph']]], - ['sieve_130',['sieve',['../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f',1,'math::sieve()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a7eebd5e7686a8db363f937b2f30d3818',1,'sieve(uint32_t N): sieve_of_eratosthenes.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'Sieve(int64_t n): primes_up_to_billion.cpp']]], - ['sieve_5fof_5feratosthenes_2ecpp_131',['sieve_of_eratosthenes.cpp',['../d8/ddf/sieve__of__eratosthenes_8cpp.html',1,'']]], - ['sieveoferatosthenes_132',['SieveOfEratosthenes',['../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099',1,'prime_factorization.cpp']]], - ['sig2hex_133',['sig2hex',['../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348',1,'hashing::md5::sig2hex()'],['../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228',1,'hashing::sha1::sig2hex()']]], - ['sig_5fatomic_5ft_134',['sig_atomic_t',['http://en.cppreference.com/w/cpp/utility/program/sig_atomic_t.html',0,'std']]], - ['sigmoid_135',['sigmoid',['../d2/d58/neural__network_8cpp.html#a23aa9d32bcbcd65cfc85f0a41e2afadc',1,'machine_learning::neural_network::activations']]], - ['signal_136',['signal',['http://en.cppreference.com/w/cpp/utility/program/signal.html',0,'std']]], - ['signaling_5fnan_137',['signaling_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/signaling_NaN.html',0,'std::numeric_limits']]], - ['signbit_138',['signbit',['http://en.cppreference.com/w/cpp/numeric/math/signbit.html',0,'std']]], - ['simpson_5fmethod_139',['simpson_method',['../d3/d6d/namespacesimpson__method.html',1,'']]], - ['sin_140',['sin',['http://en.cppreference.com/w/cpp/numeric/math/sin.html',0,'std']]], - ['single_5fpredict_141',['single_predict',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f',1,'machine_learning::neural_network::NeuralNetwork']]], - ['sinh_142',['sinh',['http://en.cppreference.com/w/cpp/numeric/math/sinh.html',0,'std']]], - ['size_143',['size',['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::match_results::size()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865',1,'range_queries::perSegTree::size()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1',1,'divide_and_conquer::strassens_multiplication::Matrix::size()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39',1,'data_structures::stack_using_queue::Stack::size()'],['../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c',1,'dsu::size()'],['../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54',1,'data_structures::Bitset::size()'],['../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3',1,'binary_search_tree::size()'],['http://en.cppreference.com/w/cpp/container/array/size.html',0,'std::array::size()'],['http://en.cppreference.com/w/cpp/container/multimap/size.html',0,'std::multimap::size()'],['../dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3',1,'data_structures::SegmentTree::size'],['../d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e',1,'stack::size'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c',1,'data_structures::treap::Treap::size'],['http://en.cppreference.com/w/cpp/container/dynarray/size.html',0,'std::dynarray::size()'],['http://en.cppreference.com/w/cpp/container/vector/size.html',0,'std::vector::size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/size.html',0,'std::unordered_set::size()'],['http://en.cppreference.com/w/cpp/container/multiset/size.html',0,'std::multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::size()'],['http://en.cppreference.com/w/cpp/container/set/size.html',0,'std::set::size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/size.html',0,'std::unordered_map::size()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/size.html',0,'std::initializer_list::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wsmatch::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::smatch::size()'],['http://en.cppreference.com/w/cpp/container/stack/size.html',0,'std::stack::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/size.html',0,'std::unordered_multimap::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wcmatch::size()'],['http://en.cppreference.com/w/cpp/container/deque/size.html',0,'std::deque::size()'],['http://en.cppreference.com/w/cpp/container/queue/size.html',0,'std::queue::size()'],['http://en.cppreference.com/w/cpp/utility/bitset/size.html',0,'std::bitset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::size()'],['http://en.cppreference.com/w/cpp/container/priority_queue/size.html',0,'std::priority_queue::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/size.html',0,'std::unordered_multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::size()'],['http://en.cppreference.com/w/cpp/container/list/size.html',0,'std::list::size()'],['http://en.cppreference.com/w/cpp/container/map/size.html',0,'std::map::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::cmatch::size()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/size.html',0,'std::seed_seq::size()']]], - ['size_5f_144',['size_',['../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc',1,'binary_search_tree']]], - ['size_5ft_145',['size_t',['http://en.cppreference.com/w/cpp/types/size_t.html',0,'std']]], - ['skip_5flist_2ecpp_146',['skip_list.cpp',['../d0/d5a/skip__list_8cpp.html',1,'']]], - ['skiplist_147',['skiplist',['../d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4',1,'data_structures::SkipList::SkipList()'],['../d4/d90/classdata__structures_1_1_skip_list.html',1,'data_structures::SkipList']]], - ['skipws_148',['skipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]], - ['sleep_149',['SLEEP',['../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6',1,'memory_game.cpp']]], - ['sleep_5ffor_150',['sleep_for',['http://en.cppreference.com/w/cpp/thread/sleep_for.html',0,'std::this_thread']]], - ['sleep_5funtil_151',['sleep_until',['http://en.cppreference.com/w/cpp/thread/sleep_until.html',0,'std::this_thread']]], - ['slice_152',['slice',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17',1,'divide_and_conquer::strassens_multiplication::Matrix']]], - ['smallest_5fcircle_2ecpp_153',['smallest_circle.cpp',['../d0/d01/smallest__circle_8cpp.html',1,'']]], - ['smatch_154',['smatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::smatch'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::smatch::smatch()']]], - ['snextc_155',['snextc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_filebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_streambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wfilebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::strstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::filebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::streambuf::snextc()']]], - ['snprintf_156',['snprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], - ['solution_157',['solution',['../dd/d4f/class_solution.html',1,'Solution'],['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4',1,'machine_learning::aystar_search::AyStarSearch::Solution()']]], - ['solve_158',['solve',['../d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9',1,'backtracking::knight_tour']]], - ['solvemaze_159',['solveMaze',['../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3',1,'backtracking::rat_maze']]], - ['solvenq_160',['solveNQ',['../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb',1,'backtracking::n_queens']]], - ['solvesudoku_161',['solveSudoku',['../d3/d05/sudoku__solver_8cpp.html#ac911c8bca8556206ff64461b2424866b',1,'backtracking::sudoku_solver']]], - ['sort_162',['sort',['http://en.cppreference.com/w/cpp/algorithm/sort.html',0,'std::sort()'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180',1,'data_structures::list_array::list::sort()'],['http://en.cppreference.com/w/cpp/container/list/sort.html',0,'std::list::sort()'],['http://en.cppreference.com/w/cpp/container/forward_list/sort.html',0,'std::forward_list::sort()']]], - ['sort_5fheap_163',['sort_heap',['http://en.cppreference.com/w/cpp/algorithm/sort_heap.html',0,'std']]], - ['sortcol_164',['sortcol',['../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec',1,'fcfs_scheduling.cpp']]], - ['sorting_165',['sorting',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md67',1,'Sorting'],['../d5/d91/namespacesorting.html',1,'sorting']]], - ['sorting_20algorithm_166',['Sorting Algorithm',['../d5/d4c/group__sorting.html',1,'']]], - ['sparse_5fmatrix_2ecpp_167',['sparse_matrix.cpp',['../d3/d19/sparse__matrix_8cpp.html',1,'']]], - ['sparse_5ftable_168',['sparse_table',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html',1,'data_structures::sparse_table::Sparse_table'],['../d9/d55/namespacesparse__table.html',1,'sparse_table']]], - ['sparse_5ftable_2ecpp_169',['sparse_table.cpp',['../d4/d96/range__queries_2sparse__table_8cpp.html',1,'(Global Namespace)'],['../d6/d42/data__structures_2sparse__table_8cpp.html',1,'(Global Namespace)']]], - ['sphere_5fsurface_5farea_170',['sphere_surface_area',['../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656',1,'math']]], - ['sphere_5fvolume_171',['sphere_volume',['../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551',1,'math']]], - ['spiral_5fprint_2ecpp_172',['spiral_print.cpp',['../db/d07/spiral__print_8cpp.html',1,'']]], - ['spiralprint_173',['spiralPrint',['../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197',1,'spiral_print.cpp']]], - ['spirograph_174',['spirograph',['../da/dd3/namespacespirograph.html',1,'spirograph'],['../da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac',1,'spirograph::spirograph()']]], - ['spirograph_2ecpp_175',['spirograph.cpp',['../da/d77/spirograph_8cpp.html',1,'']]], - ['splice_176',['splice',['http://en.cppreference.com/w/cpp/container/list/splice.html',0,'std::list']]], - ['splice_5fafter_177',['splice_after',['http://en.cppreference.com/w/cpp/container/forward_list/splice_after.html',0,'std::forward_list']]], - ['splitnode_178',['SplitNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9',1,'data_structures::tree_234::Tree234']]], - ['sprintf_179',['sprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], - ['sputbackc_180',['sputbackc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wfilebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::streambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::strstreambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_streambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstreambuf::sputbackc()']]], - ['sputc_181',['sputc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wfilebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::stringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::streambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_streambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_stringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::strstreambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstreambuf::sputc(T... args)']]], - ['sputn_182',['sputn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_filebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wfilebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::strstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_streambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::filebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::streambuf::sputn()']]], - ['sqrt_183',['sqrt',['http://en.cppreference.com/w/cpp/numeric/math/sqrt.html',0,'std::sqrt()'],['../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc',1,'Sqrt(double a): sqrt_double.cpp']]], - ['sqrt_5fdouble_2ecpp_184',['sqrt_double.cpp',['../da/d24/sqrt__double_8cpp.html',1,'']]], - ['square_185',['square',['../d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153',1,'machine_learning::neural_network::util_functions']]], - ['square_5farea_186',['square_area',['../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049',1,'math']]], - ['square_5fperimeter_187',['square_perimeter',['../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14',1,'math']]], - ['srand_188',['srand',['http://en.cppreference.com/w/cpp/numeric/random/srand.html',0,'std']]], - ['sregex_5fiterator_189',['sregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::sregex_iterator::sregex_iterator()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::sregex_iterator']]], - ['sregex_5ftoken_5fiterator_190',['sregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::sregex_token_iterator::sregex_token_iterator()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::sregex_token_iterator']]], - ['sret_5finit_191',['sret_init',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5',1,'range_queries::heavy_light_decomposition::SG']]], - ['sscanf_192',['sscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]], - ['ssub_5fmatch_193',['ssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::ssub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::ssub_match::ssub_match()']]], - ['st_194',['ST',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81',1,'data_structures::sparse_table::Sparse_table']]], - ['stable_5fpartition_195',['stable_partition',['http://en.cppreference.com/w/cpp/algorithm/stable_partition.html',0,'std']]], - ['stable_5fsort_196',['stable_sort',['http://en.cppreference.com/w/cpp/algorithm/stable_sort.html',0,'std']]], - ['stack_197',['stack',['http://en.cppreference.com/w/cpp/container/stack/stack.html',0,'std::stack::stack()'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#af06360122e20ce2ba32c574a27a20ba1',1,'others::postfix_expression::Stack::stack'],['../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7',1,'stack: paranthesis_matching.cpp'],['http://en.cppreference.com/w/cpp/container/stack.html',0,'std::stack< T >'],['../d1/dc2/classstack.html',1,'stack< ValueType >'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html',1,'others::postfix_expression::Stack'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html',1,'data_structures::stack_using_queue::Stack']]], - ['stack_2ehpp_198',['stack.hpp',['../df/d47/stack_8hpp.html',1,'']]], - ['stack_5fidx_199',['stack_idx',['../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f',1,'paranthesis_matching.cpp']]], - ['stack_5flinkedlist_200',['stack_linkedList',['../d2/dc4/classstack__linked_list.html',1,'']]], - ['stack_5fusing_5fqueue_201',['stack_using_queue',['../df/d1c/namespacestack__using__queue.html',1,'']]], - ['stacktop_202',['stacktop',['../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8',1,'stack::stackTop'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#a6ae98710503b894b843d01cb69d5490c',1,'others::postfix_expression::Stack::stackTop']]], - ['stairs_5fpattern_2ecpp_203',['stairs_pattern.cpp',['../d5/def/stairs__pattern_8cpp.html',1,'']]], - ['standard_5fdeviation_204',['standard_deviation',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2',1,'probability::geometric_dist::geometric_distribution']]], - ['standard_5finvsqrt_205',['Standard_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97',1,'inv_sqrt.cpp']]], - ['standards_206',['Our Standards',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md6',1,'']]], - ['startwith_207',['startwith',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17',1,'data_structures::trie_using_hashmap::Trie']]], - ['state_208',['state',['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u32streampos::state()'],['http://en.cppreference.com/w/cpp/locale/wstring_convert/state.html',0,'std::wstring_convert::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::fpos::state()'],['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/state.html',0,'std::wbuffer_convert::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::wstreampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u16streampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::streampos::state()']]], - ['state_5ftype_209',['state_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::state_type']]], - ['static_20code_20analyzer_210',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]], - ['static_5fpointer_5fcast_211',['static_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], - ['statistics_212',['statistics',['../d2/dcf/namespacestatistics.html',1,'']]], - ['stats_5fcomputer1_213',['stats_computer1',['../d7/d7c/classstatistics_1_1stats__computer1.html',1,'statistics']]], - ['stats_5fcomputer2_214',['stats_computer2',['../d8/dab/classstatistics_1_1stats__computer2.html',1,'statistics']]], - ['std_215',['std',['../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1',1,'statistics::stats_computer1::std()'],['../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e',1,'statistics::stats_computer2::std()'],['../d8/dcc/namespacestd.html',1,'std']]], - ['std_3a_3achrono_216',['chrono',['http://en.cppreference.com/w/d4/d0c/namespacestd_1_1chrono.html',0,'std']]], - ['std_3a_3aexperimental_217',['experimental',['http://en.cppreference.com/w/de/d97/namespacestd_1_1experimental.html',0,'std']]], - ['std_3a_3aregex_5fconstants_218',['regex_constants',['http://en.cppreference.com/w/db/da4/namespacestd_1_1regex__constants.html',0,'std']]], - ['std_3a_3arel_5fops_219',['rel_ops',['http://en.cppreference.com/w/da/d42/namespacestd_1_1rel__ops.html',0,'std']]], - ['std_3a_3athis_5fthread_220',['this_thread',['http://en.cppreference.com/w/d7/dbf/namespacestd_1_1this__thread.html',0,'std']]], - ['stddev_221',['stddev',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution']]], - ['steady_5fclock_222',['steady_clock',['http://en.cppreference.com/w/cpp/chrono/steady_clock.html',0,'std::chrono']]], - ['step_5fith_223',['step_ith',['../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9',1,'sorting::radix_sort']]], - ['stod_224',['stod',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], - ['stof_225',['stof',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], - ['stoi_226',['stoi',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], - ['stol_227',['stol',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], - ['stold_228',['stold',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], - ['stoll_229',['stoll',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], - ['stooge_5fsort_2ecpp_230',['stooge_sort.cpp',['../d4/d4f/stooge__sort_8cpp.html',1,'']]], - ['stoogesort_231',['stoogeSort',['../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b',1,'stooge_sort.cpp']]], - ['store_232',['store',['http://en.cppreference.com/w/cpp/atomic/atomic/store.html',0,'std::atomic']]], - ['store_20the_20address_20of_20parent_20nodes_233',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], - ['stoul_234',['stoul',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]], - ['stoull_235',['stoull',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]], - ['str_236',['str',['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::wistringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::wostringstream::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::match_results::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::basic_ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::wstringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wsmatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::wstringstream::str()'],['http://en.cppreference.com/w/cpp/io/ostrstream/str.html',0,'std::ostrstream::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::smatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::stringstream::str()'],['http://en.cppreference.com/w/cpp/io/strstreambuf/str.html',0,'std::strstreambuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wcmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::basic_stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::str()'],['http://en.cppreference.com/w/cpp/io/strstream/str.html',0,'std::strstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::basic_stringstream::str()'],['http://en.cppreference.com/w/cpp/io/istrstream/str.html',0,'std::istrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::basic_istringstream::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::cmatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::istringstream::str()']]], - ['strand_237',['strand',['../d8/d1d/namespacestrand.html',1,'']]], - ['strand_5fsort_238',['strand_sort',['../dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd',1,'sorting::strand']]], - ['strand_5fsort_2ecpp_239',['strand_sort.cpp',['../dc/dd9/strand__sort_8cpp.html',1,'']]], - ['strassens_5fmultiplication_240',['strassens_multiplication',['../d3/d91/namespacestrassens__multiplication.html',1,'strassens_multiplication'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a',1,'divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication()']]], - ['strcat_241',['strcat',['http://en.cppreference.com/w/cpp/string/byte/strcat.html',0,'std']]], - ['strchr_242',['strchr',['http://en.cppreference.com/w/cpp/string/byte/strchr.html',0,'std']]], - ['strcmp_243',['strcmp',['http://en.cppreference.com/w/cpp/string/byte/strcmp.html',0,'std']]], - ['strcoll_244',['strcoll',['http://en.cppreference.com/w/cpp/string/byte/strcoll.html',0,'std']]], - ['strcpy_245',['strcpy',['http://en.cppreference.com/w/cpp/string/byte/strcpy.html',0,'std']]], - ['strcspn_246',['strcspn',['http://en.cppreference.com/w/cpp/string/byte/strcspn.html',0,'std']]], - ['streambuf_247',['streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::streambuf::streambuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std::streambuf']]], - ['streamoff_248',['streamoff',['http://en.cppreference.com/w/cpp/io/streamoff.html',0,'std']]], - ['streampos_249',['streampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], - ['streamsize_250',['streamsize',['http://en.cppreference.com/w/cpp/io/streamsize.html',0,'std']]], - ['strerror_251',['strerror',['http://en.cppreference.com/w/cpp/string/byte/strerror.html',0,'std']]], - ['strftime_252',['strftime',['http://en.cppreference.com/w/cpp/chrono/c/strftime.html',0,'std']]], - ['string_253',['string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::string'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::string::string()']]], - ['string_5ffibonacci_2ecpp_254',['string_fibonacci.cpp',['../de/d47/string__fibonacci_8cpp.html',1,'']]], - ['string_5fsearch_255',['string_search',['../d9/d03/namespacestring__search.html',1,'']]], - ['string_5ftype_256',['string_type',['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct::string_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages::string_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct::string_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate::string_type'],['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::string_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::string_type']]], - ['stringbuf_257',['stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std::stringbuf'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::stringbuf::stringbuf()']]], - ['strings_258',['strings',['../df/dcb/namespacestrings.html',1,'strings'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md68',1,'Strings']]], - ['stringstream_259',['stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::stringstream::stringstream()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std::stringstream']]], - ['strkey_260',['STRKEY',['../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216',1,'ciphers']]], - ['strlen_261',['strlen',['http://en.cppreference.com/w/cpp/string/byte/strlen.html',0,'std']]], - ['strncat_262',['strncat',['http://en.cppreference.com/w/cpp/string/byte/strncat.html',0,'std']]], - ['strncmp_263',['strncmp',['http://en.cppreference.com/w/cpp/string/byte/strncmp.html',0,'std']]], - ['strncpy_264',['strncpy',['http://en.cppreference.com/w/cpp/string/byte/strncpy.html',0,'std']]], - ['strpbrk_265',['strpbrk',['http://en.cppreference.com/w/cpp/string/byte/strpbrk.html',0,'std']]], - ['strrchr_266',['strrchr',['http://en.cppreference.com/w/cpp/string/byte/strrchr.html',0,'std']]], - ['strspn_267',['strspn',['http://en.cppreference.com/w/cpp/string/byte/strspn.html',0,'std']]], - ['strstr_268',['strstr',['http://en.cppreference.com/w/cpp/string/byte/strstr.html',0,'std']]], - ['strstream_269',['strstream',['http://en.cppreference.com/w/cpp/io/strstream.html',0,'std::strstream'],['http://en.cppreference.com/w/cpp/io/strstream/strstream.html',0,'std::strstream::strstream()']]], - ['strstreambuf_270',['strstreambuf',['http://en.cppreference.com/w/cpp/io/strstreambuf.html',0,'std::strstreambuf'],['http://en.cppreference.com/w/cpp/io/strstreambuf/strstreambuf.html',0,'std::strstreambuf::strstreambuf()']]], - ['strtod_271',['strtod',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], - ['strtof_272',['strtof',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], - ['strtoimax_273',['strtoimax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]], - ['strtok_274',['strtok',['http://en.cppreference.com/w/cpp/string/byte/strtok.html',0,'std']]], - ['strtol_275',['strtol',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]], - ['strtold_276',['strtold',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], - ['strtoll_277',['strtoll',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]], - ['strtoul_278',['strtoul',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]], - ['strtoull_279',['strtoull',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]], - ['strtoumax_280',['strtoumax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]], - ['structure_20of_20a_20program_281',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]], - ['structure_20used_282',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md99',1,'']]], - ['structures_283',['Data Structures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49',1,'']]], - ['struzik_5fsearch_284',['struzik_search',['../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208',1,'exponential_search.cpp']]], - ['strxfrm_285',['strxfrm',['http://en.cppreference.com/w/cpp/string/byte/strxfrm.html',0,'std']]], - ['student_5ft_5fdistribution_286',['student_t_distribution',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution.html',0,'std::student_t_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/student_t_distribution.html',0,'std::student_t_distribution::student_t_distribution()']]], - ['style_20convention_287',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]], - ['style_20conventions_288',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]], - ['sub_5fmatch_289',['sub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::sub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::sub_match::sub_match()']]], - ['subarray_5fsum_290',['subarray_sum',['../df/d74/namespacesubarray__sum.html',1,'subarray_sum'],['../df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e',1,'backtracking::subarray_sum::subarray_sum()']]], - ['subarray_5fsum_2ecpp_291',['subarray_sum.cpp',['../df/d94/subarray__sum_8cpp.html',1,'']]], - ['sublist_5fsearch_292',['sublist_search',['../d9/def/namespacesublist__search.html',1,'']]], - ['sublist_5fsearch_2ecpp_293',['sublist_search.cpp',['../d5/d45/sublist__search_8cpp.html',1,'']]], - ['sublistsearch_294',['sublistSearch',['../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c',1,'search::sublist_search']]], - ['subset_5fsum_295',['subset_sum',['../dc/d3a/namespacesubset__sum.html',1,'']]], - ['subset_5fsum_2ecpp_296',['subset_sum.cpp',['../d6/d80/dynamic__programming_2subset__sum_8cpp.html',1,'(Global Namespace)'],['../d0/dfe/backtracking_2subset__sum_8cpp.html',1,'(Global Namespace)']]], - ['subset_5fsum_5fproblem_297',['subset_sum_problem',['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50',1,'dynamic_programming::subset_sum']]], - ['subset_5fsum_5frecursion_298',['subset_sum_recursion',['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607',1,'dynamic_programming::subset_sum']]], - ['subsets_299',['Subsets',['../de/d95/namespace_subsets.html',1,'']]], - ['substr_300',['substr',['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::wstring::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u16string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::basic_string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u32string::substr()']]], - ['subtract_5fwith_5fcarry_5fengine_301',['subtract_with_carry_engine',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine::subtract_with_carry_engine()']]], - ['subtree_302',['subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'Case 2: The given node does not have a right node/subtree']]], - ['succ_303',['succ',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3',1,'data_structures::linked_list::link']]], - ['successive_5fapproximation_2ecpp_304',['successive_approximation.cpp',['../df/dc8/successive__approximation_8cpp.html',1,'']]], - ['sudoku_5fsolver_305',['sudoku_solver',['../d8/d9f/namespacesudoku__solver.html',1,'']]], - ['sudoku_5fsolver_2ecpp_306',['sudoku_solver.cpp',['../d3/d05/sudoku__solver_8cpp.html',1,'']]], - ['suffix_307',['suffix',['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wcmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::cmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wsmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::smatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::match_results::suffix()']]], - ['suggestautocomplete_308',['SuggestAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe',1,'operations_on_datastructures::trie_operations::Tnode']]], - ['suggestfreqautocomplete_309',['SuggestFreqAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c',1,'operations_on_datastructures::trie_operations::Tnode']]], - ['sum_310',['sum',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd',1,'range_queries::fenwick_tree::sum()'],['../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35',1,'machine_learning::sum()']]], - ['sum_5fof_5fbinomial_5fcoefficient_2ecpp_311',['sum_of_binomial_coefficient.cpp',['../d4/d9d/sum__of__binomial__coefficient_8cpp.html',1,'']]], - ['sum_5fof_5fdigits_312',['sum_of_digits',['../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395',1,'sum_of_digits.cpp']]], - ['sum_5fof_5fdigits_2ecpp_313',['sum_of_digits.cpp',['../d4/d83/sum__of__digits_8cpp.html',1,'']]], - ['sum_5fof_5fdivisor_314',['sum_of_divisor',['../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a',1,'math']]], - ['sum_5frange_315',['sum_range',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe',1,'range_queries::fenwick_tree']]], - ['summary_316',['summary',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931',1,'machine_learning::neural_network::NeuralNetwork']]], - ['sungetc_317',['sungetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::strstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wfilebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_stringbuf::sungetc()']]], - ['swap_318',['swap',['http://en.cppreference.com/w/cpp/experimental/optional/swap.html',0,'std::experimental::optional::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::stringbuf::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::wstring::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_filebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstringbuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ios::swap()'],['http://en.cppreference.com/w/cpp/algorithm/swap.html',0,'std::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::fstream::swap()'],['http://en.cppreference.com/w/cpp/container/vector/swap.html',0,'std::vector::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::match_results::swap()'],['http://en.cppreference.com/w/cpp/container/multiset/swap.html',0,'std::multiset::swap()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/swap.html',0,'std::weak_ptr::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostream::swap()'],['http://en.cppreference.com/w/cpp/container/set/swap.html',0,'std::set::swap()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/swap.html',0,'std::unique_lock::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostringstream::swap()'],['http://en.cppreference.com/w/cpp/container/array/swap.html',0,'std::array::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ifstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wstringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_iostream::swap()'],['http://en.cppreference.com/w/cpp/container/multimap/swap.html',0,'std::multimap::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wfstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_set/swap.html',0,'std::unordered_set::swap()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/swap.html',0,'std::packaged_task::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostrstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istringstream::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::regex::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::streambuf::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::cmatch::swap()'],['http://en.cppreference.com/w/cpp/container/map/swap.html',0,'std::map::swap()'],['http://en.cppreference.com/w/cpp/container/list/swap.html',0,'std::list::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ifstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ofstream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u32string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wiostream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u16string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::filebuf::swap()'],['http://en.cppreference.com/w/cpp/utility/functional/function/swap.html',0,'std::function::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/swap.html',0,'std::unordered_multiset::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istrstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_map/swap.html',0,'std::unordered_map::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostringstream::swap()'],['http://en.cppreference.com/w/cpp/container/priority_queue/swap.html',0,'std::priority_queue::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::basic_string::swap()'],['http://en.cppreference.com/w/cpp/thread/thread/swap.html',0,'std::thread::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_stringstream::swap()'],['http://en.cppreference.com/w/cpp/container/queue/swap.html',0,'std::queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_streambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::strstream::swap()'],['http://en.cppreference.com/w/cpp/thread/promise/swap.html',0,'std::promise::swap()'],['http://en.cppreference.com/w/cpp/container/deque/swap.html',0,'std::deque::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_stringbuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wifstream::swap()'],['http://en.cppreference.com/w/cpp/utility/pair/swap.html',0,'std::pair::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wcmatch::swap()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/swap.html',0,'std::shared_lock::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::strstreambuf::swap()'],['http://en.cppreference.com/w/cpp/container/forward_list/swap.html',0,'std::forward_list::swap()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/swap.html',0,'std::unique_ptr::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/swap.html',0,'std::unordered_multimap::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::stringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistream::swap()'],['http://en.cppreference.com/w/cpp/container/stack/swap.html',0,'std::stack::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::iostream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wfilebuf::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::smatch::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::wregex::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::basic_regex::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_fstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostringstream::swap()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/swap.html',0,'std::shared_ptr::swap()'],['http://en.cppreference.com/w/cpp/utility/tuple/swap.html',0,'std::tuple::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wsmatch::swap()']]], - ['swap_5franges_319',['swap_ranges',['http://en.cppreference.com/w/cpp/algorithm/swap_ranges.html',0,'std']]], - ['swprintf_320',['swprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], - ['swscanf_321',['swscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]], - ['sync_322',['sync',['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::strstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wfstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istrstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wiostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_ifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wstringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::ifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istream::sync()']]], - ['sync_5fwith_5fstdio_323',['sync_with_stdio',['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::strstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wfstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wiostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ios_base::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ios::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wstringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistringstream::sync_with_stdio()']]], - ['system_324',['system',['http://en.cppreference.com/w/cpp/utility/program/system.html',0,'std']]], - ['system_5fcategory_325',['system_category',['http://en.cppreference.com/w/cpp/error/system_category.html',0,'std']]], - ['system_5fclock_326',['system_clock',['http://en.cppreference.com/w/cpp/chrono/system_clock.html',0,'std::chrono']]], - ['system_5ferror_327',['system_error',['http://en.cppreference.com/w/cpp/error/system_error/system_error.html',0,'std::system_error::system_error()'],['http://en.cppreference.com/w/cpp/error/system_error.html',0,'std::system_error']]] + ['sieve_130',['Sieve',['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'primes_up_to_billion.cpp']]], + ['sieve_131',['sieve',['../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f',1,'math::sieve()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a7eebd5e7686a8db363f937b2f30d3818',1,'sieve(uint32_t N): sieve_of_eratosthenes.cpp']]], + ['sieve_5fof_5feratosthenes_2ecpp_132',['sieve_of_eratosthenes.cpp',['../d8/ddf/sieve__of__eratosthenes_8cpp.html',1,'']]], + ['sieveoferatosthenes_133',['SieveOfEratosthenes',['../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099',1,'prime_factorization.cpp']]], + ['sig2hex_134',['sig2hex',['../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348',1,'hashing::md5::sig2hex()'],['../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228',1,'hashing::sha1::sig2hex()']]], + ['sig_5fatomic_5ft_135',['sig_atomic_t',['http://en.cppreference.com/w/cpp/utility/program/sig_atomic_t.html',0,'std']]], + ['sigmoid_136',['sigmoid',['../d2/d58/neural__network_8cpp.html#a23aa9d32bcbcd65cfc85f0a41e2afadc',1,'machine_learning::neural_network::activations']]], + ['signal_137',['signal',['http://en.cppreference.com/w/cpp/utility/program/signal.html',0,'std']]], + ['signaling_5fnan_138',['signaling_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/signaling_NaN.html',0,'std::numeric_limits']]], + ['signbit_139',['signbit',['http://en.cppreference.com/w/cpp/numeric/math/signbit.html',0,'std']]], + ['simpson_5fmethod_140',['simpson_method',['../d3/d6d/namespacesimpson__method.html',1,'']]], + ['sin_141',['sin',['http://en.cppreference.com/w/cpp/numeric/math/sin.html',0,'std']]], + ['single_5fpredict_142',['single_predict',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f',1,'machine_learning::neural_network::NeuralNetwork']]], + ['sinh_143',['sinh',['http://en.cppreference.com/w/cpp/numeric/math/sinh.html',0,'std']]], + ['size_144',['size',['../dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3',1,'data_structures::SegmentTree::size'],['../d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e',1,'stack::size'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c',1,'data_structures::treap::Treap::size'],['http://en.cppreference.com/w/cpp/container/dynarray/size.html',0,'std::dynarray::size()'],['http://en.cppreference.com/w/cpp/container/vector/size.html',0,'std::vector::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::match_results::size()'],['http://en.cppreference.com/w/cpp/container/multiset/size.html',0,'std::multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::size()'],['http://en.cppreference.com/w/cpp/container/set/size.html',0,'std::set::size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/size.html',0,'std::unordered_map::size()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/size.html',0,'std::initializer_list::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wsmatch::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::smatch::size()'],['http://en.cppreference.com/w/cpp/container/stack/size.html',0,'std::stack::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/size.html',0,'std::unordered_multimap::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wcmatch::size()'],['http://en.cppreference.com/w/cpp/container/deque/size.html',0,'std::deque::size()'],['http://en.cppreference.com/w/cpp/container/queue/size.html',0,'std::queue::size()'],['http://en.cppreference.com/w/cpp/utility/bitset/size.html',0,'std::bitset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::size()'],['http://en.cppreference.com/w/cpp/container/priority_queue/size.html',0,'std::priority_queue::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/size.html',0,'std::unordered_multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::size()'],['http://en.cppreference.com/w/cpp/container/list/size.html',0,'std::list::size()'],['http://en.cppreference.com/w/cpp/container/map/size.html',0,'std::map::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::cmatch::size()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/size.html',0,'std::seed_seq::size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/size.html',0,'std::unordered_set::size()'],['http://en.cppreference.com/w/cpp/container/multimap/size.html',0,'std::multimap::size()'],['http://en.cppreference.com/w/cpp/container/array/size.html',0,'std::array::size()'],['../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3',1,'binary_search_tree::size()'],['../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54',1,'data_structures::Bitset::size()'],['../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c',1,'dsu::size()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39',1,'data_structures::stack_using_queue::Stack::size()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1',1,'divide_and_conquer::strassens_multiplication::Matrix::size()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865',1,'range_queries::perSegTree::size()']]], + ['size_5f_145',['size_',['../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc',1,'binary_search_tree']]], + ['size_5ft_146',['size_t',['http://en.cppreference.com/w/cpp/types/size_t.html',0,'std']]], + ['skip_5flist_2ecpp_147',['skip_list.cpp',['../d0/d5a/skip__list_8cpp.html',1,'']]], + ['skiplist_148',['SkipList',['../d4/d90/classdata__structures_1_1_skip_list.html',1,'data_structures::SkipList'],['../d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4',1,'data_structures::SkipList::SkipList()']]], + ['skipws_149',['skipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]], + ['sleep_150',['SLEEP',['../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6',1,'memory_game.cpp']]], + ['sleep_5ffor_151',['sleep_for',['http://en.cppreference.com/w/cpp/thread/sleep_for.html',0,'std::this_thread']]], + ['sleep_5funtil_152',['sleep_until',['http://en.cppreference.com/w/cpp/thread/sleep_until.html',0,'std::this_thread']]], + ['slice_153',['slice',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17',1,'divide_and_conquer::strassens_multiplication::Matrix']]], + ['smallest_5fcircle_2ecpp_154',['smallest_circle.cpp',['../d0/d01/smallest__circle_8cpp.html',1,'']]], + ['smatch_155',['smatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::smatch'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::smatch::smatch()']]], + ['snextc_156',['snextc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_filebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wfilebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::strstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_streambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::filebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::streambuf::snextc()']]], + ['snprintf_157',['snprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['solution_158',['Solution',['../dd/d4f/class_solution.html',1,'Solution'],['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4',1,'machine_learning::aystar_search::AyStarSearch::Solution()']]], + ['solve_159',['solve',['../d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9',1,'backtracking::knight_tour']]], + ['solvemaze_160',['solveMaze',['../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3',1,'backtracking::rat_maze']]], + ['solvenq_161',['solveNQ',['../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb',1,'backtracking::n_queens']]], + ['solvesudoku_162',['solveSudoku',['../d3/d05/sudoku__solver_8cpp.html#ac911c8bca8556206ff64461b2424866b',1,'backtracking::sudoku_solver']]], + ['sort_163',['sort',['http://en.cppreference.com/w/cpp/container/forward_list/sort.html',0,'std::forward_list::sort()'],['http://en.cppreference.com/w/cpp/container/list/sort.html',0,'std::list::sort()'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180',1,'data_structures::list_array::list::sort()'],['http://en.cppreference.com/w/cpp/algorithm/sort.html',0,'std::sort(T... args)']]], + ['sort_5fheap_164',['sort_heap',['http://en.cppreference.com/w/cpp/algorithm/sort_heap.html',0,'std']]], + ['sortcol_165',['sortcol',['../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec',1,'fcfs_scheduling.cpp']]], + ['sorting_166',['sorting',['../d5/d91/namespacesorting.html',1,'']]], + ['sorting_167',['Sorting',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md67',1,'']]], + ['sorting_20algorithm_168',['Sorting Algorithm',['../d5/d4c/group__sorting.html',1,'']]], + ['sparse_5fmatrix_2ecpp_169',['sparse_matrix.cpp',['../d3/d19/sparse__matrix_8cpp.html',1,'']]], + ['sparse_5ftable_170',['Sparse_table',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html',1,'data_structures::sparse_table']]], + ['sparse_5ftable_171',['sparse_table',['../d9/d55/namespacesparse__table.html',1,'']]], + ['sparse_5ftable_2ecpp_172',['sparse_table.cpp',['../d6/d42/data__structures_2sparse__table_8cpp.html',1,'(Global Namespace)'],['../d4/d96/range__queries_2sparse__table_8cpp.html',1,'(Global Namespace)']]], + ['sphere_5fsurface_5farea_173',['sphere_surface_area',['../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656',1,'math']]], + ['sphere_5fvolume_174',['sphere_volume',['../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551',1,'math']]], + ['spiral_5fprint_2ecpp_175',['spiral_print.cpp',['../db/d07/spiral__print_8cpp.html',1,'']]], + ['spiralprint_176',['spiralPrint',['../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197',1,'spiral_print.cpp']]], + ['spirograph_177',['spirograph',['../da/dd3/namespacespirograph.html',1,'spirograph'],['../da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac',1,'spirograph::spirograph()']]], + ['spirograph_2ecpp_178',['spirograph.cpp',['../da/d77/spirograph_8cpp.html',1,'']]], + ['splice_179',['splice',['http://en.cppreference.com/w/cpp/container/list/splice.html',0,'std::list']]], + ['splice_5fafter_180',['splice_after',['http://en.cppreference.com/w/cpp/container/forward_list/splice_after.html',0,'std::forward_list']]], + ['splitnode_181',['SplitNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9',1,'data_structures::tree_234::Tree234']]], + ['sprintf_182',['sprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['sputbackc_183',['sputbackc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wfilebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstreambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::strstreambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_streambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::streambuf::sputbackc()']]], + ['sputc_184',['sputc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::stringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wfilebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstreambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::strstreambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_stringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_streambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::streambuf::sputc()']]], + ['sputn_185',['sputn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_filebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wfilebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::strstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_streambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::filebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::streambuf::sputn()']]], + ['sqrt_186',['sqrt',['http://en.cppreference.com/w/cpp/numeric/math/sqrt.html',0,'std']]], + ['sqrt_187',['Sqrt',['../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc',1,'sqrt_double.cpp']]], + ['sqrt_5fdouble_2ecpp_188',['sqrt_double.cpp',['../da/d24/sqrt__double_8cpp.html',1,'']]], + ['square_189',['square',['../d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153',1,'machine_learning::neural_network::util_functions']]], + ['square_5farea_190',['square_area',['../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049',1,'math']]], + ['square_5fperimeter_191',['square_perimeter',['../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14',1,'math']]], + ['srand_192',['srand',['http://en.cppreference.com/w/cpp/numeric/random/srand.html',0,'std']]], + ['sregex_5fiterator_193',['sregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::sregex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::sregex_iterator::sregex_iterator()']]], + ['sregex_5ftoken_5fiterator_194',['sregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::sregex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::sregex_token_iterator::sregex_token_iterator()']]], + ['sret_5finit_195',['sret_init',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5',1,'range_queries::heavy_light_decomposition::SG']]], + ['sscanf_196',['sscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]], + ['ssub_5fmatch_197',['ssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::ssub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::ssub_match::ssub_match()']]], + ['st_198',['ST',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81',1,'data_structures::sparse_table::Sparse_table']]], + ['stable_5fpartition_199',['stable_partition',['http://en.cppreference.com/w/cpp/algorithm/stable_partition.html',0,'std']]], + ['stable_5fsort_200',['stable_sort',['http://en.cppreference.com/w/cpp/algorithm/stable_sort.html',0,'std']]], + ['stack_201',['Stack',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html',1,'data_structures::stack_using_queue::Stack'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html',1,'others::postfix_expression::Stack']]], + ['stack_202',['stack',['../d1/dc2/classstack.html',1,'stack< ValueType >'],['http://en.cppreference.com/w/cpp/container/stack.html',0,'std::stack< T >'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#af06360122e20ce2ba32c574a27a20ba1',1,'others::postfix_expression::Stack::stack'],['http://en.cppreference.com/w/cpp/container/stack/stack.html',0,'std::stack::stack()'],['../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7',1,'stack: paranthesis_matching.cpp']]], + ['stack_2ehpp_203',['stack.hpp',['../df/d47/stack_8hpp.html',1,'']]], + ['stack_5fidx_204',['stack_idx',['../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f',1,'paranthesis_matching.cpp']]], + ['stack_5flinkedlist_205',['stack_linkedList',['../d2/dc4/classstack__linked_list.html',1,'']]], + ['stack_5fusing_5fqueue_206',['stack_using_queue',['../df/d1c/namespacestack__using__queue.html',1,'']]], + ['stacktop_207',['stackTop',['../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8',1,'stack::stackTop'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#a6ae98710503b894b843d01cb69d5490c',1,'others::postfix_expression::Stack::stackTop']]], + ['stairs_5fpattern_2ecpp_208',['stairs_pattern.cpp',['../d5/def/stairs__pattern_8cpp.html',1,'']]], + ['standard_5fdeviation_209',['standard_deviation',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2',1,'probability::geometric_dist::geometric_distribution']]], + ['standard_5finvsqrt_210',['Standard_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97',1,'inv_sqrt.cpp']]], + ['standards_211',['Our Standards',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md6',1,'']]], + ['startwith_212',['startwith',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17',1,'data_structures::trie_using_hashmap::Trie']]], + ['state_213',['state',['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/state.html',0,'std::wbuffer_convert::state()'],['http://en.cppreference.com/w/cpp/locale/wstring_convert/state.html',0,'std::wstring_convert::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::wstreampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u16streampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::streampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::fpos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u32streampos::state()']]], + ['state_5ftype_214',['state_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::state_type']]], + ['static_20code_20analyzer_215',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]], + ['static_5fpointer_5fcast_216',['static_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], + ['statistics_217',['statistics',['../d2/dcf/namespacestatistics.html',1,'']]], + ['stats_5fcomputer1_218',['stats_computer1',['../d7/d7c/classstatistics_1_1stats__computer1.html',1,'statistics']]], + ['stats_5fcomputer2_219',['stats_computer2',['../d8/dab/classstatistics_1_1stats__computer2.html',1,'statistics']]], + ['std_220',['std',['../d8/dcc/namespacestd.html',1,'std'],['../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1',1,'statistics::stats_computer1::std()'],['../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e',1,'statistics::stats_computer2::std()']]], + ['std_3a_3achrono_221',['chrono',['http://en.cppreference.com/w/d4/d0c/namespacestd_1_1chrono.html',0,'std']]], + ['std_3a_3aexperimental_222',['experimental',['http://en.cppreference.com/w/de/d97/namespacestd_1_1experimental.html',0,'std']]], + ['std_3a_3aregex_5fconstants_223',['regex_constants',['http://en.cppreference.com/w/db/da4/namespacestd_1_1regex__constants.html',0,'std']]], + ['std_3a_3arel_5fops_224',['rel_ops',['http://en.cppreference.com/w/da/d42/namespacestd_1_1rel__ops.html',0,'std']]], + ['std_3a_3athis_5fthread_225',['this_thread',['http://en.cppreference.com/w/d7/dbf/namespacestd_1_1this__thread.html',0,'std']]], + ['stddev_226',['stddev',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution']]], + ['steady_5fclock_227',['steady_clock',['http://en.cppreference.com/w/cpp/chrono/steady_clock.html',0,'std::chrono']]], + ['step_5fith_228',['step_ith',['../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9',1,'sorting::radix_sort']]], + ['stod_229',['stod',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], + ['stof_230',['stof',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], + ['stoi_231',['stoi',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], + ['stol_232',['stol',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], + ['stold_233',['stold',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], + ['stoll_234',['stoll',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], + ['stooge_5fsort_2ecpp_235',['stooge_sort.cpp',['../d4/d4f/stooge__sort_8cpp.html',1,'']]], + ['stoogesort_236',['stoogeSort',['../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b',1,'stooge_sort.cpp']]], + ['store_237',['store',['http://en.cppreference.com/w/cpp/atomic/atomic/store.html',0,'std::atomic']]], + ['store_20the_20address_20of_20parent_20nodes_238',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], + ['stoul_239',['stoul',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]], + ['stoull_240',['stoull',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]], + ['str_241',['str',['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::match_results::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::basic_ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::wstringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wsmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::smatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::stringstream::str()'],['http://en.cppreference.com/w/cpp/io/strstreambuf/str.html',0,'std::strstreambuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wcmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::basic_stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::str()'],['http://en.cppreference.com/w/cpp/io/strstream/str.html',0,'std::strstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::basic_stringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::wostringstream::str()'],['http://en.cppreference.com/w/cpp/io/istrstream/str.html',0,'std::istrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::basic_istringstream::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::cmatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::istringstream::str()'],['http://en.cppreference.com/w/cpp/io/ostrstream/str.html',0,'std::ostrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::wstringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::wistringstream::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::str()']]], + ['strand_242',['strand',['../d8/d1d/namespacestrand.html',1,'']]], + ['strand_5fsort_243',['strand_sort',['../dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd',1,'sorting::strand']]], + ['strand_5fsort_2ecpp_244',['strand_sort.cpp',['../dc/dd9/strand__sort_8cpp.html',1,'']]], + ['strassens_5fmultiplication_245',['strassens_multiplication',['../d3/d91/namespacestrassens__multiplication.html',1,'strassens_multiplication'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a',1,'divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication()']]], + ['strcat_246',['strcat',['http://en.cppreference.com/w/cpp/string/byte/strcat.html',0,'std']]], + ['strchr_247',['strchr',['http://en.cppreference.com/w/cpp/string/byte/strchr.html',0,'std']]], + ['strcmp_248',['strcmp',['http://en.cppreference.com/w/cpp/string/byte/strcmp.html',0,'std']]], + ['strcoll_249',['strcoll',['http://en.cppreference.com/w/cpp/string/byte/strcoll.html',0,'std']]], + ['strcpy_250',['strcpy',['http://en.cppreference.com/w/cpp/string/byte/strcpy.html',0,'std']]], + ['strcspn_251',['strcspn',['http://en.cppreference.com/w/cpp/string/byte/strcspn.html',0,'std']]], + ['streambuf_252',['streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std::streambuf'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::streambuf::streambuf()']]], + ['streamoff_253',['streamoff',['http://en.cppreference.com/w/cpp/io/streamoff.html',0,'std']]], + ['streampos_254',['streampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], + ['streamsize_255',['streamsize',['http://en.cppreference.com/w/cpp/io/streamsize.html',0,'std']]], + ['strerror_256',['strerror',['http://en.cppreference.com/w/cpp/string/byte/strerror.html',0,'std']]], + ['strftime_257',['strftime',['http://en.cppreference.com/w/cpp/chrono/c/strftime.html',0,'std']]], + ['string_258',['string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::string'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::string::string()']]], + ['string_5ffibonacci_2ecpp_259',['string_fibonacci.cpp',['../de/d47/string__fibonacci_8cpp.html',1,'']]], + ['string_5fsearch_260',['string_search',['../d9/d03/namespacestring__search.html',1,'']]], + ['string_5ftype_261',['string_type',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate::string_type'],['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages::string_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::string_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::string_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct::string_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct::string_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct_byname::string_type']]], + ['stringbuf_262',['stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std::stringbuf'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::stringbuf::stringbuf()']]], + ['strings_263',['strings',['../df/dcb/namespacestrings.html',1,'']]], + ['strings_264',['Strings',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md68',1,'']]], + ['stringstream_265',['stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std::stringstream'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::stringstream::stringstream()']]], + ['strkey_266',['STRKEY',['../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216',1,'ciphers']]], + ['strlen_267',['strlen',['http://en.cppreference.com/w/cpp/string/byte/strlen.html',0,'std']]], + ['strncat_268',['strncat',['http://en.cppreference.com/w/cpp/string/byte/strncat.html',0,'std']]], + ['strncmp_269',['strncmp',['http://en.cppreference.com/w/cpp/string/byte/strncmp.html',0,'std']]], + ['strncpy_270',['strncpy',['http://en.cppreference.com/w/cpp/string/byte/strncpy.html',0,'std']]], + ['strpbrk_271',['strpbrk',['http://en.cppreference.com/w/cpp/string/byte/strpbrk.html',0,'std']]], + ['strrchr_272',['strrchr',['http://en.cppreference.com/w/cpp/string/byte/strrchr.html',0,'std']]], + ['strspn_273',['strspn',['http://en.cppreference.com/w/cpp/string/byte/strspn.html',0,'std']]], + ['strstr_274',['strstr',['http://en.cppreference.com/w/cpp/string/byte/strstr.html',0,'std']]], + ['strstream_275',['strstream',['http://en.cppreference.com/w/cpp/io/strstream.html',0,'std::strstream'],['http://en.cppreference.com/w/cpp/io/strstream/strstream.html',0,'std::strstream::strstream()']]], + ['strstreambuf_276',['strstreambuf',['http://en.cppreference.com/w/cpp/io/strstreambuf.html',0,'std::strstreambuf'],['http://en.cppreference.com/w/cpp/io/strstreambuf/strstreambuf.html',0,'std::strstreambuf::strstreambuf()']]], + ['strtod_277',['strtod',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], + ['strtof_278',['strtof',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], + ['strtoimax_279',['strtoimax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]], + ['strtok_280',['strtok',['http://en.cppreference.com/w/cpp/string/byte/strtok.html',0,'std']]], + ['strtol_281',['strtol',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]], + ['strtold_282',['strtold',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], + ['strtoll_283',['strtoll',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]], + ['strtoul_284',['strtoul',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]], + ['strtoull_285',['strtoull',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]], + ['strtoumax_286',['strtoumax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]], + ['structure_20of_20a_20program_287',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]], + ['structure_20used_288',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md99',1,'']]], + ['structures_289',['Data Structures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49',1,'']]], + ['struzik_5fsearch_290',['struzik_search',['../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208',1,'exponential_search.cpp']]], + ['strxfrm_291',['strxfrm',['http://en.cppreference.com/w/cpp/string/byte/strxfrm.html',0,'std']]], + ['student_5ft_5fdistribution_292',['student_t_distribution',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution.html',0,'std::student_t_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/student_t_distribution.html',0,'std::student_t_distribution::student_t_distribution()']]], + ['style_20convention_293',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]], + ['style_20conventions_294',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]], + ['sub_5fmatch_295',['sub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::sub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::sub_match::sub_match()']]], + ['subarray_5fsum_296',['subarray_sum',['../df/d74/namespacesubarray__sum.html',1,'subarray_sum'],['../df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e',1,'backtracking::subarray_sum::subarray_sum()']]], + ['subarray_5fsum_2ecpp_297',['subarray_sum.cpp',['../df/d94/subarray__sum_8cpp.html',1,'']]], + ['sublist_5fsearch_298',['sublist_search',['../d9/def/namespacesublist__search.html',1,'']]], + ['sublist_5fsearch_2ecpp_299',['sublist_search.cpp',['../d5/d45/sublist__search_8cpp.html',1,'']]], + ['sublistsearch_300',['sublistSearch',['../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c',1,'search::sublist_search']]], + ['subset_5fsum_301',['subset_sum',['../dc/d3a/namespacesubset__sum.html',1,'']]], + ['subset_5fsum_2ecpp_302',['subset_sum.cpp',['../d0/dfe/backtracking_2subset__sum_8cpp.html',1,'(Global Namespace)'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html',1,'(Global Namespace)']]], + ['subset_5fsum_5fproblem_303',['subset_sum_problem',['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50',1,'dynamic_programming::subset_sum']]], + ['subset_5fsum_5frecursion_304',['subset_sum_recursion',['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607',1,'dynamic_programming::subset_sum']]], + ['subsets_305',['Subsets',['../de/d95/namespace_subsets.html',1,'']]], + ['substr_306',['substr',['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::basic_string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::wstring::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u16string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u32string::substr()']]], + ['subtract_5fwith_5fcarry_5fengine_307',['subtract_with_carry_engine',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine::subtract_with_carry_engine()']]], + ['subtree_308',['Subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'Case 2: The given node does not have a right node/subtree']]], + ['succ_309',['succ',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3',1,'data_structures::linked_list::link']]], + ['successive_5fapproximation_2ecpp_310',['successive_approximation.cpp',['../df/dc8/successive__approximation_8cpp.html',1,'']]], + ['sudoku_5fsolver_311',['sudoku_solver',['../d8/d9f/namespacesudoku__solver.html',1,'']]], + ['sudoku_5fsolver_2ecpp_312',['sudoku_solver.cpp',['../d3/d05/sudoku__solver_8cpp.html',1,'']]], + ['suffix_313',['suffix',['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::match_results::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wsmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::smatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wcmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::cmatch::suffix()']]], + ['suggestautocomplete_314',['SuggestAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe',1,'operations_on_datastructures::trie_operations::Tnode']]], + ['suggestfreqautocomplete_315',['SuggestFreqAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c',1,'operations_on_datastructures::trie_operations::Tnode']]], + ['sum_316',['sum',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd',1,'range_queries::fenwick_tree::sum()'],['../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35',1,'machine_learning::sum()']]], + ['sum_5fof_5fbinomial_5fcoefficient_2ecpp_317',['sum_of_binomial_coefficient.cpp',['../d4/d9d/sum__of__binomial__coefficient_8cpp.html',1,'']]], + ['sum_5fof_5fdigits_318',['sum_of_digits',['../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395',1,'sum_of_digits.cpp']]], + ['sum_5fof_5fdigits_2ecpp_319',['sum_of_digits.cpp',['../d4/d83/sum__of__digits_8cpp.html',1,'']]], + ['sum_5fof_5fdivisor_320',['sum_of_divisor',['../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a',1,'math']]], + ['sum_5frange_321',['sum_range',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe',1,'range_queries::fenwick_tree']]], + ['summary_322',['summary',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931',1,'machine_learning::neural_network::NeuralNetwork']]], + ['sungetc_323',['sungetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wfilebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::strstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::streambuf::sungetc()']]], + ['swap_324',['swap',['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::fstream::swap()'],['http://en.cppreference.com/w/cpp/container/vector/swap.html',0,'std::vector::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::match_results::swap()'],['http://en.cppreference.com/w/cpp/container/multiset/swap.html',0,'std::multiset::swap()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/swap.html',0,'std::weak_ptr::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostream::swap()'],['http://en.cppreference.com/w/cpp/container/set/swap.html',0,'std::set::swap()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/swap.html',0,'std::unique_lock::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostringstream::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::regex::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_map/swap.html',0,'std::unordered_map::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::basic_regex::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_filebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstringbuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ios::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wsmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/tuple/swap.html',0,'std::tuple::swap()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/swap.html',0,'std::shared_ptr::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_fstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::stringbuf::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::wregex::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::smatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wfilebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::iostream::swap()'],['http://en.cppreference.com/w/cpp/container/stack/swap.html',0,'std::stack::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::stringstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/swap.html',0,'std::unordered_multimap::swap()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/swap.html',0,'std::unique_ptr::swap()'],['http://en.cppreference.com/w/cpp/container/forward_list/swap.html',0,'std::forward_list::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::strstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostream::swap()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/swap.html',0,'std::shared_lock::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wcmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/pair/swap.html',0,'std::pair::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wifstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_stringbuf::swap()'],['http://en.cppreference.com/w/cpp/container/deque/swap.html',0,'std::deque::swap()'],['http://en.cppreference.com/w/cpp/thread/promise/swap.html',0,'std::promise::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::strstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_streambuf::swap()'],['http://en.cppreference.com/w/cpp/container/queue/swap.html',0,'std::queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_stringstream::swap()'],['http://en.cppreference.com/w/cpp/thread/thread/swap.html',0,'std::thread::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::basic_string::swap()'],['http://en.cppreference.com/w/cpp/container/priority_queue/swap.html',0,'std::priority_queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostringstream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::wstring::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istrstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/swap.html',0,'std::unordered_multiset::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostream::swap()'],['http://en.cppreference.com/w/cpp/utility/functional/function/swap.html',0,'std::function::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::filebuf::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u16string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wiostream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u32string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/list/swap.html',0,'std::list::swap()'],['http://en.cppreference.com/w/cpp/container/map/swap.html',0,'std::map::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::cmatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::streambuf::swap()'],['http://en.cppreference.com/w/cpp/experimental/optional/swap.html',0,'std::experimental::optional::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostrstream::swap()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/swap.html',0,'std::packaged_task::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_set/swap.html',0,'std::unordered_set::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wfstream::swap()'],['http://en.cppreference.com/w/cpp/container/multimap/swap.html',0,'std::multimap::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_iostream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wstringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/array/swap.html',0,'std::array::swap()'],['http://en.cppreference.com/w/cpp/algorithm/swap.html',0,'std::swap(T... args)']]], + ['swap_5franges_325',['swap_ranges',['http://en.cppreference.com/w/cpp/algorithm/swap_ranges.html',0,'std']]], + ['swprintf_326',['swprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], + ['swscanf_327',['swscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]], + ['sync_328',['sync',['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::strstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istrstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wiostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_ifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wfstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wstringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::ifstream::sync()']]], + ['sync_5fwith_5fstdio_329',['sync_with_stdio',['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ios::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ios_base::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::strstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wiostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wfstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wstringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ifstream::sync_with_stdio()']]], + ['system_330',['system',['http://en.cppreference.com/w/cpp/utility/program/system.html',0,'std']]], + ['system_5fcategory_331',['system_category',['http://en.cppreference.com/w/cpp/error/system_category.html',0,'std']]], + ['system_5fclock_332',['system_clock',['http://en.cppreference.com/w/cpp/chrono/system_clock.html',0,'std::chrono']]], + ['system_5ferror_333',['system_error',['http://en.cppreference.com/w/cpp/error/system_error.html',0,'std::system_error'],['http://en.cppreference.com/w/cpp/error/system_error/system_error.html',0,'std::system_error::system_error()']]] ]; diff --git a/search/all_19.js b/search/all_19.js index 7e350b62c..280add992 100644 --- a/search/all_19.js +++ b/search/all_19.js @@ -13,165 +13,168 @@ var searchData= ['tanh_10',['tanh',['http://en.cppreference.com/w/cpp/numeric/math/tanh.html',0,'std::tanh()'],['../d2/d58/neural__network_8cpp.html#a371aa7dd5d5add0143d1756bb0a1b32f',1,'machine_learning::neural_network::activations::tanh()']]], ['target_11',['target',['http://en.cppreference.com/w/cpp/utility/functional/function/target.html',0,'std::function']]], ['target_5ftype_12',['target_type',['http://en.cppreference.com/w/cpp/utility/functional/function/target_type.html',0,'std::function']]], - ['tellg_13',['tellg',['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istrstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wstringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::strstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wiostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::ifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_ifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wfstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istringstream::tellg()']]], - ['tellp_14',['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::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::wostringstream::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::basic_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::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()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::strstream::tellp()']]], + ['tellg_13',['tellg',['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::strstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istrstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wiostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_ifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wfstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wstringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::ifstream::tellg()']]], + ['tellp_14',['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()']]], ['temporary_20ban_15',['3. Temporary Ban',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md13',1,'']]], ['tera_16',['tera',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], ['terminate_17',['terminate',['http://en.cppreference.com/w/cpp/error/terminate.html',0,'std']]], ['terminate_5fhandler_18',['terminate_handler',['http://en.cppreference.com/w/cpp/error/terminate_handler.html',0,'std']]], ['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',['../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): connected_components_with_dsu.cpp'],['../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): vector_cross_product.cpp'],['../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): z_function.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): manacher_algorithm.cpp'],['../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): horspool.cpp'],['../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test(): wiggle_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wave_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): strand_sort.cpp'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29',1,'Test'],['../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): selection_sort_recursive.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): recursive_bubble_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): random_pivot_quick_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): pancake_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): merge_insertion_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): heap_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gnome_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): dnf_sort.cpp'],['../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cycle_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_inversions.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): bogo_sort.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): binary_insertion_sort.cpp'],['../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): text_search.cpp'],['../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sublist_search.cpp'],['../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): saddleback_search.cpp'],['../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): median_search2.cpp'],['../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): median_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): floyd_cycle_detection_algo.cpp'],['../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segtree.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): prefix_sum_array.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): persistent_seg_tree_lazy_prop.cpp'],['../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601',1,'test(const std::vector< int > &vals, int windowSize): windowed_median.cpp'],['../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): geometric_dist.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): ground_to_ground_projectile_motion.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): smallest_circle.cpp'],['../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kadanes3.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): union_of_two_arrays.cpp'],['../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_multiple_search.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_binary_tree.cpp'],['http://en.cppreference.com/w/cpp/utility/bitset/test.html',0,'std::bitset::test()'],['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): intersection_of_two_arrays.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inorder_successor_of_bst.cpp'],['../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): circular_linked_list.cpp'],['../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_right_rotation.cpp'],['../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_left_rotation.cpp'],['../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rungekutta.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'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inverse_fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gram_schmidt.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fast_fourier_transform.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'],['../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): babylonian_method.cpp'],['../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): volume.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): sum_of_digits.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sum_of_binomial_coefficient.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): quadratic_equations_complex_numbers.cpp'],['../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_two.cpp'],['../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): perimeter.cpp'],['../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_choose_r.cpp'],['../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_bonacci.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_inverse_simple.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_exponentiation.cpp'],['../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_division.cpp'],['../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lcm_sum.cpp'],['../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): largest_power.cpp'],['../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): iterative_factorial.cpp'],['../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inv_sqrt.cpp'],['../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): integral_approximation2.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci_sum.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): fibonacci_matrix_exponentiation.cpp'],['../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci.cpp'],['../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eulers_totient_function.cpp'],['../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eratosthenes.cpp'],['../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981',1,'test(uint64_t n, uint64_t expected): double_factorial.cpp'],['../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): area.cpp'],['../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): aliquot_sum.cpp'],['../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): neural_network.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): k_nearest_neighbors.cpp'],['../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sha1.cpp'],['../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): md5.cpp'],['../df/d64/jumpgame_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jumpgame.cpp'],['../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99',1,'spirograph::test()'],['../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): is_graph_bipartite.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jarvis_algorithm.cpp'],['../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): word_break.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): shortest_common_supersequence.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): palindrome_partitioning.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): minimum_edit_distance.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): maximum_circular_subarray.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_palindromic_subsequence.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_increasing_subsequence.cpp'],['../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): house_robber.cpp'],['../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cut_rod.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): coin_change_topdown.cpp'],['../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): abbreviation.cpp'],['../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): 0_1_knapsack.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_using_hashmap.cpp'],['../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_tree.cpp'],['../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): treap.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sparse_table.cpp'],['../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segment_tree.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_a_linked_list.cpp'],['../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): list_array.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fcfs_scheduling.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): xor_cipher.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): vigenere_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): morse_code.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): elliptic_curve_key_exchange.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): caesar_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): atbash_cipher.cpp'],['../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): a1z26_cipher.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): travelling_salesman_using_bit_manipulation.cpp'],['../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): set_kth_bit.cpp'],['../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_2.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'],['../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): hamming_distance.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): find_non_repeating_number.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_bits_flip.cpp'],['../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wildcard_matching.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subarray_sum.cpp'],['../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rat_maze.cpp'],['../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): generate_parentheses.cpp']]], - ['test_20examples_22',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]], - ['test1_23',['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_24',['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_25',['test3',['../d8/d90/iterative__tree__traversals_8cpp.html#a425c4c8520991999ee6dbe13d99b87f4',1,'test3(): iterative_tree_traversals.cpp'],['../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76',1,'tests::test3()'],['../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): golden_search_extrema.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): brent_method_extrema.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_trace.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_topology.cpp'],['../d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9',1,'test3(double eta=0.01): adaline_learning.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299',1,'test3(): hamiltons_cycle.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']]], - ['test4_26',['test4',['../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d',1,'tests::test4()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2',1,'test4(): iterative_tree_traversals.cpp']]], - ['test5_27',['test5',['../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86',1,'tests::test5()'],['../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8',1,'test5(): iterative_tree_traversals.cpp']]], - ['test6_28',['test6',['../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2',1,'tests::test6()'],['../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89',1,'test6(): iterative_tree_traversals.cpp']]], - ['test_5f1_29',['test_1',['../d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4',1,'lru_tests::test_1()'],['../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1(): heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1(): pigeonhole_sort.cpp']]], - ['test_5f2_30',['test_2',['../d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec',1,'lru_tests::test_2()'],['../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2(): heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2(): pigeonhole_sort.cpp']]], - ['test_5f2d_5fclasses_31',['test_2d_classes',['../d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9',1,'kohonen_som_topology.cpp']]], - ['test_5f3_32',['test_3',['../d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0',1,'lru_tests::test_3()'],['../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3(): heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3(): pigeonhole_sort.cpp']]], - ['test_5f3d_5fclasses_33',['test_3d_classes',['../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d',1,'kohonen_som_trace.cpp']]], - ['test_5f3d_5fclasses1_34',['test_3d_classes1',['../d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e',1,'kohonen_som_topology.cpp']]], - ['test_5f3d_5fclasses2_35',['test_3d_classes2',['../d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653',1,'kohonen_som_topology.cpp']]], - ['test_5fand_5fset_36',['test_and_set',['http://en.cppreference.com/w/cpp/atomic/atomic_flag/test_and_set.html',0,'std::atomic_flag']]], - ['test_5fbitset_37',['test_bitset',['../d9/dab/bloom__filter_8cpp.html#a6e509afe40db07681f676ad8da4fb905',1,'bloom_filter.cpp']]], - ['test_5fbloom_5ffilter_5fint_38',['test_bloom_filter_int',['../d9/dab/bloom__filter_8cpp.html#a30edc0d2bb59c185baec81d69d20ed3b',1,'bloom_filter.cpp']]], - ['test_5fbloom_5ffilter_5fstring_39',['test_bloom_filter_string',['../d9/dab/bloom__filter_8cpp.html#a71f57bf262fe55db928b19dc124cc0d8',1,'bloom_filter.cpp']]], - ['test_5fcircle_40',['test_circle',['../d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d',1,'kohonen_som_trace.cpp']]], - ['test_5fcompute_5fpadded_5fsize_41',['test_compute_padded_size',['../d4/d08/sha256_8cpp.html#af9b52eba85d23e309035354141259f27',1,'sha256.cpp']]], - ['test_5fcontains_42',['test_contains',['../df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3',1,'binary_search_tree2.cpp']]], - ['test_5fdouble_43',['test_double',['../d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792',1,'quick_sort_3.cpp']]], - ['test_5feval_44',['test_eval',['../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec',1,'math']]], - ['test_5ff_45',['test_f',['../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d',1,'shell_sort2.cpp']]], - ['test_5ffind_5fmax_46',['test_find_max',['../df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365',1,'binary_search_tree2.cpp']]], - ['test_5ffind_5fmin_47',['test_find_min',['../df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4',1,'binary_search_tree2.cpp']]], - ['test_5ffindgraphsum_48',['test_findGraphSum',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a2311b22324cf09926726e4ce1309af8b',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]], - ['test_5ffunction_49',['test_function',['../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.cpp']]], - ['test_5ffunction_5f1_50',['test_function_1',['../d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15',1,'postfix_evaluation.cpp']]], - ['test_5ffunction_5f2_51',['test_function_2',['../d7/d75/postfix__evaluation_8cpp.html#a5b97d12e8b61484f756a8721992bfae1',1,'postfix_evaluation.cpp']]], - ['test_5fget_5felements_5finorder_52',['test_get_elements_inorder',['../df/d42/binary__search__tree2_8cpp.html#a06f35064850e891d6fda0093c0d9ee6e',1,'binary_search_tree2.cpp']]], - ['test_5fget_5felements_5fpostorder_53',['test_get_elements_postorder',['../df/d42/binary__search__tree2_8cpp.html#a94b76f781fcbe1ad0e3397ace6bb1965',1,'binary_search_tree2.cpp']]], - ['test_5fget_5felements_5fpreorder_54',['test_get_elements_preorder',['../df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a',1,'binary_search_tree2.cpp']]], - ['test_5finsert_55',['test_insert',['../df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350',1,'binary_search_tree2.cpp']]], - ['test_5fint_56',['test_int',['../d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e',1,'test_int(const int NUM_DATA): shell_sort2.cpp'],['../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda',1,'test_int(): quick_sort_3.cpp']]], - ['test_5flamniscate_57',['test_lamniscate',['../d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a',1,'kohonen_som_trace.cpp']]], - ['test_5flongest_5fcommon_5fstring_5flength_58',['test_longest_common_string_length',['../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561',1,'longest_common_string.cpp']]], - ['test_5flongest_5fcommon_5fstring_5flength_5ffor_5freversed_5finputs_59',['test_longest_common_string_length_for_reversed_inputs',['../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe',1,'longest_common_string.cpp']]], - ['test_5flongest_5fcommon_5fstring_5flength_5fis_5fsymmetric_60',['test_longest_common_string_length_is_symmetric',['../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155',1,'longest_common_string.cpp']]], - ['test_5fremove_61',['test_remove',['../df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e',1,'binary_search_tree2.cpp']]], - ['test_5fset_62',['test_set',['../d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123',1,'brute_force_string_searching.cpp']]], - ['testcase_63',['TestCase',['../da/d86/struct_test_case.html',1,'']]], - ['testcase_5f1_64',['testcase_1',['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()']]], - ['testcase_5f2_65',['testcase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]], - ['testcase_5f3_66',['testcase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]], - ['testcases_67',['TestCases',['../d5/d58/class_test_cases.html',1,'']]], - ['tests_68',['tests',['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d9/df4/namespacetests.html',1,'tests'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#af0a3e6827f41c151e47451f5ff98b1f1',1,'tests(math::ncr_modulo_p::NCRModuloP ncrObj): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp']]], - ['text_5fsearch_2ecpp_69',['text_search.cpp',['../dc/db5/text__search_8cpp.html',1,'']]], - ['tgamma_70',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]], - ['th_71',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]], - ['the_20address_20of_20parent_20nodes_72',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], - ['the_20algorithms_20c_73',['The Algorithms - C++',['../index.html',1,'']]], - ['the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_74',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], - ['the_20given_20node_20has_20the_20right_20node_20subtree_75',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], - ['the_20right_20node_20subtree_76',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], - ['the_20root_20node_77',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md93',1,'']]], - ['thousands_5fsep_78',['thousands_sep',['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::thousands_sep()']]], - ['thread_79',['thread',['http://en.cppreference.com/w/cpp/thread/thread/thread.html',0,'std::thread::thread()'],['http://en.cppreference.com/w/cpp/thread/thread.html',0,'std::thread']]], - ['throw_5fwith_5fnested_80',['throw_with_nested',['http://en.cppreference.com/w/cpp/error/throw_with_nested.html',0,'std']]], - ['tie_81',['tie',['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wfstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::strstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ios::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wiostream::tie()'],['http://en.cppreference.com/w/cpp/utility/tuple/tie.html',0,'std::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wstringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ifstream::tie()']]], - ['time_82',['time',['http://en.cppreference.com/w/cpp/chrono/c/time.html',0,'std']]], - ['time_5fbase_83',['time_base',['http://en.cppreference.com/w/cpp/locale/time_base.html',0,'std']]], - ['time_5fget_84',['time_get',['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get'],['http://en.cppreference.com/w/cpp/locale/time_get/time_get.html',0,'std::time_get::time_get()']]], - ['time_5fget_5fbyname_85',['time_get_byname',['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std::time_get_byname::time_get_byname()'],['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std::time_get_byname']]], - ['time_5fof_5fflight_86',['time_of_flight',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a563e066975fed1b84750a0a47c3cbb37',1,'physics::ground_to_ground_projectile_motion']]], - ['time_5fpoint_87',['time_point',['http://en.cppreference.com/w/cpp/chrono/time_point/time_point.html',0,'std::chrono::time_point::time_point()'],['http://en.cppreference.com/w/cpp/chrono/time_point.html',0,'std::chrono::time_point']]], - ['time_5fpoint_5fcast_88',['time_point_cast',['http://en.cppreference.com/w/cpp/chrono/time_point/time_point_cast.html',0,'std::chrono']]], - ['time_5fput_89',['time_put',['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put'],['http://en.cppreference.com/w/cpp/locale/time_put/time_put.html',0,'std::time_put::time_put()']]], - ['time_5fput_5fbyname_90',['time_put_byname',['http://en.cppreference.com/w/cpp/locale/time_put_byname.html',0,'std::time_put_byname'],['http://en.cppreference.com/w/cpp/locale/time_put_byname.html',0,'std::time_put_byname::time_put_byname()']]], - ['time_5fsince_5fepoch_91',['time_since_epoch',['http://en.cppreference.com/w/cpp/chrono/time_point/time_since_epoch.html',0,'std::chrono::time_point']]], - ['time_5ft_92',['time_t',['http://en.cppreference.com/w/cpp/chrono/c/time_t.html',0,'std']]], - ['timed_5fmutex_93',['timed_mutex',['http://en.cppreference.com/w/cpp/thread/timed_mutex.html',0,'std::timed_mutex'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/timed_mutex.html',0,'std::timed_mutex::timed_mutex()']]], - ['tm_94',['tm',['http://en.cppreference.com/w/cpp/chrono/c/tm.html',0,'std']]], - ['tmpfile_95',['tmpfile',['http://en.cppreference.com/w/cpp/io/c/tmpfile.html',0,'std']]], - ['tmpnam_96',['tmpnam',['http://en.cppreference.com/w/cpp/io/c/tmpnam.html',0,'std']]], - ['tnode_97',['Tnode',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html',1,'operations_on_datastructures::trie_operations']]], - ['to_5fbytes_98',['to_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/to_bytes.html',0,'std::wstring_convert']]], - ['to_5fchar_5ftype_99',['to_char_type',['http://en.cppreference.com/w/cpp/string/char_traits/to_char_type.html',0,'std::char_traits']]], - ['to_5fint_5ftype_100',['to_int_type',['http://en.cppreference.com/w/cpp/string/char_traits/to_int_type.html',0,'std::char_traits']]], - ['to_5fstring_101',['to_string',['http://en.cppreference.com/w/cpp/utility/bitset/to_string.html',0,'std::bitset::to_string()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08',1,'hashing::sha256::Hash::to_string()'],['http://en.cppreference.com/w/cpp/string/basic_string/to_string.html',0,'std::to_string()']]], - ['to_5ftime_5ft_102',['to_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/to_time_t.html',0,'std::chrono::system_clock']]], - ['to_5fullong_103',['to_ullong',['http://en.cppreference.com/w/cpp/utility/bitset/to_ullong.html',0,'std::bitset']]], - ['to_5fulong_104',['to_ulong',['http://en.cppreference.com/w/cpp/utility/bitset/to_ulong.html',0,'std::bitset']]], - ['to_5fwstring_105',['to_wstring',['http://en.cppreference.com/w/cpp/string/basic_string/to_wstring.html',0,'std']]], - ['todo_20list_106',['Todo List',['../dd/da0/todo.html',1,'']]], - ['tolittleendian32_107',['toLittleEndian32',['../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689',1,'hashing::md5']]], - ['tolittleendian64_108',['toLittleEndian64',['../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef',1,'hashing::md5']]], - ['tolower_109',['tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::tolower()'],['http://en.cppreference.com/w/cpp/string/byte/tolower.html',0,'std::tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::tolower()']]], - ['tolowerroman_110',['tolowerRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d',1,'decimal_to_roman_numeral.cpp']]], - ['top_111',['top',['../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d',1,'tower::top'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7',1,'data_structures::stack_using_queue::Stack::top()'],['http://en.cppreference.com/w/cpp/container/stack/top.html',0,'std::stack::top()'],['http://en.cppreference.com/w/cpp/container/priority_queue/top.html',0,'std::priority_queue::top()'],['../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709',1,'stack::top()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a89ad00dbd262e2527129813b53e16f81',1,'data_structures::linked_list::list::top()']]], - ['toupper_112',['toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::toupper()'],['http://en.cppreference.com/w/cpp/string/byte/toupper.html',0,'std::toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::toupper()']]], - ['toupperroman_113',['toupperRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979',1,'decimal_to_roman_numeral.cpp']]], - ['tovector_114',['toVector',['../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d',1,'queue']]], - ['towctrans_115',['towctrans',['http://en.cppreference.com/w/cpp/string/wide/towctrans.html',0,'std']]], - ['tower_116',['tower',['../d2/d2c/structtower.html',1,'']]], - ['tower_5fof_5fhanoi_2ecpp_117',['tower_of_hanoi.cpp',['../db/d3c/tower__of__hanoi_8cpp.html',1,'']]], - ['towlower_118',['towlower',['http://en.cppreference.com/w/cpp/string/wide/towlower.html',0,'std']]], - ['towupper_119',['towupper',['http://en.cppreference.com/w/cpp/string/wide/towupper.html',0,'std']]], - ['transform_120',['transform',['http://en.cppreference.com/w/cpp/algorithm/transform.html',0,'std::transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::transform()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/transform.html',0,'std::regex_traits::transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::transform()']]], - ['transform_5fprimary_121',['transform_primary',['http://en.cppreference.com/w/cpp/regex/regex_traits/transform_primary.html',0,'std::regex_traits']]], - ['translate_122',['translate',['http://en.cppreference.com/w/cpp/regex/regex_traits/translate.html',0,'std::regex_traits']]], - ['translate_5fnocase_123',['translate_nocase',['http://en.cppreference.com/w/cpp/regex/regex_traits/translate_nocase.html',0,'std::regex_traits']]], - ['transpose_124',['transpose',['../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a',1,'machine_learning']]], - ['travelling_5fsalesman_5fproblem_2ecpp_125',['travelling_salesman_problem.cpp',['../de/d88/travelling__salesman__problem_8cpp.html',1,'']]], - ['travelling_5fsalesman_5fusing_5fbit_5fmanipulation_126',['travelling_salesman_using_bit_manipulation',['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1',1,'bit_manipulation::travelling_salesman_using_bit_manipulation']]], - ['travelling_5fsalesman_5fusing_5fbit_5fmanipulation_2ecpp_127',['travelling_salesman_using_bit_manipulation.cpp',['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html',1,'']]], - ['travellingsalesman_5fbitmanipulation_128',['travellingSalesman_bitmanipulation',['../d7/d3f/namespacetravelling_salesman__bitmanipulation.html',1,'']]], - ['travellingsalesmanproblem_129',['TravellingSalesmanProblem',['../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346',1,'graph']]], - ['traversal_20of_20a_20tree_130',['traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md96',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md102',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Preorder Traversal of a tree']]], - ['traverse_131',['traverse',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd',1,'data_structures::tree_234::Tree234::Traverse()'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a936bb546e6a94d8b9d35b30ee1bb291a',1,'data_structures::tree_234::Tree234::Traverse(Node *tree)'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#aaca3be50a2a81bf3308d202a6dcee91a',1,'data_structures::linked_list::list::traverse()']]], - ['traverse_5finorder_132',['traverse_inorder',['../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd',1,'binary_search_tree']]], - ['traverse_5fpostorder_133',['traverse_postorder',['../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362',1,'binary_search_tree']]], - ['traverse_5fpreorder_134',['traverse_preorder',['../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1',1,'binary_search_tree']]], - ['treap_135',['treap',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html',1,'data_structures::treap::Treap'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683',1,'data_structures::treap::Treap::Treap()']]], - ['treap_2ecpp_136',['treap.cpp',['../d0/dd2/treap_8cpp.html',1,'']]], - ['treapcnt_137',['treapCnt',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425',1,'data_structures::treap::Treap']]], - ['treat_5fas_5ffloating_5fpoint_138',['treat_as_floating_point',['http://en.cppreference.com/w/cpp/chrono/treat_as_floating_point.html',0,'std::chrono']]], - ['tree_139',['tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md96',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md102',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Preorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Preorder Traversal of a tree'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html',1,'range_queries::heavy_light_decomposition::Tree< X >'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1',1,'range_queries::heavy_light_decomposition::Tree::Tree()']]], - ['tree234_140',['Tree234',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html',1,'data_structures::tree_234']]], - ['tree_5f234_141',['tree_234',['../d6/dab/namespacetree__234.html',1,'']]], - ['tree_5f234_2ecpp_142',['tree_234.cpp',['../db/dbc/tree__234_8cpp.html',1,'']]], - ['triangle_5farea_143',['triangle_area',['../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc',1,'math']]], - ['triangle_5fperimeter_144',['triangle_perimeter',['../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3',1,'math']]], - ['triangle_5fprism_5fvolume_145',['triangle_prism_volume',['../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c',1,'math']]], - ['trianglearea_146',['TriangleArea',['../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc',1,'smallest_circle.cpp']]], - ['trie_147',['trie',['../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908',1,'Trie::Trie()'],['../d0/d3e/classdata__structures_1_1trie.html',1,'data_structures::trie'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html',1,'data_structures::trie_using_hashmap::Trie'],['../dd/d2f/class_trie.html',1,'Trie'],['../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8',1,'data_structures::trie::trie()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a092d0805a9e647c2048777dbe67b35ab',1,'data_structures::trie_using_hashmap::Trie::Trie()']]], - ['trie_5fmodern_2ecpp_148',['trie_modern.cpp',['../dc/d93/trie__modern_8cpp.html',1,'']]], - ['trie_5fmultiple_5fsearch_2ecpp_149',['trie_multiple_search.cpp',['../d7/def/trie__multiple__search_8cpp.html',1,'']]], - ['trie_5foperations_150',['trie_operations',['../df/d8e/namespacetrie__operations.html',1,'']]], - ['trie_5ftree_2ecpp_151',['trie_tree.cpp',['../d7/d83/trie__tree_8cpp.html',1,'']]], - ['trie_5fusing_5fhashmap_152',['trie_using_hashmap',['../d7/d0a/namespacetrie__using__hashmap.html',1,'']]], - ['trie_5fusing_5fhashmap_2ecpp_153',['trie_using_hashmap.cpp',['../d5/d8a/trie__using__hashmap_8cpp.html',1,'']]], - ['trienode_154',['TrieNode',['../de/d48/struct_trie_1_1_trie_node.html',1,'Trie']]], - ['true_5ftype_155',['true_type',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]], - ['truename_156',['truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::truename()']]], - ['trunc_157',['trunc',['http://en.cppreference.com/w/cpp/numeric/math/trunc.html',0,'std']]], - ['try_5flock_158',['try_lock',['http://en.cppreference.com/w/cpp/thread/recursive_mutex/try_lock.html',0,'std::recursive_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock.html',0,'std::recursive_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock.html',0,'std::shared_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock.html',0,'std::timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/try_lock.html',0,'std::mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock.html',0,'std::shared_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/try_lock.html',0,'std::try_lock()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock.html',0,'std::unique_lock::try_lock(T... args)']]], - ['try_5flock_5ffor_159',['try_lock_for',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_for.html',0,'std::unique_lock::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_for.html',0,'std::recursive_timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_for.html',0,'std::timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_for.html',0,'std::shared_lock::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_for.html',0,'std::shared_timed_mutex::try_lock_for(T... args)']]], - ['try_5flock_5fshared_160',['try_lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared.html',0,'std::shared_timed_mutex']]], - ['try_5flock_5fshared_5ffor_161',['try_lock_shared_for',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_for.html',0,'std::shared_timed_mutex']]], - ['try_5flock_5fshared_5funtil_162',['try_lock_shared_until',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_until.html',0,'std::shared_timed_mutex']]], - ['try_5flock_5funtil_163',['try_lock_until',['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_until.html',0,'std::timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_until.html',0,'std::recursive_timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_until.html',0,'std::unique_lock::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_until.html',0,'std::shared_timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_until.html',0,'std::shared_lock::try_lock_until()']]], - ['try_5fto_5flock_5ft_164',['try_to_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], - ['tryleftrotate_165',['TryLeftRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9',1,'data_structures::tree_234::Tree234']]], - ['tryrightrotate_166',['TryRightRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3',1,'data_structures::tree_234::Tree234']]], - ['tuple_167',['tuple',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std::tuple'],['http://en.cppreference.com/w/cpp/utility/tuple/tuple.html',0,'std::tuple::tuple()']]], - ['tuple_3c_20int_2c_20int_2c_20int_20_3e_168',['tuple< int, int, int >',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std']]], - ['tuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_169',['tuple< S, T, E, double, double, double >',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std']]], - ['tuple_5fcat_170',['tuple_cat',['http://en.cppreference.com/w/cpp/utility/tuple/tuple_cat.html',0,'std']]], - ['type_5findex_171',['type_index',['http://en.cppreference.com/w/cpp/types/type_index.html',0,'std::type_index'],['http://en.cppreference.com/w/cpp/types/type_index/type_index.html',0,'std::type_index::type_index()']]], - ['type_5finfo_172',['type_info',['http://en.cppreference.com/w/cpp/types/type_info.html',0,'std']]], - ['typical_20structure_20of_20a_20program_173',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]] + ['test_21',['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'],['../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()'],['../df/d64/jumpgame_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jumpgame.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',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29',1,'']]], + ['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']]], + ['test3_26',['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']]], + ['test4_27',['test4',['../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d',1,'tests::test4()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2',1,'test4(): iterative_tree_traversals.cpp']]], + ['test5_28',['test5',['../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86',1,'tests::test5()'],['../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8',1,'test5(): iterative_tree_traversals.cpp']]], + ['test6_29',['test6',['../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2',1,'tests::test6()'],['../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89',1,'test6(): iterative_tree_traversals.cpp']]], + ['test_5f1_30',['test_1',['../d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4',1,'lru_tests::test_1()'],['../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1(): heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1(): pigeonhole_sort.cpp']]], + ['test_5f2_31',['test_2',['../d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec',1,'lru_tests::test_2()'],['../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2(): heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2(): pigeonhole_sort.cpp']]], + ['test_5f2d_5fclasses_32',['test_2d_classes',['../d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9',1,'kohonen_som_topology.cpp']]], + ['test_5f3_33',['test_3',['../d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0',1,'lru_tests::test_3()'],['../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3(): heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3(): pigeonhole_sort.cpp']]], + ['test_5f3d_5fclasses_34',['test_3d_classes',['../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d',1,'kohonen_som_trace.cpp']]], + ['test_5f3d_5fclasses1_35',['test_3d_classes1',['../d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e',1,'kohonen_som_topology.cpp']]], + ['test_5f3d_5fclasses2_36',['test_3d_classes2',['../d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653',1,'kohonen_som_topology.cpp']]], + ['test_5fand_5fset_37',['test_and_set',['http://en.cppreference.com/w/cpp/atomic/atomic_flag/test_and_set.html',0,'std::atomic_flag']]], + ['test_5fbitset_38',['test_bitset',['../d9/dab/bloom__filter_8cpp.html#a6e509afe40db07681f676ad8da4fb905',1,'bloom_filter.cpp']]], + ['test_5fbloom_5ffilter_5fint_39',['test_bloom_filter_int',['../d9/dab/bloom__filter_8cpp.html#a30edc0d2bb59c185baec81d69d20ed3b',1,'bloom_filter.cpp']]], + ['test_5fbloom_5ffilter_5fstring_40',['test_bloom_filter_string',['../d9/dab/bloom__filter_8cpp.html#a71f57bf262fe55db928b19dc124cc0d8',1,'bloom_filter.cpp']]], + ['test_5fcircle_41',['test_circle',['../d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d',1,'kohonen_som_trace.cpp']]], + ['test_5fcompute_5fpadded_5fsize_42',['test_compute_padded_size',['../d4/d08/sha256_8cpp.html#af9b52eba85d23e309035354141259f27',1,'sha256.cpp']]], + ['test_5fcontains_43',['test_contains',['../df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3',1,'binary_search_tree2.cpp']]], + ['test_5fdouble_44',['test_double',['../d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792',1,'quick_sort_3.cpp']]], + ['test_5feval_45',['test_eval',['../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec',1,'math']]], + ['test_5ff_46',['test_f',['../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d',1,'shell_sort2.cpp']]], + ['test_5ffind_5fmax_47',['test_find_max',['../df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365',1,'binary_search_tree2.cpp']]], + ['test_5ffind_5fmin_48',['test_find_min',['../df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4',1,'binary_search_tree2.cpp']]], + ['test_5ffindgraphsum_49',['test_findGraphSum',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a2311b22324cf09926726e4ce1309af8b',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]], + ['test_5ffunction_50',['test_function',['../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.cpp']]], + ['test_5ffunction_5f1_51',['test_function_1',['../d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15',1,'postfix_evaluation.cpp']]], + ['test_5ffunction_5f2_52',['test_function_2',['../d7/d75/postfix__evaluation_8cpp.html#a5b97d12e8b61484f756a8721992bfae1',1,'postfix_evaluation.cpp']]], + ['test_5fget_5felements_5finorder_53',['test_get_elements_inorder',['../df/d42/binary__search__tree2_8cpp.html#a06f35064850e891d6fda0093c0d9ee6e',1,'binary_search_tree2.cpp']]], + ['test_5fget_5felements_5fpostorder_54',['test_get_elements_postorder',['../df/d42/binary__search__tree2_8cpp.html#a94b76f781fcbe1ad0e3397ace6bb1965',1,'binary_search_tree2.cpp']]], + ['test_5fget_5felements_5fpreorder_55',['test_get_elements_preorder',['../df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a',1,'binary_search_tree2.cpp']]], + ['test_5finsert_56',['test_insert',['../df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350',1,'binary_search_tree2.cpp']]], + ['test_5fint_57',['test_int',['../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda',1,'test_int(): quick_sort_3.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e',1,'test_int(const int NUM_DATA): shell_sort2.cpp']]], + ['test_5flamniscate_58',['test_lamniscate',['../d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a',1,'kohonen_som_trace.cpp']]], + ['test_5flongest_5fcommon_5fstring_5flength_59',['test_longest_common_string_length',['../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561',1,'longest_common_string.cpp']]], + ['test_5flongest_5fcommon_5fstring_5flength_5ffor_5freversed_5finputs_60',['test_longest_common_string_length_for_reversed_inputs',['../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe',1,'longest_common_string.cpp']]], + ['test_5flongest_5fcommon_5fstring_5flength_5fis_5fsymmetric_61',['test_longest_common_string_length_is_symmetric',['../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155',1,'longest_common_string.cpp']]], + ['test_5fremove_62',['test_remove',['../df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e',1,'binary_search_tree2.cpp']]], + ['test_5fset_63',['test_set',['../d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123',1,'brute_force_string_searching.cpp']]], + ['testcase_64',['TestCase',['../da/d86/struct_test_case.html',1,'']]], + ['testcase_5f1_65',['testCase_1',['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()']]], + ['testcase_5f2_66',['testCase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]], + ['testcase_5f3_67',['testCase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]], + ['testcases_68',['TestCases',['../d5/d58/class_test_cases.html',1,'']]], + ['tests_69',['tests',['../d9/df4/namespacetests.html',1,'tests'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#af0a3e6827f41c151e47451f5ff98b1f1',1,'tests(math::ncr_modulo_p::NCRModuloP ncrObj): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp']]], + ['text_5fsearch_2ecpp_70',['text_search.cpp',['../dc/db5/text__search_8cpp.html',1,'']]], + ['tgamma_71',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]], + ['th_72',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]], + ['the_20address_20of_20parent_20nodes_73',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], + ['the_20algorithms_20c_74',['The Algorithms - C++',['../index.html',1,'']]], + ['the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_75',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['the_20given_20node_20has_20the_20right_20node_20subtree_76',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['the_20right_20node_20subtree_77',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['the_20root_20node_78',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md93',1,'']]], + ['thousands_5fsep_79',['thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::thousands_sep()']]], + ['thread_80',['thread',['http://en.cppreference.com/w/cpp/thread/thread.html',0,'std::thread'],['http://en.cppreference.com/w/cpp/thread/thread/thread.html',0,'std::thread::thread()']]], + ['throw_5fwith_5fnested_81',['throw_with_nested',['http://en.cppreference.com/w/cpp/error/throw_with_nested.html',0,'std']]], + ['tie_82',['tie',['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ios::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::strstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wiostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wfstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wstringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ifstream::tie()'],['http://en.cppreference.com/w/cpp/utility/tuple/tie.html',0,'std::tie(T... args)']]], + ['time_83',['time',['http://en.cppreference.com/w/cpp/chrono/c/time.html',0,'std']]], + ['time_5fbase_84',['time_base',['http://en.cppreference.com/w/cpp/locale/time_base.html',0,'std']]], + ['time_5fget_85',['time_get',['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get'],['http://en.cppreference.com/w/cpp/locale/time_get/time_get.html',0,'std::time_get::time_get()']]], + ['time_5fget_5fbyname_86',['time_get_byname',['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std::time_get_byname'],['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std::time_get_byname::time_get_byname()']]], + ['time_5fof_5fflight_87',['time_of_flight',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a563e066975fed1b84750a0a47c3cbb37',1,'physics::ground_to_ground_projectile_motion']]], + ['time_5fpoint_88',['time_point',['http://en.cppreference.com/w/cpp/chrono/time_point.html',0,'std::chrono::time_point'],['http://en.cppreference.com/w/cpp/chrono/time_point/time_point.html',0,'std::chrono::time_point::time_point()']]], + ['time_5fpoint_5fcast_89',['time_point_cast',['http://en.cppreference.com/w/cpp/chrono/time_point/time_point_cast.html',0,'std::chrono']]], + ['time_5fput_90',['time_put',['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put'],['http://en.cppreference.com/w/cpp/locale/time_put/time_put.html',0,'std::time_put::time_put()']]], + ['time_5fput_5fbyname_91',['time_put_byname',['http://en.cppreference.com/w/cpp/locale/time_put_byname.html',0,'std::time_put_byname'],['http://en.cppreference.com/w/cpp/locale/time_put_byname.html',0,'std::time_put_byname::time_put_byname()']]], + ['time_5fsince_5fepoch_92',['time_since_epoch',['http://en.cppreference.com/w/cpp/chrono/time_point/time_since_epoch.html',0,'std::chrono::time_point']]], + ['time_5ft_93',['time_t',['http://en.cppreference.com/w/cpp/chrono/c/time_t.html',0,'std']]], + ['timed_5fmutex_94',['timed_mutex',['http://en.cppreference.com/w/cpp/thread/timed_mutex.html',0,'std::timed_mutex'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/timed_mutex.html',0,'std::timed_mutex::timed_mutex()']]], + ['tm_95',['tm',['http://en.cppreference.com/w/cpp/chrono/c/tm.html',0,'std']]], + ['tmpfile_96',['tmpfile',['http://en.cppreference.com/w/cpp/io/c/tmpfile.html',0,'std']]], + ['tmpnam_97',['tmpnam',['http://en.cppreference.com/w/cpp/io/c/tmpnam.html',0,'std']]], + ['tnode_98',['Tnode',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html',1,'operations_on_datastructures::trie_operations']]], + ['to_5fbytes_99',['to_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/to_bytes.html',0,'std::wstring_convert']]], + ['to_5fchar_5ftype_100',['to_char_type',['http://en.cppreference.com/w/cpp/string/char_traits/to_char_type.html',0,'std::char_traits']]], + ['to_5fint_5ftype_101',['to_int_type',['http://en.cppreference.com/w/cpp/string/char_traits/to_int_type.html',0,'std::char_traits']]], + ['to_5fstring_102',['to_string',['http://en.cppreference.com/w/cpp/utility/bitset/to_string.html',0,'std::bitset::to_string()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08',1,'hashing::sha256::Hash::to_string()'],['http://en.cppreference.com/w/cpp/string/basic_string/to_string.html',0,'std::to_string()']]], + ['to_5ftime_5ft_103',['to_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/to_time_t.html',0,'std::chrono::system_clock']]], + ['to_5fullong_104',['to_ullong',['http://en.cppreference.com/w/cpp/utility/bitset/to_ullong.html',0,'std::bitset']]], + ['to_5fulong_105',['to_ulong',['http://en.cppreference.com/w/cpp/utility/bitset/to_ulong.html',0,'std::bitset']]], + ['to_5fwstring_106',['to_wstring',['http://en.cppreference.com/w/cpp/string/basic_string/to_wstring.html',0,'std']]], + ['todo_20list_107',['Todo List',['../dd/da0/todo.html',1,'']]], + ['tolittleendian32_108',['toLittleEndian32',['../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689',1,'hashing::md5']]], + ['tolittleendian64_109',['toLittleEndian64',['../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef',1,'hashing::md5']]], + ['tolower_110',['tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::tolower()'],['http://en.cppreference.com/w/cpp/string/byte/tolower.html',0,'std::tolower()']]], + ['tolowerroman_111',['tolowerRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d',1,'decimal_to_roman_numeral.cpp']]], + ['top_112',['top',['../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d',1,'tower::top'],['http://en.cppreference.com/w/cpp/container/stack/top.html',0,'std::stack::top()'],['http://en.cppreference.com/w/cpp/container/priority_queue/top.html',0,'std::priority_queue::top()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a89ad00dbd262e2527129813b53e16f81',1,'data_structures::linked_list::list::top()'],['../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709',1,'stack::top()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7',1,'data_structures::stack_using_queue::Stack::top()']]], + ['toupper_113',['toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::toupper()'],['http://en.cppreference.com/w/cpp/string/byte/toupper.html',0,'std::toupper()']]], + ['toupperroman_114',['toupperRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979',1,'decimal_to_roman_numeral.cpp']]], + ['tovector_115',['toVector',['../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d',1,'queue']]], + ['towctrans_116',['towctrans',['http://en.cppreference.com/w/cpp/string/wide/towctrans.html',0,'std']]], + ['tower_117',['tower',['../d2/d2c/structtower.html',1,'']]], + ['tower_5fof_5fhanoi_2ecpp_118',['tower_of_hanoi.cpp',['../db/d3c/tower__of__hanoi_8cpp.html',1,'']]], + ['towlower_119',['towlower',['http://en.cppreference.com/w/cpp/string/wide/towlower.html',0,'std']]], + ['towupper_120',['towupper',['http://en.cppreference.com/w/cpp/string/wide/towupper.html',0,'std']]], + ['transform_121',['transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::transform()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/transform.html',0,'std::regex_traits::transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::transform()'],['http://en.cppreference.com/w/cpp/algorithm/transform.html',0,'std::transform()']]], + ['transform_5fprimary_122',['transform_primary',['http://en.cppreference.com/w/cpp/regex/regex_traits/transform_primary.html',0,'std::regex_traits']]], + ['translate_123',['translate',['http://en.cppreference.com/w/cpp/regex/regex_traits/translate.html',0,'std::regex_traits']]], + ['translate_5fnocase_124',['translate_nocase',['http://en.cppreference.com/w/cpp/regex/regex_traits/translate_nocase.html',0,'std::regex_traits']]], + ['transpose_125',['transpose',['../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a',1,'machine_learning']]], + ['travelling_5fsalesman_5fproblem_2ecpp_126',['travelling_salesman_problem.cpp',['../de/d88/travelling__salesman__problem_8cpp.html',1,'']]], + ['travelling_5fsalesman_5fusing_5fbit_5fmanipulation_127',['travelling_salesman_using_bit_manipulation',['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1',1,'bit_manipulation::travelling_salesman_using_bit_manipulation']]], + ['travelling_5fsalesman_5fusing_5fbit_5fmanipulation_2ecpp_128',['travelling_salesman_using_bit_manipulation.cpp',['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html',1,'']]], + ['travellingsalesman_5fbitmanipulation_129',['travellingSalesman_bitmanipulation',['../d7/d3f/namespacetravelling_salesman__bitmanipulation.html',1,'']]], + ['travellingsalesmanproblem_130',['TravellingSalesmanProblem',['../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346',1,'graph']]], + ['traversal_20of_20a_20tree_131',['Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md96',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md102',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Preorder Traversal of a tree']]], + ['traverse_132',['Traverse',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd',1,'data_structures::tree_234::Tree234::Traverse()'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a936bb546e6a94d8b9d35b30ee1bb291a',1,'data_structures::tree_234::Tree234::Traverse(Node *tree)']]], + ['traverse_133',['traverse',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#aaca3be50a2a81bf3308d202a6dcee91a',1,'data_structures::linked_list::list']]], + ['traverse_5finorder_134',['traverse_inorder',['../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd',1,'binary_search_tree']]], + ['traverse_5fpostorder_135',['traverse_postorder',['../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362',1,'binary_search_tree']]], + ['traverse_5fpreorder_136',['traverse_preorder',['../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1',1,'binary_search_tree']]], + ['treap_137',['Treap',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html',1,'data_structures::treap::Treap'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683',1,'data_structures::treap::Treap::Treap()']]], + ['treap_2ecpp_138',['treap.cpp',['../d0/dd2/treap_8cpp.html',1,'']]], + ['treapcnt_139',['treapCnt',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425',1,'data_structures::treap::Treap']]], + ['treat_5fas_5ffloating_5fpoint_140',['treat_as_floating_point',['http://en.cppreference.com/w/cpp/chrono/treat_as_floating_point.html',0,'std::chrono']]], + ['tree_141',['Tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md96',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md102',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Preorder Traversal of a tree'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html',1,'range_queries::heavy_light_decomposition::Tree< X >'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1',1,'range_queries::heavy_light_decomposition::Tree::Tree()']]], + ['tree234_142',['Tree234',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html',1,'data_structures::tree_234']]], + ['tree_5f234_143',['tree_234',['../d6/dab/namespacetree__234.html',1,'']]], + ['tree_5f234_2ecpp_144',['tree_234.cpp',['../db/dbc/tree__234_8cpp.html',1,'']]], + ['triangle_5farea_145',['triangle_area',['../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc',1,'math']]], + ['triangle_5fperimeter_146',['triangle_perimeter',['../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3',1,'math']]], + ['triangle_5fprism_5fvolume_147',['triangle_prism_volume',['../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c',1,'math']]], + ['trianglearea_148',['TriangleArea',['../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc',1,'smallest_circle.cpp']]], + ['trie_149',['trie',['../d0/d3e/classdata__structures_1_1trie.html',1,'data_structures']]], + ['trie_150',['Trie',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html',1,'data_structures::trie_using_hashmap::Trie'],['../dd/d2f/class_trie.html',1,'Trie'],['../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908',1,'Trie::Trie()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a092d0805a9e647c2048777dbe67b35ab',1,'data_structures::trie_using_hashmap::Trie::Trie()']]], + ['trie_151',['trie',['../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8',1,'data_structures::trie']]], + ['trie_5fmodern_2ecpp_152',['trie_modern.cpp',['../dc/d93/trie__modern_8cpp.html',1,'']]], + ['trie_5fmultiple_5fsearch_2ecpp_153',['trie_multiple_search.cpp',['../d7/def/trie__multiple__search_8cpp.html',1,'']]], + ['trie_5foperations_154',['trie_operations',['../df/d8e/namespacetrie__operations.html',1,'']]], + ['trie_5ftree_2ecpp_155',['trie_tree.cpp',['../d7/d83/trie__tree_8cpp.html',1,'']]], + ['trie_5fusing_5fhashmap_156',['trie_using_hashmap',['../d7/d0a/namespacetrie__using__hashmap.html',1,'']]], + ['trie_5fusing_5fhashmap_2ecpp_157',['trie_using_hashmap.cpp',['../d5/d8a/trie__using__hashmap_8cpp.html',1,'']]], + ['trienode_158',['TrieNode',['../de/d48/struct_trie_1_1_trie_node.html',1,'Trie']]], + ['true_5ftype_159',['true_type',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]], + ['truename_160',['truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::truename()']]], + ['trunc_161',['trunc',['http://en.cppreference.com/w/cpp/numeric/math/trunc.html',0,'std']]], + ['try_5flock_162',['try_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock.html',0,'std::unique_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/try_lock.html',0,'std::recursive_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock.html',0,'std::recursive_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock.html',0,'std::shared_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock.html',0,'std::timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/try_lock.html',0,'std::mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock.html',0,'std::shared_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/try_lock.html',0,'std::try_lock()']]], + ['try_5flock_5ffor_163',['try_lock_for',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_for.html',0,'std::unique_lock::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_for.html',0,'std::recursive_timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_for.html',0,'std::shared_lock::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_for.html',0,'std::timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_for.html',0,'std::shared_timed_mutex::try_lock_for(T... args)']]], + ['try_5flock_5fshared_164',['try_lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared.html',0,'std::shared_timed_mutex']]], + ['try_5flock_5fshared_5ffor_165',['try_lock_shared_for',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_for.html',0,'std::shared_timed_mutex']]], + ['try_5flock_5fshared_5funtil_166',['try_lock_shared_until',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_until.html',0,'std::shared_timed_mutex']]], + ['try_5flock_5funtil_167',['try_lock_until',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_until.html',0,'std::unique_lock::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_until.html',0,'std::recursive_timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_until.html',0,'std::shared_lock::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_until.html',0,'std::timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_until.html',0,'std::shared_timed_mutex::try_lock_until()']]], + ['try_5fto_5flock_5ft_168',['try_to_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], + ['tryleftrotate_169',['TryLeftRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9',1,'data_structures::tree_234::Tree234']]], + ['tryrightrotate_170',['TryRightRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3',1,'data_structures::tree_234::Tree234']]], + ['tuple_171',['tuple',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std::tuple'],['http://en.cppreference.com/w/cpp/utility/tuple/tuple.html',0,'std::tuple::tuple()']]], + ['tuple_3c_20int_2c_20int_2c_20int_20_3e_172',['tuple< int, int, int >',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std']]], + ['tuple_5fcat_173',['tuple_cat',['http://en.cppreference.com/w/cpp/utility/tuple/tuple_cat.html',0,'std']]], + ['type_5findex_174',['type_index',['http://en.cppreference.com/w/cpp/types/type_index.html',0,'std::type_index'],['http://en.cppreference.com/w/cpp/types/type_index/type_index.html',0,'std::type_index::type_index()']]], + ['type_5finfo_175',['type_info',['http://en.cppreference.com/w/cpp/types/type_info.html',0,'std']]], + ['typical_20structure_20of_20a_20program_176',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]] ]; diff --git a/search/all_1a.js b/search/all_1a.js index 7ee2a4d95..333c21d26 100644 --- a/search/all_1a.js +++ b/search/all_1a.js @@ -4,12 +4,12 @@ var searchData= ['u16string_1',['u16string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::u16string'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::u16string::u16string()']]], ['u32streampos_2',['u32streampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], ['u32string_3',['u32string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::u32string'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::u32string::u32string()']]], - ['uflow_4',['uflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::filebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::strstreambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_filebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wstringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::stringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wfilebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::streambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_streambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_stringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wstreambuf::uflow()']]], - ['uint128_5ft_5',['uint128_t',['../db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac',1,'uint128_t::uint128_t(const std::string &str)'],['../db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040',1,'uint128_t::uint128_t(T low)'],['../db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d',1,'uint128_t::uint128_t(const uint64_t high, const uint64_t low)'],['../db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b',1,'uint128_t::uint128_t(const uint128_t &num)=default'],['../db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c',1,'uint128_t::uint128_t(uint128_t &&num) noexcept'],['../db/d9a/classuint128__t.html',1,'uint128_t']]], + ['uflow_4',['uflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_filebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wstringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::stringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wfilebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wstreambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::strstreambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_stringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_streambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::filebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::streambuf::uflow()']]], + ['uint128_5ft_5',['uint128_t',['../db/d9a/classuint128__t.html',1,'uint128_t'],['../db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040',1,'uint128_t::uint128_t(T low)'],['../db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac',1,'uint128_t::uint128_t(const std::string &str)'],['../db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d',1,'uint128_t::uint128_t(const uint64_t high, const uint64_t low)'],['../db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b',1,'uint128_t::uint128_t(const uint128_t &num)=default'],['../db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c',1,'uint128_t::uint128_t(uint128_t &&num) noexcept']]], ['uint128_5ft_2ehpp_6',['uint128_t.hpp',['../da/d41/uint128__t_8hpp.html',1,'']]], ['uint128_5ft_5ftests_7',['uint128_t_tests',['../df/d2c/elliptic__curve__key__exchange_8cpp.html#a8800c8a84d77dadadb05ad5e83b77ef4',1,'elliptic_curve_key_exchange.cpp']]], ['uint16_5ft_8',['uint16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], - ['uint256_5ft_9',['uint256_t',['../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39',1,'uint256_t::uint256_t(const std::string &str)'],['../d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3',1,'uint256_t::uint256_t(uint128_t high, uint128_t low)'],['../d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa',1,'uint256_t::uint256_t(uint256_t &&num) noexcept'],['../d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e',1,'uint256_t::uint256_t(const uint256_t &num)=default'],['../d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052',1,'uint256_t::uint256_t(const uint64_t high, const uint64_t low)'],['../d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc',1,'uint256_t::uint256_t(T low)'],['../d1/d83/classuint256__t.html',1,'uint256_t']]], + ['uint256_5ft_9',['uint256_t',['../d1/d83/classuint256__t.html',1,'uint256_t'],['../d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc',1,'uint256_t::uint256_t(T low)'],['../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39',1,'uint256_t::uint256_t(const std::string &str)'],['../d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e',1,'uint256_t::uint256_t(const uint256_t &num)=default'],['../d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa',1,'uint256_t::uint256_t(uint256_t &&num) noexcept'],['../d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3',1,'uint256_t::uint256_t(uint128_t high, uint128_t low)'],['../d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052',1,'uint256_t::uint256_t(const uint64_t high, const uint64_t low)']]], ['uint256_5ft_2ehpp_10',['uint256_t.hpp',['../da/da3/uint256__t_8hpp.html',1,'']]], ['uint256_5ft_5ftests_11',['uint256_t_tests',['../df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae',1,'elliptic_curve_key_exchange.cpp']]], ['uint32_5ft_12',['uint32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], @@ -30,12 +30,12 @@ var searchData= ['uncaught_5fexception_27',['uncaught_exception',['http://en.cppreference.com/w/cpp/error/uncaught_exception.html',0,'std']]], ['undeclare_5fno_5fpointers_28',['undeclare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_no_pointers.html',0,'std']]], ['undeclare_5freachable_29',['undeclare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_reachable.html',0,'std']]], - ['underflow_30',['underflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wfilebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::streambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_streambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::strstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstreambuf::underflow()']]], + ['underflow_30',['underflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wfilebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::strstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_streambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::streambuf::underflow()']]], ['underflow_5ferror_31',['underflow_error',['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std::underflow_error'],['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std::underflow_error::underflow_error()']]], ['underlying_5ftype_32',['underlying_type',['http://en.cppreference.com/w/cpp/types/underlying_type.html',0,'std']]], ['unexpected_33',['unexpected',['http://en.cppreference.com/w/cpp/error/unexpected.html',0,'std']]], ['unexpected_5fhandler_34',['unexpected_handler',['http://en.cppreference.com/w/cpp/error/unexpected_handler.html',0,'std']]], - ['unget_35',['unget',['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istrstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::ifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wstringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wfstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_ifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::strstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wiostream::unget()']]], + ['unget_35',['unget',['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::strstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istrstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wiostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_ifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wfstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wstringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::ifstream::unget()']]], ['ungetc_36',['ungetc',['http://en.cppreference.com/w/cpp/io/c/ungetc.html',0,'std']]], ['ungetwc_37',['ungetwc',['http://en.cppreference.com/w/cpp/io/c/ungetwc.html',0,'std']]], ['uniform_5fint_5fdistribution_38',['uniform_int_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html',0,'std::uniform_int_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/uniform_int_distribution.html',0,'std::uniform_int_distribution::uniform_int_distribution()']]], @@ -48,38 +48,39 @@ var searchData= ['union_45',['Union',['../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757',1,'disjoint_set.cpp']]], ['union_5fof_5ftwo_5farrays_2ecpp_46',['union_of_two_arrays.cpp',['../d8/d9c/union__of__two__arrays_8cpp.html',1,'']]], ['union_5fsets_47',['union_sets',['../d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145',1,'graph::disjoint_union']]], - ['unionset_48',['unionset',['../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559',1,'dsu::UnionSet(uint64_t i, uint64_t j)'],['../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f',1,'dsu::unionSet(uint64_t i, uint64_t j)']]], - ['unique_49',['unique',['http://en.cppreference.com/w/cpp/memory/shared_ptr/unique.html',0,'std::shared_ptr::unique()'],['http://en.cppreference.com/w/cpp/container/list/unique.html',0,'std::list::unique()'],['http://en.cppreference.com/w/cpp/container/forward_list/unique.html',0,'std::forward_list::unique()'],['http://en.cppreference.com/w/cpp/algorithm/unique.html',0,'std::unique(T... args)']]], - ['unique_5fcopy_50',['unique_copy',['http://en.cppreference.com/w/cpp/algorithm/unique_copy.html',0,'std']]], - ['unique_5flock_51',['unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unique_lock.html',0,'std::unique_lock::unique_lock()'],['http://en.cppreference.com/w/cpp/thread/unique_lock.html',0,'std::unique_lock< T >']]], - ['unique_5fptr_52',['unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr/unique_ptr.html',0,'std::unique_ptr::unique_ptr()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr.html',0,'std::unique_ptr< T >']]], - ['unique_5fptr_3c_20binary_5fsearch_5ftree_3a_3abst_5fnode_20_3e_53',['unique_ptr< binary_search_tree::bst_node >',['http://en.cppreference.com/w/cpp/memory/unique_ptr.html',0,'std']]], - ['unit_5fmatrix_5finitialization_54',['unit_matrix_initialization',['../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4',1,'machine_learning']]], - ['unitbuf_55',['unitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], - ['unlock_56',['unlock',['http://en.cppreference.com/w/cpp/thread/mutex/unlock.html',0,'std::mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/unlock.html',0,'std::timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/unlock.html',0,'std::unique_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/unlock.html',0,'std::recursive_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock.html',0,'std::shared_timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/unlock.html',0,'std::shared_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/unlock.html',0,'std::recursive_timed_mutex::unlock()']]], - ['unlock_5fshared_57',['unlock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock_shared.html',0,'std::shared_timed_mutex']]], - ['unordered_5fmap_58',['unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std::unordered_map< K, T >'],['http://en.cppreference.com/w/cpp/container/unordered_map/unordered_map.html',0,'std::unordered_map::unordered_map()']]], - ['unordered_5fmap_3c_20char16_5ft_2c_20std_3a_3ashared_5fptr_3c_20data_5fstructures_3a_3atrie_5fusing_5fhashmap_3a_3atrie_3a_3anode_20_3e_20_3e_59',['unordered_map< char16_t, std::shared_ptr< data_structures::trie_using_hashmap::Trie::Node > >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], - ['unordered_5fmap_3c_20uint64_5ft_2c_20std_3a_3alist_3c_20uint64_5ft_20_3e_3a_3aiterator_20_3e_60',['unordered_map< uint64_t, std::list< uint64_t >::iterator >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], - ['unordered_5fmultimap_61',['unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap/unordered_multimap.html',0,'std::unordered_multimap::unordered_multimap()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap.html',0,'std::unordered_multimap< K, T >']]], - ['unordered_5fmultiset_62',['unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset/unordered_multiset.html',0,'std::unordered_multiset::unordered_multiset()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset.html',0,'std::unordered_multiset< K >']]], - ['unordered_5fset_63',['unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set.html',0,'std::unordered_set< K >'],['http://en.cppreference.com/w/cpp/container/unordered_set/unordered_set.html',0,'std::unordered_set::unordered_set()']]], - ['unordered_5fset_3c_20s_20_3e_64',['unordered_set< S >',['http://en.cppreference.com/w/cpp/container/unordered_set.html',0,'std']]], - ['unsetf_65',['unsetf',['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wiostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wfstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wstringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::strstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ios_base::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ios::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostream::unsetf()']]], - ['unshift_66',['unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::unshift()']]], - ['up_67',['up',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad',1,'graph::LowestCommonAncestor']]], - ['update_68',['update',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9',1,'range_queries::fenwick_tree::update()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d',1,'range_queries::perSegTree::update()'],['../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0',1,'update(): segtree.cpp'],['../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1',1,'data_structures::SegmentTree::update()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6',1,'range_queries::perSegTree::update()'],['../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17',1,'data_structures::SegmentTree::update()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c',1,'range_queries::heavy_light_decomposition::SG::update()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57',1,'range_queries::heavy_light_decomposition::HLD::update()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3',1,'hashing::sha256::Hash::update()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7',1,'data_structures::treap::Treap::update()']]], - ['update_5fstep_69',['update_step',['../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217',1,'extended_euclid_algorithm.cpp']]], - ['update_5fweights_70',['update_weights',['../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3',1,'machine_learning::update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)'],['../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631',1,'machine_learning::update_weights(const std::valarray< double > &x, std::vector< std::valarray< double > > *W, std::valarray< double > *D, double alpha, int R)']]], - ['upper_71',['upper',['../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5',1,'uint256_t::upper()'],['../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705',1,'uint128_t::upper()']]], - ['upper_5fbound_72',['upper_bound',['http://en.cppreference.com/w/cpp/container/multiset/upper_bound.html',0,'std::multiset::upper_bound()'],['http://en.cppreference.com/w/cpp/container/set/upper_bound.html',0,'std::set::upper_bound()'],['http://en.cppreference.com/w/cpp/algorithm/upper_bound.html',0,'std::upper_bound()'],['http://en.cppreference.com/w/cpp/container/map/upper_bound.html',0,'std::map::upper_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/upper_bound.html',0,'std::multimap::upper_bound()']]], - ['uppercase_73',['uppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], - ['use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_74',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], - ['use_5fcount_75',['use_count',['http://en.cppreference.com/w/cpp/memory/weak_ptr/use_count.html',0,'std::weak_ptr']]], - ['use_5ffacet_76',['use_facet',['http://en.cppreference.com/w/cpp/locale/use_facet.html',0,'std']]], - ['used_77',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md99',1,'']]], - ['user_20interface_78',['User-interface',['../dc/d64/md__coding_guidelines.html#autotoc_md18',1,'']]], - ['user_5finput_5ftest_79',['user_input_test',['../d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc',1,'power_of_two.cpp']]], - ['uses_5fallocator_80',['uses_allocator',['http://en.cppreference.com/w/cpp/memory/uses_allocator.html',0,'std']]], - ['util_5ffunctions_81',['util_functions',['../d3/d17/namespaceutil__functions.html',1,'']]] + ['unionset_48',['unionSet',['../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f',1,'dsu']]], + ['unionset_49',['UnionSet',['../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559',1,'dsu']]], + ['unique_50',['unique',['http://en.cppreference.com/w/cpp/memory/shared_ptr/unique.html',0,'std::shared_ptr::unique()'],['http://en.cppreference.com/w/cpp/container/forward_list/unique.html',0,'std::forward_list::unique()'],['http://en.cppreference.com/w/cpp/container/list/unique.html',0,'std::list::unique()'],['http://en.cppreference.com/w/cpp/algorithm/unique.html',0,'std::unique(T... args)']]], + ['unique_5fcopy_51',['unique_copy',['http://en.cppreference.com/w/cpp/algorithm/unique_copy.html',0,'std']]], + ['unique_5flock_52',['unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock.html',0,'std::unique_lock< T >'],['http://en.cppreference.com/w/cpp/thread/unique_lock/unique_lock.html',0,'std::unique_lock::unique_lock()']]], + ['unique_5fptr_53',['unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr.html',0,'std::unique_ptr< T >'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/unique_ptr.html',0,'std::unique_ptr::unique_ptr()']]], + ['unique_5fptr_3c_20binary_5fsearch_5ftree_3a_3abst_5fnode_20_3e_54',['unique_ptr< binary_search_tree::bst_node >',['http://en.cppreference.com/w/cpp/memory/unique_ptr.html',0,'std']]], + ['unit_5fmatrix_5finitialization_55',['unit_matrix_initialization',['../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4',1,'machine_learning']]], + ['unitbuf_56',['unitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], + ['unlock_57',['unlock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unlock.html',0,'std::unique_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/unlock.html',0,'std::recursive_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/unlock.html',0,'std::recursive_timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/unlock.html',0,'std::shared_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/unlock.html',0,'std::timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/mutex/unlock.html',0,'std::mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock.html',0,'std::shared_timed_mutex::unlock(T... args)']]], + ['unlock_5fshared_58',['unlock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock_shared.html',0,'std::shared_timed_mutex']]], + ['unordered_5fmap_59',['unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std::unordered_map< K, T >'],['http://en.cppreference.com/w/cpp/container/unordered_map/unordered_map.html',0,'std::unordered_map::unordered_map()']]], + ['unordered_5fmap_3c_20char16_5ft_2c_20std_3a_3ashared_5fptr_3c_20data_5fstructures_3a_3atrie_5fusing_5fhashmap_3a_3atrie_3a_3anode_20_3e_20_3e_60',['unordered_map< char16_t, std::shared_ptr< data_structures::trie_using_hashmap::Trie::Node > >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], + ['unordered_5fmap_3c_20uint64_5ft_2c_20std_3a_3alist_3c_20uint64_5ft_20_3e_3a_3aiterator_20_3e_61',['unordered_map< uint64_t, std::list< uint64_t >::iterator >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], + ['unordered_5fmultimap_62',['unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap.html',0,'std::unordered_multimap< K, T >'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/unordered_multimap.html',0,'std::unordered_multimap::unordered_multimap()']]], + ['unordered_5fmultiset_63',['unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset.html',0,'std::unordered_multiset< K >'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/unordered_multiset.html',0,'std::unordered_multiset::unordered_multiset()']]], + ['unordered_5fset_64',['unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set.html',0,'std::unordered_set< K >'],['http://en.cppreference.com/w/cpp/container/unordered_set/unordered_set.html',0,'std::unordered_set::unordered_set()']]], + ['unordered_5fset_3c_20s_20_3e_65',['unordered_set< S >',['http://en.cppreference.com/w/cpp/container/unordered_set.html',0,'std']]], + ['unsetf_66',['unsetf',['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ios::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ios_base::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::strstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wiostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wfstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wstringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ifstream::unsetf()']]], + ['unshift_67',['unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::unshift()']]], + ['up_68',['up',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad',1,'graph::LowestCommonAncestor']]], + ['update_69',['update',['../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1',1,'data_structures::SegmentTree::update(int i, int l, int r, int pos, T val)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17',1,'data_structures::SegmentTree::update(int pos, T val)'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7',1,'data_structures::treap::Treap::update()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3',1,'hashing::sha256::Hash::update()'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9',1,'range_queries::fenwick_tree::update()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c',1,'range_queries::heavy_light_decomposition::SG::update()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57',1,'range_queries::heavy_light_decomposition::HLD::update()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6',1,'range_queries::perSegTree::update(const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, const int64_t &value, std::shared_ptr< Node > const &curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d',1,'range_queries::perSegTree::update(const uint32_t &l, const uint32_t &r, const int64_t &value)'],['../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0',1,'update(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos): segtree.cpp']]], + ['update_5fstep_70',['update_step',['../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217',1,'extended_euclid_algorithm.cpp']]], + ['update_5fweights_71',['update_weights',['../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3',1,'machine_learning::update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)'],['../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631',1,'machine_learning::update_weights(const std::valarray< double > &x, std::vector< std::valarray< double > > *W, std::valarray< double > *D, double alpha, int R)']]], + ['upper_72',['upper',['../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705',1,'uint128_t::upper()'],['../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5',1,'uint256_t::upper()']]], + ['upper_5fbound_73',['upper_bound',['http://en.cppreference.com/w/cpp/container/multiset/upper_bound.html',0,'std::multiset::upper_bound()'],['http://en.cppreference.com/w/cpp/container/set/upper_bound.html',0,'std::set::upper_bound()'],['http://en.cppreference.com/w/cpp/container/map/upper_bound.html',0,'std::map::upper_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/upper_bound.html',0,'std::multimap::upper_bound()'],['http://en.cppreference.com/w/cpp/algorithm/upper_bound.html',0,'std::upper_bound(T... args)']]], + ['uppercase_74',['uppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], + ['use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_75',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], + ['use_5fcount_76',['use_count',['http://en.cppreference.com/w/cpp/memory/weak_ptr/use_count.html',0,'std::weak_ptr']]], + ['use_5ffacet_77',['use_facet',['http://en.cppreference.com/w/cpp/locale/use_facet.html',0,'std']]], + ['used_78',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md99',1,'']]], + ['user_20interface_79',['User-interface',['../dc/d64/md__coding_guidelines.html#autotoc_md18',1,'']]], + ['user_5finput_5ftest_80',['user_input_test',['../d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc',1,'power_of_two.cpp']]], + ['uses_5fallocator_81',['uses_allocator',['http://en.cppreference.com/w/cpp/memory/uses_allocator.html',0,'std']]], + ['util_5ffunctions_82',['util_functions',['../d3/d17/namespaceutil__functions.html',1,'']]] ]; diff --git a/search/all_1b.js b/search/all_1b.js index 819084140..34df21f24 100644 --- a/search/all_1b.js +++ b/search/all_1b.js @@ -2,16 +2,16 @@ var searchData= [ ['v_5fstack_0',['v_stack',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe',1,'divide_and_conquer::strassens_multiplication::Matrix']]], ['va_5flist_1',['va_list',['http://en.cppreference.com/w/cpp/utility/variadic/va_list.html',0,'']]], - ['val_2',['val',['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf',1,'range_queries::perSegTree::Node::val'],['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11',1,'data_structures::linked_list::link::val()'],['../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3',1,'ListNode::val']]], + ['val_2',['val',['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf',1,'range_queries::perSegTree::Node::val'],['../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3',1,'ListNode::val'],['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11',1,'data_structures::linked_list::link::val()']]], ['valarray_3',['valarray',['http://en.cppreference.com/w/cpp/numeric/valarray.html',0,'std']]], ['valarray_3c_20double_20_3e_4',['valarray< double >',['http://en.cppreference.com/w/cpp/numeric/valarray.html',0,'std']]], ['valid_5',['valid',['http://en.cppreference.com/w/cpp/thread/shared_future/valid.html',0,'std::shared_future::valid()'],['http://en.cppreference.com/w/cpp/thread/future/valid.html',0,'std::future::valid()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/valid.html',0,'std::packaged_task::valid()']]], - ['value_6',['value',['http://en.cppreference.com/w/cpp/regex/regex_traits/value.html',0,'std::regex_traits::value()'],['http://en.cppreference.com/w/cpp/experimental/optional/value.html',0,'std::experimental::optional::value()'],['../d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731',1,'data_structures::Node::value'],['http://en.cppreference.com/w/cpp/error/error_code/value.html',0,'std::error_code::value()'],['http://en.cppreference.com/w/cpp/error/error_condition/value.html',0,'std::error_condition::value()'],['../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29',1,'binary_search_tree::bst_node::value']]], - ['value_5fcomp_7',['value_comp',['http://en.cppreference.com/w/cpp/container/multiset/value_comp.html',0,'std::multiset::value_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/value_comp.html',0,'std::multimap::value_comp()'],['http://en.cppreference.com/w/cpp/container/map/value_comp.html',0,'std::map::value_comp()'],['http://en.cppreference.com/w/cpp/container/set/value_comp.html',0,'std::set::value_comp()']]], + ['value_6',['value',['../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29',1,'binary_search_tree::bst_node::value'],['../d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731',1,'data_structures::Node::value'],['http://en.cppreference.com/w/cpp/error/error_code/value.html',0,'std::error_code::value()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/value.html',0,'std::regex_traits::value()'],['http://en.cppreference.com/w/cpp/error/error_condition/value.html',0,'std::error_condition::value()'],['http://en.cppreference.com/w/cpp/experimental/optional/value.html',0,'std::experimental::optional::value()']]], + ['value_5fcomp_7',['value_comp',['http://en.cppreference.com/w/cpp/container/multiset/value_comp.html',0,'std::multiset::value_comp()'],['http://en.cppreference.com/w/cpp/container/set/value_comp.html',0,'std::set::value_comp()'],['http://en.cppreference.com/w/cpp/container/map/value_comp.html',0,'std::map::value_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/value_comp.html',0,'std::multimap::value_comp()']]], ['value_5fcompare_8',['value_compare',['http://en.cppreference.com/w/cpp/container/map/value_compare.html',0,'std::map< K, T >::value_compare'],['http://en.cppreference.com/w/cpp/container/multimap/value_compare.html',0,'std::multimap< K, T >::value_compare']]], ['value_5for_9',['value_or',['http://en.cppreference.com/w/cpp/experimental/optional/value_or.html',0,'std::experimental::optional']]], - ['values_10',['values',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::values(Node *root)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::values()'],['../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9',1,'tower::values']]], - ['variance_11',['variance',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960',1,'probability::geometric_dist::geometric_distribution::variance()'],['../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555',1,'statistics::stats_computer2::variance()'],['../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92',1,'statistics::stats_computer1::variance()']]], + ['values_10',['values',['../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9',1,'tower::values'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::values()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::values(Node *root)']]], + ['variance_11',['variance',['../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92',1,'statistics::stats_computer1::variance()'],['../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555',1,'statistics::stats_computer2::variance()'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960',1,'probability::geometric_dist::geometric_distribution::variance()']]], ['vec_12',['vec',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3',1,'range_queries::perSegTree']]], ['vector_13',['vector',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std::vector< T >'],['http://en.cppreference.com/w/cpp/container/vector/vector.html',0,'std::vector::vector()']]], ['vector_3c_20bool_20_3e_14',['vector< bool >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], diff --git a/search/all_1c.js b/search/all_1c.js index 76c6791af..89d0f1d42 100644 --- a/search/all_1c.js +++ b/search/all_1c.js @@ -1,8 +1,8 @@ var searchData= [ ['wait_0',['wait',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait.html',0,'std::condition_variable_any::wait()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait.html',0,'std::condition_variable::wait()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait.html',0,'std::shared_future::wait()'],['http://en.cppreference.com/w/cpp/thread/future/wait.html',0,'std::future::wait()']]], - ['wait_5ffor_1',['wait_for',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait_for.html',0,'std::condition_variable_any::wait_for()'],['http://en.cppreference.com/w/cpp/thread/future/wait_for.html',0,'std::future::wait_for()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait_for.html',0,'std::shared_future::wait_for()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait_for.html',0,'std::condition_variable::wait_for()']]], - ['wait_5funtil_2',['wait_until',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait_until.html',0,'std::condition_variable_any::wait_until()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait_until.html',0,'std::shared_future::wait_until()'],['http://en.cppreference.com/w/cpp/thread/future/wait_until.html',0,'std::future::wait_until()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait_until.html',0,'std::condition_variable::wait_until()']]], + ['wait_5ffor_1',['wait_for',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait_for.html',0,'std::condition_variable_any::wait_for()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait_for.html',0,'std::condition_variable::wait_for()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait_for.html',0,'std::shared_future::wait_for()'],['http://en.cppreference.com/w/cpp/thread/future/wait_for.html',0,'std::future::wait_for()']]], + ['wait_5funtil_2',['wait_until',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait_until.html',0,'std::condition_variable_any::wait_until()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait_until.html',0,'std::condition_variable::wait_until()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait_until.html',0,'std::shared_future::wait_until()'],['http://en.cppreference.com/w/cpp/thread/future/wait_until.html',0,'std::future::wait_until()']]], ['warning_3',['2. Warning',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md12',1,'']]], ['wave_5fsort_4',['wave_sort',['../d9/d21/namespacewave__sort.html',1,'']]], ['wave_5fsort_2ecpp_5',['wave_sort.cpp',['../db/d3f/wave__sort_8cpp.html',1,'']]], @@ -13,7 +13,7 @@ var searchData= ['wclog_10',['wclog',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], ['wcmatch_11',['wcmatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::wcmatch'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::wcmatch::wcmatch()']]], ['wcout_12',['wcout',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], - ['wcregex_5fiterator_13',['wcregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::wcregex_iterator::wcregex_iterator()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::wcregex_iterator']]], + ['wcregex_5fiterator_13',['wcregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::wcregex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::wcregex_iterator::wcregex_iterator()']]], ['wcregex_5ftoken_5fiterator_14',['wcregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::wcregex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::wcregex_token_iterator::wcregex_token_iterator()']]], ['wcrtomb_15',['wcrtomb',['http://en.cppreference.com/w/cpp/string/multibyte/wcrtomb.html',0,'std']]], ['wcscat_16',['wcscat',['http://en.cppreference.com/w/cpp/string/wide/wcscat.html',0,'std']]], @@ -51,12 +51,12 @@ var searchData= ['weak_5fptr_48',['weak_ptr',['http://en.cppreference.com/w/cpp/memory/weak_ptr.html',0,'std::weak_ptr< T >'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/weak_ptr.html',0,'std::weak_ptr::weak_ptr()']]], ['weibull_5fdistribution_49',['weibull_distribution',['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution.html',0,'std::weibull_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/weibull_distribution.html',0,'std::weibull_distribution::weibull_distribution()']]], ['weights_50',['weights',['../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492',1,'machine_learning::adaline']]], - ['wfilebuf_51',['wfilebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::wfilebuf::wfilebuf()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std::wfilebuf']]], + ['wfilebuf_51',['wfilebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std::wfilebuf'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::wfilebuf::wfilebuf()']]], ['wfstream_52',['wfstream',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std::wfstream'],['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::wfstream::wfstream()']]], - ['what_53',['what',['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::logic_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_alloc::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_function_call::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::range_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::invalid_argument::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ios_base::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::out_of_range::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::domain_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::overflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::strstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::future_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_cast::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wiostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::exception::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_optional_access::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_weak_ptr::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wfstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::underflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wstringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::regex_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::system_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::length_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::runtime_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_typeid::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_new_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ios::failure::what()']]], + ['what_53',['what',['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::runtime_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_new_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_typeid::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ios::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::logic_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_alloc::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_function_call::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::range_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::invalid_argument::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ios_base::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::out_of_range::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::domain_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::overflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::strstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::future_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_cast::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wiostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::exception::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_optional_access::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_weak_ptr::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wfstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::underflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wstringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::regex_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::system_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::length_error::what()']]], ['white_54',['WHITE',['../da/d4b/depth__first__search__with__stack_8cpp.html#afb80b42b42381658a12a57a975ecd0c7',1,'depth_first_search_with_stack.cpp']]], - ['widen_55',['widen',['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::strstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wiostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istringstream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wfstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wstringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ios::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::fstream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_fstream::widen()']]], - ['width_56',['width',['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ios_base::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::strstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wiostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wfstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wstringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::fstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ios::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_fstream::width()']]], + ['widen_55',['widen',['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ofstream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::fstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ios::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_fstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::strstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wiostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istringstream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wfstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wstringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ifstream::widen()']]], + ['width_56',['width',['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::fstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ios::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_fstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ios_base::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::strstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wiostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wfstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wstringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ifstream::width()']]], ['wifstream_57',['wifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std::wifstream'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::wifstream::wifstream()']]], ['wiggle_5fsort_58',['wiggle_sort',['../d0/d52/namespacewiggle__sort.html',1,'']]], ['wiggle_5fsort_2ecpp_59',['wiggle_sort.cpp',['../d1/dcc/wiggle__sort_8cpp.html',1,'']]], @@ -65,16 +65,16 @@ var searchData= ['wildcard_5fmatching_2ecpp_62',['wildcard_matching.cpp',['../dc/d14/wildcard__matching_8cpp.html',1,'']]], ['windowed_5fmedian_63',['windowed_median',['../dd/d21/namespacewindowed__median.html',1,'']]], ['windowed_5fmedian_2ecpp_64',['windowed_median.cpp',['../d1/ded/windowed__median_8cpp.html',1,'']]], - ['windowedmedian_65',['windowedmedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d',1,'probability::windowed_median::WindowedMedian::WindowedMedian()'],['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html',1,'probability::windowed_median::WindowedMedian']]], + ['windowedmedian_65',['WindowedMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html',1,'probability::windowed_median::WindowedMedian'],['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d',1,'probability::windowed_median::WindowedMedian::WindowedMedian()']]], ['wiostream_66',['wiostream',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std::wiostream'],['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::wiostream::wiostream()']]], ['wistream_67',['wistream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std::wistream'],['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::wistream::wistream()']]], - ['wistringstream_68',['wistringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::wistringstream::wistringstream()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std::wistringstream']]], + ['wistringstream_68',['wistringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std::wistringstream'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::wistringstream::wistringstream()']]], ['wmemchr_69',['wmemchr',['http://en.cppreference.com/w/cpp/string/wide/wmemchr.html',0,'std']]], ['wmemcmp_70',['wmemcmp',['http://en.cppreference.com/w/cpp/string/wide/wmemcmp.html',0,'std']]], ['wmemcpy_71',['wmemcpy',['http://en.cppreference.com/w/cpp/string/wide/wmemcpy.html',0,'std']]], ['wmemmove_72',['wmemmove',['http://en.cppreference.com/w/cpp/string/wide/wmemmove.html',0,'std']]], ['wmemset_73',['wmemset',['http://en.cppreference.com/w/cpp/string/wide/wmemset.html',0,'std']]], - ['wofstream_74',['wofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::wofstream::wofstream()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std::wofstream']]], + ['wofstream_74',['wofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std::wofstream'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::wofstream::wofstream()']]], ['word_5fbreak_75',['word_break',['../d6/d53/namespaceword__break.html',1,'']]], ['word_5fbreak_2ecpp_76',['word_break.cpp',['../d3/d84/word__break_8cpp.html',1,'']]], ['word_5fend_77',['word_end',['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a3cdb077745d3dc97212d693132371219',1,'data_structures::trie_using_hashmap::Trie::Node']]], @@ -83,18 +83,18 @@ var searchData= ['wostream_80',['wostream',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std::wostream'],['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::wostream::wostream()']]], ['wostringstream_81',['wostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std::wostringstream'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::wostringstream::wostringstream()']]], ['wprintf_82',['wprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], - ['wregex_83',['wregex',['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::wregex::wregex()'],['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std::wregex']]], - ['write_84',['write',['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wstringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wfstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostrstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wiostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::strstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostringstream::write()']]], + ['wregex_83',['wregex',['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std::wregex'],['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::wregex::wregex()']]], + ['write_84',['write',['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::strstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wiostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostrstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wfstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wstringstream::write()']]], ['ws_85',['ws',['http://en.cppreference.com/w/cpp/io/manip/ws.html',0,'std']]], ['wscanf_86',['wscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]], ['wsmatch_87',['wsmatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::wsmatch'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::wsmatch::wsmatch()']]], ['wsregex_5fiterator_88',['wsregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::wsregex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::wsregex_iterator::wsregex_iterator()']]], - ['wsregex_5ftoken_5fiterator_89',['wsregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::wsregex_token_iterator::wsregex_token_iterator()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::wsregex_token_iterator']]], + ['wsregex_5ftoken_5fiterator_89',['wsregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::wsregex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::wsregex_token_iterator::wsregex_token_iterator()']]], ['wssub_5fmatch_90',['wssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::wssub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::wssub_match::wssub_match()']]], ['wstreambuf_91',['wstreambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std::wstreambuf'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::wstreambuf::wstreambuf()']]], ['wstreampos_92',['wstreampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], ['wstring_93',['wstring',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::wstring'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::wstring::wstring()']]], - ['wstring_5fconvert_94',['wstring_convert',['http://en.cppreference.com/w/cpp/locale/wstring_convert/wstring_convert.html',0,'std::wstring_convert::wstring_convert()'],['http://en.cppreference.com/w/cpp/locale/wstring_convert.html',0,'std::wstring_convert']]], - ['wstringbuf_95',['wstringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::wstringbuf::wstringbuf()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std::wstringbuf']]], - ['wstringstream_96',['wstringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::wstringstream::wstringstream()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std::wstringstream']]] + ['wstring_5fconvert_94',['wstring_convert',['http://en.cppreference.com/w/cpp/locale/wstring_convert.html',0,'std::wstring_convert'],['http://en.cppreference.com/w/cpp/locale/wstring_convert/wstring_convert.html',0,'std::wstring_convert::wstring_convert()']]], + ['wstringbuf_95',['wstringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std::wstringbuf'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::wstringbuf::wstringbuf()']]], + ['wstringstream_96',['wstringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std::wstringstream'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::wstringstream::wstringstream()']]] ]; diff --git a/search/all_1d.js b/search/all_1d.js index 38fede36c..78990c2c9 100644 --- a/search/all_1d.js +++ b/search/all_1d.js @@ -2,7 +2,7 @@ var searchData= [ ['x_0',['x',['../d8/dc8/struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7',1,'Point']]], ['x_5f_1',['X_',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581',1,'machine_learning::k_nearest_neighbors::Knn']]], - ['xalloc_2',['xalloc',['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ifstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::fstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ios::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_fstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::iostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ios_base::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wistream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::stringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wifstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_istream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::strstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_stringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istrstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wiostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_istringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ifstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wistringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostrstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wfstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_iostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wstringstream::xalloc()']]], + ['xalloc_2',['xalloc',['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::fstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ios::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_fstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::iostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ios_base::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wistream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::stringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wifstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_istream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::strstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_stringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istrstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wiostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_istringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ifstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostrstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wfstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_iostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wstringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wistringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ifstream::xalloc()']]], ['xor_3',['XOR',['../d7/d47/namespace_x_o_r.html',1,'']]], ['xor_5fcipher_2ecpp_4',['xor_cipher.cpp',['../d3/d4c/xor__cipher_8cpp.html',1,'']]], ['xsgetn_5',['xsgetn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_filebuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstringbuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::stringbuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wfilebuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstreambuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::strstreambuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_stringbuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_streambuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::filebuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::streambuf::xsgetn()']]], diff --git a/search/all_1e.js b/search/all_1e.js index d121a44cd..a5da38258 100644 --- a/search/all_1e.js +++ b/search/all_1e.js @@ -1,6 +1,6 @@ var searchData= [ - ['y_0',['y',['../d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8',1,'Point::y'],['../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7',1,'Point::y']]], + ['y_0',['y',['../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7',1,'Point::y'],['../d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8',1,'Point::y']]], ['y_5f_1',['Y_',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a209383503fb6c03afac405a80bace964',1,'machine_learning::k_nearest_neighbors::Knn']]], ['year_2',['year',['../d1/df6/class_easter_year_month_day.html#a28d3cd09391390250932b7fb58fe61dc',1,'EasterYearMonthDay']]], ['yield_3',['yield',['http://en.cppreference.com/w/cpp/thread/yield.html',0,'std::this_thread']]], diff --git a/search/all_5.js b/search/all_5.js index c538fe733..efaa9a0eb 100644 --- a/search/all_5.js +++ b/search/all_5.js @@ -15,7 +15,7 @@ var searchData= ['_5fsortedvalues_12',['_sortedValues',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de',1,'probability::windowed_median::WindowedMedian']]], ['_5ftarget_13',['_target',['../dc/dfe/ternary__search_8cpp.html#a23ad617bfce1e7cf4591059c85c1a027',1,'ternary_search.cpp']]], ['_5ftrz_14',['_trz',['../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e',1,'uint128_t::_trz()'],['../d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250',1,'uint256_t::_trz()']]], - ['_5fuse_5fmath_5fdefines_15',['_use_math_defines',['../da/d77/spirograph_8cpp.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES: spirograph.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES: brent_method_extrema.cpp']]], + ['_5fuse_5fmath_5fdefines_15',['_USE_MATH_DEFINES',['../da/d77/spirograph_8cpp.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES: spirograph.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES: brent_method_extrema.cpp']]], ['_5fwindow_16',['_window',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2',1,'probability::windowed_median::WindowedMedian']]], ['_5fwindowsize_17',['_windowSize',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750',1,'probability::windowed_median::WindowedMedian']]] ]; diff --git a/search/all_6.js b/search/all_6.js index 63add9796..15eb24859 100644 --- a/search/all_6.js +++ b/search/all_6.js @@ -1,164 +1,166 @@ var searchData= [ - ['a_0',['a',['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/params.html',0,'std::cauchy_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/params.html',0,'std::uniform_real_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/params.html',0,'std::extreme_value_distribution::a()'],['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e',1,'data_structures::sparse_table::Sparse_table::A'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/params.html',0,'std::uniform_int_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/params.html',0,'std::weibull_distribution::a()']]], - ['a_20new_20directory_1',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], - ['a_20program_2',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]], - ['a_20right_20node_20subtree_3',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], - ['a_20tree_4',['a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md96',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md102',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Preorder Traversal of a tree']]], - ['a1z26_5',['a1z26',['../d8/d2a/namespacea1z26.html',1,'']]], - ['a1z26_5fcipher_2ecpp_6',['a1z26_cipher.cpp',['../de/db6/a1z26__cipher_8cpp.html',1,'']]], - ['a_5fstar_5fsearch_7',['a_star_search',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201',1,'machine_learning::aystar_search::AyStarSearch']]], - ['abbreviation_8',['abbreviation',['../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8',1,'dynamic_programming::abbreviation::abbreviation()'],['../d0/df8/namespaceabbreviation.html',1,'abbreviation']]], - ['abbreviation_2ecpp_9',['abbreviation.cpp',['../d7/d73/abbreviation_8cpp.html',1,'']]], - ['abbreviation_5frecursion_10',['abbreviation_recursion',['../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa',1,'dynamic_programming::abbreviation']]], - ['abort_11',['abort',['http://en.cppreference.com/w/cpp/utility/program/abort.html',0,'std']]], - ['abs_12',['abs',['../da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556',1,'Complex']]], - ['abs_28float_29_13',['abs(float)',['http://en.cppreference.com/w/cpp/numeric/math/fabs.html',0,'std']]], - ['abs_28int_29_14',['abs(int)',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]], - ['absoluteprecision_15',['absolutePrecision',['../dc/dfe/ternary__search_8cpp.html#ae01eda5098801bb6b5b778828fb4fddc',1,'ternary_search.cpp']]], - ['accumulate_16',['accumulate',['http://en.cppreference.com/w/cpp/algorithm/accumulate.html',0,'std']]], - ['accuracy_17',['accuracy',['../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3',1,'machine_learning::adaline::accuracy'],['../da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY: durand_kerner_roots.cpp']]], - ['acos_18',['acos',['http://en.cppreference.com/w/cpp/numeric/math/acos.html',0,'std']]], - ['acosh_19',['acosh',['http://en.cppreference.com/w/cpp/numeric/math/acosh.html',0,'std']]], - ['actions_20',['GitHub Actions',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40',1,'']]], - ['activation_21',['activation',['../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325',1,'machine_learning::adaline']]], - ['activations_22',['activations',['../d5/d39/namespaceactivations.html',1,'']]], - ['adaline_23',['adaline',['../d6/d30/classmachine__learning_1_1adaline.html',1,'machine_learning::adaline'],['../d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c',1,'machine_learning::adaline::adaline()']]], - ['adaline_5flearning_2ecpp_24',['adaline_learning.cpp',['../d5/db0/adaline__learning_8cpp.html',1,'']]], - ['add_25',['add',['../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3',1,'add(): uint128_t.hpp'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::add()'],['../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff',1,'hash_chain::add()'],['../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a',1,'double_hashing::add()'],['../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1',1,'linear_probing::add()'],['../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9',1,'quadratic_probing::add()'],['../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35',1,'add(): string_fibonacci.cpp'],['../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c',1,'data_structures::Bitset::add()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840',1,'data_structures::BloomFilter::add()']]], - ['add_5fconst_26',['add_const',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]], - ['add_5fcv_27',['add_cv',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]], - ['add_5fdigit_28',['add_digit',['../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615',1,'large_number']]], - ['add_5fedge_29',['add_edge',['../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19',1,'graph::Graph::add_edge()'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d',1,'range_queries::heavy_light_decomposition::Tree::add_edge()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79',1,'greedy_algorithms::dijkstra::Graph::add_edge()']]], - ['add_5flvalue_5freference_30',['add_lvalue_reference',['http://en.cppreference.com/w/cpp/types/add_reference.html',0,'std']]], - ['add_5fpointer_31',['add_pointer',['http://en.cppreference.com/w/cpp/types/add_pointer.html',0,'std']]], - ['add_5frvalue_5freference_32',['add_rvalue_reference',['http://en.cppreference.com/w/cpp/types/add_reference.html',0,'std']]], - ['add_5fstrings_33',['add_strings',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20',1,'divide_and_conquer::karatsuba_algorithm']]], - ['add_5fvolatile_34',['add_volatile',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]], - ['addedge_35',['addedge',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad8c10df34357b2cd865c81e0c4f0bd8c',1,'graph::is_graph_bipartite::Graph::addEdge()'],['../da/d4b/depth__first__search__with__stack_8cpp.html#aadebe9c855821d6515ca5b171222ef7b',1,'graph::depth_first_search::addEdge()'],['../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2',1,'graph::addEdge()'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf',1,'graph::bidirectional_dijkstra::addEdge()'],['../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a',1,'graph::HKGraph::addEdge()'],['../df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08',1,'graph::addEdge()'],['../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910',1,'Graph::addEdge()'],['../df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a',1,'graph::addEdge()'],['../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5',1,'Graph::addEdge()']]], - ['addinfo_36',['addinfo',['../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768',1,'quadratic_probing::addInfo()'],['../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560',1,'double_hashing::addInfo()'],['../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908',1,'linear_probing::addInfo()']]], - ['addition_37',['addition',['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf',1,'ciphers::elliptic_curve_key_exchange']]], - ['addition_5frule_2ecpp_38',['addition_rule.cpp',['../d6/d4a/addition__rule_8cpp.html',1,'']]], - ['addition_5frule_5fdependent_39',['addition_rule_dependent',['../d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0',1,'addition_rule.cpp']]], - ['addition_5frule_5findependent_40',['addition_rule_independent',['../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d',1,'addition_rule.cpp']]], - ['addprocess_41',['addProcess',['../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69',1,'FCFS']]], - ['address_42',['address',['http://en.cppreference.com/w/cpp/memory/allocator/address.html',0,'std::allocator']]], - ['address_20of_20parent_20nodes_43',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], - ['addressing_44',['Open Addressing',['../d4/d39/group__open__addressing.html',1,'']]], - ['addressof_45',['addressof',['http://en.cppreference.com/w/cpp/memory/addressof.html',0,'std']]], - ['addvertices_46',['addVertices',['../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413',1,'Graph']]], - ['adj_47',['adj',['../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f',1,'graph::HKGraph::adj'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f',1,'graph::is_graph_bipartite::Graph::adj']]], - ['adjacency_5flist_48',['adjacency_list',['../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0',1,'graph::Graph']]], - ['adjacent_5fdifference_49',['adjacent_difference',['http://en.cppreference.com/w/cpp/algorithm/adjacent_difference.html',0,'std']]], - ['adjacent_5ffind_50',['adjacent_find',['http://en.cppreference.com/w/cpp/algorithm/adjacent_find.html',0,'std']]], - ['adopt_5flock_5ft_51',['adopt_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], - ['advance_52',['advance',['http://en.cppreference.com/w/cpp/iterator/advance.html',0,'std']]], - ['algorithm_53',['algorithm',['../d3/df9/recursive__bubble__sort_8cpp.html#autotoc_md113',1,'Algorithm'],['../d8/d7a/sha1_8cpp.html#autotoc_md85',1,'Algorithm'],['../da/d52/minimum__edit__distance_8cpp.html#autotoc_md75',1,'Algorithm'],['../da/dc3/linked__list_8cpp.html#autotoc_md41',1,'Algorithm'],['../dc/dfb/atbash__cipher_8cpp.html#autotoc_md0',1,'Algorithm'],['../d6/d2c/caesar__cipher_8cpp.html#autotoc_md1',1,'Algorithm'],['../dd/d12/vigenere__cipher_8cpp.html#autotoc_md2',1,'Algorithm'],['../d3/d4c/xor__cipher_8cpp.html#autotoc_md3',1,'Algorithm'],['../d7/d00/list__array_8cpp.html#autotoc_md42',1,'Algorithm'],['../d2/d26/count__inversions_8cpp.html#autotoc_md112',1,'Algorithm'],['../d5/ddb/bogo__sort_8cpp.html#autotoc_md111',1,'Algorithm'],['../d5/d45/sublist__search_8cpp.html#autotoc_md109',1,'Algorithm'],['../d1/ded/windowed__median_8cpp.html#autotoc_md103',1,'Algorithm'],['../d8/df0/queue__using__array_8cpp.html#autotoc_md43',1,'Algorithm'],['../d4/d8d/jarvis__algorithm_8cpp.html#autotoc_md76',1,'Algorithm'],['../d6/d05/reverse__a__linked__list_8cpp.html#autotoc_md44',1,'Algorithm'],['../d8/d99/connected__components__with__dsu_8cpp.html#autotoc_md77',1,'Algorithm'],['../db/dca/kadane2_8cpp.html#autotoc_md74',1,'Algorithm'],['../db/d16/0__1__knapsack_8cpp.html#autotoc_md69',1,'Algorithm'],['../d7/d73/abbreviation_8cpp.html#autotoc_md70',1,'Algorithm'],['../d5/d33/gram__schmidt_8cpp.html#autotoc_md89',1,'Algorithm'],['../d4/d38/power__of__two_8cpp.html#autotoc_md87',1,'Algorithm'],['../dd/d47/namespacemath.html#autotoc_md86',1,'Algorithm'],['../d6/d10/cut__rod_8cpp.html#autotoc_md73',1,'Algorithm'],['../d5/d96/md5_8cpp.html#autotoc_md84',1,'Algorithm'],['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md83',1,'Algorithm'],['../d5/d4c/group__sorting.html',1,'Sorting Algorithm']]], - ['algorithm_20explanation_54',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md98',1,'']]], - ['algorithms_55',['algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'Cpu Scheduling Algorithms'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'Greedy Algorithms'],['../d9/d66/group__machine__learning.html',1,'Machine Learning Algorithms']]], - ['algorithms_20c_56',['The Algorithms - C++',['../index.html',1,'']]], - ['align_57',['align',['http://en.cppreference.com/w/cpp/memory/align.html',0,'std']]], - ['aligned_5fstorage_58',['aligned_storage',['http://en.cppreference.com/w/cpp/types/aligned_storage.html',0,'std']]], - ['aligned_5funion_59',['aligned_union',['http://en.cppreference.com/w/cpp/types/aligned_union.html',0,'std']]], - ['alignment_5fof_60',['alignment_of',['http://en.cppreference.com/w/cpp/types/alignment_of.html',0,'std']]], - ['aliquot_5fsum_61',['aliquot_sum',['../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf',1,'math']]], - ['aliquot_5fsum_2ecpp_62',['aliquot_sum.cpp',['../de/d99/aliquot__sum_8cpp.html',1,'']]], - ['all_63',['all',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], - ['all_5fof_64',['all_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], - ['allocate_65',['allocate',['http://en.cppreference.com/w/cpp/memory/allocator_traits/allocate.html',0,'std::allocator_traits::allocate()'],['http://en.cppreference.com/w/cpp/memory/allocator/allocate.html',0,'std::allocator::allocate()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/allocate.html',0,'std::scoped_allocator_adaptor::allocate()']]], - ['allocate_5fshared_66',['allocate_shared',['http://en.cppreference.com/w/cpp/memory/shared_ptr/allocate_shared.html',0,'std']]], - ['allocator_67',['allocator',['http://en.cppreference.com/w/cpp/memory/allocator/allocator.html',0,'std::allocator::allocator()'],['http://en.cppreference.com/w/cpp/memory/allocator.html',0,'std::allocator< T >']]], - ['allocator_5farg_5ft_68',['allocator_arg_t',['http://en.cppreference.com/w/cpp/memory/allocator_arg_t.html',0,'std']]], - ['allocator_5ftraits_69',['allocator_traits',['http://en.cppreference.com/w/cpp/memory/allocator_traits.html',0,'std']]], - ['alpha_70',['alpha',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]], - ['always_5fnoconv_71',['always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::always_noconv()']]], - ['analyzer_72',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]], - ['and_20conquer_73',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]], - ['and_20maintainers_74',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]], - ['and_20not_20matching_20edges_75',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]], - ['and_5ftest_76',['and_test',['../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9',1,'boyer_moore.cpp']]], - ['ans_77',['ans',['../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa',1,'matrix_exponentiation.cpp']]], - ['any_78',['any',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], - ['any_5fof_79',['any_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], - ['aplhabet_5fsize_80',['APLHABET_SIZE',['../d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd',1,'boyer_moore.cpp']]], - ['append_81',['append',['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u32string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::basic_string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::wstring::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u16string::append()']]], - ['apply_5ffunction_82',['apply_function',['../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb',1,'machine_learning']]], - ['approximate_5fpi_83',['approximate_pi',['../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188',1,'math']]], - ['approximate_5fpi_2ecpp_84',['approximate_pi.cpp',['../d0/d51/approximate__pi_8cpp.html',1,'']]], - ['are_5falmost_5fequal_85',['are_almost_equal',['../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703',1,'others']]], - ['are_5famicable_86',['are_amicable',['../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec',1,'math']]], - ['area_2ecpp_87',['area.cpp',['../dc/d82/area_8cpp.html',1,'']]], - ['arg_88',['arg',['../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41',1,'Complex']]], - ['argmax_89',['argmax',['../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec',1,'machine_learning']]], - ['armstrong_5fnumber_2ecpp_90',['armstrong_number.cpp',['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html',1,'']]], - ['arr_91',['arr',['../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b',1,'data_structures::trie::arr'],['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d',1,'data_structures::queue_using_array::Queue_Array::arr']]], - ['array_92',['array',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], - ['array_3c_20data_5fstructures_3a_3atree_5f234_3a_3anode_20_2a_2c_204_20_3e_93',['array< data_structures::tree_234::Node *, 4 >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], - ['array_3c_20float_2c_2020_20_3e_94',['array< float, 20 >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], - ['array_3c_20int_2c_20maxnode_20_3e_95',['array< int, maxNode >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], - ['array_3c_20int16_5ft_2c_20max_5fsize_20_3e_96',['array< int16_t, max_size >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], - ['array_3c_20int64_5ft_2c_203_20_3e_97',['array< int64_t, 3 >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], - ['array_3c_20int64_5ft_2c_20n_20_3e_98',['array< int64_t, N >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], - ['array_3c_20std_3a_3aarray_3c_20int_2c_202_20_3e_2c_20maxnode_20_3e_99',['array< std::array< int, 2 >, maxNode >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], - ['array_3c_20std_3a_3aarray_3c_20int64_5ft_2c_20n_20_3e_2c_20m_20_3e_100',['array< std::array< int64_t, N >, M >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], - ['array_3c_20std_3a_3aarray_3c_20uint32_5ft_2c_203_20_3e_2c_203_20_3e_101',['array< std::array< uint32_t, 3 >, 3 >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], - ['array_3c_20uint32_5ft_2c_208_20_3e_102',['array< uint32_t, 8 >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], - ['array_3c_20uint64_5ft_2c_20n_20_3e_103',['array< uint64_t, N >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], - ['array_5fleft_5frotation_2ecpp_104',['array_left_rotation.cpp',['../d9/d14/array__left__rotation_8cpp.html',1,'']]], - ['array_5fright_5frotation_2ecpp_105',['array_right_rotation.cpp',['../d6/d57/array__right__rotation_8cpp.html',1,'']]], - ['asctime_106',['asctime',['http://en.cppreference.com/w/cpp/chrono/c/asctime.html',0,'std']]], - ['asin_107',['asin',['http://en.cppreference.com/w/cpp/numeric/math/asin.html',0,'std']]], - ['asinh_108',['asinh',['http://en.cppreference.com/w/cpp/numeric/math/asinh.html',0,'std']]], - ['ask_5fdata_109',['ask_data',['../dd/d92/memory__game_8cpp.html#a5714d97649c0edd57b4fb449799676a3',1,'games::memory_game']]], - ['assertarray_110',['assertArray',['../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a',1,'quadratic_equations_complex_numbers.cpp']]], - ['assign_111',['assign',['http://en.cppreference.com/w/cpp/error/error_code/assign.html',0,'std::error_code::assign()'],['http://en.cppreference.com/w/cpp/container/vector/assign.html',0,'std::vector::assign()'],['http://en.cppreference.com/w/cpp/string/char_traits/assign.html',0,'std::char_traits::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::string::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::regex::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u32string::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::basic_regex::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::wregex::assign()'],['http://en.cppreference.com/w/cpp/container/forward_list/assign.html',0,'std::forward_list::assign()'],['http://en.cppreference.com/w/cpp/container/list/assign.html',0,'std::list::assign()'],['http://en.cppreference.com/w/cpp/container/deque/assign.html',0,'std::deque::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::basic_string::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::wstring::assign()'],['http://en.cppreference.com/w/cpp/utility/functional/function/assign.html',0,'std::function::assign()'],['http://en.cppreference.com/w/cpp/error/error_condition/assign.html',0,'std::error_condition::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u16string::assign()']]], - ['assign_5fresults_112',['assign_results',['../dd/d92/memory__game_8cpp.html#a3ceeea62d8fa6c563e2c66359fd73413',1,'games::memory_game']]], - ['async_113',['async',['http://en.cppreference.com/w/cpp/thread/async.html',0,'std']]], - ['at_114',['at',['http://en.cppreference.com/w/cpp/container/dynarray/at.html',0,'std::dynarray::at()'],['http://en.cppreference.com/w/cpp/container/vector/at.html',0,'std::vector::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::string::at()'],['http://en.cppreference.com/w/cpp/container/unordered_map/at.html',0,'std::unordered_map::at()'],['http://en.cppreference.com/w/cpp/container/deque/at.html',0,'std::deque::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::basic_string::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::wstring::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u16string::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u32string::at()'],['http://en.cppreference.com/w/cpp/container/map/at.html',0,'std::map::at()'],['http://en.cppreference.com/w/cpp/container/array/at.html',0,'std::array::at()']]], - ['at_5fquick_5fexit_115',['at_quick_exit',['http://en.cppreference.com/w/cpp/utility/program/at_quick_exit.html',0,'std']]], - ['atan_116',['atan',['http://en.cppreference.com/w/cpp/numeric/math/atan.html',0,'std']]], - ['atan2_117',['atan2',['http://en.cppreference.com/w/cpp/numeric/math/atan2.html',0,'std']]], - ['atanh_118',['atanh',['http://en.cppreference.com/w/cpp/numeric/math/atanh.html',0,'std']]], - ['atbash_119',['atbash',['../de/db3/namespaceatbash.html',1,'']]], - ['atbash_5fcipher_120',['atbash_cipher',['../dc/dfb/atbash__cipher_8cpp.html#a8f7dd4dcd3df7c512c20482afc2dbb9d',1,'ciphers::atbash']]], - ['atbash_5fcipher_2ecpp_121',['atbash_cipher.cpp',['../dc/dfb/atbash__cipher_8cpp.html',1,'']]], - ['atexit_122',['atexit',['http://en.cppreference.com/w/cpp/utility/program/atexit.html',0,'std']]], - ['atof_123',['atof',['http://en.cppreference.com/w/cpp/string/byte/atof.html',0,'std']]], - ['atoi_124',['atoi',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]], - ['atol_125',['atol',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]], - ['atoll_126',['atoll',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]], - ['atomic_127',['atomic',['http://en.cppreference.com/w/cpp/atomic/atomic.html',0,'std::atomic< T >'],['http://en.cppreference.com/w/cpp/atomic/atomic/atomic.html',0,'std::atomic::atomic()']]], - ['atomic_5fcompare_5fexchange_5fstrong_128',['atomic_compare_exchange_strong',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], - ['atomic_5fcompare_5fexchange_5fstrong_5fexplicit_129',['atomic_compare_exchange_strong_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], - ['atomic_5fcompare_5fexchange_5fweak_130',['atomic_compare_exchange_weak',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], - ['atomic_5fcompare_5fexchange_5fweak_5fexplicit_131',['atomic_compare_exchange_weak_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], - ['atomic_5fexchange_132',['atomic_exchange',['http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html',0,'std']]], - ['atomic_5fexchange_5fexplicit_133',['atomic_exchange_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html',0,'std']]], - ['atomic_5ffetch_5fadd_134',['atomic_fetch_add',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html',0,'std']]], - ['atomic_5ffetch_5fadd_5fexplicit_135',['atomic_fetch_add_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html',0,'std']]], - ['atomic_5ffetch_5fand_136',['atomic_fetch_and',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], - ['atomic_5ffetch_5fand_5fexplicit_137',['atomic_fetch_and_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], - ['atomic_5ffetch_5for_138',['atomic_fetch_or',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html',0,'std']]], - ['atomic_5ffetch_5for_5fexplicit_139',['atomic_fetch_or_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html',0,'std']]], - ['atomic_5ffetch_5fsub_140',['atomic_fetch_sub',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], - ['atomic_5ffetch_5fsub_5fexplicit_141',['atomic_fetch_sub_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], - ['atomic_5ffetch_5fxor_142',['atomic_fetch_xor',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html',0,'std']]], - ['atomic_5ffetch_5fxor_5fexplicit_143',['atomic_fetch_xor_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html',0,'std']]], - ['atomic_5fflag_144',['atomic_flag',['http://en.cppreference.com/w/cpp/atomic/atomic_flag.html',0,'std::atomic_flag'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/atomic_flag.html',0,'std::atomic_flag::atomic_flag()']]], - ['atomic_5finit_145',['atomic_init',['http://en.cppreference.com/w/cpp/atomic/atomic_init.html',0,'std']]], - ['atomic_5fis_5flock_5ffree_146',['atomic_is_lock_free',['http://en.cppreference.com/w/cpp/atomic/atomic_is_lock_free.html',0,'std']]], - ['atomic_5fload_147',['atomic_load',['http://en.cppreference.com/w/cpp/atomic/atomic_load.html',0,'std']]], - ['atomic_5fload_5fexplicit_148',['atomic_load_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_load.html',0,'std']]], - ['atomic_5fsignal_5ffence_149',['atomic_signal_fence',['http://en.cppreference.com/w/cpp/atomic/atomic_signal_fence.html',0,'std']]], - ['atomic_5fstore_150',['atomic_store',['http://en.cppreference.com/w/cpp/atomic/atomic_store.html',0,'std']]], - ['atomic_5fstore_5fexplicit_151',['atomic_store_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_store.html',0,'std']]], - ['atomic_5fthread_5ffence_152',['atomic_thread_fence',['http://en.cppreference.com/w/cpp/atomic/atomic_thread_fence.html',0,'std']]], - ['attribution_153',['Attribution',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md15',1,'']]], - ['augmenting_20paths_154',['Augmenting paths',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md81',1,'']]], - ['auto_5fptr_155',['auto_ptr',['http://en.cppreference.com/w/cpp/memory/auto_ptr.html',0,'std::auto_ptr< T >'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/auto_ptr.html',0,'std::auto_ptr::auto_ptr()']]], - ['auxiliary_5fq_156',['auxiliary_q',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323',1,'data_structures::stack_using_queue::Stack']]], - ['availarray_157',['AvailArray',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c',1,'linkedlist_implentation_usingarray.cpp']]], - ['avltree_2ecpp_158',['avltree.cpp',['../d8/dee/avltree_8cpp.html',1,'']]], - ['aystar_5fsearch_159',['aystar_search',['../db/ddc/namespaceaystar__search.html',1,'']]], - ['aystarsearch_160',['aystarsearch',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html',1,'machine_learning::aystar_search::AyStarSearch< Puzzle >'],['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e',1,'machine_learning::aystar_search::AyStarSearch::AyStarSearch()']]] + ['a_0',['A',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e',1,'data_structures::sparse_table::Sparse_table']]], + ['a_1',['a',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/params.html',0,'std::extreme_value_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/params.html',0,'std::uniform_real_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/params.html',0,'std::weibull_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/params.html',0,'std::uniform_int_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/params.html',0,'std::cauchy_distribution::a()']]], + ['a_20new_20directory_2',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], + ['a_20program_3',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]], + ['a_20right_20node_20subtree_4',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['a_20tree_5',['A tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md96',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md102',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Preorder Traversal of a tree']]], + ['a1z26_6',['a1z26',['../d8/d2a/namespacea1z26.html',1,'']]], + ['a1z26_5fcipher_2ecpp_7',['a1z26_cipher.cpp',['../de/db6/a1z26__cipher_8cpp.html',1,'']]], + ['a_5fstar_5fsearch_8',['a_star_search',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201',1,'machine_learning::aystar_search::AyStarSearch']]], + ['abbreviation_9',['abbreviation',['../d0/df8/namespaceabbreviation.html',1,'abbreviation'],['../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8',1,'dynamic_programming::abbreviation::abbreviation()']]], + ['abbreviation_2ecpp_10',['abbreviation.cpp',['../d7/d73/abbreviation_8cpp.html',1,'']]], + ['abbreviation_5frecursion_11',['abbreviation_recursion',['../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa',1,'dynamic_programming::abbreviation']]], + ['abort_12',['abort',['http://en.cppreference.com/w/cpp/utility/program/abort.html',0,'std']]], + ['abs_13',['abs',['../da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556',1,'Complex']]], + ['abs_28float_29_14',['abs(float)',['http://en.cppreference.com/w/cpp/numeric/math/fabs.html',0,'std']]], + ['abs_28int_29_15',['abs(int)',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]], + ['absoluteprecision_16',['absolutePrecision',['../dc/dfe/ternary__search_8cpp.html#ae01eda5098801bb6b5b778828fb4fddc',1,'ternary_search.cpp']]], + ['accumulate_17',['accumulate',['http://en.cppreference.com/w/cpp/algorithm/accumulate.html',0,'std']]], + ['accuracy_18',['accuracy',['../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3',1,'machine_learning::adaline']]], + ['accuracy_19',['ACCURACY',['../da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689',1,'durand_kerner_roots.cpp']]], + ['acos_20',['acos',['http://en.cppreference.com/w/cpp/numeric/math/acos.html',0,'std']]], + ['acosh_21',['acosh',['http://en.cppreference.com/w/cpp/numeric/math/acosh.html',0,'std']]], + ['actions_22',['GitHub Actions',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40',1,'']]], + ['activation_23',['activation',['../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325',1,'machine_learning::adaline']]], + ['activations_24',['activations',['../d5/d39/namespaceactivations.html',1,'']]], + ['adaline_25',['adaline',['../d6/d30/classmachine__learning_1_1adaline.html',1,'machine_learning::adaline'],['../d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c',1,'machine_learning::adaline::adaline()']]], + ['adaline_5flearning_2ecpp_26',['adaline_learning.cpp',['../d5/db0/adaline__learning_8cpp.html',1,'']]], + ['add_27',['add',['../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c',1,'data_structures::Bitset::add()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840',1,'data_structures::BloomFilter::add()'],['../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff',1,'hash_chain::add()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::add()'],['../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3',1,'add(): uint128_t.hpp'],['../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a',1,'double_hashing::add()'],['../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1',1,'linear_probing::add()'],['../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9',1,'quadratic_probing::add()'],['../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35',1,'add(): string_fibonacci.cpp']]], + ['add_5fconst_28',['add_const',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]], + ['add_5fcv_29',['add_cv',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]], + ['add_5fdigit_30',['add_digit',['../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615',1,'large_number']]], + ['add_5fedge_31',['add_edge',['../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19',1,'graph::Graph::add_edge()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79',1,'greedy_algorithms::dijkstra::Graph::add_edge()'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d',1,'range_queries::heavy_light_decomposition::Tree::add_edge()']]], + ['add_5flvalue_5freference_32',['add_lvalue_reference',['http://en.cppreference.com/w/cpp/types/add_reference.html',0,'std']]], + ['add_5fpointer_33',['add_pointer',['http://en.cppreference.com/w/cpp/types/add_pointer.html',0,'std']]], + ['add_5frvalue_5freference_34',['add_rvalue_reference',['http://en.cppreference.com/w/cpp/types/add_reference.html',0,'std']]], + ['add_5fstrings_35',['add_strings',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20',1,'divide_and_conquer::karatsuba_algorithm']]], + ['add_5fvolatile_36',['add_volatile',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]], + ['addedge_37',['addEdge',['../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5',1,'Graph::addEdge(Edge const &edge)'],['../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910',1,'Graph::addEdge(unsigned int source, unsigned int destination)'],['../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a',1,'graph::HKGraph::addEdge()'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad8c10df34357b2cd865c81e0c4f0bd8c',1,'graph::is_graph_bipartite::Graph::addEdge()'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf',1,'graph::bidirectional_dijkstra::addEdge()'],['../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2',1,'graph::addEdge(std::vector< std::vector< int > > *adj, int u, int v)'],['../df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08',1,'graph::addEdge(std::vector< std::vector< size_t > > *adj, size_t u, size_t v)'],['../da/d4b/depth__first__search__with__stack_8cpp.html#aadebe9c855821d6515ca5b171222ef7b',1,'graph::depth_first_search::addEdge()'],['../df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a',1,'graph::addEdge()']]], + ['addinfo_38',['addInfo',['../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560',1,'double_hashing::addInfo()'],['../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908',1,'linear_probing::addInfo()'],['../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768',1,'quadratic_probing::addInfo()']]], + ['addition_39',['addition',['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf',1,'ciphers::elliptic_curve_key_exchange']]], + ['addition_5frule_2ecpp_40',['addition_rule.cpp',['../d6/d4a/addition__rule_8cpp.html',1,'']]], + ['addition_5frule_5fdependent_41',['addition_rule_dependent',['../d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0',1,'addition_rule.cpp']]], + ['addition_5frule_5findependent_42',['addition_rule_independent',['../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d',1,'addition_rule.cpp']]], + ['addprocess_43',['addProcess',['../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69',1,'FCFS']]], + ['address_44',['address',['http://en.cppreference.com/w/cpp/memory/allocator/address.html',0,'std::allocator']]], + ['address_20of_20parent_20nodes_45',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]], + ['addressing_46',['Open Addressing',['../d4/d39/group__open__addressing.html',1,'']]], + ['addressof_47',['addressof',['http://en.cppreference.com/w/cpp/memory/addressof.html',0,'std']]], + ['addvertices_48',['addVertices',['../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413',1,'Graph']]], + ['adj_49',['adj',['../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f',1,'graph::HKGraph::adj'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f',1,'graph::is_graph_bipartite::Graph::adj']]], + ['adjacency_5flist_50',['adjacency_list',['../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0',1,'graph::Graph']]], + ['adjacent_5fdifference_51',['adjacent_difference',['http://en.cppreference.com/w/cpp/algorithm/adjacent_difference.html',0,'std']]], + ['adjacent_5ffind_52',['adjacent_find',['http://en.cppreference.com/w/cpp/algorithm/adjacent_find.html',0,'std']]], + ['adopt_5flock_5ft_53',['adopt_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], + ['advance_54',['advance',['http://en.cppreference.com/w/cpp/iterator/advance.html',0,'std']]], + ['algorithm_55',['Algorithm',['../dc/dfb/atbash__cipher_8cpp.html#autotoc_md0',1,'Algorithm'],['../d6/d2c/caesar__cipher_8cpp.html#autotoc_md1',1,'Algorithm'],['../dd/d12/vigenere__cipher_8cpp.html#autotoc_md2',1,'Algorithm'],['../d3/d4c/xor__cipher_8cpp.html#autotoc_md3',1,'Algorithm'],['../da/dc3/linked__list_8cpp.html#autotoc_md41',1,'Algorithm'],['../d7/d00/list__array_8cpp.html#autotoc_md42',1,'Algorithm'],['../d8/df0/queue__using__array_8cpp.html#autotoc_md43',1,'Algorithm'],['../d6/d05/reverse__a__linked__list_8cpp.html#autotoc_md44',1,'Algorithm'],['../db/d16/0__1__knapsack_8cpp.html#autotoc_md69',1,'Algorithm'],['../d7/d73/abbreviation_8cpp.html#autotoc_md70',1,'Algorithm'],['../d6/d10/cut__rod_8cpp.html#autotoc_md73',1,'Algorithm'],['../db/dca/kadane2_8cpp.html#autotoc_md74',1,'Algorithm'],['../da/d52/minimum__edit__distance_8cpp.html#autotoc_md75',1,'Algorithm'],['../d4/d8d/jarvis__algorithm_8cpp.html#autotoc_md76',1,'Algorithm'],['../d8/d99/connected__components__with__dsu_8cpp.html#autotoc_md77',1,'Algorithm'],['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md83',1,'Algorithm'],['../d5/d96/md5_8cpp.html#autotoc_md84',1,'Algorithm'],['../d8/d7a/sha1_8cpp.html#autotoc_md85',1,'Algorithm'],['../dd/d47/namespacemath.html#autotoc_md86',1,'Algorithm'],['../d4/d38/power__of__two_8cpp.html#autotoc_md87',1,'Algorithm'],['../d5/d33/gram__schmidt_8cpp.html#autotoc_md89',1,'Algorithm'],['../d1/ded/windowed__median_8cpp.html#autotoc_md103',1,'Algorithm'],['../d5/d45/sublist__search_8cpp.html#autotoc_md109',1,'Algorithm'],['../d5/ddb/bogo__sort_8cpp.html#autotoc_md111',1,'Algorithm'],['../d2/d26/count__inversions_8cpp.html#autotoc_md112',1,'Algorithm'],['../d3/df9/recursive__bubble__sort_8cpp.html#autotoc_md113',1,'Algorithm'],['../d5/d4c/group__sorting.html',1,'Sorting Algorithm']]], + ['algorithm_20explanation_56',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md98',1,'']]], + ['algorithms_57',['Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'Cpu Scheduling Algorithms'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'Greedy Algorithms'],['../d9/d66/group__machine__learning.html',1,'Machine Learning Algorithms']]], + ['algorithms_20c_58',['The Algorithms - C++',['../index.html',1,'']]], + ['align_59',['align',['http://en.cppreference.com/w/cpp/memory/align.html',0,'std']]], + ['aligned_5fstorage_60',['aligned_storage',['http://en.cppreference.com/w/cpp/types/aligned_storage.html',0,'std']]], + ['aligned_5funion_61',['aligned_union',['http://en.cppreference.com/w/cpp/types/aligned_union.html',0,'std']]], + ['alignment_5fof_62',['alignment_of',['http://en.cppreference.com/w/cpp/types/alignment_of.html',0,'std']]], + ['aliquot_5fsum_63',['aliquot_sum',['../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf',1,'math']]], + ['aliquot_5fsum_2ecpp_64',['aliquot_sum.cpp',['../de/d99/aliquot__sum_8cpp.html',1,'']]], + ['all_65',['all',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], + ['all_5fof_66',['all_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], + ['allocate_67',['allocate',['http://en.cppreference.com/w/cpp/memory/allocator_traits/allocate.html',0,'std::allocator_traits::allocate()'],['http://en.cppreference.com/w/cpp/memory/allocator/allocate.html',0,'std::allocator::allocate()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/allocate.html',0,'std::scoped_allocator_adaptor::allocate()']]], + ['allocate_5fshared_68',['allocate_shared',['http://en.cppreference.com/w/cpp/memory/shared_ptr/allocate_shared.html',0,'std']]], + ['allocator_69',['allocator',['http://en.cppreference.com/w/cpp/memory/allocator.html',0,'std::allocator< T >'],['http://en.cppreference.com/w/cpp/memory/allocator/allocator.html',0,'std::allocator::allocator()']]], + ['allocator_5farg_5ft_70',['allocator_arg_t',['http://en.cppreference.com/w/cpp/memory/allocator_arg_t.html',0,'std']]], + ['allocator_5ftraits_71',['allocator_traits',['http://en.cppreference.com/w/cpp/memory/allocator_traits.html',0,'std']]], + ['alpha_72',['alpha',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]], + ['always_5fnoconv_73',['always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::always_noconv()']]], + ['analyzer_74',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]], + ['and_20conquer_75',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]], + ['and_20maintainers_76',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]], + ['and_20not_20matching_20edges_77',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]], + ['and_5ftest_78',['and_test',['../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9',1,'boyer_moore.cpp']]], + ['ans_79',['ans',['../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa',1,'matrix_exponentiation.cpp']]], + ['any_80',['any',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], + ['any_5fof_81',['any_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], + ['aplhabet_5fsize_82',['APLHABET_SIZE',['../d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd',1,'boyer_moore.cpp']]], + ['append_83',['append',['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::basic_string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::wstring::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u16string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u32string::append()']]], + ['apply_5ffunction_84',['apply_function',['../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb',1,'machine_learning']]], + ['approximate_5fpi_85',['approximate_pi',['../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188',1,'math']]], + ['approximate_5fpi_2ecpp_86',['approximate_pi.cpp',['../d0/d51/approximate__pi_8cpp.html',1,'']]], + ['are_5falmost_5fequal_87',['are_almost_equal',['../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703',1,'others']]], + ['are_5famicable_88',['are_amicable',['../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec',1,'math']]], + ['area_2ecpp_89',['area.cpp',['../dc/d82/area_8cpp.html',1,'']]], + ['arg_90',['arg',['../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41',1,'Complex']]], + ['argmax_91',['argmax',['../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec',1,'machine_learning']]], + ['armstrong_5fnumber_2ecpp_92',['armstrong_number.cpp',['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html',1,'']]], + ['arr_93',['arr',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d',1,'data_structures::queue_using_array::Queue_Array::arr'],['../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b',1,'data_structures::trie::arr']]], + ['array_94',['array',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['array_3c_20data_5fstructures_3a_3atree_5f234_3a_3anode_20_2a_2c_204_20_3e_95',['array< data_structures::tree_234::Node *, 4 >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['array_3c_20float_2c_2020_20_3e_96',['array< float, 20 >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['array_3c_20int_2c_20maxnode_20_3e_97',['array< int, maxNode >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['array_3c_20int16_5ft_2c_20max_5fsize_20_3e_98',['array< int16_t, max_size >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['array_3c_20int64_5ft_2c_203_20_3e_99',['array< int64_t, 3 >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['array_3c_20int64_5ft_2c_20n_20_3e_100',['array< int64_t, N >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['array_3c_20std_3a_3aarray_3c_20int_2c_202_20_3e_2c_20maxnode_20_3e_101',['array< std::array< int, 2 >, maxNode >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['array_3c_20std_3a_3aarray_3c_20int64_5ft_2c_20n_20_3e_2c_20m_20_3e_102',['array< std::array< int64_t, N >, M >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['array_3c_20std_3a_3aarray_3c_20uint32_5ft_2c_203_20_3e_2c_203_20_3e_103',['array< std::array< uint32_t, 3 >, 3 >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['array_3c_20uint32_5ft_2c_208_20_3e_104',['array< uint32_t, 8 >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['array_3c_20uint64_5ft_2c_20n_20_3e_105',['array< uint64_t, N >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['array_5fleft_5frotation_2ecpp_106',['array_left_rotation.cpp',['../d9/d14/array__left__rotation_8cpp.html',1,'']]], + ['array_5fright_5frotation_2ecpp_107',['array_right_rotation.cpp',['../d6/d57/array__right__rotation_8cpp.html',1,'']]], + ['asctime_108',['asctime',['http://en.cppreference.com/w/cpp/chrono/c/asctime.html',0,'std']]], + ['asin_109',['asin',['http://en.cppreference.com/w/cpp/numeric/math/asin.html',0,'std']]], + ['asinh_110',['asinh',['http://en.cppreference.com/w/cpp/numeric/math/asinh.html',0,'std']]], + ['ask_5fdata_111',['ask_data',['../dd/d92/memory__game_8cpp.html#a5714d97649c0edd57b4fb449799676a3',1,'games::memory_game']]], + ['assertarray_112',['assertArray',['../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a',1,'quadratic_equations_complex_numbers.cpp']]], + ['assign_113',['assign',['http://en.cppreference.com/w/cpp/container/vector/assign.html',0,'std::vector::assign()'],['http://en.cppreference.com/w/cpp/string/char_traits/assign.html',0,'std::char_traits::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::string::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::regex::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::basic_regex::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::wregex::assign()'],['http://en.cppreference.com/w/cpp/container/forward_list/assign.html',0,'std::forward_list::assign()'],['http://en.cppreference.com/w/cpp/error/error_code/assign.html',0,'std::error_code::assign()'],['http://en.cppreference.com/w/cpp/container/deque/assign.html',0,'std::deque::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::basic_string::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::wstring::assign()'],['http://en.cppreference.com/w/cpp/utility/functional/function/assign.html',0,'std::function::assign()'],['http://en.cppreference.com/w/cpp/error/error_condition/assign.html',0,'std::error_condition::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u16string::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u32string::assign()'],['http://en.cppreference.com/w/cpp/container/list/assign.html',0,'std::list::assign()']]], + ['assign_5fresults_114',['assign_results',['../dd/d92/memory__game_8cpp.html#a3ceeea62d8fa6c563e2c66359fd73413',1,'games::memory_game']]], + ['async_115',['async',['http://en.cppreference.com/w/cpp/thread/async.html',0,'std']]], + ['at_116',['at',['http://en.cppreference.com/w/cpp/container/dynarray/at.html',0,'std::dynarray::at()'],['http://en.cppreference.com/w/cpp/container/vector/at.html',0,'std::vector::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::string::at()'],['http://en.cppreference.com/w/cpp/container/unordered_map/at.html',0,'std::unordered_map::at()'],['http://en.cppreference.com/w/cpp/container/deque/at.html',0,'std::deque::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::basic_string::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::wstring::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u16string::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u32string::at()'],['http://en.cppreference.com/w/cpp/container/map/at.html',0,'std::map::at()'],['http://en.cppreference.com/w/cpp/container/array/at.html',0,'std::array::at()']]], + ['at_5fquick_5fexit_117',['at_quick_exit',['http://en.cppreference.com/w/cpp/utility/program/at_quick_exit.html',0,'std']]], + ['atan_118',['atan',['http://en.cppreference.com/w/cpp/numeric/math/atan.html',0,'std']]], + ['atan2_119',['atan2',['http://en.cppreference.com/w/cpp/numeric/math/atan2.html',0,'std']]], + ['atanh_120',['atanh',['http://en.cppreference.com/w/cpp/numeric/math/atanh.html',0,'std']]], + ['atbash_121',['atbash',['../de/db3/namespaceatbash.html',1,'']]], + ['atbash_5fcipher_122',['atbash_cipher',['../dc/dfb/atbash__cipher_8cpp.html#a8f7dd4dcd3df7c512c20482afc2dbb9d',1,'ciphers::atbash']]], + ['atbash_5fcipher_2ecpp_123',['atbash_cipher.cpp',['../dc/dfb/atbash__cipher_8cpp.html',1,'']]], + ['atexit_124',['atexit',['http://en.cppreference.com/w/cpp/utility/program/atexit.html',0,'std']]], + ['atof_125',['atof',['http://en.cppreference.com/w/cpp/string/byte/atof.html',0,'std']]], + ['atoi_126',['atoi',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]], + ['atol_127',['atol',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]], + ['atoll_128',['atoll',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]], + ['atomic_129',['atomic',['http://en.cppreference.com/w/cpp/atomic/atomic.html',0,'std::atomic< T >'],['http://en.cppreference.com/w/cpp/atomic/atomic/atomic.html',0,'std::atomic::atomic()']]], + ['atomic_5fcompare_5fexchange_5fstrong_130',['atomic_compare_exchange_strong',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], + ['atomic_5fcompare_5fexchange_5fstrong_5fexplicit_131',['atomic_compare_exchange_strong_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], + ['atomic_5fcompare_5fexchange_5fweak_132',['atomic_compare_exchange_weak',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], + ['atomic_5fcompare_5fexchange_5fweak_5fexplicit_133',['atomic_compare_exchange_weak_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], + ['atomic_5fexchange_134',['atomic_exchange',['http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html',0,'std']]], + ['atomic_5fexchange_5fexplicit_135',['atomic_exchange_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html',0,'std']]], + ['atomic_5ffetch_5fadd_136',['atomic_fetch_add',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html',0,'std']]], + ['atomic_5ffetch_5fadd_5fexplicit_137',['atomic_fetch_add_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html',0,'std']]], + ['atomic_5ffetch_5fand_138',['atomic_fetch_and',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], + ['atomic_5ffetch_5fand_5fexplicit_139',['atomic_fetch_and_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], + ['atomic_5ffetch_5for_140',['atomic_fetch_or',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html',0,'std']]], + ['atomic_5ffetch_5for_5fexplicit_141',['atomic_fetch_or_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html',0,'std']]], + ['atomic_5ffetch_5fsub_142',['atomic_fetch_sub',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], + ['atomic_5ffetch_5fsub_5fexplicit_143',['atomic_fetch_sub_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], + ['atomic_5ffetch_5fxor_144',['atomic_fetch_xor',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html',0,'std']]], + ['atomic_5ffetch_5fxor_5fexplicit_145',['atomic_fetch_xor_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html',0,'std']]], + ['atomic_5fflag_146',['atomic_flag',['http://en.cppreference.com/w/cpp/atomic/atomic_flag.html',0,'std::atomic_flag'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/atomic_flag.html',0,'std::atomic_flag::atomic_flag()']]], + ['atomic_5finit_147',['atomic_init',['http://en.cppreference.com/w/cpp/atomic/atomic_init.html',0,'std']]], + ['atomic_5fis_5flock_5ffree_148',['atomic_is_lock_free',['http://en.cppreference.com/w/cpp/atomic/atomic_is_lock_free.html',0,'std']]], + ['atomic_5fload_149',['atomic_load',['http://en.cppreference.com/w/cpp/atomic/atomic_load.html',0,'std']]], + ['atomic_5fload_5fexplicit_150',['atomic_load_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_load.html',0,'std']]], + ['atomic_5fsignal_5ffence_151',['atomic_signal_fence',['http://en.cppreference.com/w/cpp/atomic/atomic_signal_fence.html',0,'std']]], + ['atomic_5fstore_152',['atomic_store',['http://en.cppreference.com/w/cpp/atomic/atomic_store.html',0,'std']]], + ['atomic_5fstore_5fexplicit_153',['atomic_store_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_store.html',0,'std']]], + ['atomic_5fthread_5ffence_154',['atomic_thread_fence',['http://en.cppreference.com/w/cpp/atomic/atomic_thread_fence.html',0,'std']]], + ['attribution_155',['Attribution',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md15',1,'']]], + ['augmenting_20paths_156',['Augmenting paths',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md81',1,'']]], + ['auto_5fptr_157',['auto_ptr',['http://en.cppreference.com/w/cpp/memory/auto_ptr.html',0,'std::auto_ptr< T >'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/auto_ptr.html',0,'std::auto_ptr::auto_ptr()']]], + ['auxiliary_5fq_158',['auxiliary_q',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323',1,'data_structures::stack_using_queue::Stack']]], + ['availarray_159',['AvailArray',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c',1,'linkedlist_implentation_usingarray.cpp']]], + ['avltree_2ecpp_160',['avltree.cpp',['../d8/dee/avltree_8cpp.html',1,'']]], + ['aystar_5fsearch_161',['aystar_search',['../db/ddc/namespaceaystar__search.html',1,'']]], + ['aystarsearch_162',['AyStarSearch',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html',1,'machine_learning::aystar_search::AyStarSearch< Puzzle >'],['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e',1,'machine_learning::aystar_search::AyStarSearch::AyStarSearch()']]] ]; diff --git a/search/all_7.js b/search/all_7.js index 3ae1a3323..23e83eb19 100644 --- a/search/all_7.js +++ b/search/all_7.js @@ -1,144 +1,148 @@ var searchData= [ - ['b_0',['b',['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/params.html',0,'std::weibull_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/params.html',0,'std::cauchy_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/params.html',0,'std::extreme_value_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/params.html',0,'std::uniform_real_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/params.html',0,'std::uniform_int_distribution::b()']]], + ['b_0',['b',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/params.html',0,'std::extreme_value_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/params.html',0,'std::uniform_real_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/params.html',0,'std::weibull_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/params.html',0,'std::uniform_int_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/params.html',0,'std::cauchy_distribution::b()']]], ['babylonian_5fmethod_1',['babylonian_method',['../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309',1,'numerical_methods']]], ['babylonian_5fmethod_2ecpp_2',['babylonian_method.cpp',['../dc/d9c/babylonian__method_8cpp.html',1,'']]], - ['back_3',['back',['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u16string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::wstring::back()'],['http://en.cppreference.com/w/cpp/container/deque/back.html',0,'std::deque::back()'],['http://en.cppreference.com/w/cpp/container/queue/back.html',0,'std::queue::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u32string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::string::back()'],['http://en.cppreference.com/w/cpp/container/vector/back.html',0,'std::vector::back()'],['http://en.cppreference.com/w/cpp/container/dynarray/back.html',0,'std::dynarray::back()'],['http://en.cppreference.com/w/cpp/container/list/back.html',0,'std::list::back()'],['http://en.cppreference.com/w/cpp/container/array/back.html',0,'std::array::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::basic_string::back()']]], + ['back_3',['back',['http://en.cppreference.com/w/cpp/container/dynarray/back.html',0,'std::dynarray::back()'],['http://en.cppreference.com/w/cpp/container/vector/back.html',0,'std::vector::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::string::back()'],['http://en.cppreference.com/w/cpp/container/deque/back.html',0,'std::deque::back()'],['http://en.cppreference.com/w/cpp/container/queue/back.html',0,'std::queue::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::basic_string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::wstring::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u16string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u32string::back()'],['http://en.cppreference.com/w/cpp/container/list/back.html',0,'std::list::back()'],['http://en.cppreference.com/w/cpp/container/array/back.html',0,'std::array::back()']]], ['back_5finsert_5fiterator_4',['back_insert_iterator',['http://en.cppreference.com/w/cpp/iterator/back_insert_iterator.html',0,'std']]], ['back_5finserter_5',['back_inserter',['http://en.cppreference.com/w/cpp/iterator/back_inserter.html',0,'std']]], - ['backtracking_6',['backtracking',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'Backtracking'],['../db/dc0/namespacebacktracking.html',1,'backtracking']]], - ['bad_7',['bad',['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wiostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ios::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::iostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::strstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wfstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wstringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_iostream::bad()']]], - ['bad_5falloc_8',['bad_alloc',['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc::bad_alloc()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc']]], - ['bad_5farray_5flength_9',['bad_array_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_length.html',0,'std::bad_array_length::bad_array_length()'],['http://en.cppreference.com/w/cpp/memory/new/bad_array_length.html',0,'std::bad_array_length']]], - ['bad_5farray_5fnew_5flength_10',['bad_array_new_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_new_length/bad_array_new_length.html',0,'std::bad_array_new_length::bad_array_new_length()'],['http://en.cppreference.com/w/cpp/memory/new/bad_array_new_length.html',0,'std::bad_array_new_length']]], - ['bad_5fcast_11',['bad_cast',['http://en.cppreference.com/w/cpp/types/bad_cast/bad_cast.html',0,'std::bad_cast::bad_cast()'],['http://en.cppreference.com/w/cpp/types/bad_cast.html',0,'std::bad_cast']]], - ['bad_5fchar_12',['bad_char',['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645',1,'strings::boyer_moore::pattern']]], - ['bad_5fexception_13',['bad_exception',['http://en.cppreference.com/w/cpp/error/bad_exception.html',0,'std']]], - ['bad_5ffunction_5fcall_14',['bad_function_call',['http://en.cppreference.com/w/cpp/utility/functional/bad_function_call.html',0,'std::bad_function_call::bad_function_call()'],['http://en.cppreference.com/w/cpp/utility/functional/bad_function_call.html',0,'std::bad_function_call']]], - ['bad_5foptional_5faccess_15',['bad_optional_access',['http://en.cppreference.com/w/cpp/utility/bad_optional_access.html',0,'std::bad_optional_access'],['http://en.cppreference.com/w/cpp/utility/bad_optional_access.html',0,'std::bad_optional_access::bad_optional_access()']]], - ['bad_5ftypeid_16',['bad_typeid',['http://en.cppreference.com/w/cpp/types/bad_typeid.html',0,'std::bad_typeid'],['http://en.cppreference.com/w/cpp/types/bad_typeid/bad_typeid.html',0,'std::bad_typeid::bad_typeid()']]], - ['bad_5fweak_5fptr_17',['bad_weak_ptr',['http://en.cppreference.com/w/cpp/memory/bad_weak_ptr.html',0,'std::bad_weak_ptr'],['http://en.cppreference.com/w/cpp/memory/bad_weak_ptr/bad_weak_ptr.html',0,'std::bad_weak_ptr::bad_weak_ptr()']]], - ['ban_18',['ban',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md13',1,'3. Temporary Ban'],['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md14',1,'4. Permanent Ban']]], - ['base_19',['base',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::knuth_b::base()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::shuffle_order_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux24::base()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/base.html',0,'std::independent_bits_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::discard_block_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux48::base()']]], - ['base64_5fencoding_20',['base64_encoding',['../d9/dc9/namespacebase64__encoding.html',1,'']]], - ['basic_5ffilebuf_21',['basic_filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::basic_filebuf::basic_filebuf()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std::basic_filebuf']]], - ['basic_5ffstream_22',['basic_fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::basic_fstream::basic_fstream()'],['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std::basic_fstream< Char >']]], - ['basic_5ffstream_3c_20char_20_3e_23',['basic_fstream< char >',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std']]], - ['basic_5ffstream_3c_20wchar_5ft_20_3e_24',['basic_fstream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std']]], - ['basic_5fifstream_25',['basic_ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::basic_ifstream::basic_ifstream()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std::basic_ifstream< Char >']]], - ['basic_5fifstream_3c_20char_20_3e_26',['basic_ifstream< char >',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std']]], - ['basic_5fifstream_3c_20wchar_5ft_20_3e_27',['basic_ifstream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std']]], - ['basic_5fios_28',['basic_ios',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std::basic_ios< Char >'],['http://en.cppreference.com/w/cpp/io/basic_ios/basic_ios.html',0,'std::basic_ios::basic_ios()']]], - ['basic_5fios_3c_20char_20_3e_29',['basic_ios< char >',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std']]], - ['basic_5fios_3c_20wchar_5ft_20_3e_30',['basic_ios< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std']]], - ['basic_5fiostream_31',['basic_iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std::basic_iostream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::basic_iostream::basic_iostream()']]], - ['basic_5fiostream_3c_20char_20_3e_32',['basic_iostream< char >',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std']]], - ['basic_5fiostream_3c_20wchar_5ft_20_3e_33',['basic_iostream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std']]], - ['basic_5fistream_34',['basic_istream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std::basic_istream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::basic_istream::basic_istream()']]], - ['basic_5fistream_3c_20char_20_3e_35',['basic_istream< char >',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]], - ['basic_5fistream_3c_20wchar_5ft_20_3e_36',['basic_istream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]], - ['basic_5fistringstream_37',['basic_istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std::basic_istringstream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::basic_istringstream::basic_istringstream()']]], - ['basic_5fistringstream_3c_20char_20_3e_38',['basic_istringstream< char >',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std']]], - ['basic_5fistringstream_3c_20wchar_5ft_20_3e_39',['basic_istringstream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std']]], - ['basic_5fofstream_40',['basic_ofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::basic_ofstream::basic_ofstream()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std::basic_ofstream< Char >']]], - ['basic_5fofstream_3c_20char_20_3e_41',['basic_ofstream< char >',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std']]], - ['basic_5fofstream_3c_20wchar_5ft_20_3e_42',['basic_ofstream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std']]], - ['basic_5fostream_43',['basic_ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::basic_ostream::basic_ostream()'],['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std::basic_ostream< Char >']]], - ['basic_5fostream_3c_20char_20_3e_44',['basic_ostream< char >',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], - ['basic_5fostream_3c_20wchar_5ft_20_3e_45',['basic_ostream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], - ['basic_5fostringstream_46',['basic_ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std::basic_ostringstream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::basic_ostringstream::basic_ostringstream()']]], - ['basic_5fostringstream_3c_20char_20_3e_47',['basic_ostringstream< char >',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std']]], - ['basic_5fostringstream_3c_20wchar_5ft_20_3e_48',['basic_ostringstream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std']]], - ['basic_5fregex_49',['basic_regex',['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::basic_regex::basic_regex()'],['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std::basic_regex']]], - ['basic_5fstreambuf_50',['basic_streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::basic_streambuf::basic_streambuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std::basic_streambuf']]], - ['basic_5fstring_51',['basic_string',['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::basic_string::basic_string()'],['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::basic_string< Char >']]], - ['basic_5fstring_3c_20char_20_3e_52',['basic_string< char >',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], - ['basic_5fstring_3c_20char16_5ft_20_3e_53',['basic_string< char16_t >',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], - ['basic_5fstring_3c_20char32_5ft_20_3e_54',['basic_string< char32_t >',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], - ['basic_5fstring_3c_20char8_5ft_20_3e_55',['basic_string< char8_t >',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], - ['basic_5fstring_3c_20wchar_5ft_20_3e_56',['basic_string< wchar_t >',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], - ['basic_5fstringbuf_57',['basic_stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std::basic_stringbuf'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::basic_stringbuf::basic_stringbuf()']]], - ['basic_5fstringstream_58',['basic_stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::basic_stringstream::basic_stringstream()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std::basic_stringstream< Char >']]], - ['basic_5fstringstream_3c_20char_20_3e_59',['basic_stringstream< char >',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std']]], - ['basic_5fstringstream_3c_20wchar_5ft_20_3e_60',['basic_stringstream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std']]], - ['batch_5fpredict_61',['batch_predict',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a88bf9023ab3d4cdb61cf707c7cdfc86b',1,'machine_learning::neural_network::NeuralNetwork']]], - ['bayes_5fagivenb_62',['bayes_AgivenB',['../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba',1,'bayes_theorem.cpp']]], - ['bayes_5fbgivena_63',['bayes_BgivenA',['../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f',1,'bayes_theorem.cpp']]], - ['bayes_5ftheorem_2ecpp_64',['bayes_theorem.cpp',['../d5/d67/bayes__theorem_8cpp.html',1,'']]], - ['before_65',['before',['http://en.cppreference.com/w/cpp/types/type_info/before.html',0,'std::type_info']]], - ['before_20contributing_66',['Before contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md22',1,'']]], - ['before_5fbegin_67',['before_begin',['http://en.cppreference.com/w/cpp/container/forward_list/before_begin.html',0,'std::forward_list']]], - ['begin_68',['begin',['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::begin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::begin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::begin()'],['http://en.cppreference.com/w/cpp/iterator/begin.html',0,'std::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::begin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::begin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::begin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::begin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::begin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::begin()'],['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::begin()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/begin.html',0,'std::initializer_list::begin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::begin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::begin()']]], - ['begin_28int_29_69',['begin(int)',['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2.html',0,'std::unordered_multimap::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin2.html',0,'std::unordered_multiset::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin2.html',0,'std::unordered_set::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin2.html',0,'std::unordered_map::begin(int)()']]], - ['bernoulli_5fdistribution_70',['bernoulli_distribution',['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/bernoulli_distribution.html',0,'std::bernoulli_distribution::bernoulli_distribution()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution.html',0,'std::bernoulli_distribution']]], - ['beta_71',['beta',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]], - ['bfs_72',['bfs',['../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93',1,'graph::HKGraph']]], - ['bidijkstra_73',['Bidijkstra',['../d7/d07/bidirectional__dijkstra_8cpp.html#a1b2df3d52a403ad46523ab90d3a723c1',1,'graph::bidirectional_dijkstra']]], - ['bidirectional_5fdijkstra_74',['bidirectional_dijkstra',['../d4/d13/namespacebidirectional__dijkstra.html',1,'']]], - ['bidirectional_5fdijkstra_2ecpp_75',['bidirectional_dijkstra.cpp',['../d7/d07/bidirectional__dijkstra_8cpp.html',1,'']]], - ['bidirectional_5fiterator_5ftag_76',['bidirectional_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], - ['binary_5fexponent_2ecpp_77',['binary_exponent.cpp',['../de/dcf/binary__exponent_8cpp.html',1,'']]], - ['binary_5ffunction_78',['binary_function',['http://en.cppreference.com/w/cpp/utility/functional/binary_function.html',0,'std']]], - ['binary_5finsertion_5fsort_2ecpp_79',['binary_insertion_sort.cpp',['../d8/dcc/binary__insertion__sort_8cpp.html',1,'']]], - ['binary_5fnegate_80',['binary_negate',['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate'],['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate::binary_negate()']]], - ['binary_5fs_81',['binary_s',['../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae',1,'exponential_search.cpp']]], - ['binary_5fsearch_82',['binary_search',['http://en.cppreference.com/w/cpp/algorithm/binary_search.html',0,'std::binary_search()'],['../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd',1,'sorting::binary_search()']]], - ['binary_5fsearch_5ftree_83',['binary_search_tree',['../d9/dde/classbinary__search__tree.html',1,'binary_search_tree< T >'],['../d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6',1,'binary_search_tree::binary_search_tree()']]], - ['binary_5fsearch_5ftree_2ecpp_84',['binary_search_tree.cpp',['../d3/d26/binary__search__tree_8cpp.html',1,'']]], - ['binary_5fsearch_5ftree2_2ecpp_85',['binary_search_tree2.cpp',['../df/d42/binary__search__tree2_8cpp.html',1,'']]], - ['binaryheap_2ecpp_86',['binaryheap.cpp',['../de/dc3/binaryheap_8cpp.html',1,'']]], - ['binarysearch_87',['BinarySearch',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf',1,'data_structures::list_array::list']]], - ['binarytree_88',['binarytree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree()'],['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html',1,'others::iterative_tree_traversals::BinaryTree'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree()']]], - ['bind_89',['bind',['http://en.cppreference.com/w/cpp/utility/functional/bind.html',0,'std']]], - ['binexpo_90',['binexpo',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a4c6eefd1254eab3e8d34bf02c205e0f4',1,'binExpo(int64_t a, int64_t b, int64_t m): modular_inverse_fermat_little_theorem.cpp'],['../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73',1,'binExpo(int a, int b): binary_exponent.cpp']]], - ['binexpo_5falt_91',['binExpo_alt',['../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f',1,'binary_exponent.cpp']]], - ['binomial_92',['binomial',['../d7/d7a/namespacebinomial.html',1,'']]], - ['binomial_5fcalculate_2ecpp_93',['binomial_calculate.cpp',['../d8/db1/binomial__calculate_8cpp.html',1,'']]], - ['binomial_5fdist_2ecpp_94',['binomial_dist.cpp',['../d6/db0/binomial__dist_8cpp.html',1,'']]], - ['binomial_5fdistribution_95',['binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/binomial_distribution.html',0,'std::binomial_distribution::binomial_distribution()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution.html',0,'std::binomial_distribution']]], - ['binomial_5fexpected_96',['binomial_expected',['../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813',1,'binomial_dist.cpp']]], - ['binomial_5frange_5fsuccesses_97',['binomial_range_successes',['../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25',1,'binomial_dist.cpp']]], - ['binomial_5fstandard_5fdeviation_98',['binomial_standard_deviation',['../d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc',1,'binomial_dist.cpp']]], - ['binomial_5fvariance_99',['binomial_variance',['../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861',1,'binomial_dist.cpp']]], - ['binomial_5fx_5fsuccesses_100',['binomial_x_successes',['../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76',1,'binomial_dist.cpp']]], - ['binomialcoeffsum_101',['binomialCoeffSum',['../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea',1,'math']]], - ['bipartite_20graph_102',['Bipartite graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]], - ['bisection_5fmethod_2ecpp_103',['bisection_method.cpp',['../d7/d6a/bisection__method_8cpp.html',1,'']]], - ['bit_104',['bit',['../de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6',1,'range_queries::fenwick_tree']]], - ['bit_20manipulation_105',['Bit Manipulation',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46',1,'']]], - ['bit_5fand_106',['bit_and',['http://en.cppreference.com/w/cpp/utility/functional/bit_and.html',0,'std']]], - ['bit_5fmanipulation_107',['bit_manipulation',['../d7/d81/namespacebit__manipulation.html',1,'']]], - ['bit_5fnot_108',['bit_not',['http://en.cppreference.com/w/cpp/utility/functional/bit_not.html',0,'std']]], - ['bit_5for_109',['bit_or',['http://en.cppreference.com/w/cpp/utility/functional/bit_or.html',0,'std']]], - ['bitcount_110',['bitCount',['../d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b',1,'bit_manipulation::hamming_distance']]], - ['bitset_111',['bitset',['http://en.cppreference.com/w/cpp/utility/bitset/bitset.html',0,'std::bitset::bitset()'],['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std::bitset< Bits >'],['../d9/dae/classdata__structures_1_1_bitset.html',1,'data_structures::Bitset'],['../d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130',1,'data_structures::Bitset::Bitset()']]], - ['bitset_3c_20maxn_20_3e_112',['bitset< MAXN >',['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std']]], - ['black_113',['BLACK',['../da/d4b/depth__first__search__with__stack_8cpp.html#a7f1cd94cf4da32933e8551cb3577e18b',1,'depth_first_search_with_stack.cpp']]], - ['blocksize_114',['blockSize',['../d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f',1,'data_structures::Bitset']]], - ['bloom_5ffilter_2ecpp_115',['bloom_filter.cpp',['../d9/dab/bloom__filter_8cpp.html',1,'']]], - ['bloomfilter_116',['bloomfilter',['../dc/dd4/classdata__structures_1_1_bloom_filter.html',1,'data_structures::BloomFilter< T >'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a',1,'data_structures::BloomFilter::BloomFilter()']]], - ['bogo_5fsort_2ecpp_117',['bogo_sort.cpp',['../d5/ddb/bogo__sort_8cpp.html',1,'']]], - ['boolalpha_118',['boolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]], - ['boruvkas_119',['boruvkas',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]], - ['boruvkas_5fminimum_5fspanning_5ftree_120',['boruvkas_minimum_spanning_tree',['../d8/d64/namespaceboruvkas__minimum__spanning__tree.html',1,'']]], - ['boruvkas_5fminimum_5fspanning_5ftree_2ecpp_121',['boruvkas_minimum_spanning_tree.cpp',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html',1,'']]], - ['boyer_5fmoore_2ecpp_122',['boyer_moore.cpp',['../d3/db2/boyer__moore_8cpp.html',1,'']]], - ['breadth_5ffirst_5fsearch_123',['breadth_first_search',['../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981',1,'graph::Graph']]], - ['breadth_5ffirst_5fsearch_2ecpp_124',['breadth_first_search.cpp',['../df/d82/breadth__first__search_8cpp.html',1,'']]], - ['brent_5fmethod_5fextrema_2ecpp_125',['brent_method_extrema.cpp',['../db/d01/brent__method__extrema_8cpp.html',1,'']]], - ['brute_5fforce_126',['brute_force',['../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8',1,'string_search']]], - ['brute_5fforce_5fstring_5fsearching_2ecpp_127',['brute_force_string_searching.cpp',['../d3/d7d/brute__force__string__searching_8cpp.html',1,'']]], - ['bsearch_128',['bsearch',['http://en.cppreference.com/w/cpp/algorithm/bsearch.html',0,'std']]], - ['bst_5fnode_129',['bst_node',['../dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778',1,'binary_search_tree::bst_node::bst_node()'],['../dd/db6/structbinary__search__tree_1_1bst__node.html',1,'binary_search_tree< T >::bst_node']]], - ['bt_130',['BT',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html',1,'others::recursive_tree_traversals']]], - ['btowc_131',['btowc',['http://en.cppreference.com/w/cpp/string/multibyte/btowc.html',0,'std']]], - ['btree_132',['Btree',['../d9/d90/struct_btree.html',1,'']]], - ['bubble_5fsort_2ecpp_133',['bubble_sort.cpp',['../d8/d13/bubble__sort_8cpp.html',1,'']]], - ['bucket_134',['bucket',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket.html',0,'std::unordered_map::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket.html',0,'std::unordered_multiset::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket.html',0,'std::unordered_set::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket.html',0,'std::unordered_multimap::bucket()']]], - ['bucket_5fcount_135',['bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_count.html',0,'std::unordered_set::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_count.html',0,'std::unordered_map::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_count.html',0,'std::unordered_multimap::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_count.html',0,'std::unordered_multiset::bucket_count(T... args)']]], - ['bucket_5fsize_136',['bucket_size',['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_size.html',0,'std::unordered_multiset::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_size.html',0,'std::unordered_map::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_size.html',0,'std::unordered_multimap::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_size.html',0,'std::unordered_set::bucket_size()']]], - ['build_137',['build',['../d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9',1,'range_queries::prefix_sum_array']]], - ['building_20locally_138',['Building Locally',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37',1,'']]], - ['buildtable_139',['buildTable',['../d4/d96/range__queries_2sparse__table_8cpp.html#a803a2451e87021d14ae06f148383e6bc',1,'range_queries::sparse_table']]], - ['buzz_5fnumber_2ecpp_140',['buzz_number.cpp',['../d1/d76/buzz__number_8cpp.html',1,'']]] + ['backtracking_6',['backtracking',['../db/dc0/namespacebacktracking.html',1,'']]], + ['backtracking_7',['Backtracking',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]], + ['bad_8',['bad',['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ios::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::iostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::strstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wiostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wfstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_iostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wstringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ifstream::bad()']]], + ['bad_5falloc_9',['bad_alloc',['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc::bad_alloc()']]], + ['bad_5farray_5flength_10',['bad_array_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_length.html',0,'std::bad_array_length'],['http://en.cppreference.com/w/cpp/memory/new/bad_array_length.html',0,'std::bad_array_length::bad_array_length()']]], + ['bad_5farray_5fnew_5flength_11',['bad_array_new_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_new_length.html',0,'std::bad_array_new_length'],['http://en.cppreference.com/w/cpp/memory/new/bad_array_new_length/bad_array_new_length.html',0,'std::bad_array_new_length::bad_array_new_length()']]], + ['bad_5fcast_12',['bad_cast',['http://en.cppreference.com/w/cpp/types/bad_cast.html',0,'std::bad_cast'],['http://en.cppreference.com/w/cpp/types/bad_cast/bad_cast.html',0,'std::bad_cast::bad_cast()']]], + ['bad_5fchar_13',['bad_char',['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645',1,'strings::boyer_moore::pattern']]], + ['bad_5fexception_14',['bad_exception',['http://en.cppreference.com/w/cpp/error/bad_exception.html',0,'std']]], + ['bad_5ffunction_5fcall_15',['bad_function_call',['http://en.cppreference.com/w/cpp/utility/functional/bad_function_call.html',0,'std::bad_function_call'],['http://en.cppreference.com/w/cpp/utility/functional/bad_function_call.html',0,'std::bad_function_call::bad_function_call()']]], + ['bad_5foptional_5faccess_16',['bad_optional_access',['http://en.cppreference.com/w/cpp/utility/bad_optional_access.html',0,'std::bad_optional_access'],['http://en.cppreference.com/w/cpp/utility/bad_optional_access.html',0,'std::bad_optional_access::bad_optional_access()']]], + ['bad_5ftypeid_17',['bad_typeid',['http://en.cppreference.com/w/cpp/types/bad_typeid.html',0,'std::bad_typeid'],['http://en.cppreference.com/w/cpp/types/bad_typeid/bad_typeid.html',0,'std::bad_typeid::bad_typeid()']]], + ['bad_5fweak_5fptr_18',['bad_weak_ptr',['http://en.cppreference.com/w/cpp/memory/bad_weak_ptr.html',0,'std::bad_weak_ptr'],['http://en.cppreference.com/w/cpp/memory/bad_weak_ptr/bad_weak_ptr.html',0,'std::bad_weak_ptr::bad_weak_ptr()']]], + ['ban_19',['Ban',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md13',1,'3. Temporary Ban'],['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md14',1,'4. Permanent Ban']]], + ['base_20',['base',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux48::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::discard_block_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/base.html',0,'std::independent_bits_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::shuffle_order_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux24::base()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::knuth_b::base()']]], + ['base64_5fencoding_21',['base64_encoding',['../d9/dc9/namespacebase64__encoding.html',1,'']]], + ['basic_5ffilebuf_22',['basic_filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std::basic_filebuf'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::basic_filebuf::basic_filebuf()']]], + ['basic_5ffstream_23',['basic_fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std::basic_fstream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::basic_fstream::basic_fstream()']]], + ['basic_5ffstream_3c_20char_20_3e_24',['basic_fstream< char >',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std']]], + ['basic_5ffstream_3c_20wchar_5ft_20_3e_25',['basic_fstream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std']]], + ['basic_5fifstream_26',['basic_ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std::basic_ifstream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::basic_ifstream::basic_ifstream()']]], + ['basic_5fifstream_3c_20char_20_3e_27',['basic_ifstream< char >',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std']]], + ['basic_5fifstream_3c_20wchar_5ft_20_3e_28',['basic_ifstream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std']]], + ['basic_5fios_29',['basic_ios',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std::basic_ios< Char >'],['http://en.cppreference.com/w/cpp/io/basic_ios/basic_ios.html',0,'std::basic_ios::basic_ios()']]], + ['basic_5fios_3c_20char_20_3e_30',['basic_ios< char >',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std']]], + ['basic_5fios_3c_20wchar_5ft_20_3e_31',['basic_ios< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std']]], + ['basic_5fiostream_32',['basic_iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std::basic_iostream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::basic_iostream::basic_iostream()']]], + ['basic_5fiostream_3c_20char_20_3e_33',['basic_iostream< char >',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std']]], + ['basic_5fiostream_3c_20wchar_5ft_20_3e_34',['basic_iostream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std']]], + ['basic_5fistream_35',['basic_istream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std::basic_istream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::basic_istream::basic_istream()']]], + ['basic_5fistream_3c_20char_20_3e_36',['basic_istream< char >',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]], + ['basic_5fistream_3c_20wchar_5ft_20_3e_37',['basic_istream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]], + ['basic_5fistringstream_38',['basic_istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std::basic_istringstream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::basic_istringstream::basic_istringstream()']]], + ['basic_5fistringstream_3c_20char_20_3e_39',['basic_istringstream< char >',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std']]], + ['basic_5fistringstream_3c_20wchar_5ft_20_3e_40',['basic_istringstream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std']]], + ['basic_5fofstream_41',['basic_ofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std::basic_ofstream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::basic_ofstream::basic_ofstream()']]], + ['basic_5fofstream_3c_20char_20_3e_42',['basic_ofstream< char >',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std']]], + ['basic_5fofstream_3c_20wchar_5ft_20_3e_43',['basic_ofstream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std']]], + ['basic_5fostream_44',['basic_ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std::basic_ostream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::basic_ostream::basic_ostream()']]], + ['basic_5fostream_3c_20char_20_3e_45',['basic_ostream< char >',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['basic_5fostream_3c_20wchar_5ft_20_3e_46',['basic_ostream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['basic_5fostringstream_47',['basic_ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std::basic_ostringstream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::basic_ostringstream::basic_ostringstream()']]], + ['basic_5fostringstream_3c_20char_20_3e_48',['basic_ostringstream< char >',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std']]], + ['basic_5fostringstream_3c_20wchar_5ft_20_3e_49',['basic_ostringstream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std']]], + ['basic_5fregex_50',['basic_regex',['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std::basic_regex'],['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::basic_regex::basic_regex()']]], + ['basic_5fstreambuf_51',['basic_streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std::basic_streambuf'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::basic_streambuf::basic_streambuf()']]], + ['basic_5fstring_52',['basic_string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::basic_string< Char >'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::basic_string::basic_string()']]], + ['basic_5fstring_3c_20char_20_3e_53',['basic_string< char >',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], + ['basic_5fstring_3c_20char16_5ft_20_3e_54',['basic_string< char16_t >',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], + ['basic_5fstring_3c_20char32_5ft_20_3e_55',['basic_string< char32_t >',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], + ['basic_5fstring_3c_20char8_5ft_20_3e_56',['basic_string< char8_t >',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], + ['basic_5fstring_3c_20wchar_5ft_20_3e_57',['basic_string< wchar_t >',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], + ['basic_5fstringbuf_58',['basic_stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std::basic_stringbuf'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::basic_stringbuf::basic_stringbuf()']]], + ['basic_5fstringstream_59',['basic_stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std::basic_stringstream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::basic_stringstream::basic_stringstream()']]], + ['basic_5fstringstream_3c_20char_20_3e_60',['basic_stringstream< char >',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std']]], + ['basic_5fstringstream_3c_20wchar_5ft_20_3e_61',['basic_stringstream< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std']]], + ['batch_5fpredict_62',['batch_predict',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a88bf9023ab3d4cdb61cf707c7cdfc86b',1,'machine_learning::neural_network::NeuralNetwork']]], + ['bayes_5fagivenb_63',['bayes_AgivenB',['../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba',1,'bayes_theorem.cpp']]], + ['bayes_5fbgivena_64',['bayes_BgivenA',['../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f',1,'bayes_theorem.cpp']]], + ['bayes_5ftheorem_2ecpp_65',['bayes_theorem.cpp',['../d5/d67/bayes__theorem_8cpp.html',1,'']]], + ['before_66',['before',['http://en.cppreference.com/w/cpp/types/type_info/before.html',0,'std::type_info']]], + ['before_20contributing_67',['Before contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md22',1,'']]], + ['before_5fbegin_68',['before_begin',['http://en.cppreference.com/w/cpp/container/forward_list/before_begin.html',0,'std::forward_list']]], + ['begin_69',['begin',['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::begin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::begin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::begin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::begin()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/begin.html',0,'std::initializer_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::begin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::begin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::begin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::begin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::begin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::begin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::begin()'],['http://en.cppreference.com/w/cpp/iterator/begin.html',0,'std::begin()']]], + ['begin_28int_29_70',['begin(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/begin2.html',0,'std::unordered_map::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2.html',0,'std::unordered_multimap::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin2.html',0,'std::unordered_multiset::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin2.html',0,'std::unordered_set::begin(int)()']]], + ['bernoulli_5fdistribution_71',['bernoulli_distribution',['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution.html',0,'std::bernoulli_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/bernoulli_distribution.html',0,'std::bernoulli_distribution::bernoulli_distribution()']]], + ['beta_72',['beta',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]], + ['bfs_73',['bfs',['../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93',1,'graph::HKGraph']]], + ['bidijkstra_74',['Bidijkstra',['../d7/d07/bidirectional__dijkstra_8cpp.html#a1b2df3d52a403ad46523ab90d3a723c1',1,'graph::bidirectional_dijkstra']]], + ['bidirectional_5fdijkstra_75',['bidirectional_dijkstra',['../d4/d13/namespacebidirectional__dijkstra.html',1,'']]], + ['bidirectional_5fdijkstra_2ecpp_76',['bidirectional_dijkstra.cpp',['../d7/d07/bidirectional__dijkstra_8cpp.html',1,'']]], + ['bidirectional_5fiterator_5ftag_77',['bidirectional_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], + ['binary_5fexponent_2ecpp_78',['binary_exponent.cpp',['../de/dcf/binary__exponent_8cpp.html',1,'']]], + ['binary_5ffunction_79',['binary_function',['http://en.cppreference.com/w/cpp/utility/functional/binary_function.html',0,'std']]], + ['binary_5finsertion_5fsort_2ecpp_80',['binary_insertion_sort.cpp',['../d8/dcc/binary__insertion__sort_8cpp.html',1,'']]], + ['binary_5fnegate_81',['binary_negate',['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate'],['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate::binary_negate()']]], + ['binary_5fs_82',['binary_s',['../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae',1,'exponential_search.cpp']]], + ['binary_5fsearch_83',['binary_search',['http://en.cppreference.com/w/cpp/algorithm/binary_search.html',0,'std::binary_search()'],['../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd',1,'sorting::binary_search()']]], + ['binary_5fsearch_5ftree_84',['binary_search_tree',['../d9/dde/classbinary__search__tree.html',1,'binary_search_tree< T >'],['../d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6',1,'binary_search_tree::binary_search_tree()']]], + ['binary_5fsearch_5ftree_2ecpp_85',['binary_search_tree.cpp',['../d3/d26/binary__search__tree_8cpp.html',1,'']]], + ['binary_5fsearch_5ftree2_2ecpp_86',['binary_search_tree2.cpp',['../df/d42/binary__search__tree2_8cpp.html',1,'']]], + ['binaryheap_2ecpp_87',['binaryheap.cpp',['../de/dc3/binaryheap_8cpp.html',1,'']]], + ['binarysearch_88',['BinarySearch',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf',1,'data_structures::list_array::list']]], + ['binarytree_89',['BinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree'],['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html',1,'others::iterative_tree_traversals::BinaryTree'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree(int64_t data)']]], + ['bind_90',['bind',['http://en.cppreference.com/w/cpp/utility/functional/bind.html',0,'std']]], + ['binexpo_91',['binExpo',['../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73',1,'binExpo(int a, int b): binary_exponent.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a4c6eefd1254eab3e8d34bf02c205e0f4',1,'binExpo(int64_t a, int64_t b, int64_t m): modular_inverse_fermat_little_theorem.cpp']]], + ['binexpo_5falt_92',['binExpo_alt',['../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f',1,'binary_exponent.cpp']]], + ['binomial_93',['binomial',['../d7/d7a/namespacebinomial.html',1,'']]], + ['binomial_5fcalculate_2ecpp_94',['binomial_calculate.cpp',['../d8/db1/binomial__calculate_8cpp.html',1,'']]], + ['binomial_5fdist_2ecpp_95',['binomial_dist.cpp',['../d6/db0/binomial__dist_8cpp.html',1,'']]], + ['binomial_5fdistribution_96',['binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution.html',0,'std::binomial_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/binomial_distribution.html',0,'std::binomial_distribution::binomial_distribution()']]], + ['binomial_5fexpected_97',['binomial_expected',['../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813',1,'binomial_dist.cpp']]], + ['binomial_5frange_5fsuccesses_98',['binomial_range_successes',['../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25',1,'binomial_dist.cpp']]], + ['binomial_5fstandard_5fdeviation_99',['binomial_standard_deviation',['../d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc',1,'binomial_dist.cpp']]], + ['binomial_5fvariance_100',['binomial_variance',['../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861',1,'binomial_dist.cpp']]], + ['binomial_5fx_5fsuccesses_101',['binomial_x_successes',['../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76',1,'binomial_dist.cpp']]], + ['binomialcoeffsum_102',['binomialCoeffSum',['../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea',1,'math']]], + ['bipartite_20graph_103',['Bipartite graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]], + ['bisection_5fmethod_2ecpp_104',['bisection_method.cpp',['../d7/d6a/bisection__method_8cpp.html',1,'']]], + ['bit_105',['bit',['../de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6',1,'range_queries::fenwick_tree']]], + ['bit_20manipulation_106',['Bit Manipulation',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46',1,'']]], + ['bit_5fand_107',['bit_and',['http://en.cppreference.com/w/cpp/utility/functional/bit_and.html',0,'std']]], + ['bit_5fmanipulation_108',['bit_manipulation',['../d7/d81/namespacebit__manipulation.html',1,'']]], + ['bit_5fnot_109',['bit_not',['http://en.cppreference.com/w/cpp/utility/functional/bit_not.html',0,'std']]], + ['bit_5for_110',['bit_or',['http://en.cppreference.com/w/cpp/utility/functional/bit_or.html',0,'std']]], + ['bitcount_111',['bitCount',['../d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b',1,'bit_manipulation::hamming_distance']]], + ['bitset_112',['Bitset',['../d9/dae/classdata__structures_1_1_bitset.html',1,'data_structures']]], + ['bitset_113',['bitset',['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std']]], + ['bitset_114',['Bitset',['../d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130',1,'data_structures::Bitset']]], + ['bitset_115',['bitset',['http://en.cppreference.com/w/cpp/utility/bitset/bitset.html',0,'std::bitset']]], + ['bitset_3c_20maxn_20_3e_116',['bitset< MAXN >',['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std']]], + ['black_117',['BLACK',['../da/d4b/depth__first__search__with__stack_8cpp.html#a7f1cd94cf4da32933e8551cb3577e18b',1,'depth_first_search_with_stack.cpp']]], + ['blocksize_118',['blockSize',['../d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f',1,'data_structures::Bitset']]], + ['bloom_5ffilter_2ecpp_119',['bloom_filter.cpp',['../d9/dab/bloom__filter_8cpp.html',1,'']]], + ['bloomfilter_120',['BloomFilter',['../dc/dd4/classdata__structures_1_1_bloom_filter.html',1,'data_structures::BloomFilter< T >'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a',1,'data_structures::BloomFilter::BloomFilter()']]], + ['bogo_5fsort_2ecpp_121',['bogo_sort.cpp',['../d5/ddb/bogo__sort_8cpp.html',1,'']]], + ['boolalpha_122',['boolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]], + ['boruvkas_123',['boruvkas',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]], + ['boruvkas_5fminimum_5fspanning_5ftree_124',['boruvkas_minimum_spanning_tree',['../d8/d64/namespaceboruvkas__minimum__spanning__tree.html',1,'']]], + ['boruvkas_5fminimum_5fspanning_5ftree_2ecpp_125',['boruvkas_minimum_spanning_tree.cpp',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html',1,'']]], + ['boyer_5fmoore_2ecpp_126',['boyer_moore.cpp',['../d3/db2/boyer__moore_8cpp.html',1,'']]], + ['breadth_5ffirst_5fsearch_127',['breadth_first_search',['../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981',1,'graph::Graph']]], + ['breadth_5ffirst_5fsearch_2ecpp_128',['breadth_first_search.cpp',['../df/d82/breadth__first__search_8cpp.html',1,'']]], + ['brent_5fmethod_5fextrema_2ecpp_129',['brent_method_extrema.cpp',['../db/d01/brent__method__extrema_8cpp.html',1,'']]], + ['brute_5fforce_130',['brute_force',['../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8',1,'string_search']]], + ['brute_5fforce_5fstring_5fsearching_2ecpp_131',['brute_force_string_searching.cpp',['../d3/d7d/brute__force__string__searching_8cpp.html',1,'']]], + ['bsearch_132',['bsearch',['http://en.cppreference.com/w/cpp/algorithm/bsearch.html',0,'std']]], + ['bst_5fnode_133',['bst_node',['../dd/db6/structbinary__search__tree_1_1bst__node.html',1,'binary_search_tree< T >::bst_node'],['../dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778',1,'binary_search_tree::bst_node::bst_node()']]], + ['bt_134',['BT',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html',1,'others::recursive_tree_traversals']]], + ['btowc_135',['btowc',['http://en.cppreference.com/w/cpp/string/multibyte/btowc.html',0,'std']]], + ['btree_136',['Btree',['../d9/d90/struct_btree.html',1,'']]], + ['bubble_5fsort_2ecpp_137',['bubble_sort.cpp',['../d8/d13/bubble__sort_8cpp.html',1,'']]], + ['bucket_138',['bucket',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket.html',0,'std::unordered_map::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket.html',0,'std::unordered_multimap::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket.html',0,'std::unordered_multiset::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket.html',0,'std::unordered_set::bucket()']]], + ['bucket_5fcount_139',['bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_count.html',0,'std::unordered_map::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_count.html',0,'std::unordered_multimap::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_count.html',0,'std::unordered_multiset::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_count.html',0,'std::unordered_set::bucket_count()']]], + ['bucket_5fsize_140',['bucket_size',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_size.html',0,'std::unordered_map::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_size.html',0,'std::unordered_multimap::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_size.html',0,'std::unordered_multiset::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_size.html',0,'std::unordered_set::bucket_size()']]], + ['build_141',['build',['../d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9',1,'range_queries::prefix_sum_array']]], + ['building_20locally_142',['Building Locally',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37',1,'']]], + ['buildtable_143',['buildTable',['../d4/d96/range__queries_2sparse__table_8cpp.html#a803a2451e87021d14ae06f148383e6bc',1,'range_queries::sparse_table']]], + ['buzz_5fnumber_2ecpp_144',['buzz_number.cpp',['../d1/d76/buzz__number_8cpp.html',1,'']]] ]; diff --git a/search/all_8.js b/search/all_8.js index 0a72b3f47..fc35a0901 100644 --- a/search/all_8.js +++ b/search/all_8.js @@ -3,29 +3,29 @@ var searchData= ['c_0',['The Algorithms - C++',['../index.html',1,'']]], ['c16rtomb_1',['c16rtomb',['http://en.cppreference.com/w/cpp/string/multibyte/c16rtomb.html',0,'std']]], ['c32rtomb_2',['c32rtomb',['http://en.cppreference.com/w/cpp/string/multibyte/c32rtomb.html',0,'std']]], - ['c_5fstr_3',['c_str',['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u16string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::basic_string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::wstring::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u32string::c_str()']]], + ['c_5fstr_3',['c_str',['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::basic_string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::wstring::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u16string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u32string::c_str()']]], ['cache_4',['cache',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8',1,'others::lru_cache::LRUCache']]], ['caesar_5',['caesar',['../dd/d81/namespacecaesar.html',1,'']]], ['caesar_5fcipher_2ecpp_6',['caesar_cipher.cpp',['../d6/d2c/caesar__cipher_8cpp.html',1,'']]], ['calculate_7',['calculate',['../d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978',1,'math::binomial']]], ['call_5fonce_8',['call_once',['http://en.cppreference.com/w/cpp/thread/call_once.html',0,'std']]], ['calloc_9',['calloc',['http://en.cppreference.com/w/cpp/memory/c/calloc.html',0,'std']]], - ['canimove_10',['canimove',['../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648',1,'backtracking::n_queens_all_solutions::CanIMove()'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9',1,'backtracking::n_queens_optimized::CanIMove()']]], + ['canimove_10',['CanIMove',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9',1,'backtracking::n_queens_optimized::CanIMove()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648',1,'backtracking::n_queens_all_solutions::CanIMove()']]], ['canjump_11',['canJump',['../df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755',1,'jumpgame.cpp']]], - ['capacity_12',['capacity',['http://en.cppreference.com/w/cpp/container/vector/capacity.html',0,'std::vector::capacity()'],['../d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02',1,'MinHeap::capacity'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u16string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::wstring::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::basic_string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u32string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::string::capacity()']]], + ['capacity_12',['capacity',['../d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02',1,'MinHeap::capacity'],['http://en.cppreference.com/w/cpp/container/vector/capacity.html',0,'std::vector::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::basic_string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::wstring::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u16string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u32string::capacity()']]], ['cardinality_20matching_13',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]], ['case_201_3a_20the_20given_20node_20has_20the_20right_20node_20subtree_14',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], ['case_202_3a_20the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_15',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], - ['catalog_16',['catalog',['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages_base::catalog'],['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages_byname::catalog'],['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages::catalog']]], + ['catalog_16',['catalog',['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages::catalog'],['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages_base::catalog'],['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages_byname::catalog']]], ['category_17',['category',['http://en.cppreference.com/w/cpp/error/error_code/category.html',0,'std::error_code::category()'],['http://en.cppreference.com/w/cpp/error/error_condition/category.html',0,'std::error_condition::category()']]], ['cauchy_5fdistribution_18',['cauchy_distribution',['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution.html',0,'std::cauchy_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/cauchy_distribution.html',0,'std::cauchy_distribution::cauchy_distribution()']]], ['cbefore_5fbegin_19',['cbefore_begin',['http://en.cppreference.com/w/cpp/container/forward_list/before_begin.html',0,'std::forward_list']]], - ['cbegin_20',['cbegin',['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::cbegin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::cbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::cbegin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::cbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::cbegin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::cbegin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::cbegin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::cbegin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::cbegin()']]], + ['cbegin_20',['cbegin',['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::cbegin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::cbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::cbegin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::cbegin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::cbegin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::cbegin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::cbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::cbegin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::cbegin()']]], ['cbegin_28int_29_21',['cbegin(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/begin2.html',0,'std::unordered_map::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2.html',0,'std::unordered_multimap::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin2.html',0,'std::unordered_multiset::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin2.html',0,'std::unordered_set::cbegin(int)()']]], ['cbrt_22',['cbrt',['http://en.cppreference.com/w/cpp/numeric/math/cbrt.html',0,'std']]], ['ceil_23',['ceil',['http://en.cppreference.com/w/cpp/numeric/math/ceil.html',0,'std']]], - ['cend_24',['cend',['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::cend()'],['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::cend()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::cend()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::cend()'],['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::cend()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::cend()'],['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::cend()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::cend()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::cend()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::cend(T... args)']]], - ['cend_28int_29_25',['cend(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::cend(int)()']]], + ['cend_24',['cend',['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::cend()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::cend()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::cend()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::cend()'],['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::cend()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::cend()'],['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::cend()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::cend()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::cend()'],['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::cend()']]], + ['cend_28int_29_25',['cend(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::cend(int)()']]], ['centi_26',['centi',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], ['cerr_27',['cerr',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], ['chain_5fquery_28',['chain_query',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24',1,'range_queries::heavy_light_decomposition::HLD']]], @@ -36,7 +36,7 @@ var searchData= ['char_5fto_5fint_33',['char_to_int',['../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988',1,'data_structures::trie']]], ['char_5fto_5fmorse_34',['char_to_morse',['../d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535',1,'ciphers::morse']]], ['char_5ftraits_35',['char_traits',['http://en.cppreference.com/w/cpp/string/char_traits.html',0,'std']]], - ['char_5ftype_36',['char_type',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate::char_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::char_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages::char_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::char_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct::char_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get::char_type'],['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put::char_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct::char_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get::char_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put::char_type']]], + ['char_5ftype_36',['char_type',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate::char_type'],['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages::char_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::char_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::char_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct::char_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get::char_type'],['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put::char_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct::char_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get::char_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put::char_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put_byname::char_type']]], ['check_37',['check',['../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a',1,'dynamic_programming::word_break']]], ['check_5famicable_5fpair_2ecpp_38',['check_amicable_pair.cpp',['../d5/df6/check__amicable__pair_8cpp.html',1,'']]], ['check_5ffactorial_2ecpp_39',['check_factorial.cpp',['../d8/dd5/check__factorial_8cpp.html',1,'']]], @@ -45,144 +45,151 @@ var searchData= ['check_5fsize_5fmatch_42',['check_size_match',['../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56',1,'machine_learning::adaline']]], ['check_5ftermination_43',['check_termination',['../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377',1,'durand_kerner_roots.cpp']]], ['checkbipartite_44',['checkBipartite',['../df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7',1,'graph']]], - ['chi_5fsquared_5fdistribution_45',['chi_squared_distribution',['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/chi_squared_distribution.html',0,'std::chi_squared_distribution::chi_squared_distribution()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution.html',0,'std::chi_squared_distribution']]], - ['children_46',['children',['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e',1,'data_structures::trie_using_hashmap::Trie::Node::children'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d',1,'data_structures::tree_234::Node::children']]], + ['chi_5fsquared_5fdistribution_45',['chi_squared_distribution',['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution.html',0,'std::chi_squared_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/chi_squared_distribution.html',0,'std::chi_squared_distribution::chi_squared_distribution()']]], + ['children_46',['children',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d',1,'data_structures::tree_234::Node::children'],['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e',1,'data_structures::trie_using_hashmap::Trie::Node::children']]], ['childs_47',['childs',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f',1,'data_structures::treap::Treap']]], ['cin_48',['cin',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]], - ['ciphers_49',['ciphers',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47',1,'Ciphers'],['../d6/d4e/namespaceciphers.html',1,'ciphers']]], - ['ciphers_3a_3aelliptic_5fcurve_5fkey_5fexchange_50',['elliptic_curve_key_exchange',['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html',1,'ciphers']]], - ['ciphers_5fuint128_5ft_5fhpp_5f_51',['CIPHERS_UINT128_T_HPP_',['../da/d41/uint128__t_8hpp.html#acce684d03a24f9c13a9ed36de6d24a57',1,'uint128_t.hpp']]], - ['ciphers_5fuint256_5ft_5fhpp_5f_52',['CIPHERS_UINT256_T_HPP_',['../da/da3/uint256__t_8hpp.html#a1d8c5ec5b5e419c5c8a740251485102c',1,'uint256_t.hpp']]], - ['circle_53',['circle',['../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903',1,'smallest_circle.cpp']]], - ['circle_5farea_54',['circle_area',['../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75',1,'math']]], - ['circle_5fperimeter_55',['circle_perimeter',['../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953',1,'math']]], - ['circular_5flinked_5flist_56',['circular_linked_list',['../d4/dcd/namespacecircular__linked__list.html',1,'']]], - ['circular_5flinked_5flist_2ecpp_57',['circular_linked_list.cpp',['../de/d33/circular__linked__list_8cpp.html',1,'']]], - ['circularlinkedlist_58',['circularlinkedlist',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList(CircularLinkedList &&source) noexcept']]], - ['classic_59',['classic',['http://en.cppreference.com/w/cpp/locale/locale/classic.html',0,'std::locale']]], - ['clear_60',['clear',['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ifstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_map/clear.html',0,'std::unordered_map::clear()'],['http://en.cppreference.com/w/cpp/container/list/clear.html',0,'std::list::clear()'],['http://en.cppreference.com/w/cpp/container/map/clear.html',0,'std::map::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_set/clear.html',0,'std::unordered_set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wfstream::clear()'],['http://en.cppreference.com/w/cpp/container/multimap/clear.html',0,'std::multimap::clear()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/clear.html',0,'std::atomic_flag::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wstringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ifstream::clear()'],['../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375',1,'queue::clear()'],['../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092',1,'stack::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ofstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u32string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::fstream::clear()'],['http://en.cppreference.com/w/cpp/container/vector/clear.html',0,'std::vector::clear()'],['http://en.cppreference.com/w/cpp/container/multiset/clear.html',0,'std::multiset::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostream::clear()'],['http://en.cppreference.com/w/cpp/container/set/clear.html',0,'std::set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wiostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ios::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_fstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::stringstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/clear.html',0,'std::unordered_multimap::clear()'],['http://en.cppreference.com/w/cpp/container/forward_list/clear.html',0,'std::forward_list::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_code/clear.html',0,'std::error_code::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wifstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istream::clear()'],['http://en.cppreference.com/w/cpp/container/deque/clear.html',0,'std::deque::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::strstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_stringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::basic_string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::wstring::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/clear.html',0,'std::unordered_multiset::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_condition/clear.html',0,'std::error_condition::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u16string::clear()']]], - ['clearerr_61',['clearerr',['http://en.cppreference.com/w/cpp/io/c/clearerr.html',0,'std']]], - ['cll_62',['cll',['../d5/d15/classcll.html',1,'']]], - ['clock_63',['clock',['http://en.cppreference.com/w/cpp/chrono/c/clock.html',0,'std']]], - ['clock_5ft_64',['clock_t',['http://en.cppreference.com/w/cpp/chrono/c/clock_t.html',0,'std']]], - ['clog_65',['clog',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], - ['close_66',['close',['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::ofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::ifstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::wofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::wfstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::basic_ifstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::filebuf::close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::wifstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::wfilebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::basic_fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::basic_filebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::basic_ofstream::close()']]], - ['cmake_20in_20a_20new_20directory_67',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], - ['cmatch_68',['cmatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::cmatch'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::cmatch::cmatch()']]], - ['cnt_69',['cnt',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919',1,'data_structures::treap::Treap']]], - ['code_70',['code',['http://en.cppreference.com/w/cpp/thread/future_error/code.html',0,'std::future_error::code()'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27',1,'Code'],['http://en.cppreference.com/w/cpp/error/system_error/code.html',0,'std::system_error::code()'],['http://en.cppreference.com/w/cpp/regex/regex_error/code.html',0,'std::regex_error::code()']]], - ['code_20analyzer_71',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]], - ['code_20formatter_72',['Code Formatter',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md39',1,'']]], - ['code_20of_20conduct_73',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], - ['code_20style_20convention_74',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]], - ['code_20style_20conventions_75',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]], - ['codec_76',['codec',['../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa',1,'ciphers::HillCipher']]], - ['codecvt_77',['codecvt',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt'],['http://en.cppreference.com/w/cpp/locale/codecvt/codecvt.html',0,'std::codecvt::codecvt()']]], - ['codecvt_5fbase_78',['codecvt_base',['http://en.cppreference.com/w/cpp/locale/codecvt_base.html',0,'std']]], - ['codecvt_5fbyname_79',['codecvt_byname',['http://en.cppreference.com/w/cpp/locale/codecvt_byname.html',0,'std::codecvt_byname'],['http://en.cppreference.com/w/cpp/locale/codecvt_byname.html',0,'std::codecvt_byname::codecvt_byname()']]], - ['codecvt_5futf16_80',['codecvt_utf16',['http://en.cppreference.com/w/cpp/locale/codecvt_utf16.html',0,'std']]], - ['codecvt_5futf8_81',['codecvt_utf8',['http://en.cppreference.com/w/cpp/locale/codecvt_utf8.html',0,'std']]], - ['codecvt_5futf8_5futf16_82',['codecvt_utf8_utf16',['http://en.cppreference.com/w/cpp/locale/codecvt_utf8_utf16.html',0,'std']]], - ['coin_5fchange_5ftopdown_2ecpp_83',['coin_change_topdown.cpp',['../d9/d31/coin__change__topdown_8cpp.html',1,'']]], - ['collate_84',['collate',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate'],['http://en.cppreference.com/w/cpp/locale/collate/collate.html',0,'std::collate::collate()']]], - ['collate_5fbyname_85',['collate_byname',['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std::collate_byname::collate_byname()'],['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std::collate_byname']]], - ['comb_86',['comb',['../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841',1,'data_structures::SegmentTree']]], - ['comb_5fsort_2ecpp_87',['comb_sort.cpp',['../d9/dfd/comb__sort_8cpp.html',1,'']]], - ['combine_88',['combine',['http://en.cppreference.com/w/cpp/locale/locale/combine.html',0,'std::locale::combine()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74',1,'range_queries::heavy_light_decomposition::SG::combine()']]], - ['combsort_89',['CombSort',['../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f',1,'comb_sort.cpp']]], - ['commit_20guidelines_90',['Commit Guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35',1,'']]], - ['common_5ftype_91',['common_type',['http://en.cppreference.com/w/cpp/types/common_type.html',0,'std']]], - ['compare_92',['compare',['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::csub_match::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::ssub_match::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::basic_string::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::wstring::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u16string::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u32string::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::sub_match::compare()'],['../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c',1,'compare(): shell_sort2.cpp'],['http://en.cppreference.com/w/cpp/string/char_traits/compare.html',0,'std::char_traits::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::string::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wcsub_match::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wssub_match::compare()'],['../d1/db3/structcompare.html',1,'compare'],['../de/d4a/class_compare.html',1,'Compare< S, T, E >']]], - ['compare_5fexchange_5fstrong_93',['compare_exchange_strong',['http://en.cppreference.com/w/cpp/atomic/atomic/compare_exchange.html',0,'std::atomic']]], - ['compare_5fexchange_5fweak_94',['compare_exchange_weak',['http://en.cppreference.com/w/cpp/atomic/atomic/compare_exchange.html',0,'std::atomic']]], - ['comparison_5foperator_95',['comparison_operator',['../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html',1,'machine_learning::aystar_search::AyStarSearch']]], - ['complex_96',['complex',['../da/d5a/class_complex.html',1,'Complex'],['http://en.cppreference.com/w/cpp/numeric/complex.html',0,'std::complex'],['../da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323',1,'Complex::Complex()'],['http://en.cppreference.com/w/cpp/numeric/complex/complex.html',0,'std::complex::complex()'],['../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867',1,'Complex::Complex()']]], - ['complex_5fnumbers_2ecpp_97',['complex_numbers.cpp',['../d5/d67/complex__numbers_8cpp.html',1,'']]], - ['complex_5fstr_98',['complex_str',['../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c',1,'durand_kerner_roots.cpp']]], - ['composite_5fsimpson_5frule_2ecpp_99',['composite_simpson_rule.cpp',['../d4/d18/composite__simpson__rule_8cpp.html',1,'']]], - ['compute_5fpadded_5fsize_100',['compute_padded_size',['../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27',1,'hashing::sha256']]], - ['computelogs_101',['computeLogs',['../d4/d96/range__queries_2sparse__table_8cpp.html#a40810d8c0fe3f8cf432ab128b1ae0300',1,'range_queries::sparse_table']]], - ['concept_102',['Concept',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md82',1,'']]], - ['condition_5fvariable_103',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable.html',0,'std::condition_variable'],['http://en.cppreference.com/w/cpp/thread/condition_variable/condition_variable.html',0,'std::condition_variable::condition_variable()']]], - ['condition_5fvariable_5fany_104',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/condition_variable_any.html',0,'std::condition_variable_any::condition_variable_any()'],['http://en.cppreference.com/w/cpp/thread/condition_variable_any.html',0,'std::condition_variable_any']]], - ['conditional_105',['conditional',['http://en.cppreference.com/w/cpp/types/conditional.html',0,'std']]], - ['conduct_106',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], - ['cone_5fvolume_107',['cone_volume',['../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7',1,'math']]], - ['connected_5fcomponents_2ecpp_108',['connected_components.cpp',['../df/ddd/connected__components_8cpp.html',1,'']]], - ['connected_5fcomponents_5fwith_5fdsu_2ecpp_109',['connected_components_with_dsu.cpp',['../d8/d99/connected__components__with__dsu_8cpp.html',1,'']]], - ['conquer_110',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]], - ['const_5fpointer_5fcast_111',['const_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], - ['constree_112',['ConsTree',['../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696',1,'segtree.cpp']]], - ['construct_113',['construct',['http://en.cppreference.com/w/cpp/memory/allocator/construct.html',0,'std::allocator::construct()'],['http://en.cppreference.com/w/cpp/memory/allocator_traits/construct.html',0,'std::allocator_traits::construct()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/construct.html',0,'std::scoped_allocator_adaptor::construct()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4',1,'range_queries::perSegTree::construct(const uint32_t &i, const uint32_t &j)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3',1,'range_queries::perSegTree::construct(const std::vector< int64_t > &vec)']]], - ['contains_114',['contains',['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b',1,'data_structures::BloomFilter::contains()'],['../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac',1,'data_structures::Bitset::contains()'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f',1,'data_structures::tree_234::Node::Contains()'],['../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2',1,'binary_search_tree::contains(std::unique_ptr< bst_node > &node, T value)'],['../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63',1,'binary_search_tree::contains(T value)']]], - ['contributing_115',['contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md22',1,'Before contributing'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md23',1,'Contributing']]], - ['contribution_20guidelines_116',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]], - ['contributions_117',['Contributions',['../index.html#autotoc_md107',1,'']]], - ['contributor_118',['Contributor',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md25',1,'']]], - ['contributor_20covenant_20code_20of_20conduct_119',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], - ['convention_120',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]], - ['conventions_121',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]], - ['converted_122',['converted',['http://en.cppreference.com/w/cpp/locale/wstring_convert/converted.html',0,'std::wstring_convert']]], - ['convexhull_123',['convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html',1,'geometry::jarvis::Convexhull'],['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870',1,'geometry::jarvis::Convexhull::Convexhull()']]], - ['copy_124',['copy',['http://en.cppreference.com/w/cpp/string/char_traits/copy.html',0,'std::char_traits::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::basic_string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::wstring::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u16string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u32string::copy()'],['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std::copy()']]], - ['copy_5fall_5fnodes_125',['copy_all_nodes',['../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511',1,'data_structures::linked_list']]], - ['copy_5fbackward_126',['copy_backward',['http://en.cppreference.com/w/cpp/algorithm/copy_backward.html',0,'std']]], - ['copy_5fif_127',['copy_if',['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std']]], - ['copy_5fn_128',['copy_n',['http://en.cppreference.com/w/cpp/algorithm/copy_n.html',0,'std']]], - ['copyfmt_129',['copyfmt',['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::strstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wfstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wiostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ios::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wstringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wifstream::copyfmt()']]], - ['copysign_130',['copysign',['http://en.cppreference.com/w/cpp/numeric/math/copysign.html',0,'std']]], - ['correction_131',['1. Correction',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md11',1,'']]], - ['cos_132',['cos',['http://en.cppreference.com/w/cpp/numeric/math/cos.html',0,'std']]], - ['cosh_133',['cosh',['http://en.cppreference.com/w/cpp/numeric/math/cosh.html',0,'std']]], - ['count_134',['count',['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::hours::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::duration::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::milliseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::minutes::count()'],['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::nanoseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::microseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::seconds::count()'],['http://en.cppreference.com/w/cpp/container/multimap/count.html',0,'std::multimap::count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/count.html',0,'std::unordered_set::count()'],['http://en.cppreference.com/w/cpp/container/map/count.html',0,'std::map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/count.html',0,'std::unordered_multimap::count()'],['http://en.cppreference.com/w/cpp/utility/bitset/count.html',0,'std::bitset::count()'],['http://en.cppreference.com/w/cpp/container/unordered_map/count.html',0,'std::unordered_map::count()'],['http://en.cppreference.com/w/cpp/container/set/count.html',0,'std::set::count()'],['http://en.cppreference.com/w/cpp/container/multiset/count.html',0,'std::multiset::count()'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921',1,'data_structures::tree_234::Node::count'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/count.html',0,'std::unordered_multiset::count()']]], - ['count_5fbits_5fflip_135',['count_bits_flip',['../d4/d38/namespacecount__bits__flip.html',1,'']]], - ['count_5fbits_5fflip_2ecpp_136',['count_bits_flip.cpp',['../d7/d56/count__bits__flip_8cpp.html',1,'']]], - ['count_5fif_137',['count_if',['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std']]], - ['count_5finversions_2ecpp_138',['count_inversions.cpp',['../d2/d26/count__inversions_8cpp.html',1,'']]], - ['count_5fof_5fset_5fbits_139',['count_of_set_bits',['../dd/dae/namespacecount__of__set__bits.html',1,'']]], - ['count_5fof_5fset_5fbits_2ecpp_140',['count_of_set_bits.cpp',['../da/db8/count__of__set__bits_8cpp.html',1,'']]], - ['count_5fof_5ftrailing_5fciphers_5fin_5ffactorial_5fn_141',['count_of_trailing_ciphers_in_factorial_n',['../dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html',1,'']]], - ['count_5fof_5ftrailing_5fciphers_5fin_5ffactorial_5fn_2ecpp_142',['count_of_trailing_ciphers_in_factorial_n.cpp',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html',1,'']]], - ['countbitsflip_143',['countBitsFlip',['../d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b',1,'bit_manipulation::count_bits_flip']]], - ['countinversion_144',['countInversion',['../d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80',1,'sorting::inversion']]], - ['countsetbits_145',['countSetBits',['../da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62',1,'bit_manipulation::count_of_set_bits']]], - ['cout_146',['cout',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], - ['covenant_20code_20of_20conduct_147',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], - ['cpu_20scheduling_20algorithms_148',['Cpu Scheduling Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'']]], - ['crbegin_149',['crbegin',['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::crbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::crbegin()'],['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::crbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::crbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::crbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::crbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::crbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::crbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::crbegin()']]], - ['create_5fhash_150',['create_hash',['../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8',1,'string_search']]], - ['create_5flist_151',['create_list',['../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5',1,'hash_search.cpp']]], - ['create_5fmatrix_152',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d',1,'qr_eigen_values.cpp']]], - ['create_5fmessage_5fschedule_5farray_153',['create_message_schedule_array',['../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a',1,'hashing::sha256']]], - ['create_5frandom_5farray_154',['create_random_array',['../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49',1,'insertion_sort.cpp']]], - ['createnewnode_155',['createnewnode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154',1,'others::recursive_tree_traversals::BT::createNewNode()']]], - ['createnode_156',['createNode',['../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6',1,'avltree.cpp']]], - ['createset_157',['CreateSet',['../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec',1,'disjoint_set.cpp']]], - ['cref_158',['cref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]], - ['cregex_5fiterator_159',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::cregex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::cregex_iterator::cregex_iterator()']]], - ['cregex_5ftoken_5fiterator_160',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::cregex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::cregex_token_iterator::cregex_token_iterator()']]], - ['crend_161',['crend',['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::crend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::crend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::crend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::crend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::crend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::crend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::crend()'],['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::crend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::crend()']]], - ['cross_162',['cross',['../df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9',1,'math::vector_cross']]], - ['csub_5fmatch_163',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::csub_match::csub_match()'],['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::csub_match']]], - ['ctime_164',['ctime',['http://en.cppreference.com/w/cpp/chrono/c/ctime.html',0,'std']]], - ['ctype_165',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype/ctype.html',0,'std::ctype::ctype()'],['http://en.cppreference.com/w/cpp/locale/ctype.html',0,'std::ctype']]], - ['ctype_5fbase_166',['ctype_base',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std']]], - ['ctype_5fbyname_167',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname'],['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname::ctype_byname()']]], - ['cube_5fsurface_5farea_168',['cube_surface_area',['../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c',1,'math']]], - ['cube_5fsurface_5fperimeter_169',['cube_surface_perimeter',['../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b',1,'math']]], - ['cube_5fvolume_170',['cube_volume',['../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725',1,'math']]], - ['cumulative_5fdistribution_171',['cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a',1,'probability::geometric_dist::geometric_distribution']]], - ['curr_5fsymbol_172',['curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::curr_symbol()']]], - ['current_5fexception_173',['current_exception',['http://en.cppreference.com/w/cpp/error/current_exception.html',0,'std']]], - ['current_5fsize_174',['current_size',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b',1,'data_structures::stack_using_queue::Stack']]], - ['cut_5frod_175',['cut_rod',['../d8/d36/namespacecut__rod.html',1,'']]], - ['cut_5frod_2ecpp_176',['cut_rod.cpp',['../d6/d10/cut__rod_8cpp.html',1,'']]], - ['cycle_5fdetection_177',['cycle_detection',['../da/d82/namespacecycle__detection.html',1,'']]], - ['cycle_5fsort_178',['cycle_sort',['../d4/dfb/namespacecycle__sort.html',1,'']]], - ['cycle_5fsort_2ecpp_179',['cycle_sort.cpp',['../de/d07/cycle__sort_8cpp.html',1,'']]], - ['cyclecheck_180',['CycleCheck',['../d3/dbb/class_cycle_check.html',1,'']]], - ['cyclesort_181',['cycleSort',['../de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa',1,'sorting::cycle_sort']]], - ['cylinder_5fsurface_5farea_182',['cylinder_surface_area',['../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864',1,'math']]], - ['cylinder_5fsurface_5fperimeter_183',['cylinder_surface_perimeter',['../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73',1,'math']]], - ['cylinder_5fvolume_184',['cylinder_volume',['../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca',1,'math']]] + ['ciphers_49',['ciphers',['../d6/d4e/namespaceciphers.html',1,'']]], + ['ciphers_50',['Ciphers',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47',1,'']]], + ['ciphers_3a_3aelliptic_5fcurve_5fkey_5fexchange_51',['elliptic_curve_key_exchange',['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html',1,'ciphers']]], + ['ciphers_5fuint128_5ft_5fhpp_5f_52',['CIPHERS_UINT128_T_HPP_',['../da/d41/uint128__t_8hpp.html#acce684d03a24f9c13a9ed36de6d24a57',1,'uint128_t.hpp']]], + ['ciphers_5fuint256_5ft_5fhpp_5f_53',['CIPHERS_UINT256_T_HPP_',['../da/da3/uint256__t_8hpp.html#a1d8c5ec5b5e419c5c8a740251485102c',1,'uint256_t.hpp']]], + ['circle_54',['circle',['../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903',1,'smallest_circle.cpp']]], + ['circle_5farea_55',['circle_area',['../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75',1,'math']]], + ['circle_5fperimeter_56',['circle_perimeter',['../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953',1,'math']]], + ['circular_5flinked_5flist_57',['circular_linked_list',['../d4/dcd/namespacecircular__linked__list.html',1,'']]], + ['circular_5flinked_5flist_2ecpp_58',['circular_linked_list.cpp',['../de/d33/circular__linked__list_8cpp.html',1,'']]], + ['circularlinkedlist_59',['CircularLinkedList',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList(const CircularLinkedList &copy)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList(CircularLinkedList &&source) noexcept']]], + ['classic_60',['classic',['http://en.cppreference.com/w/cpp/locale/locale/classic.html',0,'std::locale']]], + ['clear_61',['clear',['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::fstream::clear()'],['http://en.cppreference.com/w/cpp/container/vector/clear.html',0,'std::vector::clear()'],['http://en.cppreference.com/w/cpp/container/multiset/clear.html',0,'std::multiset::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostream::clear()'],['http://en.cppreference.com/w/cpp/container/set/clear.html',0,'std::set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostringstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_map/clear.html',0,'std::unordered_map::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ios::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_fstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::stringstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/clear.html',0,'std::unordered_multimap::clear()'],['http://en.cppreference.com/w/cpp/container/forward_list/clear.html',0,'std::forward_list::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_code/clear.html',0,'std::error_code::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wifstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istream::clear()'],['http://en.cppreference.com/w/cpp/container/deque/clear.html',0,'std::deque::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::strstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_stringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::basic_string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::wstring::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/clear.html',0,'std::unordered_multiset::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_condition/clear.html',0,'std::error_condition::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u16string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wiostream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u32string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ifstream::clear()'],['http://en.cppreference.com/w/cpp/container/list/clear.html',0,'std::list::clear()'],['http://en.cppreference.com/w/cpp/container/map/clear.html',0,'std::map::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_set/clear.html',0,'std::unordered_set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wfstream::clear()'],['http://en.cppreference.com/w/cpp/container/multimap/clear.html',0,'std::multimap::clear()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/clear.html',0,'std::atomic_flag::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wstringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ifstream::clear()'],['../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375',1,'queue::clear()'],['../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092',1,'stack::clear()']]], + ['clearerr_62',['clearerr',['http://en.cppreference.com/w/cpp/io/c/clearerr.html',0,'std']]], + ['cll_63',['cll',['../d5/d15/classcll.html',1,'']]], + ['clock_64',['clock',['http://en.cppreference.com/w/cpp/chrono/c/clock.html',0,'std']]], + ['clock_5ft_65',['clock_t',['http://en.cppreference.com/w/cpp/chrono/c/clock_t.html',0,'std']]], + ['clog_66',['clog',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['close_67',['close',['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::basic_ofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::basic_filebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::basic_fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::wfilebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::wifstream::close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::filebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::ofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::basic_ifstream::close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::wfstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::wofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::ifstream::close()']]], + ['cmake_20in_20a_20new_20directory_68',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], + ['cmatch_69',['cmatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::cmatch'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::cmatch::cmatch()']]], + ['cnt_70',['cnt',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919',1,'data_structures::treap::Treap']]], + ['code_71',['code',['http://en.cppreference.com/w/cpp/thread/future_error/code.html',0,'std::future_error::code()'],['http://en.cppreference.com/w/cpp/regex/regex_error/code.html',0,'std::regex_error::code()'],['http://en.cppreference.com/w/cpp/error/system_error/code.html',0,'std::system_error::code()']]], + ['code_72',['Code',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27',1,'']]], + ['code_20analyzer_73',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]], + ['code_20formatter_74',['Code Formatter',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md39',1,'']]], + ['code_20of_20conduct_75',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], + ['code_20style_20convention_76',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]], + ['code_20style_20conventions_77',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]], + ['codec_78',['codec',['../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa',1,'ciphers::HillCipher']]], + ['codecvt_79',['codecvt',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt'],['http://en.cppreference.com/w/cpp/locale/codecvt/codecvt.html',0,'std::codecvt::codecvt()']]], + ['codecvt_5fbase_80',['codecvt_base',['http://en.cppreference.com/w/cpp/locale/codecvt_base.html',0,'std']]], + ['codecvt_5fbyname_81',['codecvt_byname',['http://en.cppreference.com/w/cpp/locale/codecvt_byname.html',0,'std::codecvt_byname'],['http://en.cppreference.com/w/cpp/locale/codecvt_byname.html',0,'std::codecvt_byname::codecvt_byname()']]], + ['codecvt_5futf16_82',['codecvt_utf16',['http://en.cppreference.com/w/cpp/locale/codecvt_utf16.html',0,'std']]], + ['codecvt_5futf8_83',['codecvt_utf8',['http://en.cppreference.com/w/cpp/locale/codecvt_utf8.html',0,'std']]], + ['codecvt_5futf8_5futf16_84',['codecvt_utf8_utf16',['http://en.cppreference.com/w/cpp/locale/codecvt_utf8_utf16.html',0,'std']]], + ['coin_5fchange_5ftopdown_2ecpp_85',['coin_change_topdown.cpp',['../d9/d31/coin__change__topdown_8cpp.html',1,'']]], + ['collate_86',['collate',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate'],['http://en.cppreference.com/w/cpp/locale/collate/collate.html',0,'std::collate::collate()']]], + ['collate_5fbyname_87',['collate_byname',['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std::collate_byname'],['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std::collate_byname::collate_byname()']]], + ['comb_88',['comb',['../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841',1,'data_structures::SegmentTree']]], + ['comb_5fsort_2ecpp_89',['comb_sort.cpp',['../d9/dfd/comb__sort_8cpp.html',1,'']]], + ['combine_90',['combine',['http://en.cppreference.com/w/cpp/locale/locale/combine.html',0,'std::locale::combine()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74',1,'range_queries::heavy_light_decomposition::SG::combine()']]], + ['combsort_91',['CombSort',['../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f',1,'comb_sort.cpp']]], + ['commit_20guidelines_92',['Commit Guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35',1,'']]], + ['common_5ftype_93',['common_type',['http://en.cppreference.com/w/cpp/types/common_type.html',0,'std']]], + ['compare_94',['compare',['../d1/db3/structcompare.html',1,'']]], + ['compare_95',['Compare',['../de/d4a/class_compare.html',1,'']]], + ['compare_96',['compare',['http://en.cppreference.com/w/cpp/string/char_traits/compare.html',0,'std::char_traits::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::string::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wcsub_match::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wssub_match::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::csub_match::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::ssub_match::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::basic_string::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::wstring::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u16string::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u32string::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::sub_match::compare()'],['../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c',1,'compare(): shell_sort2.cpp']]], + ['compare_5fexchange_5fstrong_97',['compare_exchange_strong',['http://en.cppreference.com/w/cpp/atomic/atomic/compare_exchange.html',0,'std::atomic']]], + ['compare_5fexchange_5fweak_98',['compare_exchange_weak',['http://en.cppreference.com/w/cpp/atomic/atomic/compare_exchange.html',0,'std::atomic']]], + ['comparison_5foperator_99',['comparison_operator',['../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html',1,'machine_learning::aystar_search::AyStarSearch']]], + ['complex_100',['Complex',['../da/d5a/class_complex.html',1,'']]], + ['complex_101',['complex',['http://en.cppreference.com/w/cpp/numeric/complex.html',0,'std::complex'],['http://en.cppreference.com/w/cpp/numeric/complex/complex.html',0,'std::complex::complex()']]], + ['complex_102',['Complex',['../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867',1,'Complex::Complex(double x=0.f, double y=0.f, bool is_polar=false)'],['../da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323',1,'Complex::Complex(const Complex &other)']]], + ['complex_5fnumbers_2ecpp_103',['complex_numbers.cpp',['../d5/d67/complex__numbers_8cpp.html',1,'']]], + ['complex_5fstr_104',['complex_str',['../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c',1,'durand_kerner_roots.cpp']]], + ['composite_5fsimpson_5frule_2ecpp_105',['composite_simpson_rule.cpp',['../d4/d18/composite__simpson__rule_8cpp.html',1,'']]], + ['compute_5fpadded_5fsize_106',['compute_padded_size',['../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27',1,'hashing::sha256']]], + ['computelogs_107',['computeLogs',['../d4/d96/range__queries_2sparse__table_8cpp.html#a40810d8c0fe3f8cf432ab128b1ae0300',1,'range_queries::sparse_table']]], + ['concept_108',['Concept',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md82',1,'']]], + ['condition_5fvariable_109',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable.html',0,'std::condition_variable'],['http://en.cppreference.com/w/cpp/thread/condition_variable/condition_variable.html',0,'std::condition_variable::condition_variable()']]], + ['condition_5fvariable_5fany_110',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any.html',0,'std::condition_variable_any'],['http://en.cppreference.com/w/cpp/thread/condition_variable_any/condition_variable_any.html',0,'std::condition_variable_any::condition_variable_any()']]], + ['conditional_111',['conditional',['http://en.cppreference.com/w/cpp/types/conditional.html',0,'std']]], + ['conduct_112',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], + ['cone_5fvolume_113',['cone_volume',['../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7',1,'math']]], + ['connected_5fcomponents_2ecpp_114',['connected_components.cpp',['../df/ddd/connected__components_8cpp.html',1,'']]], + ['connected_5fcomponents_5fwith_5fdsu_2ecpp_115',['connected_components_with_dsu.cpp',['../d8/d99/connected__components__with__dsu_8cpp.html',1,'']]], + ['conquer_116',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]], + ['const_5fpointer_5fcast_117',['const_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], + ['constree_118',['ConsTree',['../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696',1,'segtree.cpp']]], + ['construct_119',['construct',['http://en.cppreference.com/w/cpp/memory/allocator_traits/construct.html',0,'std::allocator_traits::construct()'],['http://en.cppreference.com/w/cpp/memory/allocator/construct.html',0,'std::allocator::construct()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/construct.html',0,'std::scoped_allocator_adaptor::construct()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4',1,'range_queries::perSegTree::construct(const uint32_t &i, const uint32_t &j)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3',1,'range_queries::perSegTree::construct(const std::vector< int64_t > &vec)']]], + ['contains_120',['contains',['../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2',1,'binary_search_tree::contains(std::unique_ptr< bst_node > &node, T value)'],['../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63',1,'binary_search_tree::contains(T value)'],['../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac',1,'data_structures::Bitset::contains()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b',1,'data_structures::BloomFilter::contains()']]], + ['contains_121',['Contains',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f',1,'data_structures::tree_234::Node']]], + ['contributing_122',['Contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md22',1,'Before contributing'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md23',1,'Contributing']]], + ['contribution_20guidelines_123',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]], + ['contributions_124',['Contributions',['../index.html#autotoc_md107',1,'']]], + ['contributor_125',['Contributor',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md25',1,'']]], + ['contributor_20covenant_20code_20of_20conduct_126',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], + ['convention_127',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]], + ['conventions_128',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]], + ['converted_129',['converted',['http://en.cppreference.com/w/cpp/locale/wstring_convert/converted.html',0,'std::wstring_convert']]], + ['convexhull_130',['Convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html',1,'geometry::jarvis::Convexhull'],['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870',1,'geometry::jarvis::Convexhull::Convexhull()']]], + ['copy_131',['copy',['http://en.cppreference.com/w/cpp/string/char_traits/copy.html',0,'std::char_traits::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::basic_string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::wstring::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u16string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u32string::copy()'],['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std::copy()']]], + ['copy_5fall_5fnodes_132',['copy_all_nodes',['../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511',1,'data_structures::linked_list']]], + ['copy_5fbackward_133',['copy_backward',['http://en.cppreference.com/w/cpp/algorithm/copy_backward.html',0,'std']]], + ['copy_5fif_134',['copy_if',['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std']]], + ['copy_5fn_135',['copy_n',['http://en.cppreference.com/w/cpp/algorithm/copy_n.html',0,'std']]], + ['copyfmt_136',['copyfmt',['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ios::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::strstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wiostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wfstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wstringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ifstream::copyfmt()']]], + ['copysign_137',['copysign',['http://en.cppreference.com/w/cpp/numeric/math/copysign.html',0,'std']]], + ['correction_138',['1. Correction',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md11',1,'']]], + ['cos_139',['cos',['http://en.cppreference.com/w/cpp/numeric/math/cos.html',0,'std']]], + ['cosh_140',['cosh',['http://en.cppreference.com/w/cpp/numeric/math/cosh.html',0,'std']]], + ['count_141',['count',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921',1,'data_structures::tree_234::Node::count'],['http://en.cppreference.com/w/cpp/container/multiset/count.html',0,'std::multiset::count()'],['http://en.cppreference.com/w/cpp/container/set/count.html',0,'std::set::count()'],['http://en.cppreference.com/w/cpp/container/unordered_map/count.html',0,'std::unordered_map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/count.html',0,'std::unordered_multimap::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::minutes::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::seconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::duration::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::milliseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::hours::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::microseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::nanoseconds::count()'],['http://en.cppreference.com/w/cpp/utility/bitset/count.html',0,'std::bitset::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/count.html',0,'std::unordered_multiset::count()'],['http://en.cppreference.com/w/cpp/container/map/count.html',0,'std::map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/count.html',0,'std::unordered_set::count()'],['http://en.cppreference.com/w/cpp/container/multimap/count.html',0,'std::multimap::count()'],['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std::count()']]], + ['count_5fbits_5fflip_142',['count_bits_flip',['../d4/d38/namespacecount__bits__flip.html',1,'']]], + ['count_5fbits_5fflip_2ecpp_143',['count_bits_flip.cpp',['../d7/d56/count__bits__flip_8cpp.html',1,'']]], + ['count_5fif_144',['count_if',['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std']]], + ['count_5finversions_2ecpp_145',['count_inversions.cpp',['../d2/d26/count__inversions_8cpp.html',1,'']]], + ['count_5fof_5fset_5fbits_146',['count_of_set_bits',['../dd/dae/namespacecount__of__set__bits.html',1,'']]], + ['count_5fof_5fset_5fbits_2ecpp_147',['count_of_set_bits.cpp',['../da/db8/count__of__set__bits_8cpp.html',1,'']]], + ['count_5fof_5ftrailing_5fciphers_5fin_5ffactorial_5fn_148',['count_of_trailing_ciphers_in_factorial_n',['../dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html',1,'']]], + ['count_5fof_5ftrailing_5fciphers_5fin_5ffactorial_5fn_2ecpp_149',['count_of_trailing_ciphers_in_factorial_n.cpp',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html',1,'']]], + ['countbitsflip_150',['countBitsFlip',['../d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b',1,'bit_manipulation::count_bits_flip']]], + ['countinversion_151',['countInversion',['../d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80',1,'sorting::inversion']]], + ['countsetbits_152',['countSetBits',['../da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62',1,'bit_manipulation::count_of_set_bits']]], + ['cout_153',['cout',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['covenant_20code_20of_20conduct_154',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], + ['cpu_20scheduling_20algorithms_155',['Cpu Scheduling Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'']]], + ['crbegin_156',['crbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::crbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::crbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::crbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::crbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::crbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::crbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::crbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::crbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::crbegin()']]], + ['create_5fhash_157',['create_hash',['../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8',1,'string_search']]], + ['create_5flist_158',['create_list',['../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5',1,'hash_search.cpp']]], + ['create_5fmatrix_159',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d',1,'qr_eigen_values.cpp']]], + ['create_5fmessage_5fschedule_5farray_160',['create_message_schedule_array',['../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a',1,'hashing::sha256']]], + ['create_5frandom_5farray_161',['create_random_array',['../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49',1,'insertion_sort.cpp']]], + ['createnewnode_162',['createNewNode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154',1,'others::recursive_tree_traversals::BT::createNewNode()']]], + ['createnode_163',['createNode',['../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6',1,'avltree.cpp']]], + ['createset_164',['CreateSet',['../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec',1,'disjoint_set.cpp']]], + ['cref_165',['cref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]], + ['cregex_5fiterator_166',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::cregex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::cregex_iterator::cregex_iterator()']]], + ['cregex_5ftoken_5fiterator_167',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::cregex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::cregex_token_iterator::cregex_token_iterator()']]], + ['crend_168',['crend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::crend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::crend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::crend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::crend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::crend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::crend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::crend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::crend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::crend()']]], + ['cross_169',['cross',['../df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9',1,'math::vector_cross']]], + ['csub_5fmatch_170',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::csub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::csub_match::csub_match()']]], + ['ctime_171',['ctime',['http://en.cppreference.com/w/cpp/chrono/c/ctime.html',0,'std']]], + ['ctype_172',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype.html',0,'std::ctype'],['http://en.cppreference.com/w/cpp/locale/ctype/ctype.html',0,'std::ctype::ctype()']]], + ['ctype_5fbase_173',['ctype_base',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std']]], + ['ctype_5fbyname_174',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname'],['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname::ctype_byname()']]], + ['cube_5fsurface_5farea_175',['cube_surface_area',['../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c',1,'math']]], + ['cube_5fsurface_5fperimeter_176',['cube_surface_perimeter',['../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b',1,'math']]], + ['cube_5fvolume_177',['cube_volume',['../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725',1,'math']]], + ['cumulative_5fdistribution_178',['cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a',1,'probability::geometric_dist::geometric_distribution']]], + ['curr_5fsymbol_179',['curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::curr_symbol()']]], + ['current_5fexception_180',['current_exception',['http://en.cppreference.com/w/cpp/error/current_exception.html',0,'std']]], + ['current_5fsize_181',['current_size',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b',1,'data_structures::stack_using_queue::Stack']]], + ['cut_5frod_182',['cut_rod',['../d8/d36/namespacecut__rod.html',1,'']]], + ['cut_5frod_2ecpp_183',['cut_rod.cpp',['../d6/d10/cut__rod_8cpp.html',1,'']]], + ['cycle_5fdetection_184',['cycle_detection',['../da/d82/namespacecycle__detection.html',1,'']]], + ['cycle_5fsort_185',['cycle_sort',['../d4/dfb/namespacecycle__sort.html',1,'']]], + ['cycle_5fsort_2ecpp_186',['cycle_sort.cpp',['../de/d07/cycle__sort_8cpp.html',1,'']]], + ['cyclecheck_187',['CycleCheck',['../d3/dbb/class_cycle_check.html',1,'']]], + ['cyclesort_188',['cycleSort',['../de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa',1,'sorting::cycle_sort']]], + ['cylinder_5fsurface_5farea_189',['cylinder_surface_area',['../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864',1,'math']]], + ['cylinder_5fsurface_5fperimeter_190',['cylinder_surface_perimeter',['../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73',1,'math']]], + ['cylinder_5fvolume_191',['cylinder_volume',['../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca',1,'math']]] ]; diff --git a/search/all_9.js b/search/all_9.js index 3717febd8..6493cc160 100644 --- a/search/all_9.js +++ b/search/all_9.js @@ -1,18 +1,18 @@ var searchData= [ - ['data_0',['data',['../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243',1,'data: hash_search.cpp'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1',1,'operations_on_datastructures::circular_linked_list::Node::data'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::data'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f',1,'operations_on_datastructures::reverse_binary_tree::Node::data'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f',1,'others::iterative_tree_traversals::Node::data'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a3b8c7ec2863de75916be027fa5287570',1,'others::recursive_tree_traversals::Node::data'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b',1,'search::sublist_search::Node::data'],['http://en.cppreference.com/w/cpp/container/dynarray/data.html',0,'std::dynarray::data()'],['http://en.cppreference.com/w/cpp/container/vector/data.html',0,'std::vector::data()'],['http://en.cppreference.com/w/cpp/container/array/data.html',0,'std::array::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u32string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::basic_string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u16string::data()'],['../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73',1,'data_structures::Bitset::data'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::wstring::data()']]], + ['data_0',['data',['../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73',1,'data_structures::Bitset::data'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1',1,'operations_on_datastructures::circular_linked_list::Node::data'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::data'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f',1,'operations_on_datastructures::reverse_binary_tree::Node::data'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f',1,'others::iterative_tree_traversals::Node::data'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a3b8c7ec2863de75916be027fa5287570',1,'others::recursive_tree_traversals::Node::data'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b',1,'search::sublist_search::Node::data'],['http://en.cppreference.com/w/cpp/container/dynarray/data.html',0,'std::dynarray::data()'],['http://en.cppreference.com/w/cpp/container/vector/data.html',0,'std::vector::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::basic_string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::wstring::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u16string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u32string::data()'],['http://en.cppreference.com/w/cpp/container/array/data.html',0,'std::array::data()'],['../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243',1,'data: hash_search.cpp']]], ['data_20structure_20used_1',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md99',1,'']]], ['data_20structures_2',['Data Structures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49',1,'']]], ['data_5fstructures_3',['data_structures',['../d5/d3c/namespacedata__structures.html',1,'']]], ['datastructures_4',['Operations On Datastructures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61',1,'']]], - ['date_5forder_5',['date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::date_order()']]], + ['date_5forder_5',['date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::date_order()']]], ['day_6',['day',['../d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51',1,'EasterYearMonthDay']]], - ['deallocate_7',['deallocate',['http://en.cppreference.com/w/cpp/memory/allocator/deallocate.html',0,'std::allocator::deallocate()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/deallocate.html',0,'std::scoped_allocator_adaptor::deallocate()'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589',1,'operations_on_datastructures::inorder_traversal_of_bst::deallocate()'],['http://en.cppreference.com/w/cpp/memory/allocator_traits/deallocate.html',0,'std::allocator_traits::deallocate()']]], + ['deallocate_7',['deallocate',['http://en.cppreference.com/w/cpp/memory/allocator_traits/deallocate.html',0,'std::allocator_traits::deallocate()'],['http://en.cppreference.com/w/cpp/memory/allocator/deallocate.html',0,'std::allocator::deallocate()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/deallocate.html',0,'std::scoped_allocator_adaptor::deallocate()'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589',1,'operations_on_datastructures::inorder_traversal_of_bst::deallocate()']]], ['dec_8',['dec',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]], ['deca_9',['deca',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], ['decay_10',['decay',['http://en.cppreference.com/w/cpp/types/decay.html',0,'std']]], ['deci_11',['deci',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], - ['decimal_5fpoint_12',['decimal_point',['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::decimal_point()']]], + ['decimal_5fpoint_12',['decimal_point',['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::decimal_point()']]], ['decimal_5fto_5fbinary_2ecpp_13',['decimal_to_binary.cpp',['../df/d06/decimal__to__binary_8cpp.html',1,'']]], ['decimal_5fto_5fhexadecimal_2ecpp_14',['decimal_to_hexadecimal.cpp',['../da/de7/decimal__to__hexadecimal_8cpp.html',1,'']]], ['decimal_5fto_5froman_5fnumeral_2ecpp_15',['decimal_to_roman_numeral.cpp',['../de/d85/decimal__to__roman__numeral_8cpp.html',1,'']]], @@ -20,10 +20,10 @@ var searchData= ['declare_5freachable_17',['declare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/declare_reachable.html',0,'std']]], ['declval_18',['declval',['http://en.cppreference.com/w/cpp/utility/declval.html',0,'std']]], ['decreasekey_19',['decreaseKey',['../d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5',1,'MinHeap']]], - ['decrypt_20',['decrypt',['../d3/d4c/xor__cipher_8cpp.html#a6099b7e0f1793f418d2c1befca8355a4',1,'ciphers::XOR::decrypt()'],['../d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc',1,'ciphers::morse::decrypt()'],['../d6/d2c/caesar__cipher_8cpp.html#a355e69511cd2006b5c4c80ae95b71056',1,'ciphers::caesar::decrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e',1,'ciphers::vigenere::decrypt()'],['../de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38',1,'ciphers::a1z26::decrypt()']]], + ['decrypt_20',['decrypt',['../de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38',1,'ciphers::a1z26::decrypt()'],['../d6/d2c/caesar__cipher_8cpp.html#a355e69511cd2006b5c4c80ae95b71056',1,'ciphers::caesar::decrypt()'],['../d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc',1,'ciphers::morse::decrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e',1,'ciphers::vigenere::decrypt()'],['../d3/d4c/xor__cipher_8cpp.html#a6099b7e0f1793f418d2c1befca8355a4',1,'ciphers::XOR::decrypt()']]], ['decrypt_5ftext_21',['decrypt_text',['../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b',1,'ciphers::HillCipher']]], - ['default_5fdelete_22',['default_delete',['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete::default_delete()'],['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete']]], - ['default_5ferror_5fcondition_23',['default_error_condition',['http://en.cppreference.com/w/cpp/error/error_category/default_error_condition.html',0,'std::error_category::default_error_condition()'],['http://en.cppreference.com/w/cpp/error/error_code/default_error_condition.html',0,'std::error_code::default_error_condition()']]], + ['default_5fdelete_22',['default_delete',['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete'],['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete::default_delete()']]], + ['default_5ferror_5fcondition_23',['default_error_condition',['http://en.cppreference.com/w/cpp/error/error_code/default_error_condition.html',0,'std::error_code::default_error_condition()'],['http://en.cppreference.com/w/cpp/error/error_category/default_error_condition.html',0,'std::error_category::default_error_condition()']]], ['default_5frandom_5fengine_24',['default_random_engine',['http://en.cppreference.com/w/cpp/numeric/random.html',0,'std']]], ['defaultfloat_25',['defaultfloat',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], ['defer_5flock_5ft_26',['defer_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], @@ -35,117 +35,119 @@ var searchData= ['deleteelement_32',['deleteElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0',1,'data_structures::SkipList']]], ['deletefrom_33',['DeleteFrom',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169',1,'operations_on_datastructures::trie_operations::Tnode']]], ['deletekey_34',['deleteKey',['../d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29',1,'MinHeap']]], - ['deletenode_35',['deletenode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855',1,'data_structures::tree_234::Tree234::DeleteNode()'],['../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5',1,'deleteNode(): avltree.cpp']]], - ['deletestring_36',['deleteString',['../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab',1,'data_structures::trie']]], - ['denorm_5fmin_37',['denorm_min',['http://en.cppreference.com/w/cpp/types/numeric_limits/denorm_min.html',0,'std::numeric_limits']]], - ['denselayer_38',['denselayer',['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html',1,'machine_learning::neural_network::layers::DenseLayer'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &neurons, const std::string &activation, const std::vector< std::valarray< double > > &kernel)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &neurons, const std::string &activation, const std::pair< size_t, size_t > &kernel_shape, const bool &random_kernel)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(DenseLayer &&)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const DenseLayer &layer)=default']]], - ['densities_39',['densities',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::densities()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::densities()']]], - ['depth_40',['depth',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d',1,'machine_learning::aystar_search::AyStarSearch::Info::depth'],['../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429',1,'dsu::depth']]], - ['depth_5ffirst_5fsearch_41',['depth_first_search',['../d8/da7/namespacedepth__first__search.html',1,'depth_first_search'],['../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae',1,'graph::depth_first_search()']]], - ['depth_5ffirst_5fsearch_2ecpp_42',['depth_first_search.cpp',['../da/d8d/depth__first__search_8cpp.html',1,'']]], - ['depth_5ffirst_5fsearch_5fwith_5fstack_2ecpp_43',['depth_first_search_with_stack.cpp',['../da/d4b/depth__first__search__with__stack_8cpp.html',1,'']]], - ['deque_44',['deque',['http://en.cppreference.com/w/cpp/container/deque.html',0,'std::deque< T >'],['http://en.cppreference.com/w/cpp/container/deque/deque.html',0,'std::deque::deque()']]], - ['dequeue_45',['dequeue',['../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85',1,'queue::deQueue()'],['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622',1,'data_structures::queue_using_array::Queue_Array::dequeue()']]], - ['destroy_46',['destroy',['http://en.cppreference.com/w/cpp/memory/allocator_traits/destroy.html',0,'std::allocator_traits::destroy()'],['http://en.cppreference.com/w/cpp/memory/allocator/destroy.html',0,'std::allocator::destroy()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/destroy.html',0,'std::scoped_allocator_adaptor::destroy()']]], - ['detach_47',['detach',['http://en.cppreference.com/w/cpp/thread/thread/detach.html',0,'std::thread']]], - ['determinant_5flu_48',['determinant_lu',['../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f',1,'lu_decomposition.h']]], - ['dfs_49',['dfs',['../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9',1,'graph::depth_first_search::dfs()'],['../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0',1,'graph::HKGraph::dfs()']]], - ['dfs_5fhc_50',['dfs_hc',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8',1,'range_queries::heavy_light_decomposition::HLD']]], - ['dfs_5flabels_51',['dfs_labels',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8',1,'range_queries::heavy_light_decomposition::HLD']]], - ['dfs_5flca_52',['dfs_lca',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4',1,'range_queries::heavy_light_decomposition::Tree']]], - ['dfs_5fpar_53',['dfs_par',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a',1,'range_queries::heavy_light_decomposition::HLD']]], - ['dfs_5fsize_54',['dfs_size',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460',1,'range_queries::heavy_light_decomposition::Tree']]], - ['differential_20equations_55',['Ordinary Differential Equations',['../d6/d60/group__ode.html',1,'']]], - ['difftime_56',['difftime',['http://en.cppreference.com/w/cpp/chrono/c/difftime.html',0,'std']]], - ['digit_5fchar_57',['digit_char',['../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac',1,'large_number']]], - ['dijkstra_58',['dijkstra',['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#af915876d0ca33cc71a6a6191a8cd3ccd',1,'greedy_algorithms::dijkstra::dijkstra()'],['../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84',1,'graph::dijkstra()']]], - ['dijkstra_2ecpp_59',['dijkstra.cpp',['../d7/d1e/graph_2dijkstra_8cpp.html',1,'(Global Namespace)'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html',1,'(Global Namespace)']]], - ['direction_60',['direction',['../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655',1,'SegmentIntersection']]], - ['directory_61',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], - ['directory_20guidelines_62',['Directory guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'']]], - ['discard_63',['discard',['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/discard.html',0,'std::independent_bits_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux48_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mersenne_twister_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux24::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::linear_congruential_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::knuth_b::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand0::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::subtract_with_carry_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::discard_block_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux48::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux24_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937_64::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::shuffle_order_engine::discard()']]], - ['discard_5fblock_5fengine_64',['discard_block_engine',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std::discard_block_engine'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::discard_block_engine::discard_block_engine()']]], - ['discrete_5fdistribution_65',['discrete_distribution',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution.html',0,'std::discrete_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/discrete_distribution.html',0,'std::discrete_distribution::discrete_distribution()']]], - ['disjoint_5fset_2ecpp_66',['disjoint_set.cpp',['../de/d23/disjoint__set_8cpp.html',1,'']]], - ['disjoint_5funion_67',['disjoint_union',['../de/db4/namespacedisjoint__union.html',1,'']]], - ['display_68',['display',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53',1,'others::lru_cache::LRUCache::display()'],['../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368',1,'queue::display()'],['../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed',1,'hash_chain::display()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#abf7c97616b873ffeebdd0eac2d19d13e',1,'data_structures::linked_list::list::display()'],['../d5/d33/gram__schmidt_8cpp.html#ae6b496dce691e04f7f95ba0f0d33a289',1,'numerical_methods::gram_schmidt::display()'],['../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357',1,'quadratic_probing::display()'],['../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635',1,'linear_probing::display()'],['../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd',1,'double_hashing::display()'],['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631',1,'data_structures::queue_using_array::Queue_Array::display()'],['../d1/dc2/classstack.html#a8bce109630118a34faae717f72986033',1,'stack::display()']]], - ['displayelements_69',['displayElements',['../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72',1,'wiggle_sort.cpp']]], - ['displaylist_70',['displayList',['../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c',1,'data_structures::SkipList']]], - ['dist_71',['dist',['../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a',1,'graph::HKGraph']]], - ['distance_72',['distance',['http://en.cppreference.com/w/cpp/iterator/distance.html',0,'std']]], - ['div_73',['div',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]], - ['divide_74',['divide',['../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c',1,'uint128_t::divide()'],['../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1',1,'uint256_t::divide()']]], - ['divide_20and_20conquer_75',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]], - ['divide_5fand_5fconquer_76',['divide_and_conquer',['../dd/dba/namespacedivide__and__conquer.html',1,'']]], - ['divides_77',['divides',['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std']]], - ['dnf_5fsort_78',['dnf_sort',['../d9/d75/namespacednf__sort.html',1,'']]], - ['dnf_5fsort_2ecpp_79',['dnf_sort.cpp',['../d6/d1a/dnf__sort_8cpp.html',1,'']]], - ['dnfsort_80',['dnfSort',['../d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0',1,'sorting::dnf_sort']]], - ['do_5falways_5fnoconv_81',['do_always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::do_always_noconv()']]], - ['do_5fclose_82',['do_close',['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::do_close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::do_close()']]], - ['do_5fcompare_83',['do_compare',['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::do_compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::do_compare()']]], - ['do_5fcurr_5fsymbol_84',['do_curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::do_curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::do_curr_symbol()']]], - ['do_5fdate_5forder_85',['do_date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::do_date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::do_date_order()']]], - ['do_5fdecimal_5fpoint_86',['do_decimal_point',['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::do_decimal_point()']]], - ['do_5fencoding_87',['do_encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::do_encoding()']]], - ['do_5ffalsename_88',['do_falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_falsename()']]], - ['do_5ffrac_5fdigits_89',['do_frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::do_frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::do_frac_digits()']]], - ['do_5fget_90',['do_get',['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::do_get()'],['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::do_get()']]], - ['do_5fget_5fdate_91',['do_get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::do_get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::do_get_date()']]], - ['do_5fget_5fmonthname_92',['do_get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::do_get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::do_get_monthname(T... args)']]], - ['do_5fget_5ftime_93',['do_get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::do_get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::do_get_time(T... args)']]], - ['do_5fget_5fweekday_94',['do_get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::do_get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::do_get_weekday()']]], - ['do_5fget_5fyear_95',['do_get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::do_get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::do_get_year()']]], - ['do_5fgrouping_96',['do_grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::do_grouping()']]], - ['do_5fhash_97',['do_hash',['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::do_hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::do_hash()']]], - ['do_5fin_98',['do_in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::do_in()']]], - ['do_5fis_99',['do_is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::do_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::do_is()']]], - ['do_5flength_100',['do_length',['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::do_length(T... args)']]], - ['do_5fmax_5flength_101',['do_max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::do_max_length()']]], - ['do_5fnarrow_102',['do_narrow',['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::do_narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::do_narrow()']]], - ['do_5fneg_5fformat_103',['do_neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_neg_format()']]], - ['do_5fnegative_5fsign_104',['do_negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_negative_sign()']]], - ['do_5fopen_105',['do_open',['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::do_open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::do_open()']]], - ['do_5fout_106',['do_out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::do_out()']]], - ['do_5fpos_5fformat_107',['do_pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_pos_format(T... args)']]], - ['do_5fpositive_5fsign_108',['do_positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_positive_sign()']]], - ['do_5fput_109',['do_put',['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::do_put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::do_put()']]], - ['do_5fscan_5fis_110',['do_scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::do_scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::do_scan_is()']]], - ['do_5fthousands_5fsep_111',['do_thousands_sep',['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::do_thousands_sep()']]], - ['do_5ftolower_112',['do_tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::do_tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::do_tolower(T... args)']]], - ['do_5ftoupper_113',['do_toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::do_toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::do_toupper()']]], - ['do_5ftransform_114',['do_transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::do_transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::do_transform()']]], - ['do_5ftruename_115',['do_truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_truename()']]], - ['do_5funshift_116',['do_unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::do_unshift()']]], - ['do_5fwiden_117',['do_widen',['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::do_widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::do_widen()']]], - ['documentation_118',['documentation',['../index.html#autotoc_md106',1,'Documentation'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28',1,'Documentation']]], - ['does_20not_20have_20a_20right_20node_20subtree_119',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], - ['domain_5ferror_120',['domain_error',['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error::domain_error()'],['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error']]], - ['dot_5fproduct_121',['dot_product',['../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d',1,'numerical_methods::gram_schmidt']]], - ['double_5ffactorial_2ecpp_122',['double_factorial.cpp',['../d7/d89/double__factorial_8cpp.html',1,'']]], - ['double_5ffactorial_5fiterative_123',['double_factorial_iterative',['../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26',1,'double_factorial.cpp']]], - ['double_5ffactorial_5frecursive_124',['double_factorial_recursive',['../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d',1,'double_factorial.cpp']]], - ['double_5fhash_5fhash_5ftable_2ecpp_125',['double_hash_hash_table.cpp',['../d6/d80/double__hash__hash__table_8cpp.html',1,'']]], - ['double_5fhashing_126',['double_hashing',['../d0/d65/namespacedouble__hashing.html',1,'']]], - ['double_5flinked_5flist_127',['double_linked_list',['../d9/dee/classdouble__linked__list.html',1,'']]], - ['doublehash_128',['doubleHash',['../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200',1,'double_hashing']]], - ['dp_129',['dp',['../df/d88/namespacedp.html',1,'']]], - ['dptable_130',['dpTable',['../dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a',1,'backtracking::wildcard_matching']]], - ['draw_5fsample_131',['draw_sample',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3',1,'probability::geometric_dist::geometric_distribution']]], - ['drelu_132',['drelu',['../d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9',1,'machine_learning::neural_network::activations']]], - ['dsigmoid_133',['dsigmoid',['../d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46',1,'machine_learning::neural_network::activations']]], - ['dsu_134',['dsu',['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)'],['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)'],['../dd/d1f/classdsu.html',1,'dsu']]], - ['dsu_5fpath_5fcompression_2ecpp_135',['dsu_path_compression.cpp',['../d3/dae/dsu__path__compression_8cpp.html',1,'']]], - ['dsu_5funion_5frank_2ecpp_136',['dsu_union_rank.cpp',['../df/d28/dsu__union__rank_8cpp.html',1,'']]], - ['dtanh_137',['dtanh',['../d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c',1,'machine_learning::neural_network::activations']]], - ['duplicatenumber_138',['duplicateNumber',['../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88',1,'search::cycle_detection']]], - ['durand_5fkerner_5falgo_139',['durand_kerner_algo',['../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd',1,'durand_kerner_roots.cpp']]], - ['durand_5fkerner_5froots_2ecpp_140',['durand_kerner_roots.cpp',['../da/df2/durand__kerner__roots_8cpp.html',1,'']]], - ['duration_141',['duration',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::duration::duration()'],['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::duration']]], - ['duration_5fcast_142',['duration_cast',['http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html',0,'std::chrono']]], - ['duration_5fvalues_143',['duration_values',['http://en.cppreference.com/w/cpp/chrono/duration_values.html',0,'std::chrono']]], - ['dynamic_20programming_144',['Dynamic Programming',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51',1,'']]], - ['dynamic_5fpointer_5fcast_145',['dynamic_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], - ['dynamic_5fprogramming_146',['dynamic_programming',['../dd/d24/namespacedynamic__programming.html',1,'']]], - ['dynarray_147',['dynarray',['http://en.cppreference.com/w/cpp/container/dynarray/dynarray.html',0,'std::dynarray::dynarray()'],['http://en.cppreference.com/w/cpp/container/dynarray.html',0,'std::dynarray']]] + ['deletenode_35',['DeleteNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855',1,'data_structures::tree_234::Tree234']]], + ['deletenode_36',['deleteNode',['../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5',1,'avltree.cpp']]], + ['deletestring_37',['deleteString',['../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab',1,'data_structures::trie']]], + ['denorm_5fmin_38',['denorm_min',['http://en.cppreference.com/w/cpp/types/numeric_limits/denorm_min.html',0,'std::numeric_limits']]], + ['denselayer_39',['DenseLayer',['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html',1,'machine_learning::neural_network::layers::DenseLayer'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &neurons, const std::string &activation, const std::pair< size_t, size_t > &kernel_shape, const bool &random_kernel)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &neurons, const std::string &activation, const std::vector< std::valarray< double > > &kernel)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const DenseLayer &layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(DenseLayer &&)=default']]], + ['densities_40',['densities',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::densities()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::densities()']]], + ['depth_41',['depth',['../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429',1,'dsu::depth'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d',1,'machine_learning::aystar_search::AyStarSearch::Info::depth']]], + ['depth_5ffirst_5fsearch_42',['depth_first_search',['../d8/da7/namespacedepth__first__search.html',1,'depth_first_search'],['../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae',1,'graph::depth_first_search()']]], + ['depth_5ffirst_5fsearch_2ecpp_43',['depth_first_search.cpp',['../da/d8d/depth__first__search_8cpp.html',1,'']]], + ['depth_5ffirst_5fsearch_5fwith_5fstack_2ecpp_44',['depth_first_search_with_stack.cpp',['../da/d4b/depth__first__search__with__stack_8cpp.html',1,'']]], + ['deque_45',['deque',['http://en.cppreference.com/w/cpp/container/deque.html',0,'std::deque< T >'],['http://en.cppreference.com/w/cpp/container/deque/deque.html',0,'std::deque::deque()']]], + ['dequeue_46',['dequeue',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622',1,'data_structures::queue_using_array::Queue_Array']]], + ['dequeue_47',['deQueue',['../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85',1,'queue']]], + ['destroy_48',['destroy',['http://en.cppreference.com/w/cpp/memory/allocator_traits/destroy.html',0,'std::allocator_traits::destroy()'],['http://en.cppreference.com/w/cpp/memory/allocator/destroy.html',0,'std::allocator::destroy()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/destroy.html',0,'std::scoped_allocator_adaptor::destroy()']]], + ['detach_49',['detach',['http://en.cppreference.com/w/cpp/thread/thread/detach.html',0,'std::thread']]], + ['determinant_5flu_50',['determinant_lu',['../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f',1,'lu_decomposition.h']]], + ['dfs_51',['dfs',['../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0',1,'graph::HKGraph::dfs()'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9',1,'graph::depth_first_search::dfs()']]], + ['dfs_5fhc_52',['dfs_hc',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8',1,'range_queries::heavy_light_decomposition::HLD']]], + ['dfs_5flabels_53',['dfs_labels',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8',1,'range_queries::heavy_light_decomposition::HLD']]], + ['dfs_5flca_54',['dfs_lca',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4',1,'range_queries::heavy_light_decomposition::Tree']]], + ['dfs_5fpar_55',['dfs_par',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a',1,'range_queries::heavy_light_decomposition::HLD']]], + ['dfs_5fsize_56',['dfs_size',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460',1,'range_queries::heavy_light_decomposition::Tree']]], + ['differential_20equations_57',['Ordinary Differential Equations',['../d6/d60/group__ode.html',1,'']]], + ['difftime_58',['difftime',['http://en.cppreference.com/w/cpp/chrono/c/difftime.html',0,'std']]], + ['digit_5fchar_59',['digit_char',['../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac',1,'large_number']]], + ['dijkstra_60',['dijkstra',['../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84',1,'graph::dijkstra()'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#af915876d0ca33cc71a6a6191a8cd3ccd',1,'greedy_algorithms::dijkstra::dijkstra()']]], + ['dijkstra_2ecpp_61',['dijkstra.cpp',['../d7/d1e/graph_2dijkstra_8cpp.html',1,'(Global Namespace)'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html',1,'(Global Namespace)']]], + ['direction_62',['direction',['../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655',1,'SegmentIntersection']]], + ['directory_63',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], + ['directory_20guidelines_64',['Directory guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'']]], + ['discard_65',['discard',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937_64::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux24_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux48::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::discard_block_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mersenne_twister_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/discard.html',0,'std::independent_bits_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux48_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::shuffle_order_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux24::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::linear_congruential_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::knuth_b::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand0::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::subtract_with_carry_engine::discard()']]], + ['discard_5fblock_5fengine_66',['discard_block_engine',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std::discard_block_engine'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::discard_block_engine::discard_block_engine()']]], + ['discrete_5fdistribution_67',['discrete_distribution',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution.html',0,'std::discrete_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/discrete_distribution.html',0,'std::discrete_distribution::discrete_distribution()']]], + ['disjoint_5fset_2ecpp_68',['disjoint_set.cpp',['../de/d23/disjoint__set_8cpp.html',1,'']]], + ['disjoint_5funion_69',['disjoint_union',['../de/db4/namespacedisjoint__union.html',1,'']]], + ['display_70',['display',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#abf7c97616b873ffeebdd0eac2d19d13e',1,'data_structures::linked_list::list::display()'],['../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368',1,'queue::display()'],['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631',1,'data_structures::queue_using_array::Queue_Array::display()'],['../d1/dc2/classstack.html#a8bce109630118a34faae717f72986033',1,'stack::display()'],['../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed',1,'hash_chain::display()'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53',1,'others::lru_cache::LRUCache::display()'],['../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd',1,'double_hashing::display()'],['../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635',1,'linear_probing::display()'],['../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357',1,'quadratic_probing::display()'],['../d5/d33/gram__schmidt_8cpp.html#ae6b496dce691e04f7f95ba0f0d33a289',1,'numerical_methods::gram_schmidt::display()']]], + ['displayelements_71',['displayElements',['../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72',1,'wiggle_sort.cpp']]], + ['displaylist_72',['displayList',['../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c',1,'data_structures::SkipList']]], + ['dist_73',['dist',['../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a',1,'graph::HKGraph']]], + ['distance_74',['distance',['http://en.cppreference.com/w/cpp/iterator/distance.html',0,'std']]], + ['div_75',['div',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]], + ['divide_76',['divide',['../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c',1,'uint128_t::divide()'],['../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1',1,'uint256_t::divide()']]], + ['divide_20and_20conquer_77',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]], + ['divide_5fand_5fconquer_78',['divide_and_conquer',['../dd/dba/namespacedivide__and__conquer.html',1,'']]], + ['divides_79',['divides',['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std']]], + ['dnf_5fsort_80',['dnf_sort',['../d9/d75/namespacednf__sort.html',1,'']]], + ['dnf_5fsort_2ecpp_81',['dnf_sort.cpp',['../d6/d1a/dnf__sort_8cpp.html',1,'']]], + ['dnfsort_82',['dnfSort',['../d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0',1,'sorting::dnf_sort']]], + ['do_5falways_5fnoconv_83',['do_always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::do_always_noconv()']]], + ['do_5fclose_84',['do_close',['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::do_close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::do_close()']]], + ['do_5fcompare_85',['do_compare',['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::do_compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::do_compare()']]], + ['do_5fcurr_5fsymbol_86',['do_curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::do_curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::do_curr_symbol()']]], + ['do_5fdate_5forder_87',['do_date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::do_date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::do_date_order()']]], + ['do_5fdecimal_5fpoint_88',['do_decimal_point',['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::do_decimal_point()']]], + ['do_5fencoding_89',['do_encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::do_encoding()']]], + ['do_5ffalsename_90',['do_falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_falsename()']]], + ['do_5ffrac_5fdigits_91',['do_frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::do_frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::do_frac_digits()']]], + ['do_5fget_92',['do_get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::do_get()']]], + ['do_5fget_5fdate_93',['do_get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::do_get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::do_get_date()']]], + ['do_5fget_5fmonthname_94',['do_get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::do_get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::do_get_monthname()']]], + ['do_5fget_5ftime_95',['do_get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::do_get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::do_get_time()']]], + ['do_5fget_5fweekday_96',['do_get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::do_get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::do_get_weekday()']]], + ['do_5fget_5fyear_97',['do_get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::do_get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::do_get_year()']]], + ['do_5fgrouping_98',['do_grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::do_grouping()']]], + ['do_5fhash_99',['do_hash',['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::do_hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::do_hash()']]], + ['do_5fin_100',['do_in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::do_in()']]], + ['do_5fis_101',['do_is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::do_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::do_is()']]], + ['do_5flength_102',['do_length',['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::do_length()']]], + ['do_5fmax_5flength_103',['do_max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::do_max_length()']]], + ['do_5fnarrow_104',['do_narrow',['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::do_narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::do_narrow()']]], + ['do_5fneg_5fformat_105',['do_neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_neg_format()']]], + ['do_5fnegative_5fsign_106',['do_negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_negative_sign()']]], + ['do_5fopen_107',['do_open',['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::do_open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::do_open()']]], + ['do_5fout_108',['do_out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::do_out()']]], + ['do_5fpos_5fformat_109',['do_pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_pos_format()']]], + ['do_5fpositive_5fsign_110',['do_positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_positive_sign()']]], + ['do_5fput_111',['do_put',['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::do_put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::do_put()']]], + ['do_5fscan_5fis_112',['do_scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::do_scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::do_scan_is()']]], + ['do_5fthousands_5fsep_113',['do_thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::do_thousands_sep()']]], + ['do_5ftolower_114',['do_tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::do_tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::do_tolower()']]], + ['do_5ftoupper_115',['do_toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::do_toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::do_toupper()']]], + ['do_5ftransform_116',['do_transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::do_transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::do_transform()']]], + ['do_5ftruename_117',['do_truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_truename()']]], + ['do_5funshift_118',['do_unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::do_unshift()']]], + ['do_5fwiden_119',['do_widen',['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::do_widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::do_widen()']]], + ['documentation_120',['Documentation',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28',1,'Documentation'],['../index.html#autotoc_md106',1,'Documentation']]], + ['does_20not_20have_20a_20right_20node_20subtree_121',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['domain_5ferror_122',['domain_error',['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error'],['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error::domain_error()']]], + ['dot_5fproduct_123',['dot_product',['../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d',1,'numerical_methods::gram_schmidt']]], + ['double_5ffactorial_2ecpp_124',['double_factorial.cpp',['../d7/d89/double__factorial_8cpp.html',1,'']]], + ['double_5ffactorial_5fiterative_125',['double_factorial_iterative',['../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26',1,'double_factorial.cpp']]], + ['double_5ffactorial_5frecursive_126',['double_factorial_recursive',['../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d',1,'double_factorial.cpp']]], + ['double_5fhash_5fhash_5ftable_2ecpp_127',['double_hash_hash_table.cpp',['../d6/d80/double__hash__hash__table_8cpp.html',1,'']]], + ['double_5fhashing_128',['double_hashing',['../d0/d65/namespacedouble__hashing.html',1,'']]], + ['double_5flinked_5flist_129',['double_linked_list',['../d9/dee/classdouble__linked__list.html',1,'']]], + ['doublehash_130',['doubleHash',['../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200',1,'double_hashing']]], + ['dp_131',['dp',['../df/d88/namespacedp.html',1,'']]], + ['dptable_132',['dpTable',['../dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a',1,'backtracking::wildcard_matching']]], + ['draw_5fsample_133',['draw_sample',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3',1,'probability::geometric_dist::geometric_distribution']]], + ['drelu_134',['drelu',['../d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9',1,'machine_learning::neural_network::activations']]], + ['dsigmoid_135',['dsigmoid',['../d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46',1,'machine_learning::neural_network::activations']]], + ['dsu_136',['dsu',['../dd/d1f/classdsu.html',1,'dsu'],['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)'],['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)']]], + ['dsu_5fpath_5fcompression_2ecpp_137',['dsu_path_compression.cpp',['../d3/dae/dsu__path__compression_8cpp.html',1,'']]], + ['dsu_5funion_5frank_2ecpp_138',['dsu_union_rank.cpp',['../df/d28/dsu__union__rank_8cpp.html',1,'']]], + ['dtanh_139',['dtanh',['../d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c',1,'machine_learning::neural_network::activations']]], + ['duplicatenumber_140',['duplicateNumber',['../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88',1,'search::cycle_detection']]], + ['durand_5fkerner_5falgo_141',['durand_kerner_algo',['../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd',1,'durand_kerner_roots.cpp']]], + ['durand_5fkerner_5froots_2ecpp_142',['durand_kerner_roots.cpp',['../da/df2/durand__kerner__roots_8cpp.html',1,'']]], + ['duration_143',['duration',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::duration'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::duration::duration()']]], + ['duration_5fcast_144',['duration_cast',['http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html',0,'std::chrono']]], + ['duration_5fvalues_145',['duration_values',['http://en.cppreference.com/w/cpp/chrono/duration_values.html',0,'std::chrono']]], + ['dynamic_20programming_146',['Dynamic Programming',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51',1,'']]], + ['dynamic_5fpointer_5fcast_147',['dynamic_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], + ['dynamic_5fprogramming_148',['dynamic_programming',['../dd/d24/namespacedynamic__programming.html',1,'']]], + ['dynarray_149',['dynarray',['http://en.cppreference.com/w/cpp/container/dynarray.html',0,'std::dynarray'],['http://en.cppreference.com/w/cpp/container/dynarray/dynarray.html',0,'std::dynarray::dynarray()']]] ]; diff --git a/search/all_a.js b/search/all_a.js index 69b2c2af7..8cd2a27f5 100644 --- a/search/all_a.js +++ b/search/all_a.js @@ -1,90 +1,92 @@ var searchData= [ ['easteryearmonthday_0',['EasterYearMonthDay',['../d1/df6/class_easter_year_month_day.html',1,'']]], - ['eback_1',['eback',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::eback()']]], - ['edge_2',['edge',['../d7/d77/class_edge.html',1,'Edge'],['../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980',1,'Edge::Edge()']]], + ['eback_1',['eback',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::eback()']]], + ['edge_2',['Edge',['../d7/d77/class_edge.html',1,'Edge'],['../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980',1,'Edge::Edge()']]], ['edges_3',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]], ['editdistdp_4',['editDistDP',['../da/d52/minimum__edit__distance_8cpp.html#ade2fcfe0359f3c7691bfaa04b14943e2',1,'dynamic_programming::minimum_edit_distance']]], - ['egptr_5',['egptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::egptr()']]], + ['egptr_5',['egptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::egptr()']]], ['eigen_5fvalues_6',['eigen_values',['../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc',1,'qr_algorithm']]], - ['eightpuzzle_7',['eightpuzzle',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html',1,'machine_learning::aystar_search::EightPuzzle< N >'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const std::array< std::array< uint32_t, N >, N > &init)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle< N > &A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle< N > &&A) noexcept']]], + ['eightpuzzle_7',['EightPuzzle',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html',1,'machine_learning::aystar_search::EightPuzzle< N >'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const std::array< std::array< uint32_t, N >, N > &init)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle< N > &A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle< N > &&A) noexcept']]], ['elliptic_5fcurve_5fkey_5fexchange_2ecpp_8',['elliptic_curve_key_exchange.cpp',['../df/d2c/elliptic__curve__key__exchange_8cpp.html',1,'']]], - ['emplace_9',['emplace',['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace.html',0,'std::unordered_multimap::emplace()'],['http://en.cppreference.com/w/cpp/container/stack/emplace.html',0,'std::stack::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace.html',0,'std::unordered_map::emplace()'],['http://en.cppreference.com/w/cpp/container/set/emplace.html',0,'std::set::emplace()'],['http://en.cppreference.com/w/cpp/container/multiset/emplace.html',0,'std::multiset::emplace()'],['http://en.cppreference.com/w/cpp/container/vector/emplace.html',0,'std::vector::emplace()'],['http://en.cppreference.com/w/cpp/container/queue/emplace.html',0,'std::queue::emplace()'],['http://en.cppreference.com/w/cpp/container/priority_queue/emplace.html',0,'std::priority_queue::emplace()'],['http://en.cppreference.com/w/cpp/container/deque/emplace.html',0,'std::deque::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace.html',0,'std::unordered_multiset::emplace()'],['http://en.cppreference.com/w/cpp/container/map/emplace.html',0,'std::map::emplace()'],['http://en.cppreference.com/w/cpp/experimental/optional/emplace.html',0,'std::experimental::optional::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_set/emplace.html',0,'std::unordered_set::emplace()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace.html',0,'std::multimap::emplace()'],['http://en.cppreference.com/w/cpp/container/list/emplace.html',0,'std::list::emplace()']]], + ['emplace_9',['emplace',['http://en.cppreference.com/w/cpp/container/vector/emplace.html',0,'std::vector::emplace()'],['http://en.cppreference.com/w/cpp/container/multiset/emplace.html',0,'std::multiset::emplace()'],['http://en.cppreference.com/w/cpp/container/set/emplace.html',0,'std::set::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace.html',0,'std::unordered_map::emplace()'],['http://en.cppreference.com/w/cpp/container/stack/emplace.html',0,'std::stack::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace.html',0,'std::unordered_multimap::emplace()'],['http://en.cppreference.com/w/cpp/container/deque/emplace.html',0,'std::deque::emplace()'],['http://en.cppreference.com/w/cpp/container/queue/emplace.html',0,'std::queue::emplace()'],['http://en.cppreference.com/w/cpp/container/priority_queue/emplace.html',0,'std::priority_queue::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace.html',0,'std::unordered_multiset::emplace()'],['http://en.cppreference.com/w/cpp/container/list/emplace.html',0,'std::list::emplace()'],['http://en.cppreference.com/w/cpp/container/map/emplace.html',0,'std::map::emplace()'],['http://en.cppreference.com/w/cpp/experimental/optional/emplace.html',0,'std::experimental::optional::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_set/emplace.html',0,'std::unordered_set::emplace()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace.html',0,'std::multimap::emplace()']]], ['emplace_5fafter_10',['emplace_after',['http://en.cppreference.com/w/cpp/container/forward_list/emplace_after.html',0,'std::forward_list']]], - ['emplace_5fback_11',['emplace_back',['http://en.cppreference.com/w/cpp/container/deque/emplace_back.html',0,'std::deque::emplace_back()'],['http://en.cppreference.com/w/cpp/container/list/emplace_back.html',0,'std::list::emplace_back()'],['http://en.cppreference.com/w/cpp/container/vector/emplace_back.html',0,'std::vector::emplace_back()']]], - ['emplace_5ffront_12',['emplace_front',['http://en.cppreference.com/w/cpp/container/deque/emplace_front.html',0,'std::deque::emplace_front()'],['http://en.cppreference.com/w/cpp/container/list/emplace_front.html',0,'std::list::emplace_front()'],['http://en.cppreference.com/w/cpp/container/forward_list/emplace_front.html',0,'std::forward_list::emplace_front()']]], - ['emplace_5fhint_13',['emplace_hint',['http://en.cppreference.com/w/cpp/container/unordered_set/emplace_hint.html',0,'std::unordered_set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/multiset/emplace_hint.html',0,'std::multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/set/emplace_hint.html',0,'std::set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace_hint.html',0,'std::unordered_map::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace_hint.html',0,'std::unordered_multimap::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace_hint.html',0,'std::unordered_multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/map/emplace_hint.html',0,'std::map::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace_hint.html',0,'std::multimap::emplace_hint()']]], - ['empty_14',['empty',['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u16string::empty()'],['http://en.cppreference.com/w/cpp/container/queue/empty.html',0,'std::queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::basic_string::empty()'],['http://en.cppreference.com/w/cpp/container/priority_queue/empty.html',0,'std::priority_queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::wstring::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u32string::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/empty.html',0,'std::unordered_multiset::empty()'],['http://en.cppreference.com/w/cpp/container/list/empty.html',0,'std::list::empty()'],['http://en.cppreference.com/w/cpp/container/map/empty.html',0,'std::map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::cmatch::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_set/empty.html',0,'std::unordered_set::empty()'],['http://en.cppreference.com/w/cpp/container/multimap/empty.html',0,'std::multimap::empty()'],['http://en.cppreference.com/w/cpp/container/array/empty.html',0,'std::array::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wcmatch::empty()'],['http://en.cppreference.com/w/cpp/container/deque/empty.html',0,'std::deque::empty()'],['http://en.cppreference.com/w/cpp/container/forward_list/empty.html',0,'std::forward_list::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/empty.html',0,'std::unordered_multimap::empty()'],['http://en.cppreference.com/w/cpp/container/stack/empty.html',0,'std::stack::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::smatch::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_map/empty.html',0,'std::unordered_map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wsmatch::empty()'],['http://en.cppreference.com/w/cpp/container/dynarray/empty.html',0,'std::dynarray::empty()'],['http://en.cppreference.com/w/cpp/container/vector/empty.html',0,'std::vector::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::match_results::empty()'],['http://en.cppreference.com/w/cpp/container/multiset/empty.html',0,'std::multiset::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::string::empty()'],['http://en.cppreference.com/w/cpp/container/set/empty.html',0,'std::set::empty()']]], + ['emplace_5fback_11',['emplace_back',['http://en.cppreference.com/w/cpp/container/vector/emplace_back.html',0,'std::vector::emplace_back()'],['http://en.cppreference.com/w/cpp/container/deque/emplace_back.html',0,'std::deque::emplace_back()'],['http://en.cppreference.com/w/cpp/container/list/emplace_back.html',0,'std::list::emplace_back()']]], + ['emplace_5ffront_12',['emplace_front',['http://en.cppreference.com/w/cpp/container/forward_list/emplace_front.html',0,'std::forward_list::emplace_front()'],['http://en.cppreference.com/w/cpp/container/deque/emplace_front.html',0,'std::deque::emplace_front()'],['http://en.cppreference.com/w/cpp/container/list/emplace_front.html',0,'std::list::emplace_front()']]], + ['emplace_5fhint_13',['emplace_hint',['http://en.cppreference.com/w/cpp/container/multiset/emplace_hint.html',0,'std::multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/set/emplace_hint.html',0,'std::set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace_hint.html',0,'std::unordered_map::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace_hint.html',0,'std::unordered_multimap::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace_hint.html',0,'std::unordered_multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/map/emplace_hint.html',0,'std::map::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_set/emplace_hint.html',0,'std::unordered_set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace_hint.html',0,'std::multimap::emplace_hint()']]], + ['empty_14',['empty',['http://en.cppreference.com/w/cpp/container/dynarray/empty.html',0,'std::dynarray::empty()'],['http://en.cppreference.com/w/cpp/container/vector/empty.html',0,'std::vector::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::match_results::empty()'],['http://en.cppreference.com/w/cpp/container/multiset/empty.html',0,'std::multiset::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::string::empty()'],['http://en.cppreference.com/w/cpp/container/set/empty.html',0,'std::set::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_map/empty.html',0,'std::unordered_map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wsmatch::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::smatch::empty()'],['http://en.cppreference.com/w/cpp/container/stack/empty.html',0,'std::stack::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/empty.html',0,'std::unordered_multimap::empty()'],['http://en.cppreference.com/w/cpp/container/forward_list/empty.html',0,'std::forward_list::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wcmatch::empty()'],['http://en.cppreference.com/w/cpp/container/deque/empty.html',0,'std::deque::empty()'],['http://en.cppreference.com/w/cpp/container/queue/empty.html',0,'std::queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::basic_string::empty()'],['http://en.cppreference.com/w/cpp/container/priority_queue/empty.html',0,'std::priority_queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::wstring::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/empty.html',0,'std::unordered_multiset::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u16string::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u32string::empty()'],['http://en.cppreference.com/w/cpp/container/list/empty.html',0,'std::list::empty()'],['http://en.cppreference.com/w/cpp/container/map/empty.html',0,'std::map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::cmatch::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_set/empty.html',0,'std::unordered_set::empty()'],['http://en.cppreference.com/w/cpp/container/multimap/empty.html',0,'std::multimap::empty()'],['http://en.cppreference.com/w/cpp/container/array/empty.html',0,'std::array::empty()']]], ['enable_5fif_15',['enable_if',['http://en.cppreference.com/w/cpp/types/enable_if.html',0,'std']]], ['enable_5fshared_5ffrom_5fthis_16',['enable_shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this.html',0,'std::enable_shared_from_this'],['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/enable_shared_from_this.html',0,'std::enable_shared_from_this::enable_shared_from_this()']]], - ['encoding_17',['encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::encoding()']]], - ['encrypt_18',['encrypt',['../d3/d4c/xor__cipher_8cpp.html#aeff72a463ffc580c16cc849cbbdc58ef',1,'ciphers::XOR::encrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257',1,'ciphers::vigenere::encrypt()'],['../d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a',1,'ciphers::morse::encrypt()'],['../d6/d2c/caesar__cipher_8cpp.html#ac3381121289548640b1c27a58a8524c3',1,'ciphers::caesar::encrypt()'],['../de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744',1,'ciphers::a1z26::encrypt()']]], + ['encoding_17',['encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::encoding()']]], + ['encrypt_18',['encrypt',['../de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744',1,'ciphers::a1z26::encrypt()'],['../d6/d2c/caesar__cipher_8cpp.html#ac3381121289548640b1c27a58a8524c3',1,'ciphers::caesar::encrypt()'],['../d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a',1,'ciphers::morse::encrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257',1,'ciphers::vigenere::encrypt()'],['../d3/d4c/xor__cipher_8cpp.html#aeff72a463ffc580c16cc849cbbdc58ef',1,'ciphers::XOR::encrypt()']]], ['encrypt_5ftext_19',['encrypt_text',['../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917',1,'ciphers::HillCipher']]], - ['end_20',['end',['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::end()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::end()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::end()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::end()'],['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::end()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::end()'],['http://en.cppreference.com/w/cpp/iterator/end.html',0,'std::end()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::end'],['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::end()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::end()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::end()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::end()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::end()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/end.html',0,'std::initializer_list::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::end()'],['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::end()']]], - ['end_28int_29_21',['end(int)',['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::end(int)()']]], + ['end_20',['end',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::end'],['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::end()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::end()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::end()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::end()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::end()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/end.html',0,'std::initializer_list::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::end()'],['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::end()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::end()'],['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::end()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::end()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::end()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::end()'],['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::end()'],['http://en.cppreference.com/w/cpp/iterator/end.html',0,'std::end()']]], + ['end_28int_29_21',['end(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::end(int)()']]], ['endl_22',['endl',['../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258',1,'endl: matrix_exponentiation.cpp'],['http://en.cppreference.com/w/cpp/io/manip/endl.html',0,'std::endl(T... args)']]], ['ends_23',['ends',['http://en.cppreference.com/w/cpp/io/manip/ends.html',0,'std']]], ['enforcement_24',['Enforcement',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md9',1,'']]], ['enforcement_20guidelines_25',['Enforcement Guidelines',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'']]], ['enforcement_20responsibilities_26',['Enforcement Responsibilities',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md7',1,'']]], - ['enqueue_27',['enqueue',['../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d',1,'queue::enQueue()'],['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663',1,'data_structures::queue_using_array::Queue_Array::enqueue()']]], - ['ensurenotempty_28',['ensureNotEmpty',['../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604',1,'queue']]], - ['entropy_29',['entropy',['http://en.cppreference.com/w/cpp/numeric/random/random_device/entropy.html',0,'std::random_device']]], - ['entry_30',['entry',['../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e',1,'quadratic_probing::Entry::Entry()'],['../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77',1,'linear_probing::Entry::Entry()'],['../db/d19/structlinear__probing_1_1_entry.html',1,'linear_probing::Entry'],['../d9/dde/structdouble__hashing_1_1_entry.html',1,'double_hashing::Entry'],['../d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475',1,'double_hashing::Entry::Entry()'],['../da/dd1/structquadratic__probing_1_1_entry.html',1,'quadratic_probing::Entry']]], - ['eof_31',['eof',['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wiostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_fstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ios::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostream::eof()'],['http://en.cppreference.com/w/cpp/string/char_traits/eof.html',0,'std::char_traits::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::fstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wfstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wstringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::strstream::eof()']]], - ['epptr_32',['epptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::epptr()']]], - ['epsilon_33',['epsilon',['http://en.cppreference.com/w/cpp/types/numeric_limits/epsilon.html',0,'std::numeric_limits::epsilon()'],['../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON: golden_search_extrema.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON: brent_method_extrema.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#a75f355966e0a97665eaf5a4c79baa7af',1,'EPSILON: newton_raphson_method.cpp']]], - ['eq_34',['eq',['../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i): newton_raphson_method.cpp'],['../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i): bisection_method.cpp'],['../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389',1,'eq(float y): successive_approximation.cpp'],['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits::eq()'],['../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713',1,'numerical_methods::false_position::eq()']]], - ['eq_5fder_35',['eq_der',['../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386',1,'newton_raphson_method.cpp']]], - ['eq_5fint_5ftype_36',['eq_int_type',['http://en.cppreference.com/w/cpp/string/char_traits/eq_int_type.html',0,'std::char_traits']]], - ['eqd_37',['eqd',['../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456',1,'successive_approximation.cpp']]], - ['equal_38',['equal',['http://en.cppreference.com/w/cpp/algorithm/equal.html',0,'std']]], - ['equal_5frange_39',['equal_range',['http://en.cppreference.com/w/cpp/container/unordered_set/equal_range.html',0,'std::unordered_set::equal_range()'],['http://en.cppreference.com/w/cpp/container/set/equal_range.html',0,'std::set::equal_range()'],['http://en.cppreference.com/w/cpp/container/multimap/equal_range.html',0,'std::multimap::equal_range()'],['http://en.cppreference.com/w/cpp/algorithm/equal_range.html',0,'std::equal_range()'],['http://en.cppreference.com/w/cpp/container/map/equal_range.html',0,'std::map::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/equal_range.html',0,'std::unordered_multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/equal_range.html',0,'std::unordered_multimap::equal_range()'],['http://en.cppreference.com/w/cpp/container/multiset/equal_range.html',0,'std::multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_map/equal_range.html',0,'std::unordered_map::equal_range()']]], - ['equal_5fshuffle_40',['equal_shuffle',['../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f',1,'machine_learning']]], - ['equal_5fto_41',['equal_to',['http://en.cppreference.com/w/cpp/utility/functional/equal_to.html',0,'std']]], - ['equations_42',['Ordinary Differential Equations',['../d6/d60/group__ode.html',1,'']]], - ['equivalent_43',['equivalent',['http://en.cppreference.com/w/cpp/error/error_category/equivalent.html',0,'std::error_category']]], - ['erase_44',['erase',['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::string::erase()'],['http://en.cppreference.com/w/cpp/container/list/erase.html',0,'std::list::erase()'],['http://en.cppreference.com/w/cpp/container/map/erase.html',0,'std::map::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_set/erase.html',0,'std::unordered_set::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u32string::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u16string::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/erase.html',0,'std::unordered_multiset::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::wstring::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::basic_string::erase()'],['http://en.cppreference.com/w/cpp/container/deque/erase.html',0,'std::deque::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/erase.html',0,'std::unordered_multimap::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_map/erase.html',0,'std::unordered_map::erase()'],['http://en.cppreference.com/w/cpp/container/set/erase.html',0,'std::set::erase()'],['http://en.cppreference.com/w/cpp/container/multiset/erase.html',0,'std::multiset::erase()'],['http://en.cppreference.com/w/cpp/container/vector/erase.html',0,'std::vector::erase()'],['http://en.cppreference.com/w/cpp/container/multimap/erase.html',0,'std::multimap::erase()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1fb1792ab867dc26639eef368a56989e',1,'data_structures::linked_list::list::erase()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469',1,'data_structures::treap::Treap::erase()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::erase()']]], - ['erase_5fafter_45',['erase_after',['http://en.cppreference.com/w/cpp/container/forward_list/erase_after.html',0,'std::forward_list']]], - ['erasefromsorted_46',['eraseFromSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e',1,'probability::windowed_median::WindowedMedian']]], - ['eratosthenes_2ecpp_47',['eratosthenes.cpp',['../d7/da6/eratosthenes_8cpp.html',1,'']]], - ['erf_48',['erf',['http://en.cppreference.com/w/cpp/numeric/math/erf.html',0,'std']]], - ['erfc_49',['erfc',['http://en.cppreference.com/w/cpp/numeric/math/erfc.html',0,'std']]], - ['errc_50',['errc',['http://en.cppreference.com/w/cpp/error/errc.html',0,'std']]], - ['error_5fcategory_51',['error_category',['http://en.cppreference.com/w/cpp/error/error_category/error_category.html',0,'std::error_category::error_category()'],['http://en.cppreference.com/w/cpp/error/error_category.html',0,'std::error_category']]], - ['error_5fcode_52',['error_code',['http://en.cppreference.com/w/cpp/error/error_code/error_code.html',0,'std::error_code::error_code()'],['http://en.cppreference.com/w/cpp/error/error_code.html',0,'std::error_code']]], - ['error_5fcondition_53',['error_condition',['http://en.cppreference.com/w/cpp/error/error_condition.html',0,'std::error_condition'],['http://en.cppreference.com/w/cpp/error/error_condition/error_condition.html',0,'std::error_condition::error_condition()']]], - ['eta_54',['eta',['../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda',1,'machine_learning::adaline']]], - ['euclidean_5fdistance_55',['euclidean_distance',['../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69',1,'machine_learning::k_nearest_neighbors']]], - ['eulers_5ftotient_5ffunction_2ecpp_56',['eulers_totient_function.cpp',['../da/d23/eulers__totient__function_8cpp.html',1,'']]], - ['evaluate_57',['evaluate',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e',1,'machine_learning::neural_network::NeuralNetwork::evaluate()'],['../d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338',1,'others::postfix_expression::evaluate()']]], - ['evaluate_5ffrom_5fcsv_58',['evaluate_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848',1,'machine_learning::neural_network::NeuralNetwork']]], - ['event_5fcallback_59',['event_callback',['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ifstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::stringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostrstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ofstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istrstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::iostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ios_base::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ifstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::fstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_stringstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ostringstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ostream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ofstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_fstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wstringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wostringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wofstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wistringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wistream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wiostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wifstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wfstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::strstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_istringstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_istream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_iostream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ios< Char >::event_callback']]], - ['exa_60',['exa',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], - ['exact_5fsolution_61',['exact_solution',['../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_midpoint_euler.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_forward_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_semi_implicit_euler.cpp']]], - ['example_3a_62',['Example:',['../df/d66/vector__cross__product_8cpp.html#autotoc_md88',1,'']]], - ['examples_63',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]], - ['exception_64',['exception',['http://en.cppreference.com/w/cpp/error/exception/exception.html',0,'std::exception::exception()'],['http://en.cppreference.com/w/cpp/error/exception.html',0,'std::exception']]], - ['exception_5fptr_65',['exception_ptr',['http://en.cppreference.com/w/cpp/error/exception_ptr.html',0,'std']]], - ['exceptions_66',['exceptions',['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wstringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::fstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wiostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::strstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_fstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ios::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wfstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istringstream::exceptions()']]], - ['exchange_67',['exchange',['http://en.cppreference.com/w/cpp/atomic/atomic/exchange.html',0,'std::atomic']]], - ['exists_68',['exists',['../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81',1,'dynamic_programming::word_break']]], - ['exit_69',['exit',['http://en.cppreference.com/w/cpp/utility/program/exit.html',0,'std']]], - ['exp_70',['exp',['http://en.cppreference.com/w/cpp/numeric/math/exp.html',0,'std::exp()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0',1,'ciphers::elliptic_curve_key_exchange::exp()']]], - ['exp2_71',['exp2',['http://en.cppreference.com/w/cpp/numeric/math/exp2.html',0,'std']]], - ['expected_5fvalue_72',['expected_value',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413',1,'probability::geometric_dist::geometric_distribution']]], - ['expired_73',['expired',['http://en.cppreference.com/w/cpp/memory/weak_ptr/expired.html',0,'std::weak_ptr']]], - ['explanation_74',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md98',1,'']]], - ['explore_75',['explore',['../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463',1,'graph::explore(const std::vector< std::vector< size_t > > &adj, size_t v, std::vector< bool > *visited)'],['../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8',1,'graph::explore(const std::vector< std::vector< int > > *adj, int u, std::vector< bool > *visited)']]], - ['expm1_76',['expm1',['http://en.cppreference.com/w/cpp/numeric/math/expm1.html',0,'std']]], - ['exponential_5fdistribution_77',['exponential_distribution',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution.html',0,'std::exponential_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/exponential_distribution.html',0,'std::exponential_distribution::exponential_distribution()']]], - ['exponential_5fsearch_2ecpp_78',['exponential_search.cpp',['../d8/d8a/exponential__search_8cpp.html',1,'']]], - ['extended_5feuclid_5falgorithm_2ecpp_79',['extended_euclid_algorithm.cpp',['../d9/d5d/extended__euclid__algorithm_8cpp.html',1,'']]], - ['extendedeuclid_80',['extendedEuclid',['../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d',1,'extended_euclid_algorithm.cpp']]], - ['extendedeuclid_5f1_81',['extendedEuclid_1',['../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25',1,'extended_euclid_algorithm.cpp']]], - ['extent_82',['extent',['http://en.cppreference.com/w/cpp/types/extent.html',0,'std']]], - ['extern_5ftype_83',['extern_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::extern_type']]], - ['extract_5fbyte_84',['extract_byte',['../d4/d08/sha256_8cpp.html#afea411191ec5281f43e91ea327984627',1,'hashing::sha256']]], - ['extractmin_85',['extractMin',['../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980',1,'MinHeap']]], - ['extreme_5fvalue_5fdistribution_86',['extreme_value_distribution',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution.html',0,'std::extreme_value_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/extreme_value_distribution.html',0,'std::extreme_value_distribution::extreme_value_distribution()']]] + ['enqueue_27',['enqueue',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663',1,'data_structures::queue_using_array::Queue_Array']]], + ['enqueue_28',['enQueue',['../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d',1,'queue']]], + ['ensurenotempty_29',['ensureNotEmpty',['../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604',1,'queue']]], + ['entropy_30',['entropy',['http://en.cppreference.com/w/cpp/numeric/random/random_device/entropy.html',0,'std::random_device']]], + ['entry_31',['Entry',['../d9/dde/structdouble__hashing_1_1_entry.html',1,'double_hashing::Entry'],['../db/d19/structlinear__probing_1_1_entry.html',1,'linear_probing::Entry'],['../da/dd1/structquadratic__probing_1_1_entry.html',1,'quadratic_probing::Entry'],['../d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475',1,'double_hashing::Entry::Entry()'],['../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77',1,'linear_probing::Entry::Entry()'],['../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e',1,'quadratic_probing::Entry::Entry()']]], + ['eof_32',['eof',['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::fstream::eof()'],['http://en.cppreference.com/w/cpp/string/char_traits/eof.html',0,'std::char_traits::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ios::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_fstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::strstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wiostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wfstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wstringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ifstream::eof()']]], + ['epptr_33',['epptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::epptr()']]], + ['epsilon_34',['epsilon',['http://en.cppreference.com/w/cpp/types/numeric_limits/epsilon.html',0,'std::numeric_limits']]], + ['epsilon_35',['EPSILON',['../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON: brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON: golden_search_extrema.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#a75f355966e0a97665eaf5a4c79baa7af',1,'EPSILON: newton_raphson_method.cpp']]], + ['eq_36',['eq',['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits::eq()'],['../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(): bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713',1,'numerical_methods::false_position::eq()'],['../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i): newton_raphson_method.cpp'],['../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389',1,'eq(float y): successive_approximation.cpp']]], + ['eq_5fder_37',['eq_der',['../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386',1,'newton_raphson_method.cpp']]], + ['eq_5fint_5ftype_38',['eq_int_type',['http://en.cppreference.com/w/cpp/string/char_traits/eq_int_type.html',0,'std::char_traits']]], + ['eqd_39',['eqd',['../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456',1,'successive_approximation.cpp']]], + ['equal_40',['equal',['http://en.cppreference.com/w/cpp/algorithm/equal.html',0,'std']]], + ['equal_5frange_41',['equal_range',['http://en.cppreference.com/w/cpp/container/multiset/equal_range.html',0,'std::multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/set/equal_range.html',0,'std::set::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_map/equal_range.html',0,'std::unordered_map::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/equal_range.html',0,'std::unordered_multimap::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/equal_range.html',0,'std::unordered_multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/map/equal_range.html',0,'std::map::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_set/equal_range.html',0,'std::unordered_set::equal_range()'],['http://en.cppreference.com/w/cpp/container/multimap/equal_range.html',0,'std::multimap::equal_range()'],['http://en.cppreference.com/w/cpp/algorithm/equal_range.html',0,'std::equal_range()']]], + ['equal_5fshuffle_42',['equal_shuffle',['../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f',1,'machine_learning']]], + ['equal_5fto_43',['equal_to',['http://en.cppreference.com/w/cpp/utility/functional/equal_to.html',0,'std']]], + ['equations_44',['Ordinary Differential Equations',['../d6/d60/group__ode.html',1,'']]], + ['equivalent_45',['equivalent',['http://en.cppreference.com/w/cpp/error/error_category/equivalent.html',0,'std::error_category']]], + ['erase_46',['erase',['http://en.cppreference.com/w/cpp/container/vector/erase.html',0,'std::vector::erase()'],['http://en.cppreference.com/w/cpp/container/multiset/erase.html',0,'std::multiset::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::string::erase()'],['http://en.cppreference.com/w/cpp/container/set/erase.html',0,'std::set::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_map/erase.html',0,'std::unordered_map::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/erase.html',0,'std::unordered_multimap::erase()'],['http://en.cppreference.com/w/cpp/container/deque/erase.html',0,'std::deque::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::basic_string::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::wstring::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/erase.html',0,'std::unordered_multiset::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u16string::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u32string::erase()'],['http://en.cppreference.com/w/cpp/container/list/erase.html',0,'std::list::erase()'],['http://en.cppreference.com/w/cpp/container/map/erase.html',0,'std::map::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_set/erase.html',0,'std::unordered_set::erase()'],['http://en.cppreference.com/w/cpp/container/multimap/erase.html',0,'std::multimap::erase()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1fb1792ab867dc26639eef368a56989e',1,'data_structures::linked_list::list::erase()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469',1,'data_structures::treap::Treap::erase()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::erase()']]], + ['erase_5fafter_47',['erase_after',['http://en.cppreference.com/w/cpp/container/forward_list/erase_after.html',0,'std::forward_list']]], + ['erasefromsorted_48',['eraseFromSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e',1,'probability::windowed_median::WindowedMedian']]], + ['eratosthenes_2ecpp_49',['eratosthenes.cpp',['../d7/da6/eratosthenes_8cpp.html',1,'']]], + ['erf_50',['erf',['http://en.cppreference.com/w/cpp/numeric/math/erf.html',0,'std']]], + ['erfc_51',['erfc',['http://en.cppreference.com/w/cpp/numeric/math/erfc.html',0,'std']]], + ['errc_52',['errc',['http://en.cppreference.com/w/cpp/error/errc.html',0,'std']]], + ['error_5fcategory_53',['error_category',['http://en.cppreference.com/w/cpp/error/error_category.html',0,'std::error_category'],['http://en.cppreference.com/w/cpp/error/error_category/error_category.html',0,'std::error_category::error_category()']]], + ['error_5fcode_54',['error_code',['http://en.cppreference.com/w/cpp/error/error_code.html',0,'std::error_code'],['http://en.cppreference.com/w/cpp/error/error_code/error_code.html',0,'std::error_code::error_code()']]], + ['error_5fcondition_55',['error_condition',['http://en.cppreference.com/w/cpp/error/error_condition.html',0,'std::error_condition'],['http://en.cppreference.com/w/cpp/error/error_condition/error_condition.html',0,'std::error_condition::error_condition()']]], + ['eta_56',['eta',['../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda',1,'machine_learning::adaline']]], + ['euclidean_5fdistance_57',['euclidean_distance',['../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69',1,'machine_learning::k_nearest_neighbors']]], + ['eulers_5ftotient_5ffunction_2ecpp_58',['eulers_totient_function.cpp',['../da/d23/eulers__totient__function_8cpp.html',1,'']]], + ['evaluate_59',['evaluate',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e',1,'machine_learning::neural_network::NeuralNetwork::evaluate()'],['../d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338',1,'others::postfix_expression::evaluate()']]], + ['evaluate_5ffrom_5fcsv_60',['evaluate_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848',1,'machine_learning::neural_network::NeuralNetwork']]], + ['event_5fcallback_61',['event_callback',['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_fstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ifstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ios< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_iostream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_istream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_istringstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ofstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ostream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ostringstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_stringstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::fstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ifstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ios_base::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::iostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istrstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ofstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostrstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::stringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::strstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wfstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wifstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wiostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wistream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wistringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wofstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wostringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wstringstream::event_callback']]], + ['exa_62',['exa',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['exact_5fsolution_63',['exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_semi_implicit_euler.cpp']]], + ['example_3a_64',['Example:',['../df/d66/vector__cross__product_8cpp.html#autotoc_md88',1,'']]], + ['examples_65',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]], + ['exception_66',['exception',['http://en.cppreference.com/w/cpp/error/exception.html',0,'std::exception'],['http://en.cppreference.com/w/cpp/error/exception/exception.html',0,'std::exception::exception()']]], + ['exception_5fptr_67',['exception_ptr',['http://en.cppreference.com/w/cpp/error/exception_ptr.html',0,'std']]], + ['exceptions_68',['exceptions',['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::fstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ios::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_fstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::strstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wiostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wfstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wstringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ifstream::exceptions()']]], + ['exchange_69',['exchange',['http://en.cppreference.com/w/cpp/atomic/atomic/exchange.html',0,'std::atomic']]], + ['exists_70',['exists',['../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81',1,'dynamic_programming::word_break']]], + ['exit_71',['exit',['http://en.cppreference.com/w/cpp/utility/program/exit.html',0,'std']]], + ['exp_72',['exp',['http://en.cppreference.com/w/cpp/numeric/math/exp.html',0,'std::exp()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0',1,'ciphers::elliptic_curve_key_exchange::exp()']]], + ['exp2_73',['exp2',['http://en.cppreference.com/w/cpp/numeric/math/exp2.html',0,'std']]], + ['expected_5fvalue_74',['expected_value',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413',1,'probability::geometric_dist::geometric_distribution']]], + ['expired_75',['expired',['http://en.cppreference.com/w/cpp/memory/weak_ptr/expired.html',0,'std::weak_ptr']]], + ['explanation_76',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md98',1,'']]], + ['explore_77',['explore',['../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8',1,'graph::explore(const std::vector< std::vector< int > > *adj, int u, std::vector< bool > *visited)'],['../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463',1,'graph::explore(const std::vector< std::vector< size_t > > &adj, size_t v, std::vector< bool > *visited)']]], + ['expm1_78',['expm1',['http://en.cppreference.com/w/cpp/numeric/math/expm1.html',0,'std']]], + ['exponential_5fdistribution_79',['exponential_distribution',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution.html',0,'std::exponential_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/exponential_distribution.html',0,'std::exponential_distribution::exponential_distribution()']]], + ['exponential_5fsearch_2ecpp_80',['exponential_search.cpp',['../d8/d8a/exponential__search_8cpp.html',1,'']]], + ['extended_5feuclid_5falgorithm_2ecpp_81',['extended_euclid_algorithm.cpp',['../d9/d5d/extended__euclid__algorithm_8cpp.html',1,'']]], + ['extendedeuclid_82',['extendedEuclid',['../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d',1,'extended_euclid_algorithm.cpp']]], + ['extendedeuclid_5f1_83',['extendedEuclid_1',['../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25',1,'extended_euclid_algorithm.cpp']]], + ['extent_84',['extent',['http://en.cppreference.com/w/cpp/types/extent.html',0,'std']]], + ['extern_5ftype_85',['extern_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::extern_type']]], + ['extract_5fbyte_86',['extract_byte',['../d4/d08/sha256_8cpp.html#afea411191ec5281f43e91ea327984627',1,'hashing::sha256']]], + ['extractmin_87',['extractMin',['../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980',1,'MinHeap']]], + ['extreme_5fvalue_5fdistribution_88',['extreme_value_distribution',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution.html',0,'std::extreme_value_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/extreme_value_distribution.html',0,'std::extreme_value_distribution::extreme_value_distribution()']]] ]; diff --git a/search/all_b.js b/search/all_b.js index ee179d65e..ecbe15208 100644 --- a/search/all_b.js +++ b/search/all_b.js @@ -1,6 +1,6 @@ var searchData= [ - ['f_0',['f',['../df/d11/midpoint__integral__method_8cpp.html#a7ee8e824ef3e138a9a21883b26d97226',1,'numerical_methods::midpoint_rule::f()'],['../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397',1,'numerical_methods::simpson_method::f()']]], + ['f_0',['f',['../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397',1,'numerical_methods::simpson_method::f()'],['../df/d11/midpoint__integral__method_8cpp.html#a7ee8e824ef3e138a9a21883b26d97226',1,'numerical_methods::midpoint_rule::f()']]], ['fabs_1',['fabs',['http://en.cppreference.com/w/cpp/numeric/math/fabs.html',0,'std']]], ['facet_2',['facet',['http://en.cppreference.com/w/cpp/locale/locale/facet.html',0,'std::locale::facet'],['http://en.cppreference.com/w/cpp/locale/locale/facet/facet.html',0,'std::locale::facet::facet()']]], ['fact_3',['fact',['../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a',1,'poisson_dist.cpp']]], @@ -8,12 +8,12 @@ var searchData= ['factorial_2ecpp_5',['factorial.cpp',['../d9/d00/factorial_8cpp.html',1,'']]], ['factorization_6',['Prime factorization',['../d7/d7f/section.html',1,'']]], ['factors_7',['factors',['../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b',1,'prime_factorization.cpp']]], - ['fail_8',['fail',['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wiostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::strstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ios::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wfstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wstringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wifstream::fail()']]], - ['failure_9',['failure',['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wiostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::strstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ios_base::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wstringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wfstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ios::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wstringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wofstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wiostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wifstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wfstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::strstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::stringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostrstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ofstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istrstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::iostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ios_base::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ifstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::fstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_stringstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostringstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ofstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istringstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_iostream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ios< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ifstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_fstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostringstream::failure::failure()']]], + ['fail_8',['fail',['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ios::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::strstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wiostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wfstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wstringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ifstream::fail()']]], + ['failure_9',['failure',['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_fstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ifstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ios< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_iostream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istringstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ofstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostringstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_stringstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::fstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ifstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ios_base::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::iostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istrstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ofstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostrstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::stringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::strstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wfstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wifstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wiostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wofstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wstringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ios::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ios_base::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::strstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wiostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wfstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wstringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ifstream::failure::failure()']]], ['false_5fposition_10',['false_position',['../df/dea/namespacefalse__position.html',1,'']]], ['false_5fposition_2ecpp_11',['false_position.cpp',['../dd/d29/false__position_8cpp.html',1,'']]], ['false_5ftype_12',['false_type',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]], - ['falsename_13',['falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::falsename()']]], + ['falsename_13',['falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::falsename()']]], ['fast_5ffourier_5ftransform_2ecpp_14',['fast_fourier_transform.cpp',['../d8/d9a/fast__fourier__transform_8cpp.html',1,'']]], ['fast_5finteger_5finput_2ecpp_15',['fast_integer_input.cpp',['../d9/df0/fast__integer__input_8cpp.html',1,'']]], ['fast_5finvsqrt_16',['Fast_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52',1,'inv_sqrt.cpp']]], @@ -33,7 +33,7 @@ var searchData= ['fegetround_30',['fegetround',['http://en.cppreference.com/w/cpp/numeric/fenv/feround.html',0,'std']]], ['feholdexcept_31',['feholdexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feholdexcept.html',0,'std']]], ['femto_32',['femto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], - ['fenwick_5ftree_33',['fenwick_tree',['../de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c',1,'range_queries::fenwick_tree::fenwick_tree(T x)'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a',1,'range_queries::fenwick_tree::fenwick_tree(const std::vector< T > &arr)'],['../de/d0d/classrange__queries_1_1fenwick__tree.html',1,'range_queries::fenwick_tree']]], + ['fenwick_5ftree_33',['fenwick_tree',['../de/d0d/classrange__queries_1_1fenwick__tree.html',1,'range_queries::fenwick_tree'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a',1,'range_queries::fenwick_tree::fenwick_tree(const std::vector< T > &arr)'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c',1,'range_queries::fenwick_tree::fenwick_tree(T x)']]], ['fenwick_5ftree_2ecpp_34',['fenwick_tree.cpp',['../d6/d2e/fenwick__tree_8cpp.html',1,'']]], ['feof_35',['feof',['http://en.cppreference.com/w/cpp/io/c/feof.html',0,'std']]], ['feraiseexcept_36',['feraiseexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feraiseexcept.html',0,'std']]], @@ -54,7 +54,7 @@ var searchData= ['fgets_51',['fgets',['http://en.cppreference.com/w/cpp/io/c/fgets.html',0,'std']]], ['fgetwc_52',['fgetwc',['http://en.cppreference.com/w/cpp/io/c/fgetwc.html',0,'std']]], ['fgetws_53',['fgetws',['http://en.cppreference.com/w/cpp/io/c/fgetws.html',0,'std']]], - ['fib_54',['fib',['../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db',1,'fib(uint64_t n): fibonacci_large.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f',1,'fib(uint64_t n): fibonacci_fast.cpp']]], + ['fib_54',['fib',['../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f',1,'fib(uint64_t n): fibonacci_fast.cpp'],['../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db',1,'fib(uint64_t n): fibonacci_large.cpp']]], ['fib_5faccurate_55',['fib_Accurate',['../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca',1,'string_fibonacci.cpp']]], ['fib_5fb_56',['fib_b',['../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de',1,'matrix_exponentiation.cpp']]], ['fibo_57',['fibo',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f',1,'fibonacci_matrix_exponentiation.cpp']]], @@ -71,92 +71,93 @@ var searchData= ['file_68',['FILE',['http://en.cppreference.com/w/cpp/io/c.html',0,'std']]], ['file_20name_20guidelines_69',['File Name guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'']]], ['filebuf_70',['filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std::filebuf'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::filebuf::filebuf()']]], - ['fill_71',['fill',['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wstringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ifstream::fill()'],['http://en.cppreference.com/w/cpp/container/array/fill.html',0,'std::array::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::fstream::fill()'],['http://en.cppreference.com/w/cpp/container/dynarray/fill.html',0,'std::dynarray::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ios::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wfstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_fstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::strstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istrstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wiostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostrstream::fill()'],['http://en.cppreference.com/w/cpp/algorithm/fill.html',0,'std::fill()'],['../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780',1,'fill(): decimal_to_roman_numeral.cpp']]], + ['fill_71',['fill',['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::fstream::fill()'],['http://en.cppreference.com/w/cpp/container/dynarray/fill.html',0,'std::dynarray::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ios::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_fstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::strstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istrstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wiostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostrstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wfstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wstringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ifstream::fill()'],['http://en.cppreference.com/w/cpp/container/array/fill.html',0,'std::array::fill()'],['http://en.cppreference.com/w/cpp/algorithm/fill.html',0,'std::fill()'],['../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780',1,'fill(): decimal_to_roman_numeral.cpp']]], ['fill_5fn_72',['fill_n',['http://en.cppreference.com/w/cpp/algorithm/fill_n.html',0,'std']]], - ['find_73',['find',['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::wstring::find()'],['../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8',1,'Find(): disjoint_set.cpp'],['../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d',1,'quadratic_probing::find()'],['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std::find()'],['http://en.cppreference.com/w/cpp/string/char_traits/find.html',0,'std::char_traits::find()'],['http://en.cppreference.com/w/cpp/container/multiset/find.html',0,'std::multiset::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::string::find()'],['http://en.cppreference.com/w/cpp/container/set/find.html',0,'std::set::find()'],['http://en.cppreference.com/w/cpp/container/unordered_map/find.html',0,'std::unordered_map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/find.html',0,'std::unordered_multimap::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::basic_string::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/find.html',0,'std::unordered_multiset::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u16string::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u32string::find()'],['http://en.cppreference.com/w/cpp/container/map/find.html',0,'std::map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_set/find.html',0,'std::unordered_set::find()'],['http://en.cppreference.com/w/cpp/container/multimap/find.html',0,'std::multimap::find()'],['../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a',1,'hash_chain::find()']]], - ['find_5fend_74',['find_end',['http://en.cppreference.com/w/cpp/algorithm/find_end.html',0,'std']]], - ['find_5ffirst_5fnot_5fof_75',['find_first_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::basic_string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::wstring::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u16string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u32string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::string::find_first_not_of()']]], - ['find_5ffirst_5fof_76',['find_first_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::basic_string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::wstring::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u16string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u32string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::string::find_first_of()'],['http://en.cppreference.com/w/cpp/algorithm/find_first_of.html',0,'std::find_first_of(T... args)']]], - ['find_5fif_77',['find_if',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]], - ['find_5fif_5fnot_78',['find_if_not',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]], - ['find_5flast_5fnot_5fof_79',['find_last_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u32string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u16string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::wstring::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::basic_string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::string::find_last_not_of()']]], - ['find_5flast_5fof_80',['find_last_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::basic_string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::wstring::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u16string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u32string::find_last_of()']]], - ['find_5fmax_81',['find_max',['../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0',1,'binary_search_tree::find_max(T &ret_value)'],['../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb',1,'binary_search_tree::find_max(std::unique_ptr< bst_node > &node, T &ret_value)']]], - ['find_5fmin_82',['find_min',['../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153',1,'binary_search_tree::find_min(std::unique_ptr< bst_node > &node, T &ret_value)'],['../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03',1,'binary_search_tree::find_min(T &ret_value)']]], - ['find_5fnon_5frepeating_5finteger_83',['find_non_repeating_integer',['../d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3',1,'bit_manipulation::find_non_repeating_integer::find_non_repeating_integer()'],['../d2/da7/namespacefind__non__repeating__integer.html',1,'find_non_repeating_integer']]], - ['find_5fnon_5frepeating_5fnumber_2ecpp_84',['find_non_repeating_number.cpp',['../d6/d38/find__non__repeating__number_8cpp.html',1,'']]], - ['find_5fpat_5fin_5ftext_85',['find_pat_in_text',['../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8',1,'z_function.cpp']]], - ['find_5fset_86',['find_set',['../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e',1,'graph::disjoint_union']]], - ['find_5fzero_87',['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_88',['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_89',['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_90',['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_91',['findMinimumEdge',['../d2/d90/namespacegreedy__algorithms.html#a127ce4403660032f53ae2e6467e5427d',1,'greedy_algorithms']]], - ['findminindex_92',['findMinIndex',['../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834',1,'sorting::selection_sort_recursive']]], - ['findminnode_93',['findMinNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db',1,'operations_on_datastructures::inorder_traversal_of_bst']]], - ['findnextgap_94',['FindNextGap',['../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5',1,'comb_sort.cpp']]], - ['findparent_95',['findParent',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]], - ['findset_96',['findset',['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)'],['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)']]], - ['findshifttable_97',['findShiftTable',['../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336',1,'strings::horspool']]], - ['first_98',['first',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1',1,'data_structures::linked_list::list']]], - ['first_5ftest_99',['first_test',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300',1,'finding_number_of_digits_in_a_number.cpp']]], - ['fisher_5ff_5fdistribution_100',['fisher_f_distribution',['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution.html',0,'std::fisher_f_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/fisher_f_distribution.html',0,'std::fisher_f_distribution::fisher_f_distribution()']]], - ['fit_101',['fit',['../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'machine_learning::adaline::fit(std::array< std::vector< double >, N > const &X, std::array< int, N > const &Y)'],['../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5',1,'machine_learning::adaline::fit(const std::vector< double > &x, const int &y)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0',1,'machine_learning::neural_network::NeuralNetwork::fit(const std::vector< std::vector< std::valarray< double > > > &X_, const std::vector< std::vector< std::valarray< double > > > &Y_, const int &epochs=100, const double &learning_rate=0.01, const size_t &batch_size=32, const bool &shuffle=true)']]], - ['fit_5ffrom_5fcsv_102',['fit_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff',1,'machine_learning::neural_network::NeuralNetwork']]], - ['fit_5fols_5fregressor_103',['fit_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b',1,'ordinary_least_squares_regressor.cpp']]], - ['fixed_104',['fixed',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], - ['flags_105',['flags',['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wiostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wfstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wstringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::strstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::fstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostringstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::regex::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::basic_regex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ios::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_fstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::wregex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ios_base::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istream::flags()']]], - ['flip_106',['flip',['http://en.cppreference.com/w/cpp/utility/bitset/flip.html',0,'std::bitset']]], - ['floor_107',['floor',['http://en.cppreference.com/w/cpp/numeric/math/floor.html',0,'std']]], - ['floyd_5fcycle_5fdetection_5falgo_2ecpp_108',['floyd_cycle_detection_algo.cpp',['../db/dc4/floyd__cycle__detection__algo_8cpp.html',1,'']]], - ['flush_109',['flush',['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wstringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_fstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wiostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wfstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::strstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostrstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::fstream::flush()'],['http://en.cppreference.com/w/cpp/io/manip/flush.html',0,'std::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostream::flush()']]], - ['fma_110',['fma',['http://en.cppreference.com/w/cpp/numeric/math/fma.html',0,'std']]], - ['fmax_111',['fmax',['http://en.cppreference.com/w/cpp/numeric/math/fmax.html',0,'std']]], - ['fmin_112',['fmin',['http://en.cppreference.com/w/cpp/numeric/math/fmin.html',0,'std']]], - ['fmod_113',['fmod',['http://en.cppreference.com/w/cpp/numeric/math/fmod.html',0,'std']]], - ['fopen_114',['fopen',['http://en.cppreference.com/w/cpp/io/c/fopen.html',0,'std']]], - ['for_20reviewers_20and_20maintainers_115',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]], - ['for_5feach_116',['for_each',['http://en.cppreference.com/w/cpp/algorithm/for_each.html',0,'std']]], - ['format_117',['format',['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wsmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::cmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::smatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wcmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::match_results::format()']]], - ['formatter_118',['Code Formatter',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md39',1,'']]], - ['forward_119',['forward',['../d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e',1,'data_structures::Node::forward'],['http://en.cppreference.com/w/cpp/utility/forward.html',0,'std::forward(T... args)']]], - ['forward_5fas_5ftuple_120',['forward_as_tuple',['http://en.cppreference.com/w/cpp/utility/tuple/forward_as_tuple.html',0,'std']]], - ['forward_5feuler_121',['forward_euler',['../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9',1,'ode_forward_euler.cpp']]], - ['forward_5feuler_5fstep_122',['forward_euler_step',['../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723',1,'ode_forward_euler.cpp']]], - ['forward_5fiterator_5ftag_123',['forward_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], - ['forward_5flist_124',['forward_list',['http://en.cppreference.com/w/cpp/container/forward_list.html',0,'std::forward_list< T >'],['http://en.cppreference.com/w/cpp/container/forward_list/forward_list.html',0,'std::forward_list::forward_list()']]], - ['fpclassify_125',['fpclassify',['http://en.cppreference.com/w/cpp/numeric/math/fpclassify.html',0,'std']]], - ['fpos_126',['fpos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], - ['fpos_5ft_127',['fpos_t',['http://en.cppreference.com/w/cpp/io/c.html',0,'std']]], - ['fprintf_128',['fprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], - ['fputc_129',['fputc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]], - ['fputs_130',['fputs',['http://en.cppreference.com/w/cpp/io/c/fputs.html',0,'std']]], - ['fputwc_131',['fputwc',['http://en.cppreference.com/w/cpp/io/c/fputwc.html',0,'std']]], - ['fputws_132',['fputws',['http://en.cppreference.com/w/cpp/io/c/fputws.html',0,'std']]], - ['frac_5fdigits_133',['frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::frac_digits()']]], - ['fread_134',['fread',['http://en.cppreference.com/w/cpp/io/c/fread.html',0,'std']]], - ['free_135',['free',['http://en.cppreference.com/w/cpp/memory/c/free.html',0,'std']]], - ['freenode_136',['freeNode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02',1,'linkedlist_implentation_usingarray.cpp']]], - ['freeze_137',['freeze',['http://en.cppreference.com/w/cpp/io/strstreambuf/freeze.html',0,'std::strstreambuf::freeze()'],['http://en.cppreference.com/w/cpp/io/strstream/freeze.html',0,'std::strstream::freeze()'],['http://en.cppreference.com/w/cpp/io/ostrstream/freeze.html',0,'std::ostrstream::freeze()']]], - ['freopen_138',['freopen',['http://en.cppreference.com/w/cpp/io/c/freopen.html',0,'std']]], - ['frexp_139',['frexp',['http://en.cppreference.com/w/cpp/numeric/math/frexp.html',0,'std']]], - ['from_20the_20root_20node_140',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md93',1,'']]], - ['from_5fbytes_141',['from_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/from_bytes.html',0,'std::wstring_convert']]], - ['from_5ftime_5ft_142',['from_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/from_time_t.html',0,'std::chrono::system_clock']]], - ['front_143',['front',['../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7',1,'queue::front()'],['http://en.cppreference.com/w/cpp/container/vector/front.html',0,'std::vector::front()'],['http://en.cppreference.com/w/cpp/container/deque/front.html',0,'std::deque::front()'],['http://en.cppreference.com/w/cpp/container/dynarray/front.html',0,'std::dynarray::front()'],['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e',1,'data_structures::queue_using_array::Queue_Array::front'],['http://en.cppreference.com/w/cpp/container/forward_list/front.html',0,'std::forward_list::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::string::front()'],['http://en.cppreference.com/w/cpp/container/array/front.html',0,'std::array::front()'],['http://en.cppreference.com/w/cpp/container/list/front.html',0,'std::list::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u32string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u16string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::wstring::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::basic_string::front()'],['http://en.cppreference.com/w/cpp/container/queue/front.html',0,'std::queue::front()']]], - ['front_5finsert_5fiterator_144',['front_insert_iterator',['http://en.cppreference.com/w/cpp/iterator/front_insert_iterator.html',0,'std']]], - ['front_5finserter_145',['front_inserter',['http://en.cppreference.com/w/cpp/iterator/front_inserter.html',0,'std']]], - ['fscanf_146',['fscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]], - ['fseek_147',['fseek',['http://en.cppreference.com/w/cpp/io/c/fseek.html',0,'std']]], - ['fsetpos_148',['fsetpos',['http://en.cppreference.com/w/cpp/io/c/fsetpos.html',0,'std']]], - ['fstream_149',['fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::fstream::fstream()'],['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std::fstream']]], - ['ftell_150',['ftell',['http://en.cppreference.com/w/cpp/io/c/ftell.html',0,'std']]], - ['function_151',['function',['http://en.cppreference.com/w/cpp/utility/functional/function/function.html',0,'std::function::function()'],['http://en.cppreference.com/w/cpp/utility/functional/function.html',0,'std::function']]], - ['function_3c_20std_3a_3asize_5ft_28t_29_3e_152',['function< std::size_t(T)>',['http://en.cppreference.com/w/cpp/utility/functional/function.html',0,'std']]], - ['future_153',['future',['http://en.cppreference.com/w/cpp/thread/future.html',0,'std::future'],['http://en.cppreference.com/w/cpp/thread/future/future.html',0,'std::future::future()']]], - ['future_5fcategory_154',['future_category',['http://en.cppreference.com/w/cpp/thread/future/future_category.html',0,'std']]], - ['future_5ferror_155',['future_error',['http://en.cppreference.com/w/cpp/thread/future_error.html',0,'std::future_error'],['http://en.cppreference.com/w/cpp/thread/future_error/future_error.html',0,'std::future_error::future_error()']]], - ['fwprintf_156',['fwprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], - ['fwrite_157',['fwrite',['http://en.cppreference.com/w/cpp/io/c/fwrite.html',0,'std']]], - ['fwscanf_158',['fwscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]] + ['find_73',['find',['http://en.cppreference.com/w/cpp/string/char_traits/find.html',0,'std::char_traits::find()'],['http://en.cppreference.com/w/cpp/container/multiset/find.html',0,'std::multiset::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::string::find()'],['http://en.cppreference.com/w/cpp/container/set/find.html',0,'std::set::find()'],['http://en.cppreference.com/w/cpp/container/unordered_map/find.html',0,'std::unordered_map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/find.html',0,'std::unordered_multimap::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::basic_string::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::wstring::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/find.html',0,'std::unordered_multiset::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u16string::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u32string::find()'],['http://en.cppreference.com/w/cpp/container/map/find.html',0,'std::map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_set/find.html',0,'std::unordered_set::find()'],['http://en.cppreference.com/w/cpp/container/multimap/find.html',0,'std::multimap::find()'],['../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a',1,'hash_chain::find()']]], + ['find_74',['Find',['../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8',1,'disjoint_set.cpp']]], + ['find_75',['find',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std::find()'],['../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d',1,'quadratic_probing::find()']]], + ['find_5fend_76',['find_end',['http://en.cppreference.com/w/cpp/algorithm/find_end.html',0,'std']]], + ['find_5ffirst_5fnot_5fof_77',['find_first_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::basic_string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::wstring::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u16string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u32string::find_first_not_of()']]], + ['find_5ffirst_5fof_78',['find_first_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::basic_string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::wstring::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u16string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u32string::find_first_of()'],['http://en.cppreference.com/w/cpp/algorithm/find_first_of.html',0,'std::find_first_of(T... args)']]], + ['find_5fif_79',['find_if',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]], + ['find_5fif_5fnot_80',['find_if_not',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]], + ['find_5flast_5fnot_5fof_81',['find_last_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::basic_string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::wstring::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u16string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u32string::find_last_not_of()']]], + ['find_5flast_5fof_82',['find_last_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::basic_string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::wstring::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u16string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u32string::find_last_of()']]], + ['find_5fmax_83',['find_max',['../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb',1,'binary_search_tree::find_max(std::unique_ptr< bst_node > &node, T &ret_value)'],['../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0',1,'binary_search_tree::find_max(T &ret_value)']]], + ['find_5fmin_84',['find_min',['../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153',1,'binary_search_tree::find_min(std::unique_ptr< bst_node > &node, T &ret_value)'],['../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03',1,'binary_search_tree::find_min(T &ret_value)']]], + ['find_5fnon_5frepeating_5finteger_85',['find_non_repeating_integer',['../d2/da7/namespacefind__non__repeating__integer.html',1,'find_non_repeating_integer'],['../d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3',1,'bit_manipulation::find_non_repeating_integer::find_non_repeating_integer()']]], + ['find_5fnon_5frepeating_5fnumber_2ecpp_86',['find_non_repeating_number.cpp',['../d6/d38/find__non__repeating__number_8cpp.html',1,'']]], + ['find_5fpat_5fin_5ftext_87',['find_pat_in_text',['../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8',1,'z_function.cpp']]], + ['find_5fset_88',['find_set',['../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e',1,'graph::disjoint_union']]], + ['find_5fzero_89',['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_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']]], + ['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']]], + ['findparent_97',['findParent',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]], + ['findset_98',['findSet',['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)'],['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)']]], + ['findshifttable_99',['findShiftTable',['../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336',1,'strings::horspool']]], + ['first_100',['first',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1',1,'data_structures::linked_list::list']]], + ['first_5ftest_101',['first_test',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300',1,'finding_number_of_digits_in_a_number.cpp']]], + ['fisher_5ff_5fdistribution_102',['fisher_f_distribution',['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution.html',0,'std::fisher_f_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/fisher_f_distribution.html',0,'std::fisher_f_distribution::fisher_f_distribution()']]], + ['fit_103',['fit',['../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5',1,'machine_learning::adaline::fit(const std::vector< double > &x, const int &y)'],['../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'machine_learning::adaline::fit(std::array< std::vector< double >, N > const &X, std::array< int, N > const &Y)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0',1,'machine_learning::neural_network::NeuralNetwork::fit(const std::vector< std::vector< std::valarray< double > > > &X_, const std::vector< std::vector< std::valarray< double > > > &Y_, const int &epochs=100, const double &learning_rate=0.01, const size_t &batch_size=32, const bool &shuffle=true)']]], + ['fit_5ffrom_5fcsv_104',['fit_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff',1,'machine_learning::neural_network::NeuralNetwork']]], + ['fit_5fols_5fregressor_105',['fit_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b',1,'ordinary_least_squares_regressor.cpp']]], + ['fixed_106',['fixed',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], + ['flags_107',['flags',['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::fstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostringstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::regex::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::basic_regex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ios::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_fstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::wregex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ios_base::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::strstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wiostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wfstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wstringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ifstream::flags()']]], + ['flip_108',['flip',['http://en.cppreference.com/w/cpp/utility/bitset/flip.html',0,'std::bitset']]], + ['floor_109',['floor',['http://en.cppreference.com/w/cpp/numeric/math/floor.html',0,'std']]], + ['floyd_5fcycle_5fdetection_5falgo_2ecpp_110',['floyd_cycle_detection_algo.cpp',['../db/dc4/floyd__cycle__detection__algo_8cpp.html',1,'']]], + ['flush_111',['flush',['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::fstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_fstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::strstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wiostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostrstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wfstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wstringstream::flush()'],['http://en.cppreference.com/w/cpp/io/manip/flush.html',0,'std::flush(T... args)']]], + ['fma_112',['fma',['http://en.cppreference.com/w/cpp/numeric/math/fma.html',0,'std']]], + ['fmax_113',['fmax',['http://en.cppreference.com/w/cpp/numeric/math/fmax.html',0,'std']]], + ['fmin_114',['fmin',['http://en.cppreference.com/w/cpp/numeric/math/fmin.html',0,'std']]], + ['fmod_115',['fmod',['http://en.cppreference.com/w/cpp/numeric/math/fmod.html',0,'std']]], + ['fopen_116',['fopen',['http://en.cppreference.com/w/cpp/io/c/fopen.html',0,'std']]], + ['for_20reviewers_20and_20maintainers_117',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]], + ['for_5feach_118',['for_each',['http://en.cppreference.com/w/cpp/algorithm/for_each.html',0,'std']]], + ['format_119',['format',['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::match_results::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wsmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::smatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wcmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::cmatch::format()']]], + ['formatter_120',['Code Formatter',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md39',1,'']]], + ['forward_121',['forward',['../d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e',1,'data_structures::Node::forward'],['http://en.cppreference.com/w/cpp/utility/forward.html',0,'std::forward(T... args)']]], + ['forward_5fas_5ftuple_122',['forward_as_tuple',['http://en.cppreference.com/w/cpp/utility/tuple/forward_as_tuple.html',0,'std']]], + ['forward_5feuler_123',['forward_euler',['../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9',1,'ode_forward_euler.cpp']]], + ['forward_5feuler_5fstep_124',['forward_euler_step',['../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723',1,'ode_forward_euler.cpp']]], + ['forward_5fiterator_5ftag_125',['forward_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], + ['forward_5flist_126',['forward_list',['http://en.cppreference.com/w/cpp/container/forward_list.html',0,'std::forward_list< T >'],['http://en.cppreference.com/w/cpp/container/forward_list/forward_list.html',0,'std::forward_list::forward_list()']]], + ['fpclassify_127',['fpclassify',['http://en.cppreference.com/w/cpp/numeric/math/fpclassify.html',0,'std']]], + ['fpos_128',['fpos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], + ['fpos_5ft_129',['fpos_t',['http://en.cppreference.com/w/cpp/io/c.html',0,'std']]], + ['fprintf_130',['fprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['fputc_131',['fputc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]], + ['fputs_132',['fputs',['http://en.cppreference.com/w/cpp/io/c/fputs.html',0,'std']]], + ['fputwc_133',['fputwc',['http://en.cppreference.com/w/cpp/io/c/fputwc.html',0,'std']]], + ['fputws_134',['fputws',['http://en.cppreference.com/w/cpp/io/c/fputws.html',0,'std']]], + ['frac_5fdigits_135',['frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::frac_digits()']]], + ['fread_136',['fread',['http://en.cppreference.com/w/cpp/io/c/fread.html',0,'std']]], + ['free_137',['free',['http://en.cppreference.com/w/cpp/memory/c/free.html',0,'std']]], + ['freenode_138',['freeNode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02',1,'linkedlist_implentation_usingarray.cpp']]], + ['freeze_139',['freeze',['http://en.cppreference.com/w/cpp/io/strstreambuf/freeze.html',0,'std::strstreambuf::freeze()'],['http://en.cppreference.com/w/cpp/io/strstream/freeze.html',0,'std::strstream::freeze()'],['http://en.cppreference.com/w/cpp/io/ostrstream/freeze.html',0,'std::ostrstream::freeze()']]], + ['freopen_140',['freopen',['http://en.cppreference.com/w/cpp/io/c/freopen.html',0,'std']]], + ['frexp_141',['frexp',['http://en.cppreference.com/w/cpp/numeric/math/frexp.html',0,'std']]], + ['from_20the_20root_20node_142',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md93',1,'']]], + ['from_5fbytes_143',['from_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/from_bytes.html',0,'std::wstring_convert']]], + ['from_5ftime_5ft_144',['from_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/from_time_t.html',0,'std::chrono::system_clock']]], + ['front_145',['front',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e',1,'data_structures::queue_using_array::Queue_Array::front'],['http://en.cppreference.com/w/cpp/container/dynarray/front.html',0,'std::dynarray::front()'],['http://en.cppreference.com/w/cpp/container/vector/front.html',0,'std::vector::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::string::front()'],['http://en.cppreference.com/w/cpp/container/forward_list/front.html',0,'std::forward_list::front()'],['http://en.cppreference.com/w/cpp/container/deque/front.html',0,'std::deque::front()'],['http://en.cppreference.com/w/cpp/container/queue/front.html',0,'std::queue::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::basic_string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::wstring::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u16string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u32string::front()'],['http://en.cppreference.com/w/cpp/container/list/front.html',0,'std::list::front()'],['http://en.cppreference.com/w/cpp/container/array/front.html',0,'std::array::front()'],['../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7',1,'queue::front()']]], + ['front_5finsert_5fiterator_146',['front_insert_iterator',['http://en.cppreference.com/w/cpp/iterator/front_insert_iterator.html',0,'std']]], + ['front_5finserter_147',['front_inserter',['http://en.cppreference.com/w/cpp/iterator/front_inserter.html',0,'std']]], + ['fscanf_148',['fscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]], + ['fseek_149',['fseek',['http://en.cppreference.com/w/cpp/io/c/fseek.html',0,'std']]], + ['fsetpos_150',['fsetpos',['http://en.cppreference.com/w/cpp/io/c/fsetpos.html',0,'std']]], + ['fstream_151',['fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std::fstream'],['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::fstream::fstream()']]], + ['ftell_152',['ftell',['http://en.cppreference.com/w/cpp/io/c/ftell.html',0,'std']]], + ['function_153',['function',['http://en.cppreference.com/w/cpp/utility/functional/function.html',0,'std::function'],['http://en.cppreference.com/w/cpp/utility/functional/function/function.html',0,'std::function::function()']]], + ['future_154',['future',['http://en.cppreference.com/w/cpp/thread/future.html',0,'std::future'],['http://en.cppreference.com/w/cpp/thread/future/future.html',0,'std::future::future()']]], + ['future_5fcategory_155',['future_category',['http://en.cppreference.com/w/cpp/thread/future/future_category.html',0,'std']]], + ['future_5ferror_156',['future_error',['http://en.cppreference.com/w/cpp/thread/future_error.html',0,'std::future_error'],['http://en.cppreference.com/w/cpp/thread/future_error/future_error.html',0,'std::future_error::future_error()']]], + ['fwprintf_157',['fwprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], + ['fwrite_158',['fwrite',['http://en.cppreference.com/w/cpp/io/c/fwrite.html',0,'std']]], + ['fwscanf_159',['fwscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]] ]; diff --git a/search/all_c.js b/search/all_c.js index 47959d372..7079d8488 100644 --- a/search/all_c.js +++ b/search/all_c.js @@ -4,13 +4,13 @@ var searchData= ['games_1',['Games',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52',1,'']]], ['gamma_5fdistribution_2',['gamma_distribution',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution.html',0,'std::gamma_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/gamma_distribution.html',0,'std::gamma_distribution::gamma_distribution()']]], ['gaussian_5felimination_2ecpp_3',['gaussian_elimination.cpp',['../d0/de2/gaussian__elimination_8cpp.html',1,'']]], - ['gbump_4',['gbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wfilebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::strstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::streambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_streambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_stringbuf::gbump()']]], - ['gcd_5',['gcd',['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(): gcd_iterative_euclidean.cpp'],['../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0',1,'ciphers::HillCipher::gcd()'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2): gcd_recursive_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a',1,'gcd(int *a, int n): gcd_of_n_numbers.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563',1,'gcd(unsigned int x, unsigned int y): least_common_multiple.cpp']]], + ['gbump_4',['gbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wfilebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::strstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_streambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::streambuf::gbump()']]], + ['gcd_5',['gcd',['../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0',1,'ciphers::HillCipher::gcd()'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a',1,'gcd(int *a, int n): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2): gcd_recursive_euclidean.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563',1,'gcd(unsigned int x, unsigned int y): least_common_multiple.cpp']]], ['gcd_5fiterative_5feuclidean_2ecpp_6',['gcd_iterative_euclidean.cpp',['../d4/da0/gcd__iterative__euclidean_8cpp.html',1,'']]], ['gcd_5fof_5fn_5fnumbers_2ecpp_7',['gcd_of_n_numbers.cpp',['../d1/d11/gcd__of__n__numbers_8cpp.html',1,'']]], ['gcd_5frecursive_5feuclidean_2ecpp_8',['gcd_recursive_euclidean.cpp',['../d4/d45/gcd__recursive__euclidean_8cpp.html',1,'']]], ['gcdextended_9',['gcdExtended',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#afde201f4687740454302c444f507a926',1,'math::ncr_modulo_p::NCRModuloP']]], - ['gcount_10',['gcount',['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wfstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_ifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wiostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istrstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::strstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wstringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::ifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::iostream::gcount()']]], + ['gcount_10',['gcount',['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::strstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istrstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wiostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_ifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wfstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wstringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::ifstream::gcount()']]], ['genarray_11',['genArray',['../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5',1,'spiral_print.cpp']]], ['generate_12',['generate',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/generate.html',0,'std::seed_seq::generate()'],['../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160',1,'backtracking::generate_parentheses::generate()'],['http://en.cppreference.com/w/cpp/algorithm/generate.html',0,'std::generate(T... args)']]], ['generate_5fcanonical_13',['generate_canonical',['http://en.cppreference.com/w/cpp/numeric/random/generate_canonical.html',0,'std']]], @@ -27,117 +27,123 @@ var searchData= ['generic_5fcategory_24',['generic_category',['http://en.cppreference.com/w/cpp/error/generic_category.html',0,'std']]], ['geometric_5fdist_25',['geometric_dist',['../dd/d8a/namespacegeometric__dist.html',1,'']]], ['geometric_5fdist_2ecpp_26',['geometric_dist.cpp',['../de/d72/geometric__dist_8cpp.html',1,'']]], - ['geometric_5fdistribution_27',['geometric_distribution',['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/geometric_distribution.html',0,'std::geometric_distribution::geometric_distribution()'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797',1,'probability::geometric_dist::geometric_distribution::geometric_distribution()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution.html',0,'std::geometric_distribution'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html',1,'probability::geometric_dist::geometric_distribution']]], - ['geometry_28',['geometry',['../d5/d5f/namespacegeometry.html',1,'geometry'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53',1,'Geometry']]], - ['get_29',['get',['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistringstream::get()'],['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::fstream::get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::get()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html',0,'std::shared_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_fstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::iostream::get()'],['http://en.cppreference.com/w/cpp/thread/shared_future/get.html',0,'std::shared_future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::stringstream::get()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html',0,'std::unique_ptr::get()'],['http://en.cppreference.com/w/cpp/thread/future/get.html',0,'std::future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wifstream::get()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::strstream::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_stringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istrstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wiostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_ifstream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istringstream::get()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/get.html',0,'std::auto_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wfstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_iostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wstringstream::get()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420',1,'machine_learning::aystar_search::EightPuzzle::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::ifstream::get()'],['../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a',1,'dsu::get()']]], - ['get_5fall_5fwords_30',['get_all_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd',1,'data_structures::trie_using_hashmap::Trie']]], - ['get_5fallocator_31',['get_allocator',['http://en.cppreference.com/w/cpp/container/unordered_multiset/get_allocator.html',0,'std::unordered_multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/container/vector/get_allocator.html',0,'std::vector::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::match_results::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multiset/get_allocator.html',0,'std::multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/set/get_allocator.html',0,'std::set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_map/get_allocator.html',0,'std::unordered_map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wsmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::smatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/get_allocator.html',0,'std::unordered_multimap::get_allocator()'],['http://en.cppreference.com/w/cpp/container/forward_list/get_allocator.html',0,'std::forward_list::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wcmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/deque/get_allocator.html',0,'std::deque::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::basic_string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::wstring::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multimap/get_allocator.html',0,'std::multimap::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u16string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u32string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/list/get_allocator.html',0,'std::list::get_allocator()'],['http://en.cppreference.com/w/cpp/container/map/get_allocator.html',0,'std::map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::cmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_set/get_allocator.html',0,'std::unordered_set::get_allocator()']]], - ['get_5fchar_32',['get_char',['../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da',1,'hashing::sha256']]], - ['get_5fchar_5fidx_33',['get_char_idx',['../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41',1,'ciphers::HillCipher']]], - ['get_5fclock_5fdiff_34',['get_clock_diff',['../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_trace.cpp']]], - ['get_5fdate_35',['get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::get_date()']]], - ['get_5fdeleter_36',['get_deleter',['http://en.cppreference.com/w/cpp/memory/unique_ptr/get_deleter.html',0,'std::unique_ptr']]], - ['get_5felements_5finorder_37',['get_elements_inorder',['../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a',1,'binary_search_tree']]], - ['get_5felements_5fpostorder_38',['get_elements_postorder',['../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff',1,'binary_search_tree']]], - ['get_5felements_5fpreorder_39',['get_elements_preorder',['../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13',1,'binary_search_tree']]], - ['get_5ffinal_5fstatus_40',['get_final_status',['../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86',1,'fcfs_scheduling.cpp']]], - ['get_5ffuture_41',['get_future',['http://en.cppreference.com/w/cpp/thread/packaged_task/get_future.html',0,'std::packaged_task::get_future()'],['http://en.cppreference.com/w/cpp/thread/promise/get_future.html',0,'std::promise::get_future()']]], - ['get_5fid_42',['get_id',['http://en.cppreference.com/w/cpp/thread/thread/get_id.html',0,'std::thread::get_id()'],['http://en.cppreference.com/w/cpp/thread/get_id.html',0,'std::this_thread::get_id()']]], - ['get_5fidx_5fchar_43',['get_idx_char',['../d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c',1,'ciphers::HillCipher']]], - ['get_5finput_44',['get_input',['../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1',1,'ternary_search.cpp']]], - ['get_5fintersection_45',['get_intersection',['../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e',1,'operations_on_datastructures']]], - ['get_5finverse_46',['get_inverse',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a',1,'get_inverse(): ordinary_least_squares_regressor.cpp'],['../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7',1,'ciphers::HillCipher::get_inverse()']]], - ['get_5fk_5fth_47',['get_k_th',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69',1,'data_structures::treap::Treap']]], - ['get_5flevel_5forder_48',['get_level_order',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]], - ['get_5fmax_49',['get_max',['../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde',1,'dsu']]], - ['get_5fmin_50',['get_min',['../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415',1,'dsu']]], - ['get_5fmin_5f2d_51',['get_min_2d',['../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e',1,'kohonen_som_topology.cpp']]], - ['get_5fminima_52',['get_minima',['../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function< double(double)> &f, double lim_a, double lim_b): golden_search_extrema.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function< double(double)> &f, double lim_a, double lim_b): brent_method_extrema.cpp']]], - ['get_5fmoney_53',['get_money',['http://en.cppreference.com/w/cpp/io/manip/get_money.html',0,'std']]], - ['get_5fmonthname_54',['get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::get_monthname()']]], - ['get_5fnew_5fhandler_55',['get_new_handler',['http://en.cppreference.com/w/cpp/memory/new/get_new_handler.html',0,'std']]], - ['get_5fnext_56',['get_next',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4',1,'data_structures::treap::Treap']]], - ['get_5fpointer_5fsafety_57',['get_pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/get_pointer_safety.html',0,'std']]], - ['get_5fpredecessor_58',['get_predecessor',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126',1,'data_structures::treap::Treap']]], - ['get_5frand_59',['get_rand',['../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0',1,'complex_numbers.cpp']]], - ['get_5frank_60',['get_rank',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039',1,'data_structures::treap::Treap']]], - ['get_5fshape_61',['get_shape',['../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078',1,'machine_learning']]], - ['get_5fsize_62',['get_size',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f',1,'machine_learning::aystar_search::EightPuzzle']]], - ['get_5fstate_63',['get_state',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99',1,'machine_learning::aystar_search::EightPuzzle']]], - ['get_5ftemporary_5fbuffer_64',['get_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/get_temporary_buffer.html',0,'std']]], - ['get_5fterminate_65',['get_terminate',['http://en.cppreference.com/w/cpp/error/get_terminate.html',0,'std']]], - ['get_5ftest_5fcases_66',['get_test_cases',['../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c',1,'longest_common_string.cpp']]], - ['get_5ftime_67',['get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::get_time()'],['http://en.cppreference.com/w/cpp/io/manip/get_time.html',0,'std::get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::get_time()']]], - ['get_5ftranspose_68',['get_transpose',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb',1,'ordinary_least_squares_regressor.cpp']]], - ['get_5funexpected_69',['get_unexpected',['http://en.cppreference.com/w/cpp/error/get_unexpected.html',0,'std']]], - ['get_5funion_70',['get_union',['../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74',1,'operations_on_datastructures']]], - ['get_5fweekday_71',['get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::get_weekday()']]], - ['get_5fxy_5ffrom_5fcsv_72',['get_XY_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d',1,'machine_learning::neural_network::NeuralNetwork']]], - ['get_5fyear_73',['get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::get_year()']]], - ['getadjlist_74',['getAdjList',['../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d',1,'Graph']]], - ['getbalance_75',['getBalance',['../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546',1,'avltree.cpp']]], - ['getc_76',['getc',['http://en.cppreference.com/w/cpp/io/c/fgetc.html',0,'std']]], - ['getchar_77',['getchar',['http://en.cppreference.com/w/cpp/io/c/getchar.html',0,'std']]], - ['getchild_78',['GetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4',1,'data_structures::tree_234::Node']]], - ['getchildindex_79',['GetChildIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37',1,'data_structures::tree_234::Node']]], - ['getconnectedcomponents_80',['getConnectedComponents',['../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b',1,'graph']]], - ['getconvexhull_81',['getConvexHull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1',1,'geometry::jarvis::Convexhull']]], - ['getcount_82',['GetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06',1,'data_structures::tree_234::Node']]], - ['getenv_83',['getenv',['http://en.cppreference.com/w/cpp/utility/program/getenv.html',0,'std']]], - ['getfailurearray_84',['getFailureArray',['../d9/d03/namespacestring__search.html#a996573527312d5255e1495b879e8a34f',1,'string_search']]], - ['gethits_85',['getHits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933',1,'others::lru_cache::LRUCache']]], - ['getinordersuccessor_86',['getInorderSuccessor',['../d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690',1,'operations_on_datastructures::inorder_traversal_of_bst']]], - ['getitem_87',['GetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3',1,'data_structures::tree_234::Node']]], - ['getitemindex_88',['GetItemIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629',1,'data_structures::tree_234::Node']]], - ['getitemleftchild_89',['GetItemLeftChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e',1,'data_structures::tree_234::Node']]], - ['getitemrightchild_90',['GetItemRightChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95',1,'data_structures::tree_234::Node']]], - ['getleftmostchild_91',['GetLeftmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e',1,'data_structures::tree_234::Node']]], - ['getline_92',['getline',['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wstringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::ifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wfstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_ifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wiostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istrstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::strstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::fstream::getline()'],['http://en.cppreference.com/w/cpp/string/basic_string/getline.html',0,'std::getline()']]], - ['getloc_93',['getloc',['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wiostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ifstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wfstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wstringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ifstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wfilebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ios_base::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ios::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_filebuf::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::basic_regex::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::regex::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::wregex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::strstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::strstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istream::getloc()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/getloc.html',0,'std::regex_traits::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wifstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostream::getloc()']]], - ['getmaxitem_94',['GetMaxItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57',1,'data_structures::tree_234::Node']]], - ['getmedian_95',['getMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d',1,'probability::windowed_median::WindowedMedian']]], - ['getmediannaive_96',['getMedianNaive',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6',1,'probability::windowed_median::WindowedMedian']]], - ['getmin_97',['getMin',['../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130',1,'MinHeap']]], - ['getminimum_98',['getMinimum',['../d4/d96/range__queries_2sparse__table_8cpp.html#a932816c3de9e5ad122b180de60978e8f',1,'range_queries::sparse_table']]], - ['getminitem_99',['GetMinItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71',1,'data_structures::tree_234::Node']]], - ['getnextpossiblechild_100',['GetNextPossibleChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46',1,'data_structures::tree_234::Node']]], - ['getnode_101',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'getnode(): linkedlist_implentation_usingarray.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst::getNode()']]], - ['getpagefault_102',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]], - ['getparents_103',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]], - ['getrandomindex_104',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]], - ['getrightmostchild_105',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]], - ['gets_106',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]], - ['gettreemaxitem_107',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]], - ['gettreeminitem_108',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]], - ['getvertices_109',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]], - ['getwchar_110',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]], - ['giga_111',['giga',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], - ['github_20actions_112',['GitHub Actions',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40',1,'']]], - ['given_20node_20does_20not_20have_20a_20right_20node_20subtree_113',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], - ['given_20node_20has_20the_20right_20node_20subtree_114',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], - ['global_115',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]], - ['gmtime_116',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]], - ['gnome_5fsort_2ecpp_117',['gnome_sort.cpp',['../d2/d21/gnome__sort_8cpp.html',1,'']]], - ['gnomesort_118',['gnomesort',['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array< T, size > arr)'],['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)']]], - ['golden_5fsearch_5fextrema_2ecpp_119',['golden_search_extrema.cpp',['../d6/d7a/golden__search__extrema_8cpp.html',1,'']]], - ['good_120',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()']]], - ['good_5fsuffix_121',['good_suffix',['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e',1,'strings::boyer_moore::pattern']]], - ['gptr_122',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()']]], - ['gram_5fschmidt_123',['gram_schmidt',['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt::gram_schmidt()'],['../d4/d0f/namespacegram__schmidt.html',1,'gram_schmidt']]], - ['gram_5fschmidt_2ecpp_124',['gram_schmidt.cpp',['../d5/d33/gram__schmidt_8cpp.html',1,'']]], - ['graph_125',['graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'Bipartite graph'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../df/dce/namespacegraph.html',1,'graph'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html',1,'greedy_algorithms::dijkstra::Graph'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html',1,'graph::is_graph_bipartite::Graph'],['../dc/d61/classgraph_1_1_graph.html',1,'graph::Graph< T >'],['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph()'],['../da/d9a/class_graph.html',1,'Graph'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph()'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54',1,'Graph'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph()'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()']]], - ['graph_5fcoloring_126',['graph_coloring',['../d7/d08/namespacegraph__coloring.html',1,'']]], - ['graph_5fcoloring_2ecpp_127',['graph_coloring.cpp',['../d3/d40/graph__coloring_8cpp.html',1,'']]], - ['graphcoloring_128',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]], - ['graphics_129',['Graphics',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55',1,'']]], - ['greater_130',['greater',['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std']]], - ['greater_5fequal_131',['greater_equal',['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std']]], - ['greedy_20algorithms_132',['Greedy Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'']]], - ['greedy_5falgorithms_133',['greedy_algorithms',['../d2/d90/namespacegreedy__algorithms.html',1,'']]], - ['grey_134',['GREY',['../da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e',1,'depth_first_search_with_stack.cpp']]], - ['ground_5fto_5fground_5fprojectile_5fmotion_135',['ground_to_ground_projectile_motion',['../d0/d20/namespaceground__to__ground__projectile__motion.html',1,'']]], - ['ground_5fto_5fground_5fprojectile_5fmotion_2ecpp_136',['ground_to_ground_projectile_motion.cpp',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html',1,'']]], - ['grouping_137',['grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()']]], - ['guidelines_138',['guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35',1,'Commit Guidelines'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'CONTRIBUTION GUIDELINES'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'Directory guidelines'],['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'Enforcement Guidelines'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'File Name guidelines']]], - ['guidelines_20for_20reviewers_20and_20maintainers_139',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]] + ['geometric_5fdistribution_27',['geometric_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html',1,'probability::geometric_dist::geometric_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution.html',0,'std::geometric_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/geometric_distribution.html',0,'std::geometric_distribution::geometric_distribution()'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797',1,'probability::geometric_dist::geometric_distribution::geometric_distribution()']]], + ['geometry_28',['geometry',['../d5/d5f/namespacegeometry.html',1,'']]], + ['geometry_29',['Geometry',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53',1,'']]], + ['get_30',['get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::fstream::get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::get()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html',0,'std::shared_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_fstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::iostream::get()'],['http://en.cppreference.com/w/cpp/thread/shared_future/get.html',0,'std::shared_future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::stringstream::get()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html',0,'std::unique_ptr::get()'],['http://en.cppreference.com/w/cpp/thread/future/get.html',0,'std::future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wifstream::get()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::strstream::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_stringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istrstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wiostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_ifstream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istringstream::get()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/get.html',0,'std::auto_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wfstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_iostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wstringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::ifstream::get()'],['../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a',1,'dsu::get()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420',1,'machine_learning::aystar_search::EightPuzzle::get()']]], + ['get_5fall_5fwords_31',['get_all_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd',1,'data_structures::trie_using_hashmap::Trie']]], + ['get_5fallocator_32',['get_allocator',['http://en.cppreference.com/w/cpp/container/vector/get_allocator.html',0,'std::vector::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::match_results::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multiset/get_allocator.html',0,'std::multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/set/get_allocator.html',0,'std::set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_map/get_allocator.html',0,'std::unordered_map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wsmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::smatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/get_allocator.html',0,'std::unordered_multimap::get_allocator()'],['http://en.cppreference.com/w/cpp/container/forward_list/get_allocator.html',0,'std::forward_list::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wcmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/deque/get_allocator.html',0,'std::deque::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::basic_string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::wstring::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/get_allocator.html',0,'std::unordered_multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u16string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u32string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/list/get_allocator.html',0,'std::list::get_allocator()'],['http://en.cppreference.com/w/cpp/container/map/get_allocator.html',0,'std::map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::cmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_set/get_allocator.html',0,'std::unordered_set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multimap/get_allocator.html',0,'std::multimap::get_allocator()']]], + ['get_5fchar_33',['get_char',['../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da',1,'hashing::sha256']]], + ['get_5fchar_5fidx_34',['get_char_idx',['../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41',1,'ciphers::HillCipher']]], + ['get_5fclock_5fdiff_35',['get_clock_diff',['../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_trace.cpp']]], + ['get_5fdate_36',['get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::get_date()']]], + ['get_5fdeleter_37',['get_deleter',['http://en.cppreference.com/w/cpp/memory/unique_ptr/get_deleter.html',0,'std::unique_ptr']]], + ['get_5felements_5finorder_38',['get_elements_inorder',['../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a',1,'binary_search_tree']]], + ['get_5felements_5fpostorder_39',['get_elements_postorder',['../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff',1,'binary_search_tree']]], + ['get_5felements_5fpreorder_40',['get_elements_preorder',['../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13',1,'binary_search_tree']]], + ['get_5ffinal_5fstatus_41',['get_final_status',['../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86',1,'fcfs_scheduling.cpp']]], + ['get_5ffuture_42',['get_future',['http://en.cppreference.com/w/cpp/thread/promise/get_future.html',0,'std::promise::get_future()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/get_future.html',0,'std::packaged_task::get_future()']]], + ['get_5fid_43',['get_id',['http://en.cppreference.com/w/cpp/thread/thread/get_id.html',0,'std::thread::get_id()'],['http://en.cppreference.com/w/cpp/thread/get_id.html',0,'std::this_thread::get_id()']]], + ['get_5fidx_5fchar_44',['get_idx_char',['../d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c',1,'ciphers::HillCipher']]], + ['get_5finput_45',['get_input',['../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1',1,'ternary_search.cpp']]], + ['get_5fintersection_46',['get_intersection',['../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e',1,'operations_on_datastructures']]], + ['get_5finverse_47',['get_inverse',['../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7',1,'ciphers::HillCipher::get_inverse()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a',1,'get_inverse(): ordinary_least_squares_regressor.cpp']]], + ['get_5fk_5fth_48',['get_k_th',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69',1,'data_structures::treap::Treap']]], + ['get_5flevel_5forder_49',['get_level_order',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]], + ['get_5fmax_50',['get_max',['../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde',1,'dsu']]], + ['get_5fmin_51',['get_min',['../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415',1,'dsu']]], + ['get_5fmin_5f2d_52',['get_min_2d',['../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e',1,'kohonen_som_topology.cpp']]], + ['get_5fminima_53',['get_minima',['../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function< double(double)> &f, double lim_a, double lim_b): brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function< double(double)> &f, double lim_a, double lim_b): golden_search_extrema.cpp']]], + ['get_5fmoney_54',['get_money',['http://en.cppreference.com/w/cpp/io/manip/get_money.html',0,'std']]], + ['get_5fmonthname_55',['get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::get_monthname()']]], + ['get_5fnew_5fhandler_56',['get_new_handler',['http://en.cppreference.com/w/cpp/memory/new/get_new_handler.html',0,'std']]], + ['get_5fnext_57',['get_next',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4',1,'data_structures::treap::Treap']]], + ['get_5fpointer_5fsafety_58',['get_pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/get_pointer_safety.html',0,'std']]], + ['get_5fpredecessor_59',['get_predecessor',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126',1,'data_structures::treap::Treap']]], + ['get_5frand_60',['get_rand',['../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0',1,'complex_numbers.cpp']]], + ['get_5frank_61',['get_rank',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039',1,'data_structures::treap::Treap']]], + ['get_5fshape_62',['get_shape',['../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078',1,'machine_learning']]], + ['get_5fsize_63',['get_size',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f',1,'machine_learning::aystar_search::EightPuzzle']]], + ['get_5fstate_64',['get_state',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99',1,'machine_learning::aystar_search::EightPuzzle']]], + ['get_5ftemporary_5fbuffer_65',['get_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/get_temporary_buffer.html',0,'std']]], + ['get_5fterminate_66',['get_terminate',['http://en.cppreference.com/w/cpp/error/get_terminate.html',0,'std']]], + ['get_5ftest_5fcases_67',['get_test_cases',['../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c',1,'longest_common_string.cpp']]], + ['get_5ftime_68',['get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::get_time()'],['http://en.cppreference.com/w/cpp/io/manip/get_time.html',0,'std::get_time()']]], + ['get_5ftranspose_69',['get_transpose',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb',1,'ordinary_least_squares_regressor.cpp']]], + ['get_5funexpected_70',['get_unexpected',['http://en.cppreference.com/w/cpp/error/get_unexpected.html',0,'std']]], + ['get_5funion_71',['get_union',['../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74',1,'operations_on_datastructures']]], + ['get_5fweekday_72',['get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::get_weekday()']]], + ['get_5fxy_5ffrom_5fcsv_73',['get_XY_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d',1,'machine_learning::neural_network::NeuralNetwork']]], + ['get_5fyear_74',['get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::get_year()']]], + ['getadjlist_75',['getAdjList',['../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d',1,'Graph']]], + ['getbalance_76',['getBalance',['../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546',1,'avltree.cpp']]], + ['getc_77',['getc',['http://en.cppreference.com/w/cpp/io/c/fgetc.html',0,'std']]], + ['getchar_78',['getchar',['http://en.cppreference.com/w/cpp/io/c/getchar.html',0,'std']]], + ['getchild_79',['GetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4',1,'data_structures::tree_234::Node']]], + ['getchildindex_80',['GetChildIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37',1,'data_structures::tree_234::Node']]], + ['getconnectedcomponents_81',['getConnectedComponents',['../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b',1,'graph']]], + ['getconvexhull_82',['getConvexHull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1',1,'geometry::jarvis::Convexhull']]], + ['getcount_83',['GetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06',1,'data_structures::tree_234::Node']]], + ['getenv_84',['getenv',['http://en.cppreference.com/w/cpp/utility/program/getenv.html',0,'std']]], + ['getfailurearray_85',['getFailureArray',['../d9/d03/namespacestring__search.html#a996573527312d5255e1495b879e8a34f',1,'string_search']]], + ['gethits_86',['getHits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933',1,'others::lru_cache::LRUCache']]], + ['getinordersuccessor_87',['getInorderSuccessor',['../d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690',1,'operations_on_datastructures::inorder_traversal_of_bst']]], + ['getitem_88',['GetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3',1,'data_structures::tree_234::Node']]], + ['getitemindex_89',['GetItemIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629',1,'data_structures::tree_234::Node']]], + ['getitemleftchild_90',['GetItemLeftChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e',1,'data_structures::tree_234::Node']]], + ['getitemrightchild_91',['GetItemRightChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95',1,'data_structures::tree_234::Node']]], + ['getleftmostchild_92',['GetLeftmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e',1,'data_structures::tree_234::Node']]], + ['getline_93',['getline',['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::strstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istrstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wiostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_ifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wfstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wstringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::ifstream::getline()'],['http://en.cppreference.com/w/cpp/string/basic_string/getline.html',0,'std::getline()']]], + ['getloc_94',['getloc',['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::regex::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::basic_regex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ios::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::wregex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wfilebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ios_base::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::strstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wifstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/getloc.html',0,'std::regex_traits::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::strstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wiostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ifstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wfstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wstringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ifstream::getloc()']]], + ['getmaxitem_95',['GetMaxItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57',1,'data_structures::tree_234::Node']]], + ['getmedian_96',['getMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d',1,'probability::windowed_median::WindowedMedian']]], + ['getmediannaive_97',['getMedianNaive',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6',1,'probability::windowed_median::WindowedMedian']]], + ['getmin_98',['getMin',['../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130',1,'MinHeap']]], + ['getminimum_99',['getMinimum',['../d4/d96/range__queries_2sparse__table_8cpp.html#a932816c3de9e5ad122b180de60978e8f',1,'range_queries::sparse_table']]], + ['getminitem_100',['GetMinItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71',1,'data_structures::tree_234::Node']]], + ['getnextpossiblechild_101',['GetNextPossibleChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46',1,'data_structures::tree_234::Node']]], + ['getnode_102',['getNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst']]], + ['getnode_103',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]], + ['getpagefault_104',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]], + ['getparents_105',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]], + ['getrandomindex_106',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]], + ['getrightmostchild_107',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]], + ['gets_108',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]], + ['gettreemaxitem_109',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]], + ['gettreeminitem_110',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]], + ['getvertices_111',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]], + ['getwchar_112',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]], + ['giga_113',['giga',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['github_20actions_114',['GitHub Actions',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40',1,'']]], + ['given_20node_20does_20not_20have_20a_20right_20node_20subtree_115',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['given_20node_20has_20the_20right_20node_20subtree_116',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['global_117',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]], + ['gmtime_118',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]], + ['gnome_5fsort_2ecpp_119',['gnome_sort.cpp',['../d2/d21/gnome__sort_8cpp.html',1,'']]], + ['gnomesort_120',['gnomeSort',['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)'],['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array< T, size > arr)']]], + ['golden_5fsearch_5fextrema_2ecpp_121',['golden_search_extrema.cpp',['../d6/d7a/golden__search__extrema_8cpp.html',1,'']]], + ['good_122',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()']]], + ['good_5fsuffix_123',['good_suffix',['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e',1,'strings::boyer_moore::pattern']]], + ['gptr_124',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()']]], + ['gram_5fschmidt_125',['gram_schmidt',['../d4/d0f/namespacegram__schmidt.html',1,'gram_schmidt'],['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt::gram_schmidt()']]], + ['gram_5fschmidt_2ecpp_126',['gram_schmidt.cpp',['../d5/d33/gram__schmidt_8cpp.html',1,'']]], + ['graph_127',['Graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'Bipartite graph'],['../da/d9a/class_graph.html',1,'Graph'],['../dc/d61/classgraph_1_1_graph.html',1,'graph::Graph< T >'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html',1,'graph::is_graph_bipartite::Graph'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html',1,'greedy_algorithms::dijkstra::Graph']]], + ['graph_128',['graph',['../df/dce/namespacegraph.html',1,'']]], + ['graph_129',['Graph',['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &&adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector< Edge > const &edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54',1,'Graph']]], + ['graph_5fcoloring_130',['graph_coloring',['../d7/d08/namespacegraph__coloring.html',1,'']]], + ['graph_5fcoloring_2ecpp_131',['graph_coloring.cpp',['../d3/d40/graph__coloring_8cpp.html',1,'']]], + ['graphcoloring_132',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]], + ['graphics_133',['Graphics',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55',1,'']]], + ['greater_134',['greater',['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std']]], + ['greater_5fequal_135',['greater_equal',['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std']]], + ['greedy_20algorithms_136',['Greedy Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'']]], + ['greedy_5falgorithms_137',['greedy_algorithms',['../d2/d90/namespacegreedy__algorithms.html',1,'']]], + ['grey_138',['GREY',['../da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e',1,'depth_first_search_with_stack.cpp']]], + ['ground_5fto_5fground_5fprojectile_5fmotion_139',['ground_to_ground_projectile_motion',['../d0/d20/namespaceground__to__ground__projectile__motion.html',1,'']]], + ['ground_5fto_5fground_5fprojectile_5fmotion_2ecpp_140',['ground_to_ground_projectile_motion.cpp',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html',1,'']]], + ['grouping_141',['grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()']]], + ['guidelines_142',['Commit Guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35',1,'']]], + ['guidelines_143',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]], + ['guidelines_144',['Guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'Directory guidelines'],['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'Enforcement Guidelines'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'File Name guidelines']]], + ['guidelines_20for_20reviewers_20and_20maintainers_145',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]] ]; diff --git a/search/all_d.js b/search/all_d.js index 283a36fd4..61f331b69 100644 --- a/search/all_d.js +++ b/search/all_d.js @@ -8,7 +8,7 @@ var searchData= ['hadamard_5fproduct_5',['hadamard_product',['../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43',1,'machine_learning']]], ['hamilton_5fcycle_6',['hamilton_cycle',['../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4',1,'hamiltons_cycle.cpp']]], ['hamiltons_5fcycle_2ecpp_7',['hamiltons_cycle.cpp',['../dd/d0c/hamiltons__cycle_8cpp.html',1,'']]], - ['hamming_5fdistance_8',['hamming_distance',['../d4/d48/hamming__distance_8cpp.html#abfe6fbb2f3460a2623c96f283178a07a',1,'bit_manipulation::hamming_distance::hamming_distance()'],['../d4/d1c/namespacehamming__distance.html',1,'hamming_distance'],['../d4/d48/hamming__distance_8cpp.html#a40ba9fe8b5df5c268f0c7d677ff2fe80',1,'bit_manipulation::hamming_distance::hamming_distance()']]], + ['hamming_5fdistance_8',['hamming_distance',['../d4/d1c/namespacehamming__distance.html',1,'hamming_distance'],['../d4/d48/hamming__distance_8cpp.html#abfe6fbb2f3460a2623c96f283178a07a',1,'bit_manipulation::hamming_distance::hamming_distance(uint64_t a, uint64_t b)'],['../d4/d48/hamming__distance_8cpp.html#a40ba9fe8b5df5c268f0c7d677ff2fe80',1,'bit_manipulation::hamming_distance::hamming_distance(const std::string &a, const std::string &b)']]], ['hamming_5fdistance_2ecpp_9',['hamming_distance.cpp',['../d4/d48/hamming__distance_8cpp.html',1,'']]], ['happy_5fnumber_2ecpp_10',['happy_number.cpp',['../db/df3/happy__number_8cpp.html',1,'']]], ['hardware_5fconcurrency_11',['hardware_concurrency',['http://en.cppreference.com/w/cpp/thread/thread/hardware_concurrency.html',0,'std::thread']]], @@ -17,49 +17,51 @@ var searchData= ['has_5ffacet_14',['has_facet',['http://en.cppreference.com/w/cpp/locale/has_facet.html',0,'std']]], ['has_5fvirtual_5fdestructor_15',['has_virtual_destructor',['http://en.cppreference.com/w/cpp/types/has_virtual_destructor.html',0,'std']]], ['haschildren_16',['hasChildren',['../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb',1,'Trie']]], - ['hash_17',['hash',['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::hash()'],['../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb',1,'hashing::md5::hash()'],['../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c',1,'hashing::sha1::hash()'],['../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64',1,'hash_chain::hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::hash()'],['http://en.cppreference.com/w/cpp/utility/hash/hash.html',0,'std::hash::hash()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html',1,'hashing::sha256::Hash'],['http://en.cppreference.com/w/cpp/utility/hash.html',0,'std::hash']]], - ['hash_5fbs_18',['hash_bs',['../d8/d7a/sha1_8cpp.html#a7be3471f7e489d7d0df42b97a48bf141',1,'hashing::sha1::hash_bs()'],['../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425',1,'hashing::md5::hash_bs()']]], - ['hash_5fchain_19',['hash_chain',['../dd/d1c/classhash__chain.html',1,'hash_chain'],['../dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595',1,'hash_chain::hash_chain()']]], - ['hash_5fcode_20',['hash_code',['http://en.cppreference.com/w/cpp/types/type_info/hash_code.html',0,'std::type_info::hash_code()'],['http://en.cppreference.com/w/cpp/types/type_index/hash_code.html',0,'std::type_index::hash_code()']]], - ['hash_5ffunction_21',['hash_function',['http://en.cppreference.com/w/cpp/container/unordered_set/hash_function.html',0,'std::unordered_set::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_map/hash_function.html',0,'std::unordered_map::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/hash_function.html',0,'std::unordered_multiset::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/hash_function.html',0,'std::unordered_multimap::hash_function()']]], - ['hash_5fsearch_22',['hash_search',['../d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2',1,'hash_search.cpp']]], - ['hash_5fsearch_2ecpp_23',['hash_search.cpp',['../d1/df3/hash__search_8cpp.html',1,'']]], - ['hashdjb2_24',['hashDJB2',['../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4',1,'data_structures']]], - ['hashfunks_25',['hashFunks',['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80',1,'data_structures::BloomFilter']]], - ['hashfxn_26',['hashfxn',['../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003',1,'double_hashing::hashFxn()'],['../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7',1,'quadratic_probing::hashFxn()'],['../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527',1,'linear_probing::hashFxn()']]], - ['hashing_27',['hashing',['../d6/d0c/namespacehashing.html',1,'hashing'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57',1,'Hashing']]], - ['hashint_5f1_28',['hashInt_1',['../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677',1,'data_structures']]], - ['hashint_5f2_29',['hashInt_2',['../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c',1,'data_structures']]], - ['hashmax_30',['HASHMAX',['../d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367',1,'hash_search.cpp']]], - ['hashstr_31',['hashStr',['../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15',1,'data_structures']]], - ['hashtab_32',['hashtab',['../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d',1,'hash_search.cpp']]], - ['have_20a_20right_20node_20subtree_33',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], - ['head_34',['head',['../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0',1,'hash_chain']]], - ['header_35',['header',['../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16',1,'data_structures::SkipList']]], - ['heap_5fsize_36',['heap_size',['../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913',1,'MinHeap']]], - ['heap_5fsort_2ecpp_37',['heap_sort.cpp',['../d2/d52/heap__sort_8cpp.html',1,'']]], - ['heapsort_38',['heapSort',['../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f',1,'heap_sort.cpp']]], - ['heavy_5flight_5fdecomposition_39',['heavy_light_decomposition',['../db/d6f/namespaceheavy__light__decomposition.html',1,'']]], - ['heavy_5flight_5fdecomposition_2ecpp_40',['heavy_light_decomposition.cpp',['../d2/de9/heavy__light__decomposition_8cpp.html',1,'']]], - ['hecto_41',['hecto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], - ['height_42',['height',['../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83',1,'avltree.cpp']]], - ['heuristic_5fvalue_43',['heuristic_value',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3',1,'machine_learning::aystar_search::AyStarSearch::Info']]], - ['hex_44',['hex',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]], - ['hexfloat_45',['hexfloat',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], - ['high_5fresolution_5fclock_46',['high_resolution_clock',['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock.html',0,'std::chrono']]], - ['hill_5fcipher_2ecpp_47',['hill_cipher.cpp',['../d7/db9/hill__cipher_8cpp.html',1,'']]], - ['hillcipher_48',['HillCipher',['../d6/d26/classciphers_1_1_hill_cipher.html',1,'ciphers']]], - ['hits_49',['hits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154',1,'others::lru_cache::LRUCache']]], - ['hkgraph_50',['hkgraph',['../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9',1,'graph::HKGraph::HKGraph()'],['../d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64',1,'graph::HKGraph::HKGraph(int m, int n)'],['../d8/d69/classgraph_1_1_h_k_graph.html',1,'graph::HKGraph']]], - ['hld_51',['hld',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a6e486767434e44076c1ac374a22da726',1,'range_queries::heavy_light_decomposition::HLD::HLD()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html',1,'range_queries::heavy_light_decomposition::HLD< X >']]], - ['hopcroft_5fkarp_2ecpp_52',['hopcroft_karp.cpp',['../d1/d9a/hopcroft__karp_8cpp.html',1,'']]], - ['hopcroftkarpalgorithm_53',['hopcroftKarpAlgorithm',['../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d',1,'graph::HKGraph']]], - ['horizontal_5frange_54',['horizontal_range',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a10362eb607d7882bac3a0688504b00ff',1,'physics::ground_to_ground_projectile_motion']]], - ['horspool_55',['horspool',['../d5/d02/namespacehorspool.html',1,'horspool'],['../d3/dfe/horspool_8cpp.html#a9884bca75ce39c116697ea2574adb37d',1,'strings::horspool::horspool()']]], - ['horspool_2ecpp_56',['horspool.cpp',['../d3/dfe/horspool_8cpp.html',1,'']]], - ['hours_57',['hours',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::hours'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::hours::hours()']]], - ['house_5frobber_58',['house_robber',['../d2/de1/namespacehouse__robber.html',1,'']]], - ['house_5frobber_2ecpp_59',['house_robber.cpp',['../d6/d26/house__robber_8cpp.html',1,'']]], - ['houserobber_60',['houseRobber',['../d6/d26/house__robber_8cpp.html#a1e497c3e3f169afe5baaae6a5d40cbc8',1,'dynamic_programming::house_robber']]], - ['hypot_61',['hypot',['http://en.cppreference.com/w/cpp/numeric/math/hypot.html',0,'std']]] + ['hash_17',['Hash',['../d6/d84/classhashing_1_1sha256_1_1_hash.html',1,'hashing::sha256']]], + ['hash_18',['hash',['http://en.cppreference.com/w/cpp/utility/hash.html',0,'std::hash'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::hash()'],['http://en.cppreference.com/w/cpp/utility/hash/hash.html',0,'std::hash::hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::hash()'],['../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64',1,'hash_chain::hash()'],['../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb',1,'hashing::md5::hash()'],['../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c',1,'hashing::sha1::hash()']]], + ['hash_5fbs_19',['hash_bs',['../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425',1,'hashing::md5::hash_bs()'],['../d8/d7a/sha1_8cpp.html#a7be3471f7e489d7d0df42b97a48bf141',1,'hashing::sha1::hash_bs()']]], + ['hash_5fchain_20',['hash_chain',['../dd/d1c/classhash__chain.html',1,'hash_chain'],['../dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595',1,'hash_chain::hash_chain()']]], + ['hash_5fcode_21',['hash_code',['http://en.cppreference.com/w/cpp/types/type_info/hash_code.html',0,'std::type_info::hash_code()'],['http://en.cppreference.com/w/cpp/types/type_index/hash_code.html',0,'std::type_index::hash_code()']]], + ['hash_5ffunction_22',['hash_function',['http://en.cppreference.com/w/cpp/container/unordered_map/hash_function.html',0,'std::unordered_map::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/hash_function.html',0,'std::unordered_multimap::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/hash_function.html',0,'std::unordered_multiset::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_set/hash_function.html',0,'std::unordered_set::hash_function()']]], + ['hash_5fsearch_23',['hash_search',['../d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2',1,'hash_search.cpp']]], + ['hash_5fsearch_2ecpp_24',['hash_search.cpp',['../d1/df3/hash__search_8cpp.html',1,'']]], + ['hashdjb2_25',['hashDJB2',['../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4',1,'data_structures']]], + ['hashfunks_26',['hashFunks',['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80',1,'data_structures::BloomFilter']]], + ['hashfxn_27',['hashFxn',['../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003',1,'double_hashing::hashFxn()'],['../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527',1,'linear_probing::hashFxn()'],['../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7',1,'quadratic_probing::hashFxn()']]], + ['hashing_28',['hashing',['../d6/d0c/namespacehashing.html',1,'']]], + ['hashing_29',['Hashing',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57',1,'']]], + ['hashint_5f1_30',['hashInt_1',['../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677',1,'data_structures']]], + ['hashint_5f2_31',['hashInt_2',['../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c',1,'data_structures']]], + ['hashmax_32',['HASHMAX',['../d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367',1,'hash_search.cpp']]], + ['hashstr_33',['hashStr',['../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15',1,'data_structures']]], + ['hashtab_34',['hashtab',['../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d',1,'hash_search.cpp']]], + ['have_20a_20right_20node_20subtree_35',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]], + ['head_36',['head',['../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0',1,'hash_chain']]], + ['header_37',['header',['../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16',1,'data_structures::SkipList']]], + ['heap_5fsize_38',['heap_size',['../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913',1,'MinHeap']]], + ['heap_5fsort_2ecpp_39',['heap_sort.cpp',['../d2/d52/heap__sort_8cpp.html',1,'']]], + ['heapsort_40',['heapSort',['../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f',1,'heap_sort.cpp']]], + ['heavy_5flight_5fdecomposition_41',['heavy_light_decomposition',['../db/d6f/namespaceheavy__light__decomposition.html',1,'']]], + ['heavy_5flight_5fdecomposition_2ecpp_42',['heavy_light_decomposition.cpp',['../d2/de9/heavy__light__decomposition_8cpp.html',1,'']]], + ['hecto_43',['hecto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['height_44',['height',['../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83',1,'avltree.cpp']]], + ['heuristic_5fvalue_45',['heuristic_value',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3',1,'machine_learning::aystar_search::AyStarSearch::Info']]], + ['hex_46',['hex',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]], + ['hexfloat_47',['hexfloat',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], + ['high_5fresolution_5fclock_48',['high_resolution_clock',['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock.html',0,'std::chrono']]], + ['hill_5fcipher_2ecpp_49',['hill_cipher.cpp',['../d7/db9/hill__cipher_8cpp.html',1,'']]], + ['hillcipher_50',['HillCipher',['../d6/d26/classciphers_1_1_hill_cipher.html',1,'ciphers']]], + ['hits_51',['hits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154',1,'others::lru_cache::LRUCache']]], + ['hkgraph_52',['HKGraph',['../d8/d69/classgraph_1_1_h_k_graph.html',1,'graph::HKGraph'],['../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9',1,'graph::HKGraph::HKGraph()'],['../d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64',1,'graph::HKGraph::HKGraph(int m, int n)']]], + ['hld_53',['HLD',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html',1,'range_queries::heavy_light_decomposition::HLD< X >'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a6e486767434e44076c1ac374a22da726',1,'range_queries::heavy_light_decomposition::HLD::HLD()']]], + ['hopcroft_5fkarp_2ecpp_54',['hopcroft_karp.cpp',['../d1/d9a/hopcroft__karp_8cpp.html',1,'']]], + ['hopcroftkarpalgorithm_55',['hopcroftKarpAlgorithm',['../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d',1,'graph::HKGraph']]], + ['horizontal_5frange_56',['horizontal_range',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a10362eb607d7882bac3a0688504b00ff',1,'physics::ground_to_ground_projectile_motion']]], + ['horspool_57',['horspool',['../d5/d02/namespacehorspool.html',1,'horspool'],['../d3/dfe/horspool_8cpp.html#a9884bca75ce39c116697ea2574adb37d',1,'strings::horspool::horspool()']]], + ['horspool_2ecpp_58',['horspool.cpp',['../d3/dfe/horspool_8cpp.html',1,'']]], + ['hours_59',['hours',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::hours'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::hours::hours()']]], + ['house_5frobber_60',['house_robber',['../d2/de1/namespacehouse__robber.html',1,'']]], + ['house_5frobber_2ecpp_61',['house_robber.cpp',['../d6/d26/house__robber_8cpp.html',1,'']]], + ['houserobber_62',['houseRobber',['../d6/d26/house__robber_8cpp.html#a1e497c3e3f169afe5baaae6a5d40cbc8',1,'dynamic_programming::house_robber']]], + ['hypot_63',['hypot',['http://en.cppreference.com/w/cpp/numeric/math/hypot.html',0,'std']]] ]; diff --git a/search/all_e.js b/search/all_e.js index 082953d83..036dd9678 100644 --- a/search/all_e.js +++ b/search/all_e.js @@ -1,246 +1,255 @@ var searchData= [ - ['id_0',['id',['http://en.cppreference.com/w/cpp/locale/locale/id.html',0,'std::locale::id'],['http://en.cppreference.com/w/cpp/thread/thread/id.html',0,'std::thread::id'],['http://en.cppreference.com/w/cpp/locale/locale/id/id.html',0,'std::locale::id::id()'],['http://en.cppreference.com/w/cpp/thread/thread/id/id.html',0,'std::thread::id::id()'],['../dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3',1,'data_structures::SegmentTree::ID']]], - ['identity_5ffunction_1',['identity_function',['../d2/d58/neural__network_8cpp.html#a32c00da08f2cf641dd336270f6e3c407',1,'machine_learning::neural_network::util_functions']]], - ['ifstream_2',['ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std::ifstream'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::ifstream::ifstream()']]], - ['ignore_3',['ignore',['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::strstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istrstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wiostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_ifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wfstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wstringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::ifstream::ignore()']]], - ['ilogb_4',['ilogb',['http://en.cppreference.com/w/cpp/numeric/math/ilogb.html',0,'std']]], - ['imag_5',['imag',['http://en.cppreference.com/w/cpp/numeric/complex/imag.html',0,'std::complex::imag()'],['../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974',1,'Complex::imag()']]], - ['imbue_6',['imbue',['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistream::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::ios_base::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wifstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::basic_ios::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::basic_regex::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::regex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ofstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/imbue.html',0,'std::regex_traits::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::strstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wiostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ifstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wfstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wstringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistringstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::wregex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ifstream::imbue()']]], - ['imod_7',['imod',['../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6',1,'modular_inverse_simple.cpp']]], - ['implementation_8',['Implementation',['../d4/d9f/selection__sort__recursive_8cpp.html#autotoc_md114',1,'']]], - ['in_9',['in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::in()']]], - ['in_20a_20new_20directory_10',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], - ['in_5favail_11',['in_avail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wfilebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::streambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_streambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::strstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_stringbuf::in_avail()']]], - ['in_5frange_12',['in_range',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e',1,'machine_learning::aystar_search::EightPuzzle']]], - ['includes_13',['includes',['http://en.cppreference.com/w/cpp/algorithm/includes.html',0,'std']]], - ['independent_5fbits_5fengine_14',['independent_bits_engine',['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/independent_bits_engine.html',0,'std::independent_bits_engine::independent_bits_engine()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine.html',0,'std::independent_bits_engine']]], - ['inf_15',['inf',['../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c',1,'INF: bidirectional_dijkstra.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c',1,'INF: depth_first_search_with_stack.cpp']]], - ['infinity_16',['infinity',['http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html',0,'std::numeric_limits']]], - ['info_17',['info',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html',1,'machine_learning::aystar_search::AyStarSearch< Puzzle >::Info'],['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a47b9bc9815a2e7123ac1dc13e5377301',1,'machine_learning::aystar_search::AyStarSearch::Info'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7',1,'machine_learning::aystar_search::AyStarSearch::Info::Info()=default'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &A, size_t h_value, size_t d)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &&A) noexcept']]], - ['init_18',['init',['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wiostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::strstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ios::init()'],['../dd/d92/memory__game_8cpp.html#ad573c8ae66ab66156d03e5e81bbba214',1,'games::memory_game::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wfstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wstringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ifstream::init()'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc',1,'range_queries::heavy_light_decomposition::Tree::init()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828',1,'range_queries::heavy_light_decomposition::HLD::init()']]], - ['init_5fbad_5fchar_19',['init_bad_char',['../d3/db2/boyer__moore_8cpp.html#a2f6688c9bb3e692297a3aa09cebc1c00',1,'strings::boyer_moore']]], - ['init_5fgood_5fsuffix_20',['init_good_suffix',['../d3/db2/boyer__moore_8cpp.html#aa709cf7fca02b7d3e1888423d5f739a1',1,'strings::boyer_moore']]], - ['init_5fpattern_21',['init_pattern',['../d3/db2/boyer__moore_8cpp.html#a0b165af1dc341289fd705be4c67728f8',1,'strings::boyer_moore']]], - ['initializer_5flist_22',['initializer_list',['http://en.cppreference.com/w/cpp/utility/initializer_list.html',0,'std::initializer_list'],['http://en.cppreference.com/w/cpp/utility/initializer_list/initializer_list.html',0,'std::initializer_list::initializer_list()']]], - ['inner_5fallocator_23',['inner_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/inner_allocator.html',0,'std::scoped_allocator_adaptor']]], - ['inner_5fproduct_24',['inner_product',['http://en.cppreference.com/w/cpp/algorithm/inner_product.html',0,'std']]], - ['inorder_20traversal_20of_20a_20tree_25',['inorder traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md96',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Inorder Traversal of a tree']]], - ['inorder_5fsuccessor_5fof_5fbst_26',['inorder_successor_of_bst',['../dd/d74/namespaceinorder__successor__of__bst.html',1,'']]], - ['inorder_5fsuccessor_5fof_5fbst_2ecpp_27',['inorder_successor_of_bst.cpp',['../d4/d32/inorder__successor__of__bst_8cpp.html',1,'']]], - ['inorderiterative_28',['inOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499',1,'others::iterative_tree_traversals::BinaryTree']]], - ['inplace_5fmerge_29',['inplace_merge',['http://en.cppreference.com/w/cpp/algorithm/inplace_merge.html',0,'std']]], - ['input_5fiterator_5ftag_30',['input_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], - ['insameunion_31',['InSameUnion',['../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985',1,'disjoint_set.cpp']]], - ['insert_32',['insert',['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u16string::insert()'],['../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2',1,'Trie::insert()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert()'],['../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b',1,'insert(): avltree.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a3ae0bea4123fd2ce155108e88f2ef78c',1,'operations_on_datastructures::inorder_traversal_of_bst::Insert()'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e',1,'data_structures::tree_234::Tree234::Insert(int64_t item)'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f',1,'data_structures::tree_234::Tree234::Insert(Node *tree, int64_t item)'],['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c',1,'operations_on_datastructures::trie_operations::Tnode::Insert()'],['http://en.cppreference.com/w/cpp/container/vector/insert.html',0,'std::vector::insert()'],['http://en.cppreference.com/w/cpp/container/multiset/insert.html',0,'std::multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::string::insert()'],['http://en.cppreference.com/w/cpp/container/set/insert.html',0,'std::set::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_map/insert.html',0,'std::unordered_map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/insert.html',0,'std::unordered_multimap::insert()'],['http://en.cppreference.com/w/cpp/container/deque/insert.html',0,'std::deque::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::basic_string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::wstring::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/insert.html',0,'std::unordered_multiset::insert()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert()'],['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7',1,'probability::windowed_median::WindowedMedian::insert()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u32string::insert()'],['http://en.cppreference.com/w/cpp/container/list/insert.html',0,'std::list::insert()'],['http://en.cppreference.com/w/cpp/container/map/insert.html',0,'std::map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_set/insert.html',0,'std::unordered_set::insert()'],['http://en.cppreference.com/w/cpp/container/multimap/insert.html',0,'std::multimap::insert()'],['../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778',1,'binary_search_tree::insert(std::unique_ptr< bst_node > &node, T new_value)'],['../d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0',1,'binary_search_tree::insert(T new_value)'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1',1,'data_structures::list_array::list::insert()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f',1,'data_structures::linked_list::list::insert()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f',1,'data_structures::treap::Treap::insert()'],['../d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546',1,'data_structures::trie::insert()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2',1,'data_structures::trie_using_hashmap::Trie::insert()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert()']]], - ['insert_5fafter_33',['insert_after',['http://en.cppreference.com/w/cpp/container/forward_list/insert_after.html',0,'std::forward_list']]], - ['insert_5felement_34',['insert_element',['../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd',1,'machine_learning']]], - ['insert_5fiterator_35',['insert_iterator',['http://en.cppreference.com/w/cpp/iterator/insert_iterator.html',0,'std']]], - ['insertatthebeginning_36',['insertAtTheBeginning',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df',1,'linkedlist_implentation_usingarray.cpp']]], - ['insertelement_37',['insertElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9',1,'data_structures::SkipList']]], - ['inserter_38',['inserter',['http://en.cppreference.com/w/cpp/iterator/inserter.html',0,'std']]], - ['insertion_5fsort_2ecpp_39',['insertion_sort.cpp',['../dd/d0d/insertion__sort_8cpp.html',1,'']]], - ['insertionsort_40',['insertionsort',['../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f',1,'sorting::insertionSort(std::vector< T > *arr)'],['../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9',1,'sorting::insertionSort(T *arr, int n)'],['../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1',1,'sorting::merge_insertion::InsertionSort()']]], - ['insertionsort_5fbinsrch_41',['insertionSort_binsrch',['../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68',1,'sorting']]], - ['insertitem_42',['InsertItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb',1,'data_structures::tree_234::Node']]], - ['insertitembyindex_43',['InsertItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956',1,'data_structures::tree_234::Node']]], - ['insertkey_44',['insertKey',['../d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82',1,'MinHeap']]], - ['insertpostmerge_45',['InsertPostMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703',1,'data_structures::tree_234::Tree234']]], - ['insertpresplit_46',['InsertPreSplit',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d',1,'data_structures::tree_234::Tree234']]], - ['inserttosorted_47',['insertToSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24',1,'probability::windowed_median::WindowedMedian']]], - ['int16_5ft_48',['int16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], - ['int32_5ft_49',['int32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], - ['int64_5ft_50',['int64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], - ['int8_5ft_51',['int8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], - ['int_5ffast16_5ft_52',['int_fast16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], - ['int_5ffast32_5ft_53',['int_fast32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], - ['int_5ffast64_5ft_54',['int_fast64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], - ['int_5ffast8_5ft_55',['int_fast8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], - ['int_5fleast16_5ft_56',['int_least16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], - ['int_5fleast32_5ft_57',['int_least32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], - ['int_5fleast64_5ft_58',['int_least64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], - ['int_5fleast8_5ft_59',['int_least8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], - ['integer_5fsequence_60',['integer_sequence',['http://en.cppreference.com/w/cpp/utility/integer_sequence.html',0,'std']]], - ['integral_5fapprox_61',['integral_approx',['../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11',1,'math']]], - ['integral_5fapproximation_2ecpp_62',['integral_approximation.cpp',['../d1/de9/integral__approximation_8cpp.html',1,'']]], - ['integral_5fapproximation2_2ecpp_63',['integral_approximation2.cpp',['../db/d40/integral__approximation2_8cpp.html',1,'']]], - ['integral_5fconstant_64',['integral_constant',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]], - ['integral_5fmonte_5fcarlo_65',['integral_monte_carlo',['../db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51',1,'math::monte_carlo']]], - ['integrating_20cmake_20in_20a_20new_20directory_66',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], - ['interactive_67',['interactive',['../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive(): md5.cpp'],['../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive(): sha1.cpp']]], - ['interface_68',['User-interface',['../dc/d64/md__coding_guidelines.html#autotoc_md18',1,'']]], - ['intern_5ftype_69',['intern_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::intern_type']]], - ['internal_70',['internal',['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std']]], - ['interpolation_5fsearch_71',['interpolation_search',['../d1/d64/namespaceinterpolation__search.html',1,'']]], - ['interpolation_5fsearch2_2ecpp_72',['interpolation_search2.cpp',['../df/d39/interpolation__search2_8cpp.html',1,'']]], - ['interpolationsearch_73',['InterpolationSearch',['../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629',1,'interpolation_search2.cpp']]], - ['intersection_5fof_5ftwo_5farrays_2ecpp_74',['intersection_of_two_arrays.cpp',['../de/dc5/intersection__of__two__arrays_8cpp.html',1,'']]], - ['intervals_75',['intervals',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::intervals()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::intervals()']]], - ['intmax_5ft_76',['intmax_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], - ['intptr_5ft_77',['intptr_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], - ['inv_5fsqrt_2ecpp_78',['inv_sqrt.cpp',['../d6/db8/inv__sqrt_8cpp.html',1,'']]], - ['invalid_5fargument_79',['invalid_argument',['http://en.cppreference.com/w/cpp/error/invalid_argument.html',0,'std::invalid_argument::invalid_argument()'],['http://en.cppreference.com/w/cpp/error/invalid_argument.html',0,'std::invalid_argument']]], - ['inverse_5fcumulative_5fdistribution_80',['inverse_cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf',1,'probability::geometric_dist::geometric_distribution']]], - ['inverse_5ffast_5ffourier_5ftransform_2ecpp_81',['inverse_fast_fourier_transform.cpp',['../d9/d37/inverse__fast__fourier__transform_8cpp.html',1,'']]], - ['inversefastfouriertransform_82',['InverseFastFourierTransform',['../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93',1,'numerical_methods']]], - ['inversion_83',['inversion',['../d9/d13/namespaceinversion.html',1,'']]], - ['ios_5fbase_84',['ios_base',['http://en.cppreference.com/w/cpp/io/ios_base.html',0,'std::ios_base'],['http://en.cppreference.com/w/cpp/io/ios_base/ios_base.html',0,'std::ios_base::ios_base()']]], - ['iostream_85',['iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::iostream::iostream()'],['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std::iostream']]], - ['iota_86',['iota',['http://en.cppreference.com/w/cpp/algorithm/iota.html',0,'std']]], - ['is_87',['is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::is()']]], - ['is2node_88',['Is2Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631',1,'data_structures::tree_234::Node']]], - ['is34node_89',['Is34Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18',1,'data_structures::tree_234::Node']]], - ['is_5fabstract_90',['is_abstract',['http://en.cppreference.com/w/cpp/types/is_abstract.html',0,'std']]], - ['is_5farithmetic_91',['is_arithmetic',['http://en.cppreference.com/w/cpp/types/is_arithmetic.html',0,'std']]], - ['is_5farithmetic_3c_20uint128_5ft_20_3e_92',['is_arithmetic< uint128_t >',['../d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html',1,'std']]], - ['is_5farithmetic_3c_20uint256_5ft_20_3e_93',['is_arithmetic< uint256_t >',['../dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html',1,'std']]], - ['is_5farmstrong_94',['is_armstrong',['../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26',1,'dynamic_programming']]], - ['is_5farray_95',['is_array',['http://en.cppreference.com/w/cpp/types/is_array.html',0,'std']]], - ['is_5fassignable_96',['is_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]], - ['is_5fbase_5fof_97',['is_base_of',['http://en.cppreference.com/w/cpp/types/is_base_of.html',0,'std']]], - ['is_5fbind_5fexpression_98',['is_bind_expression',['http://en.cppreference.com/w/cpp/utility/functional/is_bind_expression.html',0,'std']]], - ['is_5fbipartite_99',['is_bipartite',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9b0c6400693a5cfff971f768dd5ca5ca',1,'graph::is_graph_bipartite::Graph']]], - ['is_5fclass_100',['is_class',['http://en.cppreference.com/w/cpp/types/is_class.html',0,'std']]], - ['is_5fcompound_101',['is_compound',['http://en.cppreference.com/w/cpp/types/is_compound.html',0,'std']]], - ['is_5fconst_102',['is_const',['http://en.cppreference.com/w/cpp/types/is_const.html',0,'std']]], - ['is_5fconstructible_103',['is_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]], - ['is_5fconvertible_104',['is_convertible',['http://en.cppreference.com/w/cpp/types/is_convertible.html',0,'std']]], - ['is_5fcopy_5fassignable_105',['is_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]], - ['is_5fcopy_5fconstructible_106',['is_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]], - ['is_5fdefault_5fconstructible_107',['is_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]], - ['is_5fdestructible_108',['is_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]], - ['is_5fempty_109',['is_empty',['http://en.cppreference.com/w/cpp/types/is_empty.html',0,'std']]], - ['is_5fenum_110',['is_enum',['http://en.cppreference.com/w/cpp/types/is_enum.html',0,'std']]], - ['is_5ferror_5fcode_5fenum_111',['is_error_code_enum',['http://en.cppreference.com/w/cpp/error/error_code/is_error_code_enum.html',0,'std']]], - ['is_5ferror_5fcondition_5fenum_112',['is_error_condition_enum',['http://en.cppreference.com/w/cpp/error/error_condition/is_error_condition_enum.html',0,'std']]], - ['is_5ffactorial_113',['is_factorial',['../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca',1,'math']]], - ['is_5ffloating_5fpoint_114',['is_floating_point',['http://en.cppreference.com/w/cpp/types/is_floating_point.html',0,'std']]], - ['is_5ffunction_115',['is_function',['http://en.cppreference.com/w/cpp/types/is_function.html',0,'std']]], - ['is_5ffundamental_116',['is_fundamental',['http://en.cppreference.com/w/cpp/types/is_fundamental.html',0,'std']]], - ['is_5fgraph_5fbipartite_117',['is_graph_bipartite',['../de/d83/namespaceis__graph__bipartite.html',1,'']]], - ['is_5fgraph_5fbipartite_2ecpp_118',['is_graph_bipartite.cpp',['../d6/dd8/is__graph__bipartite_8cpp.html',1,'']]], - ['is_5fhappy_119',['is_happy',['../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7',1,'happy_number.cpp']]], - ['is_5fheap_120',['is_heap',['http://en.cppreference.com/w/cpp/algorithm/is_heap.html',0,'std']]], - ['is_5fheap_5funtil_121',['is_heap_until',['http://en.cppreference.com/w/cpp/algorithm/is_heap_until.html',0,'std']]], - ['is_5fintegral_122',['is_integral',['http://en.cppreference.com/w/cpp/types/is_integral.html',0,'std']]], - ['is_5fintegral_3c_20uint128_5ft_20_3e_123',['is_integral< uint128_t >',['../d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html',1,'std']]], - ['is_5fintegral_3c_20uint256_5ft_20_3e_124',['is_integral< uint256_t >',['../d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html',1,'std']]], - ['is_5fliteral_5ftype_125',['is_literal_type',['http://en.cppreference.com/w/cpp/types/is_literal_type.html',0,'std']]], - ['is_5flock_5ffree_126',['is_lock_free',['http://en.cppreference.com/w/cpp/atomic/atomic/is_lock_free.html',0,'std::atomic']]], - ['is_5flvalue_5freference_127',['is_lvalue_reference',['http://en.cppreference.com/w/cpp/types/is_lvalue_reference.html',0,'std']]], - ['is_5fmember_5ffunction_5fpointer_128',['is_member_function_pointer',['http://en.cppreference.com/w/cpp/types/is_member_function_pointer.html',0,'std']]], - ['is_5fmember_5fobject_5fpointer_129',['is_member_object_pointer',['http://en.cppreference.com/w/cpp/types/is_member_object_pointer.html',0,'std']]], - ['is_5fmember_5fpointer_130',['is_member_pointer',['http://en.cppreference.com/w/cpp/types/is_member_pointer.html',0,'std']]], - ['is_5fmove_5fassignable_131',['is_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]], - ['is_5fmove_5fconstructible_132',['is_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]], - ['is_5fnothrow_5fassignable_133',['is_nothrow_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]], - ['is_5fnothrow_5fconstructible_134',['is_nothrow_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]], - ['is_5fnothrow_5fcopy_5fassignable_135',['is_nothrow_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]], - ['is_5fnothrow_5fcopy_5fconstructible_136',['is_nothrow_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]], - ['is_5fnothrow_5fdefault_5fconstructible_137',['is_nothrow_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]], - ['is_5fnothrow_5fdestructible_138',['is_nothrow_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]], - ['is_5fnothrow_5fmove_5fassignable_139',['is_nothrow_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]], - ['is_5fnothrow_5fmove_5fconstructible_140',['is_nothrow_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]], - ['is_5fnumber_141',['is_number',['../d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a',1,'others::postfix_expression::is_number()'],['../dd/d92/memory__game_8cpp.html#a33167bb9cce6d527b478b4f6ae8c3f59',1,'games::memory_game::is_number()']]], - ['is_5fobject_142',['is_object',['http://en.cppreference.com/w/cpp/types/is_object.html',0,'std']]], - ['is_5fopen_143',['is_open',['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::ifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::basic_ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::wofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::basic_filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::basic_fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::wfilebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::wifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::basic_ifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::wfstream::is_open()']]], - ['is_5fpartitioned_144',['is_partitioned',['http://en.cppreference.com/w/cpp/algorithm/is_partitioned.html',0,'std']]], - ['is_5fpermutation_145',['is_permutation',['http://en.cppreference.com/w/cpp/algorithm/is_permutation.html',0,'std']]], - ['is_5fplaceholder_146',['is_placeholder',['http://en.cppreference.com/w/cpp/utility/functional/is_placeholder.html',0,'std']]], - ['is_5fpod_147',['is_pod',['http://en.cppreference.com/w/cpp/types/is_pod.html',0,'std']]], - ['is_5fpointer_148',['is_pointer',['http://en.cppreference.com/w/cpp/types/is_pointer.html',0,'std']]], - ['is_5fpolymorphic_149',['is_polymorphic',['http://en.cppreference.com/w/cpp/types/is_polymorphic.html',0,'std']]], - ['is_5fprefix_150',['is_prefix',['../d3/db2/boyer__moore_8cpp.html#a056122c8fe8fb0f5fca6428d3f7b5c3a',1,'strings::boyer_moore']]], - ['is_5fprime_151',['is_prime',['../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444',1,'math']]], - ['is_5freference_152',['is_reference',['http://en.cppreference.com/w/cpp/types/is_reference.html',0,'std']]], - ['is_5frvalue_5freference_153',['is_rvalue_reference',['http://en.cppreference.com/w/cpp/types/is_rvalue_reference.html',0,'std']]], - ['is_5fsame_154',['is_same',['http://en.cppreference.com/w/cpp/types/is_same.html',0,'std']]], - ['is_5fscalar_155',['is_scalar',['http://en.cppreference.com/w/cpp/types/is_scalar.html',0,'std']]], - ['is_5fsigned_156',['is_signed',['http://en.cppreference.com/w/cpp/types/is_signed.html',0,'std']]], - ['is_5fsorted_157',['is_sorted',['http://en.cppreference.com/w/cpp/algorithm/is_sorted.html',0,'std']]], - ['is_5fsorted_5funtil_158',['is_sorted_until',['http://en.cppreference.com/w/cpp/algorithm/is_sorted_until.html',0,'std']]], - ['is_5fsquare_159',['is_square',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e',1,'ordinary_least_squares_regressor.cpp']]], - ['is_5fstandard_5flayout_160',['is_standard_layout',['http://en.cppreference.com/w/cpp/types/is_standard_layout.html',0,'std']]], - ['is_5ftrivial_161',['is_trivial',['http://en.cppreference.com/w/cpp/types/is_trivial.html',0,'std']]], - ['is_5ftrivially_5fassignable_162',['is_trivially_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]], - ['is_5ftrivially_5fconstructible_163',['is_trivially_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]], - ['is_5ftrivially_5fcopy_5fassignable_164',['is_trivially_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]], - ['is_5ftrivially_5fcopy_5fconstructible_165',['is_trivially_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]], - ['is_5ftrivially_5fcopyable_166',['is_trivially_copyable',['http://en.cppreference.com/w/cpp/types/is_trivially_copyable.html',0,'std']]], - ['is_5ftrivially_5fdefault_5fconstructible_167',['is_trivially_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]], - ['is_5ftrivially_5fdestructible_168',['is_trivially_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]], - ['is_5ftrivially_5fmove_5fassignable_169',['is_trivially_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]], - ['is_5ftrivially_5fmove_5fconstructible_170',['is_trivially_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]], - ['is_5funion_171',['is_union',['http://en.cppreference.com/w/cpp/types/is_union.html',0,'std']]], - ['is_5funsigned_172',['is_unsigned',['http://en.cppreference.com/w/cpp/types/is_unsigned.html',0,'std']]], - ['is_5funsigned_3c_20uint128_5ft_20_3e_173',['is_unsigned< uint128_t >',['../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html',1,'std']]], - ['is_5funsigned_3c_20uint256_5ft_20_3e_174',['is_unsigned< uint256_t >',['../df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html',1,'std']]], - ['is_5fvoid_175',['is_void',['http://en.cppreference.com/w/cpp/types/is_void.html',0,'std']]], - ['is_5fvolatile_176',['is_volatile',['http://en.cppreference.com/w/cpp/types/is_volatile.html',0,'std']]], - ['isalnum_177',['isalnum',['http://en.cppreference.com/w/cpp/string/byte/isalnum.html',0,'std']]], - ['isalpha_178',['isalpha',['http://en.cppreference.com/w/cpp/string/byte/isalpha.html',0,'std']]], - ['isbigendian_179',['isBigEndian',['../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446',1,'hashing::md5']]], - ['isbipartite_180',['isBipartite',['../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b',1,'graph']]], - ['isblank_181',['isblank',['http://en.cppreference.com/w/cpp/string/byte/isblank.html',0,'std']]], - ['iscntrl_182',['iscntrl',['http://en.cppreference.com/w/cpp/string/byte/iscntrl.html',0,'std']]], - ['isctype_183',['isctype',['http://en.cppreference.com/w/cpp/regex/regex_traits/isctype.html',0,'std::regex_traits']]], - ['iscyclicbfs_184',['isCyclicBFS',['../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5',1,'CycleCheck']]], - ['iscyclicdfs_185',['isCyclicDFS',['../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474',1,'CycleCheck']]], - ['iscyclicdfshelper_186',['isCyclicDFSHelper',['../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b',1,'CycleCheck']]], - ['isdigit_187',['isdigit',['http://en.cppreference.com/w/cpp/string/byte/isdigit.html',0,'std::isdigit()'],['../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180',1,'data_structures::linked_list::isDigit()']]], - ['isempty_188',['isempty',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6d50919d34481a2b96cb74627d227c0e',1,'data_structures::linked_list::list::isEmpty() const'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a',1,'data_structures::linked_list::list::isEmpty()']]], - ['isemptyqueue_189',['isEmptyQueue',['../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec',1,'queue']]], - ['isemptystack_190',['isEmptyStack',['../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5',1,'stack']]], - ['isendofword_191',['isEndofWord',['../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6',1,'data_structures::trie']]], - ['isfinite_192',['isfinite',['http://en.cppreference.com/w/cpp/numeric/math/isfinite.html',0,'std']]], - ['isfull_193',['IsFull',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd',1,'data_structures::tree_234::Node']]], - ['isgraph_194',['isgraph',['http://en.cppreference.com/w/cpp/string/byte/isgraph.html',0,'std']]], - ['isinf_195',['isinf',['http://en.cppreference.com/w/cpp/numeric/math/isinf.html',0,'std']]], - ['isleaf_196',['IsLeaf',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8',1,'data_structures::tree_234::Node']]], - ['islower_197',['islower',['http://en.cppreference.com/w/cpp/string/byte/islower.html',0,'std']]], - ['isnan_198',['isnan',['http://en.cppreference.com/w/cpp/numeric/math/isnan.html',0,'std']]], - ['isnormal_199',['isnormal',['http://en.cppreference.com/w/cpp/numeric/math/isnormal.html',0,'std']]], - ['ispossible_200',['isPossible',['../d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0',1,'backtracking::sudoku_solver']]], - ['ispoweroftwo_201',['isPowerOfTwo',['../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f',1,'bit_manipulation']]], - ['isprime_202',['isprime',['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'IsPrime(int number): primality_test.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd',1,'isPrime(int64_t m): modular_inverse_fermat_little_theorem.cpp'],['../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23',1,'isprime: prime_factorization.cpp']]], - ['isprint_203',['isprint',['http://en.cppreference.com/w/cpp/string/byte/isprint.html',0,'std']]], - ['ispunct_204',['ispunct',['http://en.cppreference.com/w/cpp/string/byte/ispunct.html',0,'std']]], - ['issafe_205',['issafe',['../d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160',1,'backtracking::n_queens::isSafe()'],['../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2',1,'backtracking::knight_tour::issafe()'],['../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d',1,'backtracking::graph_coloring::isSafe()']]], - ['issame_206',['issame',['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)'],['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)']]], - ['isspace_207',['isspace',['http://en.cppreference.com/w/cpp/string/byte/isspace.html',0,'std']]], - ['istream_208',['istream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std::istream'],['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::istream::istream()']]], - ['istream_5fiterator_209',['istream_iterator',['http://en.cppreference.com/w/cpp/iterator/istream_iterator.html',0,'std']]], - ['istreambuf_5fiterator_210',['istreambuf_iterator',['http://en.cppreference.com/w/cpp/iterator/istreambuf_iterator.html',0,'std']]], - ['istringstream_211',['istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std::istringstream'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::istringstream::istringstream()']]], - ['istrstream_212',['istrstream',['http://en.cppreference.com/w/cpp/io/istrstream.html',0,'std::istrstream'],['http://en.cppreference.com/w/cpp/io/istrstream/istrstream.html',0,'std::istrstream::istrstream()']]], - ['isupper_213',['isupper',['http://en.cppreference.com/w/cpp/string/byte/isupper.html',0,'std']]], - ['iswalnum_214',['iswalnum',['http://en.cppreference.com/w/cpp/string/wide/iswalnum.html',0,'std']]], - ['iswalpha_215',['iswalpha',['http://en.cppreference.com/w/cpp/string/wide/iswalpha.html',0,'std']]], - ['iswblank_216',['iswblank',['http://en.cppreference.com/w/cpp/string/wide/iswblank.html',0,'std']]], - ['iswcntrl_217',['iswcntrl',['http://en.cppreference.com/w/cpp/string/wide/iswcntrl.html',0,'std']]], - ['iswctype_218',['iswctype',['http://en.cppreference.com/w/cpp/string/wide/iswctype.html',0,'std']]], - ['iswdigit_219',['iswdigit',['http://en.cppreference.com/w/cpp/string/wide/iswdigit.html',0,'std']]], - ['iswgraph_220',['iswgraph',['http://en.cppreference.com/w/cpp/string/wide/iswgraph.html',0,'std']]], - ['iswlower_221',['iswlower',['http://en.cppreference.com/w/cpp/string/wide/iswlower.html',0,'std']]], - ['iswprint_222',['iswprint',['http://en.cppreference.com/w/cpp/string/wide/iswprint.html',0,'std']]], - ['iswpunct_223',['iswpunct',['http://en.cppreference.com/w/cpp/string/wide/iswpunct.html',0,'std']]], - ['iswspace_224',['iswspace',['http://en.cppreference.com/w/cpp/string/wide/iswspace.html',0,'std']]], - ['iswupper_225',['iswupper',['http://en.cppreference.com/w/cpp/string/wide/iswupper.html',0,'std']]], - ['iswxdigit_226',['iswxdigit',['http://en.cppreference.com/w/cpp/string/wide/iswxdigit.html',0,'std']]], - ['isxdigit_227',['isxdigit',['http://en.cppreference.com/w/cpp/string/byte/isxdigit.html',0,'std']]], - ['it_5fternary_5fsearch_228',['it_ternary_search',['../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0',1,'ternary_search.cpp']]], - ['item_229',['Item',['../db/d66/struct_item.html',1,'']]], - ['items_230',['items',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9',1,'data_structures::tree_234::Node']]], - ['iter_5fswap_231',['iter_swap',['http://en.cppreference.com/w/cpp/algorithm/iter_swap.html',0,'std']]], - ['iter_5ftype_232',['iter_type',['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get_byname::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put_byname::iter_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::iter_type']]], - ['iterative_20inorder_20traversal_20of_20a_20tree_233',['iterative inorder traversal of a tree',['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md96',1,'Iterative Inorder Traversal of a tree']]], - ['iterative_20postorder_20traversal_20of_20a_20tree_234',['iterative postorder traversal of a tree',['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md102',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Postorder Traversal of a tree']]], - ['iterative_20preorder_20traversal_20of_20a_20tree_235',['iterative preorder traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Preorder Traversal of a tree']]], - ['iterative_5ffactorial_2ecpp_236',['iterative_factorial.cpp',['../db/d9f/iterative__factorial_8cpp.html',1,'']]], - ['iterative_5ftree_5ftraversals_237',['iterative_tree_traversals',['../dd/d73/namespaceiterative__tree__traversals.html',1,'']]], - ['iterative_5ftree_5ftraversals_2ecpp_238',['iterative_tree_traversals.cpp',['../d8/d90/iterative__tree__traversals_8cpp.html',1,'']]], - ['iterativefactorial_239',['iterativeFactorial',['../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a',1,'math']]], - ['iterator_240',['iterator',['http://en.cppreference.com/w/cpp/iterator/iterator.html',0,'std']]], - ['iterator_5ftraits_241',['iterator_traits',['http://en.cppreference.com/w/cpp/iterator/iterator_traits.html',0,'std']]], - ['iword_242',['iword',['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wiostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wfstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wstringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ios_base::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::strstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ios::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostream::iword()']]] + ['id_0',['id',['http://en.cppreference.com/w/cpp/locale/locale/id.html',0,'std::locale::id'],['http://en.cppreference.com/w/cpp/thread/thread/id.html',0,'std::thread::id']]], + ['id_1',['ID',['../dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3',1,'data_structures::SegmentTree']]], + ['id_2',['id',['http://en.cppreference.com/w/cpp/locale/locale/id/id.html',0,'std::locale::id::id()'],['http://en.cppreference.com/w/cpp/thread/thread/id/id.html',0,'std::thread::id::id()']]], + ['identity_5ffunction_3',['identity_function',['../d2/d58/neural__network_8cpp.html#a32c00da08f2cf641dd336270f6e3c407',1,'machine_learning::neural_network::util_functions']]], + ['ifstream_4',['ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std::ifstream'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::ifstream::ifstream()']]], + ['ignore_5',['ignore',['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::strstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istrstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wiostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_ifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wfstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wstringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::ifstream::ignore()']]], + ['ilogb_6',['ilogb',['http://en.cppreference.com/w/cpp/numeric/math/ilogb.html',0,'std']]], + ['imag_7',['imag',['http://en.cppreference.com/w/cpp/numeric/complex/imag.html',0,'std::complex::imag()'],['../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974',1,'Complex::imag()']]], + ['imbue_8',['imbue',['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::regex::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::basic_regex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::basic_ios::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::wregex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::ios_base::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wifstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/imbue.html',0,'std::regex_traits::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::strstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wiostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ifstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wfstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wstringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ifstream::imbue()']]], + ['imod_9',['imod',['../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6',1,'modular_inverse_simple.cpp']]], + ['implementation_10',['Implementation',['../d4/d9f/selection__sort__recursive_8cpp.html#autotoc_md114',1,'']]], + ['in_11',['in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::in()']]], + ['in_20a_20new_20directory_12',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], + ['in_5favail_13',['in_avail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wfilebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::strstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_streambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::streambuf::in_avail()']]], + ['in_5frange_14',['in_range',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e',1,'machine_learning::aystar_search::EightPuzzle']]], + ['includes_15',['includes',['http://en.cppreference.com/w/cpp/algorithm/includes.html',0,'std']]], + ['independent_5fbits_5fengine_16',['independent_bits_engine',['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine.html',0,'std::independent_bits_engine'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/independent_bits_engine.html',0,'std::independent_bits_engine::independent_bits_engine()']]], + ['inf_17',['INF',['../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c',1,'INF: bidirectional_dijkstra.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c',1,'INF: depth_first_search_with_stack.cpp']]], + ['infinity_18',['infinity',['http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html',0,'std::numeric_limits']]], + ['info_19',['Info',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html',1,'machine_learning::aystar_search::AyStarSearch< Puzzle >::Info'],['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a47b9bc9815a2e7123ac1dc13e5377301',1,'machine_learning::aystar_search::AyStarSearch::Info'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7',1,'machine_learning::aystar_search::AyStarSearch::Info::Info()=default'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &A, size_t h_value, size_t d)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &&A) noexcept']]], + ['init_20',['init',['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ios::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::strstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wiostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wfstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wstringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ifstream::init()'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc',1,'range_queries::heavy_light_decomposition::Tree::init()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828',1,'range_queries::heavy_light_decomposition::HLD::init()'],['../dd/d92/memory__game_8cpp.html#ad573c8ae66ab66156d03e5e81bbba214',1,'games::memory_game::init()']]], + ['init_5fbad_5fchar_21',['init_bad_char',['../d3/db2/boyer__moore_8cpp.html#a2f6688c9bb3e692297a3aa09cebc1c00',1,'strings::boyer_moore']]], + ['init_5fgood_5fsuffix_22',['init_good_suffix',['../d3/db2/boyer__moore_8cpp.html#aa709cf7fca02b7d3e1888423d5f739a1',1,'strings::boyer_moore']]], + ['init_5fpattern_23',['init_pattern',['../d3/db2/boyer__moore_8cpp.html#a0b165af1dc341289fd705be4c67728f8',1,'strings::boyer_moore']]], + ['initializer_5flist_24',['initializer_list',['http://en.cppreference.com/w/cpp/utility/initializer_list.html',0,'std::initializer_list'],['http://en.cppreference.com/w/cpp/utility/initializer_list/initializer_list.html',0,'std::initializer_list::initializer_list()']]], + ['inner_5fallocator_25',['inner_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/inner_allocator.html',0,'std::scoped_allocator_adaptor']]], + ['inner_5fproduct_26',['inner_product',['http://en.cppreference.com/w/cpp/algorithm/inner_product.html',0,'std']]], + ['inorder_20traversal_20of_20a_20tree_27',['Inorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md96',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Inorder Traversal of a tree']]], + ['inorder_5fsuccessor_5fof_5fbst_28',['inorder_successor_of_bst',['../dd/d74/namespaceinorder__successor__of__bst.html',1,'']]], + ['inorder_5fsuccessor_5fof_5fbst_2ecpp_29',['inorder_successor_of_bst.cpp',['../d4/d32/inorder__successor__of__bst_8cpp.html',1,'']]], + ['inorderiterative_30',['inOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499',1,'others::iterative_tree_traversals::BinaryTree']]], + ['inplace_5fmerge_31',['inplace_merge',['http://en.cppreference.com/w/cpp/algorithm/inplace_merge.html',0,'std']]], + ['input_5fiterator_5ftag_32',['input_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], + ['insameunion_33',['InSameUnion',['../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985',1,'disjoint_set.cpp']]], + ['insert_34',['insert',['http://en.cppreference.com/w/cpp/container/vector/insert.html',0,'std::vector::insert()'],['http://en.cppreference.com/w/cpp/container/multiset/insert.html',0,'std::multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::string::insert()'],['http://en.cppreference.com/w/cpp/container/set/insert.html',0,'std::set::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_map/insert.html',0,'std::unordered_map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/insert.html',0,'std::unordered_multimap::insert()'],['http://en.cppreference.com/w/cpp/container/deque/insert.html',0,'std::deque::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::basic_string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::wstring::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/insert.html',0,'std::unordered_multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u16string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u32string::insert()'],['http://en.cppreference.com/w/cpp/container/list/insert.html',0,'std::list::insert()'],['http://en.cppreference.com/w/cpp/container/map/insert.html',0,'std::map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_set/insert.html',0,'std::unordered_set::insert()'],['http://en.cppreference.com/w/cpp/container/multimap/insert.html',0,'std::multimap::insert()'],['../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778',1,'binary_search_tree::insert(std::unique_ptr< bst_node > &node, T new_value)'],['../d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0',1,'binary_search_tree::insert(T new_value)'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1',1,'data_structures::list_array::list::insert()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f',1,'data_structures::linked_list::list::insert()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f',1,'data_structures::treap::Treap::insert()'],['../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2',1,'Trie::insert()'],['../d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546',1,'data_structures::trie::insert()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2',1,'data_structures::trie_using_hashmap::Trie::insert()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(const std::vector< int64_t > &values)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(int64_t data)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(Node *node)'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::insert()'],['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7',1,'probability::windowed_median::WindowedMedian::insert()']]], + ['insert_35',['Insert',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e',1,'data_structures::tree_234::Tree234::Insert(int64_t item)'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f',1,'data_structures::tree_234::Tree234::Insert(Node *tree, int64_t item)'],['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c',1,'operations_on_datastructures::trie_operations::Tnode::Insert()'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a3ae0bea4123fd2ce155108e88f2ef78c',1,'operations_on_datastructures::inorder_traversal_of_bst::Insert()']]], + ['insert_36',['insert',['../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b',1,'avltree.cpp']]], + ['insert_5fafter_37',['insert_after',['http://en.cppreference.com/w/cpp/container/forward_list/insert_after.html',0,'std::forward_list']]], + ['insert_5felement_38',['insert_element',['../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd',1,'machine_learning']]], + ['insert_5fiterator_39',['insert_iterator',['http://en.cppreference.com/w/cpp/iterator/insert_iterator.html',0,'std']]], + ['insertatthebeginning_40',['insertAtTheBeginning',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df',1,'linkedlist_implentation_usingarray.cpp']]], + ['insertelement_41',['insertElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9',1,'data_structures::SkipList']]], + ['inserter_42',['inserter',['http://en.cppreference.com/w/cpp/iterator/inserter.html',0,'std']]], + ['insertion_5fsort_2ecpp_43',['insertion_sort.cpp',['../dd/d0d/insertion__sort_8cpp.html',1,'']]], + ['insertionsort_44',['insertionSort',['../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9',1,'sorting::insertionSort(T *arr, int n)'],['../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f',1,'sorting::insertionSort(std::vector< T > *arr)']]], + ['insertionsort_45',['InsertionSort',['../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1',1,'sorting::merge_insertion']]], + ['insertionsort_5fbinsrch_46',['insertionSort_binsrch',['../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68',1,'sorting']]], + ['insertitem_47',['InsertItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb',1,'data_structures::tree_234::Node']]], + ['insertitembyindex_48',['InsertItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956',1,'data_structures::tree_234::Node']]], + ['insertkey_49',['insertKey',['../d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82',1,'MinHeap']]], + ['insertpostmerge_50',['InsertPostMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703',1,'data_structures::tree_234::Tree234']]], + ['insertpresplit_51',['InsertPreSplit',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d',1,'data_structures::tree_234::Tree234']]], + ['inserttosorted_52',['insertToSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24',1,'probability::windowed_median::WindowedMedian']]], + ['int16_5ft_53',['int16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int32_5ft_54',['int32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int64_5ft_55',['int64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int8_5ft_56',['int8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5ffast16_5ft_57',['int_fast16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5ffast32_5ft_58',['int_fast32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5ffast64_5ft_59',['int_fast64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5ffast8_5ft_60',['int_fast8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5fleast16_5ft_61',['int_least16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5fleast32_5ft_62',['int_least32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5fleast64_5ft_63',['int_least64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5fleast8_5ft_64',['int_least8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['integer_5fsequence_65',['integer_sequence',['http://en.cppreference.com/w/cpp/utility/integer_sequence.html',0,'std']]], + ['integral_5fapprox_66',['integral_approx',['../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11',1,'math']]], + ['integral_5fapproximation_2ecpp_67',['integral_approximation.cpp',['../d1/de9/integral__approximation_8cpp.html',1,'']]], + ['integral_5fapproximation2_2ecpp_68',['integral_approximation2.cpp',['../db/d40/integral__approximation2_8cpp.html',1,'']]], + ['integral_5fconstant_69',['integral_constant',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]], + ['integral_5fmonte_5fcarlo_70',['integral_monte_carlo',['../db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51',1,'math::monte_carlo']]], + ['integrating_20cmake_20in_20a_20new_20directory_71',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], + ['interactive_72',['interactive',['../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive(): md5.cpp'],['../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive(): sha1.cpp']]], + ['interface_73',['User-interface',['../dc/d64/md__coding_guidelines.html#autotoc_md18',1,'']]], + ['intern_5ftype_74',['intern_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::intern_type']]], + ['internal_75',['internal',['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std']]], + ['interpolation_5fsearch_76',['interpolation_search',['../d1/d64/namespaceinterpolation__search.html',1,'']]], + ['interpolation_5fsearch2_2ecpp_77',['interpolation_search2.cpp',['../df/d39/interpolation__search2_8cpp.html',1,'']]], + ['interpolationsearch_78',['InterpolationSearch',['../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629',1,'interpolation_search2.cpp']]], + ['intersection_5fof_5ftwo_5farrays_2ecpp_79',['intersection_of_two_arrays.cpp',['../de/dc5/intersection__of__two__arrays_8cpp.html',1,'']]], + ['intervals_80',['intervals',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::intervals()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::intervals()']]], + ['intmax_5ft_81',['intmax_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['intptr_5ft_82',['intptr_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['inv_5fsqrt_2ecpp_83',['inv_sqrt.cpp',['../d6/db8/inv__sqrt_8cpp.html',1,'']]], + ['invalid_5fargument_84',['invalid_argument',['http://en.cppreference.com/w/cpp/error/invalid_argument.html',0,'std::invalid_argument'],['http://en.cppreference.com/w/cpp/error/invalid_argument.html',0,'std::invalid_argument::invalid_argument()']]], + ['inverse_5fcumulative_5fdistribution_85',['inverse_cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf',1,'probability::geometric_dist::geometric_distribution']]], + ['inverse_5ffast_5ffourier_5ftransform_2ecpp_86',['inverse_fast_fourier_transform.cpp',['../d9/d37/inverse__fast__fourier__transform_8cpp.html',1,'']]], + ['inversefastfouriertransform_87',['InverseFastFourierTransform',['../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93',1,'numerical_methods']]], + ['inversion_88',['inversion',['../d9/d13/namespaceinversion.html',1,'']]], + ['ios_5fbase_89',['ios_base',['http://en.cppreference.com/w/cpp/io/ios_base.html',0,'std::ios_base'],['http://en.cppreference.com/w/cpp/io/ios_base/ios_base.html',0,'std::ios_base::ios_base()']]], + ['iostream_90',['iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std::iostream'],['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::iostream::iostream()']]], + ['iota_91',['iota',['http://en.cppreference.com/w/cpp/algorithm/iota.html',0,'std']]], + ['is_92',['is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::is()']]], + ['is2node_93',['Is2Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631',1,'data_structures::tree_234::Node']]], + ['is34node_94',['Is34Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18',1,'data_structures::tree_234::Node']]], + ['is_5fabstract_95',['is_abstract',['http://en.cppreference.com/w/cpp/types/is_abstract.html',0,'std']]], + ['is_5farithmetic_96',['is_arithmetic',['http://en.cppreference.com/w/cpp/types/is_arithmetic.html',0,'std']]], + ['is_5farithmetic_3c_20uint128_5ft_20_3e_97',['is_arithmetic< uint128_t >',['../d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html',1,'std']]], + ['is_5farithmetic_3c_20uint256_5ft_20_3e_98',['is_arithmetic< uint256_t >',['../dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html',1,'std']]], + ['is_5farmstrong_99',['is_armstrong',['../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26',1,'dynamic_programming']]], + ['is_5farray_100',['is_array',['http://en.cppreference.com/w/cpp/types/is_array.html',0,'std']]], + ['is_5fassignable_101',['is_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]], + ['is_5fbase_5fof_102',['is_base_of',['http://en.cppreference.com/w/cpp/types/is_base_of.html',0,'std']]], + ['is_5fbind_5fexpression_103',['is_bind_expression',['http://en.cppreference.com/w/cpp/utility/functional/is_bind_expression.html',0,'std']]], + ['is_5fbipartite_104',['is_bipartite',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9b0c6400693a5cfff971f768dd5ca5ca',1,'graph::is_graph_bipartite::Graph']]], + ['is_5fclass_105',['is_class',['http://en.cppreference.com/w/cpp/types/is_class.html',0,'std']]], + ['is_5fcompound_106',['is_compound',['http://en.cppreference.com/w/cpp/types/is_compound.html',0,'std']]], + ['is_5fconst_107',['is_const',['http://en.cppreference.com/w/cpp/types/is_const.html',0,'std']]], + ['is_5fconstructible_108',['is_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]], + ['is_5fconvertible_109',['is_convertible',['http://en.cppreference.com/w/cpp/types/is_convertible.html',0,'std']]], + ['is_5fcopy_5fassignable_110',['is_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]], + ['is_5fcopy_5fconstructible_111',['is_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]], + ['is_5fdefault_5fconstructible_112',['is_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]], + ['is_5fdestructible_113',['is_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]], + ['is_5fempty_114',['is_empty',['http://en.cppreference.com/w/cpp/types/is_empty.html',0,'std']]], + ['is_5fenum_115',['is_enum',['http://en.cppreference.com/w/cpp/types/is_enum.html',0,'std']]], + ['is_5ferror_5fcode_5fenum_116',['is_error_code_enum',['http://en.cppreference.com/w/cpp/error/error_code/is_error_code_enum.html',0,'std']]], + ['is_5ferror_5fcondition_5fenum_117',['is_error_condition_enum',['http://en.cppreference.com/w/cpp/error/error_condition/is_error_condition_enum.html',0,'std']]], + ['is_5ffactorial_118',['is_factorial',['../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca',1,'math']]], + ['is_5ffloating_5fpoint_119',['is_floating_point',['http://en.cppreference.com/w/cpp/types/is_floating_point.html',0,'std']]], + ['is_5ffunction_120',['is_function',['http://en.cppreference.com/w/cpp/types/is_function.html',0,'std']]], + ['is_5ffundamental_121',['is_fundamental',['http://en.cppreference.com/w/cpp/types/is_fundamental.html',0,'std']]], + ['is_5fgraph_5fbipartite_122',['is_graph_bipartite',['../de/d83/namespaceis__graph__bipartite.html',1,'']]], + ['is_5fgraph_5fbipartite_2ecpp_123',['is_graph_bipartite.cpp',['../d6/dd8/is__graph__bipartite_8cpp.html',1,'']]], + ['is_5fhappy_124',['is_happy',['../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7',1,'happy_number.cpp']]], + ['is_5fheap_125',['is_heap',['http://en.cppreference.com/w/cpp/algorithm/is_heap.html',0,'std']]], + ['is_5fheap_5funtil_126',['is_heap_until',['http://en.cppreference.com/w/cpp/algorithm/is_heap_until.html',0,'std']]], + ['is_5fintegral_127',['is_integral',['http://en.cppreference.com/w/cpp/types/is_integral.html',0,'std']]], + ['is_5fintegral_3c_20uint128_5ft_20_3e_128',['is_integral< uint128_t >',['../d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html',1,'std']]], + ['is_5fintegral_3c_20uint256_5ft_20_3e_129',['is_integral< uint256_t >',['../d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html',1,'std']]], + ['is_5fliteral_5ftype_130',['is_literal_type',['http://en.cppreference.com/w/cpp/types/is_literal_type.html',0,'std']]], + ['is_5flock_5ffree_131',['is_lock_free',['http://en.cppreference.com/w/cpp/atomic/atomic/is_lock_free.html',0,'std::atomic']]], + ['is_5flvalue_5freference_132',['is_lvalue_reference',['http://en.cppreference.com/w/cpp/types/is_lvalue_reference.html',0,'std']]], + ['is_5fmember_5ffunction_5fpointer_133',['is_member_function_pointer',['http://en.cppreference.com/w/cpp/types/is_member_function_pointer.html',0,'std']]], + ['is_5fmember_5fobject_5fpointer_134',['is_member_object_pointer',['http://en.cppreference.com/w/cpp/types/is_member_object_pointer.html',0,'std']]], + ['is_5fmember_5fpointer_135',['is_member_pointer',['http://en.cppreference.com/w/cpp/types/is_member_pointer.html',0,'std']]], + ['is_5fmove_5fassignable_136',['is_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]], + ['is_5fmove_5fconstructible_137',['is_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]], + ['is_5fnothrow_5fassignable_138',['is_nothrow_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]], + ['is_5fnothrow_5fconstructible_139',['is_nothrow_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]], + ['is_5fnothrow_5fcopy_5fassignable_140',['is_nothrow_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]], + ['is_5fnothrow_5fcopy_5fconstructible_141',['is_nothrow_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]], + ['is_5fnothrow_5fdefault_5fconstructible_142',['is_nothrow_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]], + ['is_5fnothrow_5fdestructible_143',['is_nothrow_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]], + ['is_5fnothrow_5fmove_5fassignable_144',['is_nothrow_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]], + ['is_5fnothrow_5fmove_5fconstructible_145',['is_nothrow_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]], + ['is_5fnumber_146',['is_number',['../dd/d92/memory__game_8cpp.html#a33167bb9cce6d527b478b4f6ae8c3f59',1,'games::memory_game::is_number()'],['../d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a',1,'others::postfix_expression::is_number()']]], + ['is_5fobject_147',['is_object',['http://en.cppreference.com/w/cpp/types/is_object.html',0,'std']]], + ['is_5fopen_148',['is_open',['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::basic_ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::basic_filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::basic_fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::wfilebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::wifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::basic_ifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::wfstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::wofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::ifstream::is_open()']]], + ['is_5fpartitioned_149',['is_partitioned',['http://en.cppreference.com/w/cpp/algorithm/is_partitioned.html',0,'std']]], + ['is_5fpermutation_150',['is_permutation',['http://en.cppreference.com/w/cpp/algorithm/is_permutation.html',0,'std']]], + ['is_5fplaceholder_151',['is_placeholder',['http://en.cppreference.com/w/cpp/utility/functional/is_placeholder.html',0,'std']]], + ['is_5fpod_152',['is_pod',['http://en.cppreference.com/w/cpp/types/is_pod.html',0,'std']]], + ['is_5fpointer_153',['is_pointer',['http://en.cppreference.com/w/cpp/types/is_pointer.html',0,'std']]], + ['is_5fpolymorphic_154',['is_polymorphic',['http://en.cppreference.com/w/cpp/types/is_polymorphic.html',0,'std']]], + ['is_5fprefix_155',['is_prefix',['../d3/db2/boyer__moore_8cpp.html#a056122c8fe8fb0f5fca6428d3f7b5c3a',1,'strings::boyer_moore']]], + ['is_5fprime_156',['is_prime',['../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444',1,'math']]], + ['is_5freference_157',['is_reference',['http://en.cppreference.com/w/cpp/types/is_reference.html',0,'std']]], + ['is_5frvalue_5freference_158',['is_rvalue_reference',['http://en.cppreference.com/w/cpp/types/is_rvalue_reference.html',0,'std']]], + ['is_5fsame_159',['is_same',['http://en.cppreference.com/w/cpp/types/is_same.html',0,'std']]], + ['is_5fscalar_160',['is_scalar',['http://en.cppreference.com/w/cpp/types/is_scalar.html',0,'std']]], + ['is_5fsigned_161',['is_signed',['http://en.cppreference.com/w/cpp/types/is_signed.html',0,'std']]], + ['is_5fsorted_162',['is_sorted',['http://en.cppreference.com/w/cpp/algorithm/is_sorted.html',0,'std']]], + ['is_5fsorted_5funtil_163',['is_sorted_until',['http://en.cppreference.com/w/cpp/algorithm/is_sorted_until.html',0,'std']]], + ['is_5fsquare_164',['is_square',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e',1,'ordinary_least_squares_regressor.cpp']]], + ['is_5fstandard_5flayout_165',['is_standard_layout',['http://en.cppreference.com/w/cpp/types/is_standard_layout.html',0,'std']]], + ['is_5ftrivial_166',['is_trivial',['http://en.cppreference.com/w/cpp/types/is_trivial.html',0,'std']]], + ['is_5ftrivially_5fassignable_167',['is_trivially_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]], + ['is_5ftrivially_5fconstructible_168',['is_trivially_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]], + ['is_5ftrivially_5fcopy_5fassignable_169',['is_trivially_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]], + ['is_5ftrivially_5fcopy_5fconstructible_170',['is_trivially_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]], + ['is_5ftrivially_5fcopyable_171',['is_trivially_copyable',['http://en.cppreference.com/w/cpp/types/is_trivially_copyable.html',0,'std']]], + ['is_5ftrivially_5fdefault_5fconstructible_172',['is_trivially_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]], + ['is_5ftrivially_5fdestructible_173',['is_trivially_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]], + ['is_5ftrivially_5fmove_5fassignable_174',['is_trivially_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]], + ['is_5ftrivially_5fmove_5fconstructible_175',['is_trivially_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]], + ['is_5funion_176',['is_union',['http://en.cppreference.com/w/cpp/types/is_union.html',0,'std']]], + ['is_5funsigned_177',['is_unsigned',['http://en.cppreference.com/w/cpp/types/is_unsigned.html',0,'std']]], + ['is_5funsigned_3c_20uint128_5ft_20_3e_178',['is_unsigned< uint128_t >',['../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html',1,'std']]], + ['is_5funsigned_3c_20uint256_5ft_20_3e_179',['is_unsigned< uint256_t >',['../df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html',1,'std']]], + ['is_5fvoid_180',['is_void',['http://en.cppreference.com/w/cpp/types/is_void.html',0,'std']]], + ['is_5fvolatile_181',['is_volatile',['http://en.cppreference.com/w/cpp/types/is_volatile.html',0,'std']]], + ['isalnum_182',['isalnum',['http://en.cppreference.com/w/cpp/string/byte/isalnum.html',0,'std']]], + ['isalpha_183',['isalpha',['http://en.cppreference.com/w/cpp/string/byte/isalpha.html',0,'std']]], + ['isbigendian_184',['isBigEndian',['../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446',1,'hashing::md5']]], + ['isbipartite_185',['isBipartite',['../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b',1,'graph']]], + ['isblank_186',['isblank',['http://en.cppreference.com/w/cpp/string/byte/isblank.html',0,'std']]], + ['iscntrl_187',['iscntrl',['http://en.cppreference.com/w/cpp/string/byte/iscntrl.html',0,'std']]], + ['isctype_188',['isctype',['http://en.cppreference.com/w/cpp/regex/regex_traits/isctype.html',0,'std::regex_traits']]], + ['iscyclicbfs_189',['isCyclicBFS',['../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5',1,'CycleCheck']]], + ['iscyclicdfs_190',['isCyclicDFS',['../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474',1,'CycleCheck']]], + ['iscyclicdfshelper_191',['isCyclicDFSHelper',['../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b',1,'CycleCheck']]], + ['isdigit_192',['isDigit',['../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180',1,'data_structures::linked_list']]], + ['isdigit_193',['isdigit',['http://en.cppreference.com/w/cpp/string/byte/isdigit.html',0,'std']]], + ['isempty_194',['isEmpty',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a',1,'data_structures::linked_list::list::isEmpty()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6d50919d34481a2b96cb74627d227c0e',1,'data_structures::linked_list::list::isEmpty() const']]], + ['isemptyqueue_195',['isEmptyQueue',['../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec',1,'queue']]], + ['isemptystack_196',['isEmptyStack',['../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5',1,'stack']]], + ['isendofword_197',['isEndofWord',['../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6',1,'data_structures::trie']]], + ['isfinite_198',['isfinite',['http://en.cppreference.com/w/cpp/numeric/math/isfinite.html',0,'std']]], + ['isfull_199',['IsFull',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd',1,'data_structures::tree_234::Node']]], + ['isgraph_200',['isgraph',['http://en.cppreference.com/w/cpp/string/byte/isgraph.html',0,'std']]], + ['isinf_201',['isinf',['http://en.cppreference.com/w/cpp/numeric/math/isinf.html',0,'std']]], + ['isleaf_202',['IsLeaf',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8',1,'data_structures::tree_234::Node']]], + ['islower_203',['islower',['http://en.cppreference.com/w/cpp/string/byte/islower.html',0,'std']]], + ['isnan_204',['isnan',['http://en.cppreference.com/w/cpp/numeric/math/isnan.html',0,'std']]], + ['isnormal_205',['isnormal',['http://en.cppreference.com/w/cpp/numeric/math/isnormal.html',0,'std']]], + ['ispossible_206',['isPossible',['../d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0',1,'backtracking::sudoku_solver']]], + ['ispoweroftwo_207',['isPowerOfTwo',['../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f',1,'bit_manipulation']]], + ['isprime_208',['isPrime',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd',1,'modular_inverse_fermat_little_theorem.cpp']]], + ['isprime_209',['IsPrime',['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'primality_test.cpp']]], + ['isprime_210',['isprime',['../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23',1,'prime_factorization.cpp']]], + ['isprint_211',['isprint',['http://en.cppreference.com/w/cpp/string/byte/isprint.html',0,'std']]], + ['ispunct_212',['ispunct',['http://en.cppreference.com/w/cpp/string/byte/ispunct.html',0,'std']]], + ['issafe_213',['issafe',['../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2',1,'backtracking::knight_tour']]], + ['issafe_214',['isSafe',['../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d',1,'backtracking::graph_coloring::isSafe()'],['../d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160',1,'backtracking::n_queens::isSafe()']]], + ['issame_215',['isSame',['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)'],['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)']]], + ['isspace_216',['isspace',['http://en.cppreference.com/w/cpp/string/byte/isspace.html',0,'std']]], + ['istream_217',['istream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std::istream'],['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::istream::istream()']]], + ['istream_5fiterator_218',['istream_iterator',['http://en.cppreference.com/w/cpp/iterator/istream_iterator.html',0,'std']]], + ['istreambuf_5fiterator_219',['istreambuf_iterator',['http://en.cppreference.com/w/cpp/iterator/istreambuf_iterator.html',0,'std']]], + ['istringstream_220',['istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std::istringstream'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::istringstream::istringstream()']]], + ['istrstream_221',['istrstream',['http://en.cppreference.com/w/cpp/io/istrstream.html',0,'std::istrstream'],['http://en.cppreference.com/w/cpp/io/istrstream/istrstream.html',0,'std::istrstream::istrstream()']]], + ['isupper_222',['isupper',['http://en.cppreference.com/w/cpp/string/byte/isupper.html',0,'std']]], + ['iswalnum_223',['iswalnum',['http://en.cppreference.com/w/cpp/string/wide/iswalnum.html',0,'std']]], + ['iswalpha_224',['iswalpha',['http://en.cppreference.com/w/cpp/string/wide/iswalpha.html',0,'std']]], + ['iswblank_225',['iswblank',['http://en.cppreference.com/w/cpp/string/wide/iswblank.html',0,'std']]], + ['iswcntrl_226',['iswcntrl',['http://en.cppreference.com/w/cpp/string/wide/iswcntrl.html',0,'std']]], + ['iswctype_227',['iswctype',['http://en.cppreference.com/w/cpp/string/wide/iswctype.html',0,'std']]], + ['iswdigit_228',['iswdigit',['http://en.cppreference.com/w/cpp/string/wide/iswdigit.html',0,'std']]], + ['iswgraph_229',['iswgraph',['http://en.cppreference.com/w/cpp/string/wide/iswgraph.html',0,'std']]], + ['iswlower_230',['iswlower',['http://en.cppreference.com/w/cpp/string/wide/iswlower.html',0,'std']]], + ['iswprint_231',['iswprint',['http://en.cppreference.com/w/cpp/string/wide/iswprint.html',0,'std']]], + ['iswpunct_232',['iswpunct',['http://en.cppreference.com/w/cpp/string/wide/iswpunct.html',0,'std']]], + ['iswspace_233',['iswspace',['http://en.cppreference.com/w/cpp/string/wide/iswspace.html',0,'std']]], + ['iswupper_234',['iswupper',['http://en.cppreference.com/w/cpp/string/wide/iswupper.html',0,'std']]], + ['iswxdigit_235',['iswxdigit',['http://en.cppreference.com/w/cpp/string/wide/iswxdigit.html',0,'std']]], + ['isxdigit_236',['isxdigit',['http://en.cppreference.com/w/cpp/string/byte/isxdigit.html',0,'std']]], + ['it_5fternary_5fsearch_237',['it_ternary_search',['../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0',1,'ternary_search.cpp']]], + ['item_238',['Item',['../db/d66/struct_item.html',1,'']]], + ['items_239',['items',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9',1,'data_structures::tree_234::Node']]], + ['iter_5fswap_240',['iter_swap',['http://en.cppreference.com/w/cpp/algorithm/iter_swap.html',0,'std']]], + ['iter_5ftype_241',['iter_type',['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get_byname::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put_byname::iter_type']]], + ['iterative_20inorder_20traversal_20of_20a_20tree_242',['Iterative Inorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md96',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Inorder Traversal of a tree']]], + ['iterative_20postorder_20traversal_20of_20a_20tree_243',['Iterative Postorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md102',1,'Iterative Postorder Traversal of a tree']]], + ['iterative_20preorder_20traversal_20of_20a_20tree_244',['Iterative Preorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Preorder Traversal of a tree']]], + ['iterative_5ffactorial_2ecpp_245',['iterative_factorial.cpp',['../db/d9f/iterative__factorial_8cpp.html',1,'']]], + ['iterative_5ftree_5ftraversals_246',['iterative_tree_traversals',['../dd/d73/namespaceiterative__tree__traversals.html',1,'']]], + ['iterative_5ftree_5ftraversals_2ecpp_247',['iterative_tree_traversals.cpp',['../d8/d90/iterative__tree__traversals_8cpp.html',1,'']]], + ['iterativefactorial_248',['iterativeFactorial',['../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a',1,'math']]], + ['iterator_249',['iterator',['http://en.cppreference.com/w/cpp/iterator/iterator.html',0,'std']]], + ['iterator_5ftraits_250',['iterator_traits',['http://en.cppreference.com/w/cpp/iterator/iterator_traits.html',0,'std']]], + ['iword_251',['iword',['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ios::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ios_base::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::strstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wiostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wfstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wstringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ifstream::iword()']]] ]; diff --git a/search/classes_1.js b/search/classes_1.js index fba61f2bb..e5ce3423c 100644 --- a/search/classes_1.js +++ b/search/classes_1.js @@ -55,15 +55,16 @@ var searchData= ['binary_5ffunction_52',['binary_function',['http://en.cppreference.com/w/cpp/utility/functional/binary_function.html',0,'std']]], ['binary_5fnegate_53',['binary_negate',['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std']]], ['binary_5fsearch_5ftree_54',['binary_search_tree',['../d9/dde/classbinary__search__tree.html',1,'']]], - ['binarytree_55',['binarytree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree'],['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html',1,'others::iterative_tree_traversals::BinaryTree']]], + ['binarytree_55',['BinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree'],['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html',1,'others::iterative_tree_traversals::BinaryTree']]], ['binomial_5fdistribution_56',['binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution.html',0,'std']]], ['bit_5fand_57',['bit_and',['http://en.cppreference.com/w/cpp/utility/functional/bit_and.html',0,'std']]], ['bit_5fnot_58',['bit_not',['http://en.cppreference.com/w/cpp/utility/functional/bit_not.html',0,'std']]], ['bit_5for_59',['bit_or',['http://en.cppreference.com/w/cpp/utility/functional/bit_or.html',0,'std']]], - ['bitset_60',['bitset',['../d9/dae/classdata__structures_1_1_bitset.html',1,'data_structures::Bitset'],['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std::bitset< Bits >']]], - ['bitset_3c_20maxn_20_3e_61',['bitset< MAXN >',['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std']]], - ['bloomfilter_62',['BloomFilter',['../dc/dd4/classdata__structures_1_1_bloom_filter.html',1,'data_structures']]], - ['bst_5fnode_63',['bst_node',['../dd/db6/structbinary__search__tree_1_1bst__node.html',1,'binary_search_tree']]], - ['bt_64',['BT',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html',1,'others::recursive_tree_traversals']]], - ['btree_65',['Btree',['../d9/d90/struct_btree.html',1,'']]] + ['bitset_60',['Bitset',['../d9/dae/classdata__structures_1_1_bitset.html',1,'data_structures']]], + ['bitset_61',['bitset',['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std']]], + ['bitset_3c_20maxn_20_3e_62',['bitset< MAXN >',['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std']]], + ['bloomfilter_63',['BloomFilter',['../dc/dd4/classdata__structures_1_1_bloom_filter.html',1,'data_structures']]], + ['bst_5fnode_64',['bst_node',['../dd/db6/structbinary__search__tree_1_1bst__node.html',1,'binary_search_tree']]], + ['bt_65',['BT',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html',1,'others::recursive_tree_traversals']]], + ['btree_66',['Btree',['../d9/d90/struct_btree.html',1,'']]] ]; diff --git a/search/classes_10.js b/search/classes_10.js index ed5321ceb..61a036c40 100644 --- a/search/classes_10.js +++ b/search/classes_10.js @@ -1,7 +1,9 @@ var searchData= [ ['query_0',['query',['../dd/d1b/structquery.html',1,'']]], - ['queue_1',['queue',['../dc/db5/struct_queue.html',1,'Queue'],['../db/da9/classqueue.html',1,'queue< ValueType >'],['http://en.cppreference.com/w/cpp/container/queue.html',0,'std::queue< T >']]], - ['queue_3c_20int64_5ft_20_3e_2',['queue< int64_t >',['http://en.cppreference.com/w/cpp/container/queue.html',0,'std']]], - ['queue_5farray_3',['Queue_Array',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html',1,'data_structures::queue_using_array']]] + ['queue_1',['queue',['../db/da9/classqueue.html',1,'']]], + ['queue_2',['Queue',['../dc/db5/struct_queue.html',1,'']]], + ['queue_3',['queue',['http://en.cppreference.com/w/cpp/container/queue.html',0,'std']]], + ['queue_3c_20int64_5ft_20_3e_4',['queue< int64_t >',['http://en.cppreference.com/w/cpp/container/queue.html',0,'std']]], + ['queue_5farray_5',['Queue_Array',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html',1,'data_structures::queue_using_array']]] ]; diff --git a/search/classes_12.js b/search/classes_12.js index 335a97690..0a5741453 100644 --- a/search/classes_12.js +++ b/search/classes_12.js @@ -20,20 +20,20 @@ var searchData= ['shared_5fptr_3c_20node_3c_20valuetype_20_3e_20_3e_17',['shared_ptr< Node< ValueType > >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], ['shared_5fptr_3c_20puzzle_20_3e_18',['shared_ptr< Puzzle >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], ['shared_5fptr_3c_20range_5fqueries_3a_3apersegtree_3a_3anode_20_3e_19',['shared_ptr< range_queries::perSegTree::Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20struct_20node_20_3e_20',['shared_ptr< struct Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20trie_3a_3atrienode_20_3e_21',['shared_ptr< Trie::TrieNode >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5ftimed_5fmutex_22',['shared_timed_mutex',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex.html',0,'std']]], - ['shuffle_5forder_5fengine_23',['shuffle_order_engine',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std']]], - ['sig_5fatomic_5ft_24',['sig_atomic_t',['http://en.cppreference.com/w/cpp/utility/program/sig_atomic_t.html',0,'std']]], - ['size_5ft_25',['size_t',['http://en.cppreference.com/w/cpp/types/size_t.html',0,'std']]], - ['skiplist_26',['SkipList',['../d4/d90/classdata__structures_1_1_skip_list.html',1,'data_structures']]], - ['smatch_27',['smatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std']]], - ['solution_28',['Solution',['../dd/d4f/class_solution.html',1,'']]], - ['sparse_5ftable_29',['Sparse_table',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html',1,'data_structures::sparse_table']]], - ['sregex_5fiterator_30',['sregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std']]], - ['sregex_5ftoken_5fiterator_31',['sregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std']]], - ['ssub_5fmatch_32',['ssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std']]], - ['stack_33',['stack',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html',1,'data_structures::stack_using_queue::Stack'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html',1,'others::postfix_expression::Stack'],['../d1/dc2/classstack.html',1,'stack< ValueType >'],['http://en.cppreference.com/w/cpp/container/stack.html',0,'std::stack< T >']]], + ['shared_5fptr_3c_20trie_3a_3atrienode_20_3e_20',['shared_ptr< Trie::TrieNode >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5ftimed_5fmutex_21',['shared_timed_mutex',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex.html',0,'std']]], + ['shuffle_5forder_5fengine_22',['shuffle_order_engine',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std']]], + ['sig_5fatomic_5ft_23',['sig_atomic_t',['http://en.cppreference.com/w/cpp/utility/program/sig_atomic_t.html',0,'std']]], + ['size_5ft_24',['size_t',['http://en.cppreference.com/w/cpp/types/size_t.html',0,'std']]], + ['skiplist_25',['SkipList',['../d4/d90/classdata__structures_1_1_skip_list.html',1,'data_structures']]], + ['smatch_26',['smatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std']]], + ['solution_27',['Solution',['../dd/d4f/class_solution.html',1,'']]], + ['sparse_5ftable_28',['Sparse_table',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html',1,'data_structures::sparse_table']]], + ['sregex_5fiterator_29',['sregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std']]], + ['sregex_5ftoken_5fiterator_30',['sregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std']]], + ['ssub_5fmatch_31',['ssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std']]], + ['stack_32',['Stack',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html',1,'data_structures::stack_using_queue::Stack'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html',1,'others::postfix_expression::Stack']]], + ['stack_33',['stack',['../d1/dc2/classstack.html',1,'stack< ValueType >'],['http://en.cppreference.com/w/cpp/container/stack.html',0,'std::stack< T >']]], ['stack_5flinkedlist_34',['stack_linkedList',['../d2/dc4/classstack__linked_list.html',1,'']]], ['state_5ftype_35',['state_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::state_type']]], ['stats_5fcomputer1_36',['stats_computer1',['../d7/d7c/classstatistics_1_1stats__computer1.html',1,'statistics']]], diff --git a/search/classes_13.js b/search/classes_13.js index 1f5b470e7..1617b77ab 100644 --- a/search/classes_13.js +++ b/search/classes_13.js @@ -20,13 +20,13 @@ var searchData= ['treat_5fas_5ffloating_5fpoint_17',['treat_as_floating_point',['http://en.cppreference.com/w/cpp/chrono/treat_as_floating_point.html',0,'std::chrono']]], ['tree_18',['Tree',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html',1,'range_queries::heavy_light_decomposition']]], ['tree234_19',['Tree234',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html',1,'data_structures::tree_234']]], - ['trie_20',['trie',['../d0/d3e/classdata__structures_1_1trie.html',1,'data_structures::trie'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html',1,'data_structures::trie_using_hashmap::Trie'],['../dd/d2f/class_trie.html',1,'Trie']]], - ['trienode_21',['TrieNode',['../de/d48/struct_trie_1_1_trie_node.html',1,'Trie']]], - ['true_5ftype_22',['true_type',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]], - ['try_5fto_5flock_5ft_23',['try_to_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], - ['tuple_24',['tuple',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std']]], - ['tuple_3c_20int_2c_20int_2c_20int_20_3e_25',['tuple< int, int, int >',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std']]], - ['tuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_26',['tuple< S, T, E, double, double, double >',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std']]], + ['trie_20',['trie',['../d0/d3e/classdata__structures_1_1trie.html',1,'data_structures']]], + ['trie_21',['Trie',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html',1,'data_structures::trie_using_hashmap::Trie'],['../dd/d2f/class_trie.html',1,'Trie']]], + ['trienode_22',['TrieNode',['../de/d48/struct_trie_1_1_trie_node.html',1,'Trie']]], + ['true_5ftype_23',['true_type',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]], + ['try_5fto_5flock_5ft_24',['try_to_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], + ['tuple_25',['tuple',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std']]], + ['tuple_3c_20int_2c_20int_2c_20int_20_3e_26',['tuple< int, int, int >',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std']]], ['type_5findex_27',['type_index',['http://en.cppreference.com/w/cpp/types/type_index.html',0,'std']]], ['type_5finfo_28',['type_info',['http://en.cppreference.com/w/cpp/types/type_info.html',0,'std']]] ]; diff --git a/search/classes_2.js b/search/classes_2.js index 5bd2e9658..02502d48c 100644 --- a/search/classes_2.js +++ b/search/classes_2.js @@ -22,19 +22,21 @@ var searchData= ['collate_19',['collate',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std']]], ['collate_5fbyname_20',['collate_byname',['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std']]], ['common_5ftype_21',['common_type',['http://en.cppreference.com/w/cpp/types/common_type.html',0,'std']]], - ['compare_22',['compare',['../d1/db3/structcompare.html',1,'compare'],['../de/d4a/class_compare.html',1,'Compare< S, T, E >']]], - ['comparison_5foperator_23',['comparison_operator',['../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html',1,'machine_learning::aystar_search::AyStarSearch']]], - ['complex_24',['complex',['../da/d5a/class_complex.html',1,'Complex'],['http://en.cppreference.com/w/cpp/numeric/complex.html',0,'std::complex']]], - ['condition_5fvariable_25',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable.html',0,'std']]], - ['condition_5fvariable_5fany_26',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any.html',0,'std']]], - ['conditional_27',['conditional',['http://en.cppreference.com/w/cpp/types/conditional.html',0,'std']]], - ['convexhull_28',['Convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html',1,'geometry::jarvis']]], - ['cout_29',['cout',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], - ['cregex_5fiterator_30',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std']]], - ['cregex_5ftoken_5fiterator_31',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std']]], - ['csub_5fmatch_32',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std']]], - ['ctype_33',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype.html',0,'std']]], - ['ctype_5fbase_34',['ctype_base',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std']]], - ['ctype_5fbyname_35',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std']]], - ['cyclecheck_36',['CycleCheck',['../d3/dbb/class_cycle_check.html',1,'']]] + ['compare_22',['compare',['../d1/db3/structcompare.html',1,'']]], + ['compare_23',['Compare',['../de/d4a/class_compare.html',1,'']]], + ['comparison_5foperator_24',['comparison_operator',['../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html',1,'machine_learning::aystar_search::AyStarSearch']]], + ['complex_25',['Complex',['../da/d5a/class_complex.html',1,'']]], + ['complex_26',['complex',['http://en.cppreference.com/w/cpp/numeric/complex.html',0,'std']]], + ['condition_5fvariable_27',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable.html',0,'std']]], + ['condition_5fvariable_5fany_28',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any.html',0,'std']]], + ['conditional_29',['conditional',['http://en.cppreference.com/w/cpp/types/conditional.html',0,'std']]], + ['convexhull_30',['Convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html',1,'geometry::jarvis']]], + ['cout_31',['cout',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['cregex_5fiterator_32',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std']]], + ['cregex_5ftoken_5fiterator_33',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std']]], + ['csub_5fmatch_34',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std']]], + ['ctype_35',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype.html',0,'std']]], + ['ctype_5fbase_36',['ctype_base',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std']]], + ['ctype_5fbyname_37',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std']]], + ['cyclecheck_38',['CycleCheck',['../d3/dbb/class_cycle_check.html',1,'']]] ]; diff --git a/search/classes_4.js b/search/classes_4.js index 01f2c9e29..ee97b953f 100644 --- a/search/classes_4.js +++ b/search/classes_4.js @@ -5,7 +5,7 @@ var searchData= ['eightpuzzle_2',['EightPuzzle',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html',1,'machine_learning::aystar_search']]], ['enable_5fif_3',['enable_if',['http://en.cppreference.com/w/cpp/types/enable_if.html',0,'std']]], ['enable_5fshared_5ffrom_5fthis_4',['enable_shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this.html',0,'std']]], - ['entry_5',['entry',['../d9/dde/structdouble__hashing_1_1_entry.html',1,'double_hashing::Entry'],['../db/d19/structlinear__probing_1_1_entry.html',1,'linear_probing::Entry'],['../da/dd1/structquadratic__probing_1_1_entry.html',1,'quadratic_probing::Entry']]], + ['entry_5',['Entry',['../d9/dde/structdouble__hashing_1_1_entry.html',1,'double_hashing::Entry'],['../db/d19/structlinear__probing_1_1_entry.html',1,'linear_probing::Entry'],['../da/dd1/structquadratic__probing_1_1_entry.html',1,'quadratic_probing::Entry']]], ['equal_5fto_6',['equal_to',['http://en.cppreference.com/w/cpp/utility/functional/equal_to.html',0,'std']]], ['errc_7',['errc',['http://en.cppreference.com/w/cpp/error/errc.html',0,'std']]], ['error_5fcategory_8',['error_category',['http://en.cppreference.com/w/cpp/error/error_category.html',0,'std']]], diff --git a/search/classes_5.js b/search/classes_5.js index eb66676a7..48030014f 100644 --- a/search/classes_5.js +++ b/search/classes_5.js @@ -16,7 +16,6 @@ var searchData= ['front_5finsert_5fiterator_13',['front_insert_iterator',['http://en.cppreference.com/w/cpp/iterator/front_insert_iterator.html',0,'std']]], ['fstream_14',['fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std']]], ['function_15',['function',['http://en.cppreference.com/w/cpp/utility/functional/function.html',0,'std']]], - ['function_3c_20std_3a_3asize_5ft_28t_29_3e_16',['function< std::size_t(T)>',['http://en.cppreference.com/w/cpp/utility/functional/function.html',0,'std']]], - ['future_17',['future',['http://en.cppreference.com/w/cpp/thread/future.html',0,'std']]], - ['future_5ferror_18',['future_error',['http://en.cppreference.com/w/cpp/thread/future_error.html',0,'std']]] + ['future_16',['future',['http://en.cppreference.com/w/cpp/thread/future.html',0,'std']]], + ['future_5ferror_17',['future_error',['http://en.cppreference.com/w/cpp/thread/future_error.html',0,'std']]] ]; diff --git a/search/classes_6.js b/search/classes_6.js index db0a61235..5470ef9de 100644 --- a/search/classes_6.js +++ b/search/classes_6.js @@ -4,7 +4,7 @@ var searchData= ['generate_5fparentheses_1',['generate_parentheses',['../df/de5/classbacktracking_1_1generate__parentheses.html',1,'backtracking']]], ['geometric_5fdistribution_2',['geometric_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html',1,'probability::geometric_dist::geometric_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution.html',0,'std::geometric_distribution']]], ['giga_3',['giga',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], - ['graph_4',['graph',['../da/d9a/class_graph.html',1,'Graph'],['../dc/d61/classgraph_1_1_graph.html',1,'graph::Graph< T >'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html',1,'graph::is_graph_bipartite::Graph'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html',1,'greedy_algorithms::dijkstra::Graph']]], + ['graph_4',['Graph',['../da/d9a/class_graph.html',1,'Graph'],['../dc/d61/classgraph_1_1_graph.html',1,'graph::Graph< T >'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html',1,'graph::is_graph_bipartite::Graph'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html',1,'greedy_algorithms::dijkstra::Graph']]], ['greater_5',['greater',['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std']]], ['greater_5fequal_6',['greater_equal',['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std']]] ]; diff --git a/search/classes_7.js b/search/classes_7.js index 7dc358706..078a74a3f 100644 --- a/search/classes_7.js +++ b/search/classes_7.js @@ -1,12 +1,13 @@ var searchData= [ ['has_5fvirtual_5fdestructor_0',['has_virtual_destructor',['http://en.cppreference.com/w/cpp/types/has_virtual_destructor.html',0,'std']]], - ['hash_1',['hash',['../d6/d84/classhashing_1_1sha256_1_1_hash.html',1,'hashing::sha256::Hash'],['http://en.cppreference.com/w/cpp/utility/hash.html',0,'std::hash']]], - ['hash_5fchain_2',['hash_chain',['../dd/d1c/classhash__chain.html',1,'']]], - ['hecto_3',['hecto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], - ['high_5fresolution_5fclock_4',['high_resolution_clock',['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock.html',0,'std::chrono']]], - ['hillcipher_5',['HillCipher',['../d6/d26/classciphers_1_1_hill_cipher.html',1,'ciphers']]], - ['hkgraph_6',['HKGraph',['../d8/d69/classgraph_1_1_h_k_graph.html',1,'graph']]], - ['hld_7',['HLD',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html',1,'range_queries::heavy_light_decomposition']]], - ['hours_8',['hours',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]] + ['hash_1',['Hash',['../d6/d84/classhashing_1_1sha256_1_1_hash.html',1,'hashing::sha256']]], + ['hash_2',['hash',['http://en.cppreference.com/w/cpp/utility/hash.html',0,'std']]], + ['hash_5fchain_3',['hash_chain',['../dd/d1c/classhash__chain.html',1,'']]], + ['hecto_4',['hecto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['high_5fresolution_5fclock_5',['high_resolution_clock',['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock.html',0,'std::chrono']]], + ['hillcipher_6',['HillCipher',['../d6/d26/classciphers_1_1_hill_cipher.html',1,'ciphers']]], + ['hkgraph_7',['HKGraph',['../d8/d69/classgraph_1_1_h_k_graph.html',1,'graph']]], + ['hld_8',['HLD',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html',1,'range_queries::heavy_light_decomposition']]], + ['hours_9',['hours',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]] ]; diff --git a/search/classes_d.js b/search/classes_d.js index 615166a07..1795b4c05 100644 --- a/search/classes_d.js +++ b/search/classes_d.js @@ -8,15 +8,17 @@ var searchData= ['nested_5fexception_5',['nested_exception',['http://en.cppreference.com/w/cpp/error/nested_exception.html',0,'std']]], ['neuralnetwork_6',['NeuralNetwork',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html',1,'machine_learning::neural_network']]], ['new_5fhandler_7',['new_handler',['http://en.cppreference.com/w/cpp/memory/new/new_handler.html',0,'std']]], - ['node_8',['node',['../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html',1,'data_structures::linked_list::Node'],['../d9/d49/structdata__structures_1_1_node.html',1,'data_structures::Node'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html',1,'data_structures::tree_234::Node'],['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html',1,'data_structures::trie_using_hashmap::Trie::Node'],['../d5/da1/structnode.html',1,'node'],['../db/d8b/struct_node.html',1,'Node< ValueType >'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html',1,'operations_on_datastructures::circular_linked_list::Node'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html',1,'operations_on_datastructures::inorder_traversal_of_bst::Node'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html',1,'operations_on_datastructures::reverse_binary_tree::Node'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html',1,'others::iterative_tree_traversals::Node'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html',1,'others::recursive_tree_traversals::Node'],['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html',1,'range_queries::perSegTree::Node'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html',1,'search::sublist_search::Node']]], - ['node_3c_20value_5ftype_20_3e_9',['Node< value_type >',['../db/d8b/struct_node.html',1,'']]], - ['normal_5fdistribution_10',['normal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution.html',0,'std']]], - ['not_5fequal_5fto_11',['not_equal_to',['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std']]], - ['nothrow_5ft_12',['nothrow_t',['http://en.cppreference.com/w/cpp/memory/new/nothrow_t.html',0,'std']]], - ['nullptr_5ft_13',['nullptr_t',['http://en.cppreference.com/w/cpp/types/nullptr_t.html',0,'std']]], - ['num_5fget_14',['num_get',['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std']]], - ['num_5fput_15',['num_put',['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std']]], - ['numeric_5flimits_16',['numeric_limits',['http://en.cppreference.com/w/cpp/types/numeric_limits.html',0,'std']]], - ['numpunct_17',['numpunct',['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std']]], - ['numpunct_5fbyname_18',['numpunct_byname',['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std']]] + ['node_8',['Node',['../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html',1,'data_structures::linked_list::Node'],['../d9/d49/structdata__structures_1_1_node.html',1,'data_structures::Node'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html',1,'data_structures::tree_234::Node'],['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html',1,'data_structures::trie_using_hashmap::Trie::Node']]], + ['node_9',['node',['../d5/da1/structnode.html',1,'']]], + ['node_10',['Node',['../db/d8b/struct_node.html',1,'Node< ValueType >'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html',1,'operations_on_datastructures::circular_linked_list::Node'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html',1,'operations_on_datastructures::inorder_traversal_of_bst::Node'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html',1,'operations_on_datastructures::reverse_binary_tree::Node'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html',1,'others::iterative_tree_traversals::Node'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html',1,'others::recursive_tree_traversals::Node'],['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html',1,'range_queries::perSegTree::Node'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html',1,'search::sublist_search::Node']]], + ['node_3c_20value_5ftype_20_3e_11',['Node< value_type >',['../db/d8b/struct_node.html',1,'']]], + ['normal_5fdistribution_12',['normal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution.html',0,'std']]], + ['not_5fequal_5fto_13',['not_equal_to',['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std']]], + ['nothrow_5ft_14',['nothrow_t',['http://en.cppreference.com/w/cpp/memory/new/nothrow_t.html',0,'std']]], + ['nullptr_5ft_15',['nullptr_t',['http://en.cppreference.com/w/cpp/types/nullptr_t.html',0,'std']]], + ['num_5fget_16',['num_get',['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std']]], + ['num_5fput_17',['num_put',['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std']]], + ['numeric_5flimits_18',['numeric_limits',['http://en.cppreference.com/w/cpp/types/numeric_limits.html',0,'std']]], + ['numpunct_19',['numpunct',['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std']]], + ['numpunct_5fbyname_20',['numpunct_byname',['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std']]] ]; diff --git a/search/classes_f.js b/search/classes_f.js index c0ad84902..05111f3a6 100644 --- a/search/classes_f.js +++ b/search/classes_f.js @@ -12,7 +12,7 @@ var searchData= ['piecewise_5flinear_5fdistribution_9',['piecewise_linear_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution.html',0,'std']]], ['placeholders_10',['placeholders',['http://en.cppreference.com/w/cpp/utility/functional/placeholders.html',0,'std']]], ['plus_11',['plus',['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std']]], - ['point_12',['point',['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html',1,'ciphers::elliptic_curve_key_exchange::Point'],['../d7/d48/structgeometry_1_1grahamscan_1_1_point.html',1,'geometry::grahamscan::Point'],['../d9/d5a/structgeometry_1_1jarvis_1_1_point.html',1,'geometry::jarvis::Point'],['../d8/dc8/struct_point.html',1,'Point']]], + ['point_12',['Point',['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html',1,'ciphers::elliptic_curve_key_exchange::Point'],['../d7/d48/structgeometry_1_1grahamscan_1_1_point.html',1,'geometry::grahamscan::Point'],['../d9/d5a/structgeometry_1_1jarvis_1_1_point.html',1,'geometry::jarvis::Point'],['../d8/dc8/struct_point.html',1,'Point']]], ['pointer_5fsafety_13',['pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/pointer_safety.html',0,'std']]], ['pointer_5ftraits_14',['pointer_traits',['http://en.cppreference.com/w/cpp/memory/pointer_traits.html',0,'std']]], ['poisson_5fdistribution_15',['poisson_distribution',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution.html',0,'std']]], diff --git a/search/defines_0.js b/search/defines_0.js index 4a41e1e3e..dcee04fce 100644 --- a/search/defines_0.js +++ b/search/defines_0.js @@ -1,5 +1,5 @@ var searchData= [ ['_5ftarget_0',['_target',['../dc/dfe/ternary__search_8cpp.html#a23ad617bfce1e7cf4591059c85c1a027',1,'ternary_search.cpp']]], - ['_5fuse_5fmath_5fdefines_1',['_use_math_defines',['../da/d77/spirograph_8cpp.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES: spirograph.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES: brent_method_extrema.cpp']]] + ['_5fuse_5fmath_5fdefines_1',['_USE_MATH_DEFINES',['../da/d77/spirograph_8cpp.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES: spirograph.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES: brent_method_extrema.cpp']]] ]; diff --git a/search/defines_3.js b/search/defines_3.js index 7b634e6ee..f77e4fa09 100644 --- a/search/defines_3.js +++ b/search/defines_3.js @@ -1,5 +1,5 @@ var searchData= [ ['endl_0',['endl',['../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258',1,'matrix_exponentiation.cpp']]], - ['epsilon_1',['epsilon',['../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON: brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON: golden_search_extrema.cpp']]] + ['epsilon_1',['EPSILON',['../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON: brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON: golden_search_extrema.cpp']]] ]; diff --git a/search/defines_6.js b/search/defines_6.js index 618771ad8..7426553f8 100644 --- a/search/defines_6.js +++ b/search/defines_6.js @@ -1,5 +1,5 @@ var searchData= [ - ['max_0',['max',['../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: fibonacci_fast.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: power_for_huge_numbers.cpp'],['../dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: paranthesis_matching.cpp'],['../d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: hash_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: ternary_search.cpp']]], + ['max_0',['MAX',['../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: fibonacci_fast.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: power_for_huge_numbers.cpp'],['../dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: paranthesis_matching.cpp'],['../d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: hash_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX: ternary_search.cpp']]], ['max_5fiterations_1',['MAX_ITERATIONS',['../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'bisection_method.cpp']]] ]; diff --git a/search/files_13.js b/search/files_13.js index a53a05c1a..d693b3a33 100644 --- a/search/files_13.js +++ b/search/files_13.js @@ -13,7 +13,7 @@ var searchData= ['skip_5flist_2ecpp_10',['skip_list.cpp',['../d0/d5a/skip__list_8cpp.html',1,'']]], ['smallest_5fcircle_2ecpp_11',['smallest_circle.cpp',['../d0/d01/smallest__circle_8cpp.html',1,'']]], ['sparse_5fmatrix_2ecpp_12',['sparse_matrix.cpp',['../d3/d19/sparse__matrix_8cpp.html',1,'']]], - ['sparse_5ftable_2ecpp_13',['sparse_table.cpp',['../d4/d96/range__queries_2sparse__table_8cpp.html',1,'(Global Namespace)'],['../d6/d42/data__structures_2sparse__table_8cpp.html',1,'(Global Namespace)']]], + ['sparse_5ftable_2ecpp_13',['sparse_table.cpp',['../d6/d42/data__structures_2sparse__table_8cpp.html',1,'(Global Namespace)'],['../d4/d96/range__queries_2sparse__table_8cpp.html',1,'(Global Namespace)']]], ['spiral_5fprint_2ecpp_14',['spiral_print.cpp',['../db/d07/spiral__print_8cpp.html',1,'']]], ['spirograph_2ecpp_15',['spirograph.cpp',['../da/d77/spirograph_8cpp.html',1,'']]], ['sqrt_5fdouble_2ecpp_16',['sqrt_double.cpp',['../da/d24/sqrt__double_8cpp.html',1,'']]], @@ -24,7 +24,7 @@ var searchData= ['string_5ffibonacci_2ecpp_21',['string_fibonacci.cpp',['../de/d47/string__fibonacci_8cpp.html',1,'']]], ['subarray_5fsum_2ecpp_22',['subarray_sum.cpp',['../df/d94/subarray__sum_8cpp.html',1,'']]], ['sublist_5fsearch_2ecpp_23',['sublist_search.cpp',['../d5/d45/sublist__search_8cpp.html',1,'']]], - ['subset_5fsum_2ecpp_24',['subset_sum.cpp',['../d6/d80/dynamic__programming_2subset__sum_8cpp.html',1,'(Global Namespace)'],['../d0/dfe/backtracking_2subset__sum_8cpp.html',1,'(Global Namespace)']]], + ['subset_5fsum_2ecpp_24',['subset_sum.cpp',['../d0/dfe/backtracking_2subset__sum_8cpp.html',1,'(Global Namespace)'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html',1,'(Global Namespace)']]], ['successive_5fapproximation_2ecpp_25',['successive_approximation.cpp',['../df/dc8/successive__approximation_8cpp.html',1,'']]], ['sudoku_5fsolver_2ecpp_26',['sudoku_solver.cpp',['../d3/d05/sudoku__solver_8cpp.html',1,'']]], ['sum_5fof_5fbinomial_5fcoefficient_2ecpp_27',['sum_of_binomial_coefficient.cpp',['../d4/d9d/sum__of__binomial__coefficient_8cpp.html',1,'']]], diff --git a/search/functions_0.js b/search/functions_0.js index 6cf049633..9651c7188 100644 --- a/search/functions_0.js +++ b/search/functions_0.js @@ -7,7 +7,7 @@ var searchData= ['_5fget_5fk_5fth_4',['_get_k_th',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2',1,'data_structures::treap::Treap']]], ['_5fget_5frank_5',['_get_rank',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec',1,'data_structures::treap::Treap']]], ['_5finsert_6',['_insert',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c',1,'data_structures::treap::Treap']]], - ['_5flez_7',['_lez',['../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163',1,'uint256_t::_lez()'],['../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2',1,'uint128_t::_lez()']]], + ['_5flez_7',['_lez',['../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2',1,'uint128_t::_lez()'],['../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163',1,'uint256_t::_lez()']]], ['_5frandom_8',['_random',['../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485',1,'kohonen_som_topology.cpp']]], ['_5ftrz_9',['_trz',['../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e',1,'uint128_t::_trz()'],['../d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250',1,'uint256_t::_trz()']]] ]; diff --git a/search/functions_1.js b/search/functions_1.js index 4370c2f72..0cd32f427 100644 --- a/search/functions_1.js +++ b/search/functions_1.js @@ -13,12 +13,12 @@ var searchData= ['acosh_10',['acosh',['http://en.cppreference.com/w/cpp/numeric/math/acosh.html',0,'std']]], ['activation_11',['activation',['../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325',1,'machine_learning::adaline']]], ['adaline_12',['adaline',['../d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c',1,'machine_learning::adaline']]], - ['add_13',['add',['../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1',1,'linear_probing::add()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840',1,'data_structures::BloomFilter::add()'],['../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35',1,'add(): string_fibonacci.cpp'],['../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9',1,'quadratic_probing::add()'],['../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a',1,'double_hashing::add()'],['../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3',1,'add(): uint128_t.hpp'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::add()'],['../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c',1,'data_structures::Bitset::add()'],['../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff',1,'hash_chain::add()']]], + ['add_13',['add',['../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c',1,'data_structures::Bitset::add()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840',1,'data_structures::BloomFilter::add()'],['../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff',1,'hash_chain::add()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::add()'],['../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3',1,'add(): uint128_t.hpp'],['../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a',1,'double_hashing::add()'],['../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1',1,'linear_probing::add()'],['../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9',1,'quadratic_probing::add()'],['../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35',1,'add(): string_fibonacci.cpp']]], ['add_5fdigit_14',['add_digit',['../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615',1,'large_number']]], - ['add_5fedge_15',['add_edge',['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79',1,'greedy_algorithms::dijkstra::Graph::add_edge()'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d',1,'range_queries::heavy_light_decomposition::Tree::add_edge()'],['../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19',1,'graph::Graph::add_edge()']]], + ['add_5fedge_15',['add_edge',['../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19',1,'graph::Graph::add_edge()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79',1,'greedy_algorithms::dijkstra::Graph::add_edge()'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d',1,'range_queries::heavy_light_decomposition::Tree::add_edge()']]], ['add_5fstrings_16',['add_strings',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20',1,'divide_and_conquer::karatsuba_algorithm']]], - ['addedge_17',['addedge',['../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910',1,'Graph::addEdge()'],['../da/d4b/depth__first__search__with__stack_8cpp.html#aadebe9c855821d6515ca5b171222ef7b',1,'graph::depth_first_search::addEdge()'],['../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5',1,'Graph::addEdge()'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad8c10df34357b2cd865c81e0c4f0bd8c',1,'graph::is_graph_bipartite::Graph::addEdge()'],['../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a',1,'graph::HKGraph::addEdge()'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf',1,'graph::bidirectional_dijkstra::addEdge()'],['../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2',1,'graph::addEdge(std::vector< std::vector< int > > *adj, int u, int v)'],['../df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08',1,'graph::addEdge(std::vector< std::vector< size_t > > *adj, size_t u, size_t v)'],['../df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a',1,'graph::addEdge(std::vector< std::vector< std::pair< int, int > > > *adj, int u, int v, int w)']]], - ['addinfo_18',['addinfo',['../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908',1,'linear_probing::addInfo()'],['../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768',1,'quadratic_probing::addInfo()'],['../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560',1,'double_hashing::addInfo()']]], + ['addedge_17',['addEdge',['../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5',1,'Graph::addEdge(Edge const &edge)'],['../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910',1,'Graph::addEdge(unsigned int source, unsigned int destination)'],['../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a',1,'graph::HKGraph::addEdge()'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad8c10df34357b2cd865c81e0c4f0bd8c',1,'graph::is_graph_bipartite::Graph::addEdge()'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf',1,'graph::bidirectional_dijkstra::addEdge()'],['../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2',1,'graph::addEdge(std::vector< std::vector< int > > *adj, int u, int v)'],['../df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08',1,'graph::addEdge(std::vector< std::vector< size_t > > *adj, size_t u, size_t v)'],['../da/d4b/depth__first__search__with__stack_8cpp.html#aadebe9c855821d6515ca5b171222ef7b',1,'graph::depth_first_search::addEdge()'],['../df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a',1,'graph::addEdge()']]], + ['addinfo_18',['addInfo',['../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560',1,'double_hashing::addInfo()'],['../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908',1,'linear_probing::addInfo()'],['../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768',1,'quadratic_probing::addInfo()']]], ['addition_19',['addition',['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf',1,'ciphers::elliptic_curve_key_exchange']]], ['addition_5frule_5fdependent_20',['addition_rule_dependent',['../d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0',1,'addition_rule.cpp']]], ['addition_5frule_5findependent_21',['addition_rule_independent',['../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d',1,'addition_rule.cpp']]], @@ -37,12 +37,12 @@ var searchData= ['allocate_5fshared_34',['allocate_shared',['http://en.cppreference.com/w/cpp/memory/shared_ptr/allocate_shared.html',0,'std']]], ['allocator_35',['allocator',['http://en.cppreference.com/w/cpp/memory/allocator/allocator.html',0,'std::allocator']]], ['alpha_36',['alpha',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]], - ['always_5fnoconv_37',['always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::always_noconv()']]], + ['always_5fnoconv_37',['always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::always_noconv()']]], ['and_5ftest_38',['and_test',['../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9',1,'boyer_moore.cpp']]], ['ans_39',['ans',['../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa',1,'matrix_exponentiation.cpp']]], ['any_40',['any',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], ['any_5fof_41',['any_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], - ['append_42',['append',['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u32string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::wstring::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::basic_string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u16string::append()']]], + ['append_42',['append',['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::basic_string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::wstring::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u16string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u32string::append()']]], ['apply_5ffunction_43',['apply_function',['../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb',1,'machine_learning']]], ['approximate_5fpi_44',['approximate_pi',['../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188',1,'math']]], ['are_5falmost_5fequal_45',['are_almost_equal',['../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703',1,'others']]], @@ -54,10 +54,10 @@ var searchData= ['asinh_51',['asinh',['http://en.cppreference.com/w/cpp/numeric/math/asinh.html',0,'std']]], ['ask_5fdata_52',['ask_data',['../dd/d92/memory__game_8cpp.html#a5714d97649c0edd57b4fb449799676a3',1,'games::memory_game']]], ['assertarray_53',['assertArray',['../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a',1,'quadratic_equations_complex_numbers.cpp']]], - ['assign_54',['assign',['http://en.cppreference.com/w/cpp/error/error_code/assign.html',0,'std::error_code::assign()'],['http://en.cppreference.com/w/cpp/container/forward_list/assign.html',0,'std::forward_list::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::wregex::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::basic_regex::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::regex::assign()'],['http://en.cppreference.com/w/cpp/container/deque/assign.html',0,'std::deque::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::string::assign()'],['http://en.cppreference.com/w/cpp/string/char_traits/assign.html',0,'std::char_traits::assign()'],['http://en.cppreference.com/w/cpp/container/vector/assign.html',0,'std::vector::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::wstring::assign()'],['http://en.cppreference.com/w/cpp/utility/functional/function/assign.html',0,'std::function::assign()'],['http://en.cppreference.com/w/cpp/error/error_condition/assign.html',0,'std::error_condition::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u16string::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u32string::assign()'],['http://en.cppreference.com/w/cpp/container/list/assign.html',0,'std::list::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::basic_string::assign()']]], + ['assign_54',['assign',['http://en.cppreference.com/w/cpp/container/vector/assign.html',0,'std::vector::assign()'],['http://en.cppreference.com/w/cpp/string/char_traits/assign.html',0,'std::char_traits::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::string::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::regex::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::basic_regex::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::wregex::assign()'],['http://en.cppreference.com/w/cpp/container/forward_list/assign.html',0,'std::forward_list::assign()'],['http://en.cppreference.com/w/cpp/error/error_code/assign.html',0,'std::error_code::assign()'],['http://en.cppreference.com/w/cpp/container/deque/assign.html',0,'std::deque::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::basic_string::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::wstring::assign()'],['http://en.cppreference.com/w/cpp/utility/functional/function/assign.html',0,'std::function::assign()'],['http://en.cppreference.com/w/cpp/error/error_condition/assign.html',0,'std::error_condition::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u16string::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u32string::assign()'],['http://en.cppreference.com/w/cpp/container/list/assign.html',0,'std::list::assign()']]], ['assign_5fresults_55',['assign_results',['../dd/d92/memory__game_8cpp.html#a3ceeea62d8fa6c563e2c66359fd73413',1,'games::memory_game']]], ['async_56',['async',['http://en.cppreference.com/w/cpp/thread/async.html',0,'std']]], - ['at_57',['at',['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::basic_string::at()'],['http://en.cppreference.com/w/cpp/container/dynarray/at.html',0,'std::dynarray::at()'],['http://en.cppreference.com/w/cpp/container/vector/at.html',0,'std::vector::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::wstring::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::string::at()'],['http://en.cppreference.com/w/cpp/container/unordered_map/at.html',0,'std::unordered_map::at()'],['http://en.cppreference.com/w/cpp/container/deque/at.html',0,'std::deque::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u16string::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u32string::at()'],['http://en.cppreference.com/w/cpp/container/map/at.html',0,'std::map::at()'],['http://en.cppreference.com/w/cpp/container/array/at.html',0,'std::array::at()']]], + ['at_57',['at',['http://en.cppreference.com/w/cpp/container/dynarray/at.html',0,'std::dynarray::at()'],['http://en.cppreference.com/w/cpp/container/vector/at.html',0,'std::vector::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::string::at()'],['http://en.cppreference.com/w/cpp/container/unordered_map/at.html',0,'std::unordered_map::at()'],['http://en.cppreference.com/w/cpp/container/deque/at.html',0,'std::deque::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::basic_string::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::wstring::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u16string::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u32string::at()'],['http://en.cppreference.com/w/cpp/container/map/at.html',0,'std::map::at()'],['http://en.cppreference.com/w/cpp/container/array/at.html',0,'std::array::at()']]], ['at_5fquick_5fexit_58',['at_quick_exit',['http://en.cppreference.com/w/cpp/utility/program/at_quick_exit.html',0,'std']]], ['atan_59',['atan',['http://en.cppreference.com/w/cpp/numeric/math/atan.html',0,'std']]], ['atan2_60',['atan2',['http://en.cppreference.com/w/cpp/numeric/math/atan2.html',0,'std']]], diff --git a/search/functions_10.js b/search/functions_10.js index e63b31bc0..16b66c82d 100644 --- a/search/functions_10.js +++ b/search/functions_10.js @@ -7,20 +7,20 @@ var searchData= ['pancakesort_4',['pancakeSort',['../d3/d92/pancake__sort_8cpp.html#abff90bc0f54e4f8ea5f0330471781bd5',1,'sorting::pancake_sort']]], ['parallelogram_5farea_5',['parallelogram_area',['../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f',1,'math']]], ['parallelogram_5fperimeter_6',['parallelogram_perimeter',['../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3',1,'math']]], - ['param_7',['param',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/param.html',0,'std::piecewise_constant_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/param.html',0,'std::poisson_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/param.html',0,'std::bernoulli_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/param.html',0,'std::exponential_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/param.html',0,'std::uniform_real_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/param.html',0,'std::geometric_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/param.html',0,'std::normal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/param.html',0,'std::weibull_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/param.html',0,'std::negative_binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/param.html',0,'std::chi_squared_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/param.html',0,'std::piecewise_linear_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/param.html',0,'std::uniform_int_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/param.html',0,'std::fisher_f_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/param.html',0,'std::seed_seq::param()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/param.html',0,'std::gamma_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/param.html',0,'std::binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/param.html',0,'std::cauchy_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/param.html',0,'std::lognormal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/param.html',0,'std::discrete_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/param.html',0,'std::student_t_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/param.html',0,'std::extreme_value_distribution::param()']]], + ['param_7',['param',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/param.html',0,'std::student_t_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/param.html',0,'std::extreme_value_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/param.html',0,'std::lognormal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/param.html',0,'std::discrete_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/param.html',0,'std::piecewise_constant_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/param.html',0,'std::poisson_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/param.html',0,'std::bernoulli_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/param.html',0,'std::exponential_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/param.html',0,'std::uniform_real_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/param.html',0,'std::geometric_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/param.html',0,'std::normal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/param.html',0,'std::weibull_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/param.html',0,'std::negative_binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/param.html',0,'std::chi_squared_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/param.html',0,'std::piecewise_linear_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/param.html',0,'std::uniform_int_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/param.html',0,'std::fisher_f_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/param.html',0,'std::seed_seq::param()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/param.html',0,'std::gamma_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/param.html',0,'std::binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/param.html',0,'std::cauchy_distribution::param()']]], ['partial_5fsort_8',['partial_sort',['http://en.cppreference.com/w/cpp/algorithm/partial_sort.html',0,'std']]], ['partial_5fsort_5fcopy_9',['partial_sort_copy',['http://en.cppreference.com/w/cpp/algorithm/partial_sort_copy.html',0,'std']]], ['partial_5fsum_10',['partial_sum',['http://en.cppreference.com/w/cpp/algorithm/partial_sum.html',0,'std']]], - ['partition_11',['partition',['../d1/daa/random__pivot__quick__sort_8cpp.html#a3d1c39e1ff42c04fb8ec0c0b9411cd3e',1,'sorting::random_pivot_quick_sort::partition()'],['../d1/d21/quick__sort_8cpp.html#a1b2a2cc2d319240f3b65c5b2f479ed82',1,'sorting::quick_sort::partition()'],['http://en.cppreference.com/w/cpp/algorithm/partition.html',0,'std::partition(T... args)']]], + ['partition_11',['partition',['http://en.cppreference.com/w/cpp/algorithm/partition.html',0,'std::partition()'],['../d1/d21/quick__sort_8cpp.html#a1b2a2cc2d319240f3b65c5b2f479ed82',1,'sorting::quick_sort::partition()'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a3d1c39e1ff42c04fb8ec0c0b9411cd3e',1,'sorting::random_pivot_quick_sort::partition()']]], ['partition_5fcopy_12',['partition_copy',['http://en.cppreference.com/w/cpp/algorithm/partition_copy.html',0,'std']]], ['partition_5fpoint_13',['partition_point',['http://en.cppreference.com/w/cpp/algorithm/partition_point.html',0,'std']]], ['pascal_5ftriangle_14',['pascal_triangle',['../dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd',1,'pascal_triangle.cpp']]], ['pat_5ftest_15',['pat_test',['../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2',1,'boyer_moore.cpp']]], - ['pbackfail_16',['pbackfail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wfilebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::strstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_streambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::streambuf::pbackfail()']]], - ['pbase_17',['pbase',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::pbase()']]], - ['pbump_18',['pbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wfilebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::strstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_streambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::streambuf::pbump()']]], + ['pbackfail_16',['pbackfail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wfilebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::strstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_streambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::streambuf::pbackfail()']]], + ['pbase_17',['pbase',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::pbase()']]], + ['pbump_18',['pbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wfilebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::strstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_streambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::streambuf::pbump()']]], ['pcount_19',['pcount',['http://en.cppreference.com/w/cpp/io/strstreambuf/pcount.html',0,'std::strstreambuf::pcount()'],['http://en.cppreference.com/w/cpp/io/strstream/pcount.html',0,'std::strstream::pcount()'],['http://en.cppreference.com/w/cpp/io/ostrstream/pcount.html',0,'std::ostrstream::pcount()']]], - ['peek_20',['peek',['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wfstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wstringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::ifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::stringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::strstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::fstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_ifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wiostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_fstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istrstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_stringstream::peek()']]], + ['peek_20',['peek',['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::fstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_fstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::stringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::strstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_stringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istrstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wiostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_ifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wfstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wstringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::ifstream::peek()']]], ['perror_21',['perror',['http://en.cppreference.com/w/cpp/io/c/perror.html',0,'std']]], ['phifunction_22',['phiFunction',['../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5',1,'math']]], ['piecewise_5fconstant_5fdistribution_23',['piecewise_constant_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/piecewise_constant_distribution.html',0,'std::piecewise_constant_distribution']]], @@ -35,70 +35,71 @@ var searchData= ['poisson_5frate_32',['poisson_rate',['../d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8',1,'poisson_dist.cpp']]], ['poisson_5fx_5fsuccesses_33',['poisson_x_successes',['../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1',1,'poisson_dist.cpp']]], ['poly_5ffunction_34',['poly_function',['../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569',1,'durand_kerner_roots.cpp']]], - ['pop_35',['pop',['../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664',1,'pop(): paranthesis_matching.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#a421baa2002a64bc0bfc3e1b64800d734',1,'others::postfix_expression::pop()'],['http://en.cppreference.com/w/cpp/container/priority_queue/pop.html',0,'std::priority_queue::pop()'],['../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0',1,'stack::pop()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb',1,'data_structures::stack_using_queue::Stack::pop()'],['http://en.cppreference.com/w/cpp/container/queue/pop.html',0,'std::queue::pop()'],['http://en.cppreference.com/w/cpp/container/stack/pop.html',0,'std::stack::pop()']]], - ['pop_5fback_36',['pop_back',['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::basic_string::pop_back()'],['http://en.cppreference.com/w/cpp/container/deque/pop_back.html',0,'std::deque::pop_back()'],['../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d',1,'machine_learning::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u32string::pop_back()'],['http://en.cppreference.com/w/cpp/container/list/pop_back.html',0,'std::list::pop_back()'],['http://en.cppreference.com/w/cpp/container/vector/pop_back.html',0,'std::vector::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::string::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u16string::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::wstring::pop_back()']]], - ['pop_5ffront_37',['pop_front',['http://en.cppreference.com/w/cpp/container/deque/pop_front.html',0,'std::deque::pop_front()'],['http://en.cppreference.com/w/cpp/container/forward_list/pop_front.html',0,'std::forward_list::pop_front()'],['../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093',1,'machine_learning::pop_front()'],['http://en.cppreference.com/w/cpp/container/list/pop_front.html',0,'std::list::pop_front()']]], + ['pop_35',['pop',['http://en.cppreference.com/w/cpp/container/stack/pop.html',0,'std::stack::pop()'],['http://en.cppreference.com/w/cpp/container/queue/pop.html',0,'std::queue::pop()'],['http://en.cppreference.com/w/cpp/container/priority_queue/pop.html',0,'std::priority_queue::pop()'],['../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0',1,'stack::pop()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb',1,'data_structures::stack_using_queue::Stack::pop()'],['../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664',1,'pop(): paranthesis_matching.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#a421baa2002a64bc0bfc3e1b64800d734',1,'others::postfix_expression::pop()']]], + ['pop_5fback_36',['pop_back',['http://en.cppreference.com/w/cpp/container/vector/pop_back.html',0,'std::vector::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::string::pop_back()'],['http://en.cppreference.com/w/cpp/container/deque/pop_back.html',0,'std::deque::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::basic_string::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::wstring::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u16string::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u32string::pop_back()'],['http://en.cppreference.com/w/cpp/container/list/pop_back.html',0,'std::list::pop_back()'],['../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d',1,'machine_learning::pop_back()']]], + ['pop_5ffront_37',['pop_front',['http://en.cppreference.com/w/cpp/container/forward_list/pop_front.html',0,'std::forward_list::pop_front()'],['http://en.cppreference.com/w/cpp/container/deque/pop_front.html',0,'std::deque::pop_front()'],['http://en.cppreference.com/w/cpp/container/list/pop_front.html',0,'std::list::pop_front()'],['../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093',1,'machine_learning::pop_front()']]], ['pop_5fheap_38',['pop_heap',['http://en.cppreference.com/w/cpp/algorithm/pop_heap.html',0,'std']]], ['populate_5fparents_39',['populate_parents',['../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e',1,'graph::RootedTree']]], ['populate_5fup_40',['populate_up',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356',1,'graph::LowestCommonAncestor']]], ['pos_5fformat_41',['pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::pos_format()']]], - ['position_42',['position',['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wcmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::match_results::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wsmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::smatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::cmatch::position()']]], - ['positive_5fsign_43',['positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::positive_sign()']]], + ['position_42',['position',['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::match_results::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wsmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::smatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wcmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::cmatch::position()']]], + ['positive_5fsign_43',['positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::positive_sign()']]], ['postfix_5fevaluation_44',['postfix_evaluation',['../d7/d75/postfix__evaluation_8cpp.html#ae38bd3a177a6d61da3859a281233bbe1',1,'others::postfix_expression']]], ['postorder_45',['postorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5',1,'others::recursive_tree_traversals::BT']]], ['postorderiterative_46',['postOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25',1,'others::iterative_tree_traversals::BinaryTree']]], ['pow_47',['pow',['http://en.cppreference.com/w/cpp/numeric/math/pow.html',0,'std']]], - ['power_48',['power',['../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f',1,'power(int x, int n): power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec',1,'power(const vector< vector< ll > > &A, ll p): matrix_exponentiation.cpp'],['../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d',1,'math::power()'],['../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311',1,'math::fibonacci_sum::power()'],['../df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179',1,'math::modular_division::power()']]], + ['power_48',['power',['../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311',1,'math::fibonacci_sum::power()'],['../df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179',1,'math::modular_division::power()'],['../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d',1,'math::power()'],['../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f',1,'power(int x, int n): power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec',1,'power(const vector< vector< ll > > &A, ll p): matrix_exponentiation.cpp']]], ['power_5fof_5ftwo_49',['power_of_two',['../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb',1,'math']]], ['pptr_50',['pptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::pptr()']]], - ['precision_51',['precision',['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::iostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ios::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ios_base::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::strstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wiostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wfstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_iostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wstringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ifstream::precision()']]], + ['precision_51',['precision',['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ios::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::iostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ios_base::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::strstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wiostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wfstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_iostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wstringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ifstream::precision()']]], ['predict_52',['predict',['../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3',1,'machine_learning::adaline::predict()'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a62e152db014cd4de675fa906e5ef2861',1,'machine_learning::k_nearest_neighbors::Knn::predict()']]], ['predict_5fols_5fregressor_53',['predict_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493',1,'ordinary_least_squares_regressor.cpp']]], ['predict_5fwords_54',['predict_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4',1,'data_structures::trie_using_hashmap::Trie']]], - ['prefix_55',['prefix',['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::smatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::match_results::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wcmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::cmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wsmatch::prefix()']]], + ['prefix_55',['prefix',['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::match_results::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wsmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::smatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wcmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::cmatch::prefix()']]], ['preorder_56',['preorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb',1,'others::recursive_tree_traversals::BT']]], ['preorderiterative_57',['preOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae',1,'others::iterative_tree_traversals::BinaryTree']]], ['prev_58',['prev',['http://en.cppreference.com/w/cpp/iterator/prev.html',0,'std']]], ['prev_5fpermutation_59',['prev_permutation',['http://en.cppreference.com/w/cpp/algorithm/prev_permutation.html',0,'std']]], ['prime_5ffactorization_60',['prime_factorization',['../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46',1,'prime_factorization.cpp']]], ['primes_61',['primes',['../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a',1,'prime_numbers.cpp']]], - ['print_62',['print',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165',1,'data_structures::tree_234::Tree234::Print()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print(Node *root)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::print()'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a7341d7c76a6145e991cdd231f689fca8',1,'greedy_algorithms::dijkstra::print()'],['../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20',1,'operations_on_datastructures::print()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9',1,'print(): sieve_of_eratosthenes.cpp']]], - ['print_5fprimes_63',['print_primes',['../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4',1,'math']]], - ['print_5ftable_64',['print_table',['../dd/d92/memory__game_8cpp.html#ac589ef65abb0a6b9a7116ee0f9fd5280',1,'games::memory_game']]], - ['printarray_65',['printArray',['../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767',1,'heap_sort.cpp']]], - ['printf_66',['printf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], - ['printinorder_67',['printInorder',['../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4',1,'operations_on_datastructures::inorder_traversal_of_bst']]], - ['printlinkedlist_68',['printLinkedList',['../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2',1,'search::sublist_search']]], - ['printmat_69',['printMat',['../d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac',1,'backtracking::sudoku_solver']]], - ['printnode_70',['PrintNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be',1,'data_structures::tree_234::Tree234']]], - ['printresult_71',['printResult',['../dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793',1,'FCFS']]], - ['printroot_72',['printRoot',['../dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345',1,'numerical_methods::false_position']]], - ['printsol_73',['printsol',['../d7/d24/nqueen__print__all__solutions_8cpp.html#aebd5e11fab6dab282efccfb61beb0bd9',1,'backtracking::n_queens_all_solutions::PrintSol()'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905',1,'backtracking::n_queens_optimized::PrintSol()']]], - ['printsolution_74',['printsolution',['../d4/d3e/n__queens_8cpp.html#a40ae0c7fd04eb20e7f3bff13fc6a5808',1,'backtracking::n_queens::printSolution()'],['../d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07',1,'backtracking::graph_coloring::printSolution()']]], - ['priority_5fqueue_75',['priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue/priority_queue.html',0,'std::priority_queue']]], - ['probabilities_76',['probabilities',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/probabilities.html',0,'std::discrete_distribution']]], - ['probability_5fdensity_77',['probability_density',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1',1,'probability::geometric_dist::geometric_distribution']]], - ['problem_78',['problem',['../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_semi_implicit_euler.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_midpoint_euler.cpp']]], - ['projection_79',['projection',['../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc',1,'numerical_methods::gram_schmidt']]], - ['promise_80',['promise',['http://en.cppreference.com/w/cpp/thread/promise/promise.html',0,'std::promise']]], - ['pubimbue_81',['pubimbue',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::pubimbue()']]], - ['pubseekoff_82',['pubseekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::pubseekoff()']]], - ['pubseekpos_83',['pubseekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::pubseekpos()']]], - ['pubsetbuf_84',['pubsetbuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::pubsetbuf()']]], - ['pubsync_85',['pubsync',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::pubsync()']]], - ['push_86',['push',['http://en.cppreference.com/w/cpp/container/stack/push.html',0,'std::stack::push()'],['../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095',1,'push(): paranthesis_matching.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea',1,'others::postfix_expression::push()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2',1,'data_structures::stack_using_queue::Stack::push()'],['http://en.cppreference.com/w/cpp/container/queue/push.html',0,'std::queue::push()'],['http://en.cppreference.com/w/cpp/container/priority_queue/push.html',0,'std::priority_queue::push()'],['../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d',1,'stack::push()']]], - ['push_5fback_87',['push_back',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ad585670a392c7e842c992d088093dff5',1,'data_structures::linked_list::list::push_back()'],['http://en.cppreference.com/w/cpp/container/vector/push_back.html',0,'std::vector::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::string::push_back()'],['http://en.cppreference.com/w/cpp/container/deque/push_back.html',0,'std::deque::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::basic_string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::wstring::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u16string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u32string::push_back()'],['http://en.cppreference.com/w/cpp/container/list/push_back.html',0,'std::list::push_back()']]], - ['push_5ffront_88',['push_front',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9c73f393e984f93f33852334d1a04be0',1,'data_structures::linked_list::list::push_front()'],['http://en.cppreference.com/w/cpp/container/forward_list/push_front.html',0,'std::forward_list::push_front()'],['http://en.cppreference.com/w/cpp/container/deque/push_front.html',0,'std::deque::push_front()'],['http://en.cppreference.com/w/cpp/container/list/push_front.html',0,'std::list::push_front()']]], - ['push_5fheap_89',['push_heap',['http://en.cppreference.com/w/cpp/algorithm/push_heap.html',0,'std']]], - ['put_90',['put',['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_fstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostrstream::put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wstringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_iostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wfstream::put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wiostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_stringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::strstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::stringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::iostream::put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostringstream::put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::fstream::put()']]], - ['put_5fmoney_91',['put_money',['http://en.cppreference.com/w/cpp/io/manip/put_money.html',0,'std']]], - ['put_5ftime_92',['put_time',['http://en.cppreference.com/w/cpp/io/manip/put_time.html',0,'std']]], - ['putback_93',['putback',['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::strstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_ifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wfstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wstringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istrstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wiostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::ifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistringstream::putback()']]], - ['putc_94',['putc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]], - ['putchar_95',['putchar',['http://en.cppreference.com/w/cpp/io/c/putchar.html',0,'std']]], - ['putprober_96',['putprober',['../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b',1,'quadratic_probing::putProber()'],['../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541',1,'linear_probing::putProber()'],['../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b',1,'double_hashing::putProber()']]], - ['puts_97',['puts',['http://en.cppreference.com/w/cpp/io/c/puts.html',0,'std']]], - ['putwchar_98',['putwchar',['http://en.cppreference.com/w/cpp/io/c/putwchar.html',0,'std']]], - ['pword_99',['pword',['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ios::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ios_base::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::strstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wiostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wstringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wfstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ofstream::pword()']]], - ['pyramid_5fvolume_100',['pyramid_volume',['../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c',1,'math']]] + ['print_62',['Print',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165',1,'data_structures::tree_234::Tree234']]], + ['print_63',['print',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print(Node *root)'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::print()'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a7341d7c76a6145e991cdd231f689fca8',1,'greedy_algorithms::dijkstra::print()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9',1,'print(): sieve_of_eratosthenes.cpp'],['../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20',1,'operations_on_datastructures::print()']]], + ['print_5fprimes_64',['print_primes',['../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4',1,'math']]], + ['print_5ftable_65',['print_table',['../dd/d92/memory__game_8cpp.html#ac589ef65abb0a6b9a7116ee0f9fd5280',1,'games::memory_game']]], + ['printarray_66',['printArray',['../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767',1,'heap_sort.cpp']]], + ['printf_67',['printf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['printinorder_68',['printInorder',['../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4',1,'operations_on_datastructures::inorder_traversal_of_bst']]], + ['printlinkedlist_69',['printLinkedList',['../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2',1,'search::sublist_search']]], + ['printmat_70',['printMat',['../d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac',1,'backtracking::sudoku_solver']]], + ['printnode_71',['PrintNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be',1,'data_structures::tree_234::Tree234']]], + ['printresult_72',['printResult',['../dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793',1,'FCFS']]], + ['printroot_73',['printRoot',['../dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345',1,'numerical_methods::false_position']]], + ['printsol_74',['PrintSol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905',1,'backtracking::n_queens_optimized::PrintSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aebd5e11fab6dab282efccfb61beb0bd9',1,'backtracking::n_queens_all_solutions::PrintSol()']]], + ['printsolution_75',['printSolution',['../d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07',1,'backtracking::graph_coloring::printSolution()'],['../d4/d3e/n__queens_8cpp.html#a40ae0c7fd04eb20e7f3bff13fc6a5808',1,'backtracking::n_queens::printSolution()']]], + ['priority_5fqueue_76',['priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue/priority_queue.html',0,'std::priority_queue']]], + ['probabilities_77',['probabilities',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/probabilities.html',0,'std::discrete_distribution']]], + ['probability_5fdensity_78',['probability_density',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1',1,'probability::geometric_dist::geometric_distribution']]], + ['problem_79',['problem',['../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_semi_implicit_euler.cpp']]], + ['projection_80',['projection',['../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc',1,'numerical_methods::gram_schmidt']]], + ['promise_81',['promise',['http://en.cppreference.com/w/cpp/thread/promise/promise.html',0,'std::promise']]], + ['pubimbue_82',['pubimbue',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::pubimbue()']]], + ['pubseekoff_83',['pubseekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::pubseekoff()']]], + ['pubseekpos_84',['pubseekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::pubseekpos()']]], + ['pubsetbuf_85',['pubsetbuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::pubsetbuf()']]], + ['pubsync_86',['pubsync',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::pubsync()']]], + ['push_87',['push',['http://en.cppreference.com/w/cpp/container/stack/push.html',0,'std::stack::push()'],['http://en.cppreference.com/w/cpp/container/queue/push.html',0,'std::queue::push()'],['http://en.cppreference.com/w/cpp/container/priority_queue/push.html',0,'std::priority_queue::push()'],['../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d',1,'stack::push()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2',1,'data_structures::stack_using_queue::Stack::push()'],['../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095',1,'push(): paranthesis_matching.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea',1,'others::postfix_expression::push()']]], + ['push_5fback_88',['push_back',['http://en.cppreference.com/w/cpp/container/vector/push_back.html',0,'std::vector::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::string::push_back()'],['http://en.cppreference.com/w/cpp/container/deque/push_back.html',0,'std::deque::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::basic_string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::wstring::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u16string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u32string::push_back()'],['http://en.cppreference.com/w/cpp/container/list/push_back.html',0,'std::list::push_back()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ad585670a392c7e842c992d088093dff5',1,'data_structures::linked_list::list::push_back()']]], + ['push_5ffront_89',['push_front',['http://en.cppreference.com/w/cpp/container/forward_list/push_front.html',0,'std::forward_list::push_front()'],['http://en.cppreference.com/w/cpp/container/deque/push_front.html',0,'std::deque::push_front()'],['http://en.cppreference.com/w/cpp/container/list/push_front.html',0,'std::list::push_front()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9c73f393e984f93f33852334d1a04be0',1,'data_structures::linked_list::list::push_front()']]], + ['push_5fheap_90',['push_heap',['http://en.cppreference.com/w/cpp/algorithm/push_heap.html',0,'std']]], + ['put_91',['put',['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::fstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostringstream::put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_fstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::iostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::stringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::strstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_stringstream::put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wiostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ofstream::put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostrstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wfstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_iostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wstringstream::put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::put()']]], + ['put_5fmoney_92',['put_money',['http://en.cppreference.com/w/cpp/io/manip/put_money.html',0,'std']]], + ['put_5ftime_93',['put_time',['http://en.cppreference.com/w/cpp/io/manip/put_time.html',0,'std']]], + ['putback_94',['putback',['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::strstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istrstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wiostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_ifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wfstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wstringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::ifstream::putback()']]], + ['putc_95',['putc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]], + ['putchar_96',['putchar',['http://en.cppreference.com/w/cpp/io/c/putchar.html',0,'std']]], + ['putprober_97',['putProber',['../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b',1,'double_hashing::putProber()'],['../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541',1,'linear_probing::putProber()'],['../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b',1,'quadratic_probing::putProber()']]], + ['puts_98',['puts',['http://en.cppreference.com/w/cpp/io/c/puts.html',0,'std']]], + ['putwchar_99',['putwchar',['http://en.cppreference.com/w/cpp/io/c/putwchar.html',0,'std']]], + ['pword_100',['pword',['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ios::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ios_base::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::strstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wiostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wfstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wstringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ifstream::pword()']]], + ['pyramid_5fvolume_101',['pyramid_volume',['../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c',1,'math']]] ]; diff --git a/search/functions_11.js b/search/functions_11.js index cfa08aed5..3e265c3a5 100644 --- a/search/functions_11.js +++ b/search/functions_11.js @@ -4,12 +4,12 @@ var searchData= ['qsort_1',['qsort',['http://en.cppreference.com/w/cpp/algorithm/qsort.html',0,'std']]], ['quadraticequation_2',['quadraticEquation',['../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb',1,'math']]], ['quadraticprobe_3',['quadraticProbe',['../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf',1,'quadratic_probing']]], - ['query_4',['query',['../d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571',1,'range_queries::perSegTree::query()'],['../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d',1,'query(): segtree.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#a7c8fd967c36dbba5fdf9c71faed604cf',1,'range_queries::prefix_sum_array::query()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4',1,'range_queries::perSegTree::query()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab',1,'range_queries::heavy_light_decomposition::HLD::query()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a1fda852e6e522707fd97f61cdb0a2591',1,'range_queries::heavy_light_decomposition::SG::query()'],['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039',1,'data_structures::sparse_table::Sparse_table::query()']]], + ['query_4',['query',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039',1,'data_structures::sparse_table::Sparse_table::query()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a1fda852e6e522707fd97f61cdb0a2591',1,'range_queries::heavy_light_decomposition::SG::query()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab',1,'range_queries::heavy_light_decomposition::HLD::query()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4',1,'range_queries::perSegTree::query(const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, std::shared_ptr< Node > const &curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571',1,'range_queries::perSegTree::query(const uint32_t &l, const uint32_t &r, const uint32_t &version)'],['../d1/d9e/prefix__sum__array_8cpp.html#a7c8fd967c36dbba5fdf9c71faed604cf',1,'range_queries::prefix_sum_array::query()'],['../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d',1,'query(): segtree.cpp']]], ['queue_5',['queue',['http://en.cppreference.com/w/cpp/container/queue/queue.html',0,'std::queue']]], ['queue_5ftest_6',['queue_test',['../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863',1,'queue_using_two_stacks.cpp']]], ['quick_5fexit_7',['quick_exit',['http://en.cppreference.com/w/cpp/utility/program/quick_exit.html',0,'std']]], - ['quick_5fsort_8',['quick_sort',['../d1/d21/quick__sort_8cpp.html#a53adad7e4d83e1495df25fe8dbb4cc05',1,'sorting::quick_sort::quick_sort(std::vector< T > arr, const int &low, const int &high)'],['../d1/d21/quick__sort_8cpp.html#a5e6213e8008356ac6eda9427f3f4b394',1,'sorting::quick_sort::quick_sort(std::vector< T > *arr, const int &low, const int &high)']]], - ['quicksort_9',['quicksort',['../d5/d91/namespacesorting.html#a6eb67c2f91c98cf4464f75b5882022de',1,'sorting::quicksort(std::vector< T > arr, int32_t low, int32_t high)'],['../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168',1,'sorting::quicksort(std::vector< T > *arr, int32_t low, int32_t high)']]], + ['quick_5fsort_8',['quick_sort',['../d1/d21/quick__sort_8cpp.html#a5e6213e8008356ac6eda9427f3f4b394',1,'sorting::quick_sort::quick_sort(std::vector< T > *arr, const int &low, const int &high)'],['../d1/d21/quick__sort_8cpp.html#a53adad7e4d83e1495df25fe8dbb4cc05',1,'sorting::quick_sort::quick_sort(std::vector< T > arr, const int &low, const int &high)']]], + ['quicksort_9',['quicksort',['../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168',1,'sorting::quicksort(std::vector< T > *arr, int32_t low, int32_t high)'],['../d5/d91/namespacesorting.html#a6eb67c2f91c98cf4464f75b5882022de',1,'sorting::quicksort(std::vector< T > arr, int32_t low, int32_t high)']]], ['quicksortrp_10',['quickSortRP',['../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5',1,'sorting::random_pivot_quick_sort']]], ['quiet_5fnan_11',['quiet_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/quiet_NaN.html',0,'std::numeric_limits']]] ]; diff --git a/search/functions_12.js b/search/functions_12.js index 8e9bb917b..6877c1c4f 100644 --- a/search/functions_12.js +++ b/search/functions_12.js @@ -18,13 +18,13 @@ var searchData= ['ranlux48_15',['ranlux48',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::ranlux48']]], ['ranlux48_5fbase_16',['ranlux48_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::ranlux48_base']]], ['raw_5fstorage_5fiterator_17',['raw_storage_iterator',['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/raw_storage_iterator.html',0,'std::raw_storage_iterator']]], - ['rbegin_18',['rbegin',['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::rbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::rbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::rbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::rbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::rbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::rbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::rbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::rbegin()'],['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::rbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::rbegin()']]], - ['rdbuf_19',['rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::strstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wiostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wfstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_iostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wstringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ios::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostream::rdbuf()'],['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/rdbuf.html',0,'std::wbuffer_convert::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::iostream::rdbuf(T... args)']]], - ['rdstate_20',['rdstate',['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::strstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wiostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wfstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wstringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ios::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istream::rdstate()']]], - ['read_21',['read',['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::strstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istrstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wiostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_ifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wfstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wstringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::ifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::fstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_fstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wifstream::read()']]], - ['readsome_22',['readsome',['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::strstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istrstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wiostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_ifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wfstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wstringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::ifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istream::readsome()']]], - ['ready_23',['ready',['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::match_results::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::cmatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::wsmatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::smatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::wcmatch::ready()']]], - ['real_24',['real',['../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6',1,'Complex::real()'],['http://en.cppreference.com/w/cpp/numeric/complex/real.html',0,'std::complex::real()']]], + ['rbegin_18',['rbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::rbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::rbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::rbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::rbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::rbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::rbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::rbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::rbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::rbegin()']]], + ['rdbuf_19',['rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/rdbuf.html',0,'std::wbuffer_convert::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ios::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::iostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::strstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wiostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wfstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_iostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wstringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ifstream::rdbuf()']]], + ['rdstate_20',['rdstate',['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ios::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::strstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wiostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wfstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wstringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ifstream::rdstate()']]], + ['read_21',['read',['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::fstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_fstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::strstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istrstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wiostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_ifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wfstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wstringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::ifstream::read()']]], + ['readsome_22',['readsome',['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::strstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istrstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wiostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_ifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wfstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wstringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::ifstream::readsome()']]], + ['ready_23',['ready',['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::match_results::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::wsmatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::smatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::wcmatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::cmatch::ready()']]], + ['real_24',['real',['http://en.cppreference.com/w/cpp/numeric/complex/real.html',0,'std::complex::real()'],['../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6',1,'Complex::real()']]], ['realloc_25',['realloc',['http://en.cppreference.com/w/cpp/memory/c/realloc.html',0,'std']]], ['rec_5fternary_5fsearch_26',['rec_ternary_search',['../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead',1,'ternary_search.cpp']]], ['recalculate_5fhash_27',['recalculate_hash',['../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893',1,'string_search']]], @@ -45,56 +45,58 @@ var searchData= ['regex_5fsearch_42',['regex_search',['http://en.cppreference.com/w/cpp/regex/regex_search.html',0,'std']]], ['regex_5ftoken_5fiterator_43',['regex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::regex_token_iterator']]], ['regex_5ftraits_44',['regex_traits',['http://en.cppreference.com/w/cpp/regex/regex_traits/regex_traits.html',0,'std::regex_traits']]], - ['register_5fcallback_45',['register_callback',['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wiostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wfstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wstringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ios_base::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::strstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ios::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostringstream::register_callback()']]], + ['register_5fcallback_45',['register_callback',['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ios::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ios_base::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::strstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wiostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wfstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wstringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ifstream::register_callback()']]], ['regula_5ffalsi_46',['regula_falsi',['../dd/d29/false__position_8cpp.html#a7d69b49dc37da1c02b3ab8c7fe783494',1,'numerical_methods::false_position']]], - ['rehash_47',['rehash',['http://en.cppreference.com/w/cpp/container/unordered_map/rehash.html',0,'std::unordered_map::rehash()'],['../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d',1,'double_hashing::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/rehash.html',0,'std::unordered_multimap::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/rehash.html',0,'std::unordered_multiset::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_set/rehash.html',0,'std::unordered_set::rehash()'],['../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486',1,'quadratic_probing::rehash()'],['../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0',1,'linear_probing::rehash()']]], - ['release_48',['release',['http://en.cppreference.com/w/cpp/thread/unique_lock/release.html',0,'std::unique_lock::release()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/release.html',0,'std::auto_ptr::release()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/release.html',0,'std::shared_lock::release()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/release.html',0,'std::unique_ptr::release()']]], + ['rehash_47',['rehash',['http://en.cppreference.com/w/cpp/container/unordered_map/rehash.html',0,'std::unordered_map::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/rehash.html',0,'std::unordered_multimap::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/rehash.html',0,'std::unordered_multiset::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_set/rehash.html',0,'std::unordered_set::rehash()'],['../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d',1,'double_hashing::rehash()'],['../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0',1,'linear_probing::rehash()'],['../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486',1,'quadratic_probing::rehash()']]], + ['release_48',['release',['http://en.cppreference.com/w/cpp/thread/unique_lock/release.html',0,'std::unique_lock::release()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/release.html',0,'std::unique_ptr::release()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/release.html',0,'std::shared_lock::release()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/release.html',0,'std::auto_ptr::release()']]], ['relu_49',['relu',['../d2/d58/neural__network_8cpp.html#af8f264600754602b6a9ea19cc690e50e',1,'machine_learning::neural_network::activations']]], ['remainder_50',['remainder',['http://en.cppreference.com/w/cpp/numeric/math/remainder.html',0,'std']]], - ['removalinfo_51',['removalinfo',['../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30',1,'quadratic_probing::removalInfo()'],['../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824',1,'double_hashing::removalInfo()'],['../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0',1,'linear_probing::removalInfo()']]], - ['remove_52',['remove',['../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931',1,'double_hashing::remove()'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6',1,'data_structures::list_array::list::remove()'],['../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28',1,'linear_probing::remove()'],['../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a',1,'quadratic_probing::remove()'],['../d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb',1,'binary_search_tree::remove(T rm_value)'],['../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153',1,'binary_search_tree::remove(std::unique_ptr< bst_node > &parent, std::unique_ptr< bst_node > &node, T rm_value)'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11',1,'data_structures::tree_234::Tree234::Remove()'],['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove()'],['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove()'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove()']]], - ['remove_5fcopy_53',['remove_copy',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]], - ['remove_5fcopy_5fif_54',['remove_copy_if',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]], - ['remove_5fif_55',['remove_if',['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove_if()'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove_if()'],['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove_if()']]], - ['removeitembyindex_56',['RemoveItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8',1,'data_structures::tree_234::Node']]], - ['removepremerge_57',['RemovePreMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4',1,'data_structures::tree_234::Tree234']]], - ['removewordhelper_58',['removeWordHelper',['../dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d',1,'Trie']]], - ['remquo_59',['remquo',['http://en.cppreference.com/w/cpp/numeric/math/remquo.html',0,'std']]], - ['rename_60',['rename',['http://en.cppreference.com/w/cpp/io/c/rename.html',0,'std']]], - ['rend_61',['rend',['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::rend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::rend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::rend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::rend()'],['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::rend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::rend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::rend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::rend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::rend()']]], - ['replace_62',['replace',['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::wstring::replace()'],['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u32string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::basic_string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u16string::replace()']]], - ['replace_5fcopy_63',['replace_copy',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]], - ['replace_5fcopy_5fif_64',['replace_copy_if',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]], - ['replace_5fif_65',['replace_if',['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std']]], - ['reserve_66',['reserve',['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::basic_string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_set/reserve.html',0,'std::unordered_set::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u32string::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u16string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/reserve.html',0,'std::unordered_multimap::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_map/reserve.html',0,'std::unordered_map::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::string::reserve()'],['http://en.cppreference.com/w/cpp/container/vector/reserve.html',0,'std::vector::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/reserve.html',0,'std::unordered_multiset::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::wstring::reserve()']]], - ['reset_67',['reset',['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/reset.html',0,'std::fisher_f_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/reset.html',0,'std::unique_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/reset.html',0,'std::cauchy_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/reset.html',0,'std::binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/reset.html',0,'std::packaged_task::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/reset.html',0,'std::gamma_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/reset.html',0,'std::auto_ptr::reset()'],['http://en.cppreference.com/w/cpp/utility/bitset/reset.html',0,'std::bitset::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/reset.html',0,'std::student_t_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/reset.html',0,'std::uniform_int_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/reset.html',0,'std::piecewise_linear_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/reset.html',0,'std::chi_squared_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/reset.html',0,'std::negative_binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/reset.html',0,'std::weibull_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/reset.html',0,'std::weak_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/reset.html',0,'std::normal_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/reset.html',0,'std::geometric_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/reset.html',0,'std::uniform_real_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/reset.html',0,'std::exponential_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/reset.html',0,'std::shared_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/reset.html',0,'std::bernoulli_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/reset.html',0,'std::poisson_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/reset.html',0,'std::piecewise_constant_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/reset.html',0,'std::discrete_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/reset.html',0,'std::lognormal_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/reset.html',0,'std::extreme_value_distribution::reset()']]], - ['reset_5fdata_68',['reset_data',['../dd/d92/memory__game_8cpp.html#adc62ebb75853446656e24932bdc6dd6b',1,'games::memory_game']]], - ['resetiosflags_69',['resetiosflags',['http://en.cppreference.com/w/cpp/io/manip/resetiosflags.html',0,'std']]], - ['resize_70',['resize',['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::basic_string::resize()'],['http://en.cppreference.com/w/cpp/container/vector/resize.html',0,'std::vector::resize()'],['http://en.cppreference.com/w/cpp/container/forward_list/resize.html',0,'std::forward_list::resize()'],['http://en.cppreference.com/w/cpp/container/deque/resize.html',0,'std::deque::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::wstring::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u16string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u32string::resize()'],['http://en.cppreference.com/w/cpp/container/list/resize.html',0,'std::list::resize()']]], - ['result_71',['result',['../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa',1,'math::fibonacci_sum']]], - ['rethrow_5fexception_72',['rethrow_exception',['http://en.cppreference.com/w/cpp/error/rethrow_exception.html',0,'std']]], - ['rethrow_5fif_5fnested_73',['rethrow_if_nested',['http://en.cppreference.com/w/cpp/error/rethrow_if_nested.html',0,'std']]], - ['rethrow_5fnested_74',['rethrow_nested',['http://en.cppreference.com/w/cpp/error/nested_exception/rethrow_nested.html',0,'std::nested_exception']]], - ['return_5ftemporary_5fbuffer_75',['return_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/return_temporary_buffer.html',0,'std']]], - ['reverse_76',['reverse',['http://en.cppreference.com/w/cpp/container/list/reverse.html',0,'std::list::reverse()'],['../d3/d92/pancake__sort_8cpp.html#a99e27ad84ad43df9977776b1a8d5416e',1,'sorting::pancake_sort::reverse()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse()'],['http://en.cppreference.com/w/cpp/algorithm/reverse.html',0,'std::reverse()'],['http://en.cppreference.com/w/cpp/container/forward_list/reverse.html',0,'std::forward_list::reverse()']]], - ['reverse_5fbinary_77',['reverse_binary',['../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb',1,'miller_rabin.cpp']]], - ['reverse_5fcopy_78',['reverse_copy',['http://en.cppreference.com/w/cpp/algorithm/reverse_copy.html',0,'std']]], - ['reverse_5fstr_79',['reverse_str',['../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541',1,'longest_common_string.cpp']]], - ['reversebinarytree_80',['reverseBinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]], - ['reverselist_81',['reverseList',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70',1,'data_structures::linked_list::list']]], - ['rewind_82',['rewind',['http://en.cppreference.com/w/cpp/io/c/rewind.html',0,'std']]], - ['rfind_83',['rfind',['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u32string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u16string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::wstring::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::basic_string::rfind()']]], - ['right_84',['right',['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::right()'],['../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e',1,'MinHeap::right()']]], - ['right_5frotate_85',['right_rotate',['../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c',1,'hashing::sha256']]], - ['rightrotate_86',['rightrotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9',1,'data_structures::tree_234::Tree234::RightRotate()'],['../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c',1,'rightRotate(): avltree.cpp']]], - ['rint_87',['rint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], - ['rootedtree_88',['RootedTree',['../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d',1,'graph::RootedTree']]], - ['rotate_89',['rotate',['http://en.cppreference.com/w/cpp/algorithm/rotate.html',0,'std::rotate()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29',1,'data_structures::treap::Treap::rotate()']]], - ['rotate_5fcopy_90',['rotate_copy',['http://en.cppreference.com/w/cpp/algorithm/rotate_copy.html',0,'std']]], - ['round_91',['round',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], - ['round_5ferror_92',['round_error',['http://en.cppreference.com/w/cpp/types/numeric_limits/round_error.html',0,'std::numeric_limits']]], - ['run_5ftests_93',['run_tests',['../d3/db3/lru__cache_8cpp.html#a6a3be6d8871b1f5dc03688da8f3ee9e6',1,'lru_tests']]], - ['rungekutta_94',['rungeKutta',['../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856',1,'numerical_methods::runge_kutta']]], - ['runtests_95',['runtests',['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()']]], - ['runtime_5ferror_96',['runtime_error',['http://en.cppreference.com/w/cpp/error/runtime_error.html',0,'std::runtime_error']]] + ['removalinfo_51',['removalInfo',['../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824',1,'double_hashing::removalInfo()'],['../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0',1,'linear_probing::removalInfo()'],['../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30',1,'quadratic_probing::removalInfo()']]], + ['remove_52',['Remove',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11',1,'data_structures::tree_234::Tree234']]], + ['remove_53',['remove',['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove()'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove()'],['../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153',1,'binary_search_tree::remove(std::unique_ptr< bst_node > &parent, std::unique_ptr< bst_node > &node, T rm_value)'],['../d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb',1,'binary_search_tree::remove(T rm_value)'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6',1,'data_structures::list_array::list::remove()'],['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove()'],['../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931',1,'double_hashing::remove()'],['../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28',1,'linear_probing::remove()'],['../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a',1,'quadratic_probing::remove()']]], + ['remove_5fcopy_54',['remove_copy',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]], + ['remove_5fcopy_5fif_55',['remove_copy_if',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]], + ['remove_5fif_56',['remove_if',['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove_if()'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove_if()'],['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove_if()']]], + ['removeitembyindex_57',['RemoveItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8',1,'data_structures::tree_234::Node']]], + ['removepremerge_58',['RemovePreMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4',1,'data_structures::tree_234::Tree234']]], + ['removewordhelper_59',['removeWordHelper',['../dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d',1,'Trie']]], + ['remquo_60',['remquo',['http://en.cppreference.com/w/cpp/numeric/math/remquo.html',0,'std']]], + ['rename_61',['rename',['http://en.cppreference.com/w/cpp/io/c/rename.html',0,'std']]], + ['rend_62',['rend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::rend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::rend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::rend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::rend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::rend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::rend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::rend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::rend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::rend()']]], + ['replace_63',['replace',['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::basic_string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::wstring::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u16string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u32string::replace()'],['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std::replace(T... args)']]], + ['replace_5fcopy_64',['replace_copy',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]], + ['replace_5fcopy_5fif_65',['replace_copy_if',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]], + ['replace_5fif_66',['replace_if',['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std']]], + ['reserve_67',['reserve',['http://en.cppreference.com/w/cpp/container/vector/reserve.html',0,'std::vector::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_map/reserve.html',0,'std::unordered_map::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/reserve.html',0,'std::unordered_multimap::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::basic_string::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::wstring::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/reserve.html',0,'std::unordered_multiset::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u16string::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u32string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_set/reserve.html',0,'std::unordered_set::reserve()']]], + ['reset_68',['reset',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/reset.html',0,'std::student_t_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/reset.html',0,'std::extreme_value_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/reset.html',0,'std::lognormal_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/reset.html',0,'std::weak_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/reset.html',0,'std::discrete_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/reset.html',0,'std::piecewise_constant_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/reset.html',0,'std::poisson_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/reset.html',0,'std::bernoulli_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/reset.html',0,'std::shared_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/reset.html',0,'std::exponential_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/reset.html',0,'std::uniform_real_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/reset.html',0,'std::geometric_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/reset.html',0,'std::normal_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/reset.html',0,'std::unique_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/reset.html',0,'std::weibull_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/reset.html',0,'std::negative_binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/reset.html',0,'std::chi_squared_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/reset.html',0,'std::piecewise_linear_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/reset.html',0,'std::uniform_int_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/reset.html',0,'std::fisher_f_distribution::reset()'],['http://en.cppreference.com/w/cpp/utility/bitset/reset.html',0,'std::bitset::reset()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/reset.html',0,'std::auto_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/reset.html',0,'std::gamma_distribution::reset()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/reset.html',0,'std::packaged_task::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/reset.html',0,'std::binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/reset.html',0,'std::cauchy_distribution::reset()']]], + ['reset_5fdata_69',['reset_data',['../dd/d92/memory__game_8cpp.html#adc62ebb75853446656e24932bdc6dd6b',1,'games::memory_game']]], + ['resetiosflags_70',['resetiosflags',['http://en.cppreference.com/w/cpp/io/manip/resetiosflags.html',0,'std']]], + ['resize_71',['resize',['http://en.cppreference.com/w/cpp/container/vector/resize.html',0,'std::vector::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::string::resize()'],['http://en.cppreference.com/w/cpp/container/forward_list/resize.html',0,'std::forward_list::resize()'],['http://en.cppreference.com/w/cpp/container/deque/resize.html',0,'std::deque::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::basic_string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::wstring::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u16string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u32string::resize()'],['http://en.cppreference.com/w/cpp/container/list/resize.html',0,'std::list::resize()']]], + ['result_72',['result',['../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa',1,'math::fibonacci_sum']]], + ['rethrow_5fexception_73',['rethrow_exception',['http://en.cppreference.com/w/cpp/error/rethrow_exception.html',0,'std']]], + ['rethrow_5fif_5fnested_74',['rethrow_if_nested',['http://en.cppreference.com/w/cpp/error/rethrow_if_nested.html',0,'std']]], + ['rethrow_5fnested_75',['rethrow_nested',['http://en.cppreference.com/w/cpp/error/nested_exception/rethrow_nested.html',0,'std::nested_exception']]], + ['return_5ftemporary_5fbuffer_76',['return_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/return_temporary_buffer.html',0,'std']]], + ['reverse_77',['reverse',['http://en.cppreference.com/w/cpp/container/forward_list/reverse.html',0,'std::forward_list::reverse()'],['http://en.cppreference.com/w/cpp/container/list/reverse.html',0,'std::list::reverse()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse()'],['http://en.cppreference.com/w/cpp/algorithm/reverse.html',0,'std::reverse()'],['../d3/d92/pancake__sort_8cpp.html#a99e27ad84ad43df9977776b1a8d5416e',1,'sorting::pancake_sort::reverse()']]], + ['reverse_5fbinary_78',['reverse_binary',['../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb',1,'miller_rabin.cpp']]], + ['reverse_5fcopy_79',['reverse_copy',['http://en.cppreference.com/w/cpp/algorithm/reverse_copy.html',0,'std']]], + ['reverse_5fstr_80',['reverse_str',['../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541',1,'longest_common_string.cpp']]], + ['reversebinarytree_81',['reverseBinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]], + ['reverselist_82',['reverseList',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70',1,'data_structures::linked_list::list']]], + ['rewind_83',['rewind',['http://en.cppreference.com/w/cpp/io/c/rewind.html',0,'std']]], + ['rfind_84',['rfind',['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::basic_string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::wstring::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u16string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u32string::rfind()']]], + ['right_85',['right',['../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e',1,'MinHeap::right()'],['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::right()']]], + ['right_5frotate_86',['right_rotate',['../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c',1,'hashing::sha256']]], + ['rightrotate_87',['RightRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9',1,'data_structures::tree_234::Tree234']]], + ['rightrotate_88',['rightRotate',['../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c',1,'avltree.cpp']]], + ['rint_89',['rint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], + ['rootedtree_90',['RootedTree',['../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d',1,'graph::RootedTree']]], + ['rotate_91',['rotate',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29',1,'data_structures::treap::Treap::rotate()'],['http://en.cppreference.com/w/cpp/algorithm/rotate.html',0,'std::rotate(T... args)']]], + ['rotate_5fcopy_92',['rotate_copy',['http://en.cppreference.com/w/cpp/algorithm/rotate_copy.html',0,'std']]], + ['round_93',['round',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], + ['round_5ferror_94',['round_error',['http://en.cppreference.com/w/cpp/types/numeric_limits/round_error.html',0,'std::numeric_limits']]], + ['run_5ftests_95',['run_tests',['../d3/db3/lru__cache_8cpp.html#a6a3be6d8871b1f5dc03688da8f3ee9e6',1,'lru_tests']]], + ['rungekutta_96',['rungeKutta',['../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856',1,'numerical_methods::runge_kutta']]], + ['runtests_97',['runTests',['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()']]], + ['runtime_5ferror_98',['runtime_error',['http://en.cppreference.com/w/cpp/error/runtime_error.html',0,'std::runtime_error']]] ]; diff --git a/search/functions_13.js b/search/functions_13.js index 6695b6f78..2ddfc1294 100644 --- a/search/functions_13.js +++ b/search/functions_13.js @@ -9,7 +9,7 @@ var searchData= ['save_5fmodel_6',['save_model',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4f14e473bb0722c6490b9dc8da5982aa',1,'machine_learning::neural_network::NeuralNetwork']]], ['save_5fnd_5fdata_7',['save_nd_data',['../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67',1,'kohonen_som_trace.cpp']]], ['save_5fu_5fmatrix_8',['save_u_matrix',['../d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07',1,'machine_learning']]], - ['sbumpc_9',['sbumpc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::streambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::stringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wfilebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_filebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::strstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_stringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_streambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::filebuf::sbumpc()']]], + ['sbumpc_9',['sbumpc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_filebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::stringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wfilebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::strstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_stringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_streambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::filebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::streambuf::sbumpc()']]], ['scalbln_10',['scalbln',['http://en.cppreference.com/w/cpp/numeric/math/scalbn.html',0,'std']]], ['scalbn_11',['scalbn',['http://en.cppreference.com/w/cpp/numeric/math/scalbn.html',0,'std']]], ['scan_5fis_12',['scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::scan_is()']]], @@ -18,26 +18,26 @@ var searchData= ['scientific_15',['scientific',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], ['scoped_5fallocator_5fadaptor_16',['scoped_allocator_adaptor',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/scoped_allocator_adaptor.html',0,'std::scoped_allocator_adaptor']]], ['scs_17',['scs',['../d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6',1,'dynamic_programming::shortest_common_supersequence']]], - ['search_18',['search',['../d3/db2/boyer__moore_8cpp.html#a15703b553faed0d28202c10808cf9738',1,'strings::boyer_moore::search()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f',1,'data_structures::trie_using_hashmap::Trie::search()'],['../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d',1,'data_structures::trie::search(const std::string &str, int index)'],['../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63',1,'data_structures::trie::search(const std::shared_ptr< trie > &root, const std::string &str, int index)'],['../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206',1,'Trie::search()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a098be172c737f236763afdb8cada4835',1,'data_structures::linked_list::list::search()'],['http://en.cppreference.com/w/cpp/algorithm/search.html',0,'std::search(T... args)']]], + ['search_18',['search',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a098be172c737f236763afdb8cada4835',1,'data_structures::linked_list::list::search()'],['../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206',1,'Trie::search()'],['../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63',1,'data_structures::trie::search(const std::shared_ptr< trie > &root, const std::string &str, int index)'],['../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d',1,'data_structures::trie::search(const std::string &str, int index)'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f',1,'data_structures::trie_using_hashmap::Trie::search()'],['http://en.cppreference.com/w/cpp/algorithm/search.html',0,'std::search()'],['../d3/db2/boyer__moore_8cpp.html#a15703b553faed0d28202c10808cf9738',1,'strings::boyer_moore::search()']]], ['search_5fn_19',['search_n',['http://en.cppreference.com/w/cpp/algorithm/search_n.html',0,'std']]], ['searchelement_20',['searchElement',['../d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4',1,'data_structures::SkipList']]], ['searchfreqsuggestions_21',['SearchFreqSuggestions',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503',1,'operations_on_datastructures::trie_operations::Tnode']]], - ['searchingprober_22',['searchingprober',['../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6',1,'quadratic_probing::searchingProber()'],['../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77',1,'linear_probing::searchingProber()'],['../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6',1,'double_hashing::searchingProber()']]], + ['searchingprober_22',['searchingProber',['../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6',1,'double_hashing::searchingProber()'],['../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77',1,'linear_probing::searchingProber()'],['../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6',1,'quadratic_probing::searchingProber()']]], ['searchpresence_23',['SearchPresence',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023',1,'operations_on_datastructures::trie_operations::Tnode']]], ['searchsuggestions_24',['SearchSuggestions',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c',1,'operations_on_datastructures::trie_operations::Tnode']]], ['seconds_25',['seconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::seconds']]], - ['seed_26',['seed',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::discard_block_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::subtract_with_carry_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937_64::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux24_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux48::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand0::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mersenne_twister_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/seed.html',0,'std::independent_bits_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux48_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::shuffle_order_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux24::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::linear_congruential_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::knuth_b::seed()']]], + ['seed_26',['seed',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937_64::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux24_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux48::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::discard_block_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mersenne_twister_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/seed.html',0,'std::independent_bits_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux48_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::shuffle_order_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux24::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::linear_congruential_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::knuth_b::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand0::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::subtract_with_carry_engine::seed()']]], ['seed_5fseq_27',['seed_seq',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/seed_seq.html',0,'std::seed_seq']]], - ['seekg_28',['seekg',['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::ifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wstringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wfstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_ifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wiostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istrstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::strstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wifstream::seekg()']]], - ['seekoff_29',['seekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::seekoff()']]], - ['seekp_30',['seekp',['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wiostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostrstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wfstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_iostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wstringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::strstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::iostream::seekp()']]], - ['seekpos_31',['seekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::seekpos()']]], - ['select_5fon_5fcontainer_5fcopy_5fconstruction_32',['select_on_container_copy_construction',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/select_on_container_copy_construction.html',0,'std::scoped_allocator_adaptor::select_on_container_copy_construction()'],['http://en.cppreference.com/w/cpp/memory/allocator_traits/select_on_container_copy_construction.html',0,'std::allocator_traits::select_on_container_copy_construction()']]], + ['seekg_28',['seekg',['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::strstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istrstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wiostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_ifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wfstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wstringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::ifstream::seekg()']]], + ['seekoff_29',['seekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::seekoff()']]], + ['seekp_30',['seekp',['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::iostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::strstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wiostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostrstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wfstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_iostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wstringstream::seekp()']]], + ['seekpos_31',['seekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::seekpos()']]], + ['select_5fon_5fcontainer_5fcopy_5fconstruction_32',['select_on_container_copy_construction',['http://en.cppreference.com/w/cpp/memory/allocator_traits/select_on_container_copy_construction.html',0,'std::allocator_traits::select_on_container_copy_construction()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/select_on_container_copy_construction.html',0,'std::scoped_allocator_adaptor::select_on_container_copy_construction()']]], ['selectionsortrecursive_33',['selectionSortRecursive',['../d4/d9f/selection__sort__recursive_8cpp.html#ab6f7b33a070e376e1f4374e534435e89',1,'sorting::selection_sort_recursive']]], ['selectiontop_5f3_34',['SelectionTop_3',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6',1,'operations_on_datastructures::trie_operations::Tnode']]], ['semi_5fimplicit_5feuler_35',['semi_implicit_euler',['../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089',1,'ode_semi_implicit_euler.cpp']]], ['semi_5fimplicit_5feuler_5fstep_36',['semi_implicit_euler_step',['../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f',1,'ode_semi_implicit_euler.cpp']]], - ['sentry_37',['sentry',['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::sentry()']]], + ['sentry_37',['sentry',['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::sentry()']]], ['set_38',['set',['http://en.cppreference.com/w/cpp/container/set/set.html',0,'std::set::set()'],['http://en.cppreference.com/w/cpp/utility/bitset/set.html',0,'std::bitset::set()']]], ['set_5fdifference_39',['set_difference',['http://en.cppreference.com/w/cpp/algorithm/set_difference.html',0,'std']]], ['set_5fexception_40',['set_exception',['http://en.cppreference.com/w/cpp/thread/promise/set_exception.html',0,'std::promise']]], @@ -45,7 +45,7 @@ var searchData= ['set_5fintersection_42',['set_intersection',['http://en.cppreference.com/w/cpp/algorithm/set_intersection.html',0,'std']]], ['set_5fnew_5fhandler_43',['set_new_handler',['http://en.cppreference.com/w/cpp/memory/new/set_new_handler.html',0,'std']]], ['set_5fnode_5fval_44',['set_node_val',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70',1,'range_queries::heavy_light_decomposition::Tree']]], - ['set_5frdbuf_45',['set_rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wstringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wfstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ios::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::strstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wiostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostringstream::set_rdbuf()']]], + ['set_5frdbuf_45',['set_rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ios::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::strstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wiostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wfstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wstringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ifstream::set_rdbuf()']]], ['set_5fsret_5finit_46',['set_sret_init',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ad3b942be27a1b0fe3cff6cb6edf01294',1,'range_queries::heavy_light_decomposition::SG']]], ['set_5fsymmetric_5fdifference_47',['set_symmetric_difference',['http://en.cppreference.com/w/cpp/algorithm/set_symmetric_difference.html',0,'std']]], ['set_5fterminate_48',['set_terminate',['http://en.cppreference.com/w/cpp/error/set_terminate.html',0,'std']]], @@ -54,24 +54,24 @@ var searchData= ['set_5fvalue_51',['set_value',['http://en.cppreference.com/w/cpp/thread/promise/set_value.html',0,'std::promise']]], ['set_5fvalue_5fat_5fthread_5fexit_52',['set_value_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/promise/set_value_at_thread_exit.html',0,'std::promise']]], ['setbase_53',['setbase',['http://en.cppreference.com/w/cpp/io/manip/setbase.html',0,'std']]], - ['setbuf_54',['setbuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/c/setbuf.html',0,'std::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::setbuf()']]], + ['setbuf_54',['setbuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/c/setbuf.html',0,'std::setbuf()']]], ['setchild_55',['SetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74',1,'data_structures::tree_234::Node']]], ['setcount_56',['SetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1',1,'data_structures::tree_234::Node']]], - ['setf_57',['setf',['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ios::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wstringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wfstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wiostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ios_base::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::strstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistream::setf()']]], + ['setf_57',['setf',['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ios::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ios_base::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::strstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wiostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wfstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wstringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ifstream::setf()']]], ['setfill_58',['setfill',['http://en.cppreference.com/w/cpp/io/manip/setfill.html',0,'std']]], - ['setg_59',['setg',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::streambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_streambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::strstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wfilebuf::setg()']]], + ['setg_59',['setg',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wfilebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::strstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_streambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::streambuf::setg()']]], ['setiosflags_60',['setiosflags',['http://en.cppreference.com/w/cpp/io/manip/setiosflags.html',0,'std']]], ['setitem_61',['SetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc',1,'data_structures::tree_234::Node']]], ['setkthbit_62',['setKthBit',['../d5/db5/set__kth__bit_8cpp.html#ad4d0ffd9331242c42a28834ee19f5fd9',1,'bit_manipulation::set_kth_bit']]], ['setlocale_63',['setlocale',['http://en.cppreference.com/w/cpp/locale/setlocale.html',0,'std']]], - ['setp_64',['setp',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_streambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::stringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wfilebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::strstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_stringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::streambuf::setp()']]], + ['setp_64',['setp',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::stringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wfilebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::strstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_stringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_streambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::streambuf::setp()']]], ['setprecision_65',['setprecision',['http://en.cppreference.com/w/cpp/io/manip/setprecision.html',0,'std']]], - ['setstate_66',['setstate',['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istrstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wiostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostrstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wfstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wstringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::strstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ios::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ifstream::setstate()']]], + ['setstate_66',['setstate',['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ios::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::strstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istrstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wiostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostrstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wfstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wstringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ifstream::setstate()']]], ['setvbuf_67',['setvbuf',['http://en.cppreference.com/w/cpp/io/c/setvbuf.html',0,'std']]], ['setw_68',['setw',['http://en.cppreference.com/w/cpp/io/manip/setw.html',0,'std']]], ['sg_69',['SG',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1',1,'range_queries::heavy_light_decomposition::SG']]], - ['sgetc_70',['sgetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::strstreambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_streambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::streambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wfilebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstreambuf::sgetc()']]], - ['sgetn_71',['sgetn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::strstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_stringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_streambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::streambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::stringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wfilebuf::sgetn()']]], + ['sgetc_70',['sgetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wfilebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstreambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::strstreambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_streambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::streambuf::sgetc()']]], + ['sgetn_71',['sgetn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::stringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wfilebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::strstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_stringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_streambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::streambuf::sgetn()']]], ['sgn_72',['sgn',['../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2',1,'bisection_method.cpp']]], ['sha256_73',['sha256',['../d4/d08/sha256_8cpp.html#a55475649a2bb7aae15de0716a217f43a',1,'hashing::sha256']]], ['share_74',['share',['http://en.cppreference.com/w/cpp/thread/future/share.html',0,'std::future']]], @@ -80,153 +80,155 @@ var searchData= ['shared_5flock_77',['shared_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock/shared_lock.html',0,'std::shared_lock']]], ['shared_5fptr_78',['shared_ptr',['http://en.cppreference.com/w/cpp/memory/shared_ptr/shared_ptr.html',0,'std::shared_ptr']]], ['shared_5ftimed_5fmutex_79',['shared_timed_mutex',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/shared_timed_mutex.html',0,'std::shared_timed_mutex']]], - ['shell_5fsort_80',['shell_sort',['../d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924',1,'sorting::shell_sort(T(&arr)[N])'],['../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa',1,'sorting::shell_sort(T *arr, size_t LEN)'],['../d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331',1,'sorting::shell_sort(std::vector< T > *arr)']]], + ['shell_5fsort_80',['shell_sort',['../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa',1,'sorting::shell_sort(T *arr, size_t LEN)'],['../d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924',1,'sorting::shell_sort(T(&arr)[N])'],['../d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331',1,'sorting::shell_sort(std::vector< T > *arr)']]], ['shift_5fleft_81',['shift_left',['../da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8',1,'operations_on_datastructures']]], ['shift_5fright_82',['shift_right',['../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86',1,'operations_on_datastructures']]], ['shortest_5fpath_5fdistance_83',['Shortest_Path_Distance',['../d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6',1,'graph::bidirectional_dijkstra']]], - ['show_84',['show',['../d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07',1,'show(int *arr, int size): merge_sort.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed',1,'show(const struct tower *const F, const struct tower *const T, const struct tower *const U): tower_of_hanoi.cpp'],['../d2/d26/count__inversions_8cpp.html#a851ca6a0391d14fb49a97d55e4377497',1,'sorting::inversion::show()'],['../d1/d21/quick__sort_8cpp.html#aeccefcf6fcca62c54939c5ec9a93109b',1,'sorting::quick_sort::show()'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e',1,'data_structures::list_array::list::show()']]], + ['show_84',['show',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e',1,'data_structures::list_array::list::show()'],['../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed',1,'show(): tower_of_hanoi.cpp'],['../d2/d26/count__inversions_8cpp.html#a851ca6a0391d14fb49a97d55e4377497',1,'sorting::inversion::show()'],['../d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07',1,'show(): merge_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#aeccefcf6fcca62c54939c5ec9a93109b',1,'sorting::quick_sort::show()']]], ['show_5farray_85',['show_array',['../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859',1,'bogo_sort.cpp']]], ['show_5fdata_86',['show_data',['../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246',1,'show_data(T *arr, size_t LEN): shell_sort2.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6',1,'show_data(T(&arr)[N]): shell_sort2.cpp']]], ['show_5fpascal_87',['show_pascal',['../dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c',1,'pascal_triangle.cpp']]], ['showarray_88',['showArray',['../d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10',1,'sorting::random_pivot_quick_sort']]], ['showbase_89',['showbase',['http://en.cppreference.com/w/cpp/io/manip/showbase.html',0,'std']]], - ['showmanyc_90',['showmanyc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wfilebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::strstreambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstreambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_streambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_filebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::streambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::filebuf::showmanyc()']]], + ['showmanyc_90',['showmanyc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_filebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wfilebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstreambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::strstreambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_streambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::filebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::streambuf::showmanyc()']]], ['showpoint_91',['showpoint',['http://en.cppreference.com/w/cpp/io/manip/showpoint.html',0,'std']]], ['showpos_92',['showpos',['http://en.cppreference.com/w/cpp/io/manip/showpos.html',0,'std']]], - ['shrink_5fto_5ffit_93',['shrink_to_fit',['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html',0,'std::vector::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::wstring::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u16string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u32string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::basic_string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/container/deque/shrink_to_fit.html',0,'std::deque::shrink_to_fit()']]], + ['shrink_5fto_5ffit_93',['shrink_to_fit',['http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html',0,'std::vector::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/container/deque/shrink_to_fit.html',0,'std::deque::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::basic_string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::wstring::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u16string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u32string::shrink_to_fit()']]], ['shuffle_94',['shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std::shuffle()'],['../d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5',1,'sorting::shuffle()']]], ['shuffle_5forder_5fengine_95',['shuffle_order_engine',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::shuffle_order_engine']]], - ['sieve_96',['sieve',['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'Sieve(int64_t n): primes_up_to_billion.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a7eebd5e7686a8db363f937b2f30d3818',1,'sieve(uint32_t N): sieve_of_eratosthenes.cpp'],['../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f',1,'math::sieve()']]], - ['sieveoferatosthenes_97',['SieveOfEratosthenes',['../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099',1,'prime_factorization.cpp']]], - ['sig2hex_98',['sig2hex',['../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348',1,'hashing::md5::sig2hex()'],['../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228',1,'hashing::sha1::sig2hex()']]], - ['sigmoid_99',['sigmoid',['../d2/d58/neural__network_8cpp.html#a23aa9d32bcbcd65cfc85f0a41e2afadc',1,'machine_learning::neural_network::activations']]], - ['signal_100',['signal',['http://en.cppreference.com/w/cpp/utility/program/signal.html',0,'std']]], - ['signaling_5fnan_101',['signaling_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/signaling_NaN.html',0,'std::numeric_limits']]], - ['signbit_102',['signbit',['http://en.cppreference.com/w/cpp/numeric/math/signbit.html',0,'std']]], - ['sin_103',['sin',['http://en.cppreference.com/w/cpp/numeric/math/sin.html',0,'std']]], - ['single_5fpredict_104',['single_predict',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f',1,'machine_learning::neural_network::NeuralNetwork']]], - ['sinh_105',['sinh',['http://en.cppreference.com/w/cpp/numeric/math/sinh.html',0,'std']]], - ['size_106',['size',['http://en.cppreference.com/w/cpp/container/array/size.html',0,'std::array::size()'],['http://en.cppreference.com/w/cpp/container/dynarray/size.html',0,'std::dynarray::size()'],['http://en.cppreference.com/w/cpp/container/vector/size.html',0,'std::vector::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::match_results::size()'],['http://en.cppreference.com/w/cpp/container/multiset/size.html',0,'std::multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::smatch::size()'],['http://en.cppreference.com/w/cpp/container/stack/size.html',0,'std::stack::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/size.html',0,'std::unordered_multimap::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wcmatch::size()'],['../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3',1,'binary_search_tree::size()'],['../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54',1,'data_structures::Bitset::size()'],['../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c',1,'dsu::size()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39',1,'data_structures::stack_using_queue::Stack::size()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1',1,'divide_and_conquer::strassens_multiplication::Matrix::size()'],['http://en.cppreference.com/w/cpp/container/multimap/size.html',0,'std::multimap::size()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865',1,'range_queries::perSegTree::size()'],['http://en.cppreference.com/w/cpp/container/deque/size.html',0,'std::deque::size()'],['http://en.cppreference.com/w/cpp/container/set/size.html',0,'std::set::size()'],['http://en.cppreference.com/w/cpp/container/queue/size.html',0,'std::queue::size()'],['http://en.cppreference.com/w/cpp/utility/bitset/size.html',0,'std::bitset::size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/size.html',0,'std::unordered_map::size()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/size.html',0,'std::initializer_list::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wsmatch::size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/size.html',0,'std::unordered_set::size()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/size.html',0,'std::seed_seq::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::cmatch::size()'],['http://en.cppreference.com/w/cpp/container/map/size.html',0,'std::map::size()'],['http://en.cppreference.com/w/cpp/container/list/size.html',0,'std::list::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/size.html',0,'std::unordered_multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::size()'],['http://en.cppreference.com/w/cpp/container/priority_queue/size.html',0,'std::priority_queue::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::size()']]], - ['skiplist_107',['SkipList',['../d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4',1,'data_structures::SkipList']]], - ['skipws_108',['skipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]], - ['sleep_109',['SLEEP',['../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6',1,'memory_game.cpp']]], - ['sleep_5ffor_110',['sleep_for',['http://en.cppreference.com/w/cpp/thread/sleep_for.html',0,'std::this_thread']]], - ['sleep_5funtil_111',['sleep_until',['http://en.cppreference.com/w/cpp/thread/sleep_until.html',0,'std::this_thread']]], - ['slice_112',['slice',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17',1,'divide_and_conquer::strassens_multiplication::Matrix']]], - ['smatch_113',['smatch',['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::smatch']]], - ['snextc_114',['snextc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::strstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::streambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::filebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_streambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wfilebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_filebuf::snextc()']]], - ['snprintf_115',['snprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], - ['solution_116',['Solution',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4',1,'machine_learning::aystar_search::AyStarSearch']]], - ['solve_117',['solve',['../d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9',1,'backtracking::knight_tour']]], - ['solvemaze_118',['solveMaze',['../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3',1,'backtracking::rat_maze']]], - ['solvenq_119',['solveNQ',['../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb',1,'backtracking::n_queens']]], - ['solvesudoku_120',['solveSudoku',['../d3/d05/sudoku__solver_8cpp.html#ac911c8bca8556206ff64461b2424866b',1,'backtracking::sudoku_solver']]], - ['sort_121',['sort',['http://en.cppreference.com/w/cpp/algorithm/sort.html',0,'std::sort()'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180',1,'data_structures::list_array::list::sort()'],['http://en.cppreference.com/w/cpp/container/list/sort.html',0,'std::list::sort()'],['http://en.cppreference.com/w/cpp/container/forward_list/sort.html',0,'std::forward_list::sort()']]], - ['sort_5fheap_122',['sort_heap',['http://en.cppreference.com/w/cpp/algorithm/sort_heap.html',0,'std']]], - ['sortcol_123',['sortcol',['../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec',1,'fcfs_scheduling.cpp']]], - ['sphere_5fsurface_5farea_124',['sphere_surface_area',['../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656',1,'math']]], - ['sphere_5fvolume_125',['sphere_volume',['../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551',1,'math']]], - ['spiralprint_126',['spiralPrint',['../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197',1,'spiral_print.cpp']]], - ['spirograph_127',['spirograph',['../da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac',1,'spirograph']]], - ['splice_128',['splice',['http://en.cppreference.com/w/cpp/container/list/splice.html',0,'std::list']]], - ['splice_5fafter_129',['splice_after',['http://en.cppreference.com/w/cpp/container/forward_list/splice_after.html',0,'std::forward_list']]], - ['splitnode_130',['SplitNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9',1,'data_structures::tree_234::Tree234']]], - ['sprintf_131',['sprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], - ['sputbackc_132',['sputbackc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wfilebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstreambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::strstreambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_streambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::streambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstringbuf::sputbackc()']]], - ['sputc_133',['sputc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_stringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wfilebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstreambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::strstreambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_streambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::streambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::stringbuf::sputc()']]], - ['sputn_134',['sputn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wfilebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::strstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_streambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::filebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::streambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_filebuf::sputn()']]], - ['sqrt_135',['sqrt',['../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc',1,'Sqrt(): sqrt_double.cpp'],['http://en.cppreference.com/w/cpp/numeric/math/sqrt.html',0,'std::sqrt()']]], - ['square_136',['square',['../d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153',1,'machine_learning::neural_network::util_functions']]], - ['square_5farea_137',['square_area',['../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049',1,'math']]], - ['square_5fperimeter_138',['square_perimeter',['../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14',1,'math']]], - ['srand_139',['srand',['http://en.cppreference.com/w/cpp/numeric/random/srand.html',0,'std']]], - ['sregex_5fiterator_140',['sregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::sregex_iterator']]], - ['sregex_5ftoken_5fiterator_141',['sregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::sregex_token_iterator']]], - ['sscanf_142',['sscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]], - ['ssub_5fmatch_143',['ssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::ssub_match']]], - ['stable_5fpartition_144',['stable_partition',['http://en.cppreference.com/w/cpp/algorithm/stable_partition.html',0,'std']]], - ['stable_5fsort_145',['stable_sort',['http://en.cppreference.com/w/cpp/algorithm/stable_sort.html',0,'std']]], - ['stack_146',['stack',['http://en.cppreference.com/w/cpp/container/stack/stack.html',0,'std::stack']]], - ['standard_5fdeviation_147',['standard_deviation',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2',1,'probability::geometric_dist::geometric_distribution']]], - ['standard_5finvsqrt_148',['Standard_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97',1,'inv_sqrt.cpp']]], - ['startwith_149',['startwith',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17',1,'data_structures::trie_using_hashmap::Trie']]], - ['state_150',['state',['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u32streampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::wstreampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::streampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::fpos::state()'],['http://en.cppreference.com/w/cpp/locale/wstring_convert/state.html',0,'std::wstring_convert::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u16streampos::state()'],['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/state.html',0,'std::wbuffer_convert::state()']]], - ['static_5fpointer_5fcast_151',['static_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], - ['std_152',['std',['../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1',1,'statistics::stats_computer1::std()'],['../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e',1,'statistics::stats_computer2::std()']]], - ['stddev_153',['stddev',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution']]], - ['step_5fith_154',['step_ith',['../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9',1,'sorting::radix_sort']]], - ['stod_155',['stod',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], - ['stof_156',['stof',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], - ['stoi_157',['stoi',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], - ['stol_158',['stol',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], - ['stold_159',['stold',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], - ['stoll_160',['stoll',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], - ['stoogesort_161',['stoogeSort',['../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b',1,'stooge_sort.cpp']]], - ['store_162',['store',['http://en.cppreference.com/w/cpp/atomic/atomic/store.html',0,'std::atomic']]], - ['stoul_163',['stoul',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]], - ['stoull_164',['stoull',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]], - ['str_165',['str',['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::wistringstream::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::match_results::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::basic_ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::wstringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wsmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::wstringstream::str()'],['http://en.cppreference.com/w/cpp/io/ostrstream/str.html',0,'std::ostrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::istringstream::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::cmatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::basic_istringstream::str()'],['http://en.cppreference.com/w/cpp/io/istrstream/str.html',0,'std::istrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::wostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::basic_stringstream::str()'],['http://en.cppreference.com/w/cpp/io/strstream/str.html',0,'std::strstream::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::basic_stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wcmatch::str()'],['http://en.cppreference.com/w/cpp/io/strstreambuf/str.html',0,'std::strstreambuf::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::stringstream::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::smatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::stringbuf::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::ostringstream::str()']]], - ['strand_5fsort_166',['strand_sort',['../dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd',1,'sorting::strand']]], - ['strassens_5fmultiplication_167',['strassens_multiplication',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a',1,'divide_and_conquer::strassens_multiplication::Matrix']]], - ['strcat_168',['strcat',['http://en.cppreference.com/w/cpp/string/byte/strcat.html',0,'std']]], - ['strchr_169',['strchr',['http://en.cppreference.com/w/cpp/string/byte/strchr.html',0,'std']]], - ['strcmp_170',['strcmp',['http://en.cppreference.com/w/cpp/string/byte/strcmp.html',0,'std']]], - ['strcoll_171',['strcoll',['http://en.cppreference.com/w/cpp/string/byte/strcoll.html',0,'std']]], - ['strcpy_172',['strcpy',['http://en.cppreference.com/w/cpp/string/byte/strcpy.html',0,'std']]], - ['strcspn_173',['strcspn',['http://en.cppreference.com/w/cpp/string/byte/strcspn.html',0,'std']]], - ['streambuf_174',['streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::streambuf']]], - ['strerror_175',['strerror',['http://en.cppreference.com/w/cpp/string/byte/strerror.html',0,'std']]], - ['strftime_176',['strftime',['http://en.cppreference.com/w/cpp/chrono/c/strftime.html',0,'std']]], - ['string_177',['string',['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::string']]], - ['stringbuf_178',['stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::stringbuf']]], - ['stringstream_179',['stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::stringstream']]], - ['strlen_180',['strlen',['http://en.cppreference.com/w/cpp/string/byte/strlen.html',0,'std']]], - ['strncat_181',['strncat',['http://en.cppreference.com/w/cpp/string/byte/strncat.html',0,'std']]], - ['strncmp_182',['strncmp',['http://en.cppreference.com/w/cpp/string/byte/strncmp.html',0,'std']]], - ['strncpy_183',['strncpy',['http://en.cppreference.com/w/cpp/string/byte/strncpy.html',0,'std']]], - ['strpbrk_184',['strpbrk',['http://en.cppreference.com/w/cpp/string/byte/strpbrk.html',0,'std']]], - ['strrchr_185',['strrchr',['http://en.cppreference.com/w/cpp/string/byte/strrchr.html',0,'std']]], - ['strspn_186',['strspn',['http://en.cppreference.com/w/cpp/string/byte/strspn.html',0,'std']]], - ['strstr_187',['strstr',['http://en.cppreference.com/w/cpp/string/byte/strstr.html',0,'std']]], - ['strstream_188',['strstream',['http://en.cppreference.com/w/cpp/io/strstream/strstream.html',0,'std::strstream']]], - ['strstreambuf_189',['strstreambuf',['http://en.cppreference.com/w/cpp/io/strstreambuf/strstreambuf.html',0,'std::strstreambuf']]], - ['strtod_190',['strtod',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], - ['strtof_191',['strtof',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], - ['strtoimax_192',['strtoimax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]], - ['strtok_193',['strtok',['http://en.cppreference.com/w/cpp/string/byte/strtok.html',0,'std']]], - ['strtol_194',['strtol',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]], - ['strtold_195',['strtold',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], - ['strtoll_196',['strtoll',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]], - ['strtoul_197',['strtoul',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]], - ['strtoull_198',['strtoull',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]], - ['strtoumax_199',['strtoumax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]], - ['struzik_5fsearch_200',['struzik_search',['../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208',1,'exponential_search.cpp']]], - ['strxfrm_201',['strxfrm',['http://en.cppreference.com/w/cpp/string/byte/strxfrm.html',0,'std']]], - ['student_5ft_5fdistribution_202',['student_t_distribution',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/student_t_distribution.html',0,'std::student_t_distribution']]], - ['sub_5fmatch_203',['sub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::sub_match']]], - ['subarray_5fsum_204',['subarray_sum',['../df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e',1,'backtracking::subarray_sum']]], - ['sublistsearch_205',['sublistSearch',['../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c',1,'search::sublist_search']]], - ['subset_5fsum_5fproblem_206',['subset_sum_problem',['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50',1,'dynamic_programming::subset_sum']]], - ['subset_5fsum_5frecursion_207',['subset_sum_recursion',['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607',1,'dynamic_programming::subset_sum']]], - ['substr_208',['substr',['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::basic_string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::wstring::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u32string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u16string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::string::substr()']]], - ['subtract_5fwith_5fcarry_5fengine_209',['subtract_with_carry_engine',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine']]], - ['succ_210',['succ',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3',1,'data_structures::linked_list::link']]], - ['suffix_211',['suffix',['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wcmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::smatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wsmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::cmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::match_results::suffix()']]], - ['suggestautocomplete_212',['SuggestAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe',1,'operations_on_datastructures::trie_operations::Tnode']]], - ['suggestfreqautocomplete_213',['SuggestFreqAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c',1,'operations_on_datastructures::trie_operations::Tnode']]], - ['sum_214',['sum',['../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35',1,'machine_learning::sum()'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd',1,'range_queries::fenwick_tree::sum()']]], - ['sum_5fof_5fdigits_215',['sum_of_digits',['../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395',1,'sum_of_digits.cpp']]], - ['sum_5fof_5fdivisor_216',['sum_of_divisor',['../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a',1,'math']]], - ['sum_5frange_217',['sum_range',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe',1,'range_queries::fenwick_tree']]], - ['summary_218',['summary',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931',1,'machine_learning::neural_network::NeuralNetwork']]], - ['sungetc_219',['sungetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::strstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wfilebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstringbuf::sungetc()']]], - ['swap_220',['swap',['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostream::swap()'],['http://en.cppreference.com/w/cpp/utility/functional/function/swap.html',0,'std::function::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::filebuf::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u16string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wiostream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u32string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/list/swap.html',0,'std::list::swap()'],['http://en.cppreference.com/w/cpp/container/map/swap.html',0,'std::map::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::cmatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::streambuf::swap()'],['http://en.cppreference.com/w/cpp/experimental/optional/swap.html',0,'std::experimental::optional::swap()'],['http://en.cppreference.com/w/cpp/container/array/swap.html',0,'std::array::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istringstream::swap()'],['http://en.cppreference.com/w/cpp/algorithm/swap.html',0,'std::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostrstream::swap()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/swap.html',0,'std::packaged_task::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/swap.html',0,'std::unordered_multiset::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istrstream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::wstring::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostringstream::swap()'],['http://en.cppreference.com/w/cpp/container/priority_queue/swap.html',0,'std::priority_queue::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::basic_string::swap()'],['http://en.cppreference.com/w/cpp/thread/thread/swap.html',0,'std::thread::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_stringstream::swap()'],['http://en.cppreference.com/w/cpp/container/queue/swap.html',0,'std::queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_streambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::strstream::swap()'],['http://en.cppreference.com/w/cpp/thread/promise/swap.html',0,'std::promise::swap()'],['http://en.cppreference.com/w/cpp/container/deque/swap.html',0,'std::deque::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_stringbuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wifstream::swap()'],['http://en.cppreference.com/w/cpp/utility/pair/swap.html',0,'std::pair::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wcmatch::swap()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/swap.html',0,'std::shared_lock::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::strstreambuf::swap()'],['http://en.cppreference.com/w/cpp/container/forward_list/swap.html',0,'std::forward_list::swap()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/swap.html',0,'std::unique_ptr::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/swap.html',0,'std::unordered_multimap::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::stringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistream::swap()'],['http://en.cppreference.com/w/cpp/container/stack/swap.html',0,'std::stack::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::iostream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wfilebuf::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::smatch::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::wregex::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::stringbuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_fstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostringstream::swap()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/swap.html',0,'std::shared_ptr::swap()'],['http://en.cppreference.com/w/cpp/utility/tuple/swap.html',0,'std::tuple::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wsmatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ios::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstringbuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_filebuf::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::basic_regex::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_map/swap.html',0,'std::unordered_map::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::regex::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostringstream::swap()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/swap.html',0,'std::unique_lock::swap()'],['http://en.cppreference.com/w/cpp/container/set/swap.html',0,'std::set::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::string::swap()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/swap.html',0,'std::weak_ptr::swap()'],['http://en.cppreference.com/w/cpp/container/multiset/swap.html',0,'std::multiset::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::match_results::swap()'],['http://en.cppreference.com/w/cpp/container/vector/swap.html',0,'std::vector::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::fstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ofstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_set/swap.html',0,'std::unordered_set::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wfstream::swap()'],['http://en.cppreference.com/w/cpp/container/multimap/swap.html',0,'std::multimap::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_iostream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wstringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ifstream::swap()']]], - ['swap_5franges_221',['swap_ranges',['http://en.cppreference.com/w/cpp/algorithm/swap_ranges.html',0,'std']]], - ['swprintf_222',['swprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], - ['swscanf_223',['swscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]], - ['sync_224',['sync',['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::strstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istrstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wiostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_ifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wfstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wstringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::ifstream::sync()']]], - ['sync_5fwith_5fstdio_225',['sync_with_stdio',['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ios::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ios_base::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::strstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wiostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wfstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wstringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ofstream::sync_with_stdio()']]], - ['system_226',['system',['http://en.cppreference.com/w/cpp/utility/program/system.html',0,'std']]], - ['system_5fcategory_227',['system_category',['http://en.cppreference.com/w/cpp/error/system_category.html',0,'std']]], - ['system_5ferror_228',['system_error',['http://en.cppreference.com/w/cpp/error/system_error/system_error.html',0,'std::system_error']]] + ['sieve_96',['Sieve',['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'primes_up_to_billion.cpp']]], + ['sieve_97',['sieve',['../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f',1,'math::sieve()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a7eebd5e7686a8db363f937b2f30d3818',1,'sieve(uint32_t N): sieve_of_eratosthenes.cpp']]], + ['sieveoferatosthenes_98',['SieveOfEratosthenes',['../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099',1,'prime_factorization.cpp']]], + ['sig2hex_99',['sig2hex',['../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348',1,'hashing::md5::sig2hex()'],['../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228',1,'hashing::sha1::sig2hex()']]], + ['sigmoid_100',['sigmoid',['../d2/d58/neural__network_8cpp.html#a23aa9d32bcbcd65cfc85f0a41e2afadc',1,'machine_learning::neural_network::activations']]], + ['signal_101',['signal',['http://en.cppreference.com/w/cpp/utility/program/signal.html',0,'std']]], + ['signaling_5fnan_102',['signaling_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/signaling_NaN.html',0,'std::numeric_limits']]], + ['signbit_103',['signbit',['http://en.cppreference.com/w/cpp/numeric/math/signbit.html',0,'std']]], + ['sin_104',['sin',['http://en.cppreference.com/w/cpp/numeric/math/sin.html',0,'std']]], + ['single_5fpredict_105',['single_predict',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f',1,'machine_learning::neural_network::NeuralNetwork']]], + ['sinh_106',['sinh',['http://en.cppreference.com/w/cpp/numeric/math/sinh.html',0,'std']]], + ['size_107',['size',['http://en.cppreference.com/w/cpp/container/dynarray/size.html',0,'std::dynarray::size()'],['http://en.cppreference.com/w/cpp/container/vector/size.html',0,'std::vector::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::match_results::size()'],['http://en.cppreference.com/w/cpp/container/multiset/size.html',0,'std::multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::size()'],['http://en.cppreference.com/w/cpp/container/set/size.html',0,'std::set::size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/size.html',0,'std::unordered_map::size()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/size.html',0,'std::initializer_list::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wsmatch::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::smatch::size()'],['http://en.cppreference.com/w/cpp/container/stack/size.html',0,'std::stack::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/size.html',0,'std::unordered_multimap::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wcmatch::size()'],['http://en.cppreference.com/w/cpp/container/deque/size.html',0,'std::deque::size()'],['http://en.cppreference.com/w/cpp/container/queue/size.html',0,'std::queue::size()'],['http://en.cppreference.com/w/cpp/utility/bitset/size.html',0,'std::bitset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::size()'],['http://en.cppreference.com/w/cpp/container/priority_queue/size.html',0,'std::priority_queue::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/size.html',0,'std::unordered_multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::size()'],['http://en.cppreference.com/w/cpp/container/list/size.html',0,'std::list::size()'],['http://en.cppreference.com/w/cpp/container/map/size.html',0,'std::map::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::cmatch::size()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/size.html',0,'std::seed_seq::size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/size.html',0,'std::unordered_set::size()'],['http://en.cppreference.com/w/cpp/container/multimap/size.html',0,'std::multimap::size()'],['http://en.cppreference.com/w/cpp/container/array/size.html',0,'std::array::size()'],['../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3',1,'binary_search_tree::size()'],['../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54',1,'data_structures::Bitset::size()'],['../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c',1,'dsu::size()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39',1,'data_structures::stack_using_queue::Stack::size()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1',1,'divide_and_conquer::strassens_multiplication::Matrix::size()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865',1,'range_queries::perSegTree::size()']]], + ['skiplist_108',['SkipList',['../d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4',1,'data_structures::SkipList']]], + ['skipws_109',['skipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]], + ['sleep_110',['SLEEP',['../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6',1,'memory_game.cpp']]], + ['sleep_5ffor_111',['sleep_for',['http://en.cppreference.com/w/cpp/thread/sleep_for.html',0,'std::this_thread']]], + ['sleep_5funtil_112',['sleep_until',['http://en.cppreference.com/w/cpp/thread/sleep_until.html',0,'std::this_thread']]], + ['slice_113',['slice',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17',1,'divide_and_conquer::strassens_multiplication::Matrix']]], + ['smatch_114',['smatch',['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::smatch']]], + ['snextc_115',['snextc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_filebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wfilebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::strstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_streambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::filebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::streambuf::snextc()']]], + ['snprintf_116',['snprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['solution_117',['Solution',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4',1,'machine_learning::aystar_search::AyStarSearch']]], + ['solve_118',['solve',['../d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9',1,'backtracking::knight_tour']]], + ['solvemaze_119',['solveMaze',['../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3',1,'backtracking::rat_maze']]], + ['solvenq_120',['solveNQ',['../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb',1,'backtracking::n_queens']]], + ['solvesudoku_121',['solveSudoku',['../d3/d05/sudoku__solver_8cpp.html#ac911c8bca8556206ff64461b2424866b',1,'backtracking::sudoku_solver']]], + ['sort_122',['sort',['http://en.cppreference.com/w/cpp/container/forward_list/sort.html',0,'std::forward_list::sort()'],['http://en.cppreference.com/w/cpp/container/list/sort.html',0,'std::list::sort()'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180',1,'data_structures::list_array::list::sort()'],['http://en.cppreference.com/w/cpp/algorithm/sort.html',0,'std::sort(T... args)']]], + ['sort_5fheap_123',['sort_heap',['http://en.cppreference.com/w/cpp/algorithm/sort_heap.html',0,'std']]], + ['sortcol_124',['sortcol',['../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec',1,'fcfs_scheduling.cpp']]], + ['sphere_5fsurface_5farea_125',['sphere_surface_area',['../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656',1,'math']]], + ['sphere_5fvolume_126',['sphere_volume',['../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551',1,'math']]], + ['spiralprint_127',['spiralPrint',['../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197',1,'spiral_print.cpp']]], + ['spirograph_128',['spirograph',['../da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac',1,'spirograph']]], + ['splice_129',['splice',['http://en.cppreference.com/w/cpp/container/list/splice.html',0,'std::list']]], + ['splice_5fafter_130',['splice_after',['http://en.cppreference.com/w/cpp/container/forward_list/splice_after.html',0,'std::forward_list']]], + ['splitnode_131',['SplitNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9',1,'data_structures::tree_234::Tree234']]], + ['sprintf_132',['sprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['sputbackc_133',['sputbackc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wfilebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstreambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::strstreambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_streambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::streambuf::sputbackc()']]], + ['sputc_134',['sputc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::stringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wfilebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstreambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::strstreambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_stringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_streambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::streambuf::sputc()']]], + ['sputn_135',['sputn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_filebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wfilebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::strstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_streambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::filebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::streambuf::sputn()']]], + ['sqrt_136',['sqrt',['http://en.cppreference.com/w/cpp/numeric/math/sqrt.html',0,'std']]], + ['sqrt_137',['Sqrt',['../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc',1,'sqrt_double.cpp']]], + ['square_138',['square',['../d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153',1,'machine_learning::neural_network::util_functions']]], + ['square_5farea_139',['square_area',['../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049',1,'math']]], + ['square_5fperimeter_140',['square_perimeter',['../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14',1,'math']]], + ['srand_141',['srand',['http://en.cppreference.com/w/cpp/numeric/random/srand.html',0,'std']]], + ['sregex_5fiterator_142',['sregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::sregex_iterator']]], + ['sregex_5ftoken_5fiterator_143',['sregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::sregex_token_iterator']]], + ['sscanf_144',['sscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]], + ['ssub_5fmatch_145',['ssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::ssub_match']]], + ['stable_5fpartition_146',['stable_partition',['http://en.cppreference.com/w/cpp/algorithm/stable_partition.html',0,'std']]], + ['stable_5fsort_147',['stable_sort',['http://en.cppreference.com/w/cpp/algorithm/stable_sort.html',0,'std']]], + ['stack_148',['stack',['http://en.cppreference.com/w/cpp/container/stack/stack.html',0,'std::stack']]], + ['standard_5fdeviation_149',['standard_deviation',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2',1,'probability::geometric_dist::geometric_distribution']]], + ['standard_5finvsqrt_150',['Standard_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97',1,'inv_sqrt.cpp']]], + ['startwith_151',['startwith',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17',1,'data_structures::trie_using_hashmap::Trie']]], + ['state_152',['state',['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/state.html',0,'std::wbuffer_convert::state()'],['http://en.cppreference.com/w/cpp/locale/wstring_convert/state.html',0,'std::wstring_convert::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::wstreampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u16streampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::streampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::fpos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u32streampos::state()']]], + ['static_5fpointer_5fcast_153',['static_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], + ['std_154',['std',['../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1',1,'statistics::stats_computer1::std()'],['../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e',1,'statistics::stats_computer2::std()']]], + ['stddev_155',['stddev',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution']]], + ['step_5fith_156',['step_ith',['../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9',1,'sorting::radix_sort']]], + ['stod_157',['stod',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], + ['stof_158',['stof',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], + ['stoi_159',['stoi',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], + ['stol_160',['stol',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], + ['stold_161',['stold',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], + ['stoll_162',['stoll',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], + ['stoogesort_163',['stoogeSort',['../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b',1,'stooge_sort.cpp']]], + ['store_164',['store',['http://en.cppreference.com/w/cpp/atomic/atomic/store.html',0,'std::atomic']]], + ['stoul_165',['stoul',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]], + ['stoull_166',['stoull',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]], + ['str_167',['str',['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::match_results::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::basic_ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::wstringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wsmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::smatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::stringstream::str()'],['http://en.cppreference.com/w/cpp/io/strstreambuf/str.html',0,'std::strstreambuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wcmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::basic_stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::str()'],['http://en.cppreference.com/w/cpp/io/strstream/str.html',0,'std::strstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::basic_stringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::wostringstream::str()'],['http://en.cppreference.com/w/cpp/io/istrstream/str.html',0,'std::istrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::basic_istringstream::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::cmatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::istringstream::str()'],['http://en.cppreference.com/w/cpp/io/ostrstream/str.html',0,'std::ostrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::wstringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::wistringstream::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::str()']]], + ['strand_5fsort_168',['strand_sort',['../dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd',1,'sorting::strand']]], + ['strassens_5fmultiplication_169',['strassens_multiplication',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a',1,'divide_and_conquer::strassens_multiplication::Matrix']]], + ['strcat_170',['strcat',['http://en.cppreference.com/w/cpp/string/byte/strcat.html',0,'std']]], + ['strchr_171',['strchr',['http://en.cppreference.com/w/cpp/string/byte/strchr.html',0,'std']]], + ['strcmp_172',['strcmp',['http://en.cppreference.com/w/cpp/string/byte/strcmp.html',0,'std']]], + ['strcoll_173',['strcoll',['http://en.cppreference.com/w/cpp/string/byte/strcoll.html',0,'std']]], + ['strcpy_174',['strcpy',['http://en.cppreference.com/w/cpp/string/byte/strcpy.html',0,'std']]], + ['strcspn_175',['strcspn',['http://en.cppreference.com/w/cpp/string/byte/strcspn.html',0,'std']]], + ['streambuf_176',['streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::streambuf']]], + ['strerror_177',['strerror',['http://en.cppreference.com/w/cpp/string/byte/strerror.html',0,'std']]], + ['strftime_178',['strftime',['http://en.cppreference.com/w/cpp/chrono/c/strftime.html',0,'std']]], + ['string_179',['string',['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::string']]], + ['stringbuf_180',['stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::stringbuf']]], + ['stringstream_181',['stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::stringstream']]], + ['strlen_182',['strlen',['http://en.cppreference.com/w/cpp/string/byte/strlen.html',0,'std']]], + ['strncat_183',['strncat',['http://en.cppreference.com/w/cpp/string/byte/strncat.html',0,'std']]], + ['strncmp_184',['strncmp',['http://en.cppreference.com/w/cpp/string/byte/strncmp.html',0,'std']]], + ['strncpy_185',['strncpy',['http://en.cppreference.com/w/cpp/string/byte/strncpy.html',0,'std']]], + ['strpbrk_186',['strpbrk',['http://en.cppreference.com/w/cpp/string/byte/strpbrk.html',0,'std']]], + ['strrchr_187',['strrchr',['http://en.cppreference.com/w/cpp/string/byte/strrchr.html',0,'std']]], + ['strspn_188',['strspn',['http://en.cppreference.com/w/cpp/string/byte/strspn.html',0,'std']]], + ['strstr_189',['strstr',['http://en.cppreference.com/w/cpp/string/byte/strstr.html',0,'std']]], + ['strstream_190',['strstream',['http://en.cppreference.com/w/cpp/io/strstream/strstream.html',0,'std::strstream']]], + ['strstreambuf_191',['strstreambuf',['http://en.cppreference.com/w/cpp/io/strstreambuf/strstreambuf.html',0,'std::strstreambuf']]], + ['strtod_192',['strtod',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], + ['strtof_193',['strtof',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], + ['strtoimax_194',['strtoimax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]], + ['strtok_195',['strtok',['http://en.cppreference.com/w/cpp/string/byte/strtok.html',0,'std']]], + ['strtol_196',['strtol',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]], + ['strtold_197',['strtold',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], + ['strtoll_198',['strtoll',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]], + ['strtoul_199',['strtoul',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]], + ['strtoull_200',['strtoull',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]], + ['strtoumax_201',['strtoumax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]], + ['struzik_5fsearch_202',['struzik_search',['../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208',1,'exponential_search.cpp']]], + ['strxfrm_203',['strxfrm',['http://en.cppreference.com/w/cpp/string/byte/strxfrm.html',0,'std']]], + ['student_5ft_5fdistribution_204',['student_t_distribution',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/student_t_distribution.html',0,'std::student_t_distribution']]], + ['sub_5fmatch_205',['sub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::sub_match']]], + ['subarray_5fsum_206',['subarray_sum',['../df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e',1,'backtracking::subarray_sum']]], + ['sublistsearch_207',['sublistSearch',['../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c',1,'search::sublist_search']]], + ['subset_5fsum_5fproblem_208',['subset_sum_problem',['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50',1,'dynamic_programming::subset_sum']]], + ['subset_5fsum_5frecursion_209',['subset_sum_recursion',['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607',1,'dynamic_programming::subset_sum']]], + ['substr_210',['substr',['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::basic_string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::wstring::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u16string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u32string::substr()']]], + ['subtract_5fwith_5fcarry_5fengine_211',['subtract_with_carry_engine',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine']]], + ['succ_212',['succ',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3',1,'data_structures::linked_list::link']]], + ['suffix_213',['suffix',['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::match_results::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wsmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::smatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wcmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::cmatch::suffix()']]], + ['suggestautocomplete_214',['SuggestAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe',1,'operations_on_datastructures::trie_operations::Tnode']]], + ['suggestfreqautocomplete_215',['SuggestFreqAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c',1,'operations_on_datastructures::trie_operations::Tnode']]], + ['sum_216',['sum',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd',1,'range_queries::fenwick_tree::sum()'],['../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35',1,'machine_learning::sum()']]], + ['sum_5fof_5fdigits_217',['sum_of_digits',['../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395',1,'sum_of_digits.cpp']]], + ['sum_5fof_5fdivisor_218',['sum_of_divisor',['../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a',1,'math']]], + ['sum_5frange_219',['sum_range',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe',1,'range_queries::fenwick_tree']]], + ['summary_220',['summary',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931',1,'machine_learning::neural_network::NeuralNetwork']]], + ['sungetc_221',['sungetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wfilebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::strstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::streambuf::sungetc()']]], + ['swap_222',['swap',['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::fstream::swap()'],['http://en.cppreference.com/w/cpp/container/vector/swap.html',0,'std::vector::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::match_results::swap()'],['http://en.cppreference.com/w/cpp/container/multiset/swap.html',0,'std::multiset::swap()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/swap.html',0,'std::weak_ptr::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostream::swap()'],['http://en.cppreference.com/w/cpp/container/set/swap.html',0,'std::set::swap()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/swap.html',0,'std::unique_lock::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostringstream::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::regex::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_map/swap.html',0,'std::unordered_map::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::basic_regex::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_filebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstringbuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ios::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wsmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/tuple/swap.html',0,'std::tuple::swap()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/swap.html',0,'std::shared_ptr::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_fstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::stringbuf::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::wregex::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::smatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wfilebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::iostream::swap()'],['http://en.cppreference.com/w/cpp/container/stack/swap.html',0,'std::stack::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::stringstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/swap.html',0,'std::unordered_multimap::swap()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/swap.html',0,'std::unique_ptr::swap()'],['http://en.cppreference.com/w/cpp/container/forward_list/swap.html',0,'std::forward_list::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::strstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostream::swap()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/swap.html',0,'std::shared_lock::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wcmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/pair/swap.html',0,'std::pair::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wifstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_stringbuf::swap()'],['http://en.cppreference.com/w/cpp/container/deque/swap.html',0,'std::deque::swap()'],['http://en.cppreference.com/w/cpp/thread/promise/swap.html',0,'std::promise::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::strstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_streambuf::swap()'],['http://en.cppreference.com/w/cpp/container/queue/swap.html',0,'std::queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_stringstream::swap()'],['http://en.cppreference.com/w/cpp/thread/thread/swap.html',0,'std::thread::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::basic_string::swap()'],['http://en.cppreference.com/w/cpp/container/priority_queue/swap.html',0,'std::priority_queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostringstream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::wstring::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istrstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/swap.html',0,'std::unordered_multiset::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostream::swap()'],['http://en.cppreference.com/w/cpp/utility/functional/function/swap.html',0,'std::function::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::filebuf::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u16string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wiostream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u32string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/list/swap.html',0,'std::list::swap()'],['http://en.cppreference.com/w/cpp/container/map/swap.html',0,'std::map::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::cmatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::streambuf::swap()'],['http://en.cppreference.com/w/cpp/experimental/optional/swap.html',0,'std::experimental::optional::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostrstream::swap()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/swap.html',0,'std::packaged_task::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_set/swap.html',0,'std::unordered_set::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wfstream::swap()'],['http://en.cppreference.com/w/cpp/container/multimap/swap.html',0,'std::multimap::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_iostream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wstringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/array/swap.html',0,'std::array::swap()'],['http://en.cppreference.com/w/cpp/algorithm/swap.html',0,'std::swap(T... args)']]], + ['swap_5franges_223',['swap_ranges',['http://en.cppreference.com/w/cpp/algorithm/swap_ranges.html',0,'std']]], + ['swprintf_224',['swprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], + ['swscanf_225',['swscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]], + ['sync_226',['sync',['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::strstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istrstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wiostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_ifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wfstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wstringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::ifstream::sync()']]], + ['sync_5fwith_5fstdio_227',['sync_with_stdio',['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ios::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ios_base::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::strstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wiostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wfstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wstringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ifstream::sync_with_stdio()']]], + ['system_228',['system',['http://en.cppreference.com/w/cpp/utility/program/system.html',0,'std']]], + ['system_5fcategory_229',['system_category',['http://en.cppreference.com/w/cpp/error/system_category.html',0,'std']]], + ['system_5ferror_230',['system_error',['http://en.cppreference.com/w/cpp/error/system_error/system_error.html',0,'std::system_error']]] ]; diff --git a/search/functions_14.js b/search/functions_14.js index d8609427f..138256fb8 100644 --- a/search/functions_14.js +++ b/search/functions_14.js @@ -2,24 +2,24 @@ var searchData= [ ['t_0',['t',['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/params.html',0,'std::binomial_distribution']]], ['tan_1',['tan',['http://en.cppreference.com/w/cpp/numeric/math/tan.html',0,'std']]], - ['tanh_2',['tanh',['../d2/d58/neural__network_8cpp.html#a371aa7dd5d5add0143d1756bb0a1b32f',1,'machine_learning::neural_network::activations::tanh()'],['http://en.cppreference.com/w/cpp/numeric/math/tanh.html',0,'std::tanh()']]], + ['tanh_2',['tanh',['http://en.cppreference.com/w/cpp/numeric/math/tanh.html',0,'std::tanh()'],['../d2/d58/neural__network_8cpp.html#a371aa7dd5d5add0143d1756bb0a1b32f',1,'machine_learning::neural_network::activations::tanh()']]], ['target_3',['target',['http://en.cppreference.com/w/cpp/utility/functional/function/target.html',0,'std::function']]], ['target_5ftype_4',['target_type',['http://en.cppreference.com/w/cpp/utility/functional/function/target_type.html',0,'std::function']]], - ['tellg_5',['tellg',['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::strstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istrstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wiostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_ifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wfstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wstringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::ifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istringstream::tellg()']]], - ['tellp_6',['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()'],['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::basic_ofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wostream::tellp()']]], + ['tellg_5',['tellg',['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::strstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istrstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wiostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_ifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wfstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wstringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::ifstream::tellg()']]], + ['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',['../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inv_sqrt.cpp'],['../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_right_rotation.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): bogo_sort.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): binary_insertion_sort.cpp'],['../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): text_search.cpp'],['../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sublist_search.cpp'],['../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): saddleback_search.cpp'],['../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): median_search2.cpp'],['../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): median_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): floyd_cycle_detection_algo.cpp'],['../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segtree.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): prefix_sum_array.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): persistent_seg_tree_lazy_prop.cpp'],['../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601',1,'test(const std::vector< int > &vals, int windowSize): windowed_median.cpp'],['../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): geometric_dist.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): ground_to_ground_projectile_motion.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): smallest_circle.cpp'],['../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kadanes3.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): union_of_two_arrays.cpp'],['../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_multiple_search.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_binary_tree.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): intersection_of_two_arrays.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inorder_successor_of_bst.cpp'],['../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): circular_linked_list.cpp'],['../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cycle_sort.cpp'],['../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_left_rotation.cpp'],['../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rungekutta.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'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inverse_fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gram_schmidt.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fast_fourier_transform.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'],['../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): babylonian_method.cpp'],['../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): volume.cpp'],['../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): vector_cross_product.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): sum_of_digits.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sum_of_binomial_coefficient.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): quadratic_equations_complex_numbers.cpp'],['../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_two.cpp'],['../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): perimeter.cpp'],['../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_choose_r.cpp'],['../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_bonacci.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_inverse_simple.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_exponentiation.cpp'],['../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_division.cpp'],['../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lcm_sum.cpp'],['../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): largest_power.cpp'],['../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): iterative_factorial.cpp'],['../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): integral_approximation2.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci_sum.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): fibonacci_matrix_exponentiation.cpp'],['../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci.cpp'],['../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eulers_totient_function.cpp'],['../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eratosthenes.cpp'],['../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981',1,'test(uint64_t n, uint64_t expected): double_factorial.cpp'],['../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): area.cpp'],['../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): aliquot_sum.cpp'],['../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): neural_network.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): k_nearest_neighbors.cpp'],['../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sha1.cpp'],['../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): md5.cpp'],['../df/d64/jumpgame_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jumpgame.cpp'],['../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99',1,'spirograph::test()'],['../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): is_graph_bipartite.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): connected_components_with_dsu.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jarvis_algorithm.cpp'],['../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): word_break.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): shortest_common_supersequence.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): palindrome_partitioning.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): minimum_edit_distance.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): maximum_circular_subarray.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_palindromic_subsequence.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_increasing_subsequence.cpp'],['../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): house_robber.cpp'],['../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cut_rod.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): coin_change_topdown.cpp'],['../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): abbreviation.cpp'],['../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): 0_1_knapsack.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_using_hashmap.cpp'],['../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_tree.cpp'],['../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): treap.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sparse_table.cpp'],['../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segment_tree.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_a_linked_list.cpp'],['../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): list_array.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fcfs_scheduling.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): xor_cipher.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): vigenere_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): morse_code.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): elliptic_curve_key_exchange.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): caesar_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): atbash_cipher.cpp'],['../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): a1z26_cipher.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): travelling_salesman_using_bit_manipulation.cpp'],['../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): set_kth_bit.cpp'],['../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): z_function.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): manacher_algorithm.cpp'],['../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): horspool.cpp'],['../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test(): wiggle_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wave_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): strand_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): selection_sort_recursive.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): recursive_bubble_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): random_pivot_quick_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): pancake_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): merge_insertion_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): heap_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gnome_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): dnf_sort.cpp'],['../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_2.cpp'],['../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_inversions.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'],['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['http://en.cppreference.com/w/cpp/utility/bitset/test.html',0,'std::bitset::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']]], - ['test1_10',['test1',['../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'],['../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']]], - ['test2_11',['test2',['../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): lu_decompose.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): stooge_sort.cpp'],['../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'],['../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): smallest_circle.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']]], - ['test3_12',['test3',['../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): recursive_tree_traversal.cpp'],['../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76',1,'tests::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'],['../d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): stooge_sort.cpp'],['../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'],['../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): smallest_circle.cpp']]], - ['test4_13',['test4',['../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2',1,'test4(): iterative_tree_traversals.cpp'],['../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d',1,'tests::test4()']]], - ['test5_14',['test5',['../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86',1,'tests::test5()'],['../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8',1,'test5(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root): iterative_tree_traversals.cpp']]], - ['test6_15',['test6',['../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89',1,'test6(): iterative_tree_traversals.cpp'],['../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2',1,'tests::test6()']]], - ['test_5f1_16',['test_1',['../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1(): heavy_light_decomposition.cpp'],['../d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4',1,'lru_tests::test_1()'],['../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1(): pigeonhole_sort.cpp']]], - ['test_5f2_17',['test_2',['../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2(): heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2(): pigeonhole_sort.cpp'],['../d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec',1,'lru_tests::test_2()']]], + ['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'],['../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()'],['../df/d64/jumpgame_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jumpgame.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']]], + ['test4_13',['test4',['../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d',1,'tests::test4()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2',1,'test4(): iterative_tree_traversals.cpp']]], + ['test5_14',['test5',['../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86',1,'tests::test5()'],['../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8',1,'test5(): iterative_tree_traversals.cpp']]], + ['test6_15',['test6',['../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2',1,'tests::test6()'],['../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89',1,'test6(): iterative_tree_traversals.cpp']]], + ['test_5f1_16',['test_1',['../d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4',1,'lru_tests::test_1()'],['../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1(): heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1(): pigeonhole_sort.cpp']]], + ['test_5f2_17',['test_2',['../d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec',1,'lru_tests::test_2()'],['../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2(): heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2(): pigeonhole_sort.cpp']]], ['test_5f2d_5fclasses_18',['test_2d_classes',['../d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9',1,'kohonen_som_topology.cpp']]], - ['test_5f3_19',['test_3',['../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3(): pigeonhole_sort.cpp'],['../d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0',1,'lru_tests::test_3()'],['../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3(): heavy_light_decomposition.cpp']]], + ['test_5f3_19',['test_3',['../d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0',1,'lru_tests::test_3()'],['../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3(): heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3(): pigeonhole_sort.cpp']]], ['test_5f3d_5fclasses_20',['test_3d_classes',['../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d',1,'kohonen_som_trace.cpp']]], ['test_5f3d_5fclasses1_21',['test_3d_classes1',['../d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e',1,'kohonen_som_topology.cpp']]], ['test_5f3d_5fclasses2_22',['test_3d_classes2',['../d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653',1,'kohonen_som_topology.cpp']]], @@ -49,16 +49,16 @@ var searchData= ['test_5flongest_5fcommon_5fstring_5flength_5ffor_5freversed_5finputs_46',['test_longest_common_string_length_for_reversed_inputs',['../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe',1,'longest_common_string.cpp']]], ['test_5flongest_5fcommon_5fstring_5flength_5fis_5fsymmetric_47',['test_longest_common_string_length_is_symmetric',['../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155',1,'longest_common_string.cpp']]], ['test_5fremove_48',['test_remove',['../df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e',1,'binary_search_tree2.cpp']]], - ['testcase_5f1_49',['testcase_1',['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()']]], - ['testcase_5f2_50',['testcase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]], - ['testcase_5f3_51',['testcase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]], - ['tests_52',['tests',['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): sieve_of_eratosthenes.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#af0a3e6827f41c151e47451f5ff98b1f1',1,'tests(math::ncr_modulo_p::NCRModuloP ncrObj): ncr_modulo_p.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp']]], + ['testcase_5f1_49',['testCase_1',['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()']]], + ['testcase_5f2_50',['testCase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]], + ['testcase_5f3_51',['testCase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]], + ['tests_52',['tests',['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#af0a3e6827f41c151e47451f5ff98b1f1',1,'tests(math::ncr_modulo_p::NCRModuloP ncrObj): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp']]], ['tgamma_53',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]], ['th_54',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]], - ['thousands_5fsep_55',['thousands_sep',['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::thousands_sep()']]], + ['thousands_5fsep_55',['thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::thousands_sep()']]], ['thread_56',['thread',['http://en.cppreference.com/w/cpp/thread/thread/thread.html',0,'std::thread']]], ['throw_5fwith_5fnested_57',['throw_with_nested',['http://en.cppreference.com/w/cpp/error/throw_with_nested.html',0,'std']]], - ['tie_58',['tie',['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistream::tie()'],['http://en.cppreference.com/w/cpp/utility/tuple/tie.html',0,'std::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ios::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::strstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wiostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wstringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wfstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ofstream::tie()']]], + ['tie_58',['tie',['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ios::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::strstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wiostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wfstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wstringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ifstream::tie()'],['http://en.cppreference.com/w/cpp/utility/tuple/tie.html',0,'std::tie(T... args)']]], ['time_59',['time',['http://en.cppreference.com/w/cpp/chrono/c/time.html',0,'std']]], ['time_5fget_60',['time_get',['http://en.cppreference.com/w/cpp/locale/time_get/time_get.html',0,'std::time_get']]], ['time_5fget_5fbyname_61',['time_get_byname',['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std::time_get_byname']]], @@ -74,7 +74,7 @@ var searchData= ['to_5fbytes_71',['to_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/to_bytes.html',0,'std::wstring_convert']]], ['to_5fchar_5ftype_72',['to_char_type',['http://en.cppreference.com/w/cpp/string/char_traits/to_char_type.html',0,'std::char_traits']]], ['to_5fint_5ftype_73',['to_int_type',['http://en.cppreference.com/w/cpp/string/char_traits/to_int_type.html',0,'std::char_traits']]], - ['to_5fstring_74',['to_string',['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08',1,'hashing::sha256::Hash::to_string()'],['http://en.cppreference.com/w/cpp/string/basic_string/to_string.html',0,'std::to_string()'],['http://en.cppreference.com/w/cpp/utility/bitset/to_string.html',0,'std::bitset::to_string()']]], + ['to_5fstring_74',['to_string',['http://en.cppreference.com/w/cpp/utility/bitset/to_string.html',0,'std::bitset::to_string()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08',1,'hashing::sha256::Hash::to_string()'],['http://en.cppreference.com/w/cpp/string/basic_string/to_string.html',0,'std::to_string()']]], ['to_5ftime_5ft_75',['to_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/to_time_t.html',0,'std::chrono::system_clock']]], ['to_5fullong_76',['to_ullong',['http://en.cppreference.com/w/cpp/utility/bitset/to_ullong.html',0,'std::bitset']]], ['to_5fulong_77',['to_ulong',['http://en.cppreference.com/w/cpp/utility/bitset/to_ulong.html',0,'std::bitset']]], @@ -83,42 +83,44 @@ var searchData= ['tolittleendian64_80',['toLittleEndian64',['../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef',1,'hashing::md5']]], ['tolower_81',['tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::tolower()'],['http://en.cppreference.com/w/cpp/string/byte/tolower.html',0,'std::tolower()']]], ['tolowerroman_82',['tolowerRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d',1,'decimal_to_roman_numeral.cpp']]], - ['top_83',['top',['http://en.cppreference.com/w/cpp/container/priority_queue/top.html',0,'std::priority_queue::top()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7',1,'data_structures::stack_using_queue::Stack::top()'],['http://en.cppreference.com/w/cpp/container/stack/top.html',0,'std::stack::top()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a89ad00dbd262e2527129813b53e16f81',1,'data_structures::linked_list::list::top()'],['../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709',1,'stack::top()']]], - ['toupper_84',['toupper',['http://en.cppreference.com/w/cpp/string/byte/toupper.html',0,'std::toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::toupper()']]], + ['top_83',['top',['http://en.cppreference.com/w/cpp/container/stack/top.html',0,'std::stack::top()'],['http://en.cppreference.com/w/cpp/container/priority_queue/top.html',0,'std::priority_queue::top()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a89ad00dbd262e2527129813b53e16f81',1,'data_structures::linked_list::list::top()'],['../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709',1,'stack::top()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7',1,'data_structures::stack_using_queue::Stack::top()']]], + ['toupper_84',['toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::toupper()'],['http://en.cppreference.com/w/cpp/string/byte/toupper.html',0,'std::toupper()']]], ['toupperroman_85',['toupperRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979',1,'decimal_to_roman_numeral.cpp']]], ['tovector_86',['toVector',['../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d',1,'queue']]], ['towctrans_87',['towctrans',['http://en.cppreference.com/w/cpp/string/wide/towctrans.html',0,'std']]], ['towlower_88',['towlower',['http://en.cppreference.com/w/cpp/string/wide/towlower.html',0,'std']]], ['towupper_89',['towupper',['http://en.cppreference.com/w/cpp/string/wide/towupper.html',0,'std']]], - ['transform_90',['transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::transform()'],['http://en.cppreference.com/w/cpp/algorithm/transform.html',0,'std::transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::transform()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/transform.html',0,'std::regex_traits::transform(T... args)']]], + ['transform_90',['transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::transform()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/transform.html',0,'std::regex_traits::transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::transform()'],['http://en.cppreference.com/w/cpp/algorithm/transform.html',0,'std::transform()']]], ['transform_5fprimary_91',['transform_primary',['http://en.cppreference.com/w/cpp/regex/regex_traits/transform_primary.html',0,'std::regex_traits']]], ['translate_92',['translate',['http://en.cppreference.com/w/cpp/regex/regex_traits/translate.html',0,'std::regex_traits']]], ['translate_5fnocase_93',['translate_nocase',['http://en.cppreference.com/w/cpp/regex/regex_traits/translate_nocase.html',0,'std::regex_traits']]], ['transpose_94',['transpose',['../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a',1,'machine_learning']]], ['travelling_5fsalesman_5fusing_5fbit_5fmanipulation_95',['travelling_salesman_using_bit_manipulation',['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1',1,'bit_manipulation::travelling_salesman_using_bit_manipulation']]], ['travellingsalesmanproblem_96',['TravellingSalesmanProblem',['../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346',1,'graph']]], - ['traverse_97',['traverse',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd',1,'data_structures::tree_234::Tree234::Traverse()'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a936bb546e6a94d8b9d35b30ee1bb291a',1,'data_structures::tree_234::Tree234::Traverse(Node *tree)'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#aaca3be50a2a81bf3308d202a6dcee91a',1,'data_structures::linked_list::list::traverse()']]], - ['traverse_5finorder_98',['traverse_inorder',['../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd',1,'binary_search_tree']]], - ['traverse_5fpostorder_99',['traverse_postorder',['../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362',1,'binary_search_tree']]], - ['traverse_5fpreorder_100',['traverse_preorder',['../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1',1,'binary_search_tree']]], - ['treap_101',['Treap',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683',1,'data_structures::treap::Treap']]], - ['tree_102',['Tree',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1',1,'range_queries::heavy_light_decomposition::Tree']]], - ['triangle_5farea_103',['triangle_area',['../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc',1,'math']]], - ['triangle_5fperimeter_104',['triangle_perimeter',['../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3',1,'math']]], - ['triangle_5fprism_5fvolume_105',['triangle_prism_volume',['../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c',1,'math']]], - ['trianglearea_106',['TriangleArea',['../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc',1,'smallest_circle.cpp']]], - ['trie_107',['trie',['../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8',1,'data_structures::trie::trie()'],['../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908',1,'Trie::Trie()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a092d0805a9e647c2048777dbe67b35ab',1,'data_structures::trie_using_hashmap::Trie::Trie()']]], - ['truename_108',['truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::truename()']]], - ['trunc_109',['trunc',['http://en.cppreference.com/w/cpp/numeric/math/trunc.html',0,'std']]], - ['try_5flock_110',['try_lock',['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock.html',0,'std::timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock.html',0,'std::shared_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock.html',0,'std::recursive_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/try_lock.html',0,'std::recursive_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock.html',0,'std::unique_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/try_lock.html',0,'std::mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock.html',0,'std::shared_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/try_lock.html',0,'std::try_lock()']]], - ['try_5flock_5ffor_111',['try_lock_for',['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_for.html',0,'std::shared_lock::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_for.html',0,'std::recursive_timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_for.html',0,'std::timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_for.html',0,'std::shared_timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_for.html',0,'std::unique_lock::try_lock_for()']]], - ['try_5flock_5fshared_112',['try_lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared.html',0,'std::shared_timed_mutex']]], - ['try_5flock_5fshared_5ffor_113',['try_lock_shared_for',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_for.html',0,'std::shared_timed_mutex']]], - ['try_5flock_5fshared_5funtil_114',['try_lock_shared_until',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_until.html',0,'std::shared_timed_mutex']]], - ['try_5flock_5funtil_115',['try_lock_until',['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_until.html',0,'std::timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_until.html',0,'std::unique_lock::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_until.html',0,'std::recursive_timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_until.html',0,'std::shared_lock::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_until.html',0,'std::shared_timed_mutex::try_lock_until()']]], - ['tryleftrotate_116',['TryLeftRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9',1,'data_structures::tree_234::Tree234']]], - ['tryrightrotate_117',['TryRightRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3',1,'data_structures::tree_234::Tree234']]], - ['tuple_118',['tuple',['http://en.cppreference.com/w/cpp/utility/tuple/tuple.html',0,'std::tuple']]], - ['tuple_5fcat_119',['tuple_cat',['http://en.cppreference.com/w/cpp/utility/tuple/tuple_cat.html',0,'std']]], - ['type_5findex_120',['type_index',['http://en.cppreference.com/w/cpp/types/type_index/type_index.html',0,'std::type_index']]] + ['traverse_97',['Traverse',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd',1,'data_structures::tree_234::Tree234::Traverse()'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a936bb546e6a94d8b9d35b30ee1bb291a',1,'data_structures::tree_234::Tree234::Traverse(Node *tree)']]], + ['traverse_98',['traverse',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#aaca3be50a2a81bf3308d202a6dcee91a',1,'data_structures::linked_list::list']]], + ['traverse_5finorder_99',['traverse_inorder',['../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd',1,'binary_search_tree']]], + ['traverse_5fpostorder_100',['traverse_postorder',['../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362',1,'binary_search_tree']]], + ['traverse_5fpreorder_101',['traverse_preorder',['../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1',1,'binary_search_tree']]], + ['treap_102',['Treap',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683',1,'data_structures::treap::Treap']]], + ['tree_103',['Tree',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1',1,'range_queries::heavy_light_decomposition::Tree']]], + ['triangle_5farea_104',['triangle_area',['../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc',1,'math']]], + ['triangle_5fperimeter_105',['triangle_perimeter',['../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3',1,'math']]], + ['triangle_5fprism_5fvolume_106',['triangle_prism_volume',['../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c',1,'math']]], + ['trianglearea_107',['TriangleArea',['../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc',1,'smallest_circle.cpp']]], + ['trie_108',['Trie',['../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908',1,'Trie::Trie()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a092d0805a9e647c2048777dbe67b35ab',1,'data_structures::trie_using_hashmap::Trie::Trie()']]], + ['trie_109',['trie',['../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8',1,'data_structures::trie']]], + ['truename_110',['truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::truename()']]], + ['trunc_111',['trunc',['http://en.cppreference.com/w/cpp/numeric/math/trunc.html',0,'std']]], + ['try_5flock_112',['try_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock.html',0,'std::unique_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/try_lock.html',0,'std::recursive_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock.html',0,'std::recursive_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock.html',0,'std::shared_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock.html',0,'std::timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/try_lock.html',0,'std::mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock.html',0,'std::shared_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/try_lock.html',0,'std::try_lock()']]], + ['try_5flock_5ffor_113',['try_lock_for',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_for.html',0,'std::unique_lock::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_for.html',0,'std::recursive_timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_for.html',0,'std::shared_lock::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_for.html',0,'std::timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_for.html',0,'std::shared_timed_mutex::try_lock_for(T... args)']]], + ['try_5flock_5fshared_114',['try_lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared.html',0,'std::shared_timed_mutex']]], + ['try_5flock_5fshared_5ffor_115',['try_lock_shared_for',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_for.html',0,'std::shared_timed_mutex']]], + ['try_5flock_5fshared_5funtil_116',['try_lock_shared_until',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_until.html',0,'std::shared_timed_mutex']]], + ['try_5flock_5funtil_117',['try_lock_until',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_until.html',0,'std::unique_lock::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_until.html',0,'std::recursive_timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_until.html',0,'std::shared_lock::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_until.html',0,'std::timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_until.html',0,'std::shared_timed_mutex::try_lock_until()']]], + ['tryleftrotate_118',['TryLeftRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9',1,'data_structures::tree_234::Tree234']]], + ['tryrightrotate_119',['TryRightRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3',1,'data_structures::tree_234::Tree234']]], + ['tuple_120',['tuple',['http://en.cppreference.com/w/cpp/utility/tuple/tuple.html',0,'std::tuple']]], + ['tuple_5fcat_121',['tuple_cat',['http://en.cppreference.com/w/cpp/utility/tuple/tuple_cat.html',0,'std']]], + ['type_5findex_122',['type_index',['http://en.cppreference.com/w/cpp/types/type_index/type_index.html',0,'std::type_index']]] ]; diff --git a/search/functions_15.js b/search/functions_15.js index 8c5b4c4b1..c397381e8 100644 --- a/search/functions_15.js +++ b/search/functions_15.js @@ -5,16 +5,16 @@ var searchData= ['uflow_2',['uflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_filebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wstringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::stringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wfilebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wstreambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::strstreambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_stringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_streambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::filebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::streambuf::uflow()']]], ['uint128_5ft_3',['uint128_t',['../db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040',1,'uint128_t::uint128_t(T low)'],['../db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac',1,'uint128_t::uint128_t(const std::string &str)'],['../db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d',1,'uint128_t::uint128_t(const uint64_t high, const uint64_t low)'],['../db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b',1,'uint128_t::uint128_t(const uint128_t &num)=default'],['../db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c',1,'uint128_t::uint128_t(uint128_t &&num) noexcept']]], ['uint128_5ft_5ftests_4',['uint128_t_tests',['../df/d2c/elliptic__curve__key__exchange_8cpp.html#a8800c8a84d77dadadb05ad5e83b77ef4',1,'elliptic_curve_key_exchange.cpp']]], - ['uint256_5ft_5',['uint256_t',['../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39',1,'uint256_t::uint256_t(const std::string &str)'],['../d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e',1,'uint256_t::uint256_t(const uint256_t &num)=default'],['../d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa',1,'uint256_t::uint256_t(uint256_t &&num) noexcept'],['../d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3',1,'uint256_t::uint256_t(uint128_t high, uint128_t low)'],['../d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052',1,'uint256_t::uint256_t(const uint64_t high, const uint64_t low)'],['../d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc',1,'uint256_t::uint256_t(T low)']]], + ['uint256_5ft_5',['uint256_t',['../d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc',1,'uint256_t::uint256_t(T low)'],['../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39',1,'uint256_t::uint256_t(const std::string &str)'],['../d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e',1,'uint256_t::uint256_t(const uint256_t &num)=default'],['../d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa',1,'uint256_t::uint256_t(uint256_t &&num) noexcept'],['../d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3',1,'uint256_t::uint256_t(uint128_t high, uint128_t low)'],['../d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052',1,'uint256_t::uint256_t(const uint64_t high, const uint64_t low)']]], ['uint256_5ft_5ftests_6',['uint256_t_tests',['../df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae',1,'elliptic_curve_key_exchange.cpp']]], ['unary_5fnegate_7',['unary_negate',['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate']]], ['uncaught_5fexception_8',['uncaught_exception',['http://en.cppreference.com/w/cpp/error/uncaught_exception.html',0,'std']]], ['undeclare_5fno_5fpointers_9',['undeclare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_no_pointers.html',0,'std']]], ['undeclare_5freachable_10',['undeclare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_reachable.html',0,'std']]], - ['underflow_11',['underflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_streambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::streambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::strstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wfilebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_filebuf::underflow()']]], + ['underflow_11',['underflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wfilebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::strstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_streambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::streambuf::underflow()']]], ['underflow_5ferror_12',['underflow_error',['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std::underflow_error']]], ['unexpected_13',['unexpected',['http://en.cppreference.com/w/cpp/error/unexpected.html',0,'std']]], - ['unget_14',['unget',['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::strstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istrstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wiostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wfstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wstringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::ifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_ifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistream::unget()']]], + ['unget_14',['unget',['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::strstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istrstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wiostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_ifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wfstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wstringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::ifstream::unget()']]], ['ungetc_15',['ungetc',['http://en.cppreference.com/w/cpp/io/c/ungetc.html',0,'std']]], ['ungetwc_16',['ungetwc',['http://en.cppreference.com/w/cpp/io/c/ungetwc.html',0,'std']]], ['uniform_5fint_5fdistribution_17',['uniform_int_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/uniform_int_distribution.html',0,'std::uniform_int_distribution']]], @@ -26,28 +26,29 @@ var searchData= ['uninitialized_5ffill_5fn_23',['uninitialized_fill_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill_n.html',0,'std']]], ['union_24',['Union',['../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757',1,'disjoint_set.cpp']]], ['union_5fsets_25',['union_sets',['../d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145',1,'graph::disjoint_union']]], - ['unionset_26',['unionset',['../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f',1,'dsu::unionSet(uint64_t i, uint64_t j)'],['../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559',1,'dsu::UnionSet(uint64_t i, uint64_t j)']]], - ['unique_27',['unique',['http://en.cppreference.com/w/cpp/memory/shared_ptr/unique.html',0,'std::shared_ptr::unique()'],['http://en.cppreference.com/w/cpp/algorithm/unique.html',0,'std::unique()'],['http://en.cppreference.com/w/cpp/container/forward_list/unique.html',0,'std::forward_list::unique()'],['http://en.cppreference.com/w/cpp/container/list/unique.html',0,'std::list::unique()']]], - ['unique_5fcopy_28',['unique_copy',['http://en.cppreference.com/w/cpp/algorithm/unique_copy.html',0,'std']]], - ['unique_5flock_29',['unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unique_lock.html',0,'std::unique_lock']]], - ['unique_5fptr_30',['unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr/unique_ptr.html',0,'std::unique_ptr']]], - ['unit_5fmatrix_5finitialization_31',['unit_matrix_initialization',['../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4',1,'machine_learning']]], - ['unitbuf_32',['unitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], - ['unlock_33',['unlock',['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/unlock.html',0,'std::recursive_timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/unlock.html',0,'std::timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/unlock.html',0,'std::shared_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/unlock.html',0,'std::unique_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/unlock.html',0,'std::recursive_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/mutex/unlock.html',0,'std::mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock.html',0,'std::shared_timed_mutex::unlock(T... args)']]], - ['unlock_5fshared_34',['unlock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock_shared.html',0,'std::shared_timed_mutex']]], - ['unordered_5fmap_35',['unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map/unordered_map.html',0,'std::unordered_map']]], - ['unordered_5fmultimap_36',['unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap/unordered_multimap.html',0,'std::unordered_multimap']]], - ['unordered_5fmultiset_37',['unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset/unordered_multiset.html',0,'std::unordered_multiset']]], - ['unordered_5fset_38',['unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set/unordered_set.html',0,'std::unordered_set']]], - ['unsetf_39',['unsetf',['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wiostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wfstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wstringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ios::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ios_base::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::strstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ofstream::unsetf()']]], - ['unshift_40',['unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::unshift()']]], - ['update_41',['update',['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3',1,'hashing::sha256::Hash::update()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6',1,'range_queries::perSegTree::update()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57',1,'range_queries::heavy_light_decomposition::HLD::update()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c',1,'range_queries::heavy_light_decomposition::SG::update()'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9',1,'range_queries::fenwick_tree::update()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d',1,'range_queries::perSegTree::update()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7',1,'data_structures::treap::Treap::update()'],['../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17',1,'data_structures::SegmentTree::update(int pos, T val)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1',1,'data_structures::SegmentTree::update(int i, int l, int r, int pos, T val)'],['../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0',1,'update(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos): segtree.cpp']]], - ['update_5fstep_42',['update_step',['../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217',1,'extended_euclid_algorithm.cpp']]], - ['update_5fweights_43',['update_weights',['../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631',1,'machine_learning::update_weights(const std::valarray< double > &x, std::vector< std::valarray< double > > *W, std::valarray< double > *D, double alpha, int R)'],['../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3',1,'machine_learning::update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)']]], - ['upper_44',['upper',['../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5',1,'uint256_t::upper()'],['../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705',1,'uint128_t::upper()']]], - ['upper_5fbound_45',['upper_bound',['http://en.cppreference.com/w/cpp/container/map/upper_bound.html',0,'std::map::upper_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/upper_bound.html',0,'std::multimap::upper_bound()'],['http://en.cppreference.com/w/cpp/algorithm/upper_bound.html',0,'std::upper_bound()'],['http://en.cppreference.com/w/cpp/container/set/upper_bound.html',0,'std::set::upper_bound()'],['http://en.cppreference.com/w/cpp/container/multiset/upper_bound.html',0,'std::multiset::upper_bound()']]], - ['uppercase_46',['uppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], - ['use_5fcount_47',['use_count',['http://en.cppreference.com/w/cpp/memory/weak_ptr/use_count.html',0,'std::weak_ptr']]], - ['use_5ffacet_48',['use_facet',['http://en.cppreference.com/w/cpp/locale/use_facet.html',0,'std']]], - ['user_5finput_5ftest_49',['user_input_test',['../d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc',1,'power_of_two.cpp']]] + ['unionset_26',['unionSet',['../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f',1,'dsu']]], + ['unionset_27',['UnionSet',['../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559',1,'dsu']]], + ['unique_28',['unique',['http://en.cppreference.com/w/cpp/memory/shared_ptr/unique.html',0,'std::shared_ptr::unique()'],['http://en.cppreference.com/w/cpp/container/forward_list/unique.html',0,'std::forward_list::unique()'],['http://en.cppreference.com/w/cpp/container/list/unique.html',0,'std::list::unique()'],['http://en.cppreference.com/w/cpp/algorithm/unique.html',0,'std::unique(T... args)']]], + ['unique_5fcopy_29',['unique_copy',['http://en.cppreference.com/w/cpp/algorithm/unique_copy.html',0,'std']]], + ['unique_5flock_30',['unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unique_lock.html',0,'std::unique_lock']]], + ['unique_5fptr_31',['unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr/unique_ptr.html',0,'std::unique_ptr']]], + ['unit_5fmatrix_5finitialization_32',['unit_matrix_initialization',['../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4',1,'machine_learning']]], + ['unitbuf_33',['unitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], + ['unlock_34',['unlock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unlock.html',0,'std::unique_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/unlock.html',0,'std::recursive_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/unlock.html',0,'std::recursive_timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/unlock.html',0,'std::shared_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/unlock.html',0,'std::timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/mutex/unlock.html',0,'std::mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock.html',0,'std::shared_timed_mutex::unlock(T... args)']]], + ['unlock_5fshared_35',['unlock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock_shared.html',0,'std::shared_timed_mutex']]], + ['unordered_5fmap_36',['unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map/unordered_map.html',0,'std::unordered_map']]], + ['unordered_5fmultimap_37',['unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap/unordered_multimap.html',0,'std::unordered_multimap']]], + ['unordered_5fmultiset_38',['unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset/unordered_multiset.html',0,'std::unordered_multiset']]], + ['unordered_5fset_39',['unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set/unordered_set.html',0,'std::unordered_set']]], + ['unsetf_40',['unsetf',['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ios::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ios_base::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::strstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wiostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wfstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wstringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ifstream::unsetf()']]], + ['unshift_41',['unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::unshift()']]], + ['update_42',['update',['../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1',1,'data_structures::SegmentTree::update(int i, int l, int r, int pos, T val)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17',1,'data_structures::SegmentTree::update(int pos, T val)'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7',1,'data_structures::treap::Treap::update()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3',1,'hashing::sha256::Hash::update()'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9',1,'range_queries::fenwick_tree::update()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c',1,'range_queries::heavy_light_decomposition::SG::update()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57',1,'range_queries::heavy_light_decomposition::HLD::update()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6',1,'range_queries::perSegTree::update(const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, const int64_t &value, std::shared_ptr< Node > const &curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d',1,'range_queries::perSegTree::update(const uint32_t &l, const uint32_t &r, const int64_t &value)'],['../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0',1,'update(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos): segtree.cpp']]], + ['update_5fstep_43',['update_step',['../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217',1,'extended_euclid_algorithm.cpp']]], + ['update_5fweights_44',['update_weights',['../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3',1,'machine_learning::update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double > > > *W, std::vector< std::valarray< double > > *D, double alpha, int R)'],['../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631',1,'machine_learning::update_weights(const std::valarray< double > &x, std::vector< std::valarray< double > > *W, std::valarray< double > *D, double alpha, int R)']]], + ['upper_45',['upper',['../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705',1,'uint128_t::upper()'],['../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5',1,'uint256_t::upper()']]], + ['upper_5fbound_46',['upper_bound',['http://en.cppreference.com/w/cpp/container/multiset/upper_bound.html',0,'std::multiset::upper_bound()'],['http://en.cppreference.com/w/cpp/container/set/upper_bound.html',0,'std::set::upper_bound()'],['http://en.cppreference.com/w/cpp/container/map/upper_bound.html',0,'std::map::upper_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/upper_bound.html',0,'std::multimap::upper_bound()'],['http://en.cppreference.com/w/cpp/algorithm/upper_bound.html',0,'std::upper_bound(T... args)']]], + ['uppercase_47',['uppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], + ['use_5fcount_48',['use_count',['http://en.cppreference.com/w/cpp/memory/weak_ptr/use_count.html',0,'std::weak_ptr']]], + ['use_5ffacet_49',['use_facet',['http://en.cppreference.com/w/cpp/locale/use_facet.html',0,'std']]], + ['user_5finput_5ftest_50',['user_input_test',['../d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc',1,'power_of_two.cpp']]] ]; diff --git a/search/functions_17.js b/search/functions_17.js index 0d0310bea..584020871 100644 --- a/search/functions_17.js +++ b/search/functions_17.js @@ -45,9 +45,9 @@ var searchData= ['weibull_5fdistribution_42',['weibull_distribution',['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/weibull_distribution.html',0,'std::weibull_distribution']]], ['wfilebuf_43',['wfilebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::wfilebuf']]], ['wfstream_44',['wfstream',['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::wfstream']]], - ['what_45',['what',['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::exception::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_optional_access::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_weak_ptr::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wfstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::underflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wstringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::regex_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wiostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::length_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::system_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::runtime_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_new_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_typeid::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ios::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::logic_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_alloc::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_function_call::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::range_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::invalid_argument::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ios_base::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::out_of_range::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::domain_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::overflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::strstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::future_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_cast::what()']]], - ['widen_46',['widen',['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wstringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wfstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wiostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::strstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_fstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ios::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::fstream::widen()']]], - ['width_47',['width',['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wstringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::fstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ios::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_fstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ios_base::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::strstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wiostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wfstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wofstream::width()']]], + ['what_45',['what',['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::runtime_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_new_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_typeid::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ios::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::logic_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_alloc::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_function_call::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::range_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::invalid_argument::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ios_base::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::out_of_range::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::domain_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::overflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::strstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::future_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_cast::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wiostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::exception::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_optional_access::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_weak_ptr::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wfstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::underflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wstringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::regex_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::system_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::length_error::what()']]], + ['widen_46',['widen',['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ofstream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::fstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ios::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_fstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::strstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wiostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istringstream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wfstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wstringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ifstream::widen()']]], + ['width_47',['width',['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::fstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ios::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_fstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ios_base::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::strstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wiostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wfstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wstringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ifstream::width()']]], ['wifstream_48',['wifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::wifstream']]], ['wigglesort_49',['wiggleSort',['../d1/dcc/wiggle__sort_8cpp.html#a99eeded693ac073717282fae365957a1',1,'sorting::wiggle_sort']]], ['windowedmedian_50',['WindowedMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d',1,'probability::windowed_median::WindowedMedian']]], @@ -65,7 +65,7 @@ var searchData= ['wostringstream_62',['wostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::wostringstream']]], ['wprintf_63',['wprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], ['wregex_64',['wregex',['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::wregex']]], - ['write_65',['write',['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostrstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wiostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::strstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wfstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wstringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostringstream::write()']]], + ['write_65',['write',['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::strstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wiostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostrstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wfstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wstringstream::write()']]], ['ws_66',['ws',['http://en.cppreference.com/w/cpp/io/manip/ws.html',0,'std']]], ['wscanf_67',['wscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]], ['wsmatch_68',['wsmatch',['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::wsmatch']]], diff --git a/search/functions_1a.js b/search/functions_1a.js index 63d6c03eb..225692c86 100644 --- a/search/functions_1a.js +++ b/search/functions_1a.js @@ -1,6 +1,6 @@ var searchData= [ ['z_5ffunction_0',['Z_function',['../d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773',1,'z_function.cpp']]], - ['zero_1',['zero',['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::seconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::duration::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::milliseconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::hours::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/zero.html',0,'std::chrono::duration_values::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::microseconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::nanoseconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::minutes::zero()']]], + ['zero_1',['zero',['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::minutes::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::seconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::duration::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::milliseconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::hours::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/zero.html',0,'std::chrono::duration_values::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::microseconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::nanoseconds::zero()']]], ['zeroes_5finitialization_2',['zeroes_initialization',['../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e',1,'machine_learning']]] ]; diff --git a/search/functions_2.js b/search/functions_2.js index 69efa6f51..1934acb9e 100644 --- a/search/functions_2.js +++ b/search/functions_2.js @@ -2,9 +2,9 @@ var searchData= [ ['b_0',['b',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/params.html',0,'std::extreme_value_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/params.html',0,'std::uniform_real_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/params.html',0,'std::weibull_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/params.html',0,'std::uniform_int_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/params.html',0,'std::cauchy_distribution::b()']]], ['babylonian_5fmethod_1',['babylonian_method',['../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309',1,'numerical_methods']]], - ['back_2',['back',['http://en.cppreference.com/w/cpp/container/vector/back.html',0,'std::vector::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::string::back()'],['http://en.cppreference.com/w/cpp/container/deque/back.html',0,'std::deque::back()'],['http://en.cppreference.com/w/cpp/container/queue/back.html',0,'std::queue::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::basic_string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::wstring::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u16string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u32string::back()'],['http://en.cppreference.com/w/cpp/container/list/back.html',0,'std::list::back()'],['http://en.cppreference.com/w/cpp/container/array/back.html',0,'std::array::back()'],['http://en.cppreference.com/w/cpp/container/dynarray/back.html',0,'std::dynarray::back()']]], + ['back_2',['back',['http://en.cppreference.com/w/cpp/container/dynarray/back.html',0,'std::dynarray::back()'],['http://en.cppreference.com/w/cpp/container/vector/back.html',0,'std::vector::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::string::back()'],['http://en.cppreference.com/w/cpp/container/deque/back.html',0,'std::deque::back()'],['http://en.cppreference.com/w/cpp/container/queue/back.html',0,'std::queue::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::basic_string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::wstring::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u16string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u32string::back()'],['http://en.cppreference.com/w/cpp/container/list/back.html',0,'std::list::back()'],['http://en.cppreference.com/w/cpp/container/array/back.html',0,'std::array::back()']]], ['back_5finserter_3',['back_inserter',['http://en.cppreference.com/w/cpp/iterator/back_inserter.html',0,'std']]], - ['bad_4',['bad',['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ios::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::iostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::strstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wiostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_iostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wstringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wfstream::bad()']]], + ['bad_4',['bad',['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ios::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::iostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::strstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wiostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wfstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_iostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wstringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ifstream::bad()']]], ['bad_5falloc_5',['bad_alloc',['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc']]], ['bad_5farray_5flength_6',['bad_array_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_length.html',0,'std::bad_array_length']]], ['bad_5farray_5fnew_5flength_7',['bad_array_new_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_new_length/bad_array_new_length.html',0,'std::bad_array_new_length']]], @@ -13,7 +13,7 @@ var searchData= ['bad_5foptional_5faccess_10',['bad_optional_access',['http://en.cppreference.com/w/cpp/utility/bad_optional_access.html',0,'std::bad_optional_access']]], ['bad_5ftypeid_11',['bad_typeid',['http://en.cppreference.com/w/cpp/types/bad_typeid/bad_typeid.html',0,'std::bad_typeid']]], ['bad_5fweak_5fptr_12',['bad_weak_ptr',['http://en.cppreference.com/w/cpp/memory/bad_weak_ptr/bad_weak_ptr.html',0,'std::bad_weak_ptr']]], - ['base_13',['base',['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/base.html',0,'std::independent_bits_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::shuffle_order_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux24::base()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::knuth_b::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::discard_block_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux48::base()']]], + ['base_13',['base',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux48::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::discard_block_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/base.html',0,'std::independent_bits_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::shuffle_order_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux24::base()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::knuth_b::base()']]], ['basic_5ffilebuf_14',['basic_filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::basic_filebuf']]], ['basic_5ffstream_15',['basic_fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::basic_fstream']]], ['basic_5fifstream_16',['basic_ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::basic_ifstream']]], @@ -34,7 +34,7 @@ var searchData= ['bayes_5fbgivena_31',['bayes_BgivenA',['../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f',1,'bayes_theorem.cpp']]], ['before_32',['before',['http://en.cppreference.com/w/cpp/types/type_info/before.html',0,'std::type_info']]], ['before_5fbegin_33',['before_begin',['http://en.cppreference.com/w/cpp/container/forward_list/before_begin.html',0,'std::forward_list']]], - ['begin_34',['begin',['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::begin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::begin()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/begin.html',0,'std::initializer_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::begin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::begin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::begin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::begin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::begin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::begin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::begin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::begin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::begin()'],['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::begin()'],['http://en.cppreference.com/w/cpp/iterator/begin.html',0,'std::begin()']]], + ['begin_34',['begin',['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::begin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::begin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::begin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::begin()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/begin.html',0,'std::initializer_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::begin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::begin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::begin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::begin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::begin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::begin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::begin()'],['http://en.cppreference.com/w/cpp/iterator/begin.html',0,'std::begin()']]], ['begin_28int_29_35',['begin(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/begin2.html',0,'std::unordered_map::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2.html',0,'std::unordered_multimap::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin2.html',0,'std::unordered_multiset::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin2.html',0,'std::unordered_set::begin(int)()']]], ['bernoulli_5fdistribution_36',['bernoulli_distribution',['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/bernoulli_distribution.html',0,'std::bernoulli_distribution']]], ['beta_37',['beta',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]], @@ -45,9 +45,9 @@ var searchData= ['binary_5fsearch_42',['binary_search',['http://en.cppreference.com/w/cpp/algorithm/binary_search.html',0,'std::binary_search()'],['../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd',1,'sorting::binary_search()']]], ['binary_5fsearch_5ftree_43',['binary_search_tree',['../d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6',1,'binary_search_tree']]], ['binarysearch_44',['BinarySearch',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf',1,'data_structures::list_array::list']]], - ['binarytree_45',['binarytree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree(int64_t data)'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree()']]], + ['binarytree_45',['BinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree(int64_t data)']]], ['bind_46',['bind',['http://en.cppreference.com/w/cpp/utility/functional/bind.html',0,'std']]], - ['binexpo_47',['binexpo',['../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73',1,'binExpo(int a, int b): binary_exponent.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a4c6eefd1254eab3e8d34bf02c205e0f4',1,'binExpo(int64_t a, int64_t b, int64_t m): modular_inverse_fermat_little_theorem.cpp']]], + ['binexpo_47',['binExpo',['../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73',1,'binExpo(int a, int b): binary_exponent.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a4c6eefd1254eab3e8d34bf02c205e0f4',1,'binExpo(int64_t a, int64_t b, int64_t m): modular_inverse_fermat_little_theorem.cpp']]], ['binexpo_5falt_48',['binExpo_alt',['../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f',1,'binary_exponent.cpp']]], ['binomial_5fdistribution_49',['binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/binomial_distribution.html',0,'std::binomial_distribution']]], ['binomial_5fexpected_50',['binomial_expected',['../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813',1,'binomial_dist.cpp']]], @@ -57,18 +57,19 @@ var searchData= ['binomial_5fx_5fsuccesses_54',['binomial_x_successes',['../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76',1,'binomial_dist.cpp']]], ['binomialcoeffsum_55',['binomialCoeffSum',['../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea',1,'math']]], ['bitcount_56',['bitCount',['../d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b',1,'bit_manipulation::hamming_distance']]], - ['bitset_57',['bitset',['../d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130',1,'data_structures::Bitset::Bitset()'],['http://en.cppreference.com/w/cpp/utility/bitset/bitset.html',0,'std::bitset::bitset()']]], - ['bloomfilter_58',['BloomFilter',['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a',1,'data_structures::BloomFilter']]], - ['boolalpha_59',['boolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]], - ['boruvkas_60',['boruvkas',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]], - ['breadth_5ffirst_5fsearch_61',['breadth_first_search',['../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981',1,'graph::Graph']]], - ['brute_5fforce_62',['brute_force',['../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8',1,'string_search']]], - ['bsearch_63',['bsearch',['http://en.cppreference.com/w/cpp/algorithm/bsearch.html',0,'std']]], - ['bst_5fnode_64',['bst_node',['../dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778',1,'binary_search_tree::bst_node']]], - ['btowc_65',['btowc',['http://en.cppreference.com/w/cpp/string/multibyte/btowc.html',0,'std']]], - ['bucket_66',['bucket',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket.html',0,'std::unordered_map::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket.html',0,'std::unordered_set::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket.html',0,'std::unordered_multimap::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket.html',0,'std::unordered_multiset::bucket()']]], - ['bucket_5fcount_67',['bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_count.html',0,'std::unordered_map::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_count.html',0,'std::unordered_multiset::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_count.html',0,'std::unordered_multimap::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_count.html',0,'std::unordered_set::bucket_count()']]], - ['bucket_5fsize_68',['bucket_size',['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_size.html',0,'std::unordered_multiset::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_size.html',0,'std::unordered_map::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_size.html',0,'std::unordered_multimap::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_size.html',0,'std::unordered_set::bucket_size()']]], - ['build_69',['build',['../d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9',1,'range_queries::prefix_sum_array']]], - ['buildtable_70',['buildTable',['../d4/d96/range__queries_2sparse__table_8cpp.html#a803a2451e87021d14ae06f148383e6bc',1,'range_queries::sparse_table']]] + ['bitset_57',['Bitset',['../d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130',1,'data_structures::Bitset']]], + ['bitset_58',['bitset',['http://en.cppreference.com/w/cpp/utility/bitset/bitset.html',0,'std::bitset']]], + ['bloomfilter_59',['BloomFilter',['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a',1,'data_structures::BloomFilter']]], + ['boolalpha_60',['boolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]], + ['boruvkas_61',['boruvkas',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]], + ['breadth_5ffirst_5fsearch_62',['breadth_first_search',['../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981',1,'graph::Graph']]], + ['brute_5fforce_63',['brute_force',['../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8',1,'string_search']]], + ['bsearch_64',['bsearch',['http://en.cppreference.com/w/cpp/algorithm/bsearch.html',0,'std']]], + ['bst_5fnode_65',['bst_node',['../dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778',1,'binary_search_tree::bst_node']]], + ['btowc_66',['btowc',['http://en.cppreference.com/w/cpp/string/multibyte/btowc.html',0,'std']]], + ['bucket_67',['bucket',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket.html',0,'std::unordered_map::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket.html',0,'std::unordered_multimap::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket.html',0,'std::unordered_multiset::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket.html',0,'std::unordered_set::bucket()']]], + ['bucket_5fcount_68',['bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_count.html',0,'std::unordered_map::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_count.html',0,'std::unordered_multimap::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_count.html',0,'std::unordered_multiset::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_count.html',0,'std::unordered_set::bucket_count()']]], + ['bucket_5fsize_69',['bucket_size',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_size.html',0,'std::unordered_map::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_size.html',0,'std::unordered_multimap::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_size.html',0,'std::unordered_multiset::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_size.html',0,'std::unordered_set::bucket_size()']]], + ['build_70',['build',['../d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9',1,'range_queries::prefix_sum_array']]], + ['buildtable_71',['buildTable',['../d4/d96/range__queries_2sparse__table_8cpp.html#a803a2451e87021d14ae06f148383e6bc',1,'range_queries::sparse_table']]] ]; diff --git a/search/functions_3.js b/search/functions_3.js index a67de0487..c9632e350 100644 --- a/search/functions_3.js +++ b/search/functions_3.js @@ -2,22 +2,22 @@ var searchData= [ ['c16rtomb_0',['c16rtomb',['http://en.cppreference.com/w/cpp/string/multibyte/c16rtomb.html',0,'std']]], ['c32rtomb_1',['c32rtomb',['http://en.cppreference.com/w/cpp/string/multibyte/c32rtomb.html',0,'std']]], - ['c_5fstr_2',['c_str',['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::wstring::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u16string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u32string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::basic_string::c_str()']]], + ['c_5fstr_2',['c_str',['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::basic_string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::wstring::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u16string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u32string::c_str()']]], ['calculate_3',['calculate',['../d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978',1,'math::binomial']]], ['call_5fonce_4',['call_once',['http://en.cppreference.com/w/cpp/thread/call_once.html',0,'std']]], ['calloc_5',['calloc',['http://en.cppreference.com/w/cpp/memory/c/calloc.html',0,'std']]], - ['canimove_6',['canimove',['../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648',1,'backtracking::n_queens_all_solutions::CanIMove()'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9',1,'backtracking::n_queens_optimized::CanIMove()']]], + ['canimove_6',['CanIMove',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9',1,'backtracking::n_queens_optimized::CanIMove()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648',1,'backtracking::n_queens_all_solutions::CanIMove()']]], ['canjump_7',['canJump',['../df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755',1,'jumpgame.cpp']]], - ['capacity_8',['capacity',['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::basic_string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u32string::capacity()'],['http://en.cppreference.com/w/cpp/container/vector/capacity.html',0,'std::vector::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::wstring::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u16string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::string::capacity()']]], + ['capacity_8',['capacity',['http://en.cppreference.com/w/cpp/container/vector/capacity.html',0,'std::vector::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::basic_string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::wstring::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u16string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u32string::capacity()']]], ['category_9',['category',['http://en.cppreference.com/w/cpp/error/error_code/category.html',0,'std::error_code::category()'],['http://en.cppreference.com/w/cpp/error/error_condition/category.html',0,'std::error_condition::category()']]], ['cauchy_5fdistribution_10',['cauchy_distribution',['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/cauchy_distribution.html',0,'std::cauchy_distribution']]], ['cbefore_5fbegin_11',['cbefore_begin',['http://en.cppreference.com/w/cpp/container/forward_list/before_begin.html',0,'std::forward_list']]], - ['cbegin_12',['cbegin',['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::cbegin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::cbegin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::cbegin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::cbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::cbegin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::cbegin()'],['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::cbegin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::cbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::cbegin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::cbegin()']]], - ['cbegin_28int_29_13',['cbegin(int)',['http://en.cppreference.com/w/cpp/container/unordered_set/begin2.html',0,'std::unordered_set::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin2.html',0,'std::unordered_multiset::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2.html',0,'std::unordered_multimap::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin2.html',0,'std::unordered_map::cbegin(int)()']]], + ['cbegin_12',['cbegin',['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::cbegin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::cbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::cbegin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::cbegin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::cbegin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::cbegin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::cbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::cbegin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::cbegin()']]], + ['cbegin_28int_29_13',['cbegin(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/begin2.html',0,'std::unordered_map::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2.html',0,'std::unordered_multimap::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin2.html',0,'std::unordered_multiset::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin2.html',0,'std::unordered_set::cbegin(int)()']]], ['cbrt_14',['cbrt',['http://en.cppreference.com/w/cpp/numeric/math/cbrt.html',0,'std']]], ['ceil_15',['ceil',['http://en.cppreference.com/w/cpp/numeric/math/ceil.html',0,'std']]], - ['cend_16',['cend',['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::cend()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::cend()'],['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::cend()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::cend()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::cend()'],['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::cend()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::cend()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::cend()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::cend()'],['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::cend()']]], - ['cend_28int_29_17',['cend(int)',['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::cend(int)()']]], + ['cend_16',['cend',['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::cend()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::cend()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::cend()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::cend()'],['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::cend()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::cend()'],['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::cend()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::cend()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::cend()'],['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::cend()']]], + ['cend_28int_29_17',['cend(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::cend(int)()']]], ['chain_5fquery_18',['chain_query',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24',1,'range_queries::heavy_light_decomposition::HLD']]], ['change_19',['change',['../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579',1,'rungekutta.cpp']]], ['change_5froot_20',['change_root',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0',1,'range_queries::heavy_light_decomposition::Tree']]], @@ -32,12 +32,12 @@ var searchData= ['circle_29',['circle',['../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903',1,'smallest_circle.cpp']]], ['circle_5farea_30',['circle_area',['../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75',1,'math']]], ['circle_5fperimeter_31',['circle_perimeter',['../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953',1,'math']]], - ['circularlinkedlist_32',['circularlinkedlist',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList(CircularLinkedList &&source) noexcept'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList(const CircularLinkedList &copy)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList()']]], + ['circularlinkedlist_32',['CircularLinkedList',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList(const CircularLinkedList &copy)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList(CircularLinkedList &&source) noexcept']]], ['classic_33',['classic',['http://en.cppreference.com/w/cpp/locale/locale/classic.html',0,'std::locale']]], - ['clear_34',['clear',['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wifstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istream::clear()'],['http://en.cppreference.com/w/cpp/container/deque/clear.html',0,'std::deque::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::strstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_stringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::basic_string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::wstring::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/clear.html',0,'std::unordered_multiset::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_condition/clear.html',0,'std::error_condition::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u16string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wiostream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u32string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ifstream::clear()'],['http://en.cppreference.com/w/cpp/container/list/clear.html',0,'std::list::clear()'],['http://en.cppreference.com/w/cpp/container/map/clear.html',0,'std::map::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_set/clear.html',0,'std::unordered_set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wfstream::clear()'],['http://en.cppreference.com/w/cpp/container/multimap/clear.html',0,'std::multimap::clear()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/clear.html',0,'std::atomic_flag::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wstringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ifstream::clear()'],['../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375',1,'queue::clear()'],['../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092',1,'stack::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::fstream::clear()'],['http://en.cppreference.com/w/cpp/container/vector/clear.html',0,'std::vector::clear()'],['http://en.cppreference.com/w/cpp/container/multiset/clear.html',0,'std::multiset::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostream::clear()'],['http://en.cppreference.com/w/cpp/container/set/clear.html',0,'std::set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostringstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_map/clear.html',0,'std::unordered_map::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ios::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_fstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::stringstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/clear.html',0,'std::unordered_multimap::clear()'],['http://en.cppreference.com/w/cpp/container/forward_list/clear.html',0,'std::forward_list::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_code/clear.html',0,'std::error_code::clear()']]], + ['clear_34',['clear',['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::fstream::clear()'],['http://en.cppreference.com/w/cpp/container/vector/clear.html',0,'std::vector::clear()'],['http://en.cppreference.com/w/cpp/container/multiset/clear.html',0,'std::multiset::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostream::clear()'],['http://en.cppreference.com/w/cpp/container/set/clear.html',0,'std::set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostringstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_map/clear.html',0,'std::unordered_map::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ios::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_fstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::stringstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/clear.html',0,'std::unordered_multimap::clear()'],['http://en.cppreference.com/w/cpp/container/forward_list/clear.html',0,'std::forward_list::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_code/clear.html',0,'std::error_code::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wifstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istream::clear()'],['http://en.cppreference.com/w/cpp/container/deque/clear.html',0,'std::deque::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::strstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_stringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::basic_string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::wstring::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/clear.html',0,'std::unordered_multiset::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_condition/clear.html',0,'std::error_condition::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u16string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wiostream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u32string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ifstream::clear()'],['http://en.cppreference.com/w/cpp/container/list/clear.html',0,'std::list::clear()'],['http://en.cppreference.com/w/cpp/container/map/clear.html',0,'std::map::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_set/clear.html',0,'std::unordered_set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wfstream::clear()'],['http://en.cppreference.com/w/cpp/container/multimap/clear.html',0,'std::multimap::clear()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/clear.html',0,'std::atomic_flag::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wstringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ifstream::clear()'],['../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375',1,'queue::clear()'],['../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092',1,'stack::clear()']]], ['clearerr_35',['clearerr',['http://en.cppreference.com/w/cpp/io/c/clearerr.html',0,'std']]], ['clock_36',['clock',['http://en.cppreference.com/w/cpp/chrono/c/clock.html',0,'std']]], - ['close_37',['close',['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::basic_filebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::basic_fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::wfilebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::wifstream::close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::filebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::basic_ofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::ofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::basic_ifstream::close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::wfstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::wofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::ifstream::close()']]], + ['close_37',['close',['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::basic_ofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::basic_filebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::basic_fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::wfilebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::wifstream::close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::filebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::ofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::basic_ifstream::close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::wfstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::wofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::ifstream::close()']]], ['cmatch_38',['cmatch',['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::cmatch']]], ['code_39',['code',['http://en.cppreference.com/w/cpp/thread/future_error/code.html',0,'std::future_error::code()'],['http://en.cppreference.com/w/cpp/regex/regex_error/code.html',0,'std::regex_error::code()'],['http://en.cppreference.com/w/cpp/error/system_error/code.html',0,'std::system_error::code()']]], ['codec_40',['codec',['../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa',1,'ciphers::HillCipher']]], @@ -46,64 +46,66 @@ var searchData= ['collate_43',['collate',['http://en.cppreference.com/w/cpp/locale/collate/collate.html',0,'std::collate']]], ['collate_5fbyname_44',['collate_byname',['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std::collate_byname']]], ['comb_45',['comb',['../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841',1,'data_structures::SegmentTree']]], - ['combine_46',['combine',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74',1,'range_queries::heavy_light_decomposition::SG::combine()'],['http://en.cppreference.com/w/cpp/locale/locale/combine.html',0,'std::locale::combine()']]], + ['combine_46',['combine',['http://en.cppreference.com/w/cpp/locale/locale/combine.html',0,'std::locale::combine()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74',1,'range_queries::heavy_light_decomposition::SG::combine()']]], ['combsort_47',['CombSort',['../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f',1,'comb_sort.cpp']]], - ['compare_48',['compare',['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::sub_match::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::wstring::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::basic_string::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::ssub_match::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::csub_match::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wssub_match::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wcsub_match::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u32string::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::string::compare()'],['http://en.cppreference.com/w/cpp/string/char_traits/compare.html',0,'std::char_traits::compare()'],['../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c',1,'compare(): shell_sort2.cpp'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u16string::compare()']]], + ['compare_48',['compare',['http://en.cppreference.com/w/cpp/string/char_traits/compare.html',0,'std::char_traits::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::string::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wcsub_match::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wssub_match::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::csub_match::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::ssub_match::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::basic_string::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::wstring::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u16string::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u32string::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::sub_match::compare()'],['../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c',1,'compare(): shell_sort2.cpp']]], ['compare_5fexchange_5fstrong_49',['compare_exchange_strong',['http://en.cppreference.com/w/cpp/atomic/atomic/compare_exchange.html',0,'std::atomic']]], ['compare_5fexchange_5fweak_50',['compare_exchange_weak',['http://en.cppreference.com/w/cpp/atomic/atomic/compare_exchange.html',0,'std::atomic']]], - ['complex_51',['complex',['http://en.cppreference.com/w/cpp/numeric/complex/complex.html',0,'std::complex::complex()'],['../da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323',1,'Complex::Complex(const Complex &other)'],['../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867',1,'Complex::Complex(double x=0.f, double y=0.f, bool is_polar=false)']]], - ['complex_5fstr_52',['complex_str',['../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c',1,'durand_kerner_roots.cpp']]], - ['compute_5fpadded_5fsize_53',['compute_padded_size',['../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27',1,'hashing::sha256']]], - ['computelogs_54',['computeLogs',['../d4/d96/range__queries_2sparse__table_8cpp.html#a40810d8c0fe3f8cf432ab128b1ae0300',1,'range_queries::sparse_table']]], - ['condition_5fvariable_55',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable/condition_variable.html',0,'std::condition_variable']]], - ['condition_5fvariable_5fany_56',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/condition_variable_any.html',0,'std::condition_variable_any']]], - ['cone_5fvolume_57',['cone_volume',['../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7',1,'math']]], - ['const_5fpointer_5fcast_58',['const_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], - ['constree_59',['ConsTree',['../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696',1,'segtree.cpp']]], - ['construct_60',['construct',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4',1,'range_queries::perSegTree::construct()'],['http://en.cppreference.com/w/cpp/memory/allocator/construct.html',0,'std::allocator::construct()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/construct.html',0,'std::scoped_allocator_adaptor::construct()'],['http://en.cppreference.com/w/cpp/memory/allocator_traits/construct.html',0,'std::allocator_traits::construct()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3',1,'range_queries::perSegTree::construct()']]], - ['contains_61',['contains',['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b',1,'data_structures::BloomFilter::contains()'],['../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac',1,'data_structures::Bitset::contains()'],['../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63',1,'binary_search_tree::contains(T value)'],['../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2',1,'binary_search_tree::contains(std::unique_ptr< bst_node > &node, T value)'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f',1,'data_structures::tree_234::Node::Contains()']]], - ['converted_62',['converted',['http://en.cppreference.com/w/cpp/locale/wstring_convert/converted.html',0,'std::wstring_convert']]], - ['convexhull_63',['Convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870',1,'geometry::jarvis::Convexhull']]], - ['copy_64',['copy',['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u16string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::basic_string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::wstring::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u32string::copy()'],['http://en.cppreference.com/w/cpp/string/char_traits/copy.html',0,'std::char_traits::copy()']]], - ['copy_5fall_5fnodes_65',['copy_all_nodes',['../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511',1,'data_structures::linked_list']]], - ['copy_5fbackward_66',['copy_backward',['http://en.cppreference.com/w/cpp/algorithm/copy_backward.html',0,'std']]], - ['copy_5fif_67',['copy_if',['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std']]], - ['copy_5fn_68',['copy_n',['http://en.cppreference.com/w/cpp/algorithm/copy_n.html',0,'std']]], - ['copyfmt_69',['copyfmt',['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wfstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wiostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::strstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wstringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ios::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostream::copyfmt()']]], - ['copysign_70',['copysign',['http://en.cppreference.com/w/cpp/numeric/math/copysign.html',0,'std']]], - ['cos_71',['cos',['http://en.cppreference.com/w/cpp/numeric/math/cos.html',0,'std']]], - ['cosh_72',['cosh',['http://en.cppreference.com/w/cpp/numeric/math/cosh.html',0,'std']]], - ['count_73',['count',['http://en.cppreference.com/w/cpp/container/unordered_map/count.html',0,'std::unordered_map::count()'],['http://en.cppreference.com/w/cpp/container/multimap/count.html',0,'std::multimap::count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/count.html',0,'std::unordered_set::count()'],['http://en.cppreference.com/w/cpp/container/map/count.html',0,'std::map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/count.html',0,'std::unordered_multiset::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::minutes::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::seconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::duration::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::milliseconds::count()'],['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std::count()'],['http://en.cppreference.com/w/cpp/container/set/count.html',0,'std::set::count()'],['http://en.cppreference.com/w/cpp/container/multiset/count.html',0,'std::multiset::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/count.html',0,'std::unordered_multimap::count()'],['http://en.cppreference.com/w/cpp/utility/bitset/count.html',0,'std::bitset::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::nanoseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::microseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::hours::count()']]], - ['count_5fif_74',['count_if',['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std']]], - ['countbitsflip_75',['countBitsFlip',['../d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b',1,'bit_manipulation::count_bits_flip']]], - ['countinversion_76',['countInversion',['../d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80',1,'sorting::inversion']]], - ['countsetbits_77',['countSetBits',['../da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62',1,'bit_manipulation::count_of_set_bits']]], - ['crbegin_78',['crbegin',['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::crbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::crbegin()'],['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::crbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::crbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::crbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::crbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::crbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::crbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::crbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::crbegin()']]], - ['create_5fhash_79',['create_hash',['../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8',1,'string_search']]], - ['create_5flist_80',['create_list',['../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5',1,'hash_search.cpp']]], - ['create_5fmatrix_81',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d',1,'qr_eigen_values.cpp']]], - ['create_5fmessage_5fschedule_5farray_82',['create_message_schedule_array',['../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a',1,'hashing::sha256']]], - ['create_5frandom_5farray_83',['create_random_array',['../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49',1,'insertion_sort.cpp']]], - ['createnewnode_84',['createnewnode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154',1,'others::recursive_tree_traversals::BT::createNewNode()']]], - ['createnode_85',['createNode',['../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6',1,'avltree.cpp']]], - ['createset_86',['CreateSet',['../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec',1,'disjoint_set.cpp']]], - ['cref_87',['cref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]], - ['cregex_5fiterator_88',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::cregex_iterator']]], - ['cregex_5ftoken_5fiterator_89',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::cregex_token_iterator']]], - ['crend_90',['crend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::crend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::crend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::crend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::crend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::crend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::crend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::crend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::crend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::crend()']]], - ['cross_91',['cross',['../df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9',1,'math::vector_cross']]], - ['csub_5fmatch_92',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::csub_match']]], - ['ctime_93',['ctime',['http://en.cppreference.com/w/cpp/chrono/c/ctime.html',0,'std']]], - ['ctype_94',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype/ctype.html',0,'std::ctype']]], - ['ctype_5fbyname_95',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname']]], - ['cube_5fsurface_5farea_96',['cube_surface_area',['../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c',1,'math']]], - ['cube_5fsurface_5fperimeter_97',['cube_surface_perimeter',['../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b',1,'math']]], - ['cube_5fvolume_98',['cube_volume',['../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725',1,'math']]], - ['cumulative_5fdistribution_99',['cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a',1,'probability::geometric_dist::geometric_distribution']]], - ['curr_5fsymbol_100',['curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::curr_symbol()']]], - ['current_5fexception_101',['current_exception',['http://en.cppreference.com/w/cpp/error/current_exception.html',0,'std']]], - ['cyclesort_102',['cycleSort',['../de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa',1,'sorting::cycle_sort']]], - ['cylinder_5fsurface_5farea_103',['cylinder_surface_area',['../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864',1,'math']]], - ['cylinder_5fsurface_5fperimeter_104',['cylinder_surface_perimeter',['../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73',1,'math']]], - ['cylinder_5fvolume_105',['cylinder_volume',['../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca',1,'math']]] + ['complex_51',['complex',['http://en.cppreference.com/w/cpp/numeric/complex/complex.html',0,'std::complex']]], + ['complex_52',['Complex',['../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867',1,'Complex::Complex(double x=0.f, double y=0.f, bool is_polar=false)'],['../da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323',1,'Complex::Complex(const Complex &other)']]], + ['complex_5fstr_53',['complex_str',['../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c',1,'durand_kerner_roots.cpp']]], + ['compute_5fpadded_5fsize_54',['compute_padded_size',['../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27',1,'hashing::sha256']]], + ['computelogs_55',['computeLogs',['../d4/d96/range__queries_2sparse__table_8cpp.html#a40810d8c0fe3f8cf432ab128b1ae0300',1,'range_queries::sparse_table']]], + ['condition_5fvariable_56',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable/condition_variable.html',0,'std::condition_variable']]], + ['condition_5fvariable_5fany_57',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/condition_variable_any.html',0,'std::condition_variable_any']]], + ['cone_5fvolume_58',['cone_volume',['../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7',1,'math']]], + ['const_5fpointer_5fcast_59',['const_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], + ['constree_60',['ConsTree',['../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696',1,'segtree.cpp']]], + ['construct_61',['construct',['http://en.cppreference.com/w/cpp/memory/allocator_traits/construct.html',0,'std::allocator_traits::construct()'],['http://en.cppreference.com/w/cpp/memory/allocator/construct.html',0,'std::allocator::construct()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/construct.html',0,'std::scoped_allocator_adaptor::construct()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4',1,'range_queries::perSegTree::construct(const uint32_t &i, const uint32_t &j)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3',1,'range_queries::perSegTree::construct(const std::vector< int64_t > &vec)']]], + ['contains_62',['contains',['../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2',1,'binary_search_tree::contains(std::unique_ptr< bst_node > &node, T value)'],['../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63',1,'binary_search_tree::contains(T value)'],['../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac',1,'data_structures::Bitset::contains()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b',1,'data_structures::BloomFilter::contains()']]], + ['contains_63',['Contains',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f',1,'data_structures::tree_234::Node']]], + ['converted_64',['converted',['http://en.cppreference.com/w/cpp/locale/wstring_convert/converted.html',0,'std::wstring_convert']]], + ['convexhull_65',['Convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870',1,'geometry::jarvis::Convexhull']]], + ['copy_66',['copy',['http://en.cppreference.com/w/cpp/string/char_traits/copy.html',0,'std::char_traits::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::basic_string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::wstring::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u16string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u32string::copy()'],['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std::copy()']]], + ['copy_5fall_5fnodes_67',['copy_all_nodes',['../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511',1,'data_structures::linked_list']]], + ['copy_5fbackward_68',['copy_backward',['http://en.cppreference.com/w/cpp/algorithm/copy_backward.html',0,'std']]], + ['copy_5fif_69',['copy_if',['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std']]], + ['copy_5fn_70',['copy_n',['http://en.cppreference.com/w/cpp/algorithm/copy_n.html',0,'std']]], + ['copyfmt_71',['copyfmt',['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ios::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::strstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wiostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wfstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wstringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ifstream::copyfmt()']]], + ['copysign_72',['copysign',['http://en.cppreference.com/w/cpp/numeric/math/copysign.html',0,'std']]], + ['cos_73',['cos',['http://en.cppreference.com/w/cpp/numeric/math/cos.html',0,'std']]], + ['cosh_74',['cosh',['http://en.cppreference.com/w/cpp/numeric/math/cosh.html',0,'std']]], + ['count_75',['count',['http://en.cppreference.com/w/cpp/container/multiset/count.html',0,'std::multiset::count()'],['http://en.cppreference.com/w/cpp/container/set/count.html',0,'std::set::count()'],['http://en.cppreference.com/w/cpp/container/unordered_map/count.html',0,'std::unordered_map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/count.html',0,'std::unordered_multimap::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::minutes::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::seconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::duration::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::milliseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::hours::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::microseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::nanoseconds::count()'],['http://en.cppreference.com/w/cpp/utility/bitset/count.html',0,'std::bitset::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/count.html',0,'std::unordered_multiset::count()'],['http://en.cppreference.com/w/cpp/container/map/count.html',0,'std::map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/count.html',0,'std::unordered_set::count()'],['http://en.cppreference.com/w/cpp/container/multimap/count.html',0,'std::multimap::count()'],['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std::count(T... args)']]], + ['count_5fif_76',['count_if',['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std']]], + ['countbitsflip_77',['countBitsFlip',['../d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b',1,'bit_manipulation::count_bits_flip']]], + ['countinversion_78',['countInversion',['../d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80',1,'sorting::inversion']]], + ['countsetbits_79',['countSetBits',['../da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62',1,'bit_manipulation::count_of_set_bits']]], + ['crbegin_80',['crbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::crbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::crbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::crbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::crbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::crbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::crbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::crbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::crbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::crbegin()']]], + ['create_5fhash_81',['create_hash',['../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8',1,'string_search']]], + ['create_5flist_82',['create_list',['../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5',1,'hash_search.cpp']]], + ['create_5fmatrix_83',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d',1,'qr_eigen_values.cpp']]], + ['create_5fmessage_5fschedule_5farray_84',['create_message_schedule_array',['../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a',1,'hashing::sha256']]], + ['create_5frandom_5farray_85',['create_random_array',['../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49',1,'insertion_sort.cpp']]], + ['createnewnode_86',['createNewNode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154',1,'others::recursive_tree_traversals::BT::createNewNode()']]], + ['createnode_87',['createNode',['../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6',1,'avltree.cpp']]], + ['createset_88',['CreateSet',['../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec',1,'disjoint_set.cpp']]], + ['cref_89',['cref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]], + ['cregex_5fiterator_90',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::cregex_iterator']]], + ['cregex_5ftoken_5fiterator_91',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::cregex_token_iterator']]], + ['crend_92',['crend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::crend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::crend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::crend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::crend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::crend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::crend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::crend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::crend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::crend()']]], + ['cross_93',['cross',['../df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9',1,'math::vector_cross']]], + ['csub_5fmatch_94',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::csub_match']]], + ['ctime_95',['ctime',['http://en.cppreference.com/w/cpp/chrono/c/ctime.html',0,'std']]], + ['ctype_96',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype/ctype.html',0,'std::ctype']]], + ['ctype_5fbyname_97',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname']]], + ['cube_5fsurface_5farea_98',['cube_surface_area',['../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c',1,'math']]], + ['cube_5fsurface_5fperimeter_99',['cube_surface_perimeter',['../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b',1,'math']]], + ['cube_5fvolume_100',['cube_volume',['../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725',1,'math']]], + ['cumulative_5fdistribution_101',['cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a',1,'probability::geometric_dist::geometric_distribution']]], + ['curr_5fsymbol_102',['curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::curr_symbol()']]], + ['current_5fexception_103',['current_exception',['http://en.cppreference.com/w/cpp/error/current_exception.html',0,'std']]], + ['cyclesort_104',['cycleSort',['../de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa',1,'sorting::cycle_sort']]], + ['cylinder_5fsurface_5farea_105',['cylinder_surface_area',['../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864',1,'math']]], + ['cylinder_5fsurface_5fperimeter_106',['cylinder_surface_perimeter',['../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73',1,'math']]], + ['cylinder_5fvolume_107',['cylinder_volume',['../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca',1,'math']]] ]; diff --git a/search/functions_4.js b/search/functions_4.js index 0f4704bd9..32a0bea92 100644 --- a/search/functions_4.js +++ b/search/functions_4.js @@ -4,15 +4,15 @@ var searchData= ['date_5forder_1',['date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::date_order()']]], ['deallocate_2',['deallocate',['http://en.cppreference.com/w/cpp/memory/allocator_traits/deallocate.html',0,'std::allocator_traits::deallocate()'],['http://en.cppreference.com/w/cpp/memory/allocator/deallocate.html',0,'std::allocator::deallocate()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/deallocate.html',0,'std::scoped_allocator_adaptor::deallocate()'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589',1,'operations_on_datastructures::inorder_traversal_of_bst::deallocate()']]], ['dec_3',['dec',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]], - ['decimal_5fpoint_4',['decimal_point',['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::decimal_point()']]], + ['decimal_5fpoint_4',['decimal_point',['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::decimal_point()']]], ['declare_5fno_5fpointers_5',['declare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/declare_no_pointers.html',0,'std']]], ['declare_5freachable_6',['declare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/declare_reachable.html',0,'std']]], ['declval_7',['declval',['http://en.cppreference.com/w/cpp/utility/declval.html',0,'std']]], ['decreasekey_8',['decreaseKey',['../d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5',1,'MinHeap']]], - ['decrypt_9',['decrypt',['../d6/d2c/caesar__cipher_8cpp.html#a355e69511cd2006b5c4c80ae95b71056',1,'ciphers::caesar::decrypt()'],['../d3/d4c/xor__cipher_8cpp.html#a6099b7e0f1793f418d2c1befca8355a4',1,'ciphers::XOR::decrypt()'],['../de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38',1,'ciphers::a1z26::decrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e',1,'ciphers::vigenere::decrypt()'],['../d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc',1,'ciphers::morse::decrypt()']]], + ['decrypt_9',['decrypt',['../de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38',1,'ciphers::a1z26::decrypt()'],['../d6/d2c/caesar__cipher_8cpp.html#a355e69511cd2006b5c4c80ae95b71056',1,'ciphers::caesar::decrypt()'],['../d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc',1,'ciphers::morse::decrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e',1,'ciphers::vigenere::decrypt()'],['../d3/d4c/xor__cipher_8cpp.html#a6099b7e0f1793f418d2c1befca8355a4',1,'ciphers::XOR::decrypt()']]], ['decrypt_5ftext_10',['decrypt_text',['../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b',1,'ciphers::HillCipher']]], ['default_5fdelete_11',['default_delete',['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete']]], - ['default_5ferror_5fcondition_12',['default_error_condition',['http://en.cppreference.com/w/cpp/error/error_category/default_error_condition.html',0,'std::error_category::default_error_condition()'],['http://en.cppreference.com/w/cpp/error/error_code/default_error_condition.html',0,'std::error_code::default_error_condition()']]], + ['default_5ferror_5fcondition_12',['default_error_condition',['http://en.cppreference.com/w/cpp/error/error_code/default_error_condition.html',0,'std::error_code::default_error_condition()'],['http://en.cppreference.com/w/cpp/error/error_category/default_error_condition.html',0,'std::error_category::default_error_condition()']]], ['defaultfloat_13',['defaultfloat',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], ['degrees_5fto_5fradians_14',['degrees_to_radians',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aba1d26faf6a5379c28cae458956241de',1,'physics::ground_to_ground_projectile_motion']]], ['delete_15',['Delete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340',1,'operations_on_datastructures::trie_operations::Tnode']]], @@ -22,88 +22,90 @@ var searchData= ['deleteelement_19',['deleteElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0',1,'data_structures::SkipList']]], ['deletefrom_20',['DeleteFrom',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169',1,'operations_on_datastructures::trie_operations::Tnode']]], ['deletekey_21',['deleteKey',['../d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29',1,'MinHeap']]], - ['deletenode_22',['deletenode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855',1,'data_structures::tree_234::Tree234::DeleteNode()'],['../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5',1,'deleteNode(): avltree.cpp']]], - ['deletestring_23',['deleteString',['../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab',1,'data_structures::trie']]], - ['denorm_5fmin_24',['denorm_min',['http://en.cppreference.com/w/cpp/types/numeric_limits/denorm_min.html',0,'std::numeric_limits']]], - ['denselayer_25',['denselayer',['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(DenseLayer &&)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const DenseLayer &layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &neurons, const std::string &activation, const std::pair< size_t, size_t > &kernel_shape, const bool &random_kernel)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &neurons, const std::string &activation, const std::vector< std::valarray< double > > &kernel)']]], - ['densities_26',['densities',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::densities()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::densities()']]], - ['depth_5ffirst_5fsearch_27',['depth_first_search',['../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae',1,'graph']]], - ['deque_28',['deque',['http://en.cppreference.com/w/cpp/container/deque/deque.html',0,'std::deque']]], - ['dequeue_29',['dequeue',['../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85',1,'queue::deQueue()'],['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622',1,'data_structures::queue_using_array::Queue_Array::dequeue()']]], - ['destroy_30',['destroy',['http://en.cppreference.com/w/cpp/memory/allocator/destroy.html',0,'std::allocator::destroy()'],['http://en.cppreference.com/w/cpp/memory/allocator_traits/destroy.html',0,'std::allocator_traits::destroy()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/destroy.html',0,'std::scoped_allocator_adaptor::destroy()']]], - ['detach_31',['detach',['http://en.cppreference.com/w/cpp/thread/thread/detach.html',0,'std::thread']]], - ['determinant_5flu_32',['determinant_lu',['../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f',1,'lu_decomposition.h']]], - ['dfs_33',['dfs',['../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9',1,'graph::depth_first_search::dfs()'],['../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0',1,'graph::HKGraph::dfs()']]], - ['dfs_5fhc_34',['dfs_hc',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8',1,'range_queries::heavy_light_decomposition::HLD']]], - ['dfs_5flabels_35',['dfs_labels',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8',1,'range_queries::heavy_light_decomposition::HLD']]], - ['dfs_5flca_36',['dfs_lca',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4',1,'range_queries::heavy_light_decomposition::Tree']]], - ['dfs_5fpar_37',['dfs_par',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a',1,'range_queries::heavy_light_decomposition::HLD']]], - ['dfs_5fsize_38',['dfs_size',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460',1,'range_queries::heavy_light_decomposition::Tree']]], - ['difftime_39',['difftime',['http://en.cppreference.com/w/cpp/chrono/c/difftime.html',0,'std']]], - ['digit_5fchar_40',['digit_char',['../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac',1,'large_number']]], - ['dijkstra_41',['dijkstra',['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#af915876d0ca33cc71a6a6191a8cd3ccd',1,'greedy_algorithms::dijkstra::dijkstra()'],['../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84',1,'graph::dijkstra()']]], - ['direction_42',['direction',['../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655',1,'SegmentIntersection']]], - ['discard_43',['discard',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::knuth_b::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::linear_congruential_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux24::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::shuffle_order_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux48_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/discard.html',0,'std::independent_bits_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mersenne_twister_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::discard_block_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux48::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux24_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937_64::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand0::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::subtract_with_carry_engine::discard()']]], - ['discard_5fblock_5fengine_44',['discard_block_engine',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::discard_block_engine']]], - ['discrete_5fdistribution_45',['discrete_distribution',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/discrete_distribution.html',0,'std::discrete_distribution']]], - ['display_46',['display',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631',1,'data_structures::queue_using_array::Queue_Array::display()'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53',1,'others::lru_cache::LRUCache::display()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#abf7c97616b873ffeebdd0eac2d19d13e',1,'data_structures::linked_list::list::display()'],['../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368',1,'queue::display()'],['../d1/dc2/classstack.html#a8bce109630118a34faae717f72986033',1,'stack::display()'],['../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed',1,'hash_chain::display()'],['../d5/d33/gram__schmidt_8cpp.html#ae6b496dce691e04f7f95ba0f0d33a289',1,'numerical_methods::gram_schmidt::display()'],['../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357',1,'quadratic_probing::display()'],['../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd',1,'double_hashing::display()'],['../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635',1,'linear_probing::display()']]], - ['displayelements_47',['displayElements',['../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72',1,'wiggle_sort.cpp']]], - ['displaylist_48',['displayList',['../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c',1,'data_structures::SkipList']]], - ['distance_49',['distance',['http://en.cppreference.com/w/cpp/iterator/distance.html',0,'std']]], - ['div_50',['div',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]], - ['divide_51',['divide',['../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c',1,'uint128_t::divide()'],['../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1',1,'uint256_t::divide()']]], - ['dnfsort_52',['dnfSort',['../d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0',1,'sorting::dnf_sort']]], - ['do_5falways_5fnoconv_53',['do_always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::do_always_noconv()']]], - ['do_5fclose_54',['do_close',['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::do_close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::do_close()']]], - ['do_5fcompare_55',['do_compare',['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::do_compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::do_compare()']]], - ['do_5fcurr_5fsymbol_56',['do_curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::do_curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::do_curr_symbol()']]], - ['do_5fdate_5forder_57',['do_date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::do_date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::do_date_order()']]], - ['do_5fdecimal_5fpoint_58',['do_decimal_point',['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::do_decimal_point()']]], - ['do_5fencoding_59',['do_encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::do_encoding()']]], - ['do_5ffalsename_60',['do_falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_falsename()']]], - ['do_5ffrac_5fdigits_61',['do_frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::do_frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::do_frac_digits()']]], - ['do_5fget_62',['do_get',['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::do_get()'],['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::do_get()']]], - ['do_5fget_5fdate_63',['do_get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::do_get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::do_get_date(T... args)']]], - ['do_5fget_5fmonthname_64',['do_get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::do_get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::do_get_monthname(T... args)']]], - ['do_5fget_5ftime_65',['do_get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::do_get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::do_get_time(T... args)']]], - ['do_5fget_5fweekday_66',['do_get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::do_get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::do_get_weekday()']]], - ['do_5fget_5fyear_67',['do_get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::do_get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::do_get_year()']]], - ['do_5fgrouping_68',['do_grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::do_grouping()']]], - ['do_5fhash_69',['do_hash',['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::do_hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::do_hash()']]], - ['do_5fin_70',['do_in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::do_in()']]], - ['do_5fis_71',['do_is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::do_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::do_is()']]], - ['do_5flength_72',['do_length',['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::do_length()']]], - ['do_5fmax_5flength_73',['do_max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::do_max_length()']]], - ['do_5fnarrow_74',['do_narrow',['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::do_narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::do_narrow()']]], - ['do_5fneg_5fformat_75',['do_neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_neg_format()']]], - ['do_5fnegative_5fsign_76',['do_negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_negative_sign()']]], - ['do_5fopen_77',['do_open',['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::do_open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::do_open()']]], - ['do_5fout_78',['do_out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::do_out()']]], - ['do_5fpos_5fformat_79',['do_pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_pos_format(T... args)']]], - ['do_5fpositive_5fsign_80',['do_positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_positive_sign()']]], - ['do_5fput_81',['do_put',['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::do_put()']]], - ['do_5fscan_5fis_82',['do_scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::do_scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::do_scan_is()']]], - ['do_5fthousands_5fsep_83',['do_thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::do_thousands_sep()']]], - ['do_5ftolower_84',['do_tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::do_tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::do_tolower()']]], - ['do_5ftoupper_85',['do_toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::do_toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::do_toupper()']]], - ['do_5ftransform_86',['do_transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::do_transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::do_transform()']]], - ['do_5ftruename_87',['do_truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_truename()']]], - ['do_5funshift_88',['do_unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::do_unshift()']]], - ['do_5fwiden_89',['do_widen',['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::do_widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::do_widen()']]], - ['domain_5ferror_90',['domain_error',['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error']]], - ['dot_5fproduct_91',['dot_product',['../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d',1,'numerical_methods::gram_schmidt']]], - ['double_5ffactorial_5fiterative_92',['double_factorial_iterative',['../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26',1,'double_factorial.cpp']]], - ['double_5ffactorial_5frecursive_93',['double_factorial_recursive',['../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d',1,'double_factorial.cpp']]], - ['doublehash_94',['doubleHash',['../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200',1,'double_hashing']]], - ['draw_5fsample_95',['draw_sample',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3',1,'probability::geometric_dist::geometric_distribution']]], - ['drelu_96',['drelu',['../d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9',1,'machine_learning::neural_network::activations']]], - ['dsigmoid_97',['dsigmoid',['../d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46',1,'machine_learning::neural_network::activations']]], - ['dsu_98',['dsu',['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)'],['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)']]], - ['dtanh_99',['dtanh',['../d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c',1,'machine_learning::neural_network::activations']]], - ['duplicatenumber_100',['duplicateNumber',['../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88',1,'search::cycle_detection']]], - ['durand_5fkerner_5falgo_101',['durand_kerner_algo',['../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd',1,'durand_kerner_roots.cpp']]], - ['duration_102',['duration',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::duration']]], - ['duration_5fcast_103',['duration_cast',['http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html',0,'std::chrono']]], - ['dynamic_5fpointer_5fcast_104',['dynamic_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], - ['dynarray_105',['dynarray',['http://en.cppreference.com/w/cpp/container/dynarray/dynarray.html',0,'std::dynarray']]] + ['deletenode_22',['DeleteNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855',1,'data_structures::tree_234::Tree234']]], + ['deletenode_23',['deleteNode',['../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5',1,'avltree.cpp']]], + ['deletestring_24',['deleteString',['../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab',1,'data_structures::trie']]], + ['denorm_5fmin_25',['denorm_min',['http://en.cppreference.com/w/cpp/types/numeric_limits/denorm_min.html',0,'std::numeric_limits']]], + ['denselayer_26',['DenseLayer',['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &neurons, const std::string &activation, const std::pair< size_t, size_t > &kernel_shape, const bool &random_kernel)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &neurons, const std::string &activation, const std::vector< std::valarray< double > > &kernel)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const DenseLayer &layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(DenseLayer &&)=default']]], + ['densities_27',['densities',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::densities()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::densities()']]], + ['depth_5ffirst_5fsearch_28',['depth_first_search',['../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae',1,'graph']]], + ['deque_29',['deque',['http://en.cppreference.com/w/cpp/container/deque/deque.html',0,'std::deque']]], + ['dequeue_30',['dequeue',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622',1,'data_structures::queue_using_array::Queue_Array']]], + ['dequeue_31',['deQueue',['../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85',1,'queue']]], + ['destroy_32',['destroy',['http://en.cppreference.com/w/cpp/memory/allocator_traits/destroy.html',0,'std::allocator_traits::destroy()'],['http://en.cppreference.com/w/cpp/memory/allocator/destroy.html',0,'std::allocator::destroy()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/destroy.html',0,'std::scoped_allocator_adaptor::destroy()']]], + ['detach_33',['detach',['http://en.cppreference.com/w/cpp/thread/thread/detach.html',0,'std::thread']]], + ['determinant_5flu_34',['determinant_lu',['../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f',1,'lu_decomposition.h']]], + ['dfs_35',['dfs',['../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0',1,'graph::HKGraph::dfs()'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9',1,'graph::depth_first_search::dfs()']]], + ['dfs_5fhc_36',['dfs_hc',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8',1,'range_queries::heavy_light_decomposition::HLD']]], + ['dfs_5flabels_37',['dfs_labels',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8',1,'range_queries::heavy_light_decomposition::HLD']]], + ['dfs_5flca_38',['dfs_lca',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4',1,'range_queries::heavy_light_decomposition::Tree']]], + ['dfs_5fpar_39',['dfs_par',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a',1,'range_queries::heavy_light_decomposition::HLD']]], + ['dfs_5fsize_40',['dfs_size',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460',1,'range_queries::heavy_light_decomposition::Tree']]], + ['difftime_41',['difftime',['http://en.cppreference.com/w/cpp/chrono/c/difftime.html',0,'std']]], + ['digit_5fchar_42',['digit_char',['../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac',1,'large_number']]], + ['dijkstra_43',['dijkstra',['../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84',1,'graph::dijkstra()'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#af915876d0ca33cc71a6a6191a8cd3ccd',1,'greedy_algorithms::dijkstra::dijkstra()']]], + ['direction_44',['direction',['../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655',1,'SegmentIntersection']]], + ['discard_45',['discard',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937_64::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux24_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux48::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::discard_block_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mersenne_twister_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/discard.html',0,'std::independent_bits_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux48_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::shuffle_order_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux24::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::linear_congruential_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::knuth_b::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand0::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::subtract_with_carry_engine::discard()']]], + ['discard_5fblock_5fengine_46',['discard_block_engine',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::discard_block_engine']]], + ['discrete_5fdistribution_47',['discrete_distribution',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/discrete_distribution.html',0,'std::discrete_distribution']]], + ['display_48',['display',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#abf7c97616b873ffeebdd0eac2d19d13e',1,'data_structures::linked_list::list::display()'],['../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368',1,'queue::display()'],['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631',1,'data_structures::queue_using_array::Queue_Array::display()'],['../d1/dc2/classstack.html#a8bce109630118a34faae717f72986033',1,'stack::display()'],['../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed',1,'hash_chain::display()'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53',1,'others::lru_cache::LRUCache::display()'],['../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd',1,'double_hashing::display()'],['../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635',1,'linear_probing::display()'],['../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357',1,'quadratic_probing::display()'],['../d5/d33/gram__schmidt_8cpp.html#ae6b496dce691e04f7f95ba0f0d33a289',1,'numerical_methods::gram_schmidt::display()']]], + ['displayelements_49',['displayElements',['../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72',1,'wiggle_sort.cpp']]], + ['displaylist_50',['displayList',['../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c',1,'data_structures::SkipList']]], + ['distance_51',['distance',['http://en.cppreference.com/w/cpp/iterator/distance.html',0,'std']]], + ['div_52',['div',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]], + ['divide_53',['divide',['../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c',1,'uint128_t::divide()'],['../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1',1,'uint256_t::divide()']]], + ['dnfsort_54',['dnfSort',['../d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0',1,'sorting::dnf_sort']]], + ['do_5falways_5fnoconv_55',['do_always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::do_always_noconv()']]], + ['do_5fclose_56',['do_close',['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::do_close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::do_close()']]], + ['do_5fcompare_57',['do_compare',['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::do_compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::do_compare()']]], + ['do_5fcurr_5fsymbol_58',['do_curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::do_curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::do_curr_symbol()']]], + ['do_5fdate_5forder_59',['do_date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::do_date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::do_date_order()']]], + ['do_5fdecimal_5fpoint_60',['do_decimal_point',['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::do_decimal_point()']]], + ['do_5fencoding_61',['do_encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::do_encoding()']]], + ['do_5ffalsename_62',['do_falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_falsename()']]], + ['do_5ffrac_5fdigits_63',['do_frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::do_frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::do_frac_digits()']]], + ['do_5fget_64',['do_get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::do_get()']]], + ['do_5fget_5fdate_65',['do_get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::do_get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::do_get_date()']]], + ['do_5fget_5fmonthname_66',['do_get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::do_get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::do_get_monthname()']]], + ['do_5fget_5ftime_67',['do_get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::do_get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::do_get_time()']]], + ['do_5fget_5fweekday_68',['do_get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::do_get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::do_get_weekday()']]], + ['do_5fget_5fyear_69',['do_get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::do_get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::do_get_year()']]], + ['do_5fgrouping_70',['do_grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::do_grouping()']]], + ['do_5fhash_71',['do_hash',['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::do_hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::do_hash()']]], + ['do_5fin_72',['do_in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::do_in()']]], + ['do_5fis_73',['do_is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::do_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::do_is()']]], + ['do_5flength_74',['do_length',['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::do_length()']]], + ['do_5fmax_5flength_75',['do_max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::do_max_length()']]], + ['do_5fnarrow_76',['do_narrow',['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::do_narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::do_narrow()']]], + ['do_5fneg_5fformat_77',['do_neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_neg_format()']]], + ['do_5fnegative_5fsign_78',['do_negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_negative_sign()']]], + ['do_5fopen_79',['do_open',['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::do_open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::do_open()']]], + ['do_5fout_80',['do_out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::do_out()']]], + ['do_5fpos_5fformat_81',['do_pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_pos_format()']]], + ['do_5fpositive_5fsign_82',['do_positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_positive_sign()']]], + ['do_5fput_83',['do_put',['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::do_put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::do_put()']]], + ['do_5fscan_5fis_84',['do_scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::do_scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::do_scan_is()']]], + ['do_5fthousands_5fsep_85',['do_thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::do_thousands_sep()']]], + ['do_5ftolower_86',['do_tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::do_tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::do_tolower()']]], + ['do_5ftoupper_87',['do_toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::do_toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::do_toupper()']]], + ['do_5ftransform_88',['do_transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::do_transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::do_transform()']]], + ['do_5ftruename_89',['do_truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_truename()']]], + ['do_5funshift_90',['do_unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::do_unshift()']]], + ['do_5fwiden_91',['do_widen',['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::do_widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::do_widen()']]], + ['domain_5ferror_92',['domain_error',['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error']]], + ['dot_5fproduct_93',['dot_product',['../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d',1,'numerical_methods::gram_schmidt']]], + ['double_5ffactorial_5fiterative_94',['double_factorial_iterative',['../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26',1,'double_factorial.cpp']]], + ['double_5ffactorial_5frecursive_95',['double_factorial_recursive',['../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d',1,'double_factorial.cpp']]], + ['doublehash_96',['doubleHash',['../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200',1,'double_hashing']]], + ['draw_5fsample_97',['draw_sample',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3',1,'probability::geometric_dist::geometric_distribution']]], + ['drelu_98',['drelu',['../d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9',1,'machine_learning::neural_network::activations']]], + ['dsigmoid_99',['dsigmoid',['../d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46',1,'machine_learning::neural_network::activations']]], + ['dsu_100',['dsu',['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)'],['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)']]], + ['dtanh_101',['dtanh',['../d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c',1,'machine_learning::neural_network::activations']]], + ['duplicatenumber_102',['duplicateNumber',['../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88',1,'search::cycle_detection']]], + ['durand_5fkerner_5falgo_103',['durand_kerner_algo',['../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd',1,'durand_kerner_roots.cpp']]], + ['duration_104',['duration',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::duration']]], + ['duration_5fcast_105',['duration_cast',['http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html',0,'std::chrono']]], + ['dynamic_5fpointer_5fcast_106',['dynamic_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], + ['dynarray_107',['dynarray',['http://en.cppreference.com/w/cpp/container/dynarray/dynarray.html',0,'std::dynarray']]] ]; diff --git a/search/functions_5.js b/search/functions_5.js index 2766f2012..619c5ca6c 100644 --- a/search/functions_5.js +++ b/search/functions_5.js @@ -3,65 +3,66 @@ var searchData= ['eback_0',['eback',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::eback()']]], ['edge_1',['Edge',['../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980',1,'Edge']]], ['editdistdp_2',['editDistDP',['../da/d52/minimum__edit__distance_8cpp.html#ade2fcfe0359f3c7691bfaa04b14943e2',1,'dynamic_programming::minimum_edit_distance']]], - ['egptr_3',['egptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::egptr()']]], + ['egptr_3',['egptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::egptr()']]], ['eigen_5fvalues_4',['eigen_values',['../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc',1,'qr_algorithm']]], - ['eightpuzzle_5',['eightpuzzle',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const std::array< std::array< uint32_t, N >, N > &init)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle< N > &A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle< N > &&A) noexcept'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle()']]], - ['emplace_6',['emplace',['http://en.cppreference.com/w/cpp/container/set/emplace.html',0,'std::set::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace.html',0,'std::unordered_map::emplace()'],['http://en.cppreference.com/w/cpp/container/stack/emplace.html',0,'std::stack::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace.html',0,'std::unordered_multimap::emplace()'],['http://en.cppreference.com/w/cpp/container/deque/emplace.html',0,'std::deque::emplace()'],['http://en.cppreference.com/w/cpp/container/queue/emplace.html',0,'std::queue::emplace()'],['http://en.cppreference.com/w/cpp/container/priority_queue/emplace.html',0,'std::priority_queue::emplace()'],['http://en.cppreference.com/w/cpp/container/multiset/emplace.html',0,'std::multiset::emplace()'],['http://en.cppreference.com/w/cpp/container/list/emplace.html',0,'std::list::emplace()'],['http://en.cppreference.com/w/cpp/container/map/emplace.html',0,'std::map::emplace()'],['http://en.cppreference.com/w/cpp/experimental/optional/emplace.html',0,'std::experimental::optional::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_set/emplace.html',0,'std::unordered_set::emplace()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace.html',0,'std::multimap::emplace()'],['http://en.cppreference.com/w/cpp/container/vector/emplace.html',0,'std::vector::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace.html',0,'std::unordered_multiset::emplace()']]], + ['eightpuzzle_5',['EightPuzzle',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const std::array< std::array< uint32_t, N >, N > &init)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle< N > &A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle< N > &&A) noexcept']]], + ['emplace_6',['emplace',['http://en.cppreference.com/w/cpp/container/vector/emplace.html',0,'std::vector::emplace()'],['http://en.cppreference.com/w/cpp/container/multiset/emplace.html',0,'std::multiset::emplace()'],['http://en.cppreference.com/w/cpp/container/set/emplace.html',0,'std::set::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace.html',0,'std::unordered_map::emplace()'],['http://en.cppreference.com/w/cpp/container/stack/emplace.html',0,'std::stack::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace.html',0,'std::unordered_multimap::emplace()'],['http://en.cppreference.com/w/cpp/container/deque/emplace.html',0,'std::deque::emplace()'],['http://en.cppreference.com/w/cpp/container/queue/emplace.html',0,'std::queue::emplace()'],['http://en.cppreference.com/w/cpp/container/priority_queue/emplace.html',0,'std::priority_queue::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace.html',0,'std::unordered_multiset::emplace()'],['http://en.cppreference.com/w/cpp/container/list/emplace.html',0,'std::list::emplace()'],['http://en.cppreference.com/w/cpp/container/map/emplace.html',0,'std::map::emplace()'],['http://en.cppreference.com/w/cpp/experimental/optional/emplace.html',0,'std::experimental::optional::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_set/emplace.html',0,'std::unordered_set::emplace()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace.html',0,'std::multimap::emplace()']]], ['emplace_5fafter_7',['emplace_after',['http://en.cppreference.com/w/cpp/container/forward_list/emplace_after.html',0,'std::forward_list']]], - ['emplace_5fback_8',['emplace_back',['http://en.cppreference.com/w/cpp/container/list/emplace_back.html',0,'std::list::emplace_back()'],['http://en.cppreference.com/w/cpp/container/vector/emplace_back.html',0,'std::vector::emplace_back()'],['http://en.cppreference.com/w/cpp/container/deque/emplace_back.html',0,'std::deque::emplace_back()']]], + ['emplace_5fback_8',['emplace_back',['http://en.cppreference.com/w/cpp/container/vector/emplace_back.html',0,'std::vector::emplace_back()'],['http://en.cppreference.com/w/cpp/container/deque/emplace_back.html',0,'std::deque::emplace_back()'],['http://en.cppreference.com/w/cpp/container/list/emplace_back.html',0,'std::list::emplace_back()']]], ['emplace_5ffront_9',['emplace_front',['http://en.cppreference.com/w/cpp/container/forward_list/emplace_front.html',0,'std::forward_list::emplace_front()'],['http://en.cppreference.com/w/cpp/container/deque/emplace_front.html',0,'std::deque::emplace_front()'],['http://en.cppreference.com/w/cpp/container/list/emplace_front.html',0,'std::list::emplace_front()']]], - ['emplace_5fhint_10',['emplace_hint',['http://en.cppreference.com/w/cpp/container/set/emplace_hint.html',0,'std::set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace_hint.html',0,'std::unordered_multimap::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace_hint.html',0,'std::unordered_multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/map/emplace_hint.html',0,'std::map::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_set/emplace_hint.html',0,'std::unordered_set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace_hint.html',0,'std::multimap::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/multiset/emplace_hint.html',0,'std::multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace_hint.html',0,'std::unordered_map::emplace_hint()']]], - ['empty_11',['empty',['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::match_results::empty()'],['http://en.cppreference.com/w/cpp/container/multiset/empty.html',0,'std::multiset::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::string::empty()'],['http://en.cppreference.com/w/cpp/container/set/empty.html',0,'std::set::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_map/empty.html',0,'std::unordered_map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wsmatch::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::smatch::empty()'],['http://en.cppreference.com/w/cpp/container/stack/empty.html',0,'std::stack::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/empty.html',0,'std::unordered_multimap::empty()'],['http://en.cppreference.com/w/cpp/container/forward_list/empty.html',0,'std::forward_list::empty()'],['http://en.cppreference.com/w/cpp/container/vector/empty.html',0,'std::vector::empty()'],['http://en.cppreference.com/w/cpp/container/deque/empty.html',0,'std::deque::empty()'],['http://en.cppreference.com/w/cpp/container/queue/empty.html',0,'std::queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::basic_string::empty()'],['http://en.cppreference.com/w/cpp/container/priority_queue/empty.html',0,'std::priority_queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::wstring::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/empty.html',0,'std::unordered_multiset::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u16string::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u32string::empty()'],['http://en.cppreference.com/w/cpp/container/list/empty.html',0,'std::list::empty()'],['http://en.cppreference.com/w/cpp/container/map/empty.html',0,'std::map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::cmatch::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_set/empty.html',0,'std::unordered_set::empty()'],['http://en.cppreference.com/w/cpp/container/multimap/empty.html',0,'std::multimap::empty()'],['http://en.cppreference.com/w/cpp/container/array/empty.html',0,'std::array::empty()'],['http://en.cppreference.com/w/cpp/container/dynarray/empty.html',0,'std::dynarray::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wcmatch::empty()']]], + ['emplace_5fhint_10',['emplace_hint',['http://en.cppreference.com/w/cpp/container/multiset/emplace_hint.html',0,'std::multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/set/emplace_hint.html',0,'std::set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace_hint.html',0,'std::unordered_map::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace_hint.html',0,'std::unordered_multimap::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace_hint.html',0,'std::unordered_multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/map/emplace_hint.html',0,'std::map::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_set/emplace_hint.html',0,'std::unordered_set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace_hint.html',0,'std::multimap::emplace_hint()']]], + ['empty_11',['empty',['http://en.cppreference.com/w/cpp/container/dynarray/empty.html',0,'std::dynarray::empty()'],['http://en.cppreference.com/w/cpp/container/vector/empty.html',0,'std::vector::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::match_results::empty()'],['http://en.cppreference.com/w/cpp/container/multiset/empty.html',0,'std::multiset::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::string::empty()'],['http://en.cppreference.com/w/cpp/container/set/empty.html',0,'std::set::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_map/empty.html',0,'std::unordered_map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wsmatch::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::smatch::empty()'],['http://en.cppreference.com/w/cpp/container/stack/empty.html',0,'std::stack::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/empty.html',0,'std::unordered_multimap::empty()'],['http://en.cppreference.com/w/cpp/container/forward_list/empty.html',0,'std::forward_list::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wcmatch::empty()'],['http://en.cppreference.com/w/cpp/container/deque/empty.html',0,'std::deque::empty()'],['http://en.cppreference.com/w/cpp/container/queue/empty.html',0,'std::queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::basic_string::empty()'],['http://en.cppreference.com/w/cpp/container/priority_queue/empty.html',0,'std::priority_queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::wstring::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/empty.html',0,'std::unordered_multiset::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u16string::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u32string::empty()'],['http://en.cppreference.com/w/cpp/container/list/empty.html',0,'std::list::empty()'],['http://en.cppreference.com/w/cpp/container/map/empty.html',0,'std::map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::cmatch::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_set/empty.html',0,'std::unordered_set::empty()'],['http://en.cppreference.com/w/cpp/container/multimap/empty.html',0,'std::multimap::empty()'],['http://en.cppreference.com/w/cpp/container/array/empty.html',0,'std::array::empty()']]], ['enable_5fshared_5ffrom_5fthis_12',['enable_shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/enable_shared_from_this.html',0,'std::enable_shared_from_this']]], - ['encoding_13',['encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::encoding()']]], - ['encrypt_14',['encrypt',['../d6/d2c/caesar__cipher_8cpp.html#ac3381121289548640b1c27a58a8524c3',1,'ciphers::caesar::encrypt()'],['../d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a',1,'ciphers::morse::encrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257',1,'ciphers::vigenere::encrypt()'],['../d3/d4c/xor__cipher_8cpp.html#aeff72a463ffc580c16cc849cbbdc58ef',1,'ciphers::XOR::encrypt()'],['../de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744',1,'ciphers::a1z26::encrypt()']]], + ['encoding_13',['encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::encoding()']]], + ['encrypt_14',['encrypt',['../de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744',1,'ciphers::a1z26::encrypt()'],['../d6/d2c/caesar__cipher_8cpp.html#ac3381121289548640b1c27a58a8524c3',1,'ciphers::caesar::encrypt()'],['../d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a',1,'ciphers::morse::encrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257',1,'ciphers::vigenere::encrypt()'],['../d3/d4c/xor__cipher_8cpp.html#aeff72a463ffc580c16cc849cbbdc58ef',1,'ciphers::XOR::encrypt()']]], ['encrypt_5ftext_15',['encrypt_text',['../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917',1,'ciphers::HillCipher']]], - ['end_16',['end',['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::end()'],['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::end()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::end()'],['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::end()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::end()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::end()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::end()'],['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::end()'],['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::end()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::end()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/end.html',0,'std::initializer_list::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::end()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::end()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::end()'],['http://en.cppreference.com/w/cpp/iterator/end.html',0,'std::end()']]], - ['end_28int_29_17',['end(int)',['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::end(int)()']]], + ['end_16',['end',['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::end()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::end()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::end()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::end()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::end()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/end.html',0,'std::initializer_list::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::end()'],['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::end()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::end()'],['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::end()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::end()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::end()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::end()'],['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::end()'],['http://en.cppreference.com/w/cpp/iterator/end.html',0,'std::end()']]], + ['end_28int_29_17',['end(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::end(int)()']]], ['endl_18',['endl',['http://en.cppreference.com/w/cpp/io/manip/endl.html',0,'std']]], ['ends_19',['ends',['http://en.cppreference.com/w/cpp/io/manip/ends.html',0,'std']]], - ['enqueue_20',['enqueue',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663',1,'data_structures::queue_using_array::Queue_Array::enqueue()'],['../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d',1,'queue::enQueue(const value_type &item)']]], - ['ensurenotempty_21',['ensureNotEmpty',['../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604',1,'queue']]], - ['entropy_22',['entropy',['http://en.cppreference.com/w/cpp/numeric/random/random_device/entropy.html',0,'std::random_device']]], - ['entry_23',['entry',['../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e',1,'quadratic_probing::Entry::Entry()'],['../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77',1,'linear_probing::Entry::Entry()'],['../d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475',1,'double_hashing::Entry::Entry()']]], - ['eof_24',['eof',['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::strstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wiostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wfstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wstringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_fstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ios::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostream::eof()'],['http://en.cppreference.com/w/cpp/string/char_traits/eof.html',0,'std::char_traits::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::fstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistream::eof()']]], - ['epptr_25',['epptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::epptr()']]], - ['epsilon_26',['epsilon',['http://en.cppreference.com/w/cpp/types/numeric_limits/epsilon.html',0,'std::numeric_limits']]], - ['eq_27',['eq',['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits::eq()'],['../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389',1,'eq(float y): successive_approximation.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i): newton_raphson_method.cpp'],['../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713',1,'numerical_methods::false_position::eq()'],['../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i): bisection_method.cpp']]], - ['eq_5fder_28',['eq_der',['../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386',1,'newton_raphson_method.cpp']]], - ['eq_5fint_5ftype_29',['eq_int_type',['http://en.cppreference.com/w/cpp/string/char_traits/eq_int_type.html',0,'std::char_traits']]], - ['eqd_30',['eqd',['../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456',1,'successive_approximation.cpp']]], - ['equal_31',['equal',['http://en.cppreference.com/w/cpp/algorithm/equal.html',0,'std']]], - ['equal_5frange_32',['equal_range',['http://en.cppreference.com/w/cpp/container/unordered_map/equal_range.html',0,'std::unordered_map::equal_range()'],['http://en.cppreference.com/w/cpp/algorithm/equal_range.html',0,'std::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/equal_range.html',0,'std::unordered_multimap::equal_range()'],['http://en.cppreference.com/w/cpp/container/set/equal_range.html',0,'std::set::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/equal_range.html',0,'std::unordered_multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/map/equal_range.html',0,'std::map::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_set/equal_range.html',0,'std::unordered_set::equal_range()'],['http://en.cppreference.com/w/cpp/container/multiset/equal_range.html',0,'std::multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/multimap/equal_range.html',0,'std::multimap::equal_range()']]], - ['equal_5fshuffle_33',['equal_shuffle',['../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f',1,'machine_learning']]], - ['equivalent_34',['equivalent',['http://en.cppreference.com/w/cpp/error/error_category/equivalent.html',0,'std::error_category']]], - ['erase_35',['erase',['http://en.cppreference.com/w/cpp/container/unordered_multimap/erase.html',0,'std::unordered_multimap::erase()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1fb1792ab867dc26639eef368a56989e',1,'data_structures::linked_list::list::erase()'],['http://en.cppreference.com/w/cpp/container/vector/erase.html',0,'std::vector::erase()'],['http://en.cppreference.com/w/cpp/container/multiset/erase.html',0,'std::multiset::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::string::erase()'],['http://en.cppreference.com/w/cpp/container/set/erase.html',0,'std::set::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_map/erase.html',0,'std::unordered_map::erase()'],['http://en.cppreference.com/w/cpp/container/deque/erase.html',0,'std::deque::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::basic_string::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::wstring::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/erase.html',0,'std::unordered_multiset::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u16string::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u32string::erase()'],['http://en.cppreference.com/w/cpp/container/list/erase.html',0,'std::list::erase()'],['http://en.cppreference.com/w/cpp/container/map/erase.html',0,'std::map::erase()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::erase()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469',1,'data_structures::treap::Treap::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_set/erase.html',0,'std::unordered_set::erase()'],['http://en.cppreference.com/w/cpp/container/multimap/erase.html',0,'std::multimap::erase()']]], - ['erase_5fafter_36',['erase_after',['http://en.cppreference.com/w/cpp/container/forward_list/erase_after.html',0,'std::forward_list']]], - ['erasefromsorted_37',['eraseFromSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e',1,'probability::windowed_median::WindowedMedian']]], - ['erf_38',['erf',['http://en.cppreference.com/w/cpp/numeric/math/erf.html',0,'std']]], - ['erfc_39',['erfc',['http://en.cppreference.com/w/cpp/numeric/math/erfc.html',0,'std']]], - ['error_5fcategory_40',['error_category',['http://en.cppreference.com/w/cpp/error/error_category/error_category.html',0,'std::error_category']]], - ['error_5fcode_41',['error_code',['http://en.cppreference.com/w/cpp/error/error_code/error_code.html',0,'std::error_code']]], - ['error_5fcondition_42',['error_condition',['http://en.cppreference.com/w/cpp/error/error_condition/error_condition.html',0,'std::error_condition']]], - ['euclidean_5fdistance_43',['euclidean_distance',['../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69',1,'machine_learning::k_nearest_neighbors']]], - ['evaluate_44',['evaluate',['../d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338',1,'others::postfix_expression::evaluate()'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e',1,'machine_learning::neural_network::NeuralNetwork::evaluate(const std::vector< std::vector< std::valarray< double > > > &X, const std::vector< std::vector< std::valarray< double > > > &Y)']]], - ['evaluate_5ffrom_5fcsv_45',['evaluate_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848',1,'machine_learning::neural_network::NeuralNetwork']]], - ['exact_5fsolution_46',['exact_solution',['../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_semi_implicit_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_midpoint_euler.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_forward_euler.cpp']]], - ['exception_47',['exception',['http://en.cppreference.com/w/cpp/error/exception/exception.html',0,'std::exception']]], - ['exceptions_48',['exceptions',['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wstringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::fstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ios::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wfstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wiostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::strstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_fstream::exceptions()']]], - ['exchange_49',['exchange',['http://en.cppreference.com/w/cpp/atomic/atomic/exchange.html',0,'std::atomic']]], - ['exists_50',['exists',['../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81',1,'dynamic_programming::word_break']]], - ['exit_51',['exit',['http://en.cppreference.com/w/cpp/utility/program/exit.html',0,'std']]], - ['exp_52',['exp',['http://en.cppreference.com/w/cpp/numeric/math/exp.html',0,'std::exp()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0',1,'ciphers::elliptic_curve_key_exchange::exp()']]], - ['exp2_53',['exp2',['http://en.cppreference.com/w/cpp/numeric/math/exp2.html',0,'std']]], - ['expected_5fvalue_54',['expected_value',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413',1,'probability::geometric_dist::geometric_distribution']]], - ['expired_55',['expired',['http://en.cppreference.com/w/cpp/memory/weak_ptr/expired.html',0,'std::weak_ptr']]], - ['explore_56',['explore',['../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463',1,'graph::explore(const std::vector< std::vector< size_t > > &adj, size_t v, std::vector< bool > *visited)'],['../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8',1,'graph::explore(const std::vector< std::vector< int > > *adj, int u, std::vector< bool > *visited)']]], - ['expm1_57',['expm1',['http://en.cppreference.com/w/cpp/numeric/math/expm1.html',0,'std']]], - ['exponential_5fdistribution_58',['exponential_distribution',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/exponential_distribution.html',0,'std::exponential_distribution']]], - ['extendedeuclid_59',['extendedEuclid',['../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d',1,'extended_euclid_algorithm.cpp']]], - ['extendedeuclid_5f1_60',['extendedEuclid_1',['../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25',1,'extended_euclid_algorithm.cpp']]], - ['extract_5fbyte_61',['extract_byte',['../d4/d08/sha256_8cpp.html#afea411191ec5281f43e91ea327984627',1,'hashing::sha256']]], - ['extractmin_62',['extractMin',['../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980',1,'MinHeap']]], - ['extreme_5fvalue_5fdistribution_63',['extreme_value_distribution',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/extreme_value_distribution.html',0,'std::extreme_value_distribution']]] + ['enqueue_20',['enqueue',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663',1,'data_structures::queue_using_array::Queue_Array']]], + ['enqueue_21',['enQueue',['../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d',1,'queue']]], + ['ensurenotempty_22',['ensureNotEmpty',['../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604',1,'queue']]], + ['entropy_23',['entropy',['http://en.cppreference.com/w/cpp/numeric/random/random_device/entropy.html',0,'std::random_device']]], + ['entry_24',['Entry',['../d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475',1,'double_hashing::Entry::Entry()'],['../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77',1,'linear_probing::Entry::Entry()'],['../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e',1,'quadratic_probing::Entry::Entry()']]], + ['eof_25',['eof',['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::fstream::eof()'],['http://en.cppreference.com/w/cpp/string/char_traits/eof.html',0,'std::char_traits::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ios::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_fstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::strstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wiostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wfstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wstringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ifstream::eof()']]], + ['epptr_26',['epptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::epptr()']]], + ['epsilon_27',['epsilon',['http://en.cppreference.com/w/cpp/types/numeric_limits/epsilon.html',0,'std::numeric_limits']]], + ['eq_28',['eq',['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits::eq()'],['../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(): bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713',1,'numerical_methods::false_position::eq()'],['../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i): newton_raphson_method.cpp'],['../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389',1,'eq(float y): successive_approximation.cpp']]], + ['eq_5fder_29',['eq_der',['../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386',1,'newton_raphson_method.cpp']]], + ['eq_5fint_5ftype_30',['eq_int_type',['http://en.cppreference.com/w/cpp/string/char_traits/eq_int_type.html',0,'std::char_traits']]], + ['eqd_31',['eqd',['../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456',1,'successive_approximation.cpp']]], + ['equal_32',['equal',['http://en.cppreference.com/w/cpp/algorithm/equal.html',0,'std']]], + ['equal_5frange_33',['equal_range',['http://en.cppreference.com/w/cpp/container/multiset/equal_range.html',0,'std::multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/set/equal_range.html',0,'std::set::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_map/equal_range.html',0,'std::unordered_map::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/equal_range.html',0,'std::unordered_multimap::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/equal_range.html',0,'std::unordered_multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/map/equal_range.html',0,'std::map::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_set/equal_range.html',0,'std::unordered_set::equal_range()'],['http://en.cppreference.com/w/cpp/container/multimap/equal_range.html',0,'std::multimap::equal_range()'],['http://en.cppreference.com/w/cpp/algorithm/equal_range.html',0,'std::equal_range()']]], + ['equal_5fshuffle_34',['equal_shuffle',['../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f',1,'machine_learning']]], + ['equivalent_35',['equivalent',['http://en.cppreference.com/w/cpp/error/error_category/equivalent.html',0,'std::error_category']]], + ['erase_36',['erase',['http://en.cppreference.com/w/cpp/container/vector/erase.html',0,'std::vector::erase()'],['http://en.cppreference.com/w/cpp/container/multiset/erase.html',0,'std::multiset::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::string::erase()'],['http://en.cppreference.com/w/cpp/container/set/erase.html',0,'std::set::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_map/erase.html',0,'std::unordered_map::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/erase.html',0,'std::unordered_multimap::erase()'],['http://en.cppreference.com/w/cpp/container/deque/erase.html',0,'std::deque::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::basic_string::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::wstring::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/erase.html',0,'std::unordered_multiset::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u16string::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u32string::erase()'],['http://en.cppreference.com/w/cpp/container/list/erase.html',0,'std::list::erase()'],['http://en.cppreference.com/w/cpp/container/map/erase.html',0,'std::map::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_set/erase.html',0,'std::unordered_set::erase()'],['http://en.cppreference.com/w/cpp/container/multimap/erase.html',0,'std::multimap::erase()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1fb1792ab867dc26639eef368a56989e',1,'data_structures::linked_list::list::erase()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469',1,'data_structures::treap::Treap::erase()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::erase()']]], + ['erase_5fafter_37',['erase_after',['http://en.cppreference.com/w/cpp/container/forward_list/erase_after.html',0,'std::forward_list']]], + ['erasefromsorted_38',['eraseFromSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e',1,'probability::windowed_median::WindowedMedian']]], + ['erf_39',['erf',['http://en.cppreference.com/w/cpp/numeric/math/erf.html',0,'std']]], + ['erfc_40',['erfc',['http://en.cppreference.com/w/cpp/numeric/math/erfc.html',0,'std']]], + ['error_5fcategory_41',['error_category',['http://en.cppreference.com/w/cpp/error/error_category/error_category.html',0,'std::error_category']]], + ['error_5fcode_42',['error_code',['http://en.cppreference.com/w/cpp/error/error_code/error_code.html',0,'std::error_code']]], + ['error_5fcondition_43',['error_condition',['http://en.cppreference.com/w/cpp/error/error_condition/error_condition.html',0,'std::error_condition']]], + ['euclidean_5fdistance_44',['euclidean_distance',['../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69',1,'machine_learning::k_nearest_neighbors']]], + ['evaluate_45',['evaluate',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e',1,'machine_learning::neural_network::NeuralNetwork::evaluate()'],['../d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338',1,'others::postfix_expression::evaluate()']]], + ['evaluate_5ffrom_5fcsv_46',['evaluate_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848',1,'machine_learning::neural_network::NeuralNetwork']]], + ['exact_5fsolution_47',['exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_semi_implicit_euler.cpp']]], + ['exception_48',['exception',['http://en.cppreference.com/w/cpp/error/exception/exception.html',0,'std::exception']]], + ['exceptions_49',['exceptions',['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::fstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ios::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_fstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::strstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wiostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wfstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wstringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ifstream::exceptions()']]], + ['exchange_50',['exchange',['http://en.cppreference.com/w/cpp/atomic/atomic/exchange.html',0,'std::atomic']]], + ['exists_51',['exists',['../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81',1,'dynamic_programming::word_break']]], + ['exit_52',['exit',['http://en.cppreference.com/w/cpp/utility/program/exit.html',0,'std']]], + ['exp_53',['exp',['http://en.cppreference.com/w/cpp/numeric/math/exp.html',0,'std::exp()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0',1,'ciphers::elliptic_curve_key_exchange::exp()']]], + ['exp2_54',['exp2',['http://en.cppreference.com/w/cpp/numeric/math/exp2.html',0,'std']]], + ['expected_5fvalue_55',['expected_value',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413',1,'probability::geometric_dist::geometric_distribution']]], + ['expired_56',['expired',['http://en.cppreference.com/w/cpp/memory/weak_ptr/expired.html',0,'std::weak_ptr']]], + ['explore_57',['explore',['../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8',1,'graph::explore(const std::vector< std::vector< int > > *adj, int u, std::vector< bool > *visited)'],['../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463',1,'graph::explore(const std::vector< std::vector< size_t > > &adj, size_t v, std::vector< bool > *visited)']]], + ['expm1_58',['expm1',['http://en.cppreference.com/w/cpp/numeric/math/expm1.html',0,'std']]], + ['exponential_5fdistribution_59',['exponential_distribution',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/exponential_distribution.html',0,'std::exponential_distribution']]], + ['extendedeuclid_60',['extendedEuclid',['../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d',1,'extended_euclid_algorithm.cpp']]], + ['extendedeuclid_5f1_61',['extendedEuclid_1',['../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25',1,'extended_euclid_algorithm.cpp']]], + ['extract_5fbyte_62',['extract_byte',['../d4/d08/sha256_8cpp.html#afea411191ec5281f43e91ea327984627',1,'hashing::sha256']]], + ['extractmin_63',['extractMin',['../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980',1,'MinHeap']]], + ['extreme_5fvalue_5fdistribution_64',['extreme_value_distribution',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/extreme_value_distribution.html',0,'std::extreme_value_distribution']]] ]; diff --git a/search/functions_6.js b/search/functions_6.js index fbedbab5e..f04deeb40 100644 --- a/search/functions_6.js +++ b/search/functions_6.js @@ -5,8 +5,8 @@ var searchData= ['facet_2',['facet',['http://en.cppreference.com/w/cpp/locale/locale/facet/facet.html',0,'std::locale::facet']]], ['fact_3',['fact',['../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a',1,'poisson_dist.cpp']]], ['factorial_4',['factorial',['../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a',1,'math']]], - ['fail_5',['fail',['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::strstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wiostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wfstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wstringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ios::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostringstream::fail()']]], - ['failure_6',['failure',['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ios_base::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::strstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wiostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ios::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wstringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wfstream::failure::failure()']]], + ['fail_5',['fail',['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ios::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::strstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wiostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wfstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wstringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ifstream::fail()']]], + ['failure_6',['failure',['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ios::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ios_base::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::strstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wiostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wfstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wstringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ifstream::failure::failure()']]], ['falsename_7',['falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::falsename()']]], ['fast_5finvsqrt_8',['Fast_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52',1,'inv_sqrt.cpp']]], ['fast_5fpower_5flinear_9',['fast_power_linear',['../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d',1,'fast_power.cpp']]], @@ -20,7 +20,7 @@ var searchData= ['fegetexceptflag_17',['fegetexceptflag',['http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html',0,'std']]], ['fegetround_18',['fegetround',['http://en.cppreference.com/w/cpp/numeric/fenv/feround.html',0,'std']]], ['feholdexcept_19',['feholdexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feholdexcept.html',0,'std']]], - ['fenwick_5ftree_20',['fenwick_tree',['../de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c',1,'range_queries::fenwick_tree::fenwick_tree(T x)'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a',1,'range_queries::fenwick_tree::fenwick_tree(const std::vector< T > &arr)']]], + ['fenwick_5ftree_20',['fenwick_tree',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a',1,'range_queries::fenwick_tree::fenwick_tree(const std::vector< T > &arr)'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c',1,'range_queries::fenwick_tree::fenwick_tree(T x)']]], ['feof_21',['feof',['http://en.cppreference.com/w/cpp/io/c/feof.html',0,'std']]], ['feraiseexcept_22',['feraiseexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feraiseexcept.html',0,'std']]], ['ferror_23',['ferror',['http://en.cppreference.com/w/cpp/io/c/ferror.html',0,'std']]], @@ -40,87 +40,89 @@ var searchData= ['fgets_37',['fgets',['http://en.cppreference.com/w/cpp/io/c/fgets.html',0,'std']]], ['fgetwc_38',['fgetwc',['http://en.cppreference.com/w/cpp/io/c/fgetwc.html',0,'std']]], ['fgetws_39',['fgetws',['http://en.cppreference.com/w/cpp/io/c/fgetws.html',0,'std']]], - ['fib_40',['fib',['../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db',1,'fib(uint64_t n): fibonacci_large.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f',1,'fib(uint64_t n): fibonacci_fast.cpp']]], + ['fib_40',['fib',['../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f',1,'fib(uint64_t n): fibonacci_fast.cpp'],['../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db',1,'fib(uint64_t n): fibonacci_large.cpp']]], ['fib_5faccurate_41',['fib_Accurate',['../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca',1,'string_fibonacci.cpp']]], ['fibo_42',['fibo',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f',1,'fibonacci_matrix_exponentiation.cpp']]], ['fibonacci_43',['fibonacci',['../d9/d89/fibonacci_8cpp.html#aaf94f3212385cff0a5f19ff6b0cce8e7',1,'fibonacci.cpp']]], ['fibonacci_5fsearch_44',['fibonacci_search',['../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61',1,'fibonacci_search.cpp']]], ['fibosum_45',['fiboSum',['../de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742',1,'math::fibonacci_sum']]], ['filebuf_46',['filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::filebuf']]], - ['fill_47',['fill',['http://en.cppreference.com/w/cpp/container/array/fill.html',0,'std::array::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wstringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wfstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostrstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wiostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istrstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::strstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_fstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ios::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostream::fill()'],['http://en.cppreference.com/w/cpp/container/dynarray/fill.html',0,'std::dynarray::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::fstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ofstream::fill()'],['http://en.cppreference.com/w/cpp/algorithm/fill.html',0,'std::fill()'],['../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780',1,'fill(): decimal_to_roman_numeral.cpp']]], + ['fill_47',['fill',['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::fstream::fill()'],['http://en.cppreference.com/w/cpp/container/dynarray/fill.html',0,'std::dynarray::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ios::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_fstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::strstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istrstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wiostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostrstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wfstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wstringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ifstream::fill()'],['http://en.cppreference.com/w/cpp/container/array/fill.html',0,'std::array::fill()'],['http://en.cppreference.com/w/cpp/algorithm/fill.html',0,'std::fill()'],['../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780',1,'fill(): decimal_to_roman_numeral.cpp']]], ['fill_5fn_48',['fill_n',['http://en.cppreference.com/w/cpp/algorithm/fill_n.html',0,'std']]], - ['find_49',['find',['http://en.cppreference.com/w/cpp/container/set/find.html',0,'std::set::find()'],['http://en.cppreference.com/w/cpp/container/multiset/find.html',0,'std::multiset::find()'],['http://en.cppreference.com/w/cpp/string/char_traits/find.html',0,'std::char_traits::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::string::find()'],['http://en.cppreference.com/w/cpp/container/unordered_map/find.html',0,'std::unordered_map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/find.html',0,'std::unordered_multimap::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::basic_string::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::wstring::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/find.html',0,'std::unordered_multiset::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u16string::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u32string::find()'],['http://en.cppreference.com/w/cpp/container/map/find.html',0,'std::map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_set/find.html',0,'std::unordered_set::find()'],['http://en.cppreference.com/w/cpp/container/multimap/find.html',0,'std::multimap::find()'],['../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a',1,'hash_chain::find()'],['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std::find()'],['../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d',1,'quadratic_probing::find()'],['../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8',1,'Find(): disjoint_set.cpp']]], - ['find_5fend_50',['find_end',['http://en.cppreference.com/w/cpp/algorithm/find_end.html',0,'std']]], - ['find_5ffirst_5fnot_5fof_51',['find_first_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u32string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::basic_string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::wstring::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u16string::find_first_not_of()']]], - ['find_5ffirst_5fof_52',['find_first_of',['http://en.cppreference.com/w/cpp/algorithm/find_first_of.html',0,'std::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::basic_string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u32string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::wstring::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u16string::find_first_of()']]], - ['find_5fif_53',['find_if',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]], - ['find_5fif_5fnot_54',['find_if_not',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]], - ['find_5flast_5fnot_5fof_55',['find_last_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::basic_string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::wstring::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u16string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u32string::find_last_not_of()']]], - ['find_5flast_5fof_56',['find_last_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::basic_string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::wstring::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u16string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u32string::find_last_of()']]], - ['find_5fmax_57',['find_max',['../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb',1,'binary_search_tree::find_max(std::unique_ptr< bst_node > &node, T &ret_value)'],['../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0',1,'binary_search_tree::find_max(T &ret_value)']]], - ['find_5fmin_58',['find_min',['../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153',1,'binary_search_tree::find_min(std::unique_ptr< bst_node > &node, T &ret_value)'],['../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03',1,'binary_search_tree::find_min(T &ret_value)']]], - ['find_5fnon_5frepeating_5finteger_59',['find_non_repeating_integer',['../d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3',1,'bit_manipulation::find_non_repeating_integer']]], - ['find_5fpat_5fin_5ftext_60',['find_pat_in_text',['../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8',1,'z_function.cpp']]], - ['find_5fset_61',['find_set',['../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e',1,'graph::disjoint_union']]], - ['find_5fzero_62',['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_63',['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_64',['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_65',['findMinimumEdge',['../d2/d90/namespacegreedy__algorithms.html#a127ce4403660032f53ae2e6467e5427d',1,'greedy_algorithms']]], - ['findminindex_66',['findMinIndex',['../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834',1,'sorting::selection_sort_recursive']]], - ['findminnode_67',['findMinNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db',1,'operations_on_datastructures::inorder_traversal_of_bst']]], - ['findnextgap_68',['FindNextGap',['../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5',1,'comb_sort.cpp']]], - ['findparent_69',['findParent',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]], - ['findset_70',['findset',['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)'],['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)']]], - ['findshifttable_71',['findShiftTable',['../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336',1,'strings::horspool']]], - ['first_5ftest_72',['first_test',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300',1,'finding_number_of_digits_in_a_number.cpp']]], - ['fisher_5ff_5fdistribution_73',['fisher_f_distribution',['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/fisher_f_distribution.html',0,'std::fisher_f_distribution']]], - ['fit_74',['fit',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0',1,'machine_learning::neural_network::NeuralNetwork::fit()'],['../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'machine_learning::adaline::fit(std::array< std::vector< double >, N > const &X, std::array< int, N > const &Y)'],['../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5',1,'machine_learning::adaline::fit(const std::vector< double > &x, const int &y)']]], - ['fit_5ffrom_5fcsv_75',['fit_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff',1,'machine_learning::neural_network::NeuralNetwork']]], - ['fit_5fols_5fregressor_76',['fit_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b',1,'ordinary_least_squares_regressor.cpp']]], - ['fixed_77',['fixed',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], - ['flags_78',['flags',['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_fstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::wregex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ios_base::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::basic_regex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::strstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wiostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::fstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ifstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::regex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wfstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wstringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ios::flags()']]], - ['flip_79',['flip',['http://en.cppreference.com/w/cpp/utility/bitset/flip.html',0,'std::bitset']]], - ['floor_80',['floor',['http://en.cppreference.com/w/cpp/numeric/math/floor.html',0,'std']]], - ['flush_81',['flush',['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostrstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_fstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::fstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wiostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wfstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wstringstream::flush()'],['http://en.cppreference.com/w/cpp/io/manip/flush.html',0,'std::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::strstream::flush()']]], - ['fma_82',['fma',['http://en.cppreference.com/w/cpp/numeric/math/fma.html',0,'std']]], - ['fmax_83',['fmax',['http://en.cppreference.com/w/cpp/numeric/math/fmax.html',0,'std']]], - ['fmin_84',['fmin',['http://en.cppreference.com/w/cpp/numeric/math/fmin.html',0,'std']]], - ['fmod_85',['fmod',['http://en.cppreference.com/w/cpp/numeric/math/fmod.html',0,'std']]], - ['fopen_86',['fopen',['http://en.cppreference.com/w/cpp/io/c/fopen.html',0,'std']]], - ['for_5feach_87',['for_each',['http://en.cppreference.com/w/cpp/algorithm/for_each.html',0,'std']]], - ['format_88',['format',['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::cmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::smatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wcmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wsmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::match_results::format()']]], - ['forward_89',['forward',['http://en.cppreference.com/w/cpp/utility/forward.html',0,'std']]], - ['forward_5fas_5ftuple_90',['forward_as_tuple',['http://en.cppreference.com/w/cpp/utility/tuple/forward_as_tuple.html',0,'std']]], - ['forward_5feuler_91',['forward_euler',['../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9',1,'ode_forward_euler.cpp']]], - ['forward_5feuler_5fstep_92',['forward_euler_step',['../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723',1,'ode_forward_euler.cpp']]], - ['forward_5flist_93',['forward_list',['http://en.cppreference.com/w/cpp/container/forward_list/forward_list.html',0,'std::forward_list']]], - ['fpclassify_94',['fpclassify',['http://en.cppreference.com/w/cpp/numeric/math/fpclassify.html',0,'std']]], - ['fprintf_95',['fprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], - ['fputc_96',['fputc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]], - ['fputs_97',['fputs',['http://en.cppreference.com/w/cpp/io/c/fputs.html',0,'std']]], - ['fputwc_98',['fputwc',['http://en.cppreference.com/w/cpp/io/c/fputwc.html',0,'std']]], - ['fputws_99',['fputws',['http://en.cppreference.com/w/cpp/io/c/fputws.html',0,'std']]], - ['frac_5fdigits_100',['frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::frac_digits()']]], - ['fread_101',['fread',['http://en.cppreference.com/w/cpp/io/c/fread.html',0,'std']]], - ['free_102',['free',['http://en.cppreference.com/w/cpp/memory/c/free.html',0,'std']]], - ['freenode_103',['freeNode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02',1,'linkedlist_implentation_usingarray.cpp']]], - ['freeze_104',['freeze',['http://en.cppreference.com/w/cpp/io/strstreambuf/freeze.html',0,'std::strstreambuf::freeze()'],['http://en.cppreference.com/w/cpp/io/ostrstream/freeze.html',0,'std::ostrstream::freeze()'],['http://en.cppreference.com/w/cpp/io/strstream/freeze.html',0,'std::strstream::freeze()']]], - ['freopen_105',['freopen',['http://en.cppreference.com/w/cpp/io/c/freopen.html',0,'std']]], - ['frexp_106',['frexp',['http://en.cppreference.com/w/cpp/numeric/math/frexp.html',0,'std']]], - ['from_5fbytes_107',['from_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/from_bytes.html',0,'std::wstring_convert']]], - ['from_5ftime_5ft_108',['from_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/from_time_t.html',0,'std::chrono::system_clock']]], - ['front_109',['front',['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::basic_string::front()'],['http://en.cppreference.com/w/cpp/container/queue/front.html',0,'std::queue::front()'],['http://en.cppreference.com/w/cpp/container/deque/front.html',0,'std::deque::front()'],['http://en.cppreference.com/w/cpp/container/forward_list/front.html',0,'std::forward_list::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::string::front()'],['http://en.cppreference.com/w/cpp/container/vector/front.html',0,'std::vector::front()'],['http://en.cppreference.com/w/cpp/container/dynarray/front.html',0,'std::dynarray::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::wstring::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u16string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u32string::front()'],['http://en.cppreference.com/w/cpp/container/list/front.html',0,'std::list::front()'],['http://en.cppreference.com/w/cpp/container/array/front.html',0,'std::array::front()'],['../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7',1,'queue::front()']]], - ['front_5finserter_110',['front_inserter',['http://en.cppreference.com/w/cpp/iterator/front_inserter.html',0,'std']]], - ['fscanf_111',['fscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]], - ['fseek_112',['fseek',['http://en.cppreference.com/w/cpp/io/c/fseek.html',0,'std']]], - ['fsetpos_113',['fsetpos',['http://en.cppreference.com/w/cpp/io/c/fsetpos.html',0,'std']]], - ['fstream_114',['fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::fstream']]], - ['ftell_115',['ftell',['http://en.cppreference.com/w/cpp/io/c/ftell.html',0,'std']]], - ['function_116',['function',['http://en.cppreference.com/w/cpp/utility/functional/function/function.html',0,'std::function']]], - ['future_117',['future',['http://en.cppreference.com/w/cpp/thread/future/future.html',0,'std::future']]], - ['future_5fcategory_118',['future_category',['http://en.cppreference.com/w/cpp/thread/future/future_category.html',0,'std']]], - ['future_5ferror_119',['future_error',['http://en.cppreference.com/w/cpp/thread/future_error/future_error.html',0,'std::future_error']]], - ['fwprintf_120',['fwprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], - ['fwrite_121',['fwrite',['http://en.cppreference.com/w/cpp/io/c/fwrite.html',0,'std']]], - ['fwscanf_122',['fwscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]] + ['find_49',['find',['http://en.cppreference.com/w/cpp/string/char_traits/find.html',0,'std::char_traits::find()'],['http://en.cppreference.com/w/cpp/container/multiset/find.html',0,'std::multiset::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::string::find()'],['http://en.cppreference.com/w/cpp/container/set/find.html',0,'std::set::find()'],['http://en.cppreference.com/w/cpp/container/unordered_map/find.html',0,'std::unordered_map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/find.html',0,'std::unordered_multimap::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::basic_string::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::wstring::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/find.html',0,'std::unordered_multiset::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u16string::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u32string::find()'],['http://en.cppreference.com/w/cpp/container/map/find.html',0,'std::map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_set/find.html',0,'std::unordered_set::find()'],['http://en.cppreference.com/w/cpp/container/multimap/find.html',0,'std::multimap::find()'],['../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a',1,'hash_chain::find()']]], + ['find_50',['Find',['../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8',1,'disjoint_set.cpp']]], + ['find_51',['find',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std::find()'],['../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d',1,'quadratic_probing::find()']]], + ['find_5fend_52',['find_end',['http://en.cppreference.com/w/cpp/algorithm/find_end.html',0,'std']]], + ['find_5ffirst_5fnot_5fof_53',['find_first_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::basic_string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::wstring::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u16string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u32string::find_first_not_of()']]], + ['find_5ffirst_5fof_54',['find_first_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::basic_string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::wstring::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u16string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u32string::find_first_of()'],['http://en.cppreference.com/w/cpp/algorithm/find_first_of.html',0,'std::find_first_of(T... args)']]], + ['find_5fif_55',['find_if',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]], + ['find_5fif_5fnot_56',['find_if_not',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]], + ['find_5flast_5fnot_5fof_57',['find_last_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::basic_string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::wstring::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u16string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u32string::find_last_not_of()']]], + ['find_5flast_5fof_58',['find_last_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::basic_string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::wstring::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u16string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u32string::find_last_of()']]], + ['find_5fmax_59',['find_max',['../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb',1,'binary_search_tree::find_max(std::unique_ptr< bst_node > &node, T &ret_value)'],['../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0',1,'binary_search_tree::find_max(T &ret_value)']]], + ['find_5fmin_60',['find_min',['../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153',1,'binary_search_tree::find_min(std::unique_ptr< bst_node > &node, T &ret_value)'],['../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03',1,'binary_search_tree::find_min(T &ret_value)']]], + ['find_5fnon_5frepeating_5finteger_61',['find_non_repeating_integer',['../d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3',1,'bit_manipulation::find_non_repeating_integer']]], + ['find_5fpat_5fin_5ftext_62',['find_pat_in_text',['../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8',1,'z_function.cpp']]], + ['find_5fset_63',['find_set',['../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e',1,'graph::disjoint_union']]], + ['find_5fzero_64',['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_65',['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_66',['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_67',['findMinimumEdge',['../d2/d90/namespacegreedy__algorithms.html#a127ce4403660032f53ae2e6467e5427d',1,'greedy_algorithms']]], + ['findminindex_68',['findMinIndex',['../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834',1,'sorting::selection_sort_recursive']]], + ['findminnode_69',['findMinNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db',1,'operations_on_datastructures::inorder_traversal_of_bst']]], + ['findnextgap_70',['FindNextGap',['../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5',1,'comb_sort.cpp']]], + ['findparent_71',['findParent',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]], + ['findset_72',['findSet',['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)'],['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)']]], + ['findshifttable_73',['findShiftTable',['../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336',1,'strings::horspool']]], + ['first_5ftest_74',['first_test',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300',1,'finding_number_of_digits_in_a_number.cpp']]], + ['fisher_5ff_5fdistribution_75',['fisher_f_distribution',['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/fisher_f_distribution.html',0,'std::fisher_f_distribution']]], + ['fit_76',['fit',['../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5',1,'machine_learning::adaline::fit(const std::vector< double > &x, const int &y)'],['../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'machine_learning::adaline::fit(std::array< std::vector< double >, N > const &X, std::array< int, N > const &Y)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0',1,'machine_learning::neural_network::NeuralNetwork::fit(const std::vector< std::vector< std::valarray< double > > > &X_, const std::vector< std::vector< std::valarray< double > > > &Y_, const int &epochs=100, const double &learning_rate=0.01, const size_t &batch_size=32, const bool &shuffle=true)']]], + ['fit_5ffrom_5fcsv_77',['fit_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff',1,'machine_learning::neural_network::NeuralNetwork']]], + ['fit_5fols_5fregressor_78',['fit_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b',1,'ordinary_least_squares_regressor.cpp']]], + ['fixed_79',['fixed',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], + ['flags_80',['flags',['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::fstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostringstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::regex::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::basic_regex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ios::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_fstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::wregex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ios_base::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::strstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wiostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wfstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wstringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ifstream::flags()']]], + ['flip_81',['flip',['http://en.cppreference.com/w/cpp/utility/bitset/flip.html',0,'std::bitset']]], + ['floor_82',['floor',['http://en.cppreference.com/w/cpp/numeric/math/floor.html',0,'std']]], + ['flush_83',['flush',['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::fstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_fstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::strstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wiostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostrstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wfstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wstringstream::flush()'],['http://en.cppreference.com/w/cpp/io/manip/flush.html',0,'std::flush(T... args)']]], + ['fma_84',['fma',['http://en.cppreference.com/w/cpp/numeric/math/fma.html',0,'std']]], + ['fmax_85',['fmax',['http://en.cppreference.com/w/cpp/numeric/math/fmax.html',0,'std']]], + ['fmin_86',['fmin',['http://en.cppreference.com/w/cpp/numeric/math/fmin.html',0,'std']]], + ['fmod_87',['fmod',['http://en.cppreference.com/w/cpp/numeric/math/fmod.html',0,'std']]], + ['fopen_88',['fopen',['http://en.cppreference.com/w/cpp/io/c/fopen.html',0,'std']]], + ['for_5feach_89',['for_each',['http://en.cppreference.com/w/cpp/algorithm/for_each.html',0,'std']]], + ['format_90',['format',['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::match_results::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wsmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::smatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wcmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::cmatch::format()']]], + ['forward_91',['forward',['http://en.cppreference.com/w/cpp/utility/forward.html',0,'std']]], + ['forward_5fas_5ftuple_92',['forward_as_tuple',['http://en.cppreference.com/w/cpp/utility/tuple/forward_as_tuple.html',0,'std']]], + ['forward_5feuler_93',['forward_euler',['../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9',1,'ode_forward_euler.cpp']]], + ['forward_5feuler_5fstep_94',['forward_euler_step',['../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723',1,'ode_forward_euler.cpp']]], + ['forward_5flist_95',['forward_list',['http://en.cppreference.com/w/cpp/container/forward_list/forward_list.html',0,'std::forward_list']]], + ['fpclassify_96',['fpclassify',['http://en.cppreference.com/w/cpp/numeric/math/fpclassify.html',0,'std']]], + ['fprintf_97',['fprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['fputc_98',['fputc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]], + ['fputs_99',['fputs',['http://en.cppreference.com/w/cpp/io/c/fputs.html',0,'std']]], + ['fputwc_100',['fputwc',['http://en.cppreference.com/w/cpp/io/c/fputwc.html',0,'std']]], + ['fputws_101',['fputws',['http://en.cppreference.com/w/cpp/io/c/fputws.html',0,'std']]], + ['frac_5fdigits_102',['frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::frac_digits()']]], + ['fread_103',['fread',['http://en.cppreference.com/w/cpp/io/c/fread.html',0,'std']]], + ['free_104',['free',['http://en.cppreference.com/w/cpp/memory/c/free.html',0,'std']]], + ['freenode_105',['freeNode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02',1,'linkedlist_implentation_usingarray.cpp']]], + ['freeze_106',['freeze',['http://en.cppreference.com/w/cpp/io/strstreambuf/freeze.html',0,'std::strstreambuf::freeze()'],['http://en.cppreference.com/w/cpp/io/strstream/freeze.html',0,'std::strstream::freeze()'],['http://en.cppreference.com/w/cpp/io/ostrstream/freeze.html',0,'std::ostrstream::freeze()']]], + ['freopen_107',['freopen',['http://en.cppreference.com/w/cpp/io/c/freopen.html',0,'std']]], + ['frexp_108',['frexp',['http://en.cppreference.com/w/cpp/numeric/math/frexp.html',0,'std']]], + ['from_5fbytes_109',['from_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/from_bytes.html',0,'std::wstring_convert']]], + ['from_5ftime_5ft_110',['from_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/from_time_t.html',0,'std::chrono::system_clock']]], + ['front_111',['front',['http://en.cppreference.com/w/cpp/container/dynarray/front.html',0,'std::dynarray::front()'],['http://en.cppreference.com/w/cpp/container/vector/front.html',0,'std::vector::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::string::front()'],['http://en.cppreference.com/w/cpp/container/forward_list/front.html',0,'std::forward_list::front()'],['http://en.cppreference.com/w/cpp/container/deque/front.html',0,'std::deque::front()'],['http://en.cppreference.com/w/cpp/container/queue/front.html',0,'std::queue::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::basic_string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::wstring::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u16string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u32string::front()'],['http://en.cppreference.com/w/cpp/container/list/front.html',0,'std::list::front()'],['http://en.cppreference.com/w/cpp/container/array/front.html',0,'std::array::front()'],['../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7',1,'queue::front()']]], + ['front_5finserter_112',['front_inserter',['http://en.cppreference.com/w/cpp/iterator/front_inserter.html',0,'std']]], + ['fscanf_113',['fscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]], + ['fseek_114',['fseek',['http://en.cppreference.com/w/cpp/io/c/fseek.html',0,'std']]], + ['fsetpos_115',['fsetpos',['http://en.cppreference.com/w/cpp/io/c/fsetpos.html',0,'std']]], + ['fstream_116',['fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::fstream']]], + ['ftell_117',['ftell',['http://en.cppreference.com/w/cpp/io/c/ftell.html',0,'std']]], + ['function_118',['function',['http://en.cppreference.com/w/cpp/utility/functional/function/function.html',0,'std::function']]], + ['future_119',['future',['http://en.cppreference.com/w/cpp/thread/future/future.html',0,'std::future']]], + ['future_5fcategory_120',['future_category',['http://en.cppreference.com/w/cpp/thread/future/future_category.html',0,'std']]], + ['future_5ferror_121',['future_error',['http://en.cppreference.com/w/cpp/thread/future_error/future_error.html',0,'std::future_error']]], + ['fwprintf_122',['fwprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], + ['fwrite_123',['fwrite',['http://en.cppreference.com/w/cpp/io/c/fwrite.html',0,'std']]], + ['fwscanf_124',['fwscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]] ]; diff --git a/search/functions_7.js b/search/functions_7.js index e96a0bb2b..24604263e 100644 --- a/search/functions_7.js +++ b/search/functions_7.js @@ -2,12 +2,12 @@ var searchData= [ ['g_0',['g',['../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad',1,'numerical_methods::simpson_method::g()'],['../df/d11/midpoint__integral__method_8cpp.html#ae682ee71af44b1e9e884849cc6a6b040',1,'numerical_methods::midpoint_rule::g()']]], ['gamma_5fdistribution_1',['gamma_distribution',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/gamma_distribution.html',0,'std::gamma_distribution']]], - ['gbump_2',['gbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wfilebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::strstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_streambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::streambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstringbuf::gbump()']]], + ['gbump_2',['gbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wfilebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::strstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_streambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::streambuf::gbump()']]], ['gcd_3',['gcd',['../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0',1,'ciphers::HillCipher::gcd()'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a',1,'gcd(int *a, int n): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2): gcd_recursive_euclidean.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563',1,'gcd(unsigned int x, unsigned int y): least_common_multiple.cpp']]], ['gcdextended_4',['gcdExtended',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#afde201f4687740454302c444f507a926',1,'math::ncr_modulo_p::NCRModuloP']]], - ['gcount_5',['gcount',['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::strstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istrstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wiostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_ifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wfstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wstringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::ifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::stringstream::gcount()']]], + ['gcount_5',['gcount',['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::strstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istrstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wiostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_ifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wfstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wstringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::ifstream::gcount()']]], ['genarray_6',['genArray',['../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5',1,'spiral_print.cpp']]], - ['generate_7',['generate',['../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160',1,'backtracking::generate_parentheses::generate()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/generate.html',0,'std::seed_seq::generate()'],['http://en.cppreference.com/w/cpp/algorithm/generate.html',0,'std::generate(T... args)']]], + ['generate_7',['generate',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/generate.html',0,'std::seed_seq::generate()'],['../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160',1,'backtracking::generate_parentheses::generate()'],['http://en.cppreference.com/w/cpp/algorithm/generate.html',0,'std::generate(T... args)']]], ['generate_5fcanonical_8',['generate_canonical',['http://en.cppreference.com/w/cpp/numeric/random/generate_canonical.html',0,'std']]], ['generate_5fdecryption_5fkey_9',['generate_decryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706',1,'ciphers::HillCipher']]], ['generate_5fencryption_5fkey_10',['generate_encryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e',1,'ciphers::HillCipher']]], @@ -18,13 +18,13 @@ var searchData= ['generate_5funiform_15',['generate_uniform',['../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba',1,'probability::geometric_dist']]], ['generateunsortedarray_16',['generateUnsortedArray',['../d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d',1,'sorting::random_pivot_quick_sort']]], ['generic_5fcategory_17',['generic_category',['http://en.cppreference.com/w/cpp/error/generic_category.html',0,'std']]], - ['geometric_5fdistribution_18',['geometric_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797',1,'probability::geometric_dist::geometric_distribution::geometric_distribution()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/geometric_distribution.html',0,'std::geometric_distribution::geometric_distribution()']]], - ['get_19',['get',['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::strstream::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_stringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istrstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wiostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_ifstream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istringstream::get()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/get.html',0,'std::auto_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wfstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_iostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wstringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::ifstream::get()'],['../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a',1,'dsu::get()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420',1,'machine_learning::aystar_search::EightPuzzle::get()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper::get()'],['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::fstream::get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::get()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html',0,'std::shared_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_fstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::iostream::get()'],['http://en.cppreference.com/w/cpp/thread/shared_future/get.html',0,'std::shared_future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::stringstream::get()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html',0,'std::unique_ptr::get()'],['http://en.cppreference.com/w/cpp/thread/future/get.html',0,'std::future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wifstream::get()']]], + ['geometric_5fdistribution_18',['geometric_distribution',['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/geometric_distribution.html',0,'std::geometric_distribution::geometric_distribution()'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797',1,'probability::geometric_dist::geometric_distribution::geometric_distribution()']]], + ['get_19',['get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::fstream::get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::get()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html',0,'std::shared_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_fstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::iostream::get()'],['http://en.cppreference.com/w/cpp/thread/shared_future/get.html',0,'std::shared_future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::stringstream::get()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html',0,'std::unique_ptr::get()'],['http://en.cppreference.com/w/cpp/thread/future/get.html',0,'std::future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wifstream::get()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::strstream::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_stringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istrstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wiostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_ifstream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istringstream::get()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/get.html',0,'std::auto_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wfstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_iostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wstringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::ifstream::get()'],['../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a',1,'dsu::get()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420',1,'machine_learning::aystar_search::EightPuzzle::get()']]], ['get_5fall_5fwords_20',['get_all_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd',1,'data_structures::trie_using_hashmap::Trie']]], - ['get_5fallocator_21',['get_allocator',['http://en.cppreference.com/w/cpp/container/unordered_multiset/get_allocator.html',0,'std::unordered_multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u16string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u32string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/list/get_allocator.html',0,'std::list::get_allocator()'],['http://en.cppreference.com/w/cpp/container/map/get_allocator.html',0,'std::map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::cmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_set/get_allocator.html',0,'std::unordered_set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multimap/get_allocator.html',0,'std::multimap::get_allocator()'],['http://en.cppreference.com/w/cpp/container/vector/get_allocator.html',0,'std::vector::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::match_results::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multiset/get_allocator.html',0,'std::multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::wstring::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::basic_string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/deque/get_allocator.html',0,'std::deque::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wcmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/forward_list/get_allocator.html',0,'std::forward_list::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/get_allocator.html',0,'std::unordered_multimap::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::smatch::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wsmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_map/get_allocator.html',0,'std::unordered_map::get_allocator()'],['http://en.cppreference.com/w/cpp/container/set/get_allocator.html',0,'std::set::get_allocator()']]], + ['get_5fallocator_21',['get_allocator',['http://en.cppreference.com/w/cpp/container/vector/get_allocator.html',0,'std::vector::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::match_results::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multiset/get_allocator.html',0,'std::multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/set/get_allocator.html',0,'std::set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_map/get_allocator.html',0,'std::unordered_map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wsmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::smatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/get_allocator.html',0,'std::unordered_multimap::get_allocator()'],['http://en.cppreference.com/w/cpp/container/forward_list/get_allocator.html',0,'std::forward_list::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wcmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/deque/get_allocator.html',0,'std::deque::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::basic_string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::wstring::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/get_allocator.html',0,'std::unordered_multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u16string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u32string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/list/get_allocator.html',0,'std::list::get_allocator()'],['http://en.cppreference.com/w/cpp/container/map/get_allocator.html',0,'std::map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::cmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_set/get_allocator.html',0,'std::unordered_set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multimap/get_allocator.html',0,'std::multimap::get_allocator()']]], ['get_5fchar_22',['get_char',['../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da',1,'hashing::sha256']]], ['get_5fchar_5fidx_23',['get_char_idx',['../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41',1,'ciphers::HillCipher']]], - ['get_5fclock_5fdiff_24',['get_clock_diff',['../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_trace.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_topology.cpp']]], + ['get_5fclock_5fdiff_24',['get_clock_diff',['../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_trace.cpp']]], ['get_5fdate_25',['get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::get_date()']]], ['get_5fdeleter_26',['get_deleter',['http://en.cppreference.com/w/cpp/memory/unique_ptr/get_deleter.html',0,'std::unique_ptr']]], ['get_5felements_5finorder_27',['get_elements_inorder',['../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a',1,'binary_search_tree']]], @@ -42,9 +42,9 @@ var searchData= ['get_5fmax_39',['get_max',['../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde',1,'dsu']]], ['get_5fmin_40',['get_min',['../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415',1,'dsu']]], ['get_5fmin_5f2d_41',['get_min_2d',['../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e',1,'kohonen_som_topology.cpp']]], - ['get_5fminima_42',['get_minima',['../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function< double(double)> &f, double lim_a, double lim_b): golden_search_extrema.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function< double(double)> &f, double lim_a, double lim_b): brent_method_extrema.cpp']]], + ['get_5fminima_42',['get_minima',['../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function< double(double)> &f, double lim_a, double lim_b): brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function< double(double)> &f, double lim_a, double lim_b): golden_search_extrema.cpp']]], ['get_5fmoney_43',['get_money',['http://en.cppreference.com/w/cpp/io/manip/get_money.html',0,'std']]], - ['get_5fmonthname_44',['get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::get_monthname()']]], + ['get_5fmonthname_44',['get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::get_monthname()']]], ['get_5fnew_5fhandler_45',['get_new_handler',['http://en.cppreference.com/w/cpp/memory/new/get_new_handler.html',0,'std']]], ['get_5fnext_46',['get_next',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4',1,'data_structures::treap::Treap']]], ['get_5fpointer_5fsafety_47',['get_pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/get_pointer_safety.html',0,'std']]], @@ -61,7 +61,7 @@ var searchData= ['get_5ftranspose_58',['get_transpose',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb',1,'ordinary_least_squares_regressor.cpp']]], ['get_5funexpected_59',['get_unexpected',['http://en.cppreference.com/w/cpp/error/get_unexpected.html',0,'std']]], ['get_5funion_60',['get_union',['../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74',1,'operations_on_datastructures']]], - ['get_5fweekday_61',['get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::get_weekday()']]], + ['get_5fweekday_61',['get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::get_weekday()']]], ['get_5fxy_5ffrom_5fcsv_62',['get_XY_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d',1,'machine_learning::neural_network::NeuralNetwork']]], ['get_5fyear_63',['get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::get_year()']]], ['getadjlist_64',['getAdjList',['../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d',1,'Graph']]], @@ -82,8 +82,8 @@ var searchData= ['getitemleftchild_79',['GetItemLeftChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e',1,'data_structures::tree_234::Node']]], ['getitemrightchild_80',['GetItemRightChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95',1,'data_structures::tree_234::Node']]], ['getleftmostchild_81',['GetLeftmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e',1,'data_structures::tree_234::Node']]], - ['getline_82',['getline',['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_ifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istrstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wiostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istringstream::getline()'],['http://en.cppreference.com/w/cpp/string/basic_string/getline.html',0,'std::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::ifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wstringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wfstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::strstream::getline()']]], - ['getloc_83',['getloc',['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ifstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wstringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wfstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ifstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wiostream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::regex::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::basic_regex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ios::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::wregex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wfilebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ios_base::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::strstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wifstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/getloc.html',0,'std::regex_traits::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::strstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_stringstream::getloc()']]], + ['getline_82',['getline',['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::strstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istrstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wiostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_ifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wfstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wstringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::ifstream::getline()'],['http://en.cppreference.com/w/cpp/string/basic_string/getline.html',0,'std::getline()']]], + ['getloc_83',['getloc',['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::regex::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::basic_regex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ios::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::wregex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wfilebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ios_base::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::strstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wifstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/getloc.html',0,'std::regex_traits::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::strstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wiostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ifstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wfstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wstringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ifstream::getloc()']]], ['getmaxitem_84',['GetMaxItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57',1,'data_structures::tree_234::Node']]], ['getmedian_85',['getMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d',1,'probability::windowed_median::WindowedMedian']]], ['getmediannaive_86',['getMedianNaive',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6',1,'probability::windowed_median::WindowedMedian']]], @@ -91,23 +91,24 @@ var searchData= ['getminimum_88',['getMinimum',['../d4/d96/range__queries_2sparse__table_8cpp.html#a932816c3de9e5ad122b180de60978e8f',1,'range_queries::sparse_table']]], ['getminitem_89',['GetMinItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71',1,'data_structures::tree_234::Node']]], ['getnextpossiblechild_90',['GetNextPossibleChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46',1,'data_structures::tree_234::Node']]], - ['getnode_91',['getnode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst::getNode()'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'getnode(): linkedlist_implentation_usingarray.cpp']]], - ['getpagefault_92',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]], - ['getparents_93',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]], - ['getrandomindex_94',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]], - ['getrightmostchild_95',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]], - ['gets_96',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]], - ['gettreemaxitem_97',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]], - ['gettreeminitem_98',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]], - ['getvertices_99',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]], - ['getwchar_100',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]], - ['global_101',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]], - ['gmtime_102',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]], - ['gnomesort_103',['gnomesort',['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array< T, size > arr)'],['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)']]], - ['good_104',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()']]], - ['gptr_105',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()']]], - ['gram_5fschmidt_106',['gram_schmidt',['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt']]], - ['graph_107',['graph',['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &&adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector< Edge > const &edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()']]], - ['graphcoloring_108',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]], - ['grouping_109',['grouping',['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()']]] + ['getnode_91',['getNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst']]], + ['getnode_92',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]], + ['getpagefault_93',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]], + ['getparents_94',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]], + ['getrandomindex_95',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]], + ['getrightmostchild_96',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]], + ['gets_97',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]], + ['gettreemaxitem_98',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]], + ['gettreeminitem_99',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]], + ['getvertices_100',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]], + ['getwchar_101',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]], + ['global_102',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]], + ['gmtime_103',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]], + ['gnomesort_104',['gnomeSort',['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)'],['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array< T, size > arr)']]], + ['good_105',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()']]], + ['gptr_106',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()']]], + ['gram_5fschmidt_107',['gram_schmidt',['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt']]], + ['graph_108',['Graph',['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &&adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector< Edge > const &edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()']]], + ['graphcoloring_109',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]], + ['grouping_110',['grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()']]] ]; diff --git a/search/functions_8.js b/search/functions_8.js index 4a17e65d0..6506fe7a6 100644 --- a/search/functions_8.js +++ b/search/functions_8.js @@ -8,14 +8,14 @@ var searchData= ['hardware_5fconcurrency_5',['hardware_concurrency',['http://en.cppreference.com/w/cpp/thread/thread/hardware_concurrency.html',0,'std::thread']]], ['has_5ffacet_6',['has_facet',['http://en.cppreference.com/w/cpp/locale/has_facet.html',0,'std']]], ['haschildren_7',['hasChildren',['../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb',1,'Trie']]], - ['hash_8',['hash',['../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb',1,'hashing::md5::hash()'],['../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64',1,'hash_chain::hash()'],['http://en.cppreference.com/w/cpp/utility/hash/hash.html',0,'std::hash::hash()'],['../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c',1,'hashing::sha1::hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::hash()']]], - ['hash_5fbs_9',['hash_bs',['../d8/d7a/sha1_8cpp.html#a7be3471f7e489d7d0df42b97a48bf141',1,'hashing::sha1::hash_bs()'],['../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425',1,'hashing::md5::hash_bs()']]], + ['hash_8',['hash',['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::hash()'],['http://en.cppreference.com/w/cpp/utility/hash/hash.html',0,'std::hash::hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::hash()'],['../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64',1,'hash_chain::hash()'],['../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb',1,'hashing::md5::hash()'],['../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c',1,'hashing::sha1::hash()']]], + ['hash_5fbs_9',['hash_bs',['../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425',1,'hashing::md5::hash_bs()'],['../d8/d7a/sha1_8cpp.html#a7be3471f7e489d7d0df42b97a48bf141',1,'hashing::sha1::hash_bs()']]], ['hash_5fchain_10',['hash_chain',['../dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595',1,'hash_chain']]], - ['hash_5fcode_11',['hash_code',['http://en.cppreference.com/w/cpp/types/type_index/hash_code.html',0,'std::type_index::hash_code()'],['http://en.cppreference.com/w/cpp/types/type_info/hash_code.html',0,'std::type_info::hash_code()']]], + ['hash_5fcode_11',['hash_code',['http://en.cppreference.com/w/cpp/types/type_info/hash_code.html',0,'std::type_info::hash_code()'],['http://en.cppreference.com/w/cpp/types/type_index/hash_code.html',0,'std::type_index::hash_code()']]], ['hash_5ffunction_12',['hash_function',['http://en.cppreference.com/w/cpp/container/unordered_map/hash_function.html',0,'std::unordered_map::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/hash_function.html',0,'std::unordered_multimap::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/hash_function.html',0,'std::unordered_multiset::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_set/hash_function.html',0,'std::unordered_set::hash_function()']]], ['hash_5fsearch_13',['hash_search',['../d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2',1,'hash_search.cpp']]], ['hashdjb2_14',['hashDJB2',['../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4',1,'data_structures']]], - ['hashfxn_15',['hashfxn',['../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7',1,'quadratic_probing::hashFxn()'],['../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527',1,'linear_probing::hashFxn()'],['../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003',1,'double_hashing::hashFxn()']]], + ['hashfxn_15',['hashFxn',['../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003',1,'double_hashing::hashFxn()'],['../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527',1,'linear_probing::hashFxn()'],['../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7',1,'quadratic_probing::hashFxn()']]], ['hashint_5f1_16',['hashInt_1',['../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677',1,'data_structures']]], ['hashint_5f2_17',['hashInt_2',['../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c',1,'data_structures']]], ['hashstr_18',['hashStr',['../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15',1,'data_structures']]], @@ -23,7 +23,7 @@ var searchData= ['height_20',['height',['../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83',1,'avltree.cpp']]], ['hex_21',['hex',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]], ['hexfloat_22',['hexfloat',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], - ['hkgraph_23',['hkgraph',['../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9',1,'graph::HKGraph::HKGraph()'],['../d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64',1,'graph::HKGraph::HKGraph(int m, int n)']]], + ['hkgraph_23',['HKGraph',['../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9',1,'graph::HKGraph::HKGraph()'],['../d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64',1,'graph::HKGraph::HKGraph(int m, int n)']]], ['hld_24',['HLD',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a6e486767434e44076c1ac374a22da726',1,'range_queries::heavy_light_decomposition::HLD']]], ['hopcroftkarpalgorithm_25',['hopcroftKarpAlgorithm',['../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d',1,'graph::HKGraph']]], ['horizontal_5frange_26',['horizontal_range',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a10362eb607d7882bac3a0688504b00ff',1,'physics::ground_to_ground_projectile_motion']]], diff --git a/search/functions_9.js b/search/functions_9.js index 0e1adf037..0ae3094ff 100644 --- a/search/functions_9.js +++ b/search/functions_9.js @@ -3,19 +3,19 @@ var searchData= ['id_0',['id',['http://en.cppreference.com/w/cpp/locale/locale/id/id.html',0,'std::locale::id::id()'],['http://en.cppreference.com/w/cpp/thread/thread/id/id.html',0,'std::thread::id::id()']]], ['identity_5ffunction_1',['identity_function',['../d2/d58/neural__network_8cpp.html#a32c00da08f2cf641dd336270f6e3c407',1,'machine_learning::neural_network::util_functions']]], ['ifstream_2',['ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::ifstream']]], - ['ignore_3',['ignore',['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::strstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istrstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wiostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wfstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wstringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::ifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_ifstream::ignore()']]], + ['ignore_3',['ignore',['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::strstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istrstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wiostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_ifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wfstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wstringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::ifstream::ignore()']]], ['ilogb_4',['ilogb',['http://en.cppreference.com/w/cpp/numeric/math/ilogb.html',0,'std']]], - ['imag_5',['imag',['../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974',1,'Complex::imag()'],['http://en.cppreference.com/w/cpp/numeric/complex/imag.html',0,'std::complex::imag()']]], - ['imbue_6',['imbue',['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::regex::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::basic_regex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::basic_ios::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::wregex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::ios_base::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wifstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/imbue.html',0,'std::regex_traits::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::strstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wiostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ifstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wfstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wstringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ifstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::fstream::imbue()']]], + ['imag_5',['imag',['http://en.cppreference.com/w/cpp/numeric/complex/imag.html',0,'std::complex::imag()'],['../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974',1,'Complex::imag()']]], + ['imbue_6',['imbue',['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::regex::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::basic_regex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::basic_ios::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::wregex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::ios_base::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wifstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/imbue.html',0,'std::regex_traits::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::strstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wiostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ifstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wfstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wstringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ifstream::imbue()']]], ['imod_7',['imod',['../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6',1,'modular_inverse_simple.cpp']]], - ['in_8',['in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::in()']]], - ['in_5favail_9',['in_avail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wfilebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::strstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_streambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::streambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstringbuf::in_avail()']]], + ['in_8',['in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::in()']]], + ['in_5favail_9',['in_avail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wfilebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::strstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_streambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::streambuf::in_avail()']]], ['in_5frange_10',['in_range',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e',1,'machine_learning::aystar_search::EightPuzzle']]], ['includes_11',['includes',['http://en.cppreference.com/w/cpp/algorithm/includes.html',0,'std']]], ['independent_5fbits_5fengine_12',['independent_bits_engine',['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/independent_bits_engine.html',0,'std::independent_bits_engine']]], ['infinity_13',['infinity',['http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html',0,'std::numeric_limits']]], - ['info_14',['info',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &&A) noexcept'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7',1,'machine_learning::aystar_search::AyStarSearch::Info::Info()=default'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &A, size_t h_value, size_t d)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &A)']]], - ['init_15',['init',['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ios::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::strstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wiostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wfstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wstringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ifstream::init()'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc',1,'range_queries::heavy_light_decomposition::Tree::init()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828',1,'range_queries::heavy_light_decomposition::HLD::init()'],['../dd/d92/memory__game_8cpp.html#ad573c8ae66ab66156d03e5e81bbba214',1,'games::memory_game::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostream::init()']]], + ['info_14',['Info',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7',1,'machine_learning::aystar_search::AyStarSearch::Info::Info()=default'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &A, size_t h_value, size_t d)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &&A) noexcept']]], + ['init_15',['init',['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ios::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::strstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wiostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wfstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wstringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ifstream::init()'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc',1,'range_queries::heavy_light_decomposition::Tree::init()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828',1,'range_queries::heavy_light_decomposition::HLD::init()'],['../dd/d92/memory__game_8cpp.html#ad573c8ae66ab66156d03e5e81bbba214',1,'games::memory_game::init()']]], ['init_5fbad_5fchar_16',['init_bad_char',['../d3/db2/boyer__moore_8cpp.html#a2f6688c9bb3e692297a3aa09cebc1c00',1,'strings::boyer_moore']]], ['init_5fgood_5fsuffix_17',['init_good_suffix',['../d3/db2/boyer__moore_8cpp.html#aa709cf7fca02b7d3e1888423d5f739a1',1,'strings::boyer_moore']]], ['init_5fpattern_18',['init_pattern',['../d3/db2/boyer__moore_8cpp.html#a0b165af1dc341289fd705be4c67728f8',1,'strings::boyer_moore']]], @@ -25,101 +25,107 @@ var searchData= ['inorderiterative_22',['inOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499',1,'others::iterative_tree_traversals::BinaryTree']]], ['inplace_5fmerge_23',['inplace_merge',['http://en.cppreference.com/w/cpp/algorithm/inplace_merge.html',0,'std']]], ['insameunion_24',['InSameUnion',['../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985',1,'disjoint_set.cpp']]], - ['insert_25',['insert',['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::wstring::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/insert.html',0,'std::unordered_multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u16string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u32string::insert()'],['http://en.cppreference.com/w/cpp/container/list/insert.html',0,'std::list::insert()'],['http://en.cppreference.com/w/cpp/container/map/insert.html',0,'std::map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_set/insert.html',0,'std::unordered_set::insert()'],['http://en.cppreference.com/w/cpp/container/multimap/insert.html',0,'std::multimap::insert()'],['../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778',1,'binary_search_tree::insert(std::unique_ptr< bst_node > &node, T new_value)'],['../d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0',1,'binary_search_tree::insert(T new_value)'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1',1,'data_structures::list_array::list::insert()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f',1,'data_structures::linked_list::list::insert()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f',1,'data_structures::treap::Treap::insert()'],['../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2',1,'Trie::insert()'],['../d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546',1,'data_structures::trie::insert()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2',1,'data_structures::trie_using_hashmap::Trie::insert()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(const std::vector< int64_t > &values)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(int64_t data)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(Node *node)'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::insert()'],['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7',1,'probability::windowed_median::WindowedMedian::insert()'],['../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b',1,'insert(): avltree.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a3ae0bea4123fd2ce155108e88f2ef78c',1,'operations_on_datastructures::inorder_traversal_of_bst::Insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::basic_string::insert()'],['http://en.cppreference.com/w/cpp/container/deque/insert.html',0,'std::deque::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/insert.html',0,'std::unordered_multimap::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_map/insert.html',0,'std::unordered_map::insert()'],['http://en.cppreference.com/w/cpp/container/set/insert.html',0,'std::set::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::string::insert()'],['http://en.cppreference.com/w/cpp/container/multiset/insert.html',0,'std::multiset::insert()'],['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c',1,'operations_on_datastructures::trie_operations::Tnode::Insert()'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f',1,'data_structures::tree_234::Tree234::Insert(Node *tree, int64_t item)'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e',1,'data_structures::tree_234::Tree234::Insert(int64_t item)'],['http://en.cppreference.com/w/cpp/container/vector/insert.html',0,'std::vector::insert()']]], - ['insert_5fafter_26',['insert_after',['http://en.cppreference.com/w/cpp/container/forward_list/insert_after.html',0,'std::forward_list']]], - ['insert_5felement_27',['insert_element',['../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd',1,'machine_learning']]], - ['insertatthebeginning_28',['insertAtTheBeginning',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df',1,'linkedlist_implentation_usingarray.cpp']]], - ['insertelement_29',['insertElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9',1,'data_structures::SkipList']]], - ['inserter_30',['inserter',['http://en.cppreference.com/w/cpp/iterator/inserter.html',0,'std']]], - ['insertionsort_31',['insertionsort',['../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9',1,'sorting::insertionSort(T *arr, int n)'],['../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f',1,'sorting::insertionSort(std::vector< T > *arr)'],['../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1',1,'sorting::merge_insertion::InsertionSort()']]], - ['insertionsort_5fbinsrch_32',['insertionSort_binsrch',['../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68',1,'sorting']]], - ['insertitem_33',['InsertItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb',1,'data_structures::tree_234::Node']]], - ['insertitembyindex_34',['InsertItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956',1,'data_structures::tree_234::Node']]], - ['insertkey_35',['insertKey',['../d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82',1,'MinHeap']]], - ['insertpostmerge_36',['InsertPostMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703',1,'data_structures::tree_234::Tree234']]], - ['insertpresplit_37',['InsertPreSplit',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d',1,'data_structures::tree_234::Tree234']]], - ['inserttosorted_38',['insertToSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24',1,'probability::windowed_median::WindowedMedian']]], - ['integral_5fapprox_39',['integral_approx',['../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11',1,'math']]], - ['integral_5fmonte_5fcarlo_40',['integral_monte_carlo',['../db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51',1,'math::monte_carlo']]], - ['interactive_41',['interactive',['../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive(): md5.cpp'],['../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive(): sha1.cpp']]], - ['internal_42',['internal',['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std']]], - ['interpolationsearch_43',['InterpolationSearch',['../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629',1,'interpolation_search2.cpp']]], - ['intervals_44',['intervals',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::intervals()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::intervals()']]], - ['invalid_5fargument_45',['invalid_argument',['http://en.cppreference.com/w/cpp/error/invalid_argument.html',0,'std::invalid_argument']]], - ['inverse_5fcumulative_5fdistribution_46',['inverse_cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf',1,'probability::geometric_dist::geometric_distribution']]], - ['inversefastfouriertransform_47',['InverseFastFourierTransform',['../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93',1,'numerical_methods']]], - ['ios_5fbase_48',['ios_base',['http://en.cppreference.com/w/cpp/io/ios_base/ios_base.html',0,'std::ios_base']]], - ['iostream_49',['iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::iostream']]], - ['iota_50',['iota',['http://en.cppreference.com/w/cpp/algorithm/iota.html',0,'std']]], - ['is_51',['is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::is()']]], - ['is2node_52',['Is2Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631',1,'data_structures::tree_234::Node']]], - ['is34node_53',['Is34Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18',1,'data_structures::tree_234::Node']]], - ['is_5farmstrong_54',['is_armstrong',['../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26',1,'dynamic_programming']]], - ['is_5fbipartite_55',['is_bipartite',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9b0c6400693a5cfff971f768dd5ca5ca',1,'graph::is_graph_bipartite::Graph']]], - ['is_5ffactorial_56',['is_factorial',['../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca',1,'math']]], - ['is_5fhappy_57',['is_happy',['../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7',1,'happy_number.cpp']]], - ['is_5fheap_58',['is_heap',['http://en.cppreference.com/w/cpp/algorithm/is_heap.html',0,'std']]], - ['is_5fheap_5funtil_59',['is_heap_until',['http://en.cppreference.com/w/cpp/algorithm/is_heap_until.html',0,'std']]], - ['is_5flock_5ffree_60',['is_lock_free',['http://en.cppreference.com/w/cpp/atomic/atomic/is_lock_free.html',0,'std::atomic']]], - ['is_5fnumber_61',['is_number',['../dd/d92/memory__game_8cpp.html#a33167bb9cce6d527b478b4f6ae8c3f59',1,'games::memory_game::is_number()'],['../d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a',1,'others::postfix_expression::is_number()']]], - ['is_5fopen_62',['is_open',['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::wifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::wfilebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::wofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::basic_fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::basic_filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::wfstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::basic_ifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::basic_ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::ifstream::is_open()']]], - ['is_5fpartitioned_63',['is_partitioned',['http://en.cppreference.com/w/cpp/algorithm/is_partitioned.html',0,'std']]], - ['is_5fpermutation_64',['is_permutation',['http://en.cppreference.com/w/cpp/algorithm/is_permutation.html',0,'std']]], - ['is_5fprefix_65',['is_prefix',['../d3/db2/boyer__moore_8cpp.html#a056122c8fe8fb0f5fca6428d3f7b5c3a',1,'strings::boyer_moore']]], - ['is_5fprime_66',['is_prime',['../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444',1,'math']]], - ['is_5fsorted_67',['is_sorted',['http://en.cppreference.com/w/cpp/algorithm/is_sorted.html',0,'std']]], - ['is_5fsorted_5funtil_68',['is_sorted_until',['http://en.cppreference.com/w/cpp/algorithm/is_sorted_until.html',0,'std']]], - ['is_5fsquare_69',['is_square',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e',1,'ordinary_least_squares_regressor.cpp']]], - ['isalnum_70',['isalnum',['http://en.cppreference.com/w/cpp/string/byte/isalnum.html',0,'std']]], - ['isalpha_71',['isalpha',['http://en.cppreference.com/w/cpp/string/byte/isalpha.html',0,'std']]], - ['isbigendian_72',['isBigEndian',['../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446',1,'hashing::md5']]], - ['isbipartite_73',['isBipartite',['../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b',1,'graph']]], - ['isblank_74',['isblank',['http://en.cppreference.com/w/cpp/string/byte/isblank.html',0,'std']]], - ['iscntrl_75',['iscntrl',['http://en.cppreference.com/w/cpp/string/byte/iscntrl.html',0,'std']]], - ['isctype_76',['isctype',['http://en.cppreference.com/w/cpp/regex/regex_traits/isctype.html',0,'std::regex_traits']]], - ['iscyclicbfs_77',['isCyclicBFS',['../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5',1,'CycleCheck']]], - ['iscyclicdfs_78',['isCyclicDFS',['../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474',1,'CycleCheck']]], - ['iscyclicdfshelper_79',['isCyclicDFSHelper',['../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b',1,'CycleCheck']]], - ['isdigit_80',['isdigit',['../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180',1,'data_structures::linked_list::isDigit()'],['http://en.cppreference.com/w/cpp/string/byte/isdigit.html',0,'std::isdigit()']]], - ['isempty_81',['isempty',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6d50919d34481a2b96cb74627d227c0e',1,'data_structures::linked_list::list::isEmpty() const'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a',1,'data_structures::linked_list::list::isEmpty()']]], - ['isemptyqueue_82',['isEmptyQueue',['../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec',1,'queue']]], - ['isemptystack_83',['isEmptyStack',['../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5',1,'stack']]], - ['isfinite_84',['isfinite',['http://en.cppreference.com/w/cpp/numeric/math/isfinite.html',0,'std']]], - ['isfull_85',['IsFull',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd',1,'data_structures::tree_234::Node']]], - ['isgraph_86',['isgraph',['http://en.cppreference.com/w/cpp/string/byte/isgraph.html',0,'std']]], - ['isinf_87',['isinf',['http://en.cppreference.com/w/cpp/numeric/math/isinf.html',0,'std']]], - ['isleaf_88',['IsLeaf',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8',1,'data_structures::tree_234::Node']]], - ['islower_89',['islower',['http://en.cppreference.com/w/cpp/string/byte/islower.html',0,'std']]], - ['isnan_90',['isnan',['http://en.cppreference.com/w/cpp/numeric/math/isnan.html',0,'std']]], - ['isnormal_91',['isnormal',['http://en.cppreference.com/w/cpp/numeric/math/isnormal.html',0,'std']]], - ['ispossible_92',['isPossible',['../d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0',1,'backtracking::sudoku_solver']]], - ['ispoweroftwo_93',['isPowerOfTwo',['../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f',1,'bit_manipulation']]], - ['isprime_94',['isprime',['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'IsPrime(int number): primality_test.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd',1,'isPrime(int64_t m): modular_inverse_fermat_little_theorem.cpp']]], - ['isprint_95',['isprint',['http://en.cppreference.com/w/cpp/string/byte/isprint.html',0,'std']]], - ['ispunct_96',['ispunct',['http://en.cppreference.com/w/cpp/string/byte/ispunct.html',0,'std']]], - ['issafe_97',['issafe',['../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d',1,'backtracking::graph_coloring::isSafe()'],['../d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160',1,'backtracking::n_queens::isSafe()'],['../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2',1,'backtracking::knight_tour::issafe()']]], - ['issame_98',['issame',['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)'],['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)']]], - ['isspace_99',['isspace',['http://en.cppreference.com/w/cpp/string/byte/isspace.html',0,'std']]], - ['istream_100',['istream',['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::istream']]], - ['istringstream_101',['istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::istringstream']]], - ['istrstream_102',['istrstream',['http://en.cppreference.com/w/cpp/io/istrstream/istrstream.html',0,'std::istrstream']]], - ['isupper_103',['isupper',['http://en.cppreference.com/w/cpp/string/byte/isupper.html',0,'std']]], - ['iswalnum_104',['iswalnum',['http://en.cppreference.com/w/cpp/string/wide/iswalnum.html',0,'std']]], - ['iswalpha_105',['iswalpha',['http://en.cppreference.com/w/cpp/string/wide/iswalpha.html',0,'std']]], - ['iswblank_106',['iswblank',['http://en.cppreference.com/w/cpp/string/wide/iswblank.html',0,'std']]], - ['iswcntrl_107',['iswcntrl',['http://en.cppreference.com/w/cpp/string/wide/iswcntrl.html',0,'std']]], - ['iswctype_108',['iswctype',['http://en.cppreference.com/w/cpp/string/wide/iswctype.html',0,'std']]], - ['iswdigit_109',['iswdigit',['http://en.cppreference.com/w/cpp/string/wide/iswdigit.html',0,'std']]], - ['iswgraph_110',['iswgraph',['http://en.cppreference.com/w/cpp/string/wide/iswgraph.html',0,'std']]], - ['iswlower_111',['iswlower',['http://en.cppreference.com/w/cpp/string/wide/iswlower.html',0,'std']]], - ['iswprint_112',['iswprint',['http://en.cppreference.com/w/cpp/string/wide/iswprint.html',0,'std']]], - ['iswpunct_113',['iswpunct',['http://en.cppreference.com/w/cpp/string/wide/iswpunct.html',0,'std']]], - ['iswspace_114',['iswspace',['http://en.cppreference.com/w/cpp/string/wide/iswspace.html',0,'std']]], - ['iswupper_115',['iswupper',['http://en.cppreference.com/w/cpp/string/wide/iswupper.html',0,'std']]], - ['iswxdigit_116',['iswxdigit',['http://en.cppreference.com/w/cpp/string/wide/iswxdigit.html',0,'std']]], - ['isxdigit_117',['isxdigit',['http://en.cppreference.com/w/cpp/string/byte/isxdigit.html',0,'std']]], - ['it_5fternary_5fsearch_118',['it_ternary_search',['../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0',1,'ternary_search.cpp']]], - ['iter_5fswap_119',['iter_swap',['http://en.cppreference.com/w/cpp/algorithm/iter_swap.html',0,'std']]], - ['iterativefactorial_120',['iterativeFactorial',['../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a',1,'math']]], - ['iword_121',['iword',['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ios_base::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ios::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::strstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wiostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wfstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wstringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostringstream::iword()']]] + ['insert_25',['insert',['http://en.cppreference.com/w/cpp/container/vector/insert.html',0,'std::vector::insert()'],['http://en.cppreference.com/w/cpp/container/multiset/insert.html',0,'std::multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::string::insert()'],['http://en.cppreference.com/w/cpp/container/set/insert.html',0,'std::set::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_map/insert.html',0,'std::unordered_map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/insert.html',0,'std::unordered_multimap::insert()'],['http://en.cppreference.com/w/cpp/container/deque/insert.html',0,'std::deque::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::basic_string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::wstring::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/insert.html',0,'std::unordered_multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u16string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u32string::insert()'],['http://en.cppreference.com/w/cpp/container/list/insert.html',0,'std::list::insert()'],['http://en.cppreference.com/w/cpp/container/map/insert.html',0,'std::map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_set/insert.html',0,'std::unordered_set::insert()'],['http://en.cppreference.com/w/cpp/container/multimap/insert.html',0,'std::multimap::insert()'],['../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778',1,'binary_search_tree::insert(std::unique_ptr< bst_node > &node, T new_value)'],['../d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0',1,'binary_search_tree::insert(T new_value)'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1',1,'data_structures::list_array::list::insert()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f',1,'data_structures::linked_list::list::insert()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f',1,'data_structures::treap::Treap::insert()'],['../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2',1,'Trie::insert()'],['../d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546',1,'data_structures::trie::insert()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2',1,'data_structures::trie_using_hashmap::Trie::insert()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(const std::vector< int64_t > &values)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(int64_t data)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(Node *node)'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::insert()'],['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7',1,'probability::windowed_median::WindowedMedian::insert()']]], + ['insert_26',['Insert',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e',1,'data_structures::tree_234::Tree234::Insert(int64_t item)'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f',1,'data_structures::tree_234::Tree234::Insert(Node *tree, int64_t item)'],['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c',1,'operations_on_datastructures::trie_operations::Tnode::Insert()'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a3ae0bea4123fd2ce155108e88f2ef78c',1,'operations_on_datastructures::inorder_traversal_of_bst::Insert()']]], + ['insert_27',['insert',['../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b',1,'avltree.cpp']]], + ['insert_5fafter_28',['insert_after',['http://en.cppreference.com/w/cpp/container/forward_list/insert_after.html',0,'std::forward_list']]], + ['insert_5felement_29',['insert_element',['../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd',1,'machine_learning']]], + ['insertatthebeginning_30',['insertAtTheBeginning',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df',1,'linkedlist_implentation_usingarray.cpp']]], + ['insertelement_31',['insertElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9',1,'data_structures::SkipList']]], + ['inserter_32',['inserter',['http://en.cppreference.com/w/cpp/iterator/inserter.html',0,'std']]], + ['insertionsort_33',['insertionSort',['../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9',1,'sorting::insertionSort(T *arr, int n)'],['../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f',1,'sorting::insertionSort(std::vector< T > *arr)']]], + ['insertionsort_34',['InsertionSort',['../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1',1,'sorting::merge_insertion']]], + ['insertionsort_5fbinsrch_35',['insertionSort_binsrch',['../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68',1,'sorting']]], + ['insertitem_36',['InsertItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb',1,'data_structures::tree_234::Node']]], + ['insertitembyindex_37',['InsertItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956',1,'data_structures::tree_234::Node']]], + ['insertkey_38',['insertKey',['../d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82',1,'MinHeap']]], + ['insertpostmerge_39',['InsertPostMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703',1,'data_structures::tree_234::Tree234']]], + ['insertpresplit_40',['InsertPreSplit',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d',1,'data_structures::tree_234::Tree234']]], + ['inserttosorted_41',['insertToSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24',1,'probability::windowed_median::WindowedMedian']]], + ['integral_5fapprox_42',['integral_approx',['../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11',1,'math']]], + ['integral_5fmonte_5fcarlo_43',['integral_monte_carlo',['../db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51',1,'math::monte_carlo']]], + ['interactive_44',['interactive',['../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive(): md5.cpp'],['../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive(): sha1.cpp']]], + ['internal_45',['internal',['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std']]], + ['interpolationsearch_46',['InterpolationSearch',['../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629',1,'interpolation_search2.cpp']]], + ['intervals_47',['intervals',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::intervals()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::intervals()']]], + ['invalid_5fargument_48',['invalid_argument',['http://en.cppreference.com/w/cpp/error/invalid_argument.html',0,'std::invalid_argument']]], + ['inverse_5fcumulative_5fdistribution_49',['inverse_cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf',1,'probability::geometric_dist::geometric_distribution']]], + ['inversefastfouriertransform_50',['InverseFastFourierTransform',['../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93',1,'numerical_methods']]], + ['ios_5fbase_51',['ios_base',['http://en.cppreference.com/w/cpp/io/ios_base/ios_base.html',0,'std::ios_base']]], + ['iostream_52',['iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::iostream']]], + ['iota_53',['iota',['http://en.cppreference.com/w/cpp/algorithm/iota.html',0,'std']]], + ['is_54',['is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::is()']]], + ['is2node_55',['Is2Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631',1,'data_structures::tree_234::Node']]], + ['is34node_56',['Is34Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18',1,'data_structures::tree_234::Node']]], + ['is_5farmstrong_57',['is_armstrong',['../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26',1,'dynamic_programming']]], + ['is_5fbipartite_58',['is_bipartite',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9b0c6400693a5cfff971f768dd5ca5ca',1,'graph::is_graph_bipartite::Graph']]], + ['is_5ffactorial_59',['is_factorial',['../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca',1,'math']]], + ['is_5fhappy_60',['is_happy',['../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7',1,'happy_number.cpp']]], + ['is_5fheap_61',['is_heap',['http://en.cppreference.com/w/cpp/algorithm/is_heap.html',0,'std']]], + ['is_5fheap_5funtil_62',['is_heap_until',['http://en.cppreference.com/w/cpp/algorithm/is_heap_until.html',0,'std']]], + ['is_5flock_5ffree_63',['is_lock_free',['http://en.cppreference.com/w/cpp/atomic/atomic/is_lock_free.html',0,'std::atomic']]], + ['is_5fnumber_64',['is_number',['../dd/d92/memory__game_8cpp.html#a33167bb9cce6d527b478b4f6ae8c3f59',1,'games::memory_game::is_number()'],['../d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a',1,'others::postfix_expression::is_number()']]], + ['is_5fopen_65',['is_open',['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::basic_ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::basic_filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::basic_fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::wfilebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::wifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::basic_ifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::wfstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::wofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::ifstream::is_open()']]], + ['is_5fpartitioned_66',['is_partitioned',['http://en.cppreference.com/w/cpp/algorithm/is_partitioned.html',0,'std']]], + ['is_5fpermutation_67',['is_permutation',['http://en.cppreference.com/w/cpp/algorithm/is_permutation.html',0,'std']]], + ['is_5fprefix_68',['is_prefix',['../d3/db2/boyer__moore_8cpp.html#a056122c8fe8fb0f5fca6428d3f7b5c3a',1,'strings::boyer_moore']]], + ['is_5fprime_69',['is_prime',['../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444',1,'math']]], + ['is_5fsorted_70',['is_sorted',['http://en.cppreference.com/w/cpp/algorithm/is_sorted.html',0,'std']]], + ['is_5fsorted_5funtil_71',['is_sorted_until',['http://en.cppreference.com/w/cpp/algorithm/is_sorted_until.html',0,'std']]], + ['is_5fsquare_72',['is_square',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e',1,'ordinary_least_squares_regressor.cpp']]], + ['isalnum_73',['isalnum',['http://en.cppreference.com/w/cpp/string/byte/isalnum.html',0,'std']]], + ['isalpha_74',['isalpha',['http://en.cppreference.com/w/cpp/string/byte/isalpha.html',0,'std']]], + ['isbigendian_75',['isBigEndian',['../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446',1,'hashing::md5']]], + ['isbipartite_76',['isBipartite',['../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b',1,'graph']]], + ['isblank_77',['isblank',['http://en.cppreference.com/w/cpp/string/byte/isblank.html',0,'std']]], + ['iscntrl_78',['iscntrl',['http://en.cppreference.com/w/cpp/string/byte/iscntrl.html',0,'std']]], + ['isctype_79',['isctype',['http://en.cppreference.com/w/cpp/regex/regex_traits/isctype.html',0,'std::regex_traits']]], + ['iscyclicbfs_80',['isCyclicBFS',['../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5',1,'CycleCheck']]], + ['iscyclicdfs_81',['isCyclicDFS',['../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474',1,'CycleCheck']]], + ['iscyclicdfshelper_82',['isCyclicDFSHelper',['../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b',1,'CycleCheck']]], + ['isdigit_83',['isDigit',['../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180',1,'data_structures::linked_list']]], + ['isdigit_84',['isdigit',['http://en.cppreference.com/w/cpp/string/byte/isdigit.html',0,'std']]], + ['isempty_85',['isEmpty',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a',1,'data_structures::linked_list::list::isEmpty()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6d50919d34481a2b96cb74627d227c0e',1,'data_structures::linked_list::list::isEmpty() const']]], + ['isemptyqueue_86',['isEmptyQueue',['../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec',1,'queue']]], + ['isemptystack_87',['isEmptyStack',['../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5',1,'stack']]], + ['isfinite_88',['isfinite',['http://en.cppreference.com/w/cpp/numeric/math/isfinite.html',0,'std']]], + ['isfull_89',['IsFull',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd',1,'data_structures::tree_234::Node']]], + ['isgraph_90',['isgraph',['http://en.cppreference.com/w/cpp/string/byte/isgraph.html',0,'std']]], + ['isinf_91',['isinf',['http://en.cppreference.com/w/cpp/numeric/math/isinf.html',0,'std']]], + ['isleaf_92',['IsLeaf',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8',1,'data_structures::tree_234::Node']]], + ['islower_93',['islower',['http://en.cppreference.com/w/cpp/string/byte/islower.html',0,'std']]], + ['isnan_94',['isnan',['http://en.cppreference.com/w/cpp/numeric/math/isnan.html',0,'std']]], + ['isnormal_95',['isnormal',['http://en.cppreference.com/w/cpp/numeric/math/isnormal.html',0,'std']]], + ['ispossible_96',['isPossible',['../d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0',1,'backtracking::sudoku_solver']]], + ['ispoweroftwo_97',['isPowerOfTwo',['../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f',1,'bit_manipulation']]], + ['isprime_98',['isPrime',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd',1,'modular_inverse_fermat_little_theorem.cpp']]], + ['isprime_99',['IsPrime',['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'primality_test.cpp']]], + ['isprint_100',['isprint',['http://en.cppreference.com/w/cpp/string/byte/isprint.html',0,'std']]], + ['ispunct_101',['ispunct',['http://en.cppreference.com/w/cpp/string/byte/ispunct.html',0,'std']]], + ['issafe_102',['issafe',['../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2',1,'backtracking::knight_tour']]], + ['issafe_103',['isSafe',['../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d',1,'backtracking::graph_coloring::isSafe()'],['../d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160',1,'backtracking::n_queens::isSafe()']]], + ['issame_104',['isSame',['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)'],['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)']]], + ['isspace_105',['isspace',['http://en.cppreference.com/w/cpp/string/byte/isspace.html',0,'std']]], + ['istream_106',['istream',['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::istream']]], + ['istringstream_107',['istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::istringstream']]], + ['istrstream_108',['istrstream',['http://en.cppreference.com/w/cpp/io/istrstream/istrstream.html',0,'std::istrstream']]], + ['isupper_109',['isupper',['http://en.cppreference.com/w/cpp/string/byte/isupper.html',0,'std']]], + ['iswalnum_110',['iswalnum',['http://en.cppreference.com/w/cpp/string/wide/iswalnum.html',0,'std']]], + ['iswalpha_111',['iswalpha',['http://en.cppreference.com/w/cpp/string/wide/iswalpha.html',0,'std']]], + ['iswblank_112',['iswblank',['http://en.cppreference.com/w/cpp/string/wide/iswblank.html',0,'std']]], + ['iswcntrl_113',['iswcntrl',['http://en.cppreference.com/w/cpp/string/wide/iswcntrl.html',0,'std']]], + ['iswctype_114',['iswctype',['http://en.cppreference.com/w/cpp/string/wide/iswctype.html',0,'std']]], + ['iswdigit_115',['iswdigit',['http://en.cppreference.com/w/cpp/string/wide/iswdigit.html',0,'std']]], + ['iswgraph_116',['iswgraph',['http://en.cppreference.com/w/cpp/string/wide/iswgraph.html',0,'std']]], + ['iswlower_117',['iswlower',['http://en.cppreference.com/w/cpp/string/wide/iswlower.html',0,'std']]], + ['iswprint_118',['iswprint',['http://en.cppreference.com/w/cpp/string/wide/iswprint.html',0,'std']]], + ['iswpunct_119',['iswpunct',['http://en.cppreference.com/w/cpp/string/wide/iswpunct.html',0,'std']]], + ['iswspace_120',['iswspace',['http://en.cppreference.com/w/cpp/string/wide/iswspace.html',0,'std']]], + ['iswupper_121',['iswupper',['http://en.cppreference.com/w/cpp/string/wide/iswupper.html',0,'std']]], + ['iswxdigit_122',['iswxdigit',['http://en.cppreference.com/w/cpp/string/wide/iswxdigit.html',0,'std']]], + ['isxdigit_123',['isxdigit',['http://en.cppreference.com/w/cpp/string/byte/isxdigit.html',0,'std']]], + ['it_5fternary_5fsearch_124',['it_ternary_search',['../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0',1,'ternary_search.cpp']]], + ['iter_5fswap_125',['iter_swap',['http://en.cppreference.com/w/cpp/algorithm/iter_swap.html',0,'std']]], + ['iterativefactorial_126',['iterativeFactorial',['../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a',1,'math']]], + ['iword_127',['iword',['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ios::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ios_base::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::strstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wiostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wfstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wstringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ifstream::iword()']]] ]; diff --git a/search/functions_b.js b/search/functions_b.js index c18c67a8e..8ae5782e0 100644 --- a/search/functions_b.js +++ b/search/functions_b.js @@ -1,13 +1,13 @@ var searchData= [ - ['k_0',['k',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/params.html',0,'std::negative_binomial_distribution::k()'],['../df/d11/midpoint__integral__method_8cpp.html#ae9f66040f8e0ba73c1c741261c22a52a',1,'numerical_methods::midpoint_rule::k()'],['../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442',1,'numerical_methods::simpson_method::k()']]], + ['k_0',['k',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/params.html',0,'std::negative_binomial_distribution::k()'],['../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442',1,'numerical_methods::simpson_method::k()'],['../df/d11/midpoint__integral__method_8cpp.html#ae9f66040f8e0ba73c1c741261c22a52a',1,'numerical_methods::midpoint_rule::k()']]], ['karatsuba_5falgorithm_1',['karatsuba_algorithm',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#a7a890d2f26855ada3b9f1d43aec70a86',1,'divide_and_conquer::karatsuba_algorithm']]], ['kelvin_5fto_5fcelsius_2',['kelvin_to_celsius',['../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec',1,'others']]], - ['key_5fcomp_3',['key_comp',['http://en.cppreference.com/w/cpp/container/map/key_comp.html',0,'std::map::key_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/key_comp.html',0,'std::multimap::key_comp()'],['http://en.cppreference.com/w/cpp/container/multiset/key_comp.html',0,'std::multiset::key_comp()'],['http://en.cppreference.com/w/cpp/container/set/key_comp.html',0,'std::set::key_comp()']]], - ['key_5feq_4',['key_eq',['http://en.cppreference.com/w/cpp/container/unordered_multiset/key_eq.html',0,'std::unordered_multiset::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_set/key_eq.html',0,'std::unordered_set::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/key_eq.html',0,'std::unordered_multimap::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_map/key_eq.html',0,'std::unordered_map::key_eq()']]], + ['key_5fcomp_3',['key_comp',['http://en.cppreference.com/w/cpp/container/multiset/key_comp.html',0,'std::multiset::key_comp()'],['http://en.cppreference.com/w/cpp/container/set/key_comp.html',0,'std::set::key_comp()'],['http://en.cppreference.com/w/cpp/container/map/key_comp.html',0,'std::map::key_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/key_comp.html',0,'std::multimap::key_comp()']]], + ['key_5feq_4',['key_eq',['http://en.cppreference.com/w/cpp/container/unordered_map/key_eq.html',0,'std::unordered_map::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/key_eq.html',0,'std::unordered_multimap::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/key_eq.html',0,'std::unordered_multiset::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_set/key_eq.html',0,'std::unordered_set::key_eq()']]], ['kill_5fdependency_5',['kill_dependency',['http://en.cppreference.com/w/cpp/atomic/kill_dependency.html',0,'std']]], ['kmp_6',['kmp',['../d9/d03/namespacestring__search.html#a26a58225ce7d3fa9d4c2f5349a65ed93',1,'string_search']]], - ['knn_7',['knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e',1,'machine_learning::k_nearest_neighbors::Knn::Knn(Knn &&)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b',1,'machine_learning::k_nearest_neighbors::Knn::Knn(const Knn &model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200',1,'machine_learning::k_nearest_neighbors::Knn::Knn(std::vector< std::vector< double > > &X, std::vector< int > &Y)']]], + ['knn_7',['Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200',1,'machine_learning::k_nearest_neighbors::Knn::Knn(std::vector< std::vector< double > > &X, std::vector< int > &Y)'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b',1,'machine_learning::k_nearest_neighbors::Knn::Knn(const Knn &model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e',1,'machine_learning::k_nearest_neighbors::Knn::Knn(Knn &&)=default']]], ['knuth_5fb_8',['knuth_b',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::knuth_b']]], ['kohonen_5fsom_9',['kohonen_som',['../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576',1,'machine_learning']]], ['kohonen_5fsom_5ftracer_10',['kohonen_som_tracer',['../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3',1,'machine_learning']]], diff --git a/search/functions_c.js b/search/functions_c.js index eeefd4949..9c85e0596 100644 --- a/search/functions_c.js +++ b/search/functions_c.js @@ -3,7 +3,7 @@ var searchData= ['l_0',['l',['../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a',1,'numerical_methods::simpson_method::l()'],['../df/d11/midpoint__integral__method_8cpp.html#ad53616fb4fa6880ae876bcba53365c51',1,'numerical_methods::midpoint_rule::l()']]], ['labs_1',['labs',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]], ['lambda_2',['lambda',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/lambda.html',0,'std::exponential_distribution']]], - ['large_5fnumber_3',['large_number',['../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f',1,'large_number::large_number(std::vector< unsigned char > &vec)'],['../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872',1,'large_number::large_number(const large_number &a)'],['../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337',1,'large_number::large_number()'],['../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a',1,'large_number::large_number(int n)']]], + ['large_5fnumber_3',['large_number',['../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337',1,'large_number::large_number()'],['../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a',1,'large_number::large_number(int n)'],['../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872',1,'large_number::large_number(const large_number &a)'],['../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f',1,'large_number::large_number(std::vector< unsigned char > &vec)']]], ['largestpower_4',['largestPower',['../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f',1,'math']]], ['lazy_5',['lazy',['../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79',1,'range_queries::perSegTree']]], ['lca_6',['lca',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4',1,'range_queries::heavy_light_decomposition::Tree']]], @@ -12,53 +12,54 @@ var searchData= ['ldexp_9',['ldexp',['http://en.cppreference.com/w/cpp/numeric/math/ldexp.html',0,'std']]], ['ldiv_10',['ldiv',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]], ['left_11',['left',['../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca',1,'MinHeap::left()'],['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::left()']]], - ['leftrotate_12',['leftrotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e',1,'data_structures::tree_234::Tree234::LeftRotate()'],['../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6',1,'leftRotate(): avltree.cpp']]], - ['leftrotate32bits_13',['leftrotate32bits',['../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d',1,'hashing::md5::leftRotate32bits()'],['../d8/d7a/sha1_8cpp.html#acf6bd970f29a68702bdbdfe8338e45e0',1,'hashing::sha1::leftRotate32bits()']]], - ['lenghtline_14',['LenghtLine',['../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a',1,'smallest_circle.cpp']]], - ['length_15',['length',['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::csub_match::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::ssub_match::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::cmatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::sub_match::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::length()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/length.html',0,'std::regex_traits::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wssub_match::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wcmatch::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::smatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wcsub_match::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wsmatch::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::length()'],['http://en.cppreference.com/w/cpp/string/char_traits/length.html',0,'std::char_traits::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::match_results::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::length()']]], - ['length_5ferror_16',['length_error',['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std::length_error']]], - ['levelorder_17',['levelOrder',['../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59',1,'avltree.cpp']]], - ['lexicographical_5fcompare_18',['lexicographical_compare',['http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare.html',0,'std']]], - ['lgamma_19',['lgamma',['http://en.cppreference.com/w/cpp/numeric/math/lgamma.html',0,'std']]], - ['lift_20',['lift',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3',1,'range_queries::heavy_light_decomposition::Tree']]], - ['linear_5fcongruential_5fengine_21',['linear_congruential_engine',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::linear_congruential_engine']]], - ['linearprobe_22',['linearProbe',['../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746',1,'linear_probing']]], - ['linearsearch_23',['linearsearch',['../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84',1,'LinearSearch(): linear_search.cpp'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9',1,'data_structures::list_array::list::LinearSearch()']]], - ['link_24',['link',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb',1,'data_structures::linked_list::link']]], - ['lis_25',['LIS',['../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079',1,'dynamic_programming']]], - ['list_26',['list',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826',1,'data_structures::linked_list::list::list()'],['http://en.cppreference.com/w/cpp/container/list/list.html',0,'std::list::list()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac681c278055081ac11decb6060b300de',1,'data_structures::linked_list::list::list()']]], - ['listnode_27',['listnode',['../d7/da4/struct_list_node.html#afc97c5b9d2e7cc82d0718245688f6ff9',1,'ListNode::ListNode(int x, ListNode *next)'],['../d7/da4/struct_list_node.html#aaad9b553e2f936726f5b35ff2734125d',1,'ListNode::ListNode(int x)'],['../d7/da4/struct_list_node.html#a3cfee2eb667c332dc32595208164ef0a',1,'ListNode::ListNode()=default']]], - ['llabs_28',['llabs',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]], - ['llrint_29',['llrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], - ['llround_30',['llround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], - ['load_31',['load',['http://en.cppreference.com/w/cpp/atomic/atomic/load.html',0,'std::atomic']]], - ['load_5ffactor_32',['load_factor',['http://en.cppreference.com/w/cpp/container/unordered_set/load_factor.html',0,'std::unordered_set::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_map/load_factor.html',0,'std::unordered_map::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/load_factor.html',0,'std::unordered_multimap::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/load_factor.html',0,'std::unordered_multiset::load_factor()']]], - ['load_5fmodel_33',['load_model',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58ed20abf6ce3744535bd8b5bb9e741b',1,'machine_learning::neural_network::NeuralNetwork']]], - ['locale_34',['locale',['http://en.cppreference.com/w/cpp/locale/locale/locale.html',0,'std::locale']]], - ['localeconv_35',['localeconv',['http://en.cppreference.com/w/cpp/locale/localeconv.html',0,'std']]], - ['localtime_36',['localtime',['http://en.cppreference.com/w/cpp/chrono/c/localtime.html',0,'std']]], - ['lock_37',['lock',['http://en.cppreference.com/w/cpp/memory/weak_ptr/lock.html',0,'std::weak_ptr::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/lock.html',0,'std::recursive_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/lock.html',0,'std::recursive_timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/lock.html',0,'std::shared_lock::lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/lock.html',0,'std::timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/lock.html',0,'std::mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock.html',0,'std::shared_timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/lock.html',0,'std::lock()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/lock.html',0,'std::unique_lock::lock()']]], - ['lock_5fguard_38',['lock_guard',['http://en.cppreference.com/w/cpp/thread/lock_guard/lock_guard.html',0,'std::lock_guard']]], - ['lock_5fshared_39',['lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock_shared.html',0,'std::shared_timed_mutex']]], - ['log_40',['log',['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058',1,'lru_tests::log()'],['http://en.cppreference.com/w/cpp/numeric/math/log.html',0,'std::log()'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log()']]], - ['log10_41',['log10',['http://en.cppreference.com/w/cpp/numeric/math/log10.html',0,'std']]], - ['log1p_42',['log1p',['http://en.cppreference.com/w/cpp/numeric/math/log1p.html',0,'std']]], - ['logb_43',['logb',['http://en.cppreference.com/w/cpp/numeric/math/logb.html',0,'std']]], - ['logic_5ferror_44',['logic_error',['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std::logic_error']]], - ['lognormal_5fdistribution_45',['lognormal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/lognormal_distribution.html',0,'std::lognormal_distribution']]], - ['longest_5fcommon_5fstring_5flength_46',['longest_common_string_length',['../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5',1,'longest_common_string.cpp']]], - ['longjmp_47',['longjmp',['http://en.cppreference.com/w/cpp/utility/program/longjmp.html',0,'std']]], - ['lookup_5fclassname_48',['lookup_classname',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_classname.html',0,'std::regex_traits']]], - ['lookup_5fcollatename_49',['lookup_collatename',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_collatename.html',0,'std::regex_traits']]], - ['lower_50',['lower',['../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9',1,'lower(): text_search.cpp'],['../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd',1,'uint128_t::lower()'],['../d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1',1,'uint256_t::lower()']]], - ['lower_5fbound_51',['lower_bound',['http://en.cppreference.com/w/cpp/container/multiset/lower_bound.html',0,'std::multiset::lower_bound()'],['http://en.cppreference.com/w/cpp/container/set/lower_bound.html',0,'std::set::lower_bound()'],['http://en.cppreference.com/w/cpp/algorithm/lower_bound.html',0,'std::lower_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/lower_bound.html',0,'std::multimap::lower_bound()'],['http://en.cppreference.com/w/cpp/container/map/lower_bound.html',0,'std::map::lower_bound()']]], - ['lowest_52',['lowest',['http://en.cppreference.com/w/cpp/types/numeric_limits/lowest.html',0,'std::numeric_limits']]], - ['lowest_5fcommon_5fancestor_53',['lowest_common_ancestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488',1,'graph::LowestCommonAncestor']]], - ['lowestcommonancestor_54',['LowestCommonAncestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93',1,'graph::LowestCommonAncestor']]], - ['lps_55',['lps',['../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412',1,'dynamic_programming']]], - ['lrint_56',['lrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], - ['lround_57',['lround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], - ['lrucache_58',['LRUCache',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4',1,'others::lru_cache::LRUCache']]], - ['lt_59',['lt',['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits']]], - ['lu_5fdecomposition_60',['lu_decomposition',['../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509',1,'lu_decomposition.h']]] + ['leftrotate_12',['LeftRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e',1,'data_structures::tree_234::Tree234']]], + ['leftrotate_13',['leftRotate',['../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6',1,'avltree.cpp']]], + ['leftrotate32bits_14',['leftRotate32bits',['../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d',1,'hashing::md5::leftRotate32bits()'],['../d8/d7a/sha1_8cpp.html#acf6bd970f29a68702bdbdfe8338e45e0',1,'hashing::sha1::leftRotate32bits()']]], + ['lenghtline_15',['LenghtLine',['../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a',1,'smallest_circle.cpp']]], + ['length_16',['length',['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::match_results::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::length()'],['http://en.cppreference.com/w/cpp/string/char_traits/length.html',0,'std::char_traits::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wsmatch::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wcsub_match::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::smatch::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wcmatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wssub_match::length()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/length.html',0,'std::regex_traits::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::csub_match::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::ssub_match::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::cmatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::sub_match::length()']]], + ['length_5ferror_17',['length_error',['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std::length_error']]], + ['levelorder_18',['levelOrder',['../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59',1,'avltree.cpp']]], + ['lexicographical_5fcompare_19',['lexicographical_compare',['http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare.html',0,'std']]], + ['lgamma_20',['lgamma',['http://en.cppreference.com/w/cpp/numeric/math/lgamma.html',0,'std']]], + ['lift_21',['lift',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3',1,'range_queries::heavy_light_decomposition::Tree']]], + ['linear_5fcongruential_5fengine_22',['linear_congruential_engine',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::linear_congruential_engine']]], + ['linearprobe_23',['linearProbe',['../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746',1,'linear_probing']]], + ['linearsearch_24',['LinearSearch',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9',1,'data_structures::list_array::list::LinearSearch()'],['../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84',1,'LinearSearch(): linear_search.cpp']]], + ['link_25',['link',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb',1,'data_structures::linked_list::link']]], + ['lis_26',['LIS',['../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079',1,'dynamic_programming']]], + ['list_27',['list',['http://en.cppreference.com/w/cpp/container/list/list.html',0,'std::list::list()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826',1,'data_structures::linked_list::list::list()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac681c278055081ac11decb6060b300de',1,'data_structures::linked_list::list::list(const list &other)']]], + ['listnode_28',['ListNode',['../d7/da4/struct_list_node.html#a3cfee2eb667c332dc32595208164ef0a',1,'ListNode::ListNode()=default'],['../d7/da4/struct_list_node.html#aaad9b553e2f936726f5b35ff2734125d',1,'ListNode::ListNode(int x)'],['../d7/da4/struct_list_node.html#afc97c5b9d2e7cc82d0718245688f6ff9',1,'ListNode::ListNode(int x, ListNode *next)']]], + ['llabs_29',['llabs',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]], + ['llrint_30',['llrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], + ['llround_31',['llround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], + ['load_32',['load',['http://en.cppreference.com/w/cpp/atomic/atomic/load.html',0,'std::atomic']]], + ['load_5ffactor_33',['load_factor',['http://en.cppreference.com/w/cpp/container/unordered_map/load_factor.html',0,'std::unordered_map::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/load_factor.html',0,'std::unordered_multimap::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/load_factor.html',0,'std::unordered_multiset::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_set/load_factor.html',0,'std::unordered_set::load_factor()']]], + ['load_5fmodel_34',['load_model',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58ed20abf6ce3744535bd8b5bb9e741b',1,'machine_learning::neural_network::NeuralNetwork']]], + ['locale_35',['locale',['http://en.cppreference.com/w/cpp/locale/locale/locale.html',0,'std::locale']]], + ['localeconv_36',['localeconv',['http://en.cppreference.com/w/cpp/locale/localeconv.html',0,'std']]], + ['localtime_37',['localtime',['http://en.cppreference.com/w/cpp/chrono/c/localtime.html',0,'std']]], + ['lock_38',['lock',['http://en.cppreference.com/w/cpp/memory/weak_ptr/lock.html',0,'std::weak_ptr::lock()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/lock.html',0,'std::unique_lock::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/lock.html',0,'std::recursive_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/lock.html',0,'std::recursive_timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/lock.html',0,'std::shared_lock::lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/lock.html',0,'std::timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/lock.html',0,'std::mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock.html',0,'std::shared_timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/lock.html',0,'std::lock()']]], + ['lock_5fguard_39',['lock_guard',['http://en.cppreference.com/w/cpp/thread/lock_guard/lock_guard.html',0,'std::lock_guard']]], + ['lock_5fshared_40',['lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock_shared.html',0,'std::shared_timed_mutex']]], + ['log_41',['log',['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['http://en.cppreference.com/w/cpp/numeric/math/log.html',0,'std::log()'],['../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058',1,'lru_tests::log()']]], + ['log10_42',['log10',['http://en.cppreference.com/w/cpp/numeric/math/log10.html',0,'std']]], + ['log1p_43',['log1p',['http://en.cppreference.com/w/cpp/numeric/math/log1p.html',0,'std']]], + ['logb_44',['logb',['http://en.cppreference.com/w/cpp/numeric/math/logb.html',0,'std']]], + ['logic_5ferror_45',['logic_error',['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std::logic_error']]], + ['lognormal_5fdistribution_46',['lognormal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/lognormal_distribution.html',0,'std::lognormal_distribution']]], + ['longest_5fcommon_5fstring_5flength_47',['longest_common_string_length',['../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5',1,'longest_common_string.cpp']]], + ['longjmp_48',['longjmp',['http://en.cppreference.com/w/cpp/utility/program/longjmp.html',0,'std']]], + ['lookup_5fclassname_49',['lookup_classname',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_classname.html',0,'std::regex_traits']]], + ['lookup_5fcollatename_50',['lookup_collatename',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_collatename.html',0,'std::regex_traits']]], + ['lower_51',['lower',['../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd',1,'uint128_t::lower()'],['../d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1',1,'uint256_t::lower()'],['../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9',1,'lower(): text_search.cpp']]], + ['lower_5fbound_52',['lower_bound',['http://en.cppreference.com/w/cpp/container/multiset/lower_bound.html',0,'std::multiset::lower_bound()'],['http://en.cppreference.com/w/cpp/container/set/lower_bound.html',0,'std::set::lower_bound()'],['http://en.cppreference.com/w/cpp/container/map/lower_bound.html',0,'std::map::lower_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/lower_bound.html',0,'std::multimap::lower_bound()'],['http://en.cppreference.com/w/cpp/algorithm/lower_bound.html',0,'std::lower_bound()']]], + ['lowest_53',['lowest',['http://en.cppreference.com/w/cpp/types/numeric_limits/lowest.html',0,'std::numeric_limits']]], + ['lowest_5fcommon_5fancestor_54',['lowest_common_ancestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488',1,'graph::LowestCommonAncestor']]], + ['lowestcommonancestor_55',['LowestCommonAncestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93',1,'graph::LowestCommonAncestor']]], + ['lps_56',['lps',['../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412',1,'dynamic_programming']]], + ['lrint_57',['lrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], + ['lround_58',['lround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], + ['lrucache_59',['LRUCache',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4',1,'others::lru_cache::LRUCache']]], + ['lt_60',['lt',['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits']]], + ['lu_5fdecomposition_61',['lu_decomposition',['../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509',1,'lu_decomposition.h']]] ]; diff --git a/search/functions_d.js b/search/functions_d.js index ade3c2144..42436a58a 100644 --- a/search/functions_d.js +++ b/search/functions_d.js @@ -3,7 +3,7 @@ var searchData= ['m_0',['m',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/params.html',0,'std::lognormal_distribution::m()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::m()']]], ['mag_1',['mag',['../df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8',1,'math::vector_cross']]], ['magic_5fnumber_2',['magic_number',['../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0',1,'math']]], - ['main_3',['main',['../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_partitioning.cpp'],['../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): word_break.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): shortest_common_supersequence.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): minimum_edit_distance.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): maximum_circular_subarray.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_palindromic_subsequence.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): longest_increasing_subsequence.cpp'],['../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_common_string.cpp'],['../db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadane2.cpp'],['../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): house_robber.cpp'],['../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cut_rod.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): coin_change_topdown.cpp'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): armstrong_number.cpp'],['../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): abbreviation.cpp'],['../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): z_function.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): rabin_karp.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): manacher_algorithm.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knuth_morris_pratt.cpp'],['../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): horspool.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brute_force_string_searching.cpp'],['../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boyer_moore.cpp'],['../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wave_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): strand_sort.cpp'],['../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stooge_sort.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): selection_sort_recursive.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_bubble_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): random_pivot_quick_sort.cpp'],['../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): radix_sort2.cpp'],['../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_3.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pigeonhole_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pancake_sort.cpp'],['../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_insertion_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heap_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gnome_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dnf_sort.cpp'],['../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cycle_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_inversions.cpp'],['../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): comb_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bogo_sort.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_insertion_sort.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): text_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ternary_search.cpp'],['../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sublist_search.cpp'],['../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): saddleback_search.cpp'],['../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search2.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search2.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hash_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): floyd_cycle_detection_algo.cpp'],['../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_search.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_search.cpp'],['../d4/d96/range__queries_2sparse__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_table.cpp'],['../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segtree.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prefix_sum_array.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): persistent_seg_tree_lazy_prop.cpp'],['../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heavy_light_decomposition.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fenwick_tree.cpp'],['../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): windowed_median.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): poisson_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): geometric_dist.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binomial_dist.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bayes_theorem.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): addition_rule.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ground_to_ground_projectile_motion.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_important_functions.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): tower_of_hanoi.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stairs_pattern.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): spiral_print.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_matrix.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): smallest_circle.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_tree_traversal.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primality_test.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): postfix_evaluation.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pascal_triangle.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_of_number.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): matrix_exponentiation.cpp'],['../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kelvin_to_celsius.cpp'],['../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadanes3.cpp'],['../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_tree_traversals.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): happy_number.cpp'],['../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_integer_input.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): decimal_to_roman_numeral.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): decimal_to_hexadecimal.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): buzz_number.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): union_of_two_arrays.cpp'],['../d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): trie_multiple_search.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_binary_tree.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): intersection_of_two_arrays.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): inorder_successor_of_bst.cpp'],['../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): circular_linked_list.cpp'],['../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_right_rotation.cpp'],['../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_left_rotation.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): successive_approximation.cpp'],['../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rungekutta.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): newton_raphson_method.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): midpoint_integral_method.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): inverse_fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gram_schmidt.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): golden_search_extrema.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gaussian_elimination.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): fast_fourier_transform.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): false_position.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): composite_simpson_rule.cpp'],['../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brent_method_extrema.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bisection_method.cpp'],['../dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): babylonian_method.cpp'],['../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): volume.cpp'],['../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_cross_product.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_digits.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_binomial_coefficient.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): string_fibonacci.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sqrt_double.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sieve_of_eratosthenes.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_equations_complex_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primes_up_to_billion.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_numbers.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_factorization.cpp'],['../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_two.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_for_huge_numbers.cpp'],['../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): perimeter.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): number_of_positive_divisors.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ncr_modulo_p.cpp'],['../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): n_choose_r.cpp'],['../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_bonacci.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_simple.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_fermat_little_theorem.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_exponentiation.cpp'],['../df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): modular_division.cpp'],['../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): miller_rabin.cpp'],['../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): magic_number.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): least_common_multiple.cpp'],['../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lcm_sum.cpp'],['../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): largest_power.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): large_factorial.cpp'],['../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_factorial.cpp'],['../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): inv_sqrt.cpp'],['../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation2.cpp'],['../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_recursive_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_of_n_numbers.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_iterative_euclidean.cpp'],['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): finding_number_of_digits_in_a_number.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_sum.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_matrix_exponentiation.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_fast.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_power.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): factorial.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): extended_euclid_algorithm.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eulers_totient_function.cpp'],['../d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eratosthenes.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_factorial.cpp'],['../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): complex_numbers.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_prime.cpp'],['../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_factorial.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_amicable_pair.cpp'],['../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): binomial_calculate.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_exponent.cpp'],['../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): area.cpp'],['../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): approximate_pi.cpp'],['../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): aliquot_sum.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ordinary_least_squares_regressor.cpp'],['../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): neural_network.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): k_nearest_neighbors.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.cpp'],['../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha256.cpp'],['../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha1.cpp'],['../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_probing_hash_table.cpp'],['../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): md5.cpp'],['../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_probing_hash_table.cpp'],['../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_hash_hash_table.cpp'],['../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): chaining.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kruskals_minimum_spanning_tree.cpp'],['../df/d64/jumpgame_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jumpgame.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boruvkas_minimum_spanning_tree.cpp'],['../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): spirograph.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_problem.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lowest_common_ancestor.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): is_graph_bipartite.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hopcroft_karp.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): hamiltons_cycle.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search_with_stack.cpp'],['../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components_with_dsu.cpp'],['../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components.cpp'],['../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): breadth_first_search.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bidirectional_dijkstra.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): line_segment_intersection.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jarvis_algorithm.cpp'],['../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): memory_game.cpp'],['../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): 0_1_knapsack.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../dd/d1e/generate__parentheses_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): generate_parentheses.cpp'],['../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): graph_coloring.cpp'],['../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knight_tour.cpp'],['../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): minimax.cpp'],['../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens.cpp'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens_all_solution_optimised.cpp'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): nqueen_print_all_solutions.cpp'],['../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subarray_sum.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sudoku_solver.cpp'],['../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_bits_flip.cpp'],['../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_set_bits.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): elliptic_curve_key_exchange.cpp'],['../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hill_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fcfs_scheduling.cpp'],['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): avltree.cpp'],['../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bloom_filter.cpp'],['../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): disjoint_set.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_union_rank.cpp'],['../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linked_list.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linkedlist_implentation_usingarray.cpp'],['../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): list_array.cpp'],['../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_array.cpp'],['../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_two_stacks.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segment_tree.cpp'],['../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): skip_list.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): treap.cpp'],['../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): tree_234.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_modern.cpp'],['../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_using_hashmap.cpp']]], + ['main_3',['main',['../dd/d1e/generate__parentheses_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): generate_parentheses.cpp'],['../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): graph_coloring.cpp'],['../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knight_tour.cpp'],['../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): minimax.cpp'],['../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens.cpp'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens_all_solution_optimised.cpp'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): nqueen_print_all_solutions.cpp'],['../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subarray_sum.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sudoku_solver.cpp'],['../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_bits_flip.cpp'],['../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_set_bits.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): elliptic_curve_key_exchange.cpp'],['../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hill_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fcfs_scheduling.cpp'],['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): avltree.cpp'],['../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bloom_filter.cpp'],['../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): disjoint_set.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_union_rank.cpp'],['../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linked_list.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linkedlist_implentation_usingarray.cpp'],['../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): list_array.cpp'],['../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_array.cpp'],['../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_two_stacks.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segment_tree.cpp'],['../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): skip_list.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): treap.cpp'],['../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): tree_234.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_modern.cpp'],['../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): abbreviation.cpp'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): armstrong_number.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): house_robber.cpp'],['../db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadane2.cpp'],['../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_common_string.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): shortest_common_supersequence.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): word_break.cpp'],['../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): memory_game.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jarvis_algorithm.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): line_segment_intersection.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components_with_dsu.cpp'],['../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): hamiltons_cycle.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hopcroft_karp.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): is_graph_bipartite.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_problem.cpp'],['../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): spirograph.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boruvkas_minimum_spanning_tree.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../df/d64/jumpgame_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jumpgame.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kruskals_minimum_spanning_tree.cpp'],['../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): chaining.cpp'],['../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_hash_hash_table.cpp'],['../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_probing_hash_table.cpp'],['../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): md5.cpp'],['../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_probing_hash_table.cpp'],['../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha1.cpp'],['../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha256.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): k_nearest_neighbors.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.cpp'],['../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): neural_network.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ordinary_least_squares_regressor.cpp'],['../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): aliquot_sum.cpp'],['../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): approximate_pi.cpp'],['../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): area.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_exponent.cpp'],['../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eulers_totient_function.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): extended_euclid_algorithm.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): factorial.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_power.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_fast.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_sum.cpp'],['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): finding_number_of_digits_in_a_number.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_recursive_euclidean.cpp'],['../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation.cpp'],['../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_factorial.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): large_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lcm_sum.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): miller_rabin.cpp'],['../df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): n_choose_r.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): number_of_positive_divisors.cpp'],['../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): perimeter.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_for_huge_numbers.cpp'],['../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_two.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_factorization.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primes_up_to_billion.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_equations_complex_numbers.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sieve_of_eratosthenes.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sqrt_double.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): string_fibonacci.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): babylonian_method.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bisection_method.cpp'],['../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brent_method_extrema.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): composite_simpson_rule.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): false_position.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): fast_fourier_transform.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gaussian_elimination.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): golden_search_extrema.cpp'],['../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): inverse_fast_fourier_transform.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): midpoint_integral_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): newton_raphson_method.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.cpp'],['../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rungekutta.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): successive_approximation.cpp'],['../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): union_of_two_arrays.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): buzz_number.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): decimal_to_hexadecimal.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): decimal_to_roman_numeral.cpp'],['../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_integer_input.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): happy_number.cpp'],['../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_tree_traversals.cpp'],['../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadanes3.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kelvin_to_celsius.cpp'],['../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): matrix_exponentiation.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_of_number.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pascal_triangle.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): postfix_evaluation.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primality_test.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): smallest_circle.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_matrix.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): spiral_print.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stairs_pattern.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): tower_of_hanoi.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_important_functions.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ground_to_ground_projectile_motion.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): addition_rule.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bayes_theorem.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binomial_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): geometric_dist.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): poisson_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): windowed_median.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fenwick_tree.cpp'],['../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heavy_light_decomposition.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segtree.cpp'],['../d4/d96/range__queries_2sparse__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_table.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_search.cpp'],['../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): floyd_cycle_detection_algo.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hash_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search2.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_search.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sublist_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ternary_search.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bogo_sort.cpp'],['../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): comb_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heap_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_insertion_sort.cpp'],['../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pancake_sort.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pigeonhole_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort.cpp'],['../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_3.cpp'],['../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): radix_sort2.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): selection_sort_recursive.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.cpp'],['../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stooge_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wave_sort.cpp'],['../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boyer_moore.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brute_force_string_searching.cpp'],['../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): horspool.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knuth_morris_pratt.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): manacher_algorithm.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): rabin_karp.cpp'],['../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): z_function.cpp']]], ['make_5fexception_5fptr_4',['make_exception_ptr',['http://en.cppreference.com/w/cpp/error/make_exception_ptr.html',0,'std']]], ['make_5fheap_5',['make_heap',['http://en.cppreference.com/w/cpp/algorithm/make_heap.html',0,'std']]], ['make_5fmove_5fiterator_6',['make_move_iterator',['http://en.cppreference.com/w/cpp/iterator/make_move_iterator.html',0,'std']]], @@ -20,18 +20,18 @@ var searchData= ['malloc_17',['malloc',['http://en.cppreference.com/w/cpp/memory/c/malloc.html',0,'std']]], ['manacher_18',['manacher',['../d3/d39/manacher__algorithm_8cpp.html#a95e6a2976bb2f332898f373941d52098',1,'strings::manacher']]], ['map_19',['map',['http://en.cppreference.com/w/cpp/container/map/map.html',0,'std::map']]], - ['mark_5fcount_20',['mark_count',['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::regex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::wregex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::basic_regex::mark_count()']]], + ['mark_5fcount_20',['mark_count',['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::regex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::basic_regex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::wregex::mark_count()']]], ['mat_5fmul_21',['mat_mul',['../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590',1,'ciphers::HillCipher::mat_mul()'],['../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae',1,'mat_mul(): qr_eigen_values.cpp']]], ['match_22',['match',['../dd/d92/memory__game_8cpp.html#a370760f2b328ad341bcb77d82fa17b01',1,'games::memory_game']]], ['match_5fresults_23',['match_results',['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::match_results']]], - ['matrix_24',['matrix',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer size)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer rows, const Integer cols)']]], - ['max_25',['max',['http://en.cppreference.com/w/cpp/algorithm/max.html',0,'std::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/max.html',0,'std::piecewise_linear_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::shuffle_order_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/max.html',0,'std::student_t_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937_64::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux24_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/max.html',0,'std::extreme_value_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/max.html',0,'std::lognormal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/max.html',0,'std::discrete_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux48::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/max.html',0,'std::piecewise_constant_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/max.html',0,'std::poisson_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/max.html',0,'std::bernoulli_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::discard_block_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/max.html',0,'std::exponential_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/max.html',0,'std::uniform_real_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/max.html',0,'std::geometric_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mersenne_twister_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/max.html',0,'std::independent_bits_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/max.html',0,'std::normal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand::max()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/max.html',0,'std::weibull_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux48_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/max.html',0,'std::negative_binomial_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937::max()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/max.html',0,'std::chi_squared_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/max.html',0,'std::random_device::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::subtract_with_carry_engine::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::minutes::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::seconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::duration::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::milliseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::hours::max()'],['http://en.cppreference.com/w/cpp/chrono/time_point/max.html',0,'std::chrono::time_point::max()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/max.html',0,'std::chrono::duration_values::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::microseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::nanoseconds::max()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/max.html',0,'std::numeric_limits::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/max.html',0,'std::uniform_int_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/max.html',0,'std::fisher_f_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux24::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::linear_congruential_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::knuth_b::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand0::max()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/max.html',0,'std::gamma_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/max.html',0,'std::binomial_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/max.html',0,'std::cauchy_distribution::max()']]], - ['max_5fbucket_5fcount_26',['max_bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_set/max_bucket_count.html',0,'std::unordered_set::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_bucket_count.html',0,'std::unordered_multiset::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_map/max_bucket_count.html',0,'std::unordered_map::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_bucket_count.html',0,'std::unordered_multimap::max_bucket_count()']]], + ['matrix_24',['Matrix',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer size)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer rows, const Integer cols)']]], + ['max_25',['max',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/max.html',0,'std::student_t_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937_64::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux24_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/max.html',0,'std::extreme_value_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/max.html',0,'std::lognormal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/max.html',0,'std::discrete_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux48::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/max.html',0,'std::piecewise_constant_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/max.html',0,'std::poisson_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/max.html',0,'std::bernoulli_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::discard_block_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/max.html',0,'std::exponential_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/max.html',0,'std::uniform_real_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/max.html',0,'std::geometric_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mersenne_twister_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/max.html',0,'std::independent_bits_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/max.html',0,'std::normal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand::max()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/max.html',0,'std::weibull_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux48_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/max.html',0,'std::negative_binomial_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937::max()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/max.html',0,'std::chi_squared_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/max.html',0,'std::piecewise_linear_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::shuffle_order_engine::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::minutes::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::seconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::duration::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::milliseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::hours::max()'],['http://en.cppreference.com/w/cpp/chrono/time_point/max.html',0,'std::chrono::time_point::max()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/max.html',0,'std::chrono::duration_values::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::microseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::nanoseconds::max()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/max.html',0,'std::numeric_limits::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/max.html',0,'std::uniform_int_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/max.html',0,'std::fisher_f_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux24::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::linear_congruential_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::knuth_b::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand0::max()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/max.html',0,'std::gamma_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/max.html',0,'std::binomial_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/max.html',0,'std::cauchy_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::subtract_with_carry_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/max.html',0,'std::random_device::max()'],['http://en.cppreference.com/w/cpp/algorithm/max.html',0,'std::max()']]], + ['max_5fbucket_5fcount_26',['max_bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_map/max_bucket_count.html',0,'std::unordered_map::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_bucket_count.html',0,'std::unordered_multimap::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_bucket_count.html',0,'std::unordered_multiset::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_bucket_count.html',0,'std::unordered_set::max_bucket_count()']]], ['max_5felement_27',['max_element',['http://en.cppreference.com/w/cpp/algorithm/max_element.html',0,'std']]], ['max_5fheight_28',['max_height',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa554429def63077ab7a550c0affbfefa',1,'physics::ground_to_ground_projectile_motion']]], ['max_5flength_29',['max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::max_length()']]], ['max_5fload_5ffactor_30',['max_load_factor',['http://en.cppreference.com/w/cpp/container/unordered_map/max_load_factor.html',0,'std::unordered_map::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_load_factor.html',0,'std::unordered_multimap::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_load_factor.html',0,'std::unordered_multiset::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_load_factor.html',0,'std::unordered_set::max_load_factor()']]], - ['max_5fsize_31',['max_size',['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::smatch::max_size()'],['http://en.cppreference.com/w/cpp/container/set/max_size.html',0,'std::set::max_size()'],['http://en.cppreference.com/w/cpp/container/multimap/max_size.html',0,'std::multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_size.html',0,'std::unordered_set::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::cmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/map/max_size.html',0,'std::map::max_size()'],['http://en.cppreference.com/w/cpp/container/list/max_size.html',0,'std::list::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u32string::max_size()'],['http://en.cppreference.com/w/cpp/container/multiset/max_size.html',0,'std::multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u16string::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_size.html',0,'std::unordered_multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::wstring::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::basic_string::max_size()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/max_size.html',0,'std::scoped_allocator_adaptor::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator/max_size.html',0,'std::allocator::max_size()'],['http://en.cppreference.com/w/cpp/container/deque/max_size.html',0,'std::deque::max_size()'],['http://en.cppreference.com/w/cpp/container/dynarray/max_size.html',0,'std::dynarray::max_size()'],['http://en.cppreference.com/w/cpp/container/vector/max_size.html',0,'std::vector::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::match_results::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator_traits/max_size.html',0,'std::allocator_traits::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::string::max_size()'],['http://en.cppreference.com/w/cpp/container/array/max_size.html',0,'std::array::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/max_size.html',0,'std::unordered_map::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wsmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_size.html',0,'std::unordered_multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/forward_list/max_size.html',0,'std::forward_list::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wcmatch::max_size()']]], + ['max_5fsize_31',['max_size',['http://en.cppreference.com/w/cpp/container/dynarray/max_size.html',0,'std::dynarray::max_size()'],['http://en.cppreference.com/w/cpp/container/vector/max_size.html',0,'std::vector::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::match_results::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator_traits/max_size.html',0,'std::allocator_traits::max_size()'],['http://en.cppreference.com/w/cpp/container/multiset/max_size.html',0,'std::multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::string::max_size()'],['http://en.cppreference.com/w/cpp/container/set/max_size.html',0,'std::set::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/max_size.html',0,'std::unordered_map::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wsmatch::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::smatch::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_size.html',0,'std::unordered_multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/forward_list/max_size.html',0,'std::forward_list::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wcmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/deque/max_size.html',0,'std::deque::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator/max_size.html',0,'std::allocator::max_size()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/max_size.html',0,'std::scoped_allocator_adaptor::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::basic_string::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::wstring::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_size.html',0,'std::unordered_multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u16string::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u32string::max_size()'],['http://en.cppreference.com/w/cpp/container/list/max_size.html',0,'std::list::max_size()'],['http://en.cppreference.com/w/cpp/container/map/max_size.html',0,'std::map::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::cmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_size.html',0,'std::unordered_set::max_size()'],['http://en.cppreference.com/w/cpp/container/multimap/max_size.html',0,'std::multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/array/max_size.html',0,'std::array::max_size()']]], ['max_5fsubarray_5fsum_32',['max_subarray_sum',['../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147',1,'kadanes3.cpp']]], ['maxcircularsum_33',['maxCircularSum',['../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb',1,'dynamic_programming']]], ['maxknapsackvalue_34',['maxKnapsackValue',['../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1',1,'dynamic_programming::knapsack']]], @@ -46,7 +46,7 @@ var searchData= ['mbsrtowcs_43',['mbsrtowcs',['http://en.cppreference.com/w/cpp/string/multibyte/mbsrtowcs.html',0,'std']]], ['mbstowcs_44',['mbstowcs',['http://en.cppreference.com/w/cpp/string/multibyte/mbstowcs.html',0,'std']]], ['mbtowc_45',['mbtowc',['http://en.cppreference.com/w/cpp/string/multibyte/mbtowc.html',0,'std']]], - ['mean_46',['mean',['../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b',1,'statistics::stats_computer1::mean()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution::mean()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/mean.html',0,'std::poisson_distribution::mean()'],['../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e',1,'statistics::stats_computer2::mean()']]], + ['mean_46',['mean',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/mean.html',0,'std::poisson_distribution::mean()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution::mean()'],['../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b',1,'statistics::stats_computer1::mean()'],['../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e',1,'statistics::stats_computer2::mean()']]], ['median_5fof_5fmedians_47',['median_of_medians',['../d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae',1,'search::median_search']]], ['mem_5ffn_48',['mem_fn',['http://en.cppreference.com/w/cpp/utility/functional/mem_fn.html',0,'std']]], ['memchr_49',['memchr',['http://en.cppreference.com/w/cpp/string/byte/memchr.html',0,'std']]], @@ -54,58 +54,59 @@ var searchData= ['memcpy_51',['memcpy',['http://en.cppreference.com/w/cpp/string/byte/memcpy.html',0,'std']]], ['memmove_52',['memmove',['http://en.cppreference.com/w/cpp/string/byte/memmove.html',0,'std']]], ['memset_53',['memset',['http://en.cppreference.com/w/cpp/string/byte/memset.html',0,'std']]], - ['merge_54',['merge',['http://en.cppreference.com/w/cpp/algorithm/merge.html',0,'std::merge()'],['../de/d7b/merge__insertion__sort_8cpp.html#af4de4067a9a866ffd985c5b5055ccedf',1,'sorting::merge_insertion::merge()'],['../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079',1,'sorting::merge()'],['http://en.cppreference.com/w/cpp/container/list/merge.html',0,'std::list::merge()'],['../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73',1,'merge(): merge_sort.cpp'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9',1,'data_structures::tree_234::Tree234::Merge()'],['http://en.cppreference.com/w/cpp/container/forward_list/merge.html',0,'std::forward_list::merge()'],['../d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f',1,'sorting::inversion::merge()']]], - ['mergenode_55',['MergeNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805',1,'data_structures::tree_234::Tree234']]], - ['mergenodenotfull_56',['MergeNodeNotFull',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95',1,'data_structures::tree_234::Tree234']]], - ['mergesort_57',['mergesort',['../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661',1,'sorting::inversion::mergeSort()'],['../de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674',1,'sorting::merge_insertion::mergeSort()'],['../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7',1,'mergeSort(): merge_sort.cpp']]], - ['mersenne_5ftwister_5fengine_58',['mersenne_twister_engine',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mersenne_twister_engine']]], - ['message_59',['message',['http://en.cppreference.com/w/cpp/error/error_code/message.html',0,'std::error_code::message()'],['http://en.cppreference.com/w/cpp/error/error_condition/message.html',0,'std::error_condition::message()'],['http://en.cppreference.com/w/cpp/error/error_category/message.html',0,'std::error_category::message()']]], - ['messages_60',['messages',['http://en.cppreference.com/w/cpp/locale/messages/messages.html',0,'std::messages']]], - ['messages_5fbyname_61',['messages_byname',['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname']]], - ['method1_62',['method1',['../df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11',1,'decimal_to_binary.cpp']]], - ['method2_63',['method2',['../df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7',1,'decimal_to_binary.cpp']]], - ['microseconds_64',['microseconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::microseconds']]], - ['mid_65',['mid',['../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141',1,'data_structures::SegmentTree']]], - ['middlenode_66',['middleNode',['../d8/dfa/median__search2_8cpp.html#a5fefe132a0c3ee780ebc703f37ebce6a',1,'search::median_search2']]], - ['midpoint_67',['midpoint',['../df/d11/midpoint__integral__method_8cpp.html#a7072493d1f0f8a91b2a71d4cc456c09c',1,'numerical_methods::midpoint_rule']]], - ['midpoint_5feuler_68',['midpoint_euler',['../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985',1,'ode_midpoint_euler.cpp']]], - ['midpoint_5feuler_5fstep_69',['midpoint_euler_step',['../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812',1,'ode_midpoint_euler.cpp']]], - ['miller_5frabin_5fprimality_5ftest_70',['miller_rabin_primality_test',['../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce',1,'miller_rabin.cpp']]], - ['miller_5ftest_71',['miller_test',['../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506',1,'miller_rabin.cpp']]], - ['milliseconds_72',['milliseconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::milliseconds']]], - ['min_73',['min',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux24::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::linear_congruential_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::knuth_b::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand0::min()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/min.html',0,'std::gamma_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/min.html',0,'std::binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/min.html',0,'std::cauchy_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::subtract_with_carry_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/min.html',0,'std::random_device::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::hours::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/min.html',0,'std::piecewise_linear_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/min.html',0,'std::chi_squared_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937::min()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/min.html',0,'std::negative_binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux48_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/min.html',0,'std::weibull_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand::min()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/min.html',0,'std::normal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/min.html',0,'std::independent_bits_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mersenne_twister_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/min.html',0,'std::geometric_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/min.html',0,'std::uniform_real_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/min.html',0,'std::exponential_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::discard_block_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/min.html',0,'std::bernoulli_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/min.html',0,'std::poisson_distribution::min()'],['../da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347',1,'dynamic_programming::minimum_edit_distance::min()'],['http://en.cppreference.com/w/cpp/algorithm/min.html',0,'std::min()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/min.html',0,'std::fisher_f_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/min.html',0,'std::uniform_int_distribution::min()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/min.html',0,'std::numeric_limits::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::nanoseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::microseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/min.html',0,'std::chrono::duration_values::min()'],['http://en.cppreference.com/w/cpp/chrono/time_point/min.html',0,'std::chrono::time_point::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::shuffle_order_engine::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::milliseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::duration::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::seconds::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/min.html',0,'std::piecewise_constant_distribution::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::minutes::min()'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/min.html',0,'std::student_t_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937_64::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux24_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/min.html',0,'std::extreme_value_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/min.html',0,'std::lognormal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/min.html',0,'std::discrete_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux48::min()']]], - ['min_5felement_74',['min_element',['http://en.cppreference.com/w/cpp/algorithm/min_element.html',0,'std']]], - ['mincoins_75',['mincoins',['../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a',1,'dynamic_programming::mincoins_topdown']]], - ['minheap_76',['MinHeap',['../d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820',1,'MinHeap']]], - ['minheapify_77',['MinHeapify',['../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad',1,'MinHeap']]], - ['minimax_78',['minimax',['../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50',1,'backtracking']]], - ['minimum_5fdistance_79',['minimum_distance',['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#af6cb29ca6dc5771439f6ea7262058a71',1,'greedy_algorithms::dijkstra']]], - ['minmax_80',['minmax',['http://en.cppreference.com/w/cpp/algorithm/minmax.html',0,'std']]], - ['minmax_5felement_81',['minmax_element',['http://en.cppreference.com/w/cpp/algorithm/minmax_element.html',0,'std']]], - ['minmax_5fscaler_82',['minmax_scaler',['../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26',1,'machine_learning']]], - ['minstd_5frand_83',['minstd_rand',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand']]], - ['minstd_5frand0_84',['minstd_rand0',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand0']]], - ['minutes_85',['minutes',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::minutes']]], - ['minvalue_86',['minValue',['../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e',1,'avltree.cpp']]], - ['mismatch_87',['mismatch',['http://en.cppreference.com/w/cpp/algorithm/mismatch.html',0,'std']]], - ['mktime_88',['mktime',['http://en.cppreference.com/w/cpp/chrono/c/mktime.html',0,'std']]], - ['mod_5fdivision_89',['mod_division',['../df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7',1,'math::modular_division']]], - ['modf_90',['modf',['http://en.cppreference.com/w/cpp/numeric/math/modf.html',0,'std']]], - ['modinverse_91',['modInverse',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a0431ec5c876e1154d8e1e5f89e1ab34a',1,'math::ncr_modulo_p::NCRModuloP']]], - ['modular_5fexponentiation_92',['modular_exponentiation',['../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29',1,'miller_rabin.cpp']]], - ['money_5fget_93',['money_get',['http://en.cppreference.com/w/cpp/locale/money_get/money_get.html',0,'std::money_get']]], - ['money_5fput_94',['money_put',['http://en.cppreference.com/w/cpp/locale/money_put/money_put.html',0,'std::money_put']]], - ['moneypunct_95',['moneypunct',['http://en.cppreference.com/w/cpp/locale/moneypunct/moneypunct.html',0,'std::moneypunct']]], - ['moneypunct_5fbyname_96',['moneypunct_byname',['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std::moneypunct_byname']]], - ['morse_5fto_5fchar_97',['morse_to_char',['../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829',1,'ciphers::morse']]], - ['mov_98',['mov',['../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d',1,'tower_of_hanoi.cpp']]], - ['move_99',['move',['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wstringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wfstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wiostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::strstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_fstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ios::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostream::move()'],['http://en.cppreference.com/w/cpp/string/char_traits/move.html',0,'std::char_traits::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::fstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ofstream::move()'],['http://en.cppreference.com/w/cpp/utility/move.html',0,'std::move(T... args)']]], - ['move_5fbackward_100',['move_backward',['http://en.cppreference.com/w/cpp/algorithm/move_backward.html',0,'std']]], - ['move_5fif_5fnoexcept_101',['move_if_noexcept',['http://en.cppreference.com/w/cpp/utility/move_if_noexcept.html',0,'std']]], - ['mt19937_102',['mt19937',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937']]], - ['mt19937_5f64_103',['mt19937_64',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937_64']]], - ['multimap_104',['multimap',['http://en.cppreference.com/w/cpp/container/multimap/multimap.html',0,'std::multimap']]], - ['multiply_105',['multiply',['../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252',1,'multiply(): matrix_exponentiation.cpp'],['../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc',1,'large_number::multiply()'],['../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9',1,'multiply(): power_for_huge_numbers.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e',1,'math::fibonacci_sum::multiply()'],['../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9',1,'machine_learning::multiply()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2',1,'ciphers::elliptic_curve_key_exchange::multiply()']]], - ['multiset_106',['multiset',['http://en.cppreference.com/w/cpp/container/multiset/multiset.html',0,'std::multiset']]], - ['mutex_107',['mutex',['http://en.cppreference.com/w/cpp/thread/shared_lock/mutex.html',0,'std::shared_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/mutex.html',0,'std::unique_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/mutex/mutex.html',0,'std::mutex::mutex()']]] + ['merge_54',['Merge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9',1,'data_structures::tree_234::Tree234']]], + ['merge_55',['merge',['http://en.cppreference.com/w/cpp/container/forward_list/merge.html',0,'std::forward_list::merge()'],['http://en.cppreference.com/w/cpp/container/list/merge.html',0,'std::list::merge()'],['http://en.cppreference.com/w/cpp/algorithm/merge.html',0,'std::merge()'],['../d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f',1,'sorting::inversion::merge()'],['../de/d7b/merge__insertion__sort_8cpp.html#af4de4067a9a866ffd985c5b5055ccedf',1,'sorting::merge_insertion::merge()'],['../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73',1,'merge(): merge_sort.cpp'],['../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079',1,'sorting::merge()']]], + ['mergenode_56',['MergeNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805',1,'data_structures::tree_234::Tree234']]], + ['mergenodenotfull_57',['MergeNodeNotFull',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95',1,'data_structures::tree_234::Tree234']]], + ['mergesort_58',['mergeSort',['../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661',1,'sorting::inversion::mergeSort()'],['../de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674',1,'sorting::merge_insertion::mergeSort()'],['../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7',1,'mergeSort(): merge_sort.cpp']]], + ['mersenne_5ftwister_5fengine_59',['mersenne_twister_engine',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mersenne_twister_engine']]], + ['message_60',['message',['http://en.cppreference.com/w/cpp/error/error_code/message.html',0,'std::error_code::message()'],['http://en.cppreference.com/w/cpp/error/error_category/message.html',0,'std::error_category::message()'],['http://en.cppreference.com/w/cpp/error/error_condition/message.html',0,'std::error_condition::message()']]], + ['messages_61',['messages',['http://en.cppreference.com/w/cpp/locale/messages/messages.html',0,'std::messages']]], + ['messages_5fbyname_62',['messages_byname',['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname']]], + ['method1_63',['method1',['../df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11',1,'decimal_to_binary.cpp']]], + ['method2_64',['method2',['../df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7',1,'decimal_to_binary.cpp']]], + ['microseconds_65',['microseconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::microseconds']]], + ['mid_66',['mid',['../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141',1,'data_structures::SegmentTree']]], + ['middlenode_67',['middleNode',['../d8/dfa/median__search2_8cpp.html#a5fefe132a0c3ee780ebc703f37ebce6a',1,'search::median_search2']]], + ['midpoint_68',['midpoint',['../df/d11/midpoint__integral__method_8cpp.html#a7072493d1f0f8a91b2a71d4cc456c09c',1,'numerical_methods::midpoint_rule']]], + ['midpoint_5feuler_69',['midpoint_euler',['../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985',1,'ode_midpoint_euler.cpp']]], + ['midpoint_5feuler_5fstep_70',['midpoint_euler_step',['../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812',1,'ode_midpoint_euler.cpp']]], + ['miller_5frabin_5fprimality_5ftest_71',['miller_rabin_primality_test',['../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce',1,'miller_rabin.cpp']]], + ['miller_5ftest_72',['miller_test',['../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506',1,'miller_rabin.cpp']]], + ['milliseconds_73',['milliseconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::milliseconds']]], + ['min_74',['min',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/min.html',0,'std::student_t_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937_64::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux24_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/min.html',0,'std::extreme_value_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/min.html',0,'std::lognormal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/min.html',0,'std::discrete_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux48::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/min.html',0,'std::piecewise_constant_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/min.html',0,'std::poisson_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/min.html',0,'std::bernoulli_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::discard_block_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/min.html',0,'std::exponential_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/min.html',0,'std::uniform_real_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/min.html',0,'std::geometric_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mersenne_twister_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/min.html',0,'std::independent_bits_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/min.html',0,'std::normal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand::min()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/min.html',0,'std::weibull_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux48_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/min.html',0,'std::negative_binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937::min()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/min.html',0,'std::chi_squared_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/min.html',0,'std::piecewise_linear_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::shuffle_order_engine::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::minutes::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::seconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::duration::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::milliseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::hours::min()'],['http://en.cppreference.com/w/cpp/chrono/time_point/min.html',0,'std::chrono::time_point::min()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/min.html',0,'std::chrono::duration_values::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::microseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::nanoseconds::min()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/min.html',0,'std::numeric_limits::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/min.html',0,'std::uniform_int_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/min.html',0,'std::fisher_f_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux24::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::linear_congruential_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::knuth_b::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand0::min()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/min.html',0,'std::gamma_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/min.html',0,'std::binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/min.html',0,'std::cauchy_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::subtract_with_carry_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/min.html',0,'std::random_device::min()'],['http://en.cppreference.com/w/cpp/algorithm/min.html',0,'std::min()'],['../da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347',1,'dynamic_programming::minimum_edit_distance::min()']]], + ['min_5felement_75',['min_element',['http://en.cppreference.com/w/cpp/algorithm/min_element.html',0,'std']]], + ['mincoins_76',['mincoins',['../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a',1,'dynamic_programming::mincoins_topdown']]], + ['minheap_77',['MinHeap',['../d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820',1,'MinHeap']]], + ['minheapify_78',['MinHeapify',['../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad',1,'MinHeap']]], + ['minimax_79',['minimax',['../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50',1,'backtracking']]], + ['minimum_5fdistance_80',['minimum_distance',['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#af6cb29ca6dc5771439f6ea7262058a71',1,'greedy_algorithms::dijkstra']]], + ['minmax_81',['minmax',['http://en.cppreference.com/w/cpp/algorithm/minmax.html',0,'std']]], + ['minmax_5felement_82',['minmax_element',['http://en.cppreference.com/w/cpp/algorithm/minmax_element.html',0,'std']]], + ['minmax_5fscaler_83',['minmax_scaler',['../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26',1,'machine_learning']]], + ['minstd_5frand_84',['minstd_rand',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand']]], + ['minstd_5frand0_85',['minstd_rand0',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand0']]], + ['minutes_86',['minutes',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::minutes']]], + ['minvalue_87',['minValue',['../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e',1,'avltree.cpp']]], + ['mismatch_88',['mismatch',['http://en.cppreference.com/w/cpp/algorithm/mismatch.html',0,'std']]], + ['mktime_89',['mktime',['http://en.cppreference.com/w/cpp/chrono/c/mktime.html',0,'std']]], + ['mod_5fdivision_90',['mod_division',['../df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7',1,'math::modular_division']]], + ['modf_91',['modf',['http://en.cppreference.com/w/cpp/numeric/math/modf.html',0,'std']]], + ['modinverse_92',['modInverse',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a0431ec5c876e1154d8e1e5f89e1ab34a',1,'math::ncr_modulo_p::NCRModuloP']]], + ['modular_5fexponentiation_93',['modular_exponentiation',['../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29',1,'miller_rabin.cpp']]], + ['money_5fget_94',['money_get',['http://en.cppreference.com/w/cpp/locale/money_get/money_get.html',0,'std::money_get']]], + ['money_5fput_95',['money_put',['http://en.cppreference.com/w/cpp/locale/money_put/money_put.html',0,'std::money_put']]], + ['moneypunct_96',['moneypunct',['http://en.cppreference.com/w/cpp/locale/moneypunct/moneypunct.html',0,'std::moneypunct']]], + ['moneypunct_5fbyname_97',['moneypunct_byname',['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std::moneypunct_byname']]], + ['morse_5fto_5fchar_98',['morse_to_char',['../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829',1,'ciphers::morse']]], + ['mov_99',['mov',['../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d',1,'tower_of_hanoi.cpp']]], + ['move_100',['move',['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::fstream::move()'],['http://en.cppreference.com/w/cpp/string/char_traits/move.html',0,'std::char_traits::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ios::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_fstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::strstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wiostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wfstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wstringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ifstream::move()'],['http://en.cppreference.com/w/cpp/utility/move.html',0,'std::move(T... args)']]], + ['move_5fbackward_101',['move_backward',['http://en.cppreference.com/w/cpp/algorithm/move_backward.html',0,'std']]], + ['move_5fif_5fnoexcept_102',['move_if_noexcept',['http://en.cppreference.com/w/cpp/utility/move_if_noexcept.html',0,'std']]], + ['mt19937_103',['mt19937',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937']]], + ['mt19937_5f64_104',['mt19937_64',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937_64']]], + ['multimap_105',['multimap',['http://en.cppreference.com/w/cpp/container/multimap/multimap.html',0,'std::multimap']]], + ['multiply_106',['multiply',['../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc',1,'large_number::multiply()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2',1,'ciphers::elliptic_curve_key_exchange::multiply()'],['../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9',1,'machine_learning::multiply()'],['../de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e',1,'math::fibonacci_sum::multiply()'],['../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9',1,'multiply(int x, int res[], int res_size): power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252',1,'multiply(const vector< vector< ll > > &A, const vector< vector< ll > > &B): matrix_exponentiation.cpp']]], + ['multiset_107',['multiset',['http://en.cppreference.com/w/cpp/container/multiset/multiset.html',0,'std::multiset']]], + ['mutex_108',['mutex',['http://en.cppreference.com/w/cpp/thread/unique_lock/mutex.html',0,'std::unique_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/mutex.html',0,'std::shared_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/mutex/mutex.html',0,'std::mutex::mutex()']]] ]; diff --git a/search/functions_e.js b/search/functions_e.js index 79f4b569a..457b83f75 100644 --- a/search/functions_e.js +++ b/search/functions_e.js @@ -5,60 +5,61 @@ var searchData= ['n_5fchoose_5fr_2',['n_choose_r',['../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967',1,'math']]], ['n_5fpolygon_5fsurface_5fperimeter_3',['n_polygon_surface_perimeter',['../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f',1,'math']]], ['naive_5fmultiplication_4',['naive_multiplication',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50',1,'divide_and_conquer::strassens_multiplication::Matrix']]], - ['name_5',['name',['http://en.cppreference.com/w/cpp/types/type_index/name.html',0,'std::type_index::name()'],['http://en.cppreference.com/w/cpp/locale/locale/name.html',0,'std::locale::name()'],['http://en.cppreference.com/w/cpp/types/type_info/name.html',0,'std::type_info::name()'],['http://en.cppreference.com/w/cpp/error/error_category/name.html',0,'std::error_category::name()']]], + ['name_5',['name',['http://en.cppreference.com/w/cpp/locale/locale/name.html',0,'std::locale::name()'],['http://en.cppreference.com/w/cpp/error/error_category/name.html',0,'std::error_category::name()'],['http://en.cppreference.com/w/cpp/types/type_info/name.html',0,'std::type_info::name()'],['http://en.cppreference.com/w/cpp/types/type_index/name.html',0,'std::type_index::name()']]], ['nan_6',['nan',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]], ['nanf_7',['nanf',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]], ['nanl_8',['nanl',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]], ['nanoseconds_9',['nanoseconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::nanoseconds']]], - ['narrow_10',['narrow',['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_fstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::strstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wiostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ios::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wfstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wstringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ifstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ofstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::fstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostringstream::narrow()']]], - ['native_5fhandle_11',['native_handle',['http://en.cppreference.com/w/cpp/thread/mutex/native_handle.html',0,'std::mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/native_handle.html',0,'std::condition_variable::native_handle()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/native_handle.html',0,'std::recursive_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/native_handle.html',0,'std::recursive_timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/thread/native_handle.html',0,'std::thread::native_handle()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/native_handle.html',0,'std::timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/condition_variable_any/native_handle.html',0,'std::condition_variable_any::native_handle()']]], - ['ncr_12',['ncr',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a6b95277f5f527beacc8d0f3bc91fcd08',1,'math::ncr_modulo_p::NCRModuloP::ncr()'],['../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a',1,'nCr(): binomial_dist.cpp']]], - ['ncrmodulop_13',['NCRModuloP',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#af3d41271912f9fa50b774c96c51874b9',1,'math::ncr_modulo_p::NCRModuloP']]], - ['nearbyint_14',['nearbyint',['http://en.cppreference.com/w/cpp/numeric/math/nearbyint.html',0,'std']]], - ['neg_5fformat_15',['neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::neg_format()']]], - ['negative_5fbinomial_5fdistribution_16',['negative_binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/negative_binomial_distribution.html',0,'std::negative_binomial_distribution']]], - ['negative_5fsign_17',['negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::negative_sign()']]], - ['nested_5fexception_18',['nested_exception',['http://en.cppreference.com/w/cpp/error/nested_exception/nested_exception.html',0,'std::nested_exception']]], - ['nested_5fptr_19',['nested_ptr',['http://en.cppreference.com/w/cpp/error/nested_exception/nested_ptr.html',0,'std::nested_exception']]], - ['neuralnetwork_20',['neuralnetwork',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const NeuralNetwork &model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4c6f63ab965317f9471518ee931b89',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector< std::pair< int, std::string > > &config, const std::vector< std::vector< std::valarray< double > > > &kernels)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a173bb71780af6953ec2e307a4c74b025',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(NeuralNetwork &&)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a62151b0398a2536be60d950e10ffe9a8',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector< std::pair< int, std::string > > &config)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork()=default']]], - ['new_5fval_21',['new_val',['../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534',1,'statistics::stats_computer2::new_val()'],['../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2',1,'statistics::stats_computer1::new_val()']]], - ['newkid_22',['newKid',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817',1,'range_queries::perSegTree']]], - ['next_23',['next',['http://en.cppreference.com/w/cpp/iterator/next.html',0,'std']]], - ['next_5fhigher_5fnumber_24',['next_higher_number',['../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e',1,'bit_manipulation']]], - ['next_5fpermutation_25',['next_permutation',['http://en.cppreference.com/w/cpp/algorithm/next_permutation.html',0,'std']]], - ['nextafter_26',['nextafter',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]], - ['nexttoward_27',['nexttoward',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]], - ['no_5foccurence_5ftests_28',['no_occurence_tests',['../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d',1,'fibonacci_search.cpp']]], - ['no_5fof_5fconnected_5fcomponents_29',['no_of_connected_components',['../d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141',1,'graph::disjoint_union']]], - ['noboolalpha_30',['noboolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]], - ['node_31',['node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670',1,'data_structures::tree_234::Node::Node()'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5',1,'operations_on_datastructures::circular_linked_list::Node::Node()'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3',1,'operations_on_datastructures::reverse_binary_tree::Node::Node()'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95',1,'operations_on_datastructures::circular_linked_list::Node::Node()'],['../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78',1,'data_structures::Node::Node()']]], - ['non_5frecursive_5fmerge_5fsort_32',['non_recursive_merge_sort',['../d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534',1,'sorting::non_recursive_merge_sort(const Iterator first, const size_t n)'],['../d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last)'],['../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)']]], - ['none_33',['none',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], - ['none_5fof_34',['none_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], - ['normal_5fdistribution_35',['normal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/normal_distribution.html',0,'std::normal_distribution']]], - ['noshowbase_36',['noshowbase',['http://en.cppreference.com/w/cpp/io/manip/showbase.html',0,'std']]], - ['noshowpoint_37',['noshowpoint',['http://en.cppreference.com/w/cpp/io/manip/showpoint.html',0,'std']]], - ['noshowpos_38',['noshowpos',['http://en.cppreference.com/w/cpp/io/manip/showpos.html',0,'std']]], - ['noskipws_39',['noskipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]], - ['not1_40',['not1',['http://en.cppreference.com/w/cpp/utility/functional/not1.html',0,'std']]], - ['not2_41',['not2',['http://en.cppreference.com/w/cpp/utility/functional/not2.html',0,'std']]], - ['not_5feof_42',['not_eof',['http://en.cppreference.com/w/cpp/string/char_traits/not_eof.html',0,'std::char_traits']]], - ['notify_5fall_43',['notify_all',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_all.html',0,'std::condition_variable_any::notify_all()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_all.html',0,'std::condition_variable::notify_all()']]], - ['notify_5fall_5fat_5fthread_5fexit_44',['notify_all_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/notify_all_at_thread_exit.html',0,'std']]], - ['notify_5fone_45',['notify_one',['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_one.html',0,'std::condition_variable::notify_one()'],['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_one.html',0,'std::condition_variable_any::notify_one()']]], - ['nounitbuf_46',['nounitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], - ['nouppercase_47',['nouppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], - ['now_48',['now',['http://en.cppreference.com/w/cpp/chrono/steady_clock/now.html',0,'std::chrono::steady_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html',0,'std::chrono::high_resolution_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/system_clock/now.html',0,'std::chrono::system_clock::now()']]], - ['nqueensol_49',['nqueensol',['../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108',1,'backtracking::n_queens_all_solutions::NQueenSol()'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f',1,'backtracking::n_queens_optimized::NQueenSol()']]], - ['nth_5felement_50',['nth_element',['http://en.cppreference.com/w/cpp/algorithm/nth_element.html',0,'std']]], - ['num_5fdigits_51',['num_digits',['../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93',1,'large_number']]], - ['num_5fget_52',['num_get',['http://en.cppreference.com/w/cpp/locale/num_get/num_get.html',0,'std::num_get']]], - ['num_5fput_53',['num_put',['http://en.cppreference.com/w/cpp/locale/num_put/num_put.html',0,'std::num_put']]], - ['number_5fof_5fpositive_5fdivisors_54',['number_of_positive_divisors',['../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb',1,'number_of_positive_divisors.cpp']]], - ['number_5fof_5fsubsets_55',['number_of_subsets',['../d0/dfe/backtracking_2subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99',1,'backtracking::subset_sum']]], - ['number_5fof_5fvertices_56',['number_of_vertices',['../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904',1,'graph::Graph']]], - ['numberofchildren_57',['numberOfChildren',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0',1,'operations_on_datastructures::trie_operations::Tnode']]], - ['numberofciphersinfactorialn_58',['numberOfCiphersInFactorialN',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0',1,'bit_manipulation::count_of_trailing_ciphers_in_factorial_n']]], - ['numpunct_59',['numpunct',['http://en.cppreference.com/w/cpp/locale/numpunct/numpunct.html',0,'std::numpunct']]], - ['numpunct_5fbyname_60',['numpunct_byname',['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std::numpunct_byname']]] + ['narrow_10',['narrow',['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ofstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::fstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ios::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_fstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::strstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wiostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istringstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wfstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wstringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ifstream::narrow()']]], + ['native_5fhandle_11',['native_handle',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/native_handle.html',0,'std::condition_variable_any::native_handle()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/native_handle.html',0,'std::condition_variable::native_handle()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/native_handle.html',0,'std::recursive_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/native_handle.html',0,'std::recursive_timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/thread/native_handle.html',0,'std::thread::native_handle()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/native_handle.html',0,'std::timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/mutex/native_handle.html',0,'std::mutex::native_handle()']]], + ['ncr_12',['ncr',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a6b95277f5f527beacc8d0f3bc91fcd08',1,'math::ncr_modulo_p::NCRModuloP']]], + ['ncr_13',['nCr',['../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a',1,'binomial_dist.cpp']]], + ['ncrmodulop_14',['NCRModuloP',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#af3d41271912f9fa50b774c96c51874b9',1,'math::ncr_modulo_p::NCRModuloP']]], + ['nearbyint_15',['nearbyint',['http://en.cppreference.com/w/cpp/numeric/math/nearbyint.html',0,'std']]], + ['neg_5fformat_16',['neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::neg_format()']]], + ['negative_5fbinomial_5fdistribution_17',['negative_binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/negative_binomial_distribution.html',0,'std::negative_binomial_distribution']]], + ['negative_5fsign_18',['negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::negative_sign()']]], + ['nested_5fexception_19',['nested_exception',['http://en.cppreference.com/w/cpp/error/nested_exception/nested_exception.html',0,'std::nested_exception']]], + ['nested_5fptr_20',['nested_ptr',['http://en.cppreference.com/w/cpp/error/nested_exception/nested_ptr.html',0,'std::nested_exception']]], + ['neuralnetwork_21',['NeuralNetwork',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4c6f63ab965317f9471518ee931b89',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector< std::pair< int, std::string > > &config, const std::vector< std::vector< std::valarray< double > > > &kernels)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork()=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a62151b0398a2536be60d950e10ffe9a8',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector< std::pair< int, std::string > > &config)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const NeuralNetwork &model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a173bb71780af6953ec2e307a4c74b025',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(NeuralNetwork &&)=default']]], + ['new_5fval_22',['new_val',['../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2',1,'statistics::stats_computer1::new_val()'],['../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534',1,'statistics::stats_computer2::new_val()']]], + ['newkid_23',['newKid',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817',1,'range_queries::perSegTree']]], + ['next_24',['next',['http://en.cppreference.com/w/cpp/iterator/next.html',0,'std']]], + ['next_5fhigher_5fnumber_25',['next_higher_number',['../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e',1,'bit_manipulation']]], + ['next_5fpermutation_26',['next_permutation',['http://en.cppreference.com/w/cpp/algorithm/next_permutation.html',0,'std']]], + ['nextafter_27',['nextafter',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]], + ['nexttoward_28',['nexttoward',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]], + ['no_5foccurence_5ftests_29',['no_occurence_tests',['../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d',1,'fibonacci_search.cpp']]], + ['no_5fof_5fconnected_5fcomponents_30',['no_of_connected_components',['../d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141',1,'graph::disjoint_union']]], + ['noboolalpha_31',['noboolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]], + ['node_32',['Node',['../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78',1,'data_structures::Node::Node()'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670',1,'data_structures::tree_234::Node::Node()'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5',1,'operations_on_datastructures::circular_linked_list::Node::Node(int64_t _data)'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95',1,'operations_on_datastructures::circular_linked_list::Node::Node(int64_t _data, Node *_next)'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3',1,'operations_on_datastructures::reverse_binary_tree::Node::Node()']]], + ['non_5frecursive_5fmerge_5fsort_33',['non_recursive_merge_sort',['../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)'],['../d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534',1,'sorting::non_recursive_merge_sort(const Iterator first, const size_t n)'],['../d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last)']]], + ['none_34',['none',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], + ['none_5fof_35',['none_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], + ['normal_5fdistribution_36',['normal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/normal_distribution.html',0,'std::normal_distribution']]], + ['noshowbase_37',['noshowbase',['http://en.cppreference.com/w/cpp/io/manip/showbase.html',0,'std']]], + ['noshowpoint_38',['noshowpoint',['http://en.cppreference.com/w/cpp/io/manip/showpoint.html',0,'std']]], + ['noshowpos_39',['noshowpos',['http://en.cppreference.com/w/cpp/io/manip/showpos.html',0,'std']]], + ['noskipws_40',['noskipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]], + ['not1_41',['not1',['http://en.cppreference.com/w/cpp/utility/functional/not1.html',0,'std']]], + ['not2_42',['not2',['http://en.cppreference.com/w/cpp/utility/functional/not2.html',0,'std']]], + ['not_5feof_43',['not_eof',['http://en.cppreference.com/w/cpp/string/char_traits/not_eof.html',0,'std::char_traits']]], + ['notify_5fall_44',['notify_all',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_all.html',0,'std::condition_variable_any::notify_all()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_all.html',0,'std::condition_variable::notify_all()']]], + ['notify_5fall_5fat_5fthread_5fexit_45',['notify_all_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/notify_all_at_thread_exit.html',0,'std']]], + ['notify_5fone_46',['notify_one',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_one.html',0,'std::condition_variable_any::notify_one()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_one.html',0,'std::condition_variable::notify_one()']]], + ['nounitbuf_47',['nounitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], + ['nouppercase_48',['nouppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], + ['now_49',['now',['http://en.cppreference.com/w/cpp/chrono/steady_clock/now.html',0,'std::chrono::steady_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/system_clock/now.html',0,'std::chrono::system_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html',0,'std::chrono::high_resolution_clock::now()']]], + ['nqueensol_50',['NQueenSol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f',1,'backtracking::n_queens_optimized::NQueenSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108',1,'backtracking::n_queens_all_solutions::NQueenSol()']]], + ['nth_5felement_51',['nth_element',['http://en.cppreference.com/w/cpp/algorithm/nth_element.html',0,'std']]], + ['num_5fdigits_52',['num_digits',['../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93',1,'large_number']]], + ['num_5fget_53',['num_get',['http://en.cppreference.com/w/cpp/locale/num_get/num_get.html',0,'std::num_get']]], + ['num_5fput_54',['num_put',['http://en.cppreference.com/w/cpp/locale/num_put/num_put.html',0,'std::num_put']]], + ['number_5fof_5fpositive_5fdivisors_55',['number_of_positive_divisors',['../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb',1,'number_of_positive_divisors.cpp']]], + ['number_5fof_5fsubsets_56',['number_of_subsets',['../d0/dfe/backtracking_2subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99',1,'backtracking::subset_sum']]], + ['number_5fof_5fvertices_57',['number_of_vertices',['../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904',1,'graph::Graph']]], + ['numberofchildren_58',['numberOfChildren',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0',1,'operations_on_datastructures::trie_operations::Tnode']]], + ['numberofciphersinfactorialn_59',['numberOfCiphersInFactorialN',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0',1,'bit_manipulation::count_of_trailing_ciphers_in_factorial_n']]], + ['numpunct_60',['numpunct',['http://en.cppreference.com/w/cpp/locale/numpunct/numpunct.html',0,'std::numpunct']]], + ['numpunct_5fbyname_61',['numpunct_byname',['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std::numpunct_byname']]] ]; diff --git a/search/functions_f.js b/search/functions_f.js index 3c3b355f8..718e77442 100644 --- a/search/functions_f.js +++ b/search/functions_f.js @@ -6,63 +6,63 @@ var searchData= ['ols_5ftest_3',['ols_test',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d',1,'ordinary_least_squares_regressor.cpp']]], ['on_5fsegment_4',['on_segment',['../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf',1,'SegmentIntersection']]], ['once_5fflag_5',['once_flag',['http://en.cppreference.com/w/cpp/thread/once_flag.html',0,'std::once_flag']]], - ['open_6',['open',['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::basic_filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::basic_fstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::wfilebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::wifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::basic_ifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::wfstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::wofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::ifstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::basic_ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::fstream::open()']]], + ['open_6',['open',['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::basic_ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::fstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::basic_filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::basic_fstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::wfilebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::wifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::basic_ifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::wfstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::wofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::ifstream::open()']]], ['opening_7',['opening',['../dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21',1,'paranthesis_matching.cpp']]], ['operator_20auto_5fptr_3c_20y_20_3e_8',['operator auto_ptr< Y >',['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator_auto_ptr.html',0,'std::auto_ptr']]], - ['operator_20bool_9',['operator bool',['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator_bool.html',0,'std::unique_lock::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ios::operator bool()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator_bool.html',0,'std::shared_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator_bool.html',0,'std::unique_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator_bool.html',0,'std::shared_lock::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_code/operator_bool.html',0,'std::error_code::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator_bool.html',0,'std::function::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator_bool.html',0,'std::error_condition::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wiostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator_bool.html',0,'std::experimental::optional::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wfstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wstringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::operator bool()'],['../db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e',1,'uint128_t::operator bool()'],['../d1/d83/classuint256__t.html#a28aa5786bbfce1b00398a8d38691bdaa',1,'uint256_t::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::strstream::operator bool()']]], - ['operator_20string_5ftype_10',['operator string_type',['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::operator string_type()']]], - ['operator_20t_11',['operator t',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_T.html',0,'std::atomic::operator T()'],['../d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363',1,'uint256_t::operator T()'],['../db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639',1,'uint128_t::operator T()']]], + ['operator_20bool_9',['operator bool',['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator_bool.html',0,'std::unique_lock::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ios::operator bool()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator_bool.html',0,'std::shared_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator_bool.html',0,'std::unique_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator_bool.html',0,'std::shared_lock::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_code/operator_bool.html',0,'std::error_code::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::strstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator_bool.html',0,'std::function::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator_bool.html',0,'std::error_condition::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wiostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator_bool.html',0,'std::experimental::optional::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wfstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wstringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::operator bool()'],['../db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e',1,'uint128_t::operator bool()'],['../d1/d83/classuint256__t.html#a28aa5786bbfce1b00398a8d38691bdaa',1,'uint256_t::operator bool()']]], + ['operator_20string_5ftype_10',['operator string_type',['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::operator string_type()']]], + ['operator_20t_11',['operator T',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_T.html',0,'std::atomic::operator T()'],['../db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639',1,'uint128_t::operator T()'],['../d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363',1,'uint256_t::operator T()']]], ['operator_20t_26_12',['operator T&',['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper']]], ['operator_20uint128_5ft_13',['operator uint128_t',['../d1/d83/classuint256__t.html#ad5bd38b2d3becca998457af1124d6e8b',1,'uint256_t']]], - ['operator_21_14',['operator!',['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ios::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::strstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wiostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wfstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wstringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ifstream::operator!()'],['../db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d',1,'uint128_t::operator!()'],['../d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c',1,'uint256_t::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostream::operator!()']]], - ['operator_21_3d_15',['operator!=',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator!=()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator!=()'],['../db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e',1,'uint128_t::operator!=(const uint128_t &other)'],['../db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696',1,'uint128_t::operator!=(const T other)'],['../d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547',1,'uint256_t::operator!=(const uint256_t &other)'],['../d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb',1,'uint256_t::operator!=(const T &other)'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator!=()']]], + ['operator_21_14',['operator!',['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ios::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::strstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wiostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wfstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wstringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ifstream::operator!()'],['../db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d',1,'uint128_t::operator!()'],['../d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c',1,'uint256_t::operator!()']]], + ['operator_21_3d_15',['operator!=',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator!=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator!=()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator!=()'],['../db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e',1,'uint128_t::operator!=(const uint128_t &other)'],['../db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696',1,'uint128_t::operator!=(const T other)'],['../d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547',1,'uint256_t::operator!=(const uint256_t &other)'],['../d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb',1,'uint256_t::operator!=(const T &other)'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator!=()']]], ['operator_25_16',['operator%',['../db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066',1,'uint128_t::operator%(const uint128_t &p)'],['../db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad',1,'uint128_t::operator%(const T &p)'],['../d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2',1,'uint256_t::operator%(const uint256_t &p)'],['../d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc',1,'uint256_t::operator%(const T &p)']]], - ['operator_25_3d_17',['operator%=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator%=()'],['../db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2',1,'uint128_t::operator%=(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40',1,'uint128_t::operator%=(const T &p)'],['../d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb',1,'uint256_t::operator%=(const uint256_t &p)'],['../d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d',1,'uint256_t::operator%=(const T &p)'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator%=()']]], - ['operator_26_18',['operator&',['../d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839',1,'uint256_t::operator&()'],['../db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244',1,'uint128_t::operator&(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4',1,'uint128_t::operator&(const T p)'],['../d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8',1,'uint256_t::operator&(const T &p)']]], - ['operator_26_26_19',['operator&&',['../d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963',1,'uint256_t::operator&&()'],['../db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a',1,'uint128_t::operator&&(const T b)'],['../db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1',1,'uint128_t::operator&&(const uint128_t &b)'],['../d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409',1,'uint256_t::operator&&(const T &b)']]], - ['operator_26_3d_20',['operator&=',['../d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d',1,'uint256_t::operator&=(const uint256_t &p)'],['../d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5',1,'uint256_t::operator&=(const T p)'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator&=()'],['../db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050',1,'uint128_t::operator&=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator&=()'],['../db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640',1,'uint128_t::operator&=()']]], - ['operator_28_29_21',['operator()',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux24_base::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/operator().html',0,'std::extreme_value_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/operator().html',0,'std::lognormal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937_64::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/operator().html',0,'std::discrete_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux48::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/operator().html',0,'std::piecewise_constant_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less_equal.html',0,'std::less_equal::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_or.html',0,'std::logical_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::discard_block_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/operator().html',0,'std::exponential_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mersenne_twister_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/negate.html',0,'std::negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std::not_equal_to::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/operator().html',0,'std::independent_bits_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/operator().html',0,'std::normal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand::operator()()'],['http://en.cppreference.com/w/cpp/locale/locale/operator().html',0,'std::locale::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/equal_to.html',0,'std::equal_to::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std::divides::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/operator().html',0,'std::weibull_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less.html',0,'std::less::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/multiplies.html',0,'std::multiplies::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator().html',0,'std::reference_wrapper::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux48_base::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_not.html',0,'std::bit_not::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/operator().html',0,'std::chi_squared_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/operator().html',0,'std::piecewise_linear_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/hash/operator().html',0,'std::hash::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::shuffle_order_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std::greater::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_and.html',0,'std::bit_and::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/operator().html',0,'std::uniform_int_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/operator().html',0,'std::fisher_f_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux24::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std::plus::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_or.html',0,'std::bit_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator().html',0,'std::function::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/minus.html',0,'std::minus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::linear_congruential_engine::operator()()'],['http://en.cppreference.com/w/cpp/memory/owner_less.html',0,'std::owner_less::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::knuth_b::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand0::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_not.html',0,'std::logical_not::operator()()'],['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/operator().html',0,'std::gamma_distribution::operator()()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator().html',0,'std::packaged_task::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/operator().html',0,'std::cauchy_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::subtract_with_carry_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/operator().html',0,'std::random_device::operator()()'],['../db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733',1,'uint128_t::operator()()'],['../d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b',1,'uint256_t::operator()()'],['../de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c',1,'Compare::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_and.html',0,'std::logical_and::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/modulus.html',0,'std::modulus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/operator().html',0,'std::student_t_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std::greater_equal::operator()()']]], - ['operator_2a_22',['operator*',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator*.html',0,'std::raw_storage_iterator::operator*()'],['../db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30',1,'uint128_t::operator*(const T p)'],['../db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860',1,'uint128_t::operator*(const uint128_t &p)'],['../d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616',1,'uint256_t::operator*(const T &p)'],['../d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967',1,'uint256_t::operator*(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Matrix< Number > &other) const'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Number other) const'],['../da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d',1,'Complex::operator*()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a42535e20e97d85aa61271e0894cc0359',1,'operator*(std::vector< T > const &A, float const scalar): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a207b3a99fd5974d3117e0b0ac0aad234',1,'operator*(float const scalar, std::vector< T > const &A): ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695',1,'machine_learning::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator*()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a865e8d26a01962cc93aca66e71346f37',1,'operator*(std::vector< std::vector< T > > const &A, std::vector< T > const &B): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713',1,'operator*(std::vector< std::vector< T > > const &A, std::vector< std::vector< T > > const &B): ordinary_least_squares_regressor.cpp'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator*()']]], - ['operator_2a_3d_23',['operator*=',['../db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295',1,'uint128_t::operator*=()'],['../d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028',1,'uint256_t::operator*=(const T &p)'],['../d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21',1,'uint256_t::operator*=(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*=()'],['../db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350',1,'large_number::operator*=()'],['../db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092',1,'uint128_t::operator*=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator*=()']]], - ['operator_2b_24',['operator+',['../db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606',1,'uint128_t::operator+()'],['../d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f',1,'uint256_t::operator+(const T &p)'],['../d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75',1,'uint256_t::operator+(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+()'],['../da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c',1,'Complex::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator+()'],['../db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d',1,'uint128_t::operator+()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f',1,'operator+(): ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2',1,'machine_learning::operator+()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator+()']]], - ['operator_2b_2b_25',['operator++',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator_arith.html',0,'std::raw_storage_iterator::operator++()'],['../db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e',1,'uint128_t::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++()'],['../d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9',1,'uint256_t::operator++()'],['../d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c',1,'uint256_t::operator++(int)'],['../db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a',1,'large_number::operator++()'],['../db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687',1,'large_number::operator++(int)'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++()'],['../db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6',1,'uint128_t::operator++()']]], - ['operator_2b_2b_28int_29_26',['operator++(int)',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++(int)()']]], - ['operator_2b_3d_27',['operator+=',['../d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1',1,'uint256_t::operator+=(const T &p)'],['../d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e',1,'uint256_t::operator+=(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+=()'],['../db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf',1,'large_number::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator+=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator+=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator+=()'],['../db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004',1,'uint128_t::operator+=(const T p)'],['../db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb',1,'uint128_t::operator+=(const uint128_t &p)']]], - ['operator_2d_28',['operator-',['../d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4',1,'uint256_t::operator-(const T &p)'],['../d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d',1,'uint256_t::operator-(const uint256_t &p)'],['../d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06',1,'uint256_t::operator-()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-()'],['../da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da',1,'Complex::operator-()'],['../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3',1,'machine_learning::operator-()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4a6a560dbdd0177633783b72db37dc19',1,'operator-(): ordinary_least_squares_regressor.cpp'],['../db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3',1,'uint128_t::operator-()'],['../db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c',1,'uint128_t::operator-(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec',1,'uint128_t::operator-(const T &p)'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator-()']]], - ['operator_2d_2d_29',['operator--',['../d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13',1,'uint256_t::operator--(int p)'],['../d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183',1,'uint256_t::operator--()'],['../db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414',1,'uint128_t::operator--(int p)'],['../db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed',1,'uint128_t::operator--()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator--(T... args)']]], + ['operator_25_3d_17',['operator%=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator%=()'],['../db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2',1,'uint128_t::operator%=(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40',1,'uint128_t::operator%=(const T &p)'],['../d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb',1,'uint256_t::operator%=(const uint256_t &p)'],['../d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d',1,'uint256_t::operator%=(const T &p)']]], + ['operator_26_18',['operator&',['../db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244',1,'uint128_t::operator&(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4',1,'uint128_t::operator&(const T p)'],['../d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8',1,'uint256_t::operator&(const T &p)'],['../d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839',1,'uint256_t::operator&(const uint256_t &p)']]], + ['operator_26_26_19',['operator&&',['../db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1',1,'uint128_t::operator&&(const uint128_t &b)'],['../db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a',1,'uint128_t::operator&&(const T b)'],['../d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963',1,'uint256_t::operator&&(const uint256_t &b)'],['../d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409',1,'uint256_t::operator&&(const T &b)']]], + ['operator_26_3d_20',['operator&=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator&=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator&=()'],['../db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050',1,'uint128_t::operator&=(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640',1,'uint128_t::operator&=(const T p)'],['../d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d',1,'uint256_t::operator&=(const uint256_t &p)'],['../d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5',1,'uint256_t::operator&=(const T p)']]], + ['operator_28_29_21',['operator()',['http://en.cppreference.com/w/cpp/utility/functional/logical_and.html',0,'std::logical_and::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/modulus.html',0,'std::modulus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/operator().html',0,'std::student_t_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937_64::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux24_base::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/operator().html',0,'std::extreme_value_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/operator().html',0,'std::lognormal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std::greater_equal::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/operator().html',0,'std::discrete_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux48::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/operator().html',0,'std::piecewise_constant_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less_equal.html',0,'std::less_equal::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_or.html',0,'std::logical_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::discard_block_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/operator().html',0,'std::exponential_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mersenne_twister_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/negate.html',0,'std::negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std::not_equal_to::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/operator().html',0,'std::independent_bits_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/operator().html',0,'std::normal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand::operator()()'],['http://en.cppreference.com/w/cpp/locale/locale/operator().html',0,'std::locale::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/equal_to.html',0,'std::equal_to::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std::divides::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/operator().html',0,'std::weibull_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less.html',0,'std::less::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/multiplies.html',0,'std::multiplies::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator().html',0,'std::reference_wrapper::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux48_base::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_not.html',0,'std::bit_not::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/operator().html',0,'std::chi_squared_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/operator().html',0,'std::piecewise_linear_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/hash/operator().html',0,'std::hash::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::shuffle_order_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std::greater::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_and.html',0,'std::bit_and::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/operator().html',0,'std::uniform_int_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/operator().html',0,'std::fisher_f_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux24::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std::plus::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_or.html',0,'std::bit_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator().html',0,'std::function::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/minus.html',0,'std::minus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::linear_congruential_engine::operator()()'],['http://en.cppreference.com/w/cpp/memory/owner_less.html',0,'std::owner_less::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::knuth_b::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand0::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_not.html',0,'std::logical_not::operator()()'],['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/operator().html',0,'std::gamma_distribution::operator()()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator().html',0,'std::packaged_task::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/operator().html',0,'std::cauchy_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::subtract_with_carry_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/operator().html',0,'std::random_device::operator()()'],['../db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733',1,'uint128_t::operator()()'],['../d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b',1,'uint256_t::operator()()'],['../de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c',1,'Compare::operator()()']]], + ['operator_2a_22',['operator*',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator*.html',0,'std::raw_storage_iterator::operator*()'],['../db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30',1,'uint128_t::operator*(const T p)'],['../db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860',1,'uint128_t::operator*(const uint128_t &p)'],['../d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616',1,'uint256_t::operator*(const T &p)'],['../d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967',1,'uint256_t::operator*(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Matrix< Number > &other) const'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Number other) const'],['../da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d',1,'Complex::operator*()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713',1,'operator*(std::vector< std::vector< T > > const &A, std::vector< std::vector< T > > const &B): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a865e8d26a01962cc93aca66e71346f37',1,'operator*(std::vector< std::vector< T > > const &A, std::vector< T > const &B): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a207b3a99fd5974d3117e0b0ac0aad234',1,'operator*(float const scalar, std::vector< T > const &A): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a42535e20e97d85aa61271e0894cc0359',1,'operator*(std::vector< T > const &A, float const scalar): ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695',1,'machine_learning::operator*()']]], + ['operator_2a_3d_23',['operator*=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator*=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator*=()'],['../db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092',1,'uint128_t::operator*=(const T p)'],['../db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295',1,'uint128_t::operator*=(const uint128_t &p)'],['../d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028',1,'uint256_t::operator*=(const T &p)'],['../d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21',1,'uint256_t::operator*=(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*=()'],['../db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350',1,'large_number::operator*=()']]], + ['operator_2b_24',['operator+',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator+()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator+()'],['../db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d',1,'uint128_t::operator+(const T p)'],['../db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606',1,'uint128_t::operator+(const uint128_t &p)'],['../d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f',1,'uint256_t::operator+(const T &p)'],['../d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75',1,'uint256_t::operator+(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+()'],['../da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c',1,'Complex::operator+()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f',1,'operator+(): ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2',1,'machine_learning::operator+()']]], + ['operator_2b_2b_25',['operator++',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator_arith.html',0,'std::raw_storage_iterator::operator++()'],['../db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e',1,'uint128_t::operator++()'],['../db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6',1,'uint128_t::operator++(int)'],['../d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9',1,'uint256_t::operator++()'],['../d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c',1,'uint256_t::operator++(int)'],['../db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a',1,'large_number::operator++()'],['../db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687',1,'large_number::operator++(int)']]], + ['operator_2b_2b_28int_29_26',['operator++(int)',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++(int)()']]], + ['operator_2b_3d_27',['operator+=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator+=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator+=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator+=()'],['../db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004',1,'uint128_t::operator+=(const T p)'],['../db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb',1,'uint128_t::operator+=(const uint128_t &p)'],['../d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1',1,'uint256_t::operator+=(const T &p)'],['../d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e',1,'uint256_t::operator+=(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+=()'],['../db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf',1,'large_number::operator+=()']]], + ['operator_2d_28',['operator-',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator-()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator-()'],['../db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec',1,'uint128_t::operator-(const T &p)'],['../db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c',1,'uint128_t::operator-(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3',1,'uint128_t::operator-()'],['../d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4',1,'uint256_t::operator-(const T &p)'],['../d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d',1,'uint256_t::operator-(const uint256_t &p)'],['../d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06',1,'uint256_t::operator-()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-()'],['../da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da',1,'Complex::operator-()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4a6a560dbdd0177633783b72db37dc19',1,'operator-(): ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3',1,'machine_learning::operator-()']]], + ['operator_2d_2d_29',['operator--',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator--()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator--()'],['../db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed',1,'uint128_t::operator--()'],['../db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414',1,'uint128_t::operator--(int p)'],['../d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183',1,'uint256_t::operator--()'],['../d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13',1,'uint256_t::operator--(int p)']]], ['operator_2d_2d_28int_29_30',['operator--(int)',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator--(int)()']]], - ['operator_2d_3d_31',['operator-=',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator-=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator-=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator-=()'],['../db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798',1,'uint128_t::operator-=(const T &p)'],['../db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8',1,'uint128_t::operator-=(const uint128_t &p)'],['../d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7',1,'uint256_t::operator-=(const T p)'],['../d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45',1,'uint256_t::operator-=(const uint256_t &p)'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator-=()']]], - ['operator_2d_3e_32',['operator->',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator->()']]], - ['operator_2f_33',['operator/',['../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5',1,'machine_learning::operator/()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7a2d742b9a3ae7b85292e1f86428bb4f',1,'operator/(): ordinary_least_squares_regressor.cpp'],['../db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee',1,'uint128_t::operator/(const uint128_t &p)'],['../db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94',1,'uint128_t::operator/(const T p)'],['../d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6',1,'uint256_t::operator/(const T &p)'],['../d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df',1,'uint256_t::operator/(const uint256_t &p)'],['../da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90',1,'Complex::operator/()']]], - ['operator_2f_3d_34',['operator/=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator/=()'],['../db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b',1,'uint128_t::operator/=()'],['../d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4',1,'uint256_t::operator/=(const uint256_t &p)'],['../d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259',1,'uint256_t::operator/=(const T &p)'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator/=()'],['../db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db',1,'uint128_t::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator/=()']]], - ['operator_3c_35',['operator<',['../db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4',1,'uint128_t::operator<()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator<()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator<()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator<()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba',1,'machine_learning::aystar_search::EightPuzzle::operator<()'],['../d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056',1,'uint256_t::operator<(const T &other)'],['../d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96',1,'uint256_t::operator<(const uint256_t &other)'],['../db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc',1,'uint128_t::operator<()']]], - ['operator_3c_3c_36',['operator<<',['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wiostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostrstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wfstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_iostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wstringstream::operator<<()'],['../db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190',1,'uint128_t::operator<<()'],['../d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5',1,'uint256_t::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::fstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_fstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::iostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::stringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::strstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_stringstream::operator<<()'],['../d2/d3b/namespaceqr__algorithm.html#a257425cb2365359da51c6fe6741834d8',1,'qr_algorithm::operator<<(std::ostream &out, std::valarray< T > const &v)'],['../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834',1,'qr_algorithm::operator<<(std::ostream &out, std::valarray< std::valarray< T > > const &v)'],['../dd/d65/lu__decompose_8cpp.html#a575c989afcc78e875031cd4273e62a3e',1,'operator<<(std::ostream &out, matrix< T > const &v): lu_decompose.cpp'],['../d5/d67/complex__numbers_8cpp.html#a44d5f25b573e870accdf26fd32b8484d',1,'operator<<(std::ostream &os, const Complex &num): complex_numbers.cpp'],['../d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269',1,'machine_learning::operator<<(std::ostream &out, const std::valarray< T > &A)'],['../d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35',1,'machine_learning::operator<<(std::ostream &out, const std::pair< T, T > &A)'],['../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7',1,'machine_learning::operator<<(std::ostream &out, std::vector< std::valarray< T > > const &A)'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ab1ad727903d7817c2758d25bcb52cbc8',1,'operator<<(std::ostream &out, std::vector< T > const &v): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4',1,'operator<<(std::ostream &out, std::vector< std::vector< T > > const &v): ordinary_least_squares_regressor.cpp'],['../d7/db9/hill__cipher_8cpp.html#a34bfcd756610834acac501f9eea1e2eb',1,'operator<<(std::ostream &out, matrix< T > const &v): hill_cipher.cpp'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_ltlt.html',0,'std::thread::id::operator<<()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator<<(T... args)']]], - ['operator_3c_3c_3d_37',['operator<<=',['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator<<=()'],['../db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a',1,'uint128_t::operator<<=()'],['../d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5',1,'uint256_t::operator<<=(const T &p)']]], - ['operator_3c_3d_38',['operator<=',['../d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88',1,'uint256_t::operator<=()'],['../db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c',1,'uint128_t::operator<=()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator<=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator<=()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator<=()'],['../d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2',1,'uint256_t::operator<=()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee',1,'machine_learning::aystar_search::EightPuzzle::operator<=()'],['../db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a',1,'uint128_t::operator<=()']]], - ['operator_3d_39',['operator=',['http://en.cppreference.com/w/cpp/container/stack/operator=.html',0,'std::stack::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_future/operator=.html',0,'std::shared_future::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::wstreambuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::stringstream::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/operator=.html',0,'std::unordered_multimap::operator=()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator=.html',0,'std::unique_ptr::operator=()'],['http://en.cppreference.com/w/cpp/container/forward_list/operator=.html',0,'std::forward_list::operator=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator=.html',0,'std::locale::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator=.html',0,'std::shared_lock::operator=()'],['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/operator=.html',0,'std::enable_shared_from_this::operator=()'],['http://en.cppreference.com/w/cpp/thread/future/operator=.html',0,'std::future::operator=()'],['http://en.cppreference.com/w/cpp/utility/pair/operator=.html',0,'std::pair::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wsregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/error/error_code/operator=.html',0,'std::error_code::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::wifstream::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator=.html',0,'std::reference_wrapper::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::minutes::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::seconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::duration::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::milliseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::hours::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::microseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::nanoseconds::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::basic_stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/container/deque/operator=.html',0,'std::deque::operator=()'],['http://en.cppreference.com/w/cpp/thread/promise/operator=.html',0,'std::promise::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::basic_streambuf::operator=()'],['http://en.cppreference.com/w/cpp/container/queue/operator=.html',0,'std::queue::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator=.html',0,'std::atomic::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::basic_stringstream::operator=()'],['http://en.cppreference.com/w/cpp/thread/thread/operator=.html',0,'std::thread::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::basic_string::operator=()'],['http://en.cppreference.com/w/cpp/container/priority_queue/operator=.html',0,'std::priority_queue::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::wostringstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::cregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::wstring::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/operator=.html',0,'std::unordered_multiset::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wsregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator=.html',0,'std::function::operator=()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator=.html',0,'std::error_condition::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::filebuf::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u16string::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u32string::operator=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator=.html',0,'std::complex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::ofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::basic_istringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::basic_ifstream::operator=()'],['http://en.cppreference.com/w/cpp/container/list/operator=.html',0,'std::list::operator=()'],['http://en.cppreference.com/w/cpp/container/map/operator=.html',0,'std::map::operator=()'],['http://en.cppreference.com/w/cpp/error/exception/operator=.html',0,'std::exception::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::streambuf::operator=()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator=.html',0,'std::experimental::optional::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wcregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::regex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::istringstream::operator=()'],['http://en.cppreference.com/w/cpp/error/nested_exception/operator=.html',0,'std::nested_exception::operator=()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator=.html',0,'std::auto_ptr::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::sregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator=.html',0,'std::packaged_task::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_set/operator=.html',0,'std::unordered_set::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::wfstream::operator=()'],['http://en.cppreference.com/w/cpp/container/multimap/operator=.html',0,'std::multimap::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/operator=.html',0,'std::atomic_flag::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::wofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::wstringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::wistringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::ifstream::operator=()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator=.html',0,'std::raw_storage_iterator::operator=()'],['../db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544',1,'uint128_t::operator=(const T &p)'],['../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74',1,'uint128_t::operator=(const std::string &p)'],['../db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5',1,'uint128_t::operator=(const uint128_t &p)=default'],['../db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a',1,'uint128_t::operator=(uint128_t &&p)=default'],['../d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc',1,'uint256_t::operator=(const uint256_t &p)=default'],['../d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c',1,'uint256_t::operator=(const T &p)'],['../d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2',1,'uint256_t::operator=(const std::string &p)'],['../d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638',1,'uint256_t::operator=(uint256_t &&p)=default'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab164909ee7eadc4ab186d850e716abdf',1,'data_structures::linked_list::list::operator=()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2',1,'machine_learning::aystar_search::EightPuzzle::operator=(const EightPuzzle &A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101',1,'machine_learning::aystar_search::EightPuzzle::operator=(EightPuzzle &&A) noexcept'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(const Info &A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(Info &&A) noexcept'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a',1,'machine_learning::k_nearest_neighbors::Knn::operator=(const Knn &model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563',1,'machine_learning::k_nearest_neighbors::Knn::operator=(Knn &&)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2',1,'machine_learning::neural_network::layers::DenseLayer::operator=(const DenseLayer &layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114',1,'machine_learning::neural_network::layers::DenseLayer::operator=(DenseLayer &&)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f',1,'machine_learning::neural_network::NeuralNetwork::operator=(const NeuralNetwork &model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2c49bfebf9b859d5ceb26035d3003601',1,'machine_learning::neural_network::NeuralNetwork::operator=(NeuralNetwork &&)=default'],['../da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac',1,'Complex::operator=()'],['../db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b',1,'large_number::operator=()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(const CircularLinkedList &other)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(CircularLinkedList &&other) noexcept'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::wfilebuf::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::cregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::wregex::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wcregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::basic_fstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc::operator=()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator=.html',0,'std::shared_ptr::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::sregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/utility/tuple/operator=.html',0,'std::tuple::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::wstringbuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::basic_filebuf::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::basic_regex::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_map/operator=.html',0,'std::unordered_map::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::regex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::basic_ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator=.html',0,'std::unique_lock::operator=()'],['http://en.cppreference.com/w/cpp/container/set/operator=.html',0,'std::set::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::string::operator=()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/operator=.html',0,'std::weak_ptr::operator=()'],['http://en.cppreference.com/w/cpp/container/multiset/operator=.html',0,'std::multiset::operator=()'],['http://en.cppreference.com/w/cpp/container/vector/operator=.html',0,'std::vector::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::regex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::fstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::basic_ofstream::operator=()']]], - ['operator_3d_3d_40',['operator==',['../db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896',1,'uint128_t::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator==()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator==()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator==()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator==()'],['../d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89',1,'operator==(): complex_numbers.cpp'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator==()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915',1,'machine_learning::aystar_search::EightPuzzle::operator==()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator==()'],['../d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484',1,'uint256_t::operator==(const T &other)'],['../d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261',1,'uint256_t::operator==(const uint256_t &other)'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator==()'],['../db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e',1,'uint128_t::operator==()'],['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446',1,'ciphers::elliptic_curve_key_exchange::Point::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator==()']]], - ['operator_3e_41',['operator>',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator>()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator>()'],['../db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440',1,'uint128_t::operator>()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator>()'],['../d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d',1,'uint256_t::operator>(const uint256_t &other)'],['../d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13',1,'uint256_t::operator>(const T &other)'],['../db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e',1,'uint128_t::operator>()']]], - ['operator_3e_3d_42',['operator>=',['../d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad',1,'uint256_t::operator>=()'],['../db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292',1,'uint128_t::operator>=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator>=()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator>=()'],['../d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad',1,'uint256_t::operator>=()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator>=()'],['../db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481',1,'uint128_t::operator>=()']]], - ['operator_3e_3e_43',['operator>>',['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::iostream::operator>>()'],['../d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51',1,'uint256_t::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::fstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_fstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistream::operator>>()'],['../db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848',1,'uint128_t::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::ifstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wstringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_iostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wfstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_ifstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wiostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istrstream::operator>>()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_stringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::strstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wifstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::stringstream::operator>>()']]], - ['operator_3e_3e_3d_44',['operator>>=',['../d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78',1,'uint256_t::operator>>=()'],['../db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9',1,'uint128_t::operator>>=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator>>=()']]], - ['operator_5b_5d_45',['operator[]',['http://en.cppreference.com/w/cpp/container/unordered_map/operator_at.html',0,'std::unordered_map::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::cmatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wsmatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::smatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wcmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/dynarray/operator_at.html',0,'std::dynarray::operator[]()'],['http://en.cppreference.com/w/cpp/container/vector/operator_at.html',0,'std::vector::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::match_results::operator[]()'],['http://en.cppreference.com/w/cpp/container/deque/operator_at.html',0,'std::deque::operator[]()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_at.html',0,'std::bitset::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::basic_string::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::wstring::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u16string::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u32string::operator[]()'],['http://en.cppreference.com/w/cpp/container/map/operator_at.html',0,'std::map::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::string::operator[]()'],['http://en.cppreference.com/w/cpp/container/array/operator_at.html',0,'std::array::operator[]()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37',1,'divide_and_conquer::strassens_multiplication::Matrix::operator[]()'],['../db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08',1,'large_number::operator[]()']]], + ['operator_2d_3d_31',['operator-=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator-=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator-=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator-=()'],['../db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798',1,'uint128_t::operator-=(const T &p)'],['../db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8',1,'uint128_t::operator-=(const uint128_t &p)'],['../d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7',1,'uint256_t::operator-=(const T p)'],['../d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45',1,'uint256_t::operator-=(const uint256_t &p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-=()']]], + ['operator_2d_3e_32',['operator->',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator->()']]], + ['operator_2f_33',['operator/',['../db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee',1,'uint128_t::operator/(const uint128_t &p)'],['../db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94',1,'uint128_t::operator/(const T p)'],['../d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6',1,'uint256_t::operator/(const T &p)'],['../d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df',1,'uint256_t::operator/(const uint256_t &p)'],['../da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90',1,'Complex::operator/()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7a2d742b9a3ae7b85292e1f86428bb4f',1,'operator/(): ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5',1,'machine_learning::operator/()']]], + ['operator_2f_3d_34',['operator/=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator/=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator/=()'],['../db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db',1,'uint128_t::operator/=(const uint128_t &p)'],['../db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b',1,'uint128_t::operator/=(const T p)'],['../d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4',1,'uint256_t::operator/=(const uint256_t &p)'],['../d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259',1,'uint256_t::operator/=(const T &p)']]], + ['operator_3c_35',['operator<',['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator<()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator<()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator<()'],['../db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4',1,'uint128_t::operator<(const uint128_t &other)'],['../db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc',1,'uint128_t::operator<(const T other)'],['../d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96',1,'uint256_t::operator<(const uint256_t &other)'],['../d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056',1,'uint256_t::operator<(const T &other)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba',1,'machine_learning::aystar_search::EightPuzzle::operator<()']]], + ['operator_3c_3c_36',['operator<<',['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::fstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_fstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::iostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::stringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::strstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_stringstream::operator<<()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator<<()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_ltlt.html',0,'std::thread::id::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wiostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostrstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wfstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_iostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wstringstream::operator<<()'],['../db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190',1,'uint128_t::operator<<()'],['../d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5',1,'uint256_t::operator<<()'],['../d7/db9/hill__cipher_8cpp.html#a34bfcd756610834acac501f9eea1e2eb',1,'operator<<(std::ostream &out, matrix< T > const &v): hill_cipher.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4',1,'operator<<(std::ostream &out, std::vector< std::vector< T > > const &v): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ab1ad727903d7817c2758d25bcb52cbc8',1,'operator<<(std::ostream &out, std::vector< T > const &v): ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7',1,'machine_learning::operator<<(std::ostream &out, std::vector< std::valarray< T > > const &A)'],['../d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35',1,'machine_learning::operator<<(std::ostream &out, const std::pair< T, T > &A)'],['../d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269',1,'machine_learning::operator<<(std::ostream &out, const std::valarray< T > &A)'],['../d5/d67/complex__numbers_8cpp.html#a44d5f25b573e870accdf26fd32b8484d',1,'operator<<(std::ostream &os, const Complex &num): complex_numbers.cpp'],['../dd/d65/lu__decompose_8cpp.html#a575c989afcc78e875031cd4273e62a3e',1,'operator<<(std::ostream &out, matrix< T > const &v): lu_decompose.cpp'],['../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834',1,'qr_algorithm::operator<<(std::ostream &out, std::valarray< std::valarray< T > > const &v)'],['../d2/d3b/namespaceqr__algorithm.html#a257425cb2365359da51c6fe6741834d8',1,'qr_algorithm::operator<<(std::ostream &out, std::valarray< T > const &v)']]], + ['operator_3c_3c_3d_37',['operator<<=',['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator<<=()'],['../db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a',1,'uint128_t::operator<<=()'],['../d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5',1,'uint256_t::operator<<=()']]], + ['operator_3c_3d_38',['operator<=',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator<=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator<=()'],['../db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a',1,'uint128_t::operator<=(const uint128_t &other)'],['../db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c',1,'uint128_t::operator<=(const T other)'],['../d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88',1,'uint256_t::operator<=(const uint256_t &other)'],['../d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2',1,'uint256_t::operator<=(const T &other)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee',1,'machine_learning::aystar_search::EightPuzzle::operator<=()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator<=()']]], + ['operator_3d_39',['operator=',['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::basic_ofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::fstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::regex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/container/vector/operator=.html',0,'std::vector::operator=()'],['http://en.cppreference.com/w/cpp/container/multiset/operator=.html',0,'std::multiset::operator=()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/operator=.html',0,'std::weak_ptr::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::string::operator=()'],['http://en.cppreference.com/w/cpp/container/set/operator=.html',0,'std::set::operator=()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator=.html',0,'std::unique_lock::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::basic_ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::regex::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_map/operator=.html',0,'std::unordered_map::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::basic_regex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::basic_filebuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::wstringbuf::operator=()'],['http://en.cppreference.com/w/cpp/utility/tuple/operator=.html',0,'std::tuple::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::sregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator=.html',0,'std::shared_ptr::operator=()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::basic_fstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wcregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::wregex::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::cregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::wfilebuf::operator=()'],['http://en.cppreference.com/w/cpp/container/stack/operator=.html',0,'std::stack::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_future/operator=.html',0,'std::shared_future::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::wstreambuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::stringstream::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/operator=.html',0,'std::unordered_multimap::operator=()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator=.html',0,'std::unique_ptr::operator=()'],['http://en.cppreference.com/w/cpp/container/forward_list/operator=.html',0,'std::forward_list::operator=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator=.html',0,'std::locale::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator=.html',0,'std::shared_lock::operator=()'],['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/operator=.html',0,'std::enable_shared_from_this::operator=()'],['http://en.cppreference.com/w/cpp/thread/future/operator=.html',0,'std::future::operator=()'],['http://en.cppreference.com/w/cpp/utility/pair/operator=.html',0,'std::pair::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wsregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/error/error_code/operator=.html',0,'std::error_code::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::wifstream::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator=.html',0,'std::reference_wrapper::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::minutes::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::seconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::duration::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::milliseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::hours::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::microseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::nanoseconds::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::basic_stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/container/deque/operator=.html',0,'std::deque::operator=()'],['http://en.cppreference.com/w/cpp/thread/promise/operator=.html',0,'std::promise::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::basic_streambuf::operator=()'],['http://en.cppreference.com/w/cpp/container/queue/operator=.html',0,'std::queue::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator=.html',0,'std::atomic::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::basic_stringstream::operator=()'],['http://en.cppreference.com/w/cpp/thread/thread/operator=.html',0,'std::thread::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::basic_string::operator=()'],['http://en.cppreference.com/w/cpp/container/priority_queue/operator=.html',0,'std::priority_queue::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::wostringstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::cregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::wstring::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/operator=.html',0,'std::unordered_multiset::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wsregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator=.html',0,'std::function::operator=()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator=.html',0,'std::error_condition::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::filebuf::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u16string::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u32string::operator=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator=.html',0,'std::complex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::ofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::basic_istringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::basic_ifstream::operator=()'],['http://en.cppreference.com/w/cpp/container/list/operator=.html',0,'std::list::operator=()'],['http://en.cppreference.com/w/cpp/container/map/operator=.html',0,'std::map::operator=()'],['http://en.cppreference.com/w/cpp/error/exception/operator=.html',0,'std::exception::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::streambuf::operator=()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator=.html',0,'std::experimental::optional::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wcregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::regex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::istringstream::operator=()'],['http://en.cppreference.com/w/cpp/error/nested_exception/operator=.html',0,'std::nested_exception::operator=()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator=.html',0,'std::auto_ptr::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::sregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator=.html',0,'std::packaged_task::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_set/operator=.html',0,'std::unordered_set::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::wfstream::operator=()'],['http://en.cppreference.com/w/cpp/container/multimap/operator=.html',0,'std::multimap::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/operator=.html',0,'std::atomic_flag::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::wofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::wstringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::wistringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::ifstream::operator=()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator=.html',0,'std::raw_storage_iterator::operator=()'],['../db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544',1,'uint128_t::operator=(const T &p)'],['../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74',1,'uint128_t::operator=(const std::string &p)'],['../db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5',1,'uint128_t::operator=(const uint128_t &p)=default'],['../db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a',1,'uint128_t::operator=(uint128_t &&p)=default'],['../d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc',1,'uint256_t::operator=(const uint256_t &p)=default'],['../d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c',1,'uint256_t::operator=(const T &p)'],['../d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2',1,'uint256_t::operator=(const std::string &p)'],['../d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638',1,'uint256_t::operator=(uint256_t &&p)=default'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab164909ee7eadc4ab186d850e716abdf',1,'data_structures::linked_list::list::operator=()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2',1,'machine_learning::aystar_search::EightPuzzle::operator=(const EightPuzzle &A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101',1,'machine_learning::aystar_search::EightPuzzle::operator=(EightPuzzle &&A) noexcept'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(const Info &A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(Info &&A) noexcept'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a',1,'machine_learning::k_nearest_neighbors::Knn::operator=(const Knn &model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563',1,'machine_learning::k_nearest_neighbors::Knn::operator=(Knn &&)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2',1,'machine_learning::neural_network::layers::DenseLayer::operator=(const DenseLayer &layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114',1,'machine_learning::neural_network::layers::DenseLayer::operator=(DenseLayer &&)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f',1,'machine_learning::neural_network::NeuralNetwork::operator=(const NeuralNetwork &model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2c49bfebf9b859d5ceb26035d3003601',1,'machine_learning::neural_network::NeuralNetwork::operator=(NeuralNetwork &&)=default'],['../da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac',1,'Complex::operator=()'],['../db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b',1,'large_number::operator=()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(const CircularLinkedList &other)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(CircularLinkedList &&other) noexcept']]], + ['operator_3d_3d_40',['operator==',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator==()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator==()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator==()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator==()'],['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446',1,'ciphers::elliptic_curve_key_exchange::Point::operator==()'],['../db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e',1,'uint128_t::operator==(const uint128_t &other)'],['../db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896',1,'uint128_t::operator==(const T other)'],['../d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261',1,'uint256_t::operator==(const uint256_t &other)'],['../d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484',1,'uint256_t::operator==(const T &other)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator==()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915',1,'machine_learning::aystar_search::EightPuzzle::operator==()'],['../d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89',1,'operator==(): complex_numbers.cpp']]], + ['operator_3e_41',['operator>',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator>()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator>()'],['../db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440',1,'uint128_t::operator>(const uint128_t &other)'],['../db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e',1,'uint128_t::operator>(const T other)'],['../d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d',1,'uint256_t::operator>(const uint256_t &other)'],['../d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13',1,'uint256_t::operator>(const T &other)'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator>()']]], + ['operator_3e_3d_42',['operator>=',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator>=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator>=()'],['../db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292',1,'uint128_t::operator>=(const uint128_t &other)'],['../db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481',1,'uint128_t::operator>=(const T other)'],['../d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad',1,'uint256_t::operator>=(const uint256_t &other)'],['../d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad',1,'uint256_t::operator>=(const T &other)'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator>=()']]], + ['operator_3e_3e_43',['operator>>',['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::fstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_fstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::iostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::stringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wifstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::strstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_stringstream::operator>>()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istrstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wiostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_ifstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wfstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_iostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wstringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::ifstream::operator>>()'],['../db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848',1,'uint128_t::operator>>()'],['../d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51',1,'uint256_t::operator>>()']]], + ['operator_3e_3e_3d_44',['operator>>=',['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator>>=()'],['../db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9',1,'uint128_t::operator>>=()'],['../d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78',1,'uint256_t::operator>>=()']]], + ['operator_5b_5d_45',['operator[]',['http://en.cppreference.com/w/cpp/container/dynarray/operator_at.html',0,'std::dynarray::operator[]()'],['http://en.cppreference.com/w/cpp/container/vector/operator_at.html',0,'std::vector::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::match_results::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::string::operator[]()'],['http://en.cppreference.com/w/cpp/container/unordered_map/operator_at.html',0,'std::unordered_map::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wsmatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::smatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wcmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/deque/operator_at.html',0,'std::deque::operator[]()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_at.html',0,'std::bitset::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::basic_string::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::wstring::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u16string::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u32string::operator[]()'],['http://en.cppreference.com/w/cpp/container/map/operator_at.html',0,'std::map::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::cmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/array/operator_at.html',0,'std::array::operator[]()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37',1,'divide_and_conquer::strassens_multiplication::Matrix::operator[]()'],['../db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08',1,'large_number::operator[]()']]], ['operator_5e_46',['operator^',['../db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37',1,'uint128_t::operator^(const T p)'],['../db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b',1,'uint128_t::operator^(const uint128_t &p)'],['../d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e',1,'uint256_t::operator^(const T &p)'],['../d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7',1,'uint256_t::operator^(const uint256_t &p)']]], - ['operator_5e_3d_47',['operator^=',['../d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3',1,'uint256_t::operator^=(const T &p)'],['../d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7',1,'uint256_t::operator^=(const uint256_t &p)'],['../db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67',1,'uint128_t::operator^=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator^=()'],['../db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a',1,'uint128_t::operator^=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator^=()']]], - ['operator_7c_48',['operator|',['../db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd',1,'uint128_t::operator|()'],['../d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf',1,'uint256_t::operator|(const T &p)'],['../d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2',1,'uint256_t::operator|(const uint256_t &p)'],['../db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304',1,'uint128_t::operator|()']]], - ['operator_7c_3d_49',['operator|=',['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator|=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator|=()'],['../db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee',1,'uint128_t::operator|=()'],['../d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b',1,'uint256_t::operator|=(const T &p)'],['../d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc',1,'uint256_t::operator|=(const uint256_t &p)'],['../db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d',1,'uint128_t::operator|=()']]], - ['operator_7c_7c_50',['operator||',['../d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7',1,'uint256_t::operator||(const T &b)'],['../d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7',1,'uint256_t::operator||(const uint256_t &b)'],['../db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503',1,'uint128_t::operator||(const T b)'],['../db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03',1,'uint128_t::operator||(const uint128_t &b)']]], - ['operator_7e_51',['operator~',['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator~()'],['../d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2',1,'uint256_t::operator~()'],['../da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d',1,'Complex::operator~()'],['../db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f',1,'uint128_t::operator~()']]], + ['operator_5e_3d_47',['operator^=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator^=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator^=()'],['../db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a',1,'uint128_t::operator^=(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67',1,'uint128_t::operator^=(const T &p)'],['../d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7',1,'uint256_t::operator^=(const uint256_t &p)'],['../d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3',1,'uint256_t::operator^=(const T &p)']]], + ['operator_7c_48',['operator|',['../db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304',1,'uint128_t::operator|(const T p)'],['../db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd',1,'uint128_t::operator|(const uint128_t &p)'],['../d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf',1,'uint256_t::operator|(const T &p)'],['../d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2',1,'uint256_t::operator|(const uint256_t &p)']]], + ['operator_7c_3d_49',['operator|=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator|=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator|=()'],['../db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d',1,'uint128_t::operator|=(const uint128_t &p)'],['../db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee',1,'uint128_t::operator|=(const T p)'],['../d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b',1,'uint256_t::operator|=(const T &p)'],['../d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc',1,'uint256_t::operator|=(const uint256_t &p)']]], + ['operator_7c_7c_50',['operator||',['../db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03',1,'uint128_t::operator||(const uint128_t &b)'],['../db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503',1,'uint128_t::operator||(const T b)'],['../d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7',1,'uint256_t::operator||(const uint256_t &b)'],['../d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7',1,'uint256_t::operator||(const T &b)']]], + ['operator_7e_51',['operator~',['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator~()'],['../db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f',1,'uint128_t::operator~()'],['../d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2',1,'uint256_t::operator~()'],['../da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d',1,'Complex::operator~()']]], ['optional_52',['optional',['http://en.cppreference.com/w/cpp/experimental/optional/optional.html',0,'std::experimental::optional']]], ['orientation_53',['orientation',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c',1,'geometry::jarvis::Convexhull']]], ['ostream_54',['ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::ostream']]], ['ostringstream_55',['ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::ostringstream']]], ['ostrstream_56',['ostrstream',['http://en.cppreference.com/w/cpp/io/ostrstream/ostrstream.html',0,'std::ostrstream']]], ['otherhashfxn_57',['otherHashFxn',['../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082',1,'double_hashing']]], - ['out_58',['out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::out()']]], + ['out_58',['out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::out()']]], ['out_5fof_5frange_59',['out_of_range',['http://en.cppreference.com/w/cpp/error/out_of_range.html',0,'std::out_of_range']]], ['outer_5fallocator_60',['outer_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/outer_allocator.html',0,'std::scoped_allocator_adaptor']]], - ['overflow_61',['overflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::strstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wfilebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_streambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::streambuf::overflow()']]], + ['overflow_61',['overflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wfilebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::strstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_streambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::streambuf::overflow()']]], ['overflow_5ferror_62',['overflow_error',['http://en.cppreference.com/w/cpp/error/overflow_error.html',0,'std::overflow_error']]], ['owner_5fbefore_63',['owner_before',['http://en.cppreference.com/w/cpp/memory/weak_ptr/owner_before.html',0,'std::weak_ptr::owner_before()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/owner_before.html',0,'std::shared_ptr::owner_before()']]], - ['owns_5flock_64',['owns_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock/owns_lock.html',0,'std::shared_lock::owns_lock()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/owns_lock.html',0,'std::unique_lock::owns_lock()']]] + ['owns_5flock_64',['owns_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/owns_lock.html',0,'std::unique_lock::owns_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/owns_lock.html',0,'std::shared_lock::owns_lock()']]] ]; diff --git a/search/search.js b/search/search.js index 6fd40c677..666af01e5 100644 --- a/search/search.js +++ b/search/search.js @@ -22,58 +22,9 @@ @licend The above is the entire license notice for the JavaScript code in this file */ -function convertToId(search) -{ - var result = ''; - for (i=0;i document.getElementById("MSearchField"); + this.DOMSearchSelect = () => document.getElementById("MSearchSelect"); + this.DOMSearchSelectWindow = () => document.getElementById("MSearchSelectWindow"); + this.DOMPopupSearchResults = () => document.getElementById("MSearchResults"); + this.DOMPopupSearchResultsWindow = () => document.getElementById("MSearchResultsWindow"); + this.DOMSearchClose = () => document.getElementById("MSearchClose"); + this.DOMSearchBox = () => document.getElementById("MSearchBox"); // ------------ Event Handlers // Called when focus is added or removed from the search field. - this.OnSearchFieldFocus = function(isActive) - { + this.OnSearchFieldFocus = function(isActive) { this.Activate(isActive); } - this.OnSearchSelectShow = function() - { - var searchSelectWindow = this.DOMSearchSelectWindow(); - var searchField = this.DOMSearchSelect(); + this.OnSearchSelectShow = function() { + const searchSelectWindow = this.DOMSearchSelectWindow(); + const searchField = this.DOMSearchSelect(); - var left = getXPos(searchField); - var top = getYPos(searchField); - top += searchField.offsetHeight; + const left = getXPos(searchField); + const top = getYPos(searchField) + searchField.offsetHeight; // show search selection popup searchSelectWindow.style.display='block'; @@ -146,55 +102,43 @@ function SearchBox(name, resultsPath, extension) searchSelectWindow.style.top = top + 'px'; // stop selection hide timer - if (this.hideTimeout) - { + if (this.hideTimeout) { clearTimeout(this.hideTimeout); this.hideTimeout=0; } return false; // to avoid "image drag" default event } - this.OnSearchSelectHide = function() - { + this.OnSearchSelectHide = function() { this.hideTimeout = setTimeout(this.CloseSelectionWindow.bind(this), this.closeSelectionTimeout); } // Called when the content of the search field is changed. - this.OnSearchFieldChange = function(evt) - { - if (this.keyTimeout) // kill running timer - { + this.OnSearchFieldChange = function(evt) { + if (this.keyTimeout) { // kill running timer clearTimeout(this.keyTimeout); this.keyTimeout = 0; } - var e = (evt) ? evt : window.event; // for IE - if (e.keyCode==40 || e.keyCode==13) - { - if (e.shiftKey==1) - { + const e = evt ? evt : window.event; // for IE + if (e.keyCode==40 || e.keyCode==13) { + if (e.shiftKey==1) { this.OnSearchSelectShow(); - var win=this.DOMSearchSelectWindow(); - for (i=0;i do a search - { + const searchValue = this.DOMSearchField().value.replace(/ +/g, ""); + if (searchValue!="" && this.searchActive) { // something was found -> do a search this.Search(); } } - this.OnSearchSelectKey = function(evt) - { - var e = (evt) ? evt : window.event; // for IE - if (e.keyCode==40 && this.searchIndex0) // Up - { + } else if (e.keyCode==38 && this.searchIndex>0) { // Up this.searchIndex--; this.OnSelectItem(this.searchIndex); - } - else if (e.keyCode==13 || e.keyCode==27) - { + } else if (e.keyCode==13 || e.keyCode==27) { e.stopPropagation(); this.OnSelectItem(this.searchIndex); this.CloseSelectionWindow(); @@ -301,82 +239,75 @@ function SearchBox(name, resultsPath, extension) // --------- Actions // Closes the results window. - this.CloseResultsWindow = function() - { + this.CloseResultsWindow = function() { this.DOMPopupSearchResultsWindow().style.display = 'none'; this.DOMSearchClose().style.display = 'none'; this.Activate(false); } - this.CloseSelectionWindow = function() - { + this.CloseSelectionWindow = function() { this.DOMSearchSelectWindow().style.display = 'none'; } // Performs a search. - this.Search = function() - { + this.Search = function() { this.keyTimeout = 0; // strip leading whitespace - var searchValue = this.DOMSearchField().value.replace(/^ +/, ""); + const searchValue = this.DOMSearchField().value.replace(/^ +/, ""); - var code = searchValue.toLowerCase().charCodeAt(0); - var idxChar = searchValue.substr(0, 1).toLowerCase(); - if ( 0xD800 <= code && code <= 0xDBFF && searchValue > 1) // surrogate pair - { + const code = searchValue.toLowerCase().charCodeAt(0); + let idxChar = searchValue.substr(0, 1).toLowerCase(); + if ( 0xD800 <= code && code <= 0xDBFF && searchValue > 1) { // surrogate pair idxChar = searchValue.substr(0, 2); } - var jsFile; - - var idx = indexSectionsWithContent[this.searchIndex].indexOf(idxChar); - if (idx!=-1) - { - var hexCode=idx.toString(16); - jsFile = this.resultsPath + indexSectionNames[this.searchIndex] + '_' + hexCode + '.js'; + let jsFile; + let idx = indexSectionsWithContent[this.searchIndex].indexOf(idxChar); + if (idx!=-1) { + const hexCode=idx.toString(16); + jsFile = this.resultsPath + indexSectionNames[this.searchIndex] + '_' + hexCode + '.js'; } - var loadJS = function(url, impl, loc){ - var scriptTag = document.createElement('script'); + const loadJS = function(url, impl, loc) { + const scriptTag = document.createElement('script'); scriptTag.src = url; scriptTag.onload = impl; scriptTag.onreadystatechange = impl; loc.appendChild(scriptTag); } - var domPopupSearchResultsWindow = this.DOMPopupSearchResultsWindow(); - var domSearchBox = this.DOMSearchBox(); - var domPopupSearchResults = this.DOMPopupSearchResults(); - var domSearchClose = this.DOMSearchClose(); - var resultsPath = this.resultsPath; + const domPopupSearchResultsWindow = this.DOMPopupSearchResultsWindow(); + const domSearchBox = this.DOMSearchBox(); + const domPopupSearchResults = this.DOMPopupSearchResults(); + const domSearchClose = this.DOMSearchClose(); + const resultsPath = this.resultsPath; - var handleResults = function() { + const handleResults = function() { document.getElementById("Loading").style.display="none"; if (typeof searchData !== 'undefined') { createResults(resultsPath); document.getElementById("NoMatches").style.display="none"; } - + if (idx!=-1) { searchResults.Search(searchValue); } else { // no file with search results => force empty search results searchResults.Search('===='); } - if (domPopupSearchResultsWindow.style.display!='block') - { + if (domPopupSearchResultsWindow.style.display!='block') { domSearchClose.style.display = 'inline-block'; - var left = getXPos(domSearchBox) + 150; - var top = getYPos(domSearchBox) + 20; + let left = getXPos(domSearchBox) + 150; + let top = getYPos(domSearchBox) + 20; domPopupSearchResultsWindow.style.display = 'block'; left -= domPopupSearchResults.offsetWidth; - var maxWidth = document.body.clientWidth; - var maxHeight = document.body.clientHeight; - var width = 300; + const maxWidth = document.body.clientWidth; + const maxHeight = document.body.clientHeight; + let width = 300; if (left<10) left=10; if (width+left+8>maxWidth) width=maxWidth-left-8; - var height = 400; + let height = 400; if (height+top+8>maxHeight) height=maxHeight-top-8; domPopupSearchResultsWindow.style.top = top + 'px'; domPopupSearchResultsWindow.style.left = left + 'px'; @@ -398,17 +329,13 @@ function SearchBox(name, resultsPath, extension) // Activates or deactivates the search panel, resetting things to // their default values if necessary. - this.Activate = function(isActive) - { + this.Activate = function(isActive) { if (isActive || // open it - this.DOMPopupSearchResultsWindow().style.display == 'block' - ) - { + this.DOMPopupSearchResultsWindow().style.display == 'block' + ) { this.DOMSearchBox().className = 'MSearchBoxActive'; this.searchActive = true; - } - else if (!isActive) // directly remove the panel - { + } else if (!isActive) { // directly remove the panel this.DOMSearchBox().className = 'MSearchBoxInactive'; this.searchActive = false; this.lastSearchValue = '' @@ -421,409 +348,333 @@ function SearchBox(name, resultsPath, extension) // ----------------------------------------------------------------------- // The class that handles everything on the search results page. -function SearchResults(name) -{ - // The number of matches from the last run of . - this.lastMatchCount = 0; - this.lastKey = 0; - this.repeatOn = false; +function SearchResults() { - // Toggles the visibility of the passed element ID. - this.FindChildElement = function(id) - { - var parentElement = document.getElementById(id); - var element = parentElement.firstChild; + function convertToId(search) { + let result = ''; + for (let i=0;i. + this.lastMatchCount = 0; + this.lastKey = 0; + this.repeatOn = false; + + // Toggles the visibility of the passed element ID. + this.FindChildElement = function(id) { + const parentElement = document.getElementById(id); + let element = parentElement.firstChild; + + while (element && element!=parentElement) { + if (element.nodeName.toLowerCase() == 'div' && element.className == 'SRChildren') { + return element; + } + + if (element.nodeName.toLowerCase() == 'div' && element.hasChildNodes()) { + element = element.firstChild; + } else if (element.nextSibling) { + element = element.nextSibling; + } else { + do { + element = element.parentNode; } + while (element && element!=parentElement && !element.nextSibling); - if (element.nodeName.toLowerCase() == 'div' && element.hasChildNodes()) - { - element = element.firstChild; - } - else if (element.nextSibling) - { - element = element.nextSibling; - } - else - { - do - { - element = element.parentNode; - } - while (element && element!=parentElement && !element.nextSibling); - - if (element && element!=parentElement) - { - element = element.nextSibling; - } + if (element && element!=parentElement) { + element = element.nextSibling; } } } + } - this.Toggle = function(id) - { - var element = this.FindChildElement(id); - if (element) - { - if (element.style.display == 'block') - { - element.style.display = 'none'; - } - else - { - element.style.display = 'block'; - } + this.Toggle = function(id) { + const element = this.FindChildElement(id); + if (element) { + if (element.style.display == 'block') { + element.style.display = 'none'; + } else { + element.style.display = 'block'; } } + } - // Searches for the passed string. If there is no parameter, - // it takes it from the URL query. - // - // Always returns true, since other documents may try to call it - // and that may or may not be possible. - this.Search = function(search) - { - if (!search) // get search word from URL - { - search = window.location.search; - search = search.substring(1); // Remove the leading '?' - search = unescape(search); + // Searches for the passed string. If there is no parameter, + // it takes it from the URL query. + // + // Always returns true, since other documents may try to call it + // and that may or may not be possible. + this.Search = function(search) { + if (!search) { // get search word from URL + search = window.location.search; + search = search.substring(1); // Remove the leading '?' + search = unescape(search); + } + + search = search.replace(/^ +/, ""); // strip leading spaces + search = search.replace(/ +$/, ""); // strip trailing spaces + search = search.toLowerCase(); + search = convertToId(search); + + const resultRows = document.getElementsByTagName("div"); + let matches = 0; + + let i = 0; + while (i < resultRows.length) { + const row = resultRows.item(i); + if (row.className == "SRResult") { + let rowMatchName = row.id.toLowerCase(); + rowMatchName = rowMatchName.replace(/^sr\d*_/, ''); // strip 'sr123_' + + if (search.length<=rowMatchName.length && + rowMatchName.substr(0, search.length)==search) { + row.style.display = 'block'; + matches++; + } else { + row.style.display = 'none'; + } } + i++; + } + document.getElementById("Searching").style.display='none'; + if (matches == 0) { // no results + document.getElementById("NoMatches").style.display='block'; + } else { // at least one result + document.getElementById("NoMatches").style.display='none'; + } + this.lastMatchCount = matches; + return true; + } - search = search.replace(/^ +/, ""); // strip leading spaces - search = search.replace(/ +$/, ""); // strip trailing spaces - search = search.toLowerCase(); - search = convertToId(search); + // return the first item with index index or higher that is visible + this.NavNext = function(index) { + let focusItem; + for (;;) { + const focusName = 'Item'+index; + focusItem = document.getElementById(focusName); + if (focusItem && focusItem.parentNode.parentNode.style.display=='block') { + break; + } else if (!focusItem) { // last element + break; + } + focusItem=null; + index++; + } + return focusItem; + } - var resultRows = document.getElementsByTagName("div"); - var matches = 0; + this.NavPrev = function(index) { + let focusItem; + for (;;) { + const focusName = 'Item'+index; + focusItem = document.getElementById(focusName); + if (focusItem && focusItem.parentNode.parentNode.style.display=='block') { + break; + } else if (!focusItem) { // last element + break; + } + focusItem=null; + index--; + } + return focusItem; + } - var i = 0; - while (i < resultRows.length) - { - var row = resultRows.item(i); - if (row.className == "SRResult") - { - var rowMatchName = row.id.toLowerCase(); - rowMatchName = rowMatchName.replace(/^sr\d*_/, ''); // strip 'sr123_' + this.ProcessKeys = function(e) { + if (e.type == "keydown") { + this.repeatOn = false; + this.lastKey = e.keyCode; + } else if (e.type == "keypress") { + if (!this.repeatOn) { + if (this.lastKey) this.repeatOn = true; + return false; // ignore first keypress after keydown + } + } else if (e.type == "keyup") { + this.lastKey = 0; + this.repeatOn = false; + } + return this.lastKey!=0; + } - if (search.length<=rowMatchName.length && - rowMatchName.substr(0, search.length)==search) - { - row.style.display = 'block'; - matches++; - } - else - { - row.style.display = 'none'; + this.Nav = function(evt,itemIndex) { + const e = (evt) ? evt : window.event; // for IE + if (e.keyCode==13) return true; + if (!this.ProcessKeys(e)) return false; + + if (this.lastKey==38) { // Up + const newIndex = itemIndex-1; + let focusItem = this.NavPrev(newIndex); + if (focusItem) { + let child = this.FindChildElement(focusItem.parentNode.parentNode.id); + if (child && child.style.display == 'block') { // children visible + let n=0; + let tmpElem; + for (;;) { // search for last child + tmpElem = document.getElementById('Item'+newIndex+'_c'+n); + if (tmpElem) { + focusItem = tmpElem; + } else { // found it! + break; + } + n++; } } - i++; } - document.getElementById("Searching").style.display='none'; - if (matches == 0) // no results - { - document.getElementById("NoMatches").style.display='block'; + if (focusItem) { + focusItem.focus(); + } else { // return focus to search field + document.getElementById("MSearchField").focus(); } - else // at least one result - { - document.getElementById("NoMatches").style.display='none'; + } else if (this.lastKey==40) { // Down + const newIndex = itemIndex+1; + let focusItem; + const item = document.getElementById('Item'+itemIndex); + const elem = this.FindChildElement(item.parentNode.parentNode.id); + if (elem && elem.style.display == 'block') { // children visible + focusItem = document.getElementById('Item'+itemIndex+'_c0'); } - this.lastMatchCount = matches; + if (!focusItem) focusItem = this.NavNext(newIndex); + if (focusItem) focusItem.focus(); + } else if (this.lastKey==39) { // Right + const item = document.getElementById('Item'+itemIndex); + const elem = this.FindChildElement(item.parentNode.parentNode.id); + if (elem) elem.style.display = 'block'; + } else if (this.lastKey==37) { // Left + const item = document.getElementById('Item'+itemIndex); + const elem = this.FindChildElement(item.parentNode.parentNode.id); + if (elem) elem.style.display = 'none'; + } else if (this.lastKey==27) { // Escape + e.stopPropagation(); + searchBox.CloseResultsWindow(); + document.getElementById("MSearchField").focus(); + } else if (this.lastKey==13) { // Enter return true; } + return false; + } - // return the first item with index index or higher that is visible - this.NavNext = function(index) - { - var focusItem; - while (1) - { - var focusName = 'Item'+index; - focusItem = document.getElementById(focusName); - if (focusItem && focusItem.parentNode.parentNode.style.display=='block') - { - break; - } - else if (!focusItem) // last element - { - break; - } - focusItem=null; - index++; + this.NavChild = function(evt,itemIndex,childIndex) { + const e = (evt) ? evt : window.event; // for IE + if (e.keyCode==13) return true; + if (!this.ProcessKeys(e)) return false; + + if (this.lastKey==38) { // Up + if (childIndex>0) { + const newIndex = childIndex-1; + document.getElementById('Item'+itemIndex+'_c'+newIndex).focus(); + } else { // already at first child, jump to parent + document.getElementById('Item'+itemIndex).focus(); } - return focusItem; - } - - this.NavPrev = function(index) - { - var focusItem; - while (1) - { - var focusName = 'Item'+index; - focusItem = document.getElementById(focusName); - if (focusItem && focusItem.parentNode.parentNode.style.display=='block') - { - break; - } - else if (!focusItem) // last element - { - break; - } - focusItem=null; - index--; - } - return focusItem; - } - - this.ProcessKeys = function(e) - { - if (e.type == "keydown") - { - this.repeatOn = false; - this.lastKey = e.keyCode; - } - else if (e.type == "keypress") - { - if (!this.repeatOn) - { - if (this.lastKey) this.repeatOn = true; - return false; // ignore first keypress after keydown - } - } - else if (e.type == "keyup") - { - this.lastKey = 0; - this.repeatOn = false; - } - return this.lastKey!=0; - } - - this.Nav = function(evt,itemIndex) - { - var e = (evt) ? evt : window.event; // for IE - if (e.keyCode==13) return true; - if (!this.ProcessKeys(e)) return false; - - if (this.lastKey==38) // Up - { - var newIndex = itemIndex-1; - var focusItem = this.NavPrev(newIndex); - if (focusItem) - { - var child = this.FindChildElement(focusItem.parentNode.parentNode.id); - if (child && child.style.display == 'block') // children visible - { - var n=0; - var tmpElem; - while (1) // search for last child - { - tmpElem = document.getElementById('Item'+newIndex+'_c'+n); - if (tmpElem) - { - focusItem = tmpElem; - } - else // found it! - { - break; - } - n++; - } - } - } - if (focusItem) - { - focusItem.focus(); - } - else // return focus to search field - { - document.getElementById("MSearchField").focus(); - } - } - else if (this.lastKey==40) // Down - { - var newIndex = itemIndex+1; - var focusItem; - var item = document.getElementById('Item'+itemIndex); - var elem = this.FindChildElement(item.parentNode.parentNode.id); - if (elem && elem.style.display == 'block') // children visible - { - focusItem = document.getElementById('Item'+itemIndex+'_c0'); - } - if (!focusItem) focusItem = this.NavNext(newIndex); - if (focusItem) focusItem.focus(); - } - else if (this.lastKey==39) // Right - { - var item = document.getElementById('Item'+itemIndex); - var elem = this.FindChildElement(item.parentNode.parentNode.id); - if (elem) elem.style.display = 'block'; - } - else if (this.lastKey==37) // Left - { - var item = document.getElementById('Item'+itemIndex); - var elem = this.FindChildElement(item.parentNode.parentNode.id); - if (elem) elem.style.display = 'none'; - } - else if (this.lastKey==27) // Escape - { - e.stopPropagation(); - searchBox.CloseResultsWindow(); - document.getElementById("MSearchField").focus(); - } - else if (this.lastKey==13) // Enter - { - return true; - } - return false; - } - - this.NavChild = function(evt,itemIndex,childIndex) - { - var e = (evt) ? evt : window.event; // for IE - if (e.keyCode==13) return true; - if (!this.ProcessKeys(e)) return false; - - if (this.lastKey==38) // Up - { - if (childIndex>0) - { - var newIndex = childIndex-1; - document.getElementById('Item'+itemIndex+'_c'+newIndex).focus(); - } - else // already at first child, jump to parent - { - document.getElementById('Item'+itemIndex).focus(); - } - } - else if (this.lastKey==40) // Down - { - var newIndex = childIndex+1; - var elem = document.getElementById('Item'+itemIndex+'_c'+newIndex); - if (!elem) // last child, jump to parent next parent - { - elem = this.NavNext(itemIndex+1); - } - if (elem) - { - elem.focus(); - } - } - else if (this.lastKey==27) // Escape - { - e.stopPropagation(); - searchBox.CloseResultsWindow(); - document.getElementById("MSearchField").focus(); - } - else if (this.lastKey==13) // Enter - { - return true; - } - return false; + } else if (this.lastKey==40) { // Down + const newIndex = childIndex+1; + let elem = document.getElementById('Item'+itemIndex+'_c'+newIndex); + if (!elem) { // last child, jump to parent next parent + elem = this.NavNext(itemIndex+1); + } + if (elem) { + elem.focus(); + } + } else if (this.lastKey==27) { // Escape + e.stopPropagation(); + searchBox.CloseResultsWindow(); + document.getElementById("MSearchField").focus(); + } else if (this.lastKey==13) { // Enter + return true; } + return false; + } } -function setKeyActions(elem,action) -{ - elem.setAttribute('onkeydown',action); - elem.setAttribute('onkeypress',action); - elem.setAttribute('onkeyup',action); -} +function createResults(resultsPath) { -function setClassAttr(elem,attr) -{ - elem.setAttribute('class',attr); - elem.setAttribute('className',attr); -} + function setKeyActions(elem,action) { + elem.setAttribute('onkeydown',action); + elem.setAttribute('onkeypress',action); + elem.setAttribute('onkeyup',action); + } -function createResults(resultsPath) -{ - var results = document.getElementById("SRResults"); + function setClassAttr(elem,attr) { + elem.setAttribute('class',attr); + elem.setAttribute('className',attr); + } + + const results = document.getElementById("SRResults"); results.innerHTML = ''; - for (var e=0; e { + const id = elem[0]; + const srResult = document.createElement('div'); srResult.setAttribute('id','SR_'+id); setClassAttr(srResult,'SRResult'); - var srEntry = document.createElement('div'); + const srEntry = document.createElement('div'); setClassAttr(srEntry,'SREntry'); - var srLink = document.createElement('a'); - srLink.setAttribute('id','Item'+e); - setKeyActions(srLink,'return searchResults.Nav(event,'+e+')'); + const srLink = document.createElement('a'); + srLink.setAttribute('id','Item'+index); + setKeyActions(srLink,'return searchResults.Nav(event,'+index+')'); setClassAttr(srLink,'SRSymbol'); - srLink.innerHTML = searchData[e][1][0]; + srLink.innerHTML = elem[1][0]; srEntry.appendChild(srLink); - if (searchData[e][1].length==2) // single result - { - srLink.setAttribute('href',resultsPath+searchData[e][1][1][0]); + if (elem[1].length==2) { // single result + srLink.setAttribute('href',resultsPath+elem[1][1][0]); srLink.setAttribute('onclick','searchBox.CloseResultsWindow()'); - if (searchData[e][1][1][1]) - { + if (elem[1][1][1]) { srLink.setAttribute('target','_parent'); - } - else - { + } else { srLink.setAttribute('target','_blank'); } - var srScope = document.createElement('span'); + const srScope = document.createElement('span'); setClassAttr(srScope,'SRScope'); - srScope.innerHTML = searchData[e][1][1][2]; + srScope.innerHTML = elem[1][1][2]; srEntry.appendChild(srScope); - } - else // multiple results - { + } else { // multiple results srLink.setAttribute('href','javascript:searchResults.Toggle("SR_'+id+'")'); - var srChildren = document.createElement('div'); + const srChildren = document.createElement('div'); setClassAttr(srChildren,'SRChildren'); - for (var c=0; cli>h1,.sm>li>h2,.sm>li>h3,.sm>li>h4,.sm>li>h5,.sm>li>h6{margin:0;padding:0}.sm ul{display:none}.sm li,.sm a{position:relative}.sm a{display:block}.sm a.disabled{cursor:not-allowed}.sm:after{content:"\00a0";display:block;height:0;font:0/0 serif;clear:both;visibility:hidden;overflow:hidden}.sm,.sm *,.sm *:before,.sm *:after{-moz-box-sizing:border-box;-webkit-box-sizing:border-box;box-sizing:border-box}.main-menu-btn{position:relative;display:inline-block;width:36px;height:36px;text-indent:36px;margin-left:8px;white-space:nowrap;overflow:hidden;cursor:pointer;-webkit-tap-highlight-color:rgba(0,0,0,0)}.main-menu-btn-icon,.main-menu-btn-icon:before,.main-menu-btn-icon:after{position:absolute;top:50%;left:2px;height:2px;width:24px;background:var(--nav-menu-button-color);-webkit-transition:all .25s;transition:all .25s}.main-menu-btn-icon:before{content:'';top:-7px;left:0}.main-menu-btn-icon:after{content:'';top:7px;left:0}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon{height:0}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon:before{top:0;-webkit-transform:rotate(-45deg);transform:rotate(-45deg)}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon:after{top:0;-webkit-transform:rotate(45deg);transform:rotate(45deg)}#main-menu-state{position:absolute;width:1px;height:1px;margin:-1px;border:0;padding:0;overflow:hidden;clip:rect(1px,1px,1px,1px)}#main-menu-state:not(:checked) ~ #main-menu{display:none}#main-menu-state:checked ~ #main-menu{display:block}@media(min-width:768px){.main-menu-btn{position:absolute;top:-99999px}#main-menu-state:not(:checked) ~ #main-menu{display:block}}.sm-dox{background-image:var(--nav-gradient-image)}.sm-dox a,.sm-dox a:focus,.sm-dox a:hover,.sm-dox a:active{padding:0 12px;padding-right:43px;font-family:var(--font-family-nav);font-size:13px;font-weight:bold;line-height:36px;text-decoration:none;text-shadow:var(--nav-text-normal-shadow);color:var(--nav-text-normal-color);outline:0}.sm-dox a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:var(--nav-text-hover-shadow)}.sm-dox a.current{color:#d23600}.sm-dox a.disabled{color:#bbb}.sm-dox a span.sub-arrow{position:absolute;top:50%;margin-top:-14px;left:auto;right:3px;width:28px;height:28px;overflow:hidden;font:bold 12px/28px monospace !important;text-align:center;text-shadow:none;background:var(--nav-menu-toggle-color);-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox a span.sub-arrow:before{display:block;content:'+'}.sm-dox a.highlighted span.sub-arrow:before{display:block;content:'-'}.sm-dox>li:first-child>a,.sm-dox>li:first-child>:not(ul) a{-moz-border-radius:5px 5px 0 0;-webkit-border-radius:5px;border-radius:5px 5px 0 0}.sm-dox>li:last-child>a,.sm-dox>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul{-moz-border-radius:0 0 5px 5px;-webkit-border-radius:0;border-radius:0 0 5px 5px}.sm-dox>li:last-child>a.highlighted,.sm-dox>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted{-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox ul{background:var(--nav-menu-background-color)}.sm-dox ul a,.sm-dox ul a:focus,.sm-dox ul a:hover,.sm-dox ul a:active{font-size:12px;border-left:8px solid transparent;line-height:36px;text-shadow:none;background-color:var(--nav-menu-background-color);background-image:none}.sm-dox ul a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:0 1px 1px black}.sm-dox ul ul a,.sm-dox ul ul a:hover,.sm-dox ul ul a:focus,.sm-dox ul ul a:active{border-left:16px solid transparent}.sm-dox ul ul ul a,.sm-dox ul ul ul a:hover,.sm-dox ul ul ul a:focus,.sm-dox ul ul ul a:active{border-left:24px solid transparent}.sm-dox ul ul ul ul a,.sm-dox ul ul ul ul a:hover,.sm-dox ul ul ul ul a:focus,.sm-dox ul ul ul ul a:active{border-left:32px solid transparent}.sm-dox ul ul ul ul ul a,.sm-dox ul ul ul ul ul a:hover,.sm-dox ul ul ul ul ul a:focus,.sm-dox ul ul ul ul ul a:active{border-left:40px solid transparent}@media(min-width:768px){.sm-dox ul{position:absolute;width:12em}.sm-dox li{float:left}.sm-dox.sm-rtl li{float:right}.sm-dox ul li,.sm-dox.sm-rtl ul li,.sm-dox.sm-vertical li{float:none}.sm-dox a{white-space:nowrap}.sm-dox ul a,.sm-dox.sm-vertical a{white-space:normal}.sm-dox .sm-nowrap>li>a,.sm-dox .sm-nowrap>li>:not(ul) a{white-space:nowrap}.sm-dox{padding:0 10px;background-image:var(--nav-gradient-image);line-height:36px}.sm-dox a span.sub-arrow{top:50%;margin-top:-2px;right:12px;width:0;height:0;border-width:4px;border-style:solid dashed dashed dashed;border-color:var(--nav-text-normal-color) transparent transparent transparent;background:transparent;-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox a,.sm-dox a:focus,.sm-dox a:active,.sm-dox a:hover,.sm-dox a.highlighted{padding:0 12px;background-image:var(--nav-separator-image);background-repeat:no-repeat;background-position:right;-moz-border-radius:0 !important;-webkit-border-radius:0;border-radius:0 !important}.sm-dox a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:var(--nav-text-hover-shadow)}.sm-dox a:hover span.sub-arrow{border-color:var(--nav-text-hover-color) transparent transparent transparent}.sm-dox a.has-submenu{padding-right:24px}.sm-dox li{border-top:0}.sm-dox>li>ul:before,.sm-dox>li>ul:after{content:'';position:absolute;top:-18px;left:30px;width:0;height:0;overflow:hidden;border-width:9px;border-style:dashed dashed solid dashed;border-color:transparent transparent #bbb transparent}.sm-dox>li>ul:after{top:-16px;left:31px;border-width:8px;border-color:transparent transparent var(--nav-menu-background-color) transparent}.sm-dox ul{border:1px solid #bbb;padding:5px 0;background:var(--nav-menu-background-color);-moz-border-radius:5px !important;-webkit-border-radius:5px;border-radius:5px !important;-moz-box-shadow:0 5px 9px rgba(0,0,0,0.2);-webkit-box-shadow:0 5px 9px rgba(0,0,0,0.2);box-shadow:0 5px 9px rgba(0,0,0,0.2)}.sm-dox ul a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-color:transparent transparent transparent var(--nav-menu-foreground-color);border-style:dashed dashed dashed solid}.sm-dox ul a,.sm-dox ul a:hover,.sm-dox ul a:focus,.sm-dox ul a:active,.sm-dox ul a.highlighted{color:var(--nav-menu-foreground-color);background-image:none;border:0 !important;color:var(--nav-menu-foreground-color);background-image:none}.sm-dox ul a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:var(--nav-text-hover-shadow)}.sm-dox ul a:hover span.sub-arrow{border-color:transparent transparent transparent var(--nav-text-hover-color)}.sm-dox span.scroll-up,.sm-dox span.scroll-down{position:absolute;display:none;visibility:hidden;overflow:hidden;background:var(--nav-menu-background-color);height:36px}.sm-dox span.scroll-up:hover,.sm-dox span.scroll-down:hover{background:#eee}.sm-dox span.scroll-up:hover span.scroll-up-arrow,.sm-dox span.scroll-up:hover span.scroll-down-arrow{border-color:transparent transparent #d23600 transparent}.sm-dox span.scroll-down:hover span.scroll-down-arrow{border-color:#d23600 transparent transparent transparent}.sm-dox span.scroll-up-arrow,.sm-dox span.scroll-down-arrow{position:absolute;top:0;left:50%;margin-left:-6px;width:0;height:0;overflow:hidden;border-width:6px;border-style:dashed dashed solid dashed;border-color:transparent transparent var(--nav-menu-foreground-color) transparent}.sm-dox span.scroll-down-arrow{top:8px;border-style:solid dashed dashed dashed;border-color:var(--nav-menu-foreground-color) transparent transparent transparent}.sm-dox.sm-rtl a.has-submenu{padding-right:12px;padding-left:24px}.sm-dox.sm-rtl a span.sub-arrow{right:auto;left:12px}.sm-dox.sm-rtl.sm-vertical a.has-submenu{padding:10px 20px}.sm-dox.sm-rtl.sm-vertical a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-rtl>li>ul:before{left:auto;right:30px}.sm-dox.sm-rtl>li>ul:after{left:auto;right:31px}.sm-dox.sm-rtl ul a.has-submenu{padding:10px 20px !important}.sm-dox.sm-rtl ul a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-vertical{padding:10px 0;-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox.sm-vertical a{padding:10px 20px}.sm-dox.sm-vertical a:hover,.sm-dox.sm-vertical a:focus,.sm-dox.sm-vertical a:active,.sm-dox.sm-vertical a.highlighted{background:#fff}.sm-dox.sm-vertical a.disabled{background-image:var(--nav-gradient-image)}.sm-dox.sm-vertical a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-style:dashed dashed dashed solid;border-color:transparent transparent transparent #555}.sm-dox.sm-vertical>li>ul:before,.sm-dox.sm-vertical>li>ul:after{display:none}.sm-dox.sm-vertical ul a{padding:10px 20px}.sm-dox.sm-vertical ul a:hover,.sm-dox.sm-vertical ul a:focus,.sm-dox.sm-vertical ul a:active,.sm-dox.sm-vertical ul a.highlighted{background:#eee}.sm-dox.sm-vertical ul a.disabled{background:var(--nav-menu-background-color)}} \ No newline at end of file +.sm{position:relative;z-index:9999}.sm,.sm ul,.sm li{display:block;list-style:none;margin:0;padding:0;line-height:normal;direction:ltr;text-align:left;-webkit-tap-highlight-color:rgba(0,0,0,0)}.sm-rtl,.sm-rtl ul,.sm-rtl li{direction:rtl;text-align:right}.sm>li>h1,.sm>li>h2,.sm>li>h3,.sm>li>h4,.sm>li>h5,.sm>li>h6{margin:0;padding:0}.sm ul{display:none}.sm li,.sm a{position:relative}.sm a{display:block}.sm a.disabled{cursor:not-allowed}.sm:after{content:"\00a0";display:block;height:0;font:0/0 serif;clear:both;visibility:hidden;overflow:hidden}.sm,.sm *,.sm *:before,.sm *:after{-moz-box-sizing:border-box;-webkit-box-sizing:border-box;box-sizing:border-box}.main-menu-btn{position:relative;display:inline-block;width:36px;height:36px;text-indent:36px;margin-left:8px;white-space:nowrap;overflow:hidden;cursor:pointer;-webkit-tap-highlight-color:rgba(0,0,0,0)}.main-menu-btn-icon,.main-menu-btn-icon:before,.main-menu-btn-icon:after{position:absolute;top:50%;left:2px;height:2px;width:24px;background:var(--nav-menu-button-color);-webkit-transition:all .25s;transition:all .25s}.main-menu-btn-icon:before{content:'';top:-7px;left:0}.main-menu-btn-icon:after{content:'';top:7px;left:0}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon{height:0}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon:before{top:0;-webkit-transform:rotate(-45deg);transform:rotate(-45deg)}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon:after{top:0;-webkit-transform:rotate(45deg);transform:rotate(45deg)}#main-menu-state{position:absolute;width:1px;height:1px;margin:-1px;border:0;padding:0;overflow:hidden;clip:rect(1px,1px,1px,1px)}#main-menu-state:not(:checked) ~ #main-menu{display:none}#main-menu-state:checked ~ #main-menu{display:block}@media(min-width:768px){.main-menu-btn{position:absolute;top:-99999px}#main-menu-state:not(:checked) ~ #main-menu{display:block}}.sm-dox{background-image:var(--nav-gradient-image)}.sm-dox a,.sm-dox a:focus,.sm-dox a:hover,.sm-dox a:active{padding:0 12px;padding-right:43px;font-family:var(--font-family-nav);font-size:13px;font-weight:bold;line-height:36px;text-decoration:none;text-shadow:var(--nav-text-normal-shadow);color:var(--nav-text-normal-color);outline:0}.sm-dox a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:var(--nav-text-hover-shadow)}.sm-dox a.current{color:#d23600}.sm-dox a.disabled{color:#bbb}.sm-dox a span.sub-arrow{position:absolute;top:50%;margin-top:-14px;left:auto;right:3px;width:28px;height:28px;overflow:hidden;font:bold 12px/28px monospace !important;text-align:center;text-shadow:none;background:var(--nav-menu-toggle-color);-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox a span.sub-arrow:before{display:block;content:'+'}.sm-dox a.highlighted span.sub-arrow:before{display:block;content:'-'}.sm-dox>li:first-child>a,.sm-dox>li:first-child>:not(ul) a{-moz-border-radius:5px 5px 0 0;-webkit-border-radius:5px;border-radius:5px 5px 0 0}.sm-dox>li:last-child>a,.sm-dox>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul{-moz-border-radius:0 0 5px 5px;-webkit-border-radius:0;border-radius:0 0 5px 5px}.sm-dox>li:last-child>a.highlighted,.sm-dox>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted{-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox ul{background:var(--nav-menu-background-color)}.sm-dox ul a,.sm-dox ul a:focus,.sm-dox ul a:hover,.sm-dox ul a:active{font-size:12px;border-left:8px solid transparent;line-height:36px;text-shadow:none;background-color:var(--nav-menu-background-color);background-image:none}.sm-dox ul a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:0 1px 1px black}.sm-dox ul ul a,.sm-dox ul ul a:hover,.sm-dox ul ul a:focus,.sm-dox ul ul a:active{border-left:16px solid transparent}.sm-dox ul ul ul a,.sm-dox ul ul ul a:hover,.sm-dox ul ul ul a:focus,.sm-dox ul ul ul a:active{border-left:24px solid transparent}.sm-dox ul ul ul ul a,.sm-dox ul ul ul ul a:hover,.sm-dox ul ul ul ul a:focus,.sm-dox ul ul ul ul a:active{border-left:32px solid transparent}.sm-dox ul ul ul ul ul a,.sm-dox ul ul ul ul ul a:hover,.sm-dox ul ul ul ul ul a:focus,.sm-dox ul ul ul ul ul a:active{border-left:40px solid transparent}@media(min-width:768px){.sm-dox ul{position:absolute;width:12em}.sm-dox li{float:left}.sm-dox.sm-rtl li{float:right}.sm-dox ul li,.sm-dox.sm-rtl ul li,.sm-dox.sm-vertical li{float:none}.sm-dox a{white-space:nowrap}.sm-dox ul a,.sm-dox.sm-vertical a{white-space:normal}.sm-dox .sm-nowrap>li>a,.sm-dox .sm-nowrap>li>:not(ul) a{white-space:nowrap}.sm-dox{padding:0 10px;background-image:var(--nav-gradient-image);line-height:36px}.sm-dox a span.sub-arrow{top:50%;margin-top:-2px;right:12px;width:0;height:0;border-width:4px;border-style:solid dashed dashed dashed;border-color:var(--nav-text-normal-color) transparent transparent transparent;background:transparent;-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox a,.sm-dox a:focus,.sm-dox a:active,.sm-dox a:hover,.sm-dox a.highlighted{padding:0 12px;background-image:var(--nav-separator-image);background-repeat:no-repeat;background-position:right;-moz-border-radius:0 !important;-webkit-border-radius:0;border-radius:0 !important}.sm-dox a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:var(--nav-text-hover-shadow)}.sm-dox a:hover span.sub-arrow{border-color:var(--nav-text-hover-color) transparent transparent transparent}.sm-dox a.has-submenu{padding-right:24px}.sm-dox li{border-top:0}.sm-dox>li>ul:before,.sm-dox>li>ul:after{content:'';position:absolute;top:-18px;left:30px;width:0;height:0;overflow:hidden;border-width:9px;border-style:dashed dashed solid dashed;border-color:transparent transparent #bbb transparent}.sm-dox>li>ul:after{top:-16px;left:31px;border-width:8px;border-color:transparent transparent var(--nav-menu-background-color) transparent}.sm-dox ul{border:1px solid #bbb;padding:5px 0;background:var(--nav-menu-background-color);-moz-border-radius:5px !important;-webkit-border-radius:5px;border-radius:5px !important;-moz-box-shadow:0 5px 9px rgba(0,0,0,0.2);-webkit-box-shadow:0 5px 9px rgba(0,0,0,0.2);box-shadow:0 5px 9px rgba(0,0,0,0.2)}.sm-dox ul a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-color:transparent transparent transparent var(--nav-menu-foreground-color);border-style:dashed dashed dashed solid}.sm-dox ul a,.sm-dox ul a:hover,.sm-dox ul a:focus,.sm-dox ul a:active,.sm-dox ul a.highlighted{color:var(--nav-menu-foreground-color);background-image:none;border:0 !important}.sm-dox ul a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:var(--nav-text-hover-shadow)}.sm-dox ul a:hover span.sub-arrow{border-color:transparent transparent transparent var(--nav-text-hover-color)}.sm-dox span.scroll-up,.sm-dox span.scroll-down{position:absolute;display:none;visibility:hidden;overflow:hidden;background:var(--nav-menu-background-color);height:36px}.sm-dox span.scroll-up:hover,.sm-dox span.scroll-down:hover{background:#eee}.sm-dox span.scroll-up:hover span.scroll-up-arrow,.sm-dox span.scroll-up:hover span.scroll-down-arrow{border-color:transparent transparent #d23600 transparent}.sm-dox span.scroll-down:hover span.scroll-down-arrow{border-color:#d23600 transparent transparent transparent}.sm-dox span.scroll-up-arrow,.sm-dox span.scroll-down-arrow{position:absolute;top:0;left:50%;margin-left:-6px;width:0;height:0;overflow:hidden;border-width:6px;border-style:dashed dashed solid dashed;border-color:transparent transparent var(--nav-menu-foreground-color) transparent}.sm-dox span.scroll-down-arrow{top:8px;border-style:solid dashed dashed dashed;border-color:var(--nav-menu-foreground-color) transparent transparent transparent}.sm-dox.sm-rtl a.has-submenu{padding-right:12px;padding-left:24px}.sm-dox.sm-rtl a span.sub-arrow{right:auto;left:12px}.sm-dox.sm-rtl.sm-vertical a.has-submenu{padding:10px 20px}.sm-dox.sm-rtl.sm-vertical a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-rtl>li>ul:before{left:auto;right:30px}.sm-dox.sm-rtl>li>ul:after{left:auto;right:31px}.sm-dox.sm-rtl ul a.has-submenu{padding:10px 20px !important}.sm-dox.sm-rtl ul a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-vertical{padding:10px 0;-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox.sm-vertical a{padding:10px 20px}.sm-dox.sm-vertical a:hover,.sm-dox.sm-vertical a:focus,.sm-dox.sm-vertical a:active,.sm-dox.sm-vertical a.highlighted{background:#fff}.sm-dox.sm-vertical a.disabled{background-image:var(--nav-gradient-image)}.sm-dox.sm-vertical a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-style:dashed dashed dashed solid;border-color:transparent transparent transparent #555}.sm-dox.sm-vertical>li>ul:before,.sm-dox.sm-vertical>li>ul:after{display:none}.sm-dox.sm-vertical ul a{padding:10px 20px}.sm-dox.sm-vertical ul a:hover,.sm-dox.sm-vertical ul a:focus,.sm-dox.sm-vertical ul a:active,.sm-dox.sm-vertical ul a.highlighted{background:#eee}.sm-dox.sm-vertical ul a.disabled{background:var(--nav-menu-background-color)}} \ No newline at end of file diff --git a/topics.html b/topics.html index ca4d1e8ba..eb47f17bf 100644 --- a/topics.html +++ b/topics.html @@ -3,16 +3,18 @@ - + Algorithms_in_C++: Topics + + @@ -41,7 +43,7 @@ MathJax.Hub.Config({
    - + @@ -71,7 +73,7 @@ $(function() {
    @@ -113,7 +115,7 @@ $(document).ready(function(){initNavTree('topics.html',''); initResizable(); });