diff --git a/annotated.html b/annotated.html index fd646fa5c..0f3b1dc2e 100644 --- a/annotated.html +++ b/annotated.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Class List @@ -42,10 +42,10 @@ - + @@ -114,15 +114,15 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();  CEntry  ▼NgeometryGeometry algorithms  ▼Njarvis - CConvexhull - CPoint + CPoint + CConvexhull  ▼NgraphGraph Algorithms  ▼Nis_graph_bipartite  CGraphClass for representing graph as an adjacency list  CGraph  CHKGraphRepresents Bipartite graph for Hopcroft Karp implementation - CLowestCommonAncestor - CRootedTree + CRootedTree + CLowestCommonAncestor  ▼Nlinear_probingAn implementation of hash table using linear probing algorithm  CEntry  ▼Nmachine_learningMachine learning algorithms @@ -131,7 +131,7 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();  CDenseLayer  CNeuralNetwork  Cadaline - ▼NmathFor std::vector + ▼NmathFor std::vector  ▼Nncr_modulo_p  CNCRModuloPClass which contains all methods required for calculating nCr mod p  ▼NothersOther algorithms @@ -141,9 +141,9 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();  CEntry  ▼Nrange_queriesAlgorithms and Data Structures that support range queries and updates  ▼Nheavy_light_decomposition - CHLDThe Heavy-Light Decomposition class + CTreeA Basic Tree, which supports binary lifting  CSGSegment Tree, to store heavy chains - CTreeA Basic Tree, which supports binary lifting + CHLDThe Heavy-Light Decomposition class  ▼NstatisticsStatistical algorithms  Cstats_computer1  Cstats_computer2 @@ -168,8 +168,8 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();  Cnode  CPoint  Cquery - CQueue - Cqueue + Cqueue + CQueue  CSegmentIntersection  CSolution  Cstack @@ -184,7 +184,7 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable(); diff --git a/annotated_dup.js b/annotated_dup.js index a738a185a..93735d306 100644 --- a/annotated_dup.js +++ b/annotated_dup.js @@ -1,17 +1,78 @@ var annotated_dup = [ - [ "ciphers", "d6/d4e/namespaceciphers.html", "d6/d4e/namespaceciphers" ], - [ "data_structures", "d5/d3c/namespacedata__structures.html", "d5/d3c/namespacedata__structures" ], - [ "double_hashing", "d0/d65/namespacedouble__hashing.html", "d0/d65/namespacedouble__hashing" ], - [ "geometry", "d5/d5f/namespacegeometry.html", "d5/d5f/namespacegeometry" ], - [ "graph", "df/dce/namespacegraph.html", "df/dce/namespacegraph" ], - [ "linear_probing", "d8/d89/namespacelinear__probing.html", "d8/d89/namespacelinear__probing" ], - [ "machine_learning", "d8/d77/namespacemachine__learning.html", "d8/d77/namespacemachine__learning" ], - [ "math", "dd/d47/namespacemath.html", "dd/d47/namespacemath" ], - [ "others", "d0/d6f/namespaceothers.html", "d0/d6f/namespaceothers" ], - [ "quadratic_probing", "d4/dd2/namespacequadratic__probing.html", "d4/dd2/namespacequadratic__probing" ], - [ "range_queries", "dd/d69/namespacerange__queries.html", "dd/d69/namespacerange__queries" ], - [ "statistics", "d2/dcf/namespacestatistics.html", "d2/dcf/namespacestatistics" ], + [ "ciphers", "d6/d4e/namespaceciphers.html", [ + [ "HillCipher", "d6/d26/classciphers_1_1_hill_cipher.html", "d6/d26/classciphers_1_1_hill_cipher" ] + ] ], + [ "data_structures", "d5/d3c/namespacedata__structures.html", [ + [ "linked_list", null, [ + [ "link", "de/d9d/classdata__structures_1_1linked__list_1_1link.html", "de/d9d/classdata__structures_1_1linked__list_1_1link" ], + [ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ] + ] ], + [ "queue_using_array", null, [ + [ "Queue_Array", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array" ] + ] ], + [ "tree_234", null, [ + [ "Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html", "dd/d40/classdata__structures_1_1tree__234_1_1_node" ], + [ "Tree234", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234" ] + ] ], + [ "Node", "d9/d49/structdata__structures_1_1_node.html", "d9/d49/structdata__structures_1_1_node" ], + [ "SkipList", "d4/d90/classdata__structures_1_1_skip_list.html", "d4/d90/classdata__structures_1_1_skip_list" ], + [ "trie", "d0/d3e/classdata__structures_1_1trie.html", "d0/d3e/classdata__structures_1_1trie" ] + ] ], + [ "double_hashing", "d0/d65/namespacedouble__hashing.html", [ + [ "Entry", "d9/dde/structdouble__hashing_1_1_entry.html", "d9/dde/structdouble__hashing_1_1_entry" ] + ] ], + [ "geometry", "d5/d5f/namespacegeometry.html", [ + [ "jarvis", null, [ + [ "Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", "d9/d5a/structgeometry_1_1jarvis_1_1_point" ], + [ "Convexhull", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull" ] + ] ] + ] ], + [ "graph", "df/dce/namespacegraph.html", [ + [ "is_graph_bipartite", null, [ + [ "Graph", "de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html", "de/d00/classgraph_1_1is__graph__bipartite_1_1_graph" ] + ] ], + [ "Graph", "dc/d61/classgraph_1_1_graph.html", "dc/d61/classgraph_1_1_graph" ], + [ "HKGraph", "d8/d69/classgraph_1_1_h_k_graph.html", "d8/d69/classgraph_1_1_h_k_graph" ], + [ "RootedTree", "d0/d58/classgraph_1_1_rooted_tree.html", "d0/d58/classgraph_1_1_rooted_tree" ], + [ "LowestCommonAncestor", "d9/d23/classgraph_1_1_lowest_common_ancestor.html", "d9/d23/classgraph_1_1_lowest_common_ancestor" ] + ] ], + [ "linear_probing", "d8/d89/namespacelinear__probing.html", [ + [ "Entry", "db/d19/structlinear__probing_1_1_entry.html", "db/d19/structlinear__probing_1_1_entry" ] + ] ], + [ "machine_learning", "d8/d77/namespacemachine__learning.html", [ + [ "neural_network", null, [ + [ "layers", null, [ + [ "DenseLayer", "dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html", "dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer" ] + ] ], + [ "NeuralNetwork", "d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html", "d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network" ] + ] ], + [ "adaline", "d6/d30/classmachine__learning_1_1adaline.html", "d6/d30/classmachine__learning_1_1adaline" ] + ] ], + [ "math", "dd/d47/namespacemath.html", [ + [ "ncr_modulo_p", null, [ + [ "NCRModuloP", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p" ] + ] ] + ] ], + [ "others", "d0/d6f/namespaceothers.html", [ + [ "postfix_expression", null, [ + [ "Stack", "d5/d8a/classothers_1_1postfix__expression_1_1_stack.html", "d5/d8a/classothers_1_1postfix__expression_1_1_stack" ] + ] ] + ] ], + [ "quadratic_probing", "d4/dd2/namespacequadratic__probing.html", [ + [ "Entry", "da/dd1/structquadratic__probing_1_1_entry.html", "da/dd1/structquadratic__probing_1_1_entry" ] + ] ], + [ "range_queries", "dd/d69/namespacerange__queries.html", [ + [ "heavy_light_decomposition", null, [ + [ "Tree", "d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html", "d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree" ], + [ "SG", "d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html", "d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g" ], + [ "HLD", "d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html", "d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d" ] + ] ] + ] ], + [ "statistics", "d2/dcf/namespacestatistics.html", [ + [ "stats_computer1", "d7/d7c/classstatistics_1_1stats__computer1.html", "d7/d7c/classstatistics_1_1stats__computer1" ], + [ "stats_computer2", "d8/dab/classstatistics_1_1stats__computer2.html", "d8/dab/classstatistics_1_1stats__computer2" ] + ] ], [ "Btree", "d9/d90/struct_btree.html", "d9/d90/struct_btree" ], [ "cll", "d5/d15/classcll.html", "d5/d15/classcll" ], [ "compare", "d1/db3/structcompare.html", "d1/db3/structcompare" ], @@ -33,8 +94,8 @@ var annotated_dup = [ "node", "d5/da1/structnode.html", "d5/da1/structnode" ], [ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ], [ "query", "dd/d1b/structquery.html", "dd/d1b/structquery" ], - [ "Queue", "dc/db5/struct_queue.html", "dc/db5/struct_queue" ], [ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ], + [ "Queue", "dc/db5/struct_queue.html", "dc/db5/struct_queue" ], [ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ], [ "Solution", "dd/d4f/class_solution.html", "dd/d4f/class_solution" ], [ "stack", "d1/dc2/classstack.html", "d1/dc2/classstack" ], diff --git a/classes.html b/classes.html index b25e005dc..c8453c124 100644 --- a/classes.html +++ b/classes.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Class Index @@ -42,10 +42,10 @@ - + @@ -94,130 +94,66 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
Class Index
-
a | b | c | d | e | f | g | h | i | l | m | n | p | q | r | s | t
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
  a  
-		Entry (linear_probing)   
  l  
-		Node (data_structures::tree_234)   SkipList (data_structures)   
Entry (quadratic_probing)   Node (data_structures)   Solution   
adaline (machine_learning)   Entry (double_hashing)   large_number   
  p  
-		stack   
  b  
-
  f  
-		link (data_structures::linked_list)   Stack (others::postfix_expression)   
linkedlist   Point (geometry::jarvis)   stack_linkedList   
Btree   FenwickTree   list (data_structures::linked_list)   Point   stats_computer1 (statistics)   
  c  
-
  g  
-		list   
  q  
-		stats_computer2 (statistics)   
LowestCommonAncestor (graph)   
  t  
-
cll   Graph   
  m  
-		query   
compare   Graph (graph)   Queue   tower   
Complex   Graph (graph::is_graph_bipartite)   MinHeap   queue   Tree (range_queries::heavy_light_decomposition)   
Convexhull (geometry::jarvis)   
  h  
-		MinHeapNode   Queue_Array (data_structures::queue_using_array)   Tree234 (data_structures::tree_234)   
CycleCheck   mst   
  r  
-		trie (data_structures)   
  d  
-		hash_chain   
  n  
-		Trie   
HillCipher (ciphers)   RootedTree (graph)   Trie::TrieNode   
DenseLayer (machine_learning::neural_network::layers)   HKGraph (graph)   NCRModuloP (math::ncr_modulo_p)   
  s  
-
double_linked_list   HLD (range_queries::heavy_light_decomposition)   NeuralNetwork (machine_learning::neural_network)   
  e  
-
  i  
-		Node   SegmentIntersection   
node   SG (range_queries::heavy_light_decomposition)   
Edge   Item   
-
a | b | c | d | e | f | g | h | i | l | m | n | p | q | r | s | t
+
A | B | C | D | E | F | G | H | I | L | M | N | P | Q | R | S | T
+
+
+
A
+
adaline (machine_learning)
+
+
B
+
Btree
+
+
C
+
cll
compare
Complex
Convexhull (geometry::jarvis)
CycleCheck
+
+
D
+
DenseLayer (machine_learning::neural_network::layers)
double_linked_list
+
+
E
+
Edge
Entry (double_hashing)
Entry (linear_probing)
Entry (quadratic_probing)
+
+
F
+
FenwickTree
+
+
G
+
Graph
Graph (graph)
Graph (graph::is_graph_bipartite)
+
+
H
+
hash_chain
HillCipher (ciphers)
HKGraph (graph)
HLD (range_queries::heavy_light_decomposition)
+
+
I
+
Item
+
+
L
+
large_number
link (data_structures::linked_list)
linkedlist
list (data_structures::linked_list)
list
LowestCommonAncestor (graph)
+
+
M
+
MinHeap
MinHeapNode
mst
+
+
N
+
NCRModuloP (math::ncr_modulo_p)
NeuralNetwork (machine_learning::neural_network)
Node (data_structures)
Node (data_structures::tree_234)
Node
node
+
+
P
+
Point (geometry::jarvis)
Point
+
+
Q
+
query
queue
Queue
Queue_Array (data_structures::queue_using_array)
+
+
R
+
RootedTree (graph)
+
+
S
+
SegmentIntersection
SG (range_queries::heavy_light_decomposition)
SkipList (data_structures)
Solution
Stack (others::postfix_expression)
stack
stack_linkedList
stats_computer1 (statistics)
stats_computer2 (statistics)
+
+
T
+
tower
Tree (range_queries::heavy_light_decomposition)
Tree234 (data_structures::tree_234)
trie (data_structures)
Trie
Trie::TrieNode
+
diff --git a/d0/d01/smallest__circle_8cpp.html b/d0/d01/smallest__circle_8cpp.html index 55353ec97..26256ab55 100644 --- a/d0/d01/smallest__circle_8cpp.html +++ b/d0/d01/smallest__circle_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: others/smallest_circle.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -226,6 +226,14 @@ The function returns the radius of the circle and prints the coordinated of the
149  std::cout << minC.x << " " << minC.y << std::endl;
150  return minR;
151 }
+
std::cout
+
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
+
Point
Definition: line_segment_intersection.cpp:12
+
Point::y
int y
Point respect to x coordinate.
Definition: line_segment_intersection.cpp:14
Here is the call graph for this function:
@@ -276,6 +284,7 @@ Here is the call graph for this function:
39  double dy = B.y - A.y;
40  return std::sqrt((dx * dx) + (dy * dy));
41 }
+
std::sqrt
T sqrt(T... args)
Here is the call graph for this function:
@@ -309,6 +318,9 @@ Here is the call graph for this function:
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
Here is the call graph for this function:
@@ -403,6 +415,9 @@ Here is the call graph for this function:
164  Pv.push_back(Point(3, -2));
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
+
std::vector
Here is the call graph for this function:
@@ -543,26 +558,11 @@ Here is the call graph for this function:
-
test3
void test3()
Definition: smallest_circle.cpp:188
-
test2
void test2()
Definition: smallest_circle.cpp:173
-
std::vector
STL class.
-
std::vector::size
T size(T... args)
-
std::sqrt
T sqrt(T... args)
-
std::vector::push_back
T push_back(T... args)
-
Point::y
int y
Point respect to x coordinate.
Definition: line_segment_intersection.cpp:14
-
std::cout
-
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
-
circle
double circle(const std::vector< Point > &P)
Definition: smallest_circle.cpp:87
-
std::endl
T endl(T... args)
-
test
void test()
Definition: smallest_circle.cpp:158
-
Point
Definition: line_segment_intersection.cpp:12
-
PointInCircle
bool PointInCircle(const std::vector< Point > &P, const Point &Center, double R)
Definition: smallest_circle.cpp:72
diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg index baaa2ed0e..d18da45a2 100644 --- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg +++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg @@ -82,7 +82,7 @@ var sectionId = 'dynsection-6'; Node3 - + std::endl @@ -97,7 +97,7 @@ var sectionId = 'dynsection-6'; Node9 - + std::vector::push_back @@ -148,7 +148,7 @@ var sectionId = 'dynsection-6'; Node7 - + std::vector::size @@ -178,7 +178,7 @@ var sectionId = 'dynsection-6'; Node5 - + std::sqrt diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg index 5fbcb0e5f..96b3cfe62 100644 --- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg +++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg @@ -36,7 +36,7 @@ Node3 - + std::endl @@ -51,7 +51,7 @@ Node9 - + std::vector::push_back @@ -102,7 +102,7 @@ Node7 - + std::vector::size @@ -132,7 +132,7 @@ Node5 - + std::sqrt diff --git a/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.svg b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.svg index f70e8d50b..f1bcb0e2c 100644 --- a/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.svg +++ b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -66,7 +66,7 @@ Node6 - + std::vector::size @@ -96,7 +96,7 @@ Node4 - + std::sqrt diff --git a/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg index 2fe42613e..34a515431 100644 --- a/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg +++ b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::sqrt diff --git a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg index 9449853eb..f6a3ebd65 100644 --- a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg +++ b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg @@ -82,7 +82,7 @@ var sectionId = 'dynsection-7'; Node3 - + std::endl @@ -97,7 +97,7 @@ var sectionId = 'dynsection-7'; Node9 - + std::vector::push_back @@ -148,7 +148,7 @@ var sectionId = 'dynsection-7'; Node7 - + std::vector::size @@ -178,7 +178,7 @@ var sectionId = 'dynsection-7'; Node5 - + std::sqrt diff --git a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg index 4330898aa..2e291e966 100644 --- a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg +++ b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg @@ -36,7 +36,7 @@ Node3 - + std::endl @@ -51,7 +51,7 @@ Node9 - + std::vector::push_back @@ -102,7 +102,7 @@ Node7 - + std::vector::size @@ -132,7 +132,7 @@ Node5 - + std::sqrt diff --git a/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.svg b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.svg index 24fc5e41d..508f737d9 100644 --- a/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.svg +++ b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::sqrt diff --git a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg index 564b205c2..81f74b6bd 100644 --- a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg +++ b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg @@ -82,7 +82,7 @@ var sectionId = 'dynsection-5'; Node3 - + std::endl @@ -97,7 +97,7 @@ var sectionId = 'dynsection-5'; Node9 - + std::vector::push_back @@ -148,7 +148,7 @@ var sectionId = 'dynsection-5'; Node7 - + std::vector::size @@ -178,7 +178,7 @@ var sectionId = 'dynsection-5'; Node5 - + std::sqrt diff --git a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg index e22d1aee6..911e05bb5 100644 --- a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg +++ b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg @@ -36,7 +36,7 @@ Node3 - + std::endl @@ -51,7 +51,7 @@ Node9 - + std::vector::push_back @@ -102,7 +102,7 @@ Node7 - + std::vector::size @@ -132,7 +132,7 @@ Node5 - + std::sqrt diff --git a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index ab5bac2a9..c22c16481 100644 --- a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -67,7 +67,7 @@ var sectionId = 'dynsection-3'; Node2 - + std::endl @@ -148,7 +148,7 @@ var sectionId = 'dynsection-3'; Node10 - + std::vector::push_back @@ -199,7 +199,7 @@ var sectionId = 'dynsection-3'; Node8 - + std::vector::size @@ -229,7 +229,7 @@ var sectionId = 'dynsection-3'; Node6 - + std::sqrt diff --git a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 8c0cad2be..b0e1de63d 100644 --- a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -102,7 +102,7 @@ Node10 - + std::vector::push_back @@ -153,7 +153,7 @@ Node8 - + std::vector::size @@ -183,7 +183,7 @@ Node6 - + std::sqrt diff --git a/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.svg b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.svg index 096167b63..1058580fc 100644 --- a/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.svg +++ b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.svg @@ -36,7 +36,7 @@ Node4 - + std::vector::size @@ -51,7 +51,7 @@ Node3 - + std::sqrt diff --git a/d0/d08/realtime__stats_8cpp.html b/d0/d08/realtime__stats_8cpp.html index e13f9121f..0ff97d465 100644 --- a/d0/d08/realtime__stats_8cpp.html +++ b/d0/d08/realtime__stats_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/realtime_stats.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -197,6 +197,20 @@ Functions
191 
192  return 0;
193 }
+ + +
statistics::stats_computer1
Definition: realtime_stats.cpp:27
+
statistics::stats_computer1::variance
double variance() const
Definition: realtime_stats.cpp:45
+
statistics::stats_computer1::mean
double mean() const
Definition: realtime_stats.cpp:42
+
statistics::stats_computer1::new_val
void new_val(T x)
Definition: realtime_stats.cpp:32
+
statistics::stats_computer1::std
double std() const
Definition: realtime_stats.cpp:48
+
statistics::stats_computer2
Definition: realtime_stats.cpp:72
+
statistics::stats_computer2::mean
double mean() const
Definition: realtime_stats.cpp:86
+
statistics::stats_computer2::std
double std() const
Definition: realtime_stats.cpp:92
+
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
Here is the call graph for this function:
@@ -286,25 +300,11 @@ Here is the call graph for this function:
-
statistics::stats_computer1::std
double std() const
Definition: realtime_stats.cpp:48
- -
statistics::stats_computer2::variance
double variance() const
Definition: realtime_stats.cpp:89
-
statistics::stats_computer1::mean
double mean() const
Definition: realtime_stats.cpp:42
-
statistics::stats_computer2
Definition: realtime_stats.cpp:72
-
test_function
void test_function(const float *test_data, const int number_of_samples)
Definition: realtime_stats.cpp:118
-
std::endl
T endl(T... args)
-
statistics::stats_computer1::new_val
void new_val(T x)
Definition: realtime_stats.cpp:32
-
statistics::stats_computer2::new_val
void new_val(T x)
Definition: realtime_stats.cpp:77
-
statistics::stats_computer1::variance
double variance() const
Definition: realtime_stats.cpp:45
-
statistics::stats_computer1
Definition: realtime_stats.cpp:27
-
statistics::stats_computer2::std
double std() const
Definition: realtime_stats.cpp:92
- -
statistics::stats_computer2::mean
double mean() const
Definition: realtime_stats.cpp:86
diff --git a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg index 372697a78..2a9bb9bad 100644 --- a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg +++ b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg @@ -67,7 +67,7 @@ var sectionId = 'dynsection-1'; Node2 - + std::endl @@ -223,7 +223,7 @@ var sectionId = 'dynsection-1'; Node8 - + std::sqrt diff --git a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg index 31e9b3cda..4b7933a37 100644 --- a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg +++ b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -177,7 +177,7 @@ Node8 - + std::sqrt diff --git a/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.svg b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.svg index f79aa4318..04b98c7c3 100644 --- a/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.svg +++ b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -162,7 +162,7 @@ Node8 - + std::sqrt diff --git a/d0/d0d/structmst-members.html b/d0/d0d/structmst-members.html index af1b288dc..6d37a4596 100644 --- a/d0/d0d/structmst-members.html +++ b/d0/d0d/structmst-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d1/d77/structmst.html','../../'); init 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 6398069b7..a90feb196 100644 --- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg +++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg @@ -36,7 +36,7 @@ Node3 - + std::vector< std::vector < int > > @@ -53,7 +53,7 @@ Node4 - + std::vector< int > @@ -77,7 +77,7 @@ Node5 - + std::map< T, std::list < T > > diff --git a/d0/d2e/namespaceneural__network.html b/d0/d2e/namespaceneural__network.html index 8cd9640e6..b9d9b2f1f 100644 --- a/d0/d2e/namespaceneural__network.html +++ b/d0/d2e/namespaceneural__network.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: neural_network Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,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 cf3c45acb..42db7786e 100644 --- a/d0/d3e/classdata__structures_1_1trie.html +++ b/d0/d3e/classdata__structures_1_1trie.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: data_structures::trie Class Reference @@ -42,10 +42,10 @@ - + @@ -103,12 +103,6 @@ $(document).ready(function(){initNavTree('d0/d3e/classdata__structures_1_1trie.h

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

-
-Collaboration diagram for data_structures::trie:
-
-
-
-
[legend]
@@ -195,6 +189,9 @@ static constexpr uint8_t 

Public Member Functions

46  std::exit(EXIT_FAILURE);
47  return 0;
48  }
+ +
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:
@@ -286,6 +283,11 @@ 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
+
std::string::length
T length(T... args)
Here is the call graph for this function:
@@ -347,6 +349,8 @@ Here is the call graph for this function:
97  }
98  root->isEndofWord = true;
99  }
+
data_structures::trie::trie
trie()=default
Class default constructor.
+ @@ -412,6 +416,7 @@ Here is the call graph for this function:
67  }
68  return search(root->arr[j], str, index + 1);
69  }
+
data_structures::trie::search
bool search(const std::shared_ptr< trie > &root, const std::string &str, int index)
Definition: trie_tree.cpp:56
@@ -485,22 +490,11 @@ Here is the call graph for this function: -
std::shared_ptr
STL class.
-
data_structures::trie::trie
trie()=default
Class default constructor.
-
std::string::length
T length(T... args)
-
data_structures::trie::isEndofWord
bool isEndofWord
identifier if a node is terminal node
Definition: trie_tree.cpp:30
- -
data_structures::trie::NUM_CHARS
static constexpr uint8_t NUM_CHARS
Number of alphabets.
Definition: trie_tree.cpp:27
-
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::search
bool search(const std::shared_ptr< trie > &root, const std::string &str, int index)
Definition: trie_tree.cpp:56
-
std::exit
T exit(T... args)
diff --git a/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.svg b/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.svg index 5154d84ab..2a11b90ac 100644 --- a/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.svg +++ b/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.svg @@ -38,7 +38,7 @@ Node4 - + std::string::length @@ -69,7 +69,7 @@ Node3 - + std::exit diff --git a/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.svg b/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.svg index a518e1104..f7cb7c05f 100644 --- a/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.svg +++ b/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::exit diff --git a/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.svg b/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.svg index e72d3c864..f817d750b 100644 --- a/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.svg +++ b/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.svg @@ -38,7 +38,7 @@ Node4 - + std::string::length @@ -53,7 +53,7 @@ Node3 - + std::exit diff --git a/d0/d52/namespacewiggle__sort.html b/d0/d52/namespacewiggle__sort.html index 48556d725..ec968b45b 100644 --- a/d0/d52/namespacewiggle__sort.html +++ b/d0/d52/namespacewiggle__sort.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: wiggle_sort Namespace Reference @@ -42,10 +42,10 @@
- + @@ -105,7 +105,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 b8e478da7..7d75a9cdd 100644 --- a/d0/d55/classcll-members.html +++ b/d0/d55/classcll-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -113,7 +113,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 988b303aa..e3a73aa06 100644 --- a/d0/d58/classgraph_1_1_rooted_tree.html +++ b/d0/d58/classgraph_1_1_rooted_tree.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: graph::RootedTree Class Reference @@ -42,10 +42,10 @@ - + @@ -202,6 +202,10 @@ Protected Member Functions
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
+
std::vector::size
T size(T... args)
@@ -253,6 +257,16 @@ Protected Member Functions
136  }
137  }
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
+
std::queue::empty
T empty(T... args)
+
std::queue::front
T front(T... args)
+
std::queue::pop
T pop(T... args)
+
std::queue::push
T push(T... args)
+ +
Here is the call graph for this function:
@@ -267,25 +281,11 @@ Here is the call graph for this function:
-
graph::RootedTree::level
std::vector< int > level
Stores the distance from the root.
Definition: lowest_common_ancestor.cpp:106
- -
std::vector::size
T size(T... args)
-
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::queue
STL class.
-
Graph
Definition: bellman_ford.cpp:13
-
std::queue::front
T front(T... args)
-
graph::Graph::number_of_vertices
int number_of_vertices() const
Definition: lowest_common_ancestor.cpp:74
-
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::pop
T pop(T... args)
-
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::queue::empty
T empty(T... args)
-
std::queue::push
T push(T... args)
-
graph::RootedTree::root
int root
Index of the root vertex.
Definition: lowest_common_ancestor.cpp:108
diff --git a/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.svg b/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.svg index e59c81508..2734eb8ec 100644 --- a/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.svg +++ b/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::queue::empty @@ -37,7 +37,7 @@ Node3 - + std::queue::front @@ -68,7 +68,7 @@ Node6 - + std::queue::pop @@ -83,7 +83,7 @@ Node7 - + std::queue::push @@ -98,7 +98,7 @@ Node5 - + std::vector::size diff --git a/d0/d5a/skip__list_8cpp.html b/d0/d5a/skip__list_8cpp.html index 71c847400..b05fc59ce 100644 --- a/d0/d5a/skip__list_8cpp.html +++ b/d0/d5a/skip__list_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: data_structures/skip_list.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -181,6 +181,13 @@ constexpr float  223 
224  return 0;
225 }
+
data_structures::SkipList
Definition: skip_list.cpp:55
+
data_structures::SkipList::insertElement
void insertElement(int key, void *value)
Definition: skip_list.cpp:90
+
data_structures::SkipList::displayList
void displayList()
Definition: skip_list.cpp:191
+
data_structures::MAX_LEVEL
constexpr int MAX_LEVEL
Maximum level of skip list.
Definition: skip_list.cpp:27
+
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:
@@ -192,18 +199,11 @@ Here is the call graph for this function:
-
std::srand
T srand(T... args)
-
data_structures::SkipList::displayList
void displayList()
Definition: skip_list.cpp:191
-
data_structures::MAX_LEVEL
constexpr int MAX_LEVEL
Maximum level of skip list.
Definition: skip_list.cpp:27
-
data_structures::SkipList
Definition: skip_list.cpp:55
-
std::rand
T rand(T... args)
-
std::time
T time(T... args)
-
data_structures::SkipList::insertElement
void insertElement(int key, void *value)
Definition: skip_list.cpp:90
diff --git a/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 1de95792f..61e66de98 100644 --- a/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -53,7 +53,7 @@ Node6 - + std::rand @@ -68,7 +68,7 @@ Node7 - + std::srand @@ -83,7 +83,7 @@ Node8 - + std::time @@ -98,7 +98,7 @@ Node3 - + std::endl diff --git a/d0/d62/struct_queue-members.html b/d0/d62/struct_queue-members.html index c4e1c4a9c..3cf307883 100644 --- a/d0/d62/struct_queue-members.html +++ b/d0/d62/struct_queue-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -112,7 +112,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 5fc151304..84536f4d5 100644 --- a/d0/d65/namespacedouble__hashing.html +++ b/d0/d65/namespacedouble__hashing.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: double_hashing Namespace Reference @@ -42,10 +42,10 @@ - + @@ -96,7 +96,7 @@ $(document).ready(function(){initNavTree('d0/d65/namespacedouble__hashing.html', Functions | Variables
-
double_hashing Namespace Reference
Open Addressing
+
double_hashing Namespace Reference
@@ -197,6 +197,8 @@ bool rehashing 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
Here is the call graph for this function:
@@ -238,6 +240,11 @@ Here is the call graph for this function:
220  std::cout << "New table: ";
221  display();
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::display
void display()
Definition: double_hash_hash_table.cpp:143
+
add
std::string add(std::string a, std::string b)
Definition: string_fibonacci.cpp:24
Here is the call graph for this function:
@@ -364,6 +371,11 @@ new hash if no conflicts present
110  } while (entry.key != notPresent);
111  return notPresent;
112 }
+
double_hashing::searchingProber
bool searchingProber(const Entry &entry, int key)
Definition: double_hash_hash_table.cpp:133
+
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
Here is the call graph for this function:
@@ -401,6 +413,7 @@ Here is the call graph for this function:
48  std::hash<int> hash;
49  return hash(key);
50 }
+ @@ -514,6 +527,7 @@ Here is the call graph for this function:
178  rehashing = false;
179  std::cout << "Table was rehashed, new size is: " << totalSize << std::endl;
180 }
+
Here is the call graph for this function:
@@ -555,6 +569,7 @@ Here is the call graph for this function:
235  std::cout << "New table: ";
236  display();
237 }
+
double_hashing::remove
void remove(int key)
Definition: double_hash_hash_table.cpp:199
Here is the call graph for this function:
@@ -649,26 +664,11 @@ Here is the call graph for this function:
-
double_hashing::Entry
Definition: double_hash_hash_table.cpp:36
-
double_hashing::otherHashFxn
size_t otherHashFxn(int key)
Used for second hash function.
Definition: double_hash_hash_table.cpp:58
-
std::vector
STL class.
-
double_hashing::putProber
bool putProber(const Entry &entry, int key)
Definition: double_hash_hash_table.cpp:120
- -
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::rehash
void rehash()
Definition: double_hash_hash_table.cpp:161
-
double_hashing::display
void display()
Definition: double_hash_hash_table.cpp:143
-
double_hashing::remove
void remove(int key)
Definition: double_hash_hash_table.cpp:199
-
std::endl
T endl(T... args)
-
double_hashing::searchingProber
bool searchingProber(const Entry &entry, int key)
Definition: double_hash_hash_table.cpp:133
-
double_hashing::doubleHash
int doubleHash(int key, bool searching)
Performs double hashing to resolve collisions.
Definition: double_hash_hash_table.cpp:71
-
add
std::string add(std::string a, std::string b)
Definition: string_fibonacci.cpp:24
-
double_hashing::Entry::key
int key
key value
Definition: double_hash_hash_table.cpp:38
- diff --git a/d0/d65/namespacedouble__hashing.js b/d0/d65/namespacedouble__hashing.js index 82b3dfa46..6bca93436 100644 --- a/d0/d65/namespacedouble__hashing.js +++ b/d0/d65/namespacedouble__hashing.js @@ -1,4 +1,22 @@ var namespacedouble__hashing = [ - [ "Entry", "d9/dde/structdouble__hashing_1_1_entry.html", "d9/dde/structdouble__hashing_1_1_entry" ] + [ "Entry", "d9/dde/structdouble__hashing_1_1_entry.html", "d9/dde/structdouble__hashing_1_1_entry" ], + [ "Entry", "d0/d65/namespacedouble__hashing.html#a4b68c58d0e039662991f8e220129efd9", null ], + [ "add", "d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a", null ], + [ "addInfo", "d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560", null ], + [ "display", "d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd", null ], + [ "doubleHash", "d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200", null ], + [ "hashFxn", "d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003", null ], + [ "otherHashFxn", "d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082", null ], + [ "putProber", "d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b", null ], + [ "rehash", "d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d", null ], + [ "removalInfo", "d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824", null ], + [ "remove", "d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931", null ], + [ "searchingProber", "d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6", null ], + [ "notPresent", "d0/d65/namespacedouble__hashing.html#a77d33a0c49294b9ec22ad86eeff79585", null ], + [ "rehashing", "d0/d65/namespacedouble__hashing.html#ae5d042a7f6038a2ec9e5718d0c7fb31f", null ], + [ "size", "d0/d65/namespacedouble__hashing.html#a5f5323b52037218cf5ae888778b7f980", null ], + [ "table", "d0/d65/namespacedouble__hashing.html#a0e2ff0f9cfc7b54e60a6561f792d8b26", null ], + [ "tomb", "d0/d65/namespacedouble__hashing.html#a4e9a7219d34e781e4e73d74a968b26c1", null ], + [ "totalSize", "d0/d65/namespacedouble__hashing.html#a60a52265027518b25655d730f960013a", null ] ]; \ No newline at end of file diff --git a/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.svg b/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.svg index 8671d1192..e6fa6a203 100644 --- a/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.svg +++ b/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.svg b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.svg index 810e4b2bb..83a70bd7f 100644 --- a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.svg +++ b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::endl diff --git a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.svg b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.svg index 77d77254e..1945c4062 100644 --- a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.svg +++ b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.svg @@ -82,7 +82,7 @@ var sectionId = 'dynsection-5'; Node3 - + std::endl diff --git a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg index 51e5fc888..1f8fa14fc 100644 --- a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg +++ b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg @@ -36,7 +36,7 @@ Node3 - + std::endl diff --git a/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.svg b/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.svg index 41f10d1c1..55d77d97b 100644 --- a/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.svg +++ b/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.svg @@ -51,7 +51,7 @@ Node3 - + std::endl diff --git a/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.svg b/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.svg index 8be5b554f..9b97751a5 100644 --- a/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.svg +++ b/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.svg b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.svg index 4e9cb913f..d9c7c8e57 100644 --- a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.svg +++ b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.svg @@ -82,7 +82,7 @@ var sectionId = 'dynsection-1'; Node4 - + std::endl diff --git a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg index 59b467258..1718dd2bf 100644 --- a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg +++ b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg @@ -36,7 +36,7 @@ Node4 - + std::endl diff --git a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.svg b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.svg index af0fb8d17..a4d2e1ad9 100644 --- a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.svg +++ b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.svg @@ -82,7 +82,7 @@ var sectionId = 'dynsection-4'; Node4 - + std::endl diff --git a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg index e71bb9953..9a4fc09f1 100644 --- a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg +++ b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg @@ -36,7 +36,7 @@ Node4 - + std::endl diff --git a/d0/d6d/modular__exponentiation_8cpp.html b/d0/d6d/modular__exponentiation_8cpp.html index 65f4234dc..c7c54966e 100644 --- a/d0/d6d/modular__exponentiation_8cpp.html +++ b/d0/d6d/modular__exponentiation_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/modular_exponentiation.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -112,7 +112,7 @@ Include dependency graph for modular_exponentiation.cpp:

Namespaces

 math - for std::vector
+ for std::vector
 
87  test(); // execute the tests
88  return 0;
89 }
+
test
static void test()
Definition: modular_exponentiation.cpp:60
Here is the call graph for this function:
@@ -207,6 +208,9 @@ Here is the call graph for this function:
78  assert(test_case_5 == 1);
79  std::cout << "Test 5 Passed!" << std::endl;
80 }
+ +
std::endl
T endl(T... args)
+
math::power
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.
Definition: modular_exponentiation.cpp:35
Here is the call graph for this function:
@@ -218,15 +222,11 @@ Here is the call graph for this function:
-
test
static void test()
Definition: modular_exponentiation.cpp:60
- -
std::endl
T endl(T... args)
-
math::power
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.
Definition: modular_exponentiation.cpp:35
diff --git a/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index a73637db7..1a26728f7 100644 --- a/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 85f0aabd0..5e29fd02d 100644 --- a/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::endl diff --git a/d0/d6f/namespaceothers.html b/d0/d6f/namespaceothers.html index 84664e69c..766d8ce82 100644 --- a/d0/d6f/namespaceothers.html +++ b/d0/d6f/namespaceothers.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: others Namespace Reference @@ -42,10 +42,10 @@

@@ -154,6 +154,7 @@ Functions

- + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d0/d6f/namespaceothers.html','../../') diff --git a/d0/d6f/namespaceothers.js b/d0/d6f/namespaceothers.js index 7b10bef60..23c6c4017 100644 --- a/d0/d6f/namespaceothers.js +++ b/d0/d6f/namespaceothers.js @@ -1,6 +1,11 @@ var namespaceothers = [ [ "postfix_expression", null, [ - [ "Stack", "d5/d8a/classothers_1_1postfix__expression_1_1_stack.html", "d5/d8a/classothers_1_1postfix__expression_1_1_stack" ] + [ "Stack", "d5/d8a/classothers_1_1postfix__expression_1_1_stack.html", "d5/d8a/classothers_1_1postfix__expression_1_1_stack" ], + [ "evaluate", "d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338", null ], + [ "is_number", "d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a", null ], + [ "pop", "d7/d75/postfix__evaluation_8cpp.html#a421baa2002a64bc0bfc3e1b64800d734", null ], + [ "postfix_evaluation", "d7/d75/postfix__evaluation_8cpp.html#ae38bd3a177a6d61da3859a281233bbe1", null ], + [ "push", "d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea", null ] ] ] ]; \ No newline at end of file diff --git a/d0/d78/classstatistics_1_1stats__computer1-members.html b/d0/d78/classstatistics_1_1stats__computer1-members.html index c86440a3c..ef8f03e87 100644 --- a/d0/d78/classstatistics_1_1stats__computer1-members.html +++ b/d0/d78/classstatistics_1_1stats__computer1-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -111,7 +111,7 @@ $(document).ready(function(){initNavTree('d7/d7c/classstatistics_1_1stats__compu diff --git a/d0/da2/number__of__positive__divisors_8cpp.html b/d0/da2/number__of__positive__divisors_8cpp.html index 52d0338a0..4877ea4ef 100644 --- a/d0/da2/number__of__positive__divisors_8cpp.html +++ b/d0/da2/number__of__positive__divisors_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/number_of_positive_divisors.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -157,6 +157,11 @@ list of positive divisors of 36 = 1, 2, 3, 4, 6, 9, 12, 18, 36.

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
Here is the call graph for this function:
@@ -257,16 +262,11 @@ Here is the call graph for this function:
-
tests
void tests()
Definition: number_of_positive_divisors.cpp:70
- -
std::endl
T endl(T... args)
-
number_of_positive_divisors
int number_of_positive_divisors(int n)
Definition: number_of_positive_divisors.cpp:33
- diff --git a/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 67525a628..077836c47 100644 --- a/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d0/db6/non__recursive__merge__sort_8cpp.html b/d0/db6/non__recursive__merge__sort_8cpp.html index c9449de53..bd31fc69a 100644 --- a/d0/db6/non__recursive__merge__sort_8cpp.html +++ b/d0/db6/non__recursive__merge__sort_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: sorting/non_recursive_merge_sort.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -144,7 +144,7 @@ int main (int argc, ch diff --git a/d0/dc4/struct_point-members.html b/d0/dc4/struct_point-members.html index b331601d9..4c8aab4d3 100644 --- a/d0/dc4/struct_point-members.html +++ b/d0/dc4/struct_point-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -107,7 +107,7 @@ $(document).ready(function(){initNavTree('d8/dc8/struct_point.html','../../'); i diff --git a/d0/dd5/classciphers_1_1_hill_cipher-members.html b/d0/dd5/classciphers_1_1_hill_cipher-members.html index 204d979ff..dc0d3d905 100644 --- a/d0/dd5/classciphers_1_1_hill_cipher-members.html +++ b/d0/dd5/classciphers_1_1_hill_cipher-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -116,7 +116,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 2bb419bf0..8ef0a13d7 100644 --- a/d0/dda/namespacesaddleback.html +++ b/d0/dda/namespacesaddleback.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: saddleback Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,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 4256d7d0e..58f511001 100644 --- a/d0/de2/gaussian__elimination_8cpp.html +++ b/d0/de2/gaussian__elimination_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: numerical_methods/gaussian_elimination.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -199,6 +199,11 @@ Functions
74 
75  return 0;
76 }
+ + +
std::endl
T endl(T... args)
+
mat_size
ll mat_size
Definition: matrix_exponentiation.cpp:45
+
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:
@@ -210,16 +215,11 @@ Here is the call graph for this function:
-
mat_size
ll mat_size
Definition: matrix_exponentiation.cpp:45
- -
std::endl
T endl(T... args)
- -
machine_learning::sum
T sum(const std::vector< std::valarray< T >> &A)
Definition: vector_ops.hpp:232
diff --git a/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 1dece80bb..1a85a2fe4 100644 --- a/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d0/dff/structlinkedlist.html b/d0/dff/structlinkedlist.html index 7b31319b6..63f2ad4ba 100644 --- a/d0/dff/structlinkedlist.html +++ b/d0/dff/structlinkedlist.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: linkedlist Struct Reference @@ -42,10 +42,10 @@ - + @@ -122,7 +122,7 @@ int data diff --git a/d1/d07/class_solution-members.html b/d1/d07/class_solution-members.html index 0f9b35fc6..b47d6c247 100644 --- a/d1/d07/class_solution-members.html +++ b/d1/d07/class_solution-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -110,7 +110,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 7a472cfea..8ef48aa9a 100644 --- a/d1/d11/gcd__of__n__numbers_8cpp.html +++ b/d1/d11/gcd__of__n__numbers_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/gcd_of_n_numbers.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -162,6 +162,7 @@ Functions
23  }
24  return gcd;
25 }
+
gcd
int gcd(int *a, int n)
Definition: gcd_of_n_numbers.cpp:15
@@ -195,6 +196,9 @@ Functions
39  delete[] a;
40  return 0;
41 }
+ + +
std::endl
T endl(T... args)
Here is the call graph for this function:
@@ -206,15 +210,11 @@ Here is the call graph for this function:
- -
std::endl
T endl(T... args)
-
gcd
int gcd(int *a, int n)
Definition: gcd_of_n_numbers.cpp:15
- diff --git a/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 04ffc788d..b67674504 100644 --- a/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.map b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.map index deed0f9dd..74be48904 100644 --- a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.map +++ b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.map @@ -1,5 +1,4 @@ - - + diff --git a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.md5 b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.md5 index bce709bab..95b0d7764 100644 --- a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.md5 +++ b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.md5 @@ -1 +1 @@ -094ceb470fb68fee6019a398206ccea4 \ No newline at end of file +884a0c769e9e126da41bafbfcd37ea9d \ No newline at end of file diff --git a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.svg b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.svg index 9d6e441c7..0d5d19100 100644 --- a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.svg +++ b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.svg @@ -4,11 +4,11 @@ - + data_structures::linked_list::list - + Node1 @@ -22,45 +22,21 @@ Node2 - - -std::shared_ptr< data -_structures::linked_list -::link > + + +std::shared_ptr< data +_structures::linked_list +::link > Node2->Node1 - - - first -last - - - -Node3 - - -data_structures::linked -_list::link - - - - - -Node2->Node3 - - - psucc - - - -Node3->Node2 - - - ptr + + + first +last diff --git a/d1/d1d/class_graph-members.html b/d1/d1d/class_graph-members.html index d0e94f435..36b84ef5a 100644 --- a/d1/d1d/class_graph-members.html +++ b/d1/d1d/class_graph-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -143,7 +143,7 @@ $(document).ready(function(){initNavTree('da/d9a/class_graph.html','../../'); in diff --git a/d1/d21/quick__sort_8cpp.html b/d1/d21/quick__sort_8cpp.html index 427d43f04..7f72790d7 100644 --- a/d1/d21/quick__sort_8cpp.html +++ b/d1/d21/quick__sort_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: sorting/quick_sort.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -174,19 +174,19 @@ void show (int arr[],
99  delete[] arr;
100  return 0;
101 }
+ + +
sorting::quickSort
void quickSort(int arr[], int low, int high)
Definition: quick_sort.cpp:63
- - -
sorting::quickSort
void quickSort(int arr[], int low, int high)
Definition: quick_sort.cpp:63
diff --git a/d1/d2a/knight__tour_8cpp.html b/d1/d2a/knight__tour_8cpp.html index 92a4d99f0..3a2a8cece 100644 --- a/d1/d2a/knight__tour_8cpp.html +++ b/d1/d2a/knight__tour_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: backtracking/knight_tour.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -175,18 +175,18 @@ Functions
103  }
104  return 0;
105 }
+ + - -
std::array
STL class.
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 7683b2460..3559d72ae 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,7 +3,7 @@ - + Algorithms_in_C++: range_queries::heavy_light_decomposition::Tree< X > Class Template Reference @@ -42,10 +42,10 @@ - + @@ -201,10 +201,11 @@ class range_queries::heavy_light_decomposition::Tree< X >

A Basic Tree, which supports binary lifting.

Template Parameters
- +
thedata type of the values stored in the tree nodes Deleting the default constructor An instance can only be created with the number of nodes Defaults: t_node indexing are zero based t_root is 0 depth of root_node is 0 Supports: lift :- lift a node k units up the tree kth_ancestor :- returns the kth ancestor lca :- returns the least common ancestor
thedata type of the values stored in the tree nodes
+

Deleting the default constructor An instance can only be created with the number of nodes Defaults: t_node indexing are zero based t_root is 0 depth of root_node is 0 Supports: lift :- lift a node k units up the tree kth_ancestor :- returns the kth ancestor lca :- returns the least common ancestor

Constructor & Destructor Documentation

◆ Tree()

@@ -248,6 +249,18 @@ template<typename X >
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
+
std::floor
T floor(T... args)
+
std::vector::resize
T resize(T... args)
+
Here is the call graph for this function:
@@ -307,6 +320,7 @@ template<typename X >
158  t_adj[u].push_back(v);
159  t_adj[v].push_back(u);
160  }
+
std::vector::push_back
T push_back(T... args)
Here is the call graph for this function:
@@ -416,6 +430,7 @@ template<typename X >
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
@@ -473,6 +488,7 @@ template<typename X >
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
@@ -566,6 +582,7 @@ template<typename X >
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
Here is the call graph for this function:
@@ -745,6 +762,7 @@ template<typename X >
176  assert(static_cast<int>(node_val.size()) == t_nodes);
177  t_val = node_val;
178  }
+
std::vector::size
T size(T... args)
Here is the call graph for this function:
@@ -759,28 +777,11 @@ Here is the call graph for this function:
-
std::vector::resize
T resize(T... args)
-
std::floor
T floor(T... args)
-
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::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::t_root
int t_root
the root of the tree
Definition: heavy_light_decomposition.cpp:91
-
range_queries::heavy_light_decomposition::Tree::t_maxlift
const int t_maxlift
maximum possible height of the tree
Definition: heavy_light_decomposition.cpp:85
- -
std::vector::size
T size(T... args)
-
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
-
std::vector::push_back
T push_back(T... args)
-
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_nodes
const int t_nodes
number of nodes
Definition: heavy_light_decomposition.cpp:84
-
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_val
std::vector< X > t_val
values of nodes
Definition: heavy_light_decomposition.cpp:92
-
std::vector::assign
T assign(T... args)
-
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::t_depth
std::vector< int > t_depth
a vector to store the depth of a node,
Definition: heavy_light_decomposition.cpp:88
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.svg index 7dcfae69b..e1a69b38c 100644 --- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.svg +++ b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.svg @@ -23,7 +23,7 @@ Node2 - + std::vector::size diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.svg index edcc1bd7a..8a751a3d4 100644 --- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.svg +++ b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.svg @@ -23,7 +23,7 @@ Node2 - + std::vector::push_back diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.svg index 7fa989e92..2d13577dd 100644 --- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.svg +++ b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.svg @@ -23,7 +23,7 @@ Node2 - + std::vector::assign @@ -38,7 +38,7 @@ Node3 - + std::vector::resize diff --git a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.svg b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.svg index a5ef9600d..1f95e5c8b 100644 --- a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.svg +++ b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.svg @@ -23,7 +23,7 @@ Node2 - + std::vector< X > diff --git a/d1/d6f/vector__ops_8hpp__dep__incl.map b/d1/d6f/vector__ops_8hpp__dep__incl.map index fee5e6721..f428f074c 100644 --- a/d1/d6f/vector__ops_8hpp__dep__incl.map +++ b/d1/d6f/vector__ops_8hpp__dep__incl.map @@ -1,4 +1,4 @@ - + diff --git a/d1/d6f/vector__ops_8hpp__dep__incl.md5 b/d1/d6f/vector__ops_8hpp__dep__incl.md5 index bf2254c0d..0d409cb02 100644 --- a/d1/d6f/vector__ops_8hpp__dep__incl.md5 +++ b/d1/d6f/vector__ops_8hpp__dep__incl.md5 @@ -1 +1 @@ -ecb6e611595c6b954ccfdb2c91341f44 \ No newline at end of file +9d55cb68a073738e8d1064763a6862e2 \ No newline at end of file diff --git a/d1/d6f/vector__ops_8hpp__dep__incl.svg b/d1/d6f/vector__ops_8hpp__dep__incl.svg index 8914ef56d..339165195 100644 --- a/d1/d6f/vector__ops_8hpp__dep__incl.svg +++ b/d1/d6f/vector__ops_8hpp__dep__incl.svg @@ -12,7 +12,7 @@ Node1 - + machine_learning/vector _ops.hpp 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 4941feed9..656b4c022 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 @@ -21,7 +21,7 @@ Node2 - + std::vector< std::vector < int > > @@ -54,7 +54,7 @@ Node3 - + std::vector< int > @@ -100,7 +100,7 @@ Node6 - + std::map< T, std::list < T > > diff --git a/d1/d76/buzz__number_8cpp.html b/d1/d76/buzz__number_8cpp.html index 146b165fa..6f8cbb8d9 100644 --- a/d1/d76/buzz__number_8cpp.html +++ b/d1/d76/buzz__number_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: others/buzz_number.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -143,6 +143,9 @@ Functions
18  }
19  return 0;
20 }
+ + +
std::endl
T endl(T... args)
Here is the call graph for this function:
@@ -154,14 +157,11 @@ Here is the call graph for this function:
- -
std::endl
T endl(T... args)
- diff --git a/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 92d317421..7cbefbedd 100644 --- a/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d1/d77/structmst.html b/d1/d77/structmst.html index 536f2d4f9..baadf4615 100644 --- a/d1/d77/structmst.html +++ b/d1/d77/structmst.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: mst Struct Reference @@ -42,10 +42,10 @@ - + @@ -119,7 +119,7 @@ int near diff --git a/d1/d90/classdata__structures_1_1trie-members.html b/d1/d90/classdata__structures_1_1trie-members.html index 5fba86067..35ed7dd75 100644 --- a/d1/d90/classdata__structures_1_1trie-members.html +++ b/d1/d90/classdata__structures_1_1trie-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -111,7 +111,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 4642d8d91..3c6f11d52 100644 --- a/d1/d9a/hopcroft__karp_8cpp.html +++ b/d1/d9a/hopcroft__karp_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: graph/hopcroft_karp.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -138,22 +138,22 @@ Functions

Detailed Description

Implementation of Hopcroft–Karp algorithm.

The Hopcroft–Karp algorithm is an algorithm that takes as input a bipartite graph and produces as output a maximum cardinality matching, it runs in O(E√V) time in worst case.

-

+

Bipartite graph

A bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V such that every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles.

-

+

Matching and Not-Matching edges

Given a matching M, edges that are part of matching are called Matching edges and edges that are not part of M (or connect free nodes) are called Not-Matching edges.

-

+

Maximum cardinality matching

Given a bipartite graphs G = ( V = ( X , Y ) , E ) whose partition has the parts X and Y, with E denoting the edges of the graph, the goal is to find a matching with as many edges as possible. Equivalently, a matching that covers as many vertices as possible.

-

+

Augmenting paths

Given a matching M, an augmenting path is an alternating path that starts from and ends on free vertices. All single edge paths that start and end with free vertices are augmenting paths.

-

+

Concept

A matching M is not maximum if there exists an augmenting path. It is also true other way, i.e, a matching is maximum if no augmenting path exists.

-

+

Algorithm

1) Initialize the Maximal Matching M as empty. 2) While there exists an Augmenting Path P Remove matching edges of P from M and add not-matching edges of P to M (This increases size of M by 1 as P starts and ends with a free vertex i.e. a node that is not part of matching.) 3) Return M.

Author
Krishna Pal Deora
@@ -195,6 +195,10 @@ Algorithm
323  return 0;
324 
325 }
+ + +
graph::HKGraph
Represents Bipartite graph for Hopcroft Karp implementation.
Definition: hopcroft_karp.cpp:67
+
tests
void tests()
Definition: hopcroft_karp.cpp:255
Here is the call graph for this function:
@@ -276,15 +280,11 @@ Here is the call graph for this function:
- -
tests
void tests()
Definition: hopcroft_karp.cpp:255
-
graph::HKGraph
Represents Bipartite graph for Hopcroft Karp implementation.
Definition: hopcroft_karp.cpp:67
- diff --git a/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg index 78157c8af..4e3d86c97 100644 --- a/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg +++ b/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg @@ -52,7 +52,7 @@ Node3 - + std::vector::push_back @@ -97,7 +97,7 @@ Node6 - + std::vector::end diff --git a/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 2ff3c1d02..bf4b8d829 100644 --- a/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -113,7 +113,7 @@ var sectionId = 'dynsection-1'; Node3 - + std::vector::push_back @@ -158,7 +158,7 @@ var sectionId = 'dynsection-1'; Node6 - + std::vector::end diff --git a/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 3b197e55f..3946c3bf9 100644 --- a/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -67,7 +67,7 @@ Node3 - + std::vector::push_back @@ -112,7 +112,7 @@ Node6 - + std::vector::end diff --git a/d1/da6/rungekutta_8cpp.html b/d1/da6/rungekutta_8cpp.html index 64c272d00..0307d9c4b 100644 --- a/d1/da6/rungekutta_8cpp.html +++ b/d1/da6/rungekutta_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: numerical_methods/rungekutta.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -212,6 +212,7 @@ Functions
131  test(); // Execute the tests
132  return 0;
133 }
+
test
static void test()
Tests to check algorithm implementation.
Definition: rungekutta.cpp:100
Here is the call graph for this function:
@@ -307,6 +308,9 @@ Here is the call graph for this function:
90 
91  return y;
92 }
+
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
+
Here is the call graph for this function:
@@ -366,22 +370,18 @@ Here is the call graph for this function:
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
- - -
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
-
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
-
test
static void test()
Tests to check algorithm implementation.
Definition: rungekutta.cpp:100
diff --git a/d1/db3/structcompare.html b/d1/db3/structcompare.html index 48d37aede..77fd5e956 100644 --- a/d1/db3/structcompare.html +++ b/d1/db3/structcompare.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: compare Struct Reference @@ -42,10 +42,10 @@ - + @@ -113,7 +113,7 @@ bool operator() (
  • compare
    • -
  • Generated by doxygen 1.8.20
    • +
  • Generated by doxygen 1.9.1
diff --git a/d1/dbb/n__choose__r_8cpp.html b/d1/dbb/n__choose__r_8cpp.html index 1e8815141..c56b5d026 100644 --- a/d1/dbb/n__choose__r_8cpp.html +++ b/d1/dbb/n__choose__r_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/n_choose_r.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -112,7 +112,7 @@ Include dependency graph for n_choose_r.cpp:

Namespaces

 math - for std::vector
+ for std::vector
 
81  test(); // executing tests
82  return 0;
83 }
+
test
static void test()
Test implementations.
Definition: n_choose_r.cpp:52
Here is the call graph for this function:
@@ -227,6 +228,9 @@ Here is the call graph for this function:
70  t == 210));
71  std::cout << "Fourth test passes." << std::endl;
72 }
+ +
std::endl
T endl(T... args)
+
math::n_choose_r
T n_choose_r(T n, T r)
This is the function implementation of .
Definition: n_choose_r.cpp:35
Here is the call graph for this function:
@@ -238,15 +242,11 @@ Here is the call graph for this function:
-
test
static void test()
Test implementations.
Definition: n_choose_r.cpp:52
- -
math::n_choose_r
T n_choose_r(T n, T r)
This is the function implementation of .
Definition: n_choose_r.cpp:35
-
std::endl
T endl(T... args)
diff --git a/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg index 7e599c7fe..1799010f9 100644 --- a/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg +++ b/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::endl diff --git a/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 8e57b4822..e8b20cf07 100644 --- a/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d1/dbe/lu__decomposition_8h.html b/d1/dbe/lu__decomposition_8h.html index d3a26f31c..c240997a7 100644 --- a/d1/dbe/lu__decomposition_8h.html +++ b/d1/dbe/lu__decomposition_8h.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: numerical_methods/lu_decomposition.h File Reference @@ -42,10 +42,10 @@

@@ -172,6 +172,7 @@ Functions

- + @@ -150,7 +150,7 @@ template<typename T >
-

Define matrix type as a std::vector of std::valarray

+

Define matrix type as a std::vector of std::valarray

@@ -199,6 +199,11 @@ template<typename T >
100  }
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
+
std::vector::size
T size(T... args)
+ +
Here is the call graph for this function:
@@ -302,6 +307,8 @@ negative if error occurred
76 
77  return 0;
78 }
+ +
mat_size
ll mat_size
Definition: matrix_exponentiation.cpp:45
Here is the call graph for this function:
@@ -313,18 +320,11 @@ Here is the call graph for this function:
-
mat_size
ll mat_size
Definition: matrix_exponentiation.cpp:45
-
std::vector
STL class.
-
std::vector::size
T size(T... args)
- - -
lu_decomposition
int lu_decomposition(const matrix< T > &A, matrix< double > *L, matrix< double > *U)
Definition: lu_decomposition.h:29
-
math::fibonacci_sum::result
uint64_t result(uint64_t n)
Definition: fibonacci_sum.cpp:76
diff --git a/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.svg b/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.svg index c7348b3be..2326574fe 100644 --- a/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.svg +++ b/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::vector::size diff --git a/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.svg b/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.svg index 4e2d38b4a..caba4205a 100644 --- a/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.svg +++ b/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::vector::size diff --git a/d1/dbe/lu__decomposition_8h_source.html b/d1/dbe/lu__decomposition_8h_source.html index 1ed6fbb2b..5f24dafd5 100644 --- a/d1/dbe/lu__decomposition_8h_source.html +++ b/d1/dbe/lu__decomposition_8h_source.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: numerical_methods/lu_decomposition.h Source File @@ -42,10 +42,10 @@ - + @@ -196,192 +196,20 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
100  }
101  return result;
102 }
+ +
determinant_lu
double determinant_lu(const matrix< T > &A)
Definition: lu_decomposition.h:90
+
lu_decomposition
int lu_decomposition(const matrix< T > &A, matrix< double > *L, matrix< double > *U)
Definition: lu_decomposition.h:29
+
mat_size
ll mat_size
Definition: matrix_exponentiation.cpp:45
+
std::vector::size
T size(T... args)
+ + -
check_termination
bool check_termination(long double delta)
Definition: durand_kerner_roots.cpp:91
-
Sqrt
double Sqrt(double a)
Definition: sqrt_double.cpp:16
-
tests
static void tests(math::ncr_modulo_p::NCRModuloP ncrObj)
Test implementations.
Definition: ncr_modulo_p.cpp:124
-
std::srand
T srand(T... args)
-
tests
void tests()
Definition: number_of_positive_divisors.cpp:70
-
lcm
unsigned int lcm(unsigned int x, unsigned int y)
Definition: least_common_multiple.cpp:43
-
tests
void tests()
Definition: least_common_multiple.cpp:50
-
math::lcmSum
uint64_t lcmSum(const uint16_t &num)
Definition: lcm_sum.cpp:29
-
prime_numbers
std::vector< int > prime_numbers
Definition: prime_factorization.cpp:16
-
main
int main()
Definition: primes_up_to_billion.cpp:26
-
statistics::stats_computer2::operator>>
friend std::istream & operator>>(std::istream &input, stats_computer2 &stat)
Definition: realtime_stats.cpp:97
-
mat_size
ll mat_size
Definition: matrix_exponentiation.cpp:45
-
EPSILON
#define EPSILON
solution accuracy limit
Definition: golden_search_extrema.cpp:17
-
test3
void test3()
Test function to find maxima for the function in the interval Expected result: .
Definition: brent_method_extrema.cpp:188
-
std::string
STL class.
- -
primes
std::vector< int > primes(int max)
Definition: prime_numbers.cpp:12
-
miller_rabin_primality_test
bool miller_rabin_primality_test(T num, T repeats)
Definition: miller_rabin.cpp:125
-
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
for io operations
-
gcd
int gcd(int num1, int num2)
Definition: gcd_iterative_euclidean.cpp:15
-
test_3
static void test_3()
Definition: heavy_light_decomposition.cpp:592
- -
main
int main()
Definition: brent_method_extrema.cpp:204
-
std::cos
T cos(T... args)
-
EPSILON
#define EPSILON
system accuracy limit
Definition: brent_method_extrema.cpp:23
- -
test2
void test2()
Definition: lu_decompose.cpp:66
-
std::vector::size
T size(T... args)
-
math::ncr_modulo_p::NCRModuloP
Class which contains all methods required for calculating nCr mod p.
Definition: ncr_modulo_p.cpp:31
-
test
static void test()
Definition: modular_exponentiation.cpp:60
-
multiply
int multiply(int x, int res[], int res_size)
Definition: power_for_huge_numbers.cpp:25
-
test_2
static void test_2()
Definition: heavy_light_decomposition.cpp:549
-
test
static void test()
Test implementations.
Definition: n_choose_r.cpp:52
-
ans
ll ans(ll n)
Definition: matrix_exponentiation.cpp:91
-
test
static void test()
Function for testing largestPower function. test cases and assert statement.
Definition: largest_power.cpp:47
-
main
int main()
Definition: sieve_of_eratosthenes.cpp:65
-
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
-
test
static void test()
Definition: lcm_sum.cpp:65
-
sieve
std::vector< bool > sieve(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:26
-
complex_str
const char * complex_str(const std::complex< double > &x)
Definition: durand_kerner_roots.cpp:76
-
test
static void test()
Definition: sum_of_binomial_coefficient.cpp:37
-
test3
void test3()
Test function to find maxima for the function in the interval Expected result: .
Definition: golden_search_extrema.cpp:123
-
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
-
std::setfill
T setfill(T... args)
- -
sgn
int sgn(T val)
Definition: bisection_method.cpp:32
-
statistics::stats_computer1::std
double std() const
Definition: realtime_stats.cpp:48
-
factors
std::vector< std::pair< int, int > > factors
Definition: prime_factorization.cpp:19
-
main
int main(int argc, char *argv[])
Main function.
Definition: n_choose_r.cpp:80
-
main
int main()
Definition: prime_factorization.cpp:62
-
reverse_binary
std::vector< T > reverse_binary(T num)
Definition: miller_rabin.cpp:19
-
std::sqrt
T sqrt(T... args)
-
power
void power(int x, int n)
Definition: power_for_huge_numbers.cpp:56
-
math::ncr_modulo_p::NCRModuloP::p
uint64_t p
stores precomputed factorial(i) % p value
Definition: ncr_modulo_p.cpp:34
-
test1
void test1()
Test function to find minima for the function in the interval Expected result = 2.
Definition: golden_search_extrema.cpp:78
-
is_prime
bool is_prime(T num)
Definition: check_prime.cpp:22
-
main
int main()
Definition: prime_numbers.cpp:26
- -
std::vector::push_back
T push_back(T... args)
-
main
int main()
Definition: modular_inverse_fermat_little_theorem.cpp:84
-
main
int main()
Main function.
Definition: magic_number.cpp:77
-
std::clock
T clock(T... args)
-
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
-
test1
void test1()
Definition: lu_decompose.cpp:36
-
test
void test()
Definition: sum_of_digits.cpp:58
-
std::isnan
T isnan(T... args)
-
statistics
Statistical algorithms.
-
test2
void test2()
Definition: sum_of_digits.cpp:49
-
false_position
Functions for False Position method.
-
EPSILON
constexpr double EPSILON
system accuracy limit
Definition: newton_raphson_method.cpp:20
-
std::snprintf
T snprintf(T... args)
- -
main
int main()
Definition: graph_coloring.cpp:96
-
std::numeric_limits::infinity
T infinity(T... args)
- -
std::ofstream
STL class.
-
main
int main()
Main function.
Definition: false_position.cpp:102
-
std::isinf
T isinf(T... args)
-
main
int main()
Main function.
Definition: lcm_sum.cpp:96
-
statistics::stats_computer2::variance
double variance() const
Definition: realtime_stats.cpp:89
-
gcd
unsigned int gcd(unsigned int x, unsigned int y)
Definition: least_common_multiple.cpp:16
-
main
int main()
Definition: sqrt_double.cpp:42
-
math::ncr_modulo_p::NCRModuloP::NCRModuloP
NCRModuloP(const uint64_t &size, const uint64_t &mod)
the p from (nCr % p)
Definition: ncr_modulo_p.cpp:41
-
modular_exponentiation
T modular_exponentiation(T base, const std::vector< T > &rev_binary_exponent, T mod)
Definition: miller_rabin.cpp:43
-
poly_function
std::complex< double > poly_function(const std::valarray< double > &coeffs, std::complex< double > x)
Definition: durand_kerner_roots.cpp:53
-
main
int main(int argc, char **argv)
Definition: lu_decompose.cpp:84
- -
main
int main()
Main function.
Definition: ncr_modulo_p.cpp:137
-
std::complex::real
T real(T... args)
-
test1
void test1()
Definition: durand_kerner_roots.cpp:207
-
main
int main()
Definition: gaussian_elimination.cpp:9
-
std::ofstream::open
T open(T... args)
-
ACCURACY
#define ACCURACY
Definition: durand_kerner_roots.cpp:45
-
statistics::stats_computer1::mean
double mean() const
Definition: realtime_stats.cpp:42
-
statistics::stats_computer2
Definition: realtime_stats.cpp:72
-
math::magic_number
bool magic_number(const uint64_t &n)
Definition: magic_number.cpp:32
-
tests
static void tests()
Test function.
Definition: magic_number.cpp:51
-
math::ncr_modulo_p::NCRModuloP::ncr
int64_t ncr(const uint64_t &n, const uint64_t &r, const uint64_t &p)
Definition: ncr_modulo_p.cpp:92
-
main
int main(int argc, char **argv)
Definition: realtime_stats.cpp:158
-
print
void print(uint32_t N, const std::vector< bool > &is_prime)
Definition: sieve_of_eratosthenes.cpp:44
-
std::rand
T rand(T... args)
-
std::swap
T swap(T... args)
-
lu_decomposition.h
Functions associated with LU Decomposition of a square matrix.
-
main
int main()
Main function.
Definition: modular_exponentiation.cpp:86
-
test_function
void test_function(const float *test_data, const int number_of_samples)
Definition: realtime_stats.cpp:118
-
SieveOfEratosthenes
void SieveOfEratosthenes(int N)
Definition: prime_factorization.cpp:23
-
std::string::substr
T substr(T... args)
-
miller_test
bool miller_test(T d, T num)
Definition: miller_rabin.cpp:73
-
main
int main()
Definition: least_common_multiple.cpp:78
-
lu_decomposition
int lu_decomposition(const matrix< T > &A, matrix< double > *L, matrix< double > *U)
Definition: lu_decomposition.h:29
-
math::n_choose_r
T n_choose_r(T n, T r)
This is the function implementation of .
Definition: n_choose_r.cpp:35
-
test_1
static void test_1()
Definition: heavy_light_decomposition.cpp:505
-
binExpo
int64_t binExpo(int64_t a, int64_t b, int64_t m)
Definition: modular_inverse_fermat_little_theorem.cpp:52
-
math::binomialCoeffSum
uint64_t binomialCoeffSum(uint64_t n)
Definition: sum_of_binomial_coefficient.cpp:26
-
std::endl
T endl(T... args)
-
statistics::stats_computer1::new_val
void new_val(T x)
Definition: realtime_stats.cpp:32
-
test2
void test2()
Test function to find root for the function in the interval Expected result: .
Definition: brent_method_extrema.cpp:165
-
std::left
T left(T... args)
-
math::largestPower
uint64_t largestPower(uint32_t n, const uint16_t &p)
Function to calculate largest power.
Definition: largest_power.cpp:26
-
statistics::stats_computer2::new_val
void new_val(T x)
Definition: realtime_stats.cpp:77
-
statistics::stats_computer1::variance
double variance() const
Definition: realtime_stats.cpp:45
-
sum_of_digits
int sum_of_digits(int num)
Definition: sum_of_digits.cpp:23
-
main
int main()
Definition: number_of_positive_divisors.cpp:81
-
std::vector::cbegin
T cbegin(T... args)
-
main
int main()
Definition: miller_rabin.cpp:183
-
math::power
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.
Definition: modular_exponentiation.cpp:35
-
math::ncr_modulo_p::NCRModuloP::modInverse
int64_t modInverse(const uint64_t &a, const uint64_t &m)
Definition: ncr_modulo_p.cpp:76
-
std::strtod
T strtod(T... args)
-
math
for std::vector
-
main
int main()
Definition: power_for_huge_numbers.cpp:82
-
prime_factorization
void prime_factorization(int num)
Definition: prime_factorization.cpp:40
-
main
int main()
Definition: sum_of_digits.cpp:68
-
determinant_lu
double determinant_lu(const matrix< T > &A)
Definition: lu_decomposition.h:90
-
std::fixed
T fixed(T... args)
-
statistics::stats_computer1
Definition: realtime_stats.cpp:27
-
test2
void test2()
Test function to find maxima for the function in the interval Expected result: .
Definition: golden_search_extrema.cpp:100
-
main
int main()
Main function.
Definition: sum_of_binomial_coefficient.cpp:63
-
statistics::stats_computer2::std
double std() const
Definition: realtime_stats.cpp:92
-
main
int main()
Definition: golden_search_extrema.cpp:139
-
test1
void test1()
Definition: sum_of_digits.cpp:40
-
std::complex
STL class.
-
std::complex::imag
T imag(T... args)
-
ncr_modulo_p
Functions for nCr modulo p implementation.
-
test1
void test1()
Test function to find root for the function in the interval Expected result = 2.
Definition: brent_method_extrema.cpp:143
-
add
std::string add(std::string a, std::string b)
Definition: string_fibonacci.cpp:24
-
main
int main()
Main function.
Definition: largest_power.cpp:74
-
std::make_pair
T make_pair(T... args)
-
std::time
T time(T... args)
-
MAX_ITERATIONS
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: bisection_method.cpp:22
-
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
-
std::vector::cend
T cend(T... args)
-
tests
void tests()
Definition: sieve_of_eratosthenes.cpp:56
-
std::setw
T setw(T... args)
-
std::max
T max(T... args)
-
main
int main()
Definition: string_fibonacci.cpp:81
-
number_of_positive_divisors
int number_of_positive_divisors(int n)
Definition: number_of_positive_divisors.cpp:33
-
eq
static double eq(double i)
Definition: bisection_method.cpp:26
-
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
-
fib_Accurate
void fib_Accurate(uint64_t n)
Definition: string_fibonacci.cpp:68
-
Sieve
void Sieve(int64_t n)
Definition: primes_up_to_billion.cpp:13
- -
operator<<
std::ostream & operator<<(std::ostream &out, matrix< T > const &v)
Definition: lu_decompose.cpp:18
-
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
-
statistics::stats_computer2::mean
double mean() const
Definition: realtime_stats.cpp:86
-
isPrime
bool isPrime(int64_t m)
Definition: modular_inverse_fermat_little_theorem.cpp:68
-
std::ofstream::is_open
T is_open(T... args)
-
test2
void test2()
Definition: durand_kerner_roots.cpp:242
-
main
int main()
Definition: bisection_method.cpp:37
-
std::exit
T exit(T... args)
-
MAX
#define MAX
Definition: power_for_huge_numbers.cpp:10
-
statistics::stats_computer1::operator>>
friend std::istream & operator>>(std::istream &input, stats_computer1 &stat)
Definition: realtime_stats.cpp:53
-
tests
void tests()
Definition: miller_rabin.cpp:157
-
math::fibonacci_sum::result
uint64_t result(uint64_t n)
Definition: fibonacci_sum.cpp:76
-
machine_learning::sum
T sum(const std::vector< std::valarray< T >> &A)
Definition: vector_ops.hpp:232
-
prime
char prime[100000000]
Definition: primes_up_to_billion.cpp:10
-
std::pow
T pow(T... args)
-
isprime
bool isprime[1000006]
Definition: prime_factorization.cpp:13
diff --git a/d1/dc2/class_graph__coll__graph.svg b/d1/dc2/class_graph__coll__graph.svg index c37ad1e98..ab119d733 100644 --- a/d1/dc2/class_graph__coll__graph.svg +++ b/d1/dc2/class_graph__coll__graph.svg @@ -21,7 +21,7 @@ Node2 - + std::map< unsigned int, std::vector< unsigned @@ -39,7 +39,7 @@ Node3 - + std::vector< unsigned int > @@ -56,7 +56,7 @@ Node4 - + std::vector< std::vector < int > > @@ -74,7 +74,7 @@ Node5 - + std::vector< int > @@ -97,7 +97,7 @@ Node6 - + std::bitset< MAXN > @@ -113,7 +113,7 @@ Node7 - + std::vector< std::tuple < int, int, int > > @@ -130,7 +130,7 @@ Node8 - + std::tuple< int, int, int > diff --git a/d1/dc2/classstack.html b/d1/dc2/classstack.html index 985c9acb6..1d709f4e3 100644 --- a/d1/dc2/classstack.html +++ b/d1/dc2/classstack.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: stack< Type > Class Template Reference @@ -42,10 +42,10 @@ - + @@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('d1/dc2/classstack.html','../../'); ini
Collaboration diagram for stack< Type >:
-
+
[legend]
@@ -179,6 +179,8 @@ template<class Type >
42  stackTop = nullptr;
43  size = 0;
44  }
+
stack::stackTop
node< Type > * stackTop
Definition: stack.h:146
+
stack::size
int size
size of stack
Definition: stack.h:147
@@ -236,6 +238,7 @@ template<class Type >
72  }
73  size = otherStack.size;
74  }
+ @@ -333,6 +336,8 @@ template<class Type >
36  std::cout << std::endl;
37  std::cout << "Size of stack: " << size << std::endl;
38  }
+ +
std::endl
T endl(T... args)
Here is the call graph for this function:
@@ -465,6 +470,7 @@ template<class Type >
107  std::cout << "Stack is empty !" << std::endl;
108  }
109  }
+
stack::isEmptyStack
bool isEmptyStack()
Definition: stack.h:80
Here is the call graph for this function:
@@ -574,17 +580,11 @@ template<class Type >
- - -
stack::size
int size
size of stack
Definition: stack.h:147
-
std::endl
T endl(T... args)
-
stack::isEmptyStack
bool isEmptyStack()
Definition: stack.h:80
-
stack::stackTop
node< Type > * stackTop
Definition: stack.h:146
diff --git a/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.svg b/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.svg index bdd635f3a..f64c5d3bb 100644 --- a/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.svg +++ b/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.svg b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.svg index a5d2b8311..9d7dfc28e 100644 --- a/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.svg +++ b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d1/dc5/classlarge__number__coll__graph.svg b/d1/dc5/classlarge__number__coll__graph.svg index 280629ac5..89bf768cd 100644 --- a/d1/dc5/classlarge__number__coll__graph.svg +++ b/d1/dc5/classlarge__number__coll__graph.svg @@ -21,7 +21,7 @@ Node2 - + std::vector< unsigned char > diff --git a/d1/dc7/linear__probing__hash__table_8cpp.html b/d1/dc7/linear__probing__hash__table_8cpp.html index 2ada5d1e1..eeb511708 100644 --- a/d1/dc7/linear__probing__hash__table_8cpp.html +++ b/d1/dc7/linear__probing__hash__table_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: hashing/linear_probing_hash_table.cpp File Reference @@ -42,10 +42,10 @@
- + @@ -253,27 +253,27 @@ bool linear_probing::rehas
275  }
276  return 0;
277 }
+ + +
std::endl
T endl(T... args)
+
linear_probing::addInfo
void addInfo(int key)
Definition: linear_probing_hash_table.cpp:186
+
linear_probing::hashFxn
size_t hashFxn(int key)
Hash a key. Uses the STL library's std::hash() function.
Definition: linear_probing_hash_table.cpp:46
+
linear_probing::linearProbe
int linearProbe(int key, bool searching)
Definition: linear_probing_hash_table.cpp:55
+
linear_probing::removalInfo
void removalInfo(int key)
Definition: linear_probing_hash_table.cpp:201
+
linear_probing::display
void display()
Definition: linear_probing_hash_table.cpp:120
+
linear_probing::Entry
Definition: linear_probing_hash_table.cpp:35
+
linear_probing::Entry::key
int key
key value
Definition: linear_probing_hash_table.cpp:37
+ -
linear_probing::Entry::key
int key
key value
Definition: linear_probing_hash_table.cpp:37
-
linear_probing::Entry
Definition: linear_probing_hash_table.cpp:35
-
std::vector
STL class.
-
linear_probing::hashFxn
size_t hashFxn(int key)
Hash a key. Uses the STL library's std::hash() function.
Definition: linear_probing_hash_table.cpp:46
-
linear_probing::addInfo
void addInfo(int key)
Definition: linear_probing_hash_table.cpp:186
-
linear_probing::linearProbe
int linearProbe(int key, bool searching)
Definition: linear_probing_hash_table.cpp:55
- -
std::endl
T endl(T... args)
-
linear_probing::removalInfo
void removalInfo(int key)
Definition: linear_probing_hash_table.cpp:201
-
linear_probing::display
void display()
Definition: linear_probing_hash_table.cpp:120
- diff --git a/d1/dcc/wiggle__sort_8cpp.html b/d1/dcc/wiggle__sort_8cpp.html index 7465f3aec..5c373b150 100644 --- a/d1/dcc/wiggle__sort_8cpp.html +++ b/d1/dcc/wiggle__sort_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: sorting/wiggle_sort.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -188,6 +188,9 @@ template<typename T >
69 
70  return out; // returns the sorted vector
71 }
+
std::vector::size
T size(T... args)
+
std::swap
T swap(T... args)
+
Here is the call graph for this function:
@@ -199,14 +202,11 @@ Here is the call graph for this function:
-
std::vector
STL class.
-
std::vector::size
T size(T... args)
-
std::swap
T swap(T... args)
diff --git a/d1/de0/namespacenumerical__methods.html b/d1/de0/namespacenumerical__methods.html index 64881d12c..e41aed942 100644 --- a/d1/de0/namespacenumerical__methods.html +++ b/d1/de0/namespacenumerical__methods.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: numerical_methods Namespace Reference @@ -42,10 +42,10 @@ - + @@ -108,7 +108,7 @@ $(document).ready(function(){initNavTree('d1/de0/namespacenumerical__methods.htm 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 f278833e2..c97f85862 100644 --- a/d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html +++ b/d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -107,7 +107,7 @@ $(document).ready(function(){initNavTree('d4/dde/classgeometry_1_1jarvis_1_1_con 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 51a12134a..3e09af3b1 100644 --- a/d1/def/classdata__structures_1_1linked__list_1_1list.html +++ b/d1/def/classdata__structures_1_1linked__list_1_1list.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: data_structures::linked_list::list Class Reference @@ -42,10 +42,10 @@ - + @@ -101,7 +101,7 @@ $(document).ready(function(){initNavTree('d1/def/classdata__structures_1_1linked
Collaboration diagram for data_structures::linked_list::list:
-
+
[legend]
@@ -168,6 +168,8 @@ Private Attributes
92  // Initialize the last link with the first link
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
@@ -198,6 +200,9 @@ Private Attributes
186  t = t->succ();
187  }
188 }
+ +
data_structures::linked_list::list::isEmpty
bool isEmpty()
Definition: linked_list.cpp:111
+
Here is the call graph for this function:
@@ -249,6 +254,7 @@ Here is the call graph for this function:
170  last = nullptr;
171  }
172 }
+
std::shared_ptr::reset
T reset(T... args)
Here is the call graph for this function:
@@ -416,17 +422,11 @@ Here is the call graph for this function:
-
std::shared_ptr
STL class.
-
data_structures::linked_list::list::last
std::shared_ptr< link > last
last link on the list
Definition: linked_list.cpp:84
-
std::shared_ptr::reset
T reset(T... args)
- -
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::isEmpty
bool isEmpty()
Definition: linked_list.cpp:111
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a1fb1792ab867dc26639eef368a56989e_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a1fb1792ab867dc26639eef368a56989e_cgraph.svg index 6011bc510..e63f7891b 100644 --- a/d1/def/classdata__structures_1_1linked__list_1_1list_a1fb1792ab867dc26639eef368a56989e_cgraph.svg +++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a1fb1792ab867dc26639eef368a56989e_cgraph.svg @@ -38,7 +38,7 @@ Node3 - + std::shared_ptr::reset diff --git a/d1/df2/structnode-members.html b/d1/df2/structnode-members.html index c1bf54646..bdecb8381 100644 --- a/d1/df2/structnode-members.html +++ b/d1/df2/structnode-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@
- + @@ -118,7 +118,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 096654bd9..f32c5c579 100644 --- a/d1/df3/hash__search_8cpp.html +++ b/d1/df3/hash__search_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: search/hash_search.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -206,20 +206,26 @@ int 
Warning
dynamic memory allocated to n never gets freed.
Todo:
fix memory leak
55  { // Construct hash table
-
56  link p, n;
+
56  link p, n;
57  int index;
58  n = (link)malloc(sizeof(node));
-
59  n->key = key;
-
60  n->next = NULL;
+
59  n->key = key;
+
60  n->next = NULL;
61  index = h(key);
62  p = hashtab[index].next;
63  if (p != NULL) {
-
64  n->next = p;
+
64  n->next = p;
65  hashtab[index].next = n;
66  } else {
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
+ +
std::malloc
T malloc(T... args)
+
node
Definition: avltree.cpp:13
Here is the call graph for this function:
@@ -254,6 +260,7 @@ Here is the call graph for this function:
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
@@ -286,7 +293,7 @@ Here is the call graph for this function:
-1
76  { // Hash lookup function
-
77  link pointer;
+
77  link pointer;
78  int index;
79 
80  *counter = 0;
@@ -297,15 +304,16 @@ Here is the call graph for this function:
85 
86  while (pointer != NULL) {
87  counter[0]++;
-
88  std::cout << "data[" << pointer->key << "]:";
-
89  if (pointer->key == key)
+
88  std::cout << "data[" << pointer->key << "]:";
+
89  if (pointer->key == key)
90  return 1;
91  else
-
92  pointer = pointer->next;
+
92  pointer = pointer->next;
93  }
94 
95  return 0;
96 }
+
Here is the call graph for this function:
@@ -332,7 +340,7 @@ Here is the call graph for this function:

main function

99  {
-
100  link p;
+
100  link p;
101  int key, index, i, counter; // Key is the value to be found
102  index = 0;
103 
@@ -349,9 +357,9 @@ Here is the call graph for this function:
114 
115  while (p != NULL) {
116  std::cout << "please int key:";
-
117  if (p->key > 0)
-
118  std::cout << "[" << p->key << "]";
-
119  p = p->next;
+
117  if (p->key > 0)
+
118  std::cout << "[" << p->key << "]";
+
119  p = p->next;
120  }
121  std::cout << std::endl;
122  }
@@ -372,6 +380,11 @@ Here is the call graph for this function:
137 
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
Here is the call graph for this function:
@@ -383,26 +396,11 @@ Here is the call graph for this function:
-
hash_search
int hash_search(int key, int *counter)
Definition: hash_search.cpp:76
-
HASHMAX
#define HASHMAX
Determines the length of the hash table.
Definition: hash_search.cpp:22
-
node
Definition: avltree.cpp:13
-
MAX
#define MAX
Determines how much data.
Definition: hash_search.cpp:21
- -
h
int h(int key)
Definition: hash_search.cpp:45
-
link
struct list * link
pointer to nodes
-
list::key
int key
key value for node
Definition: hash_search.cpp:30
-
hashtab
node hashtab[HASHMAX]
array of nodes
Definition: hash_search.cpp:35
-
data
int data[MAX]
test data
Definition: hash_search.cpp:24
-
std::endl
T endl(T... args)
-
create_list
void create_list(int key)
Definition: hash_search.cpp:55
-
std::malloc
T malloc(T... args)
-
list::next
struct list * next
pointer to next link in the chain
Definition: hash_search.cpp:31
-
list
Definition: list_array.cpp:9
diff --git a/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 2c36167ee..300cc5995 100644 --- a/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -36,7 +36,7 @@ Node4 - + std::endl diff --git a/d2/d05/class_min_heap.html b/d2/d05/class_min_heap.html index ec028a82f..fdfb9eae8 100644 --- a/d2/d05/class_min_heap.html +++ b/d2/d05/class_min_heap.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: MinHeap Class Reference @@ -42,10 +42,10 @@ - + @@ -175,6 +175,9 @@ int  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
@@ -213,6 +216,7 @@ int  80  i = parent(i);
81  }
82 }
+
std::swap
T swap(T... args)
Here is the call graph for this function:
@@ -243,6 +247,8 @@ Here is the call graph for this function:
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
Here is the call graph for this function:
@@ -283,6 +289,7 @@ Here is the call graph for this function:
98 
99  return root;
100 }
+
MinHeap::MinHeapify
void MinHeapify(int)
Definition: binaryheap.cpp:113
@@ -346,6 +353,7 @@ Here is the call graph for this function:
69  i = parent(i);
70  }
71 }
+
Here is the call graph for this function:
@@ -413,6 +421,8 @@ Here is the call graph for this function:
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
Here is the call graph for this function:
@@ -455,21 +465,11 @@ Here is the call graph for this function:
-
MinHeap::heap_size
int heap_size
Current number of elements in min heap.
Definition: binaryheap.cpp:13
-
MinHeap::decreaseKey
void decreaseKey(int i, int new_val)
Definition: binaryheap.cpp:76
-
MinHeap::capacity
int capacity
maximum possible size of min heap
Definition: binaryheap.cpp:12
- -
MinHeap::harr
int * harr
pointer to array of elements in heap
Definition: binaryheap.cpp:11
-
MinHeap::MinHeapify
void MinHeapify(int)
Definition: binaryheap.cpp:113
-
MinHeap::left
int left(int i)
Definition: binaryheap.cpp:31
-
std::swap
T swap(T... args)
-
MinHeap::extractMin
int extractMin()
Definition: binaryheap.cpp:85
-
MinHeap::right
int right(int i)
Definition: binaryheap.cpp:34
diff --git a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.svg b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.svg index 473647bb6..2b49e50e1 100644 --- a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.svg +++ b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.svg @@ -51,7 +51,7 @@ Node3 - + std::swap diff --git a/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.svg b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.svg index 8f7d1a2ce..59b039d51 100644 --- a/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.svg +++ b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::swap diff --git a/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.svg b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.svg index 5f920624a..46257de61 100644 --- a/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.svg +++ b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.svg @@ -51,7 +51,7 @@ Node4 - + std::swap diff --git a/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.svg b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.svg index 8e3443412..b08e19115 100644 --- a/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.svg +++ b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::swap diff --git a/d2/d0b/fast__power_8cpp.html b/d2/d0b/fast__power_8cpp.html index 3b320c8be..26739b12e 100644 --- a/d2/d0b/fast__power_8cpp.html +++ b/d2/d0b/fast__power_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/fast_power.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -173,6 +173,8 @@ template<typename T >
61  }
62  return result;
63 }
+
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
@@ -222,6 +224,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
@@ -267,6 +270,14 @@ template<typename T >
91 
92  return 0;
93 }
+ + +
std::endl
T endl(T... args)
+
std::pow
T pow(T... args)
+
std::rand
T rand(T... args)
+
std::srand
T srand(T... args)
+
std::ios_base::sync_with_stdio
T sync_with_stdio(T... args)
+
std::time
T time(T... args)
Here is the call graph for this function:
@@ -278,22 +289,11 @@ Here is the call graph for this function:
-
std::srand
T srand(T... args)
-
fast_power_recursive
double fast_power_recursive(T a, T b)
Definition: fast_power.cpp:26
- -
std::rand
T rand(T... args)
-
std::endl
T endl(T... args)
-
std::ios_base::sync_with_stdio
T sync_with_stdio(T... args)
-
std::time
T time(T... args)
-
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
-
std::pow
T pow(T... args)
diff --git a/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index dffd767c3..d6308a377 100644 --- a/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -66,7 +66,7 @@ Node5 - + std::pow @@ -81,7 +81,7 @@ Node6 - + std::rand @@ -96,7 +96,7 @@ Node7 - + std::srand @@ -111,7 +111,7 @@ Node8 - + std::ios_base::sync _with_stdio @@ -127,7 +127,7 @@ Node9 - + std::time diff --git a/d2/d21/gnome__sort_8cpp.html b/d2/d21/gnome__sort_8cpp.html index bb2664e00..eadc70a8d 100644 --- a/d2/d21/gnome__sort_8cpp.html +++ b/d2/d21/gnome__sort_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: sorting/gnome_sort.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -134,7 +134,8 @@ Functions

Implementation of gnome sort algorithm.

Author
beqakd
-Krishna Vedala Gnome sort algorithm is not the best one but it is widely used. The algorithm iteratively checks the order of pairs in the array. If they are on right order it moves to the next successive pair, otherwise it swaps elements. This operation is repeated until no more swaps are made thus indicating the values to be in ascending order.
+Krishna Vedala +

Gnome sort algorithm is not the best one but it is widely used. The algorithm iteratively checks the order of pairs in the array. If they are on right order it moves to the next successive pair, otherwise it swaps elements. This operation is repeated until no more swaps are made thus indicating the values to be in ascending order.

The time Complexity of the algorithm is \(O(n^2)\) and in some cases it can be \(O(n)\).

Function Documentation

@@ -157,6 +158,7 @@ Functions
131  test();
132  return 0;
133 }
+
test
static void test()
Definition: gnome_sort.cpp:85
Here is the call graph for this function:
@@ -230,26 +232,25 @@ Here is the call graph for this function:
123  // for (int i = 0; i < size; i++) std::cout << double_arr[i] << ", ";
124  std::cout << std::endl;
125 }
+ + +
std::begin
T begin(T... args)
+
std::array::data
T data(T... args)
+
std::end
T end(T... args)
+
std::endl
T endl(T... args)
+
std::is_sorted
T is_sorted(T... args)
+
sorting::gnomeSort
void gnomeSort(T *arr, int size)
Definition: gnome_sort.cpp:34
+
std::rand
T rand(T... args)
-
test
static void test()
Definition: gnome_sort.cpp:85
-
std::is_sorted
T is_sorted(T... args)
- -
std::array
STL class.
-
sorting::gnomeSort
void gnomeSort(T *arr, int size)
Definition: gnome_sort.cpp:34
-
std::rand
T rand(T... args)
-
std::endl
T endl(T... args)
-
std::begin
T begin(T... args)
-
std::end
T end(T... args)
-
std::array::data
T data(T... args)
diff --git a/d2/d22/jump__search_8cpp.html b/d2/d22/jump__search_8cpp.html index 6fa418c19..9ada30ee5 100644 --- a/d2/d22/jump__search_8cpp.html +++ b/d2/d22/jump__search_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: search/jump_search.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -182,6 +182,9 @@ int main ()
39 
40  return -1;
41 }
+
std::min
T min(T... args)
+
std::prev
T prev(T... args)
+
std::sqrt
T sqrt(T... args)
Here is the call graph for this function:
@@ -193,14 +196,11 @@ Here is the call graph for this function:
-
std::sqrt
T sqrt(T... args)
-
std::min
T min(T... args)
-
std::prev
T prev(T... args)
diff --git a/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.svg b/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.svg index d17ed5df7..3f65d9568 100644 --- a/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.svg +++ b/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::min @@ -36,7 +36,7 @@ Node3 - + std::sqrt diff --git a/d2/d23/neural__network_8cpp__incl.map b/d2/d23/neural__network_8cpp__incl.map index 07b594901..e3c536118 100644 --- a/d2/d23/neural__network_8cpp__incl.map +++ b/d2/d23/neural__network_8cpp__incl.map @@ -10,6 +10,6 @@ - + diff --git a/d2/d23/neural__network_8cpp__incl.md5 b/d2/d23/neural__network_8cpp__incl.md5 index 9de38a115..2a4e045e2 100644 --- a/d2/d23/neural__network_8cpp__incl.md5 +++ b/d2/d23/neural__network_8cpp__incl.md5 @@ -1 +1 @@ -9a642a3e040e9bddebfa055efa17be4e \ No newline at end of file +58c2e918b7b0e7944b10a1a20f853b59 \ No newline at end of file diff --git a/d2/d23/neural__network_8cpp__incl.svg b/d2/d23/neural__network_8cpp__incl.svg index 71322ebd8..ac26a0951 100644 --- a/d2/d23/neural__network_8cpp__incl.svg +++ b/d2/d23/neural__network_8cpp__incl.svg @@ -218,7 +218,7 @@ var sectionId = 'dynsection-0'; Node12 - + vector_ops.hpp diff --git a/d2/d23/neural__network_8cpp__incl_org.svg b/d2/d23/neural__network_8cpp__incl_org.svg index e530c6325..582e674ca 100644 --- a/d2/d23/neural__network_8cpp__incl_org.svg +++ b/d2/d23/neural__network_8cpp__incl_org.svg @@ -172,7 +172,7 @@ Node12 - + vector_ops.hpp diff --git a/d2/d26/count__inversions_8cpp.html b/d2/d26/count__inversions_8cpp.html index f5d4792b7..f73735561 100644 --- a/d2/d26/count__inversions_8cpp.html +++ b/d2/d26/count__inversions_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: sorting/count_inversions.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -152,7 +152,7 @@ Functions

two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j

Time Complexity --> O(n.log n)

Space Complexity --> O(n) ; additional array temp[1..n]

-

+

Algorithm

  1. The idea is similar to merge sort, divide the array into two equal or almost equal halves in each step until the base case is reached.
    2. @@ -207,6 +207,11 @@ template<class T >
    167  temp.assign(size, 0);
    168  return mergeSort(arr, temp.data(), 0, size - 1);
    169 }
    +
    std::vector::assign
    T assign(T... args)
    +
    std::vector::data
    T data(T... args)
    +
    mergeSort
    void mergeSort(int *arr, int l, int r)
    Definition: merge_sort.cpp:71
    +
    std::vector::reserve
    T reserve(T... args)
    +
    Here is the call graph for this function:
    @@ -239,6 +244,7 @@ Here is the call graph for this function:
    273  // body(); // test your own array
    274  return 0;
    275 }
    +
    test
    static void test()
    Test implementations.
    Definition: count_inversions.cpp:194
    Here is the call graph for this function:
    @@ -337,6 +343,7 @@ template<typename T >
    111  }
    112  return inv_count;
    113 }
    +
    std::left
    T left(T... args)
    @@ -406,6 +413,7 @@ template<typename T >
    143  }
    144  return inv_count;
    145 }
    +
    merge
    void merge(int *arr, int l, int m, int r)
    Definition: merge_sort.cpp:33
    Here is the call graph for this function:
    @@ -459,6 +467,7 @@ template<typename T >
    183  }
    184  std::cout << "\n";
    185 }
    + @@ -520,6 +529,8 @@ template<typename T >
    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
    +
    std::vector::size
    T size(T... args)
    Here is the call graph for this function:
    @@ -531,22 +542,11 @@ Here is the call graph for this function:
    -
    std::vector::reserve
    T reserve(T... args)
    -
    std::vector
    STL class.
    -
    std::vector::size
    T size(T... args)
    -
    mergeSort
    void mergeSort(int *arr, int l, int r)
    Definition: merge_sort.cpp:71
    - -
    merge
    void merge(int *arr, int l, int m, int r)
    Definition: merge_sort.cpp:33
    -
    std::left
    T left(T... args)
    -
    test
    static void test()
    Test implementations.
    Definition: count_inversions.cpp:194
    -
    std::vector::assign
    T assign(T... args)
    -
    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::data
    T data(T... args)
    diff --git a/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index ed28fc1c6..2d5cc93bb 100644 --- a/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::vector::data @@ -36,7 +36,7 @@ Node3 - + std::vector::size diff --git a/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 54669f039..1daf857b0 100644 --- a/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::vector::data @@ -51,7 +51,7 @@ Node4 - + std::vector::size diff --git a/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.svg b/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.svg index 32215a92c..a4ce21c08 100644 --- a/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.svg +++ b/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.svg @@ -52,7 +52,7 @@ Node3 - + std::move diff --git a/d2/d2c/structtower.html b/d2/d2c/structtower.html index d6a16365c..86be015ac 100644 --- a/d2/d2c/structtower.html +++ b/d2/d2c/structtower.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: tower Struct Reference @@ -42,10 +42,10 @@ - + @@ -120,7 +120,7 @@ int 
    • tower
      • -
    • Generated by doxygen 1.8.20
      • +
    • Generated by doxygen 1.9.1
    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 b70219e02..20ec960de 100644 --- a/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html +++ b/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -104,7 +104,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 5ddd3d4f3..18bdf630a 100644 --- a/d2/d3b/namespaceqr__algorithm.html +++ b/d2/d3b/namespaceqr__algorithm.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: qr_algorithm Namespace Reference @@ -42,10 +42,10 @@ - + @@ -244,6 +244,12 @@ Functions
    163 
    164  return eigen_vals;
    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:
    @@ -295,6 +301,11 @@ template<typename T >
    45 
    46  return out;
    47 }
    +
    std::endl
    T endl(T... args)
    +
    std::right
    T right(T... args)
    +
    std::ostream::precision
    T precision(T... args)
    +
    std::setfill
    T setfill(T... args)
    +
    std::setw
    T setw(T... args)
    Here is the call graph for this function:
    @@ -456,6 +467,10 @@ template<typename T >
    205  }
    206  }
    207 }
    +
    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
    +
    Here is the call graph for this function:
    @@ -544,6 +559,8 @@ template<typename T >
    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
    +
    std::sqrt
    T sqrt(T... args)
    Here is the call graph for this function:
    @@ -610,28 +627,11 @@ Here is the call graph for this function:
    -
    std::setfill
    T setfill(T... args)
    -
    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
    -
    std::sqrt
    T sqrt(T... args)
    -
    std::printf
    T printf(T... args)
    -
    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
    -
    std::valarray
    STL class.
    -
    std::endl
    T endl(T... args)
    -
    qr_algorithm::vector_dot
    double vector_dot(const std::valarray< T > &a, const std::valarray< T > &b)
    Definition: qr_decompose.h:76
    -
    std::right
    T right(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
    - -
    std::setw
    T setw(T... args)
    - -
    std::ostream::precision
    T precision(T... args)
    -
    machine_learning::sum
    T sum(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:232
    diff --git a/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.svg b/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.svg index 1653aa6cf..4c19c70e2 100644 --- a/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.svg +++ b/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::ostream::precision @@ -36,7 +36,7 @@ Node3 - + std::right @@ -51,7 +51,7 @@ Node4 - + std::setfill @@ -66,7 +66,7 @@ Node5 - + std::setw diff --git a/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.svg b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.svg index 33025cdc4..1756a1101 100644 --- a/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.svg +++ b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.svg @@ -143,7 +143,7 @@ var sectionId = 'dynsection-0'; Node6 - + std::sqrt diff --git a/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph_org.svg b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph_org.svg index 942051414..127715430 100644 --- a/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph_org.svg +++ b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph_org.svg @@ -97,7 +97,7 @@ Node6 - + std::sqrt diff --git a/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.svg b/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.svg index 60c75c7d8..adee2d427 100644 --- a/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.svg +++ b/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -36,7 +36,7 @@ Node3 - + std::ostream::precision @@ -51,7 +51,7 @@ Node4 - + std::right @@ -66,7 +66,7 @@ Node5 - + std::setfill @@ -81,7 +81,7 @@ Node6 - + std::setw diff --git a/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.svg b/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.svg index 112c86283..eea3a2fd9 100644 --- a/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.svg +++ b/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.svg @@ -66,7 +66,7 @@ Node4 - + std::sqrt diff --git a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg index eab4466c3..1446d121d 100644 --- a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg +++ b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::sqrt diff --git a/d2/d52/heap__sort_8cpp.html b/d2/d52/heap__sort_8cpp.html index 5963ed26d..15acb629e 100644 --- a/d2/d52/heap__sort_8cpp.html +++ b/d2/d52/heap__sort_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: sorting/heap_sort.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -152,6 +152,7 @@ template<typename T >
    121  test();
    122  return 0;
    123 }
    +
    test
    void test()
    Definition: heap_sort.cpp:99
    Here is the call graph for this function:
    @@ -200,6 +201,7 @@ template<typename T >
    38  for (int i = 0; i < sz; i++) std::cout << arr[i] << " ";
    39  std::cout << "\n";
    40 }
    + @@ -237,6 +239,9 @@ template<typename T >
    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
    +
    std::is_sorted
    T is_sorted(T... args)
    Here is the call graph for this function:
    @@ -248,16 +253,11 @@ Here is the call graph for this function:
    -
    heapSort
    void heapSort(T *arr, int n)
    Definition: heap_sort.cpp:84
    -
    test
    void test()
    Definition: heap_sort.cpp:99
    -
    std::is_sorted
    T is_sorted(T... args)
    - -
    printArray
    void printArray(T *arr, int sz)
    Definition: heap_sort.cpp:37
    diff --git a/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg b/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg index df69c3402..babd2eee4 100644 --- a/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg +++ b/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::is_sorted diff --git a/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 24f9a7ec8..db21b7212 100644 --- a/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -51,7 +51,7 @@ Node4 - + std::is_sorted diff --git a/d2/d58/neural__network_8cpp.html b/d2/d58/neural__network_8cpp.html index 7a3eaeb4d..3d6717ed2 100644 --- a/d2/d58/neural__network_8cpp.html +++ b/d2/d58/neural__network_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: machine_learning/neural_network.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -327,6 +327,7 @@ Here is the call graph for this function:
    835  test();
    836  return 0;
    837 }
    +
    test
    static void test()
    Definition: neural_network.cpp:805
    Here is the call graph for this function:
    @@ -359,6 +360,7 @@ Here is the call graph for this function:
    Returns
    relu(x)
    74 { return std::max(0.0, x); }
    +
    std::max
    T max(T... args)
    Here is the call graph for this function:
    @@ -391,6 +393,7 @@ Here is the call graph for this function:
    Returns
    Returns sigmoid(x)
    60 { return 1.0 / (1.0 + std::exp(-x)); }
    +
    std::exp
    T exp(T... args)
    Here is the call graph for this function:
    @@ -510,6 +513,11 @@ Here is the call graph for this function:
    825  myNN.single_predict({{6.2, 3.4, 5.4, 2.3}})) == 2);
    826  return;
    827 }
    +
    machine_learning::neural_network::NeuralNetwork
    Definition: neural_network.cpp:247
    +
    machine_learning::neural_network::NeuralNetwork::fit_from_csv
    void fit_from_csv(const std::string &file_name, const bool &last_label, const int &epochs, const double &learning_rate, const bool &normalize, const int &slip_lines=1, const size_t &batch_size=32, const bool &shuffle=true)
    Definition: neural_network.cpp:587
    +
    machine_learning::neural_network::NeuralNetwork::summary
    void summary()
    Definition: neural_network.cpp:773
    +
    machine_learning::neural_network::NeuralNetwork::single_predict
    std::vector< std::valarray< double > > single_predict(const std::vector< std::valarray< double >> &X)
    Definition: neural_network.cpp:451
    +
    machine_learning::argmax
    size_t argmax(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:307
    Here is the call graph for this function:
    @@ -521,19 +529,11 @@ Here is the call graph for this function:
    -
    machine_learning::argmax
    size_t argmax(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:307
    -
    test
    static void test()
    Definition: neural_network.cpp:805
    -
    machine_learning::neural_network::NeuralNetwork::fit_from_csv
    void fit_from_csv(const std::string &file_name, const bool &last_label, const int &epochs, const double &learning_rate, const bool &normalize, const int &slip_lines=1, const size_t &batch_size=32, const bool &shuffle=true)
    Definition: neural_network.cpp:587
    -
    machine_learning::neural_network::NeuralNetwork
    Definition: neural_network.cpp:247
    -
    machine_learning::neural_network::NeuralNetwork::summary
    void summary()
    Definition: neural_network.cpp:773
    -
    std::exp
    T exp(T... args)
    -
    machine_learning::neural_network::NeuralNetwork::single_predict
    std::vector< std::valarray< double > > single_predict(const std::vector< std::valarray< double >> &X)
    Definition: neural_network.cpp:451
    -
    std::max
    T max(T... args)
    diff --git a/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.svg b/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.svg index feacf3da2..6cdb46485 100644 --- a/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.svg +++ b/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.svg @@ -29,7 +29,7 @@ Node2 - + std::exp diff --git a/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.svg b/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.svg index a78ec8010..c133ea203 100644 --- a/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.svg +++ b/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::exp diff --git a/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 4418b0e09..b7ad0cca0 100644 --- a/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -133,7 +133,7 @@ var sectionId = 'dynsection-10'; Node3 - + std::begin @@ -148,7 +148,7 @@ var sectionId = 'dynsection-10'; Node4 - + std::distance @@ -163,7 +163,7 @@ var sectionId = 'dynsection-10'; Node5 - + std::end @@ -178,7 +178,7 @@ var sectionId = 'dynsection-10'; Node6 - + std::endl @@ -193,7 +193,7 @@ var sectionId = 'dynsection-10'; Node7 - + std::exit @@ -224,7 +224,7 @@ var sectionId = 'dynsection-10'; Node9 - + std::max_element @@ -391,7 +391,7 @@ var sectionId = 'dynsection-10'; Node23 - + std::min @@ -406,7 +406,7 @@ var sectionId = 'dynsection-10'; Node24 - + std::chrono::high_resolution _clock::now @@ -422,7 +422,7 @@ var sectionId = 'dynsection-10'; Node25 - + std::vector::resize @@ -443,7 +443,7 @@ var sectionId = 'dynsection-10'; Node27 - + std::vector::size @@ -510,7 +510,7 @@ var sectionId = 'dynsection-10'; Node14 - + std::vector::emplace_back @@ -549,7 +549,7 @@ var sectionId = 'dynsection-10'; Node16 - + std::vector::push_back @@ -576,7 +576,7 @@ var sectionId = 'dynsection-10'; Node18 - + std::chrono::system _clock::now @@ -592,7 +592,7 @@ var sectionId = 'dynsection-10'; Node19 - + std::rand @@ -607,7 +607,7 @@ var sectionId = 'dynsection-10'; Node20 - + std::srand @@ -622,7 +622,7 @@ var sectionId = 'dynsection-10'; Node21 - + std::swap @@ -703,7 +703,7 @@ var sectionId = 'dynsection-10'; Node32 - + std::vector::back @@ -718,7 +718,7 @@ var sectionId = 'dynsection-10'; Node33 - + std::string::c_str @@ -733,7 +733,7 @@ var sectionId = 'dynsection-10'; Node34 - + std::ifstream::close @@ -748,7 +748,7 @@ var sectionId = 'dynsection-10'; Node35 - + std::ifstream::eof @@ -763,7 +763,7 @@ var sectionId = 'dynsection-10'; Node36 - + std::getline @@ -794,7 +794,7 @@ var sectionId = 'dynsection-10'; Node38 - + std::ifstream::is_open @@ -825,7 +825,7 @@ var sectionId = 'dynsection-10'; Node41 - + std::ifstream::open @@ -871,7 +871,7 @@ var sectionId = 'dynsection-10'; Node44 - + std::stod @@ -916,7 +916,7 @@ var sectionId = 'dynsection-10'; Node40 - + std::max diff --git a/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index 806163ed8..8d829abe5 100644 --- a/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -87,7 +87,7 @@ Node3 - + std::begin @@ -102,7 +102,7 @@ Node4 - + std::distance @@ -117,7 +117,7 @@ Node5 - + std::end @@ -132,7 +132,7 @@ Node6 - + std::endl @@ -147,7 +147,7 @@ Node7 - + std::exit @@ -178,7 +178,7 @@ Node9 - + std::max_element @@ -345,7 +345,7 @@ Node23 - + std::min @@ -360,7 +360,7 @@ Node24 - + std::chrono::high_resolution _clock::now @@ -376,7 +376,7 @@ Node25 - + std::vector::resize @@ -397,7 +397,7 @@ Node27 - + std::vector::size @@ -464,7 +464,7 @@ Node14 - + std::vector::emplace_back @@ -503,7 +503,7 @@ Node16 - + std::vector::push_back @@ -530,7 +530,7 @@ Node18 - + std::chrono::system _clock::now @@ -546,7 +546,7 @@ Node19 - + std::rand @@ -561,7 +561,7 @@ Node20 - + std::srand @@ -576,7 +576,7 @@ Node21 - + std::swap @@ -657,7 +657,7 @@ Node32 - + std::vector::back @@ -672,7 +672,7 @@ Node33 - + std::string::c_str @@ -687,7 +687,7 @@ Node34 - + std::ifstream::close @@ -702,7 +702,7 @@ Node35 - + std::ifstream::eof @@ -717,7 +717,7 @@ Node36 - + std::getline @@ -748,7 +748,7 @@ Node38 - + std::ifstream::is_open @@ -779,7 +779,7 @@ Node41 - + std::ifstream::open @@ -825,7 +825,7 @@ Node44 - + std::stod @@ -870,7 +870,7 @@ Node40 - + std::max diff --git a/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index cf70ac548..8a502948b 100644 --- a/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -148,7 +148,7 @@ var sectionId = 'dynsection-5'; Node4 - + std::begin @@ -163,7 +163,7 @@ var sectionId = 'dynsection-5'; Node5 - + std::distance @@ -178,7 +178,7 @@ var sectionId = 'dynsection-5'; Node6 - + std::end @@ -193,7 +193,7 @@ var sectionId = 'dynsection-5'; Node7 - + std::endl @@ -208,7 +208,7 @@ var sectionId = 'dynsection-5'; Node8 - + std::exit @@ -239,7 +239,7 @@ var sectionId = 'dynsection-5'; Node10 - + std::max_element @@ -406,7 +406,7 @@ var sectionId = 'dynsection-5'; Node24 - + std::min @@ -421,7 +421,7 @@ var sectionId = 'dynsection-5'; Node25 - + std::chrono::high_resolution _clock::now @@ -437,7 +437,7 @@ var sectionId = 'dynsection-5'; Node26 - + std::vector::resize @@ -458,7 +458,7 @@ var sectionId = 'dynsection-5'; Node28 - + std::vector::size @@ -525,7 +525,7 @@ var sectionId = 'dynsection-5'; Node15 - + std::vector::emplace_back @@ -564,7 +564,7 @@ var sectionId = 'dynsection-5'; Node17 - + std::vector::push_back @@ -591,7 +591,7 @@ var sectionId = 'dynsection-5'; Node19 - + std::chrono::system _clock::now @@ -607,7 +607,7 @@ var sectionId = 'dynsection-5'; Node20 - + std::rand @@ -622,7 +622,7 @@ var sectionId = 'dynsection-5'; Node21 - + std::srand @@ -637,7 +637,7 @@ var sectionId = 'dynsection-5'; Node22 - + std::swap @@ -718,7 +718,7 @@ var sectionId = 'dynsection-5'; Node33 - + std::vector::back @@ -733,7 +733,7 @@ var sectionId = 'dynsection-5'; Node34 - + std::string::c_str @@ -748,7 +748,7 @@ var sectionId = 'dynsection-5'; Node35 - + std::ifstream::close @@ -763,7 +763,7 @@ var sectionId = 'dynsection-5'; Node36 - + std::ifstream::eof @@ -778,7 +778,7 @@ var sectionId = 'dynsection-5'; Node37 - + std::getline @@ -809,7 +809,7 @@ var sectionId = 'dynsection-5'; Node39 - + std::ifstream::is_open @@ -840,7 +840,7 @@ var sectionId = 'dynsection-5'; Node42 - + std::ifstream::open @@ -886,7 +886,7 @@ var sectionId = 'dynsection-5'; Node45 - + std::stod @@ -931,7 +931,7 @@ var sectionId = 'dynsection-5'; Node41 - + std::max diff --git a/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index c58e23a94..289b379ee 100644 --- a/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -102,7 +102,7 @@ Node4 - + std::begin @@ -117,7 +117,7 @@ Node5 - + std::distance @@ -132,7 +132,7 @@ Node6 - + std::end @@ -147,7 +147,7 @@ Node7 - + std::endl @@ -162,7 +162,7 @@ Node8 - + std::exit @@ -193,7 +193,7 @@ Node10 - + std::max_element @@ -360,7 +360,7 @@ Node24 - + std::min @@ -375,7 +375,7 @@ Node25 - + std::chrono::high_resolution _clock::now @@ -391,7 +391,7 @@ Node26 - + std::vector::resize @@ -412,7 +412,7 @@ Node28 - + std::vector::size @@ -479,7 +479,7 @@ Node15 - + std::vector::emplace_back @@ -518,7 +518,7 @@ Node17 - + std::vector::push_back @@ -545,7 +545,7 @@ Node19 - + std::chrono::system _clock::now @@ -561,7 +561,7 @@ Node20 - + std::rand @@ -576,7 +576,7 @@ Node21 - + std::srand @@ -591,7 +591,7 @@ Node22 - + std::swap @@ -672,7 +672,7 @@ Node33 - + std::vector::back @@ -687,7 +687,7 @@ Node34 - + std::string::c_str @@ -702,7 +702,7 @@ Node35 - + std::ifstream::close @@ -717,7 +717,7 @@ Node36 - + std::ifstream::eof @@ -732,7 +732,7 @@ Node37 - + std::getline @@ -763,7 +763,7 @@ Node39 - + std::ifstream::is_open @@ -794,7 +794,7 @@ Node42 - + std::ifstream::open @@ -840,7 +840,7 @@ Node45 - + std::stod @@ -885,7 +885,7 @@ Node41 - + std::max diff --git a/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.svg b/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.svg index dc9df8160..b1d8b4a3f 100644 --- a/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.svg +++ b/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.svg @@ -28,7 +28,7 @@ Node2 - + std::max diff --git a/d2/d84/classdata__structures_1_1trie__coll__graph.map b/d2/d84/classdata__structures_1_1trie__coll__graph.map deleted file mode 100644 index cc7f397f7..000000000 --- a/d2/d84/classdata__structures_1_1trie__coll__graph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/d2/d84/classdata__structures_1_1trie__coll__graph.md5 b/d2/d84/classdata__structures_1_1trie__coll__graph.md5 deleted file mode 100644 index 290d872a4..000000000 --- a/d2/d84/classdata__structures_1_1trie__coll__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -b5b59746154af1ad1fc8e5780f67df66 \ No newline at end of file diff --git a/d2/d84/classdata__structures_1_1trie__coll__graph.svg b/d2/d84/classdata__structures_1_1trie__coll__graph.svg deleted file mode 100644 index 31ae2c8be..000000000 --- a/d2/d84/classdata__structures_1_1trie__coll__graph.svg +++ /dev/null @@ -1,64 +0,0 @@ - - - - - - -data_structures::trie - - - -Node1 - - -data_structures::trie - - - - - -Node3 - - -std::shared_ptr< data -_structures::trie > - - - - - -Node1->Node3 - - - ptr - - - -Node2 - - -std::shared_ptr< data -_structures::trie >, - NUM_CHARS<< 1 > - - - - - -Node2->Node1 - - - arr - - - -Node3->Node2 - - - elements - - - 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 d365c940a..cdd4409a8 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,7 +3,7 @@ - + Algorithms_in_C++: range_queries::heavy_light_decomposition::HLD< X > Class Template Reference @@ -42,10 +42,10 @@ - + @@ -242,13 +242,17 @@ template<typename X >
    440  h_parent.resize(Tree<X>::t_nodes);
    441  iota(h_parent.begin(), h_parent.end(), 0);
    442  }
    -
    -Here is the call graph for this function:
    -
    -
    -
    -
    - +
    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::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)
    +
    std::vector::resize
    T resize(T... args)
    +

    Member Function Documentation

    @@ -316,7 +320,19 @@ template<typename X >
    425  }
    426  return ret;
    427  }
    - +
    range_queries::heavy_light_decomposition::SG::query
    X query(int l, int r)
    Make a range query from node label l to node label r.
    Definition: heavy_light_decomposition.cpp:305
    +
    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::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_par
    std::vector< std::vector< int > > t_par
    a matrix to store every node's 2^kth parent
    Definition: heavy_light_decomposition.cpp:87
    +
    std::swap
    T swap(T... args)
    +
    +Here is the call graph for this function:
    +
    +
    +
    +
    + @@ -377,6 +393,9 @@ template<typename X >
    360  }
    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::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
    @@ -436,6 +455,7 @@ template<typename X >
    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
    @@ -495,6 +515,7 @@ template<typename X >
    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
    @@ -543,6 +564,10 @@ template<typename X >
    465  SG<X>::combine(SG<X>::s_tree[i << 1], SG<X>::s_tree[i << 1 | 1]);
    466  }
    467  }
    +
    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::Tree::t_val
    std::vector< X > t_val
    values of nodes
    Definition: heavy_light_decomposition.cpp:92
    +
    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::init
    void init()
    This function must be called after the tree adjacency list and node values are populated The function...
    Definition: heavy_light_decomposition.cpp:186
    Here is the call graph for this function:
    @@ -605,10 +630,12 @@ template<typename X >
    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::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:
    -
    +
    @@ -664,6 +691,9 @@ template<typename X >
    477  SG<X>::update(h_label[node], diff);
    478  Tree<X>::t_val[node] = val;
    479  }
    +
    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
    struct list node
    +
    node
    Definition: avltree.cpp:13
    Here is the call graph for this function:
    @@ -678,41 +708,11 @@ Here is the call graph for this function:
    -
    std::vector::resize
    T resize(T... args)
    -
    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::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_root
    int t_root
    the root of the tree
    Definition: heavy_light_decomposition.cpp:91
    -
    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
    -
    range_queries::heavy_light_decomposition::Tree::init
    void init()
    This function must be called after the tree adjacency list and node values are populated The function...
    Definition: heavy_light_decomposition.cpp:186
    -
    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
    -
    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
    -
    node
    Definition: avltree.cpp:13
    -
    node
    struct list node
    -
    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::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::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::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::Tree::t_nodes
    const int t_nodes
    number of nodes
    Definition: heavy_light_decomposition.cpp:84
    -
    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::label
    int label
    utility member to assign labels in dfs_labels()
    Definition: heavy_light_decomposition.cpp:338
    -
    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
    -
    std::swap
    T swap(T... args)
    -
    range_queries::heavy_light_decomposition::SG::query
    X query(int l, int r)
    Make a range query from node label l to node label r.
    Definition: heavy_light_decomposition.cpp:305
    -
    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::Tree::t_val
    std::vector< X > t_val
    values of nodes
    Definition: heavy_light_decomposition.cpp:92
    -
    std::vector::begin
    T begin(T... args)
    -
    std::iota
    T iota(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
    -
    std::vector::assign
    T assign(T... args)
    -
    std::vector::end
    T end(T... args)
    -
    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_depth
    std::vector< int > t_depth
    a vector to store the depth of a node,
    Definition: heavy_light_decomposition.cpp:88
    diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.map b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.map index 12d8dfe45..8de16c9b9 100644 --- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.map +++ b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.map @@ -1,6 +1,8 @@ - - - - + + + + + + diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.md5 b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.md5 index 5b3bea922..65e41d002 100644 --- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.md5 +++ b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.md5 @@ -1 +1 @@ -613b4ed02f561c3092a9d717650d147e \ No newline at end of file +9eb1b8f566ba7296adde69481e80634e \ No newline at end of file diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.svg index 24ff9e4fe..8bbb4418b 100644 --- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.svg +++ b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.svg @@ -4,11 +4,11 @@ - - + + range_queries::heavy_light_decomposition::HLD::query - + Node1 @@ -37,10 +37,10 @@ - - -Node3 - + + +Node5 + range_queries::heavy _light_decomposition @@ -48,16 +48,48 @@ - - -Node1->Node3 + + +Node1->Node5 + + +Node3 + + +range_queries::heavy +_light_decomposition +::SG::combine + + + + + +Node2->Node3 + + + Node4 - + + +std::swap + + + + + +Node2->Node4 + + + + + +Node6 + range_queries::heavy _light_decomposition @@ -65,9 +97,9 @@ - - -Node3->Node4 + + +Node5->Node6 diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a6e486767434e44076c1ac374a22da726_cgraph.md5 b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a6e486767434e44076c1ac374a22da726_cgraph.md5 deleted file mode 100644 index 8b70df609..000000000 --- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a6e486767434e44076c1ac374a22da726_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -1bc573c2c35f81f7d068d1ef8f03da9f \ No newline at end of file diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a6e486767434e44076c1ac374a22da726_cgraph.map b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.map similarity index 62% rename from d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a6e486767434e44076c1ac374a22da726_cgraph.map rename to d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.map index daceec39c..66944ec58 100644 --- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a6e486767434e44076c1ac374a22da726_cgraph.map +++ b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.map @@ -1,5 +1,5 @@ - - + + diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.md5 b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.md5 new file mode 100644 index 000000000..7ffbccde8 --- /dev/null +++ b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.md5 @@ -0,0 +1 @@ +54cc5e12cc180e9cff3739e3cfb42a20 \ No newline at end of file diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a6e486767434e44076c1ac374a22da726_cgraph.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.svg similarity index 88% rename from d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a6e486767434e44076c1ac374a22da726_cgraph.svg rename to d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.svg index d2a40a07a..4dcab172c 100644 --- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a6e486767434e44076c1ac374a22da726_cgraph.svg +++ b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.svg @@ -3,20 +3,20 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - + -range_queries::heavy_light_decomposition::HLD::HLD +range_queries::heavy_light_decomposition::HLD::chain_query Node1 - + range_queries::heavy _light_decomposition -::HLD::HLD +::HLD::chain_query @@ -40,7 +40,7 @@ Node3 - + std::swap diff --git a/d2/dc4/classstack__linked_list.html b/d2/dc4/classstack__linked_list.html index 566e9b7fc..85c8813d5 100644 --- a/d2/dc4/classstack__linked_list.html +++ b/d2/dc4/classstack__linked_list.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: stack_linkedList Class Reference @@ -42,10 +42,10 @@ - + @@ -135,7 +135,7 @@ Public Attributes diff --git a/d2/dcf/namespacestatistics.html b/d2/dcf/namespacestatistics.html index 875ab312f..fdbe11c39 100644 --- a/d2/dcf/namespacestatistics.html +++ b/d2/dcf/namespacestatistics.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: statistics Namespace Reference @@ -42,10 +42,10 @@ - + @@ -115,7 +115,7 @@ Classes diff --git a/d2/de3/structlinear__probing_1_1_entry-members.html b/d2/de3/structlinear__probing_1_1_entry-members.html index ffa1e540d..7c50b16cc 100644 --- a/d2/de3/structlinear__probing_1_1_entry-members.html +++ b/d2/de3/structlinear__probing_1_1_entry-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -104,7 +104,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 846fb030f..04ce1894e 100644 --- a/d2/de7/namespacerunge__kutta.html +++ b/d2/de7/namespacerunge__kutta.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: runge_kutta Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,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 530b07d26..c56309ac1 100644 --- a/d2/de9/heavy__light__decomposition_8cpp.html +++ b/d2/de9/heavy__light__decomposition_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: range_queries/heavy_light_decomposition.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -191,6 +191,9 @@ Functions
    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
    Here is the call graph for this function:
    @@ -262,6 +265,11 @@ Here is the call graph for this function:
    541  }
    542  std::cout << "\nTest 1 passed!\n";
    543 }
    + +
    range_queries::heavy_light_decomposition::HLD
    The Heavy-Light Decomposition class.
    Definition: heavy_light_decomposition.cpp:336
    +
    std::vector::push_back
    T push_back(T... args)
    +
    std::vector::size
    T size(T... args)
    +
    Here is the call graph for this function:
    @@ -413,19 +421,11 @@ Here is the call graph for this function:
    -
    test_3
    static void test_3()
    Definition: heavy_light_decomposition.cpp:592
    -
    std::vector
    STL class.
    -
    std::vector::size
    T size(T... args)
    -
    test_2
    static void test_2()
    Definition: heavy_light_decomposition.cpp:549
    -
    range_queries::heavy_light_decomposition::HLD
    The Heavy-Light Decomposition class.
    Definition: heavy_light_decomposition.cpp:336
    -
    std::vector::push_back
    T push_back(T... args)
    - -
    test_1
    static void test_1()
    Definition: heavy_light_decomposition.cpp:505
    diff --git a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.map b/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.map index 6208968c2..bed95988b 100644 --- a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.map +++ b/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.map @@ -1,21 +1,22 @@ - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + diff --git a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.md5 b/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.md5 index 570cab002..a154e7f06 100644 --- a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.md5 +++ b/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.md5 @@ -1 +1 @@ -fdf2e1d607d6492ec2d0cd82c3962d4f \ No newline at end of file +cea68cd36fea8bb76f95ea310e1e65fc \ No newline at end of file diff --git a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg b/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg index 5d7bd7807..e75668c4f 100644 --- a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg +++ b/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg @@ -4,7 +4,7 @@ - + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -data_structures::tree_234::Tree234::InsertPreSplit - - - -Node1 - - -data_structures::tree -_234::Tree234::InsertPreSplit - - - - - -Node2 - - -std::unique_ptr::get - - - - - -Node1->Node2 - - - - - -Node3 - - -data_structures::tree -_234::Tree234::MergeNodeNotFull - - - - - -Node1->Node3 - - - - - -Node9 - - -data_structures::tree -_234::Tree234::SplitNode - - - - - -Node1->Node9 - - - - - -Node4 - - -data_structures::tree -_234::Node::InsertItem - - - - - -Node3->Node4 - - - - - -Node7 - - -data_structures::tree -_234::Node::IsFull - - - - - -Node3->Node7 - - - - - -Node8 - - -data_structures::tree -_234::Node::SetChild - - - - - -Node3->Node8 - - - - - -Node5 - - -data_structures::tree -_234::Node::Contains - - - - - -Node4->Node5 - - - - - -Node6 - - -data_structures::tree -_234::Node::InsertItemByIndex - - - - - -Node4->Node6 - - - - - -Node4->Node7 - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph_org.svg deleted file mode 100644 index c1366aea5..000000000 --- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph_org.svg +++ /dev/null @@ -1,156 +0,0 @@ - - - - - - -data_structures::tree_234::Tree234::InsertPreSplit - - - -Node1 - - -data_structures::tree -_234::Tree234::InsertPreSplit - - - - - -Node2 - - -std::unique_ptr::get - - - - - -Node1->Node2 - - - - - -Node3 - - -data_structures::tree -_234::Tree234::MergeNodeNotFull - - - - - -Node1->Node3 - - - - - -Node9 - - -data_structures::tree -_234::Tree234::SplitNode - - - - - -Node1->Node9 - - - - - -Node4 - - -data_structures::tree -_234::Node::InsertItem - - - - - -Node3->Node4 - - - - - -Node7 - - -data_structures::tree -_234::Node::IsFull - - - - - -Node3->Node7 - - - - - -Node8 - - -data_structures::tree -_234::Node::SetChild - - - - - -Node3->Node8 - - - - - -Node5 - - -data_structures::tree -_234::Node::Contains - - - - - -Node4->Node5 - - - - - -Node6 - - -data_structures::tree -_234::Node::InsertItemByIndex - - - - - -Node4->Node6 - - - - - -Node4->Node7 - - - - - diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.svg index 868814eff..91e93c738 100644 --- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.svg +++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.svg @@ -48,7 +48,7 @@ if (edges && edges.length) { - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - @@ -114,7 +114,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 5623c04ea..bd9ff5a0a 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,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -104,7 +104,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 c0f923d4c..a134cd2e9 100644 --- a/d3/da1/namespacen__queens.html +++ b/d3/da1/namespacen__queens.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: n_queens Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,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 3507a45cc..58a5ecd15 100644 --- a/d3/da3/classstatistics_1_1stats__computer2-members.html +++ b/d3/da3/classstatistics_1_1stats__computer2-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -111,7 +111,7 @@ $(document).ready(function(){initNavTree('d8/dab/classstatistics_1_1stats__compu diff --git a/d3/db0/namespacelinked__list.html b/d3/db0/namespacelinked__list.html index 2b282cc6f..ea7d32aba 100644 --- a/d3/db0/namespacelinked__list.html +++ b/d3/db0/namespacelinked__list.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: linked_list Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d3/db0/namespacelinked__list.html','.. diff --git a/d3/db7/graph_2dijkstra_8cpp__incl.map b/d3/db7/graph_2dijkstra_8cpp__incl.map index a22267031..5df0cbf3a 100644 --- a/d3/db7/graph_2dijkstra_8cpp__incl.map +++ b/d3/db7/graph_2dijkstra_8cpp__incl.map @@ -1,5 +1,5 @@ - + diff --git a/d3/db7/graph_2dijkstra_8cpp__incl.md5 b/d3/db7/graph_2dijkstra_8cpp__incl.md5 index 5d08138a0..38184ac19 100644 --- a/d3/db7/graph_2dijkstra_8cpp__incl.md5 +++ b/d3/db7/graph_2dijkstra_8cpp__incl.md5 @@ -1 +1 @@ -9d5ffd57234ed37b1fc971d51b97e81e \ No newline at end of file +ec117a00574e4a1581d2506b5430f593 \ No newline at end of file diff --git a/d3/db7/graph_2dijkstra_8cpp__incl.svg b/d3/db7/graph_2dijkstra_8cpp__incl.svg index a7f12395d..e8b175c71 100644 --- a/d3/db7/graph_2dijkstra_8cpp__incl.svg +++ b/d3/db7/graph_2dijkstra_8cpp__incl.svg @@ -12,7 +12,7 @@ Node1 - + graph/dijkstra.cpp diff --git a/d3/dbb/class_cycle_check.html b/d3/dbb/class_cycle_check.html index 81f06f066..92b9387d6 100644 --- a/d3/dbb/class_cycle_check.html +++ b/d3/dbb/class_cycle_check.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: CycleCheck Class Reference @@ -42,10 +42,10 @@ - + @@ -109,9 +109,9 @@ Static Public Member Functions -

    Private Types

    enum  nodeStates : uint8_t { not_visited = 0, -in_stack, -visited +
    enum  nodeStates : uint8_t { not_visited = 0 +, in_stack +, visited }
     
    @@ -210,6 +210,15 @@ Static Private Member Functions
    296  // there is a cycle and return true, else return false.
    297  return !(remain == 0);
    298  }
    +
    std::queue::emplace
    T emplace(T... args)
    +
    std::queue::empty
    T empty(T... args)
    +
    std::queue::front
    T front(T... args)
    +
    graph
    Graph Algorithms.
    +
    std::queue::pop
    T pop(T... args)
    + +
    list
    Definition: list_array.cpp:9
    +
    node
    Definition: avltree.cpp:13
    +
    Here is the call graph for this function:
    @@ -283,6 +292,7 @@ Here is the call graph for this function:
    238  // the graph. Return false.
    239  return false;
    240  }
    +
    CycleCheck::isCyclicDFSHelper
    static bool isCyclicDFSHelper(AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node)
    Definition: cycle_check_directed_graph.cpp:170
    Here is the call graph for this function:
    @@ -372,6 +382,7 @@ Here is the call graph for this function:
    200  // Return that current node didn't result in any cycles.
    201  return false;
    202  }
    +
    node
    struct list node
    Here is the call graph for this function:
    @@ -386,22 +397,11 @@ Here is the call graph for this function:
    - -
    std::queue::emplace
    T emplace(T... args)
    -
    node
    Definition: avltree.cpp:13
    -
    node
    struct list node
    -
    std::queue
    STL class.
    -
    std::queue::front
    T front(T... args)
    -
    CycleCheck::isCyclicDFSHelper
    static bool isCyclicDFSHelper(AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node)
    Definition: cycle_check_directed_graph.cpp:170
    -
    std::queue::pop
    T pop(T... args)
    -
    graph
    Graph Algorithms.
    -
    std::queue::empty
    T empty(T... args)
    -
    list
    Definition: list_array.cpp:9
    diff --git a/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg b/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg index 5cde7c00c..13c290984 100644 --- a/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg +++ b/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::map::end @@ -36,7 +36,7 @@ Node3 - + std::map::find diff --git a/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.svg b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.svg index 36f39f6aa..0a272eb38 100644 --- a/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.svg +++ b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::queue::emplace @@ -36,7 +36,7 @@ Node3 - + std::queue::empty @@ -51,7 +51,7 @@ Node4 - + std::queue::front @@ -66,7 +66,7 @@ Node5 - + std::queue::pop diff --git a/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.svg b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.svg index 8f83cdd2a..7f75687db 100644 --- a/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.svg +++ b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::map::end @@ -51,7 +51,7 @@ Node4 - + std::map::find diff --git a/d3/dc9/namespacefibonacci__sum.html b/d3/dc9/namespacefibonacci__sum.html index ed98d1f9a..b24ad3ce7 100644 --- a/d3/dc9/namespacefibonacci__sum.html +++ b/d3/dc9/namespacefibonacci__sum.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: fibonacci_sum Namespace Reference @@ -42,10 +42,10 @@
    - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d3/dc9/namespacefibonacci__sum.html',' diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp.html b/d3/dce/linkedlist__implentation__usingarray_8cpp.html index 7fe2c4761..983be33db 100644 --- a/d3/dce/linkedlist__implentation__usingarray_8cpp.html +++ b/d3/dce/linkedlist__implentation__usingarray_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: data_structures/linkedlist_implentation_usingarray.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -174,6 +174,7 @@ int avail = 0 43  AvailArray[nodeToBeDeleted].next = avail;
    44  avail = nodeToBeDeleted;
    45 }
    +
    AvailArray
    Node AvailArray[100]
    array that will act as nodes of a linked list.
    Definition: linkedlist_implentation_usingarray.cpp:19
    @@ -222,6 +223,8 @@ int avail = 0 53  AvailArray[newNode].next = head;
    54  head = newNode;
    55 }
    +
    data
    int data[MAX]
    test data
    Definition: hash_search.cpp:24
    +
    getnode
    int getnode()
    Definition: linkedlist_implentation_usingarray.cpp:32
    Here is the call graph for this function:
    @@ -283,23 +286,20 @@ Here is the call graph for this function:
    112 
    113  return 0;
    114 }
    + + +
    std::endl
    T endl(T... args)
    +
    insertAtTheBeginning
    void insertAtTheBeginning(int data)
    Definition: linkedlist_implentation_usingarray.cpp:50
    - -
    insertAtTheBeginning
    void insertAtTheBeginning(int data)
    Definition: linkedlist_implentation_usingarray.cpp:50
    -
    getnode
    int getnode()
    Definition: linkedlist_implentation_usingarray.cpp:32
    -
    data
    int data[MAX]
    test data
    Definition: hash_search.cpp:24
    -
    std::endl
    T endl(T... args)
    - -
    AvailArray
    Node AvailArray[100]
    array that will act as nodes of a linked list.
    Definition: linkedlist_implentation_usingarray.cpp:19
    diff --git a/d3/de4/classrange__queries_1_1heavy__light__decomposition_1_1_s_g-members.html b/d3/de4/classrange__queries_1_1heavy__light__decomposition_1_1_s_g-members.html index 476159b3a..d172165a2 100644 --- a/d3/de4/classrange__queries_1_1heavy__light__decomposition_1_1_s_g-members.html +++ b/d3/de4/classrange__queries_1_1heavy__light__decomposition_1_1_s_g-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -111,7 +111,7 @@ $(document).ready(function(){initNavTree('d9/d35/classrange__queries_1_1heavy__l diff --git a/d3/deb/namespaceshortest__common__supersequence.html b/d3/deb/namespaceshortest__common__supersequence.html index 026fbcb8e..eb9bd565b 100644 --- a/d3/deb/namespaceshortest__common__supersequence.html +++ b/d3/deb/namespaceshortest__common__supersequence.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: shortest_common_supersequence Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d3/deb/namespaceshortest__common__supe diff --git a/d3/dfe/horspool_8cpp.html b/d3/dfe/horspool_8cpp.html index 164b7695b..e20727c76 100644 --- a/d3/dfe/horspool_8cpp.html +++ b/d3/dfe/horspool_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: strings/horspool.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -183,6 +183,12 @@ Functions
    48  }
    49  return shiftTable;
    50 }
    +
    std::unordered_map::end
    T end(T... args)
    +
    std::unordered_map::find
    T find(T... args)
    +
    std::unordered_map::insert
    T insert(T... args)
    +
    std::make_pair
    T make_pair(T... args)
    +
    std::string::size
    T size(T... args)
    +
    Here is the call graph for this function:
    @@ -261,6 +267,7 @@ false if text string does not contain prototype string
    90  }
    91  return false;
    92 }
    +
    strings::horspool::findShiftTable
    std::unordered_map< char, int > findShiftTable(const std::string &prototype)
    Definition: horspool.cpp:26
    Here is the call graph for this function:
    @@ -292,6 +299,7 @@ Here is the call graph for this function:
    120  test();
    121  return 0;
    122 }
    +
    test
    static void test()
    Function with test cases for Horspool's algorithm.
    Definition: horspool.cpp:100
    Here is the call graph for this function:
    @@ -345,19 +353,11 @@ Here is the call graph for this function:
    -
    std::unordered_map::find
    T find(T... args)
    -
    std::string::size
    T size(T... args)
    -
    test
    static void test()
    Function with test cases for Horspool's algorithm.
    Definition: horspool.cpp:100
    -
    std::unordered_map::insert
    T insert(T... args)
    -
    std::make_pair
    T make_pair(T... args)
    -
    std::unordered_map::end
    T end(T... args)
    - -
    strings::horspool::findShiftTable
    std::unordered_map< char, int > findShiftTable(const std::string &prototype)
    Definition: horspool.cpp:26
    diff --git a/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.map b/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.map index f0f5b5899..bb5f85794 100644 --- a/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.map +++ b/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.map @@ -3,8 +3,8 @@ - + - +     diff --git a/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.md5 b/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.md5 index 73b342ce1..51357ce65 100644 --- a/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.md5 +++ b/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.md5 @@ -1 +1 @@ -d7858d7e2d01fa215744094935e9f9d3 \ No newline at end of file +30c82e4aaab042f9cffa5fd8169e2d96 \ No newline at end of file diff --git a/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.svg b/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.svg index 964cef068..0ab3d3d69 100644 --- a/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.svg +++ b/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::unordered_map::end @@ -37,7 +37,7 @@ Node3 - + std::unordered_map ::find @@ -66,18 +66,18 @@ - - -Node7 - + + +Node8 + std::string::size - + -Node1->Node7 +Node1->Node8 @@ -102,7 +102,7 @@ Node5 - + std::unordered_map ::insert @@ -118,7 +118,7 @@ Node6 - + std::make_pair @@ -130,27 +130,27 @@ - - -Node4->Node7 - - - - - -Node8 - + + +Node7 + std::unordered_map ::size - - -Node4->Node8 + + +Node4->Node7 + + +Node4->Node8 + + + diff --git a/d3/dfe/horspool_8cpp_ad352e3be28a6d9f2d1b2f32ce9c729b9_cgraph.map b/d3/dfe/horspool_8cpp_ad352e3be28a6d9f2d1b2f32ce9c729b9_cgraph.map index b6b3501d9..e4ea6cdef 100644 --- a/d3/dfe/horspool_8cpp_ad352e3be28a6d9f2d1b2f32ce9c729b9_cgraph.map +++ b/d3/dfe/horspool_8cpp_ad352e3be28a6d9f2d1b2f32ce9c729b9_cgraph.map @@ -4,6 +4,6 @@ - - + + diff --git a/d3/dfe/horspool_8cpp_ad352e3be28a6d9f2d1b2f32ce9c729b9_cgraph.md5 b/d3/dfe/horspool_8cpp_ad352e3be28a6d9f2d1b2f32ce9c729b9_cgraph.md5 index 704db2217..c36b4f4fd 100644 --- a/d3/dfe/horspool_8cpp_ad352e3be28a6d9f2d1b2f32ce9c729b9_cgraph.md5 +++ b/d3/dfe/horspool_8cpp_ad352e3be28a6d9f2d1b2f32ce9c729b9_cgraph.md5 @@ -1 +1 @@ -503f022c4f648f4b2989ead4c50b2222 \ No newline at end of file +f810862bbaf8da6721278b2b5a8cd236 \ No newline at end of file diff --git a/d3/dfe/horspool_8cpp_ad352e3be28a6d9f2d1b2f32ce9c729b9_cgraph.svg b/d3/dfe/horspool_8cpp_ad352e3be28a6d9f2d1b2f32ce9c729b9_cgraph.svg index e198f2781..b08776dff 100644 --- a/d3/dfe/horspool_8cpp_ad352e3be28a6d9f2d1b2f32ce9c729b9_cgraph.svg +++ b/d3/dfe/horspool_8cpp_ad352e3be28a6d9f2d1b2f32ce9c729b9_cgraph.svg @@ -5,118 +5,118 @@ --> - + viewBox="0.00 0.00 264.00 253.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> + strings::horspool::findShiftTable - + Node1 - -strings::horspool:: -findShiftTable + +strings::horspool:: +findShiftTable Node1->Node1 - - + + Node2 - - -std::unordered_map::end + + +std::unordered_map::end Node1->Node2 - - + + Node3 - - -std::unordered_map -::find + + +std::unordered_map +::find Node1->Node3 - - + + Node4 - - -std::unordered_map -::insert + + +std::unordered_map +::insert Node1->Node4 - - + + Node5 - - -std::make_pair + + +std::make_pair Node1->Node5 - - + + Node6 - - -std::string::size + + +std::unordered_map +::size Node1->Node6 - - + + Node7 - - -std::unordered_map -::size + + +std::string::size Node1->Node7 - - + + diff --git a/d4/d0f/namespacegram__schmidt.html b/d4/d0f/namespacegram__schmidt.html index 930a67540..de3d5935c 100644 --- a/d4/d0f/namespacegram__schmidt.html +++ b/d4/d0f/namespacegram__schmidt.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: gram_schmidt Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d4/d0f/namespacegram__schmidt.html','. diff --git a/d4/d13/namespacebidirectional__dijkstra.html b/d4/d13/namespacebidirectional__dijkstra.html index b1237594b..778028351 100644 --- a/d4/d13/namespacebidirectional__dijkstra.html +++ b/d4/d13/namespacebidirectional__dijkstra.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: bidirectional_dijkstra Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d4/d13/namespacebidirectional__dijkstr diff --git a/d4/d1f/class_min_heap-members.html b/d4/d1f/class_min_heap-members.html index c9fc1ba21..c45481fdb 100644 --- a/d4/d1f/class_min_heap-members.html +++ b/d4/d1f/class_min_heap-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -116,7 +116,7 @@ $(document).ready(function(){initNavTree('d2/d05/class_min_heap.html','../../'); diff --git a/d4/d21/least__common__multiple_8cpp.html b/d4/d21/least__common__multiple_8cpp.html index 613e51958..e27d76247 100644 --- a/d4/d21/least__common__multiple_8cpp.html +++ b/d4/d21/least__common__multiple_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/least_common_multiple.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -167,6 +167,7 @@ Functions
    34  unsigned int temp = y / x;
    35  return gcd(x, y - temp * x);
    36 }
    +
    gcd
    unsigned int gcd(unsigned int x, unsigned int y)
    Definition: least_common_multiple.cpp:16
    @@ -228,6 +229,7 @@ Here is the call graph for this function:
    79  tests();
    80  return 0;
    81 }
    +
    tests
    void tests()
    Definition: least_common_multiple.cpp:50
    Here is the call graph for this function:
    @@ -276,6 +278,9 @@ Here is the call graph for this function:
    71  << lcm(987654321, 987654321)
    72  << std::endl;
    73 }
    + +
    std::endl
    T endl(T... args)
    +
    lcm
    unsigned int lcm(unsigned int x, unsigned int y)
    Definition: least_common_multiple.cpp:43
    Here is the call graph for this function:
    @@ -287,16 +292,11 @@ Here is the call graph for this function:
    -
    lcm
    unsigned int lcm(unsigned int x, unsigned int y)
    Definition: least_common_multiple.cpp:43
    -
    tests
    void tests()
    Definition: least_common_multiple.cpp:50
    - -
    gcd
    unsigned int gcd(unsigned int x, unsigned int y)
    Definition: least_common_multiple.cpp:16
    -
    std::endl
    T endl(T... args)
    diff --git a/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg index c5d1ed014..db920558d 100644 --- a/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg +++ b/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index adc315e02..b4625cc82 100644 --- a/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::endl diff --git a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map index 37d4f7588..f2f4527c5 100644 --- a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map +++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map @@ -1,4 +1,4 @@ - - + + diff --git a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5 b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5 index 05d715f1d..f2a00cfba 100644 --- a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5 +++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5 @@ -1 +1 @@ -74497ecf7a62d095740c708c17c6e7ae \ No newline at end of file +9dda26383752407f35291cf519219b01 \ No newline at end of file diff --git a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg index e3f1b827e..79b3f116f 100644 --- a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg +++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg @@ -13,34 +13,27 @@ Node1 - -Trie::TrieNode + +Trie::TrieNode Node2 - - -std::shared_ptr< Trie -::TrieNode > + + +std::shared_ptr< Trie +::TrieNode > - - -Node1->Node2 - - - ptr - Node2->Node1 - - - character + + + character diff --git a/d4/d32/fibonacci__fast_8cpp.html b/d4/d32/fibonacci__fast_8cpp.html index 14d83e5a3..8015e12c8 100644 --- a/d4/d32/fibonacci__fast_8cpp.html +++ b/d4/d32/fibonacci__fast_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/fibonacci_fast.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -179,6 +179,7 @@ Functions
    46 
    47  return f2;
    48 }
    + @@ -205,6 +206,8 @@ Functions
    55  }
    56  return 0;
    57 }
    +
    std::endl
    T endl(T... args)
    +
    fib
    uint64_t fib(uint64_t n)
    Definition: fibonacci_fast.cpp:30
    Here is the call graph for this function:
    @@ -216,14 +219,11 @@ Here is the call graph for this function:
    - -
    fib
    uint64_t fib(uint64_t n)
    Definition: fibonacci_fast.cpp:30
    -
    std::endl
    T endl(T... args)
    diff --git a/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 54cc59c68..058948f35 100644 --- a/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d4/d39/group__open__addressing.html b/d4/d39/group__open__addressing.html index 73f3bc061..295f6db5f 100644 --- a/d4/d39/group__open__addressing.html +++ b/d4/d39/group__open__addressing.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Open Addressing @@ -42,10 +42,10 @@ - + @@ -90,32 +90,16 @@ $(document).ready(function(){initNavTree('d4/d39/group__open__addressing.html','
    -
    -Namespaces
    Open Addressing
    - - - - - - - - - - - -

    -Namespaces

     double_hashing
     An implementation of hash table using double hashing algorithm.
     
     linear_probing
     An implementation of hash table using linear probing algorithm.
     
     quadratic_probing
     An implementation of hash table using quadratic probing algorithm.
     
    -

    Detailed Description

    diff --git a/d4/d39/group__open__addressing.js b/d4/d39/group__open__addressing.js deleted file mode 100644 index 099f7d5ff..000000000 --- a/d4/d39/group__open__addressing.js +++ /dev/null @@ -1,6 +0,0 @@ -var group__open__addressing = -[ - [ "double_hashing", "d0/d65/namespacedouble__hashing.html", null ], - [ "linear_probing", "d8/d89/namespacelinear__probing.html", null ], - [ "quadratic_probing", "d4/dd2/namespacequadratic__probing.html", null ] -]; \ No newline at end of file diff --git a/d4/d3e/n__queens_8cpp.html b/d4/d3e/n__queens_8cpp.html index efd4b522f..6e94ad48d 100644 --- a/d4/d3e/n__queens_8cpp.html +++ b/d4/d3e/n__queens_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: backtracking/n_queens.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -244,6 +244,7 @@ template<size_t n>
    127  backtracking::n_queens::solveNQ<n>(board, 0);
    128  return 0;
    129 }
    + @@ -285,6 +286,7 @@ template<size_t n>
    43  std::cout << "\n";
    44  }
    45  }
    + @@ -361,13 +363,11 @@ Here is the call graph for this function: - -
    std::array
    STL class.
    diff --git a/d4/d45/gcd__recursive__euclidean_8cpp.html b/d4/d45/gcd__recursive__euclidean_8cpp.html index cf02c5c83..558a2d9cc 100644 --- a/d4/d45/gcd__recursive__euclidean_8cpp.html +++ b/d4/d45/gcd__recursive__euclidean_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/gcd_recursive_euclidean.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -168,6 +168,8 @@ Functions
    35  return gcd(num1 - num2, num2);
    36  return gcd(num1, num2 - num1);
    37 }
    + +
    gcd
    int gcd(int num1, int num2)
    Definition: gcd_recursive_euclidean.cpp:14
    @@ -198,6 +200,8 @@ Functions
    50  std::cout << "gcd of 289,204 is " << (gcd(289, 204)) << std::endl;
    51  return 0;
    52 }
    + +
    std::endl
    T endl(T... args)
    Here is the call graph for this function:
    @@ -209,15 +213,11 @@ Here is the call graph for this function:
    - -
    gcd
    int gcd(int num1, int num2)
    Definition: gcd_recursive_euclidean.cpp:14
    - -
    std::endl
    T endl(T... args)
    diff --git a/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index a1d695b48..ed3123117 100644 --- a/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html b/d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html index 056271968..b93c99acb 100644 --- a/d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html +++ b/d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Contributor Covenant Code of Conduct @@ -42,10 +42,10 @@ - + @@ -136,7 +136,7 @@ Attribution diff --git a/d4/d5d/math_2armstrong__number_8cpp.html b/d4/d5d/math_2armstrong__number_8cpp.html index aa2da5b33..743265eee 100644 --- a/d4/d5d/math_2armstrong__number_8cpp.html +++ b/d4/d5d/math_2armstrong__number_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/armstrong_number.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -166,6 +166,9 @@ Functions
    51  }
    52  return number == sum;
    53 }
    +
    number_of_digits
    int number_of_digits(int num)
    Definition: armstrong_number.cpp:21
    +
    machine_learning::sum
    T sum(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:232
    +
    std::pow
    T pow(T... args)
    Here is the call graph for this function:
    @@ -195,6 +198,7 @@ Here is the call graph for this function:
    78  test();
    79  return 0;
    80 }
    +
    test
    void test()
    Definition: armstrong_number.cpp:59
    Here is the call graph for this function:
    @@ -266,6 +270,7 @@ Here is the call graph for this function:
    70  // is_armstrong(12) returns false.
    71  assert(is_armstrong(12) == false);
    72 }
    +
    is_armstrong
    bool is_armstrong(int number)
    Definition: armstrong_number.cpp:36
    Here is the call graph for this function:
    @@ -277,16 +282,11 @@ Here is the call graph for this function:
    -
    number_of_digits
    int number_of_digits(int num)
    Definition: armstrong_number.cpp:21
    -
    is_armstrong
    bool is_armstrong(int number)
    Definition: armstrong_number.cpp:36
    -
    test
    void test()
    Definition: armstrong_number.cpp:59
    -
    machine_learning::sum
    T sum(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:232
    -
    std::pow
    T pow(T... args)
    diff --git a/d4/d5d/math_2armstrong__number_8cpp_a9cebd92bc70890c3cfa261d68a5016e7_cgraph.svg b/d4/d5d/math_2armstrong__number_8cpp_a9cebd92bc70890c3cfa261d68a5016e7_cgraph.svg index a28b1d342..4f4bc1077 100644 --- a/d4/d5d/math_2armstrong__number_8cpp_a9cebd92bc70890c3cfa261d68a5016e7_cgraph.svg +++ b/d4/d5d/math_2armstrong__number_8cpp_a9cebd92bc70890c3cfa261d68a5016e7_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::pow diff --git a/d4/d5d/math_2armstrong__number_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg b/d4/d5d/math_2armstrong__number_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg index 5c6762426..48251e0bf 100644 --- a/d4/d5d/math_2armstrong__number_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg +++ b/d4/d5d/math_2armstrong__number_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg @@ -51,7 +51,7 @@ Node4 - + std::pow diff --git a/d4/d5d/math_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d5d/math_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index c701f127e..8f5f1c802 100644 --- a/d4/d5d/math_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d4/d5d/math_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -66,7 +66,7 @@ Node5 - + std::pow diff --git a/d4/d68/qr__decompose_8h.html b/d4/d68/qr__decompose_8h.html index 18f2952e3..b738418c8 100644 --- a/d4/d68/qr__decompose_8h.html +++ b/d4/d68/qr__decompose_8h.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: numerical_methods/qr_decompose.h File Reference @@ -42,10 +42,10 @@ - + @@ -158,7 +158,7 @@ Functions diff --git a/d4/d68/qr__decompose_8h_source.html b/d4/d68/qr__decompose_8h_source.html index aa0050136..be9c256ca 100644 --- a/d4/d68/qr__decompose_8h_source.html +++ b/d4/d68/qr__decompose_8h_source.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: numerical_methods/qr_decompose.h Source File @@ -42,10 +42,10 @@ - + @@ -303,69 +303,31 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
    207 }
    208 } // namespace qr_algorithm
    209 
    -
    210 #endif // NUMERICAL_METHODS_QR_DECOMPOSE_H_
    +
    210 #endif // NUMERICAL_METHODS_QR_DECOMPOSE_H_
    + +
    std::endl
    T endl(T... args)
    +
    std::right
    T right(T... args)
    +
    machine_learning::sum
    T sum(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:232
    +
    qr_algorithm
    Functions to compute QR decomposition of any rectangular matrix.
    +
    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::operator<<
    std::ostream & operator<<(std::ostream &out, std::valarray< std::valarray< T >> const &v)
    Definition: qr_decompose.h:33
    +
    qr_algorithm::vector_dot
    double vector_dot(const std::valarray< T > &a, const std::valarray< T > &b)
    Definition: qr_decompose.h:76
    +
    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
    +
    qr_algorithm::vector_mag
    double vector_mag(const std::valarray< T > &a)
    Definition: qr_decompose.h:92
    + +
    std::ostream::precision
    T precision(T... args)
    +
    std::setfill
    T setfill(T... args)
    +
    std::setw
    T setw(T... args)
    + +
    std::sqrt
    T sqrt(T... args)
    + -
    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
    -
    std::srand
    T srand(T... args)
    -
    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
    -
    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
    - -
    eq
    static double eq(double i)
    Definition: newton_raphson_method.cpp:29
    -
    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::cos
    T cos(T... args)
    -
    eq_der
    static double eq_der(double i)
    Definition: newton_raphson_method.cpp:39
    -
    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::atof
    T atof(T... args)
    -
    main
    int main(int argc, char *argv[])
    Definition: ode_forward_euler.cpp:189
    -
    std::setfill
    T setfill(T... args)
    -
    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
    -
    std::sqrt
    T sqrt(T... args)
    -
    qr_algorithm
    Functions to compute QR decomposition of any rectangular matrix.
    -
    std::clock
    T clock(T... args)
    -
    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
    -
    EPSILON
    constexpr double EPSILON
    system accuracy limit
    Definition: newton_raphson_method.cpp:20
    -
    qr_algorithm::vector_proj
    std::valarray< T > vector_proj(const std::valarray< T > &a, const std::valarray< T > &b)
    Definition: qr_decompose.h:104
    - -
    std::ofstream
    STL class.
    -
    qr_algorithm::vector_mag
    double vector_mag(const std::valarray< T > &a)
    Definition: qr_decompose.h:92
    -
    MAX_ITERATIONS
    constexpr int16_t MAX_ITERATIONS
    Maximum number of iterations.
    Definition: newton_raphson_method.cpp:21
    -
    std::ofstream::close
    T close(T... args)
    -
    std::perror
    T perror(T... args)
    - -
    std::ofstream::open
    T open(T... args)
    -
    qr_algorithm::operator<<
    std::ostream & operator<<(std::ostream &out, std::valarray< std::valarray< T >> const &v)
    Definition: qr_decompose.h:33
    -
    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
    -
    std::rand
    T rand(T... args)
    -
    problem
    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 differenti...
    Definition: ode_semi_implicit_euler.cpp:53
    -
    std::sin
    T sin(T... args)
    -
    problem
    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 differenti...
    Definition: ode_forward_euler.cpp:54
    -
    std::endl
    T endl(T... args)
    -
    qr_algorithm::vector_dot
    double vector_dot(const std::valarray< T > &a, const std::valarray< T > &b)
    Definition: qr_decompose.h:76
    -
    std::right
    T right(T... args)
    -
    problem
    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 differenti...
    Definition: ode_midpoint_euler.cpp:53
    -
    main
    int main()
    Definition: newton_raphson_method.cpp:44
    -
    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
    -
    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
    -
    main
    int main(int argc, char *argv[])
    Definition: ode_semi_implicit_euler.cpp:189
    - -
    std::time
    T time(T... args)
    -
    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
    -
    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::setw
    T setw(T... args)
    - - -
    std::ofstream::is_open
    T is_open(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
    -
    main
    int main(int argc, char *argv[])
    Definition: ode_midpoint_euler.cpp:192
    -
    std::ostream::precision
    T precision(T... args)
    -
    machine_learning::sum
    T sum(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:232
    -
    std::pow
    T pow(T... args)
    diff --git a/d4/d7a/shell__sort2_8cpp.html b/d4/d7a/shell__sort2_8cpp.html index 2462fec25..0fe5ff6a7 100644 --- a/d4/d7a/shell__sort2_8cpp.html +++ b/d4/d7a/shell__sort2_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: sorting/shell_sort2.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -272,6 +272,20 @@ template<typename T >
    232  delete[] data;
    233  return 0;
    234 }
    +
    std::atoi
    T atoi(T... args)
    + +
    std::clock
    T clock(T... args)
    + +
    std::end
    T end(T... args)
    +
    std::endl
    T endl(T... args)
    +
    data
    int data[MAX]
    test data
    Definition: hash_search.cpp:24
    +
    sorting::shell_sort
    void shell_sort(std::vector< T > *arr)
    Definition: shell_sort2.cpp:75
    +
    std::rand
    T rand(T... args)
    +
    test_f
    void test_f(const int NUM_DATA)
    Definition: shell_sort2.cpp:145
    +
    test_int
    void test_int(const int NUM_DATA)
    Definition: shell_sort2.cpp:105
    +
    show_data
    void show_data(T *arr, size_t LEN)
    Definition: shell_sort2.cpp:18
    +
    std::srand
    T srand(T... args)
    +
    std::time
    T time(T... args)
    Here is the call graph for this function:
    @@ -420,6 +434,8 @@ Here is the call graph for this function:
    178  delete[] data;
    179  delete[] data2;
    180 }
    +
    std::qsort
    T qsort(T... args)
    +
    compare
    Definition: huffman.cpp:28
    Here is the call graph for this function:
    @@ -491,27 +507,11 @@ Here is the call graph for this function:
    -
    std::srand
    T srand(T... args)
    -
    test_f
    void test_f(const int NUM_DATA)
    Definition: shell_sort2.cpp:145
    -
    show_data
    void show_data(T *arr, size_t LEN)
    Definition: shell_sort2.cpp:18
    - -
    std::clock
    T clock(T... args)
    -
    test_int
    void test_int(const int NUM_DATA)
    Definition: shell_sort2.cpp:105
    - -
    std::atoi
    T atoi(T... args)
    -
    std::qsort
    T qsort(T... args)
    -
    std::rand
    T rand(T... args)
    -
    data
    int data[MAX]
    test data
    Definition: hash_search.cpp:24
    -
    std::endl
    T endl(T... args)
    -
    compare
    Definition: huffman.cpp:28
    -
    std::time
    T time(T... args)
    -
    std::end
    T end(T... args)
    -
    sorting::shell_sort
    void shell_sort(std::vector< T > *arr)
    Definition: shell_sort2.cpp:75
    diff --git a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg index a2a17822d..65d1b080a 100644 --- a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg +++ b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::clock @@ -36,7 +36,7 @@ Node3 - + std::endl @@ -51,7 +51,7 @@ Node4 - + std::rand @@ -96,7 +96,7 @@ Node10 - + std::srand @@ -141,7 +141,7 @@ Node14 - + std::time @@ -156,7 +156,7 @@ Node6 - + std::vector::data @@ -186,7 +186,7 @@ Node8 - + std::vector::size @@ -225,7 +225,7 @@ Node12 - + std::qsort diff --git a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg index baf6ffa16..9d61b1a11 100644 --- a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg +++ b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::clock @@ -36,7 +36,7 @@ Node3 - + std::qsort @@ -51,7 +51,7 @@ Node4 - + std::rand @@ -81,7 +81,7 @@ Node6 - + std::vector::data @@ -111,7 +111,7 @@ Node8 - + std::vector::size diff --git a/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg index 12f47af86..338b291d7 100644 --- a/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg +++ b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::endl diff --git a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg index f5a114dad..e7f71b6d1 100644 --- a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg +++ b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::clock @@ -36,7 +36,7 @@ Node3 - + std::qsort @@ -51,7 +51,7 @@ Node4 - + std::rand @@ -81,7 +81,7 @@ Node6 - + std::vector::data @@ -111,7 +111,7 @@ Node8 - + std::vector::size diff --git a/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg index c55d315f9..613f5ac31 100644 --- a/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg +++ b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d4/d83/sum__of__digits_8cpp.html b/d4/d83/sum__of__digits_8cpp.html index 0db4875cd..58e5d9f75 100644 --- a/d4/d83/sum__of__digits_8cpp.html +++ b/d4/d83/sum__of__digits_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/sum_of_digits.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -146,6 +146,9 @@ Functions
    70  std::cout << "Success." << std::endl;
    71  return 0;
    72 }
    + +
    std::endl
    T endl(T... args)
    +
    test
    void test()
    Definition: sum_of_digits.cpp:58
    Here is the call graph for this function:
    @@ -190,6 +193,7 @@ Here is the call graph for this function:
    32  }
    33  return sum;
    34 }
    +
    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:
    @@ -220,6 +224,8 @@ Here is the call graph for this function:
    61  // Second test.
    62  test2();
    63 }
    +
    test2
    void test2()
    Definition: sum_of_digits.cpp:49
    +
    test1
    void test1()
    Definition: sum_of_digits.cpp:40
    Here is the call graph for this function:
    @@ -248,6 +254,7 @@ Here is the call graph for this function:
    41  int test_case_1 = sum_of_digits(119765);
    42  assert(test_case_1 == 29);
    43 }
    +
    sum_of_digits
    int sum_of_digits(int num)
    Definition: sum_of_digits.cpp:23
    Here is the call graph for this function:
    @@ -287,18 +294,11 @@ Here is the call graph for this function:
    -
    test
    void test()
    Definition: sum_of_digits.cpp:58
    -
    test2
    void test2()
    Definition: sum_of_digits.cpp:49
    - -
    std::endl
    T endl(T... args)
    -
    sum_of_digits
    int sum_of_digits(int num)
    Definition: sum_of_digits.cpp:23
    -
    test1
    void test1()
    Definition: sum_of_digits.cpp:40
    -
    machine_learning::sum
    T sum(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:232
    diff --git a/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 6fa31826b..9b3d0a35e 100644 --- a/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d4/d86/large__number_8h.html b/d4/d86/large__number_8h.html index c5b8293c4..9fc68a904 100644 --- a/d4/d86/large__number_8h.html +++ b/d4/d86/large__number_8h.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/large_number.h File Reference @@ -42,10 +42,10 @@ - + @@ -135,7 +135,7 @@ Classes diff --git a/d4/d86/large__number_8h_source.html b/d4/d86/large__number_8h_source.html index eaf9da662..31e15aa71 100644 --- a/d4/d86/large__number_8h_source.html +++ b/d4/d86/large__number_8h_source.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/large_number.h Source File @@ -42,10 +42,10 @@ - + @@ -381,137 +381,42 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
    285  _digits; /**< where individual digits are stored */
    286 };
    287 
    -
    288 #endif // MATH_LARGE_NUMBER_H_
    +
    288 #endif // MATH_LARGE_NUMBER_H_
    + +
    large_number
    Definition: large_number.h:24
    +
    large_number::large_number
    large_number(const large_number &a)
    Definition: large_number.h:48
    +
    large_number::large_number
    large_number()
    Definition: large_number.h:27
    +
    large_number::multiply
    void multiply(const T n)
    Definition: large_number.h:258
    +
    large_number::add_digit
    void add_digit(unsigned int value)
    Definition: large_number.h:118
    +
    large_number::operator++
    large_number & operator++()
    Definition: large_number.h:175
    +
    large_number::operator+
    friend large_number & operator+(const large_number &a, const T &b)
    Definition: large_number.h:220
    +
    large_number::operator!=
    friend bool operator!=(large_number const &a, large_number const &b)
    Definition: large_number.h:168
    +
    large_number::large_number
    large_number(std::vector< unsigned char > &vec)
    Definition: large_number.h:51
    +
    large_number::operator<<
    friend std::ostream & operator<<(std::ostream &out, const large_number &a)
    Definition: large_number.h:146
    +
    large_number::operator==
    friend bool operator==(large_number const &a, large_number const &b)
    Definition: large_number.h:155
    +
    large_number::test
    static bool test()
    Definition: large_number.h:65
    +
    large_number::operator*=
    large_number & operator*=(const T n)
    Definition: large_number.h:238
    +
    large_number::num_digits
    size_t num_digits() const
    Definition: large_number.h:130
    +
    large_number::operator+=
    large_number & operator+=(large_number n)
    Definition: large_number.h:192
    +
    large_number::operator++
    large_number & operator++(int)
    Definition: large_number.h:183
    +
    large_number::operator[]
    unsigned char & operator[](size_t n)
    Definition: large_number.h:137
    +
    large_number::digit_char
    char digit_char(size_t i) const
    Definition: large_number.h:248
    +
    large_number::operator=
    large_number & operator=(const large_number &b)
    Definition: large_number.h:229
    +
    large_number::_digits
    std::vector< unsigned char > _digits
    Definition: large_number.h:285
    +
    large_number::large_number
    large_number(int n)
    Definition: large_number.h:39
    +
    std::endl
    T endl(T... args)
    + +
    std::max
    T max(T... args)
    +
    std::vector::push_back
    T push_back(T... args)
    +
    std::vector::size
    T size(T... args)
    + -
    binExpo
    int binExpo(int a, int b)
    Definition: binary_exponent.cpp:28
    -
    large_number::add_digit
    void add_digit(unsigned int value)
    Definition: large_number.h:118
    -
    std::srand
    T srand(T... args)
    -
    main
    int main()
    Definition: double_factorial.cpp:67
    -
    main
    int main()
    Definition: gcd_of_n_numbers.cpp:28
    - -
    test1
    bool test1()
    Definition: large_factorial.cpp:17
    - -
    gcd
    int gcd(int num1, int num2)
    Definition: gcd_iterative_euclidean.cpp:15
    -
    Complex
    Class Complex to represent complex numbers as a field.
    Definition: complex_numbers.cpp:20
    -
    main
    int main()
    Main function.
    Definition: fibonacci.cpp:62
    -
    large_number::operator<<
    friend std::ostream & operator<<(std::ostream &out, const large_number &a)
    Definition: large_number.h:146
    -
    large_number::large_number
    large_number(std::vector< unsigned char > &vec)
    Definition: large_number.h:51
    -
    std::atan2
    T atan2(T... args)
    -
    update_step
    void update_step(T *r, T *r0, const T2 quotient)
    Definition: extended_euclid_algorithm.cpp:24
    -
    test_3
    static void test_3()
    Definition: heavy_light_decomposition.cpp:592
    -
    double_factorial_iterative
    uint64_t double_factorial_iterative(uint64_t n)
    Definition: double_factorial.cpp:17
    -
    std::cos
    T cos(T... args)
    -
    std::vector
    STL class.
    -
    std::vector::size
    T size(T... args)
    -
    test_2
    static void test_2()
    Definition: heavy_light_decomposition.cpp:549
    -
    Complex::arg
    double arg() const
    Member function to give the argument of our complex number.
    Definition: complex_numbers.cpp:87
    -
    ans
    ll ans(ll n)
    Definition: matrix_exponentiation.cpp:91
    -
    Complex::operator*
    Complex operator*(const Complex &other)
    Operator overload of '*' on Complex class. Operator overload to be able to multiple two complex numbe...
    Definition: complex_numbers.cpp:117
    -
    large_number
    Definition: large_number.h:24
    -
    fib
    large_number fib(uint64_t n)
    Definition: fibonacci_large.cpp:24
    -
    main
    int main()
    Definition: fibonacci_fast.cpp:51
    -
    Complex::operator-
    Complex operator-(const Complex &other)
    Operator overload of '-' on Complex class. Operator overload to be able to subtract two complex numbe...
    Definition: complex_numbers.cpp:106
    -
    Complex::Complex
    Complex(const Complex &other)
    Copy Constructor.
    Definition: complex_numbers.cpp:58
    -
    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
    -
    Complex::abs
    double abs() const
    Member function to give the modulus of our complex number. Member function to which gives the absolut...
    Definition: complex_numbers.cpp:79
    -
    main
    int main(int argc, char *argv[])
    Definition: large_factorial.cpp:89
    -
    gcd
    int gcd(int num1, int num2)
    Definition: gcd_recursive_euclidean.cpp:14
    -
    large_number.h
    Library to perform arithmatic operations on arbitrarily large numbers.
    -
    get_rand
    double get_rand()
    Function to get random numbers to generate our complex numbers for test.
    Definition: complex_numbers.cpp:201
    -
    binExpo_alt
    int binExpo_alt(int a, int b)
    Definition: binary_exponent.cpp:42
    -
    tests
    void tests()
    Definition: complex_numbers.cpp:206
    -
    Complex::operator=
    const Complex & operator=(const Complex &other)
    Operator overload of '=' on Complex class. Operator overload to be able to copy RHS instance of Compl...
    Definition: complex_numbers.cpp:160
    -
    main
    int main()
    Definition: gcd_recursive_euclidean.cpp:42
    -
    large_number::num_digits
    size_t num_digits() const
    Definition: large_number.h:130
    -
    main
    int main()
    Main function.
    Definition: fibonacci_sum.cpp:136
    -
    std::sqrt
    T sqrt(T... args)
    -
    large_number::operator+=
    large_number & operator+=(large_number n)
    Definition: large_number.h:192
    -
    is_prime
    bool is_prime(T num)
    Definition: check_prime.cpp:22
    -
    fast_power_recursive
    double fast_power_recursive(T a, T b)
    Definition: fast_power.cpp:26
    -
    std::vector::push_back
    T push_back(T... args)
    -
    test
    void test(uint64_t n, uint64_t expected)
    Definition: double_factorial.cpp:42
    -
    std::clock
    T clock(T... args)
    -
    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
    -
    large_number::large_number
    large_number(const large_number &a)
    Definition: large_number.h:48
    -
    test
    static void test()
    Definition: fibonacci.cpp:35
    -
    large_number::operator*=
    large_number & operator*=(const T n)
    Definition: large_number.h:238
    -
    large_number::large_number
    large_number()
    Definition: large_number.h:27
    -
    main
    int main()
    Main function.
    Definition: binary_exponent.cpp:55
    -
    Complex::operator/
    Complex operator/(const Complex &other)
    Operator overload of '/' on Complex class. Operator overload to be able to divide two complex numbers...
    Definition: complex_numbers.cpp:142
    -
    large_number::operator++
    large_number & operator++()
    Definition: large_number.h:175
    -
    main
    int main()
    Definition: graph_coloring.cpp:96
    -
    large_number::digit_char
    char digit_char(size_t i) const
    Definition: large_number.h:248
    -
    fibonacci
    uint64_t fibonacci(uint64_t n)
    Definition: fibonacci.cpp:19
    -
    large_number::operator[]
    unsigned char & operator[](size_t n)
    Definition: large_number.h:137
    - -
    main
    int main()
    Definition: check_factorial.cpp:61
    -
    phiFunction
    uint64_t phiFunction(uint64_t n)
    Definition: eulers_totient_function.cpp:32
    -
    main
    int main()
    Definition: factorial.cpp:15
    -
    large_number::multiply
    void multiply(const T n)
    Definition: large_number.h:258
    -
    Complex::operator~
    Complex operator~() const
    Operator overload of '~' on Complex class. Operator overload of the BITWISE NOT which gives us the co...
    Definition: complex_numbers.cpp:130
    -
    operator<<
    std::ostream & operator<<(std::ostream &os, const Complex &num)
    Operator overload of '<<' of ostream for Complex class. Overloaded insersion operator to accommodate ...
    Definition: complex_numbers.cpp:186
    -
    std::complex::real
    T real(T... args)
    -
    math::fibonacci_sum::fiboSum
    uint64_t fiboSum(uint64_t n, uint64_t m)
    Definition: fibonacci_sum.cpp:90
    -
    large_number::operator=
    large_number & operator=(const large_number &b)
    Definition: large_number.h:229
    -
    main
    int main()
    Main function.
    Definition: extended_euclid_algorithm.cpp:87
    -
    fib
    uint64_t fib(uint64_t n)
    Definition: fibonacci_fast.cpp:30
    - -
    test
    static void test()
    Definition: fibonacci_sum.cpp:101
    -
    operator==
    bool operator==(const Complex &a, const Complex &b)
    Operator overload of '==' on Complex class. Logical Equal overload for our Complex class.
    Definition: complex_numbers.cpp:175
    -
    large_number::_digits
    std::vector< unsigned char > _digits
    Definition: large_number.h:285
    - -
    main
    int main()
    Definition: check_prime.cpp:45
    -
    test2
    bool test2()
    Definition: large_factorial.cpp:54
    -
    std::rand
    T rand(T... args)
    -
    std::swap
    T swap(T... args)
    -
    std::sin
    T sin(T... args)
    -
    sum_of_divisor
    int sum_of_divisor(int num)
    Definition: check_amicable_pair.cpp:21
    -
    test_1
    static void test_1()
    Definition: heavy_light_decomposition.cpp:505
    -
    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
    -
    large_number::test
    static bool test()
    Definition: large_number.h:65
    -
    fibonacci_sum
    Functions for the sum of the Fibonacci Sequence: .
    -
    std::endl
    T endl(T... args)
    -
    main
    int main()
    Definition: complex_numbers.cpp:268
    -
    large_number::operator==
    friend bool operator==(large_number const &a, large_number const &b)
    Definition: large_number.h:155
    -
    factorial
    unsigned int factorial(unsigned int n)
    Definition: factorial.cpp:8
    -
    tests
    void tests()
    Definition: double_factorial.cpp:50
    -
    math::power
    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.
    Definition: modular_exponentiation.cpp:35
    -
    std::ios_base::sync_with_stdio
    T sync_with_stdio(T... args)
    -
    math
    for std::vector
    -
    gcd
    int gcd(int *a, int n)
    Definition: gcd_of_n_numbers.cpp:15
    -
    main
    int main()
    Definition: fast_power.cpp:68
    -
    double_factorial_recursive
    uint64_t double_factorial_recursive(uint64_t n)
    Definition: double_factorial.cpp:30
    -
    std::scientific
    T scientific(T... args)
    -
    std::strtoull
    T strtoull(T... args)
    -
    extendedEuclid
    void extendedEuclid(T A, T B, T *GCD, T2 *x, T2 *y)
    Definition: extended_euclid_algorithm.cpp:70
    -
    test
    void test()
    Definition: check_amicable_pair.cpp:56
    -
    std::complex
    STL class.
    -
    std::complex::imag
    T imag(T... args)
    -
    is_factorial
    bool is_factorial(uint64_t n)
    Definition: check_factorial.cpp:16
    -
    large_number::large_number
    large_number(int n)
    Definition: large_number.h:39
    -
    std::time
    T time(T... args)
    -
    tests
    void tests()
    Definition: check_factorial.cpp:36
    -
    Complex::operator+
    Complex operator+(const Complex &other)
    Operator overload of '+' on Complex class. Operator overload to be able to add two complex numbers.
    Definition: complex_numbers.cpp:95
    -
    extendedEuclid_1
    void extendedEuclid_1(T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)
    Definition: extended_euclid_algorithm.cpp:41
    -
    main
    int main()
    Definition: gcd_iterative_euclidean.cpp:47
    -
    std::max
    T max(T... args)
    -
    large_number::operator!=
    friend bool operator!=(large_number const &a, large_number const &b)
    Definition: large_number.h:168
    -
    fast_power_linear
    double fast_power_linear(T a, T b)
    Definition: fast_power.cpp:50
    - -
    large_number::operator++
    large_number & operator++(int)
    Definition: large_number.h:183
    -
    main
    int main(int argc, char *argv[])
    Main function.
    Definition: eulers_totient_function.cpp:48
    -
    large_number::operator+
    friend large_number & operator+(const large_number &a, const T &b)
    Definition: large_number.h:220
    -
    are_amicable
    bool are_amicable(int x, int y)
    Definition: check_amicable_pair.cpp:48
    -
    main
    int main()
    Definition: check_amicable_pair.cpp:68
    -
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition: fibonacci_sum.cpp:76
    -
    machine_learning::sum
    T sum(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:232
    -
    std::pow
    T pow(T... args)
    diff --git a/d4/d8d/jarvis__algorithm_8cpp.html b/d4/d8d/jarvis__algorithm_8cpp.html index 08f8ae1fb..0337b4a80 100644 --- a/d4/d8d/jarvis__algorithm_8cpp.html +++ b/d4/d8d/jarvis__algorithm_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: geometry/jarvis_algorithm.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -165,6 +165,7 @@ Algorithm
    177  test();
    178  return 0;
    179 }
    +
    test
    static void test()
    Definition: jarvis_algorithm.cpp:151
    Here is the call graph for this function:
    @@ -220,6 +221,10 @@ Here is the call graph for this function:
    171  }
    172  std::cout << "Test implementations passed!\n";
    173 }
    + +
    geometry::jarvis::Convexhull
    Definition: jarvis_algorithm.cpp:55
    +
    std::vector::size
    T size(T... args)
    +
    Here is the call graph for this function:
    @@ -231,16 +236,11 @@ Here is the call graph for this function:
    -
    test
    static void test()
    Definition: jarvis_algorithm.cpp:151
    - -
    std::vector::size
    T size(T... args)
    - -
    geometry::jarvis::Convexhull
    Definition: jarvis_algorithm.cpp:55
    diff --git a/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index afd244da5..a2b1f0f06 100644 --- a/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -37,7 +37,7 @@ Node5 - + std::vector::size @@ -68,7 +68,7 @@ Node4 - + std::vector::push_back diff --git a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 67173da87..02b04a92f 100644 --- a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -52,7 +52,7 @@ Node6 - + std::vector::size @@ -83,7 +83,7 @@ Node5 - + std::vector::push_back diff --git a/d4/d90/classdata__structures_1_1_skip_list.html b/d4/d90/classdata__structures_1_1_skip_list.html index b8ac69ee2..007662740 100644 --- a/d4/d90/classdata__structures_1_1_skip_list.html +++ b/d4/d90/classdata__structures_1_1_skip_list.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: data_structures::SkipList Class Reference @@ -42,10 +42,10 @@ - + @@ -101,7 +101,7 @@ $(document).ready(function(){initNavTree('d4/d90/classdata__structures_1_1_skip_
    Collaboration diagram for data_structures::SkipList:
    -
    +
    [legend]
    @@ -162,6 +162,9 @@ int 
    66  // Header initialization
    67  header = std::make_shared<Node>(-1, MAX_LEVEL);
    68  }
    +
    data_structures::SkipList::level
    int level
    Maximum level of the skiplist.
    Definition: skip_list.cpp:56
    +
    data_structures::SkipList::header
    std::shared_ptr< Node > header
    Pointer to the header node.
    Definition: skip_list.cpp:57
    +
    data_structures::MAX_LEVEL
    constexpr int MAX_LEVEL
    Maximum level of skip list.
    Definition: skip_list.cpp:27
    @@ -226,6 +229,10 @@ int     		 161  std::cout << "Doesn't exist" << std::endl;
    162  }
    163  }
    + + +
    std::endl
    T endl(T... args)
    +
    Here is the call graph for this function:
    @@ -270,6 +277,7 @@ Here is the call graph for this function:
    200  std::cout << std::endl;
    201  }
    202  }
    +
    node
    Definition: avltree.cpp:13
    Here is the call graph for this function:
    @@ -357,6 +365,7 @@ Here is the call graph for this function:
    125  std::cout << "Exists" << std::endl;
    126  }
    127  }
    +
    data_structures::SkipList::randomLevel
    int randomLevel()
    Definition: skip_list.cpp:75
    Here is the call graph for this function:
    @@ -397,6 +406,8 @@ Here is the call graph for this function:
    80  }
    81  return lvl;
    82  }
    +
    data_structures::PROBABILITY
    constexpr float PROBABILITY
    Current probability for "coin toss".
    Definition: skip_list.cpp:28
    +
    std::rand
    T rand(T... args)
    Here is the call graph for this function:
    @@ -467,22 +478,11 @@ Here is the call graph for this function:
    - -
    data_structures::SkipList::level
    int level
    Maximum level of the skiplist.
    Definition: skip_list.cpp:56
    -
    data_structures::MAX_LEVEL
    constexpr int MAX_LEVEL
    Maximum level of skip list.
    Definition: skip_list.cpp:27
    -
    node
    Definition: avltree.cpp:13
    - -
    std::array
    STL class.
    -
    std::rand
    T rand(T... args)
    -
    std::endl
    T endl(T... args)
    -
    data_structures::SkipList::randomLevel
    int randomLevel()
    Definition: skip_list.cpp:75
    -
    data_structures::SkipList::header
    std::shared_ptr< Node > header
    Pointer to the header node.
    Definition: skip_list.cpp:57
    -
    data_structures::PROBABILITY
    constexpr float PROBABILITY
    Current probability for "coin toss".
    Definition: skip_list.cpp:28
    diff --git a/d4/d90/classdata__structures_1_1_skip_list_a2249e3ab2f8a0f2334b90635202de4f2_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_a2249e3ab2f8a0f2334b90635202de4f2_cgraph.svg index 6f0cf9fbe..11371c847 100644 --- a/d4/d90/classdata__structures_1_1_skip_list_a2249e3ab2f8a0f2334b90635202de4f2_cgraph.svg +++ b/d4/d90/classdata__structures_1_1_skip_list_a2249e3ab2f8a0f2334b90635202de4f2_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::endl diff --git a/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.svg index f7978e755..98fbf18fb 100644 --- a/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.svg +++ b/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::endl @@ -53,7 +53,7 @@ Node4 - + std::rand diff --git a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg index 768b946ae..4af96a88e 100644 --- a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg +++ b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::endl diff --git a/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.svg index ebe9236dc..70a7f7cb7 100644 --- a/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.svg +++ b/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::endl diff --git a/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.svg index a63f45ccb..16580e4fe 100644 --- a/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.svg +++ b/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::rand diff --git a/d4/d9c/primes__up__to__billion_8cpp.html b/d4/d9c/primes__up__to__billion_8cpp.html index 8fe35a7c1..c040b3499 100644 --- a/d4/d9c/primes__up__to__billion_8cpp.html +++ b/d4/d9c/primes__up__to__billion_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/primes_up_to_billion.cpp File Reference @@ -42,10 +42,10 @@
    - + @@ -152,6 +152,10 @@ Variables
    34 
    35  return 0;
    36 }
    + + +
    Sieve
    void Sieve(int64_t n)
    Definition: primes_up_to_billion.cpp:13
    +
    prime
    char prime[100000000]
    Definition: primes_up_to_billion.cpp:10
    Here is the call graph for this function:
    @@ -188,6 +192,7 @@ Here is the call graph for this function:
    21  }
    22  }
    23 }
    +
    std::memset
    T memset(T... args)
    @@ -209,16 +214,11 @@ Here is the call graph for this function: - -
    Sieve
    void Sieve(int64_t n)
    Definition: primes_up_to_billion.cpp:13
    - -
    std::memset
    T memset(T... args)
    -
    prime
    char prime[100000000]
    Definition: primes_up_to_billion.cpp:10
    diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp.html b/d4/d9d/sum__of__binomial__coefficient_8cpp.html index 2bce887f8..7c9c6ca29 100644 --- a/d4/d9d/sum__of__binomial__coefficient_8cpp.html +++ b/d4/d9d/sum__of__binomial__coefficient_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/sum_of_binomial_coefficient.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -112,7 +112,7 @@ Include dependency graph for sum_of_binomial_coefficient.cpp:

    Namespaces

     math - for std::vector
    + for std::vector
     
    64  test(); // execute the tests
    65  return 0;
    66 }
    +
    test
    static void test()
    Definition: sum_of_binomial_coefficient.cpp:37
    Here is the call graph for this function:
    @@ -205,6 +206,9 @@ Here is the call graph for this function:
    55  assert(test_case_5 == 128);
    56  std::cout << "Test_case_5 Passed!" << std::endl;
    57 }
    + +
    std::endl
    T endl(T... args)
    +
    math::binomialCoeffSum
    uint64_t binomialCoeffSum(uint64_t n)
    Definition: sum_of_binomial_coefficient.cpp:26
    Here is the call graph for this function:
    @@ -216,15 +220,11 @@ Here is the call graph for this function:
    -
    test
    static void test()
    Definition: sum_of_binomial_coefficient.cpp:37
    - -
    math::binomialCoeffSum
    uint64_t binomialCoeffSum(uint64_t n)
    Definition: sum_of_binomial_coefficient.cpp:26
    -
    std::endl
    T endl(T... args)
    diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index a3924393b..e2678bf1b 100644 --- a/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::endl diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 5e52383a2..5f21e4080 100644 --- a/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -51,7 +51,7 @@ Node4 - + std::endl diff --git a/d4/da0/gcd__iterative__euclidean_8cpp.html b/d4/da0/gcd__iterative__euclidean_8cpp.html index b663dadc8..b9ee66d38 100644 --- a/d4/da0/gcd__iterative__euclidean_8cpp.html +++ b/d4/da0/gcd__iterative__euclidean_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/gcd_iterative_euclidean.cpp File Reference @@ -42,10 +42,10 @@

    @@ -152,6 +152,7 @@ Functions

    - + @@ -173,6 +173,7 @@ Functions
    40 
    41  return previous_remainder;
    42 }
    + @@ -204,6 +205,9 @@ Functions
    56 
    57  return 0;
    58 }
    + +
    std::endl
    T endl(T... args)
    +
    gcd
    int gcd(int num1, int num2)
    Definition: gcd_iterative_euclidean.cpp:15
    Here is the call graph for this function:
    @@ -215,15 +219,11 @@ Here is the call graph for this function:
    - -
    gcd
    int gcd(int num1, int num2)
    Definition: gcd_iterative_euclidean.cpp:15
    - -
    std::endl
    T endl(T... args)
    diff --git a/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index a4d1a1e61..878ff2fb3 100644 --- a/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d4/db4/struct_segment_intersection.html b/d4/db4/struct_segment_intersection.html index b11ffa563..0e546a51d 100644 --- a/d4/db4/struct_segment_intersection.html +++ b/d4/db4/struct_segment_intersection.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: SegmentIntersection Struct Reference @@ -42,10 +42,10 @@ - + @@ -157,6 +157,7 @@ bool intersect ( 67  ((second_point.x - first_point.x) *
    68  (third_point.y - first_point.y));
    69  }
    +
    Point::y
    int y
    Point respect to x coordinate.
    Definition: line_segment_intersection.cpp:14
    @@ -210,6 +211,8 @@ bool intersect ( 83  else
    84  return false;
    85  }
    +
    std::max
    T max(T... args)
    +
    std::min
    T min(T... args)
    Here is the call graph for this function:
    @@ -224,14 +227,11 @@ Here is the call graph for this function:
    -
    Point::y
    int y
    Point respect to x coordinate.
    Definition: line_segment_intersection.cpp:14
    -
    std::min
    T min(T... args)
    -
    std::max
    T max(T... args)
    diff --git a/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg b/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg index bfbb54b01..9de454583 100644 --- a/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg +++ b/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::max @@ -37,7 +37,7 @@ Node3 - + std::min diff --git a/d4/db6/struct_min_heap_node-members.html b/d4/db6/struct_min_heap_node-members.html index fb09fb8fd..76d26b63e 100644 --- a/d4/db6/struct_min_heap_node-members.html +++ b/d4/db6/struct_min_heap_node-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -107,7 +107,7 @@ $(document).ready(function(){initNavTree('d5/d29/struct_min_heap_node.html','../ diff --git a/d4/db9/namespacencr__modulo__p.html b/d4/db9/namespacencr__modulo__p.html index f83bdd2a7..1de743c14 100644 --- a/d4/db9/namespacencr__modulo__p.html +++ b/d4/db9/namespacencr__modulo__p.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: ncr_modulo_p Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d4/db9/namespacencr__modulo__p.html',' diff --git a/d4/dcb/classstack__coll__graph.map b/d4/dcb/classstack__coll__graph.map index a52e49ce0..72d97cc8f 100644 --- a/d4/dcb/classstack__coll__graph.map +++ b/d4/dcb/classstack__coll__graph.map @@ -1,5 +1,4 @@ - - - + + diff --git a/d4/dcb/classstack__coll__graph.md5 b/d4/dcb/classstack__coll__graph.md5 index 8deadcdcc..eefd345aa 100644 --- a/d4/dcb/classstack__coll__graph.md5 +++ b/d4/dcb/classstack__coll__graph.md5 @@ -1 +1 @@ -eaf9d4c45d4d86c08e1d58e8ae2eb910 \ No newline at end of file +c463627e1ba30d2b25996809dbf22d22 \ No newline at end of file diff --git a/d4/dcb/classstack__coll__graph.svg b/d4/dcb/classstack__coll__graph.svg index 0da9c103a..5677f4935 100644 --- a/d4/dcb/classstack__coll__graph.svg +++ b/d4/dcb/classstack__coll__graph.svg @@ -4,11 +4,11 @@ - - + + stack< Type > - + Node1 @@ -34,43 +34,5 @@ stackTop - - -Node2->Node2 - - - next - - - -Node3 - - -node< Kind > - - - - - -Node3->Node2 - - - left -link -next -prev -right - - - -Node3->Node3 - - - left -link -next -prev -right - diff --git a/d4/dd2/namespacequadratic__probing.html b/d4/dd2/namespacequadratic__probing.html index 38389be72..468f5234d 100644 --- a/d4/dd2/namespacequadratic__probing.html +++ b/d4/dd2/namespacequadratic__probing.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: quadratic_probing Namespace Reference @@ -42,10 +42,10 @@ - + @@ -96,7 +96,7 @@ $(document).ready(function(){initNavTree('d4/dd2/namespacequadratic__probing.htm Functions | Variables
    -
    quadratic_probing Namespace Reference
    Open Addressing
    +
    quadratic_probing Namespace Reference
    @@ -192,6 +192,8 @@ bool rehashing 187  rehash();
    188  }
    189 }
    +
    quadratic_probing::quadraticProbe
    int quadraticProbe(int key, bool searching)
    Definition: quadratic_probing_hash_table.cpp:56
    +
    quadratic_probing::rehash
    void rehash()
    Definition: quadratic_probing_hash_table.cpp:160
    Here is the call graph for this function:
    @@ -233,6 +235,11 @@ Here is the call graph for this function:
    215  std::cout << "New table: ";
    216  display();
    217 }
    + +
    std::endl
    T endl(T... args)
    +
    quadratic_probing::hashFxn
    size_t hashFxn(int key)
    Definition: quadratic_probing_hash_table.cpp:46
    +
    quadratic_probing::display
    void display()
    Definition: quadratic_probing_hash_table.cpp:142
    +
    add
    std::string add(std::string a, std::string b)
    Definition: string_fibonacci.cpp:24
    Here is the call graph for this function:
    @@ -311,6 +318,7 @@ if not present, a new instance
    135  }
    136  return table[index];
    137 }
    +
    quadratic_probing::Entry
    Definition: quadratic_probing_hash_table.cpp:37
    Here is the call graph for this function:
    @@ -346,6 +354,7 @@ Here is the call graph for this function:
    47  std::hash<int> hash;
    48  return hash(key);
    49 }
    + @@ -390,6 +399,7 @@ Here is the call graph for this function:
    109  }
    110  return false;
    111 }
    +
    quadratic_probing::Entry::key
    int key
    key value
    Definition: quadratic_probing_hash_table.cpp:39
    @@ -468,6 +478,10 @@ Here is the call graph for this function:
    96  } while (entry.key != notPresent);
    97  return notPresent;
    98 }
    +
    quadratic_probing::putProber
    bool putProber(const Entry &entry, int key)
    Definition: quadratic_probing_hash_table.cpp:106
    +
    quadratic_probing::searchingProber
    bool searchingProber(const Entry &entry, int key)
    Definition: quadratic_probing_hash_table.cpp:119
    +
    std::pow
    T pow(T... args)
    +
    std::round
    T round(T... args)
    Here is the call graph for this function:
    @@ -510,6 +524,7 @@ Here is the call graph for this function:
    175  rehashing = false;
    176  std::cout << "Table was rehashed, new size is: " << totalSize << std::endl;
    177 }
    +
    Here is the call graph for this function:
    @@ -551,6 +566,7 @@ Here is the call graph for this function:
    230  std::cout << "New table: ";
    231  display();
    232 }
    +
    quadratic_probing::remove
    void remove(int key)
    Definition: quadratic_probing_hash_table.cpp:194
    Here is the call graph for this function:
    @@ -645,27 +661,11 @@ Here is the call graph for this function:
    -
    std::vector
    STL class.
    -
    quadratic_probing::putProber
    bool putProber(const Entry &entry, int key)
    Definition: quadratic_probing_hash_table.cpp:106
    -
    quadratic_probing::display
    void display()
    Definition: quadratic_probing_hash_table.cpp:142
    -
    quadratic_probing::Entry
    Definition: quadratic_probing_hash_table.cpp:37
    -
    quadratic_probing::remove
    void remove(int key)
    Definition: quadratic_probing_hash_table.cpp:194
    -
    quadratic_probing::Entry::key
    int key
    key value
    Definition: quadratic_probing_hash_table.cpp:39
    - -
    quadratic_probing::rehash
    void rehash()
    Definition: quadratic_probing_hash_table.cpp:160
    -
    std::round
    T round(T... args)
    -
    std::endl
    T endl(T... args)
    -
    add
    std::string add(std::string a, std::string b)
    Definition: string_fibonacci.cpp:24
    -
    quadratic_probing::hashFxn
    size_t hashFxn(int key)
    Definition: quadratic_probing_hash_table.cpp:46
    -
    quadratic_probing::quadraticProbe
    int quadraticProbe(int key, bool searching)
    Definition: quadratic_probing_hash_table.cpp:56
    -
    quadratic_probing::searchingProber
    bool searchingProber(const Entry &entry, int key)
    Definition: quadratic_probing_hash_table.cpp:119
    - -
    std::pow
    T pow(T... args)
    diff --git a/d4/dd2/namespacequadratic__probing.js b/d4/dd2/namespacequadratic__probing.js index 73736208d..d3537d06d 100644 --- a/d4/dd2/namespacequadratic__probing.js +++ b/d4/dd2/namespacequadratic__probing.js @@ -1,4 +1,22 @@ var namespacequadratic__probing = [ - [ "Entry", "da/dd1/structquadratic__probing_1_1_entry.html", "da/dd1/structquadratic__probing_1_1_entry" ] + [ "Entry", "da/dd1/structquadratic__probing_1_1_entry.html", "da/dd1/structquadratic__probing_1_1_entry" ], + [ "Entry", "d4/dd2/namespacequadratic__probing.html#a8f877db9460c8e472719908b9a018ffb", null ], + [ "add", "d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9", null ], + [ "addInfo", "d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768", null ], + [ "display", "d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357", null ], + [ "find", "d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d", null ], + [ "hashFxn", "d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7", null ], + [ "putProber", "d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b", null ], + [ "quadraticProbe", "d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf", null ], + [ "rehash", "d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486", null ], + [ "removalInfo", "d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30", null ], + [ "remove", "d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a", null ], + [ "searchingProber", "d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6", null ], + [ "notPresent", "d4/dd2/namespacequadratic__probing.html#a90f9d8a71e3f148b65bcc0c1c8a49c70", null ], + [ "rehashing", "d4/dd2/namespacequadratic__probing.html#ad20bb8020424def88917e26979051fae", null ], + [ "size", "d4/dd2/namespacequadratic__probing.html#a6c60d84648b0f7bf78789da196bcd2b3", null ], + [ "table", "d4/dd2/namespacequadratic__probing.html#a149e32e186c3fac390ffa81dd6c73147", null ], + [ "tomb", "d4/dd2/namespacequadratic__probing.html#aaa4b6c021ba71ecdac8b23b45d55c774", null ], + [ "totalSize", "d4/dd2/namespacequadratic__probing.html#a2d5722a3b692eeb1b96615fba6a248f3", null ] ]; \ No newline at end of file diff --git a/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.svg b/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.svg index 497c40d7f..9b89dc20d 100644 --- a/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.svg +++ b/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.svg @@ -53,7 +53,7 @@ Node3 - + std::endl @@ -84,7 +84,7 @@ Node5 - + std::pow @@ -115,7 +115,7 @@ Node7 - + std::round diff --git a/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.svg b/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.svg index 0b2dc8397..c67494381 100644 --- a/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.svg +++ b/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::endl @@ -75,7 +75,7 @@ Node5 - + std::pow @@ -106,7 +106,7 @@ Node7 - + std::round diff --git a/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.svg b/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.svg index d6e7df7ea..9fce02cab 100644 --- a/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.svg +++ b/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.svg @@ -83,7 +83,7 @@ var sectionId = 'dynsection-1'; Node4 - + std::endl @@ -174,7 +174,7 @@ var sectionId = 'dynsection-1'; Node6 - + std::pow @@ -205,7 +205,7 @@ var sectionId = 'dynsection-1'; Node8 - + std::round diff --git a/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph_org.svg b/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph_org.svg index 6d8a8a1a9..8f0adc753 100644 --- a/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph_org.svg +++ b/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph_org.svg @@ -37,7 +37,7 @@ Node4 - + std::endl @@ -128,7 +128,7 @@ Node6 - + std::pow @@ -159,7 +159,7 @@ Node8 - + std::round diff --git a/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.svg b/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.svg index fcd8dc171..5c6e7ef18 100644 --- a/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.svg +++ b/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::endl diff --git a/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.svg b/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.svg index 67701d807..9fc595237 100644 --- a/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.svg +++ b/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.svg @@ -37,7 +37,7 @@ Node3 - + std::endl @@ -68,7 +68,7 @@ Node5 - + std::pow @@ -99,7 +99,7 @@ Node7 - + std::round diff --git a/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.svg b/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.svg index f90cd8a99..5dd0866a9 100644 --- a/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.svg +++ b/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.svg @@ -84,7 +84,7 @@ var sectionId = 'dynsection-6'; Node3 - + std::endl @@ -171,7 +171,7 @@ var sectionId = 'dynsection-6'; Node7 - + std::pow @@ -202,7 +202,7 @@ var sectionId = 'dynsection-6'; Node9 - + std::round diff --git a/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph_org.svg b/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph_org.svg index 02da78c35..06568896f 100644 --- a/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph_org.svg +++ b/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph_org.svg @@ -38,7 +38,7 @@ Node3 - + std::endl @@ -125,7 +125,7 @@ Node7 - + std::pow @@ -156,7 +156,7 @@ Node9 - + std::round diff --git a/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.svg b/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.svg index e6aaaed72..37c522cfe 100644 --- a/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.svg +++ b/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::endl @@ -53,7 +53,7 @@ Node4 - + std::pow @@ -84,7 +84,7 @@ Node6 - + std::round diff --git a/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.svg b/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.svg index b47535be8..b0fa5b35f 100644 --- a/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.svg +++ b/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.svg @@ -83,7 +83,7 @@ var sectionId = 'dynsection-5'; Node4 - + std::endl @@ -142,7 +142,7 @@ var sectionId = 'dynsection-5'; Node6 - + std::pow @@ -173,7 +173,7 @@ var sectionId = 'dynsection-5'; Node8 - + std::round diff --git a/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph_org.svg b/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph_org.svg index c3e6c35c9..bd8dd8681 100644 --- a/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph_org.svg +++ b/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph_org.svg @@ -37,7 +37,7 @@ Node4 - + std::endl @@ -96,7 +96,7 @@ Node6 - + std::pow @@ -127,7 +127,7 @@ Node8 - + std::round diff --git a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html index ab8e2b9e2..1fb667832 100644 --- a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html +++ b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: geometry::jarvis::Convexhull Class Reference @@ -42,10 +42,10 @@ - + @@ -241,6 +241,9 @@ Here is the call graph for this function:
    117 
    118  return hull;
    119  }
    +
    geometry::jarvis::Convexhull::orientation
    static int orientation(const Point &p, const Point &q, const Point &r)
    Definition: jarvis_algorithm.cpp:133
    +
    std::vector::push_back
    T push_back(T... args)
    +
    Here is the call graph for this function:
    @@ -310,6 +313,7 @@ Here is the call graph for this function:
    138  }
    139  return (val > 0) ? 1 : 2;
    140  }
    +
    Point::y
    int y
    Point respect to x coordinate.
    Definition: line_segment_intersection.cpp:14
    @@ -318,15 +322,11 @@ Here is the call graph for this function: -
    std::vector
    STL class.
    -
    std::vector::push_back
    T push_back(T... args)
    -
    Point::y
    int y
    Point respect to x coordinate.
    Definition: line_segment_intersection.cpp:14
    -
    geometry::jarvis::Convexhull::orientation
    static int orientation(const Point &p, const Point &q, const Point &r)
    Definition: jarvis_algorithm.cpp:133
    diff --git a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.svg b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.svg index 97659d1a2..81cf881a9 100644 --- a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.svg +++ b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::vector::size diff --git a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a878952f2eb3d1fae79d58c994fc10ab1_cgraph.svg b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a878952f2eb3d1fae79d58c994fc10ab1_cgraph.svg index ca8cabc40..aa6040668 100644 --- a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a878952f2eb3d1fae79d58c994fc10ab1_cgraph.svg +++ b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a878952f2eb3d1fae79d58c994fc10ab1_cgraph.svg @@ -38,7 +38,7 @@ Node3 - + std::vector::push_back diff --git a/d4/de6/namespacepostfix__expression.html b/d4/de6/namespacepostfix__expression.html index b4a5ca465..1dbee2e60 100644 --- a/d4/de6/namespacepostfix__expression.html +++ b/d4/de6/namespacepostfix__expression.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: postfix_expression Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d4/de6/namespacepostfix__expression.ht diff --git a/d4/def/kohonen__som__topology_8cpp.html b/d4/def/kohonen__som__topology_8cpp.html index db6c4c6e3..4047595a2 100644 --- a/d4/def/kohonen__som__topology_8cpp.html +++ b/d4/def/kohonen__som__topology_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: machine_learning/kohonen_som_topology.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -268,6 +268,15 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with
    611  "model and writing files to disk.)\n\n";
    612  return 0;
    613 }
    + +
    std::clock
    T clock(T... args)
    + +
    test2
    void test2()
    Definition: kohonen_som_topology.cpp:451
    +
    test1
    void test1()
    Definition: kohonen_som_topology.cpp:369
    +
    get_clock_diff
    double get_clock_diff(clock_t start_t, clock_t end_t)
    Definition: kohonen_som_topology.cpp:577
    +
    test3
    void test3()
    Definition: kohonen_som_topology.cpp:537
    +
    std::srand
    T srand(T... args)
    +
    std::time
    T time(T... args)
    Here is the call graph for this function:
    @@ -328,6 +337,14 @@ Here is the call graph for this function:
    398  kohonen_som(X, &W, 1e-4); // train the SOM
    399  save_u_matrix("w12.csv", W); // save the resultant weights
    400 }
    +
    save_2d_data
    int save_2d_data(const char *fname, const std::vector< std::valarray< double >> &X)
    Definition: kohonen_som_topology.cpp:65
    +
    _random
    double _random(double a, double b)
    Definition: kohonen_som_topology.cpp:53
    +
    test_2d_classes
    void test_2d_classes(std::vector< std::valarray< double >> *data)
    Definition: kohonen_som_topology.cpp:330
    +
    std::max
    T max(T... args)
    +
    machine_learning::save_u_matrix
    int save_u_matrix(const char *fname, const std::vector< std::vector< std::valarray< double >>> &W)
    Definition: kohonen_som_topology.cpp:142
    +
    machine_learning::kohonen_som
    void kohonen_som(const std::vector< std::valarray< double >> &X, std::vector< std::vector< std::valarray< double >>> *W, double alpha_min)
    Definition: kohonen_som_topology.cpp:269
    + +
    Here is the call graph for this function:
    @@ -388,6 +405,7 @@ Here is the call graph for this function:
    480  kohonen_som(X, &W, 1e-4); // train the SOM
    481  save_u_matrix("w22.csv", W); // save the resultant weights
    482 }
    +
    test_3d_classes1
    void test_3d_classes1(std::vector< std::valarray< double >> *data)
    Definition: kohonen_som_topology.cpp:411
    Here is the call graph for this function:
    @@ -448,6 +466,7 @@ Here is the call graph for this function:
    566  kohonen_som(X, &W, 1e-4); // train the SOM
    567  save_u_matrix("w32.csv", W); // save the resultant weights
    568 }
    +
    test_3d_classes2
    void test_3d_classes2(std::vector< std::valarray< double >> *data)
    Definition: kohonen_som_topology.cpp:493
    Here is the call graph for this function:
    @@ -514,6 +533,9 @@ Here is the call graph for this function:
    357  */
    358  }
    359 }
    + +
    data
    int data[MAX]
    test data
    Definition: hash_search.cpp:24
    +
    std::rand
    T rand(T... args)
    Here is the call graph for this function:
    @@ -663,33 +685,11 @@ Here is the call graph for this function:
    -
    std::srand
    T srand(T... args)
    - -
    std::vector
    STL class.
    -
    test1
    void test1()
    Definition: kohonen_som_topology.cpp:369
    -
    std::clock
    T clock(T... args)
    -
    test3
    void test3()
    Definition: kohonen_som_topology.cpp:537
    - -
    std::array
    STL class.
    - -
    test_3d_classes1
    void test_3d_classes1(std::vector< std::valarray< double >> *data)
    Definition: kohonen_som_topology.cpp:411
    -
    test2
    void test2()
    Definition: kohonen_som_topology.cpp:451
    -
    std::rand
    T rand(T... args)
    -
    save_2d_data
    int save_2d_data(const char *fname, const std::vector< std::valarray< double >> &X)
    Definition: kohonen_som_topology.cpp:65
    -
    data
    int data[MAX]
    test data
    Definition: hash_search.cpp:24
    -
    machine_learning::save_u_matrix
    int save_u_matrix(const char *fname, const std::vector< std::vector< std::valarray< double >>> &W)
    Definition: kohonen_som_topology.cpp:142
    -
    get_clock_diff
    double get_clock_diff(clock_t start_t, clock_t end_t)
    Definition: kohonen_som_topology.cpp:577
    -
    std::time
    T time(T... args)
    -
    std::max
    T max(T... args)
    -
    test_2d_classes
    void test_2d_classes(std::vector< std::valarray< double >> *data)
    Definition: kohonen_som_topology.cpp:330
    -
    machine_learning::kohonen_som
    void kohonen_som(const std::vector< std::valarray< double >> &X, std::vector< std::vector< std::valarray< double >>> *W, double alpha_min)
    Definition: kohonen_som_topology.cpp:269
    -
    test_3d_classes2
    void test_3d_classes2(std::vector< std::valarray< double >> *data)
    Definition: kohonen_som_topology.cpp:493
    -
    _random
    double _random(double a, double b)
    Definition: kohonen_som_topology.cpp:53
    diff --git a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg index 3159c2a6a..2a10027e2 100644 --- a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg +++ b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg @@ -97,7 +97,7 @@ var sectionId = 'dynsection-3'; Node12 - + std::max @@ -158,7 +158,7 @@ var sectionId = 'dynsection-3'; Node3 - + std::rand @@ -189,7 +189,7 @@ var sectionId = 'dynsection-3'; Node6 - + std::exp @@ -225,7 +225,7 @@ var sectionId = 'dynsection-3'; Node13 - + std::min @@ -240,7 +240,7 @@ var sectionId = 'dynsection-3'; Node14 - + std::sqrt @@ -270,7 +270,7 @@ var sectionId = 'dynsection-3'; Node8 - + std::begin @@ -285,7 +285,7 @@ var sectionId = 'dynsection-3'; Node9 - + std::distance @@ -300,7 +300,7 @@ var sectionId = 'dynsection-3'; Node10 - + std::end @@ -315,7 +315,7 @@ var sectionId = 'dynsection-3'; Node11 - + std::min_element @@ -330,7 +330,7 @@ var sectionId = 'dynsection-3'; Node17 - + std::ofstream::close @@ -345,7 +345,7 @@ var sectionId = 'dynsection-3'; Node18 - + std::ofstream::is_open @@ -360,7 +360,7 @@ var sectionId = 'dynsection-3'; Node19 - + std::ofstream::open @@ -375,7 +375,7 @@ var sectionId = 'dynsection-3'; Node20 - + std::strerror @@ -396,7 +396,7 @@ var sectionId = 'dynsection-3'; Node22 - + std::endl diff --git a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg index 7e3e892c2..81df2e372 100644 --- a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg +++ b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg @@ -51,7 +51,7 @@ Node12 - + std::max @@ -112,7 +112,7 @@ Node3 - + std::rand @@ -143,7 +143,7 @@ Node6 - + std::exp @@ -179,7 +179,7 @@ Node13 - + std::min @@ -194,7 +194,7 @@ Node14 - + std::sqrt @@ -224,7 +224,7 @@ Node8 - + std::begin @@ -239,7 +239,7 @@ Node9 - + std::distance @@ -254,7 +254,7 @@ Node10 - + std::end @@ -269,7 +269,7 @@ Node11 - + std::min_element @@ -284,7 +284,7 @@ Node17 - + std::ofstream::close @@ -299,7 +299,7 @@ Node18 - + std::ofstream::is_open @@ -314,7 +314,7 @@ Node19 - + std::ofstream::open @@ -329,7 +329,7 @@ Node20 - + std::strerror @@ -350,7 +350,7 @@ Node22 - + std::endl diff --git a/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.svg index 8c9421182..78f698767 100644 --- a/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.svg +++ b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::rand diff --git a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg index 734f545da..24772d648 100644 --- a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg +++ b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg @@ -97,7 +97,7 @@ var sectionId = 'dynsection-2'; Node12 - + std::max @@ -158,7 +158,7 @@ var sectionId = 'dynsection-2'; Node3 - + std::rand @@ -189,7 +189,7 @@ var sectionId = 'dynsection-2'; Node6 - + std::exp @@ -225,7 +225,7 @@ var sectionId = 'dynsection-2'; Node13 - + std::min @@ -240,7 +240,7 @@ var sectionId = 'dynsection-2'; Node14 - + std::sqrt @@ -270,7 +270,7 @@ var sectionId = 'dynsection-2'; Node8 - + std::begin @@ -285,7 +285,7 @@ var sectionId = 'dynsection-2'; Node9 - + std::distance @@ -300,7 +300,7 @@ var sectionId = 'dynsection-2'; Node10 - + std::end @@ -315,7 +315,7 @@ var sectionId = 'dynsection-2'; Node11 - + std::min_element @@ -330,7 +330,7 @@ var sectionId = 'dynsection-2'; Node17 - + std::ofstream::close @@ -345,7 +345,7 @@ var sectionId = 'dynsection-2'; Node18 - + std::ofstream::is_open @@ -360,7 +360,7 @@ var sectionId = 'dynsection-2'; Node19 - + std::ofstream::open @@ -375,7 +375,7 @@ var sectionId = 'dynsection-2'; Node20 - + std::strerror @@ -396,7 +396,7 @@ var sectionId = 'dynsection-2'; Node22 - + std::endl diff --git a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg index 7dd346a17..f165b45c3 100644 --- a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg +++ b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg @@ -51,7 +51,7 @@ Node12 - + std::max @@ -112,7 +112,7 @@ Node3 - + std::rand @@ -143,7 +143,7 @@ Node6 - + std::exp @@ -179,7 +179,7 @@ Node13 - + std::min @@ -194,7 +194,7 @@ Node14 - + std::sqrt @@ -224,7 +224,7 @@ Node8 - + std::begin @@ -239,7 +239,7 @@ Node9 - + std::distance @@ -254,7 +254,7 @@ Node10 - + std::end @@ -269,7 +269,7 @@ Node11 - + std::min_element @@ -284,7 +284,7 @@ Node17 - + std::ofstream::close @@ -299,7 +299,7 @@ Node18 - + std::ofstream::is_open @@ -314,7 +314,7 @@ Node19 - + std::ofstream::open @@ -329,7 +329,7 @@ Node20 - + std::strerror @@ -350,7 +350,7 @@ Node22 - + std::endl diff --git a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg index f47413b0f..cbf44d8e2 100644 --- a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg +++ b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg @@ -67,7 +67,7 @@ var sectionId = 'dynsection-1'; Node2 - + std::clock @@ -97,7 +97,7 @@ var sectionId = 'dynsection-1'; Node4 - + std::srand @@ -157,7 +157,7 @@ var sectionId = 'dynsection-1'; Node32 - + std::time @@ -202,7 +202,7 @@ var sectionId = 'dynsection-1'; Node16 - + std::max @@ -263,7 +263,7 @@ var sectionId = 'dynsection-1'; Node7 - + std::rand @@ -294,7 +294,7 @@ var sectionId = 'dynsection-1'; Node10 - + std::exp @@ -330,7 +330,7 @@ var sectionId = 'dynsection-1'; Node17 - + std::min @@ -345,7 +345,7 @@ var sectionId = 'dynsection-1'; Node18 - + std::sqrt @@ -375,7 +375,7 @@ var sectionId = 'dynsection-1'; Node12 - + std::begin @@ -390,7 +390,7 @@ var sectionId = 'dynsection-1'; Node13 - + std::distance @@ -405,7 +405,7 @@ var sectionId = 'dynsection-1'; Node14 - + std::end @@ -420,7 +420,7 @@ var sectionId = 'dynsection-1'; Node15 - + std::min_element @@ -435,7 +435,7 @@ var sectionId = 'dynsection-1'; Node21 - + std::ofstream::close @@ -450,7 +450,7 @@ var sectionId = 'dynsection-1'; Node22 - + std::ofstream::is_open @@ -465,7 +465,7 @@ var sectionId = 'dynsection-1'; Node23 - + std::ofstream::open @@ -480,7 +480,7 @@ var sectionId = 'dynsection-1'; Node24 - + std::strerror @@ -501,7 +501,7 @@ var sectionId = 'dynsection-1'; Node26 - + std::endl diff --git a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg index fd920db9a..c1f316129 100644 --- a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg +++ b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -21,7 +21,7 @@ Node2 - + std::clock @@ -51,7 +51,7 @@ Node4 - + std::srand @@ -111,7 +111,7 @@ Node32 - + std::time @@ -156,7 +156,7 @@ Node16 - + std::max @@ -217,7 +217,7 @@ Node7 - + std::rand @@ -248,7 +248,7 @@ Node10 - + std::exp @@ -284,7 +284,7 @@ Node17 - + std::min @@ -299,7 +299,7 @@ Node18 - + std::sqrt @@ -329,7 +329,7 @@ Node12 - + std::begin @@ -344,7 +344,7 @@ Node13 - + std::distance @@ -359,7 +359,7 @@ Node14 - + std::end @@ -374,7 +374,7 @@ Node15 - + std::min_element @@ -389,7 +389,7 @@ Node21 - + std::ofstream::close @@ -404,7 +404,7 @@ Node22 - + std::ofstream::is_open @@ -419,7 +419,7 @@ Node23 - + std::ofstream::open @@ -434,7 +434,7 @@ Node24 - + std::strerror @@ -455,7 +455,7 @@ Node26 - + std::endl diff --git a/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.svg index 07a0c6b52..2a879f492 100644 --- a/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.svg +++ b/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::rand diff --git a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg index 2c2831e8e..308b973af 100644 --- a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg +++ b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg @@ -97,7 +97,7 @@ var sectionId = 'dynsection-4'; Node12 - + std::max @@ -158,7 +158,7 @@ var sectionId = 'dynsection-4'; Node3 - + std::rand @@ -189,7 +189,7 @@ var sectionId = 'dynsection-4'; Node6 - + std::exp @@ -225,7 +225,7 @@ var sectionId = 'dynsection-4'; Node13 - + std::min @@ -240,7 +240,7 @@ var sectionId = 'dynsection-4'; Node14 - + std::sqrt @@ -270,7 +270,7 @@ var sectionId = 'dynsection-4'; Node8 - + std::begin @@ -285,7 +285,7 @@ var sectionId = 'dynsection-4'; Node9 - + std::distance @@ -300,7 +300,7 @@ var sectionId = 'dynsection-4'; Node10 - + std::end @@ -315,7 +315,7 @@ var sectionId = 'dynsection-4'; Node11 - + std::min_element @@ -330,7 +330,7 @@ var sectionId = 'dynsection-4'; Node17 - + std::ofstream::close @@ -345,7 +345,7 @@ var sectionId = 'dynsection-4'; Node18 - + std::ofstream::is_open @@ -360,7 +360,7 @@ var sectionId = 'dynsection-4'; Node19 - + std::ofstream::open @@ -375,7 +375,7 @@ var sectionId = 'dynsection-4'; Node20 - + std::strerror @@ -396,7 +396,7 @@ var sectionId = 'dynsection-4'; Node22 - + std::endl diff --git a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg index d6b8660a5..8fc7e1df7 100644 --- a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg +++ b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg @@ -51,7 +51,7 @@ Node12 - + std::max @@ -112,7 +112,7 @@ Node3 - + std::rand @@ -143,7 +143,7 @@ Node6 - + std::exp @@ -179,7 +179,7 @@ Node13 - + std::min @@ -194,7 +194,7 @@ Node14 - + std::sqrt @@ -224,7 +224,7 @@ Node8 - + std::begin @@ -239,7 +239,7 @@ Node9 - + std::distance @@ -254,7 +254,7 @@ Node10 - + std::end @@ -269,7 +269,7 @@ Node11 - + std::min_element @@ -284,7 +284,7 @@ Node17 - + std::ofstream::close @@ -299,7 +299,7 @@ Node18 - + std::ofstream::is_open @@ -314,7 +314,7 @@ Node19 - + std::ofstream::open @@ -329,7 +329,7 @@ Node20 - + std::strerror @@ -350,7 +350,7 @@ Node22 - + std::endl diff --git a/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.svg index d74dc5096..00e66e78a 100644 --- a/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.svg +++ b/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::rand diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html index 459757db0..38418e7e7 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: machine_learning::neural_network::NeuralNetwork Class Reference @@ -42,10 +42,10 @@ - + @@ -102,7 +102,7 @@ $(document).ready(function(){initNavTree('d4/df4/classmachine__learning_1_1neura
    Collaboration diagram for machine_learning::neural_network::NeuralNetwork:
    -
    +
    [legend]
    @@ -223,6 +223,12 @@ Private Attributes
    279  }
    280  std::cout << "INFO: Network constructed successfully" << std::endl;
    281  }
    + +
    std::vector::begin
    T begin(T... args)
    +
    std::endl
    T endl(T... args)
    +
    std::exit
    T exit(T... args)
    +
    layers
    This namespace contains layers used in MLP.
    +
    std::vector::size
    T size(T... args)
    Here is the call graph for this function:
    @@ -453,6 +459,10 @@ Here is the call graph for this function:
    297  }
    298  return details;
    299  }
    +
    std::vector::emplace_back
    T emplace_back(T... args)
    +
    machine_learning::multiply
    std::vector< std::valarray< T > > multiply(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)
    Definition: vector_ops.hpp:460
    +
    machine_learning::apply_function
    std::vector< std::valarray< T > > apply_function(const std::vector< std::valarray< T >> &A, T(*func)(const T &))
    Definition: vector_ops.hpp:329
    +
    Here is the call graph for this function:
    @@ -502,6 +512,7 @@ Here is the call graph for this function:
    472  }
    473  return predicted_batch; // Return predicted values
    474  }
    +
    machine_learning::neural_network::NeuralNetwork::single_predict
    std::vector< std::valarray< double > > single_predict(const std::vector< std::valarray< double >> &X)
    Definition: neural_network.cpp:451
    Here is the call graph for this function:
    @@ -574,6 +585,8 @@ Here is the call graph for this function:
    627  std::cout << ", Accuracy: " << acc << std::endl;
    628  return;
    629  }
    +
    machine_learning::argmax
    size_t argmax(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:307
    +
    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:
    @@ -645,6 +658,9 @@ Here is the call graph for this function:
    644  this->evaluate(data.first, data.second);
    645  return;
    646  }
    +
    machine_learning::neural_network::NeuralNetwork::evaluate
    void evaluate(const std::vector< std::vector< std::valarray< double >>> &X, const std::vector< std::vector< std::valarray< double >>> &Y)
    Definition: neural_network.cpp:606
    +
    machine_learning::neural_network::NeuralNetwork::get_XY_from_csv
    std::pair< std::vector< std::vector< std::valarray< double > > >, std::vector< std::vector< std::valarray< double > > > > get_XY_from_csv(const std::string &file_name, const bool &last_label, const bool &normalize, const int &slip_lines=1)
    Definition: neural_network.cpp:382
    +
    data
    int data[MAX]
    test data
    Definition: hash_search.cpp:24
    Here is the call graph for this function:
    @@ -809,6 +825,17 @@ Here is the call graph for this function:
    572  }
    573  return;
    574  }
    +
    machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction
    std::vector< std::vector< std::valarray< double > > > __detailed_single_prediction(const std::vector< std::valarray< double >> &X)
    Definition: neural_network.cpp:289
    +
    std::min
    T min(T... args)
    +
    activations
    Various activation functions used in Neural network.
    +
    machine_learning::zeroes_initialization
    void zeroes_initialization(std::vector< std::valarray< T >> &A, const std::pair< size_t, size_t > &shape)
    Definition: vector_ops.hpp:213
    +
    machine_learning::equal_shuffle
    void equal_shuffle(std::vector< std::vector< std::valarray< T >>> &A, std::vector< std::vector< std::valarray< T >>> &B)
    Definition: vector_ops.hpp:136
    +
    machine_learning::hadamard_product
    std::vector< std::valarray< T > > hadamard_product(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)
    Definition: vector_ops.hpp:494
    +
    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::transpose
    std::vector< std::valarray< T > > transpose(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:382
    +
    sorting::shuffle
    std::array< T, N > shuffle(std::array< T, N > arr)
    Definition: bogo_sort.cpp:36
    + +
    std::vector::resize
    T resize(T... args)
    Here is the call graph for this function:
    @@ -909,6 +936,7 @@ Here is the call graph for this function:
    597  shuffle);
    598  return;
    599  }
    +
    machine_learning::neural_network::NeuralNetwork::fit
    void 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)
    Definition: neural_network.cpp:485
    Here is the call graph for this function:
    @@ -1035,6 +1063,23 @@ Here is the call graph for this function:
    442  in_file.close(); // Closing file
    443  return make_pair(X, Y); // Return pair of X and Y
    444  }
    + + + +
    std::string::c_str
    T c_str(T... args)
    +
    std::ifstream::close
    T close(T... args)
    +
    std::ifstream::eof
    T eof(T... args)
    +
    std::getline
    T getline(T... args)
    +
    std::ifstream::is_open
    T is_open(T... args)
    +
    std::make_pair
    T make_pair(T... args)
    +
    machine_learning::minmax_scaler
    std::vector< std::vector< std::valarray< T > > > minmax_scaler(const std::vector< std::vector< std::valarray< T >>> &A, const T &low, const T &high)
    Definition: vector_ops.hpp:269
    +
    machine_learning::pop_back
    std::valarray< T > pop_back(const std::valarray< T > &A)
    Definition: vector_ops.hpp:119
    +
    machine_learning::insert_element
    std::valarray< T > insert_element(const std::valarray< T > &A, const T &ele)
    Definition: vector_ops.hpp:85
    +
    machine_learning::pop_front
    std::valarray< T > pop_front(const std::valarray< T > &A)
    Definition: vector_ops.hpp:102
    +
    std::ifstream::open
    T open(T... args)
    +
    std::vector::push_back
    T push_back(T... args)
    +
    std::stod
    T stod(T... args)
    +
    Here is the call graph for this function:
    @@ -1111,6 +1156,7 @@ Here is the call graph for this function:
    766  return NeuralNetwork(
    767  config, kernels); // Return instance of NeuralNetwork class
    768  }
    +
    machine_learning::neural_network::NeuralNetwork::NeuralNetwork
    NeuralNetwork()=default
    Here is the call graph for this function:
    @@ -1301,6 +1347,8 @@ Here is the call graph for this function:
    723  out_file.close(); // Closing file
    724  return;
    725  }
    + +
    std::string::find
    T find(T... args)
    Here is the call graph for this function:
    @@ -1416,59 +1464,11 @@ Here is the call graph for this function:
    -
    std::vector::resize
    T resize(T... args)
    -
    machine_learning::apply_function
    std::vector< std::valarray< T > > apply_function(const std::vector< std::valarray< T >> &A, T(*func)(const T &))
    Definition: vector_ops.hpp:329
    -
    std::string
    STL class.
    -
    machine_learning::pop_back
    std::valarray< T > pop_back(const std::valarray< T > &A)
    Definition: vector_ops.hpp:119
    -
    machine_learning::equal_shuffle
    void equal_shuffle(std::vector< std::vector< std::valarray< T >>> &A, std::vector< std::vector< std::valarray< T >>> &B)
    Definition: vector_ops.hpp:136
    -
    machine_learning::pop_front
    std::valarray< T > pop_front(const std::valarray< T > &A)
    Definition: vector_ops.hpp:102
    -
    std::vector
    STL class.
    -
    std::string::find
    T find(T... args)
    -
    std::vector::size
    T size(T... args)
    - -
    machine_learning::transpose
    std::vector< std::valarray< T > > transpose(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:382
    -
    sorting::shuffle
    std::array< T, N > shuffle(std::array< T, N > arr)
    Definition: bogo_sort.cpp:36
    -
    machine_learning::argmax
    size_t argmax(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:307
    -
    std::vector::push_back
    T push_back(T... args)
    -
    machine_learning::neural_network::NeuralNetwork::evaluate
    void evaluate(const std::vector< std::vector< std::valarray< double >>> &X, const std::vector< std::vector< std::valarray< double >>> &Y)
    Definition: neural_network.cpp:606
    - -
    std::ofstream
    STL class.
    -
    machine_learning::neural_network::NeuralNetwork::fit
    void 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)
    Definition: neural_network.cpp:485
    -
    std::string::c_str
    T c_str(T... args)
    -
    activations
    Various activation functions used in Neural network.
    -
    machine_learning::insert_element
    std::valarray< T > insert_element(const std::valarray< T > &A, const T &ele)
    Definition: vector_ops.hpp:85
    -
    std::ifstream::close
    T close(T... args)
    -
    machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction
    std::vector< std::vector< std::valarray< double > > > __detailed_single_prediction(const std::vector< std::valarray< double >> &X)
    Definition: neural_network.cpp:289
    - -
    std::ifstream::open
    T open(T... args)
    -
    machine_learning::neural_network::NeuralNetwork::NeuralNetwork
    NeuralNetwork()=default
    -
    std::min
    T min(T... args)
    -
    machine_learning::minmax_scaler
    std::vector< std::vector< std::valarray< T > > > minmax_scaler(const std::vector< std::vector< std::valarray< T >>> &A, const T &low, const T &high)
    Definition: vector_ops.hpp:269
    -
    data
    int data[MAX]
    test data
    Definition: hash_search.cpp:24
    -
    std::vector::emplace_back
    T emplace_back(T... args)
    -
    std::stod
    T stod(T... args)
    -
    std::endl
    T endl(T... args)
    -
    machine_learning::neural_network::NeuralNetwork::get_XY_from_csv
    std::pair< std::vector< std::vector< std::valarray< double > > >, std::vector< std::vector< std::valarray< double > > > > get_XY_from_csv(const std::string &file_name, const bool &last_label, const bool &normalize, const int &slip_lines=1)
    Definition: neural_network.cpp:382
    -
    std::vector::begin
    T begin(T... args)
    -
    std::getline
    T getline(T... args)
    -
    machine_learning::neural_network::NeuralNetwork::single_predict
    std::vector< std::valarray< double > > single_predict(const std::vector< std::valarray< double >> &X)
    Definition: neural_network.cpp:451
    -
    machine_learning::get_shape
    std::pair< size_t, size_t > get_shape(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:247
    -
    layers
    This namespace contains layers used in MLP.
    -
    std::make_pair
    T make_pair(T... args)
    -
    machine_learning::hadamard_product
    std::vector< std::valarray< T > > hadamard_product(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)
    Definition: vector_ops.hpp:494
    -
    machine_learning::multiply
    std::vector< std::valarray< T > > multiply(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)
    Definition: vector_ops.hpp:460
    -
    machine_learning::zeroes_initialization
    void zeroes_initialization(std::vector< std::valarray< T >> &A, const std::pair< size_t, size_t > &shape)
    Definition: vector_ops.hpp:213
    -
    std::ifstream::is_open
    T is_open(T... args)
    -
    std::ifstream::eof
    T eof(T... args)
    -
    std::exit
    T exit(T... args)
    -
    machine_learning::sum
    T sum(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:232
    -
    std::ifstream
    STL class.
    - diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a0ee425af6fd83a033c021128b8253f52_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a0ee425af6fd83a033c021128b8253f52_cgraph.svg index 630c54e03..d02551554 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a0ee425af6fd83a033c021128b8253f52_cgraph.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a0ee425af6fd83a033c021128b8253f52_cgraph.svg @@ -100,7 +100,7 @@ var sectionId = 'dynsection-5'; Node7 - + std::endl @@ -147,7 +147,7 @@ var sectionId = 'dynsection-5'; Node4 - + std::begin @@ -162,7 +162,7 @@ var sectionId = 'dynsection-5'; Node5 - + std::distance @@ -177,7 +177,7 @@ var sectionId = 'dynsection-5'; Node6 - + std::end @@ -198,7 +198,7 @@ var sectionId = 'dynsection-5'; Node8 - + std::exit @@ -229,7 +229,7 @@ var sectionId = 'dynsection-5'; Node10 - + std::max_element @@ -267,7 +267,7 @@ var sectionId = 'dynsection-5'; Node13 - + std::vector::emplace_back @@ -315,7 +315,7 @@ var sectionId = 'dynsection-5'; Node15 - + std::vector::push_back diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a0ee425af6fd83a033c021128b8253f52_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a0ee425af6fd83a033c021128b8253f52_cgraph_org.svg index 6ee9a52fe..828dab2be 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a0ee425af6fd83a033c021128b8253f52_cgraph_org.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a0ee425af6fd83a033c021128b8253f52_cgraph_org.svg @@ -54,7 +54,7 @@ Node7 - + std::endl @@ -101,7 +101,7 @@ Node4 - + std::begin @@ -116,7 +116,7 @@ Node5 - + std::distance @@ -131,7 +131,7 @@ Node6 - + std::end @@ -152,7 +152,7 @@ Node8 - + std::exit @@ -183,7 +183,7 @@ Node10 - + std::max_element @@ -221,7 +221,7 @@ Node13 - + std::vector::emplace_back @@ -269,7 +269,7 @@ Node15 - + std::vector::push_back diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a215d132aa38b9c9aab6716663a751b82_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a215d132aa38b9c9aab6716663a751b82_cgraph.svg index 8da4d34cc..3ef1d106c 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a215d132aa38b9c9aab6716663a751b82_cgraph.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a215d132aa38b9c9aab6716663a751b82_cgraph.svg @@ -23,7 +23,7 @@ Node2 - + std::endl @@ -38,7 +38,7 @@ Node3 - + std::exit diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.svg index 59c8dd3ff..f3a06363d 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.svg @@ -134,7 +134,7 @@ var sectionId = 'dynsection-6'; Node8 - + std::endl @@ -181,7 +181,7 @@ var sectionId = 'dynsection-6'; Node5 - + std::begin @@ -196,7 +196,7 @@ var sectionId = 'dynsection-6'; Node6 - + std::distance @@ -211,7 +211,7 @@ var sectionId = 'dynsection-6'; Node7 - + std::end @@ -232,7 +232,7 @@ var sectionId = 'dynsection-6'; Node9 - + std::exit @@ -263,7 +263,7 @@ var sectionId = 'dynsection-6'; Node11 - + std::max_element @@ -301,7 +301,7 @@ var sectionId = 'dynsection-6'; Node14 - + std::vector::emplace_back @@ -349,7 +349,7 @@ var sectionId = 'dynsection-6'; Node16 - + std::vector::push_back @@ -382,7 +382,7 @@ var sectionId = 'dynsection-6'; Node19 - + std::vector::back @@ -397,7 +397,7 @@ var sectionId = 'dynsection-6'; Node20 - + std::string::c_str @@ -412,7 +412,7 @@ var sectionId = 'dynsection-6'; Node21 - + std::ifstream::close @@ -427,7 +427,7 @@ var sectionId = 'dynsection-6'; Node22 - + std::ifstream::eof @@ -442,7 +442,7 @@ var sectionId = 'dynsection-6'; Node23 - + std::getline @@ -473,7 +473,7 @@ var sectionId = 'dynsection-6'; Node25 - + std::ifstream::is_open @@ -504,7 +504,7 @@ var sectionId = 'dynsection-6'; Node30 - + std::ifstream::open @@ -550,7 +550,7 @@ var sectionId = 'dynsection-6'; Node33 - + std::stod @@ -583,7 +583,7 @@ var sectionId = 'dynsection-6'; Node27 - + std::max @@ -598,7 +598,7 @@ var sectionId = 'dynsection-6'; Node28 - + std::min @@ -613,7 +613,7 @@ var sectionId = 'dynsection-6'; Node29 - + std::vector::size diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph_org.svg index 3672cc288..d44fb5728 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph_org.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph_org.svg @@ -88,7 +88,7 @@ Node8 - + std::endl @@ -135,7 +135,7 @@ Node5 - + std::begin @@ -150,7 +150,7 @@ Node6 - + std::distance @@ -165,7 +165,7 @@ Node7 - + std::end @@ -186,7 +186,7 @@ Node9 - + std::exit @@ -217,7 +217,7 @@ Node11 - + std::max_element @@ -255,7 +255,7 @@ Node14 - + std::vector::emplace_back @@ -303,7 +303,7 @@ Node16 - + std::vector::push_back @@ -336,7 +336,7 @@ Node19 - + std::vector::back @@ -351,7 +351,7 @@ Node20 - + std::string::c_str @@ -366,7 +366,7 @@ Node21 - + std::ifstream::close @@ -381,7 +381,7 @@ Node22 - + std::ifstream::eof @@ -396,7 +396,7 @@ Node23 - + std::getline @@ -427,7 +427,7 @@ Node25 - + std::ifstream::is_open @@ -458,7 +458,7 @@ Node30 - + std::ifstream::open @@ -504,7 +504,7 @@ Node33 - + std::stod @@ -537,7 +537,7 @@ Node27 - + std::max @@ -552,7 +552,7 @@ Node28 - + std::min @@ -567,7 +567,7 @@ Node29 - + std::vector::size diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4ff6b340d0e460d3015ad601a568b6_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4ff6b340d0e460d3015ad601a568b6_cgraph.svg index fd00b6d9e..ff70bfbfe 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4ff6b340d0e460d3015ad601a568b6_cgraph.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4ff6b340d0e460d3015ad601a568b6_cgraph.svg @@ -119,7 +119,7 @@ var sectionId = 'dynsection-4'; Node5 - + std::vector::emplace_back @@ -149,7 +149,7 @@ var sectionId = 'dynsection-4'; Node7 - + std::endl @@ -164,7 +164,7 @@ var sectionId = 'dynsection-4'; Node8 - + std::exit @@ -195,7 +195,7 @@ var sectionId = 'dynsection-4'; Node10 - + std::vector::push_back diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4ff6b340d0e460d3015ad601a568b6_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4ff6b340d0e460d3015ad601a568b6_cgraph_org.svg index dad2f1bbb..2c80a8fa2 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4ff6b340d0e460d3015ad601a568b6_cgraph_org.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4ff6b340d0e460d3015ad601a568b6_cgraph_org.svg @@ -73,7 +73,7 @@ Node5 - + std::vector::emplace_back @@ -103,7 +103,7 @@ Node7 - + std::endl @@ -118,7 +118,7 @@ Node8 - + std::exit @@ -149,7 +149,7 @@ Node10 - + std::vector::push_back diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.svg index 584e2a9ef..e8aac88e9 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.svg @@ -23,7 +23,7 @@ Node2 - + std::string::c_str @@ -38,7 +38,7 @@ Node3 - + std::ofstream::close @@ -53,7 +53,7 @@ Node4 - + std::endl @@ -68,7 +68,7 @@ Node5 - + std::exit @@ -83,7 +83,7 @@ Node6 - + std::string::find @@ -114,7 +114,7 @@ Node8 - + std::ofstream::is_open @@ -129,7 +129,7 @@ Node9 - + std::ofstream::open diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.svg index f0e242fdb..bd3fa8b07 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.svg @@ -165,7 +165,7 @@ var sectionId = 'dynsection-8'; Node7 - + std::endl @@ -180,7 +180,7 @@ var sectionId = 'dynsection-8'; Node8 - + std::exit @@ -258,7 +258,7 @@ var sectionId = 'dynsection-8'; Node22 - + std::min @@ -273,7 +273,7 @@ var sectionId = 'dynsection-8'; Node23 - + std::chrono::high_resolution _clock::now @@ -289,7 +289,7 @@ var sectionId = 'dynsection-8'; Node24 - + std::vector::resize @@ -310,7 +310,7 @@ var sectionId = 'dynsection-8'; Node26 - + std::vector::size @@ -377,7 +377,7 @@ var sectionId = 'dynsection-8'; Node5 - + std::vector::emplace_back @@ -416,7 +416,7 @@ var sectionId = 'dynsection-8'; Node10 - + std::vector::push_back @@ -449,7 +449,7 @@ var sectionId = 'dynsection-8'; Node12 - + std::begin @@ -464,7 +464,7 @@ var sectionId = 'dynsection-8'; Node13 - + std::distance @@ -479,7 +479,7 @@ var sectionId = 'dynsection-8'; Node14 - + std::end @@ -494,7 +494,7 @@ var sectionId = 'dynsection-8'; Node15 - + std::max_element @@ -521,7 +521,7 @@ var sectionId = 'dynsection-8'; Node17 - + std::chrono::system _clock::now @@ -537,7 +537,7 @@ var sectionId = 'dynsection-8'; Node18 - + std::rand @@ -552,7 +552,7 @@ var sectionId = 'dynsection-8'; Node19 - + std::srand @@ -567,7 +567,7 @@ var sectionId = 'dynsection-8'; Node20 - + std::swap @@ -648,7 +648,7 @@ var sectionId = 'dynsection-8'; Node31 - + std::vector::back @@ -663,7 +663,7 @@ var sectionId = 'dynsection-8'; Node32 - + std::string::c_str @@ -678,7 +678,7 @@ var sectionId = 'dynsection-8'; Node33 - + std::ifstream::close @@ -693,7 +693,7 @@ var sectionId = 'dynsection-8'; Node34 - + std::ifstream::eof @@ -708,7 +708,7 @@ var sectionId = 'dynsection-8'; Node35 - + std::getline @@ -739,7 +739,7 @@ var sectionId = 'dynsection-8'; Node37 - + std::ifstream::is_open @@ -770,7 +770,7 @@ var sectionId = 'dynsection-8'; Node40 - + std::ifstream::open @@ -816,7 +816,7 @@ var sectionId = 'dynsection-8'; Node43 - + std::stod @@ -861,7 +861,7 @@ var sectionId = 'dynsection-8'; Node39 - + std::max diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph_org.svg index 633aee6bc..986008dd8 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph_org.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph_org.svg @@ -119,7 +119,7 @@ Node7 - + std::endl @@ -134,7 +134,7 @@ Node8 - + std::exit @@ -212,7 +212,7 @@ Node22 - + std::min @@ -227,7 +227,7 @@ Node23 - + std::chrono::high_resolution _clock::now @@ -243,7 +243,7 @@ Node24 - + std::vector::resize @@ -264,7 +264,7 @@ Node26 - + std::vector::size @@ -331,7 +331,7 @@ Node5 - + std::vector::emplace_back @@ -370,7 +370,7 @@ Node10 - + std::vector::push_back @@ -403,7 +403,7 @@ Node12 - + std::begin @@ -418,7 +418,7 @@ Node13 - + std::distance @@ -433,7 +433,7 @@ Node14 - + std::end @@ -448,7 +448,7 @@ Node15 - + std::max_element @@ -475,7 +475,7 @@ Node17 - + std::chrono::system _clock::now @@ -491,7 +491,7 @@ Node18 - + std::rand @@ -506,7 +506,7 @@ Node19 - + std::srand @@ -521,7 +521,7 @@ Node20 - + std::swap @@ -602,7 +602,7 @@ Node31 - + std::vector::back @@ -617,7 +617,7 @@ Node32 - + std::string::c_str @@ -632,7 +632,7 @@ Node33 - + std::ifstream::close @@ -647,7 +647,7 @@ Node34 - + std::ifstream::eof @@ -662,7 +662,7 @@ Node35 - + std::getline @@ -693,7 +693,7 @@ Node37 - + std::ifstream::is_open @@ -724,7 +724,7 @@ Node40 - + std::ifstream::open @@ -770,7 +770,7 @@ Node43 - + std::stod @@ -815,7 +815,7 @@ Node39 - + std::max diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.svg index 9af04505a..3b3703382 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.svg @@ -23,7 +23,7 @@ Node2 - + std::string::c_str @@ -38,7 +38,7 @@ Node3 - + std::ifstream::close @@ -53,7 +53,7 @@ Node4 - + std::vector::emplace_back @@ -68,7 +68,7 @@ Node5 - + std::endl @@ -83,7 +83,7 @@ Node6 - + std::exit @@ -98,7 +98,7 @@ Node7 - + std::ifstream::is_open @@ -130,7 +130,7 @@ Node9 - + std::ifstream::open @@ -145,7 +145,7 @@ Node10 - + std::vector::push_back diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.svg index 48f04d563..be79b5a0f 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.svg @@ -23,7 +23,7 @@ Node2 - + std::endl diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8d983ebb3225a9901b713a0f05b44aba_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8d983ebb3225a9901b713a0f05b44aba_cgraph.svg index e68c68a79..79fae9d25 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8d983ebb3225a9901b713a0f05b44aba_cgraph.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8d983ebb3225a9901b713a0f05b44aba_cgraph.svg @@ -69,7 +69,7 @@ var sectionId = 'dynsection-9'; Node2 - + std::vector::back @@ -84,7 +84,7 @@ var sectionId = 'dynsection-9'; Node3 - + std::string::c_str @@ -99,7 +99,7 @@ var sectionId = 'dynsection-9'; Node4 - + std::ifstream::close @@ -114,7 +114,7 @@ var sectionId = 'dynsection-9'; Node5 - + std::endl @@ -129,7 +129,7 @@ var sectionId = 'dynsection-9'; Node6 - + std::ifstream::eof @@ -144,7 +144,7 @@ var sectionId = 'dynsection-9'; Node7 - + std::exit @@ -159,7 +159,7 @@ var sectionId = 'dynsection-9'; Node8 - + std::getline @@ -190,7 +190,7 @@ var sectionId = 'dynsection-9'; Node10 - + std::ifstream::is_open @@ -221,7 +221,7 @@ var sectionId = 'dynsection-9'; Node16 - + std::ifstream::open @@ -267,7 +267,7 @@ var sectionId = 'dynsection-9'; Node19 - + std::vector::push_back @@ -282,7 +282,7 @@ var sectionId = 'dynsection-9'; Node20 - + std::stod @@ -325,7 +325,7 @@ var sectionId = 'dynsection-9'; Node13 - + std::max @@ -340,7 +340,7 @@ var sectionId = 'dynsection-9'; Node14 - + std::min @@ -355,7 +355,7 @@ var sectionId = 'dynsection-9'; Node15 - + std::vector::size diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8d983ebb3225a9901b713a0f05b44aba_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8d983ebb3225a9901b713a0f05b44aba_cgraph_org.svg index d2ed25176..5057a71ba 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8d983ebb3225a9901b713a0f05b44aba_cgraph_org.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8d983ebb3225a9901b713a0f05b44aba_cgraph_org.svg @@ -23,7 +23,7 @@ Node2 - + std::vector::back @@ -38,7 +38,7 @@ Node3 - + std::string::c_str @@ -53,7 +53,7 @@ Node4 - + std::ifstream::close @@ -68,7 +68,7 @@ Node5 - + std::endl @@ -83,7 +83,7 @@ Node6 - + std::ifstream::eof @@ -98,7 +98,7 @@ Node7 - + std::exit @@ -113,7 +113,7 @@ Node8 - + std::getline @@ -144,7 +144,7 @@ Node10 - + std::ifstream::is_open @@ -175,7 +175,7 @@ Node16 - + std::ifstream::open @@ -221,7 +221,7 @@ Node19 - + std::vector::push_back @@ -236,7 +236,7 @@ Node20 - + std::stod @@ -279,7 +279,7 @@ Node13 - + std::max @@ -294,7 +294,7 @@ Node14 - + std::min @@ -309,7 +309,7 @@ Node15 - + std::vector::size diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8f8eb4423c57a00b0ab46de226bc6509_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8f8eb4423c57a00b0ab46de226bc6509_cgraph.svg index a03ff9a3c..a589aa002 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8f8eb4423c57a00b0ab46de226bc6509_cgraph.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8f8eb4423c57a00b0ab46de226bc6509_cgraph.svg @@ -116,7 +116,7 @@ var sectionId = 'dynsection-7'; Node6 - + std::endl @@ -131,7 +131,7 @@ var sectionId = 'dynsection-7'; Node7 - + std::exit @@ -209,7 +209,7 @@ var sectionId = 'dynsection-7'; Node21 - + std::min @@ -224,7 +224,7 @@ var sectionId = 'dynsection-7'; Node22 - + std::chrono::high_resolution _clock::now @@ -240,7 +240,7 @@ var sectionId = 'dynsection-7'; Node23 - + std::vector::resize @@ -270,7 +270,7 @@ var sectionId = 'dynsection-7'; Node25 - + std::vector::size @@ -337,7 +337,7 @@ var sectionId = 'dynsection-7'; Node4 - + std::vector::emplace_back @@ -376,7 +376,7 @@ var sectionId = 'dynsection-7'; Node9 - + std::vector::push_back @@ -409,7 +409,7 @@ var sectionId = 'dynsection-7'; Node11 - + std::begin @@ -424,7 +424,7 @@ var sectionId = 'dynsection-7'; Node12 - + std::distance @@ -439,7 +439,7 @@ var sectionId = 'dynsection-7'; Node13 - + std::end @@ -454,7 +454,7 @@ var sectionId = 'dynsection-7'; Node14 - + std::max_element @@ -481,7 +481,7 @@ var sectionId = 'dynsection-7'; Node16 - + std::chrono::system _clock::now @@ -497,7 +497,7 @@ var sectionId = 'dynsection-7'; Node17 - + std::rand @@ -512,7 +512,7 @@ var sectionId = 'dynsection-7'; Node18 - + std::srand @@ -527,7 +527,7 @@ var sectionId = 'dynsection-7'; Node19 - + std::swap diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8f8eb4423c57a00b0ab46de226bc6509_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8f8eb4423c57a00b0ab46de226bc6509_cgraph_org.svg index 74bcfbcf8..f77feea42 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8f8eb4423c57a00b0ab46de226bc6509_cgraph_org.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8f8eb4423c57a00b0ab46de226bc6509_cgraph_org.svg @@ -70,7 +70,7 @@ Node6 - + std::endl @@ -85,7 +85,7 @@ Node7 - + std::exit @@ -163,7 +163,7 @@ Node21 - + std::min @@ -178,7 +178,7 @@ Node22 - + std::chrono::high_resolution _clock::now @@ -194,7 +194,7 @@ Node23 - + std::vector::resize @@ -224,7 +224,7 @@ Node25 - + std::vector::size @@ -291,7 +291,7 @@ Node4 - + std::vector::emplace_back @@ -330,7 +330,7 @@ Node9 - + std::vector::push_back @@ -363,7 +363,7 @@ Node11 - + std::begin @@ -378,7 +378,7 @@ Node12 - + std::distance @@ -393,7 +393,7 @@ Node13 - + std::end @@ -408,7 +408,7 @@ Node14 - + std::max_element @@ -435,7 +435,7 @@ Node16 - + std::chrono::system _clock::now @@ -451,7 +451,7 @@ Node17 - + std::rand @@ -466,7 +466,7 @@ Node18 - + std::srand @@ -481,7 +481,7 @@ Node19 - + std::swap diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8f984bfd3e32b9b71c33a4f62335c710_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8f984bfd3e32b9b71c33a4f62335c710_cgraph.svg index 8da4d34cc..3ef1d106c 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8f984bfd3e32b9b71c33a4f62335c710_cgraph.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a8f984bfd3e32b9b71c33a4f62335c710_cgraph.svg @@ -23,7 +23,7 @@ Node2 - + std::endl @@ -38,7 +38,7 @@ Node3 - + std::exit diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_ac130322a5abb1ff763b7c1a55405a35e_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_ac130322a5abb1ff763b7c1a55405a35e_cgraph.svg index fddcd6bdd..0eda67fce 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_ac130322a5abb1ff763b7c1a55405a35e_cgraph.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_ac130322a5abb1ff763b7c1a55405a35e_cgraph.svg @@ -102,7 +102,7 @@ var sectionId = 'dynsection-12'; Node4 - + std::vector::emplace_back @@ -132,7 +132,7 @@ var sectionId = 'dynsection-12'; Node6 - + std::endl @@ -147,7 +147,7 @@ var sectionId = 'dynsection-12'; Node7 - + std::exit @@ -178,7 +178,7 @@ var sectionId = 'dynsection-12'; Node9 - + std::vector::push_back diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_ac130322a5abb1ff763b7c1a55405a35e_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_ac130322a5abb1ff763b7c1a55405a35e_cgraph_org.svg index 05b54e95c..9789f0058 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_ac130322a5abb1ff763b7c1a55405a35e_cgraph_org.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_ac130322a5abb1ff763b7c1a55405a35e_cgraph_org.svg @@ -56,7 +56,7 @@ Node4 - + std::vector::emplace_back @@ -86,7 +86,7 @@ Node6 - + std::endl @@ -101,7 +101,7 @@ Node7 - + std::exit @@ -132,7 +132,7 @@ Node9 - + std::vector::push_back diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_acd397b51fcf8f690b03e406ada8c9d13_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_acd397b51fcf8f690b03e406ada8c9d13_cgraph.svg index 641dfbf74..a463c41fa 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_acd397b51fcf8f690b03e406ada8c9d13_cgraph.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_acd397b51fcf8f690b03e406ada8c9d13_cgraph.svg @@ -39,7 +39,7 @@ Node3 - + std::vector::emplace_back @@ -69,7 +69,7 @@ Node5 - + std::endl @@ -84,7 +84,7 @@ Node6 - + std::exit @@ -115,7 +115,7 @@ Node8 - + std::vector::push_back diff --git a/d4/dfb/namespacecycle__sort.html b/d4/dfb/namespacecycle__sort.html index 0bd98e03d..409c09372 100644 --- a/d4/dfb/namespacecycle__sort.html +++ b/d4/dfb/namespacecycle__sort.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: cycle_sort Namespace Reference @@ -42,10 +42,10 @@
    - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d4/dfb/namespacecycle__sort.html','../ diff --git a/d5/d02/namespacehorspool.html b/d5/d02/namespacehorspool.html index 884341c1c..815822937 100644 --- a/d5/d02/namespacehorspool.html +++ b/d5/d02/namespacehorspool.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: horspool Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d5/d02/namespacehorspool.html','../../ diff --git a/d5/d08/classgraph_1_1_graph__coll__graph.svg b/d5/d08/classgraph_1_1_graph__coll__graph.svg index e63766d61..3f14fe9f7 100644 --- a/d5/d08/classgraph_1_1_graph__coll__graph.svg +++ b/d5/d08/classgraph_1_1_graph__coll__graph.svg @@ -21,7 +21,7 @@ Node2 - + std::vector< std::vector < int > > @@ -38,7 +38,7 @@ Node3 - + std::vector< int > @@ -54,7 +54,7 @@ Node4 - + std::map< T, std::list < T > > diff --git a/d5/d15/classcll.html b/d5/d15/classcll.html index 6451d5df8..e838fa6fa 100644 --- a/d5/d15/classcll.html +++ b/d5/d15/classcll.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: cll Class Reference @@ -42,10 +42,10 @@ - + @@ -148,7 +148,7 @@ int total diff --git a/d5/d29/struct_min_heap_node.html b/d5/d29/struct_min_heap_node.html index b8467d1e8..4bfaea4c6 100644 --- a/d5/d29/struct_min_heap_node.html +++ b/d5/d29/struct_min_heap_node.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: MinHeapNode Struct Reference @@ -42,10 +42,10 @@ - + @@ -135,7 +135,7 @@ unsigned freq
    • MinHeapNode
      • -
    • Generated by doxygen 1.8.20
      • +
    • Generated by doxygen 1.9.1
    diff --git a/d5/d2c/namespacelayers.html b/d5/d2c/namespacelayers.html index b92f17f55..7100943d9 100644 --- a/d5/d2c/namespacelayers.html +++ b/d5/d2c/namespacelayers.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: layers Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,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 8f36e915a..bb4394516 100644 --- a/d5/d33/gram__schmidt_8cpp.html +++ b/d5/d33/gram__schmidt_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: linear_algebra/gram_schmidt.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -140,7 +140,7 @@ Functions

    Detailed Description

    Gram Schmidt Orthogonalisation Process

    Takes the input of Linearly Independent Vectors, returns vectors orthogonal to each other.

    -

    +

    Algorithm

    Take the first vector of given LI vectors as first vector of Orthogonal vectors. Take projection of second input vector on the first vector of Orthogonal vector and subtract it from the 2nd LI vector. Take projection of third vector on the second vector of Othogonal vectors and subtract it from the 3rd LI vector. Keep repeating the above process until all the vectors in the given input array are exhausted.

    For Example: In R2, Input LI Vectors={(3,1),(2,2)} then Orthogonal Vectors= {(3, 1),(-0.4, 1.2)}

    @@ -197,6 +197,7 @@ Algorithm
    108  std::cout << '\n';
    109  }
    110 }
    +
    @@ -247,6 +248,7 @@ Algorithm
    64  }
    65  return sum;
    66 }
    +
    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:
    @@ -314,7 +316,7 @@ Here is the call graph for this function:

    subtract total projection vector from the input vector

    123  {
    124  if (c < r) { /// we check whether appropriate dimensions are given or not.
    -
    125  std::cout << "Dimension of vector is less than number of vector, hence "
    +
    125  std::cout << "Dimension of vector is less than number of vector, hence "
    126  "\n first "
    127  << c << " vectors are orthogonalised\n";
    128  r = c;
    @@ -326,44 +328,46 @@ Here is the call graph for this function:
    134  if (k == 1) {
    135  for (int j = 0; j < c; j++)
    136  B[0][j] = A[0][j]; /// First vector is copied as it is.
    -
    137  }
    +
    137  }
    138 
    139  else {
    140  std::array<double, 10>
    141  all_projection{}; /// array to store projections
    -
    142  for (int i = 0; i < c; ++i) {
    +
    142  for (int i = 0; i < c; ++i) {
    143  all_projection[i] = 0; /// First initialised to zero
    -
    144  }
    +
    144  }
    145 
    146  int l = 1;
    147  while (l < k) {
    148  std::array<double, 10>
    149  temp{}; /// to store previous projected array
    -
    150  double factor = NAN; /// to store the factor by which the
    -
    151  /// previous array will change
    +
    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);
    153  for (int i = 0; i < c; ++i) {
    154  temp[i] = B[l - 1][i] * factor; /// projected array created
    -
    155  }
    +
    155  }
    156  for (int j = 0; j < c; ++j) {
    157  all_projection[j] =
    158  all_projection[j] +
    -
    159  temp[j]; /// we take the projection with all the
    -
    160  /// previous vector and add them.
    +
    159  temp[j]; /// we take the projection with all the
    +
    160  /// previous vector and add them.
    161  }
    162  l++;
    163  }
    164  for (int i = 0; i < c; ++i) {
    165  B[k - 1][i] =
    166  A[k - 1][i] -
    -
    167  all_projection[i]; /// subtract total projection vector
    -
    168  /// from the input vector
    +
    167  all_projection[i]; /// subtract total projection vector
    +
    168  /// from the input vector
    169  }
    170  }
    171  k++;
    172  }
    173  display(r, c, B); // for displaying orthogoanlised vectors
    174 }
    + +
    linear_algebra::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:
    @@ -407,13 +411,13 @@ Here is the call graph for this function:
    255 
    256  std::array<std::array<double, 10>, 20>
    257  A{}; /// a 2-D array for storing all vectors
    -
    258  std::array<std::array<double, 10>, 20> B = {
    -
    259  {0}}; /// a 2-D array for storing orthogonalised vectors
    -
    260  /// storing vectors in array A
    +
    258  std::array<std::array<double, 10>, 20> B = {
    +
    259  {0}}; /// a 2-D array for storing orthogonalised vectors
    +
    260  /// storing vectors in array A
    261  for (int i = 0; i < r; ++i) {
    262  std::cout << "Enter vector " << i + 1
    263  << '\n'; /// Input of vectors is taken
    -
    264  for (int j = 0; j < c; ++j) {
    +
    264  for (int j = 0; j < c; ++j) {
    265  std::cout << "Value " << j + 1 << "th of vector: ";
    266  std::cin >> A[i][j];
    267  }
    @@ -424,12 +428,12 @@ Here is the call graph for this function:
    272 
    273  double dot = 0;
    274  int flag = 1; /// To check whether vectors are orthogonal or not
    -
    275  for (int i = 0; i < r - 1; ++i) {
    +
    275  for (int i = 0; i < r - 1; ++i) {
    276  for (int j = i + 1; j < r; ++j) {
    277  dot =
    278  fabs(linear_algebra::gram_schmidt::dot_product(B[i], B[j], c));
    -
    279  if (dot > 0.1) /// take make the process numerically stable, upper
    -
    280  /// bound for the dot product take 0.1
    +
    279  if (dot > 0.1) /// take make the process numerically stable, upper
    +
    280  /// bound for the dot product take 0.1
    281  {
    282  flag = 0;
    283  break;
    @@ -440,6 +444,10 @@ Here is the call graph for this function:
    288  std::cout << "Vectors are linearly dependent\n";
    289  return 0;
    290 }
    + +
    std::fabs
    T fabs(T... args)
    +
    linear_algebra::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:
    @@ -496,14 +504,15 @@ Here is the call graph for this function:
    80  {
    81  double dot =
    82  dot_product(x, y, c); /// The dot product of two vectors is taken
    -
    83  double anorm =
    +
    83  double anorm =
    84  dot_product(y, y, c); /// The norm of the second vector is taken.
    -
    85  double factor =
    +
    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.
    +
    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 }
    +
    linear_algebra::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:
    @@ -603,20 +612,11 @@ Here is the call graph for this function:
    -
    test
    static void test()
    Definition: gram_schmidt.cpp:181
    -
    std::fabs
    T fabs(T... args)
    -
    linear_algebra::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
    -
    linear_algebra::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
    - -
    std::array
    STL class.
    -
    linear_algebra::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
    - -
    machine_learning::sum
    T sum(const std::vector< std::valarray< T >> &A)
    Definition: vector_ops.hpp:232
    diff --git a/d5/d39/namespaceactivations.html b/d5/d39/namespaceactivations.html index f7104b051..88d1abcf4 100644 --- a/d5/d39/namespaceactivations.html +++ b/d5/d39/namespaceactivations.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: activations Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d5/d39/namespaceactivations.html','../ diff --git a/d5/d3c/namespacedata__structures.html b/d5/d3c/namespacedata__structures.html index e45f5fbd3..43ebe3c8f 100644 --- a/d5/d3c/namespacedata__structures.html +++ b/d5/d3c/namespacedata__structures.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: data_structures Namespace Reference @@ -42,10 +42,10 @@ - + @@ -127,7 +127,7 @@ constexpr float for std::to_string

    Data-structure algorithms.

    Algorithms with data structures.

    -

    for std::array for assert for std::ofstream for std::cout for std::unique_ptr for std::queue

    +

    for std::array for assert for std::ofstream for std::cout for std::unique_ptr for std::queue

    Algorithms with data structures

    @@ -135,7 +135,7 @@ constexpr float  diff --git a/d5/d3c/namespacedata__structures.js b/d5/d3c/namespacedata__structures.js index 7bfbc63fb..5b158ef10 100644 --- a/d5/d3c/namespacedata__structures.js +++ b/d5/d3c/namespacedata__structures.js @@ -2,7 +2,8 @@ var namespacedata__structures = [ [ "linked_list", null, [ [ "link", "de/d9d/classdata__structures_1_1linked__list_1_1link.html", "de/d9d/classdata__structures_1_1linked__list_1_1link" ], - [ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ] + [ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ], + [ "isDigit", "da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180", null ] ] ], [ "queue_using_array", null, [ [ "Queue_Array", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array" ] @@ -13,5 +14,7 @@ var namespacedata__structures = ] ], [ "Node", "d9/d49/structdata__structures_1_1_node.html", "d9/d49/structdata__structures_1_1_node" ], [ "SkipList", "d4/d90/classdata__structures_1_1_skip_list.html", "d4/d90/classdata__structures_1_1_skip_list" ], - [ "trie", "d0/d3e/classdata__structures_1_1trie.html", "d0/d3e/classdata__structures_1_1trie" ] + [ "trie", "d0/d3e/classdata__structures_1_1trie.html", "d0/d3e/classdata__structures_1_1trie" ], + [ "MAX_LEVEL", "d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a", null ], + [ "PROBABILITY", "d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61", null ] ]; \ No newline at end of file diff --git a/d5/d4c/group__sorting.html b/d5/d4c/group__sorting.html index bbc10cc1f..8a55700c4 100644 --- a/d5/d4c/group__sorting.html +++ b/d5/d4c/group__sorting.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Sorting Algorithm @@ -42,10 +42,10 @@ - + @@ -92,7 +92,6 @@ $(document).ready(function(){initNavTree('d5/d4c/group__sorting.html','../../');
    Files | -Namespaces | Functions
    Sorting Algorithm
    @@ -108,12 +107,6 @@ Files  Wiggle Sort Algorithm Implementation
      - - - - -

    -Namespaces

     sorting
     Sorting algorithms.
     

    Functions

    @@ -200,6 +193,9 @@ template<typename T >
    98 
    99  std::cout << "]" << std::endl;
    100 }
    + +
    std::endl
    T endl(T... args)
    +
    std::vector::size
    T size(T... args)
    @@ -246,6 +242,7 @@ template<typename T >
    89  heapify(arr, i, 0);
    90  }
    91 }
    +
    std::swap
    T swap(T... args)
    @@ -281,6 +278,9 @@ template<typename T >
    102  delete[] arr;
    103  return 0;
    104 }
    + +
    show
    void show(int *arr, int size)
    Definition: merge_sort.cpp:84
    +
    mergeSort
    void mergeSort(int *arr, int l, int r)
    Definition: merge_sort.cpp:71
    @@ -415,6 +415,7 @@ template<typename T >
    76  merge(arr, l, m, r);
    77  }
    78 }
    +
    merge
    void merge(int *arr, int l, int m, int r)
    Definition: merge_sort.cpp:33
    Here is the call graph for this function:
    @@ -499,10 +500,15 @@ 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
    +
    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:
    -
    +
    @@ -510,23 +516,10 @@ Here is the call graph for this function:
    -
    std::srand
    T srand(T... args)
    -
    std::vector
    STL class.
    -
    std::vector::size
    T size(T... args)
    -
    show
    void show(int *arr, int size)
    Definition: merge_sort.cpp:84
    -
    mergeSort
    void mergeSort(int *arr, int l, int r)
    Definition: merge_sort.cpp:71
    - -
    merge
    void merge(int *arr, int l, int m, int r)
    Definition: merge_sort.cpp:33
    -
    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::swap
    T swap(T... args)
    -
    std::endl
    T endl(T... args)
    -
    std::time
    T time(T... args)
    - diff --git a/d5/d4c/group__sorting.js b/d5/d4c/group__sorting.js index 29ca31830..c5a0d6da1 100644 --- a/d5/d4c/group__sorting.js +++ b/d5/d4c/group__sorting.js @@ -2,7 +2,6 @@ var group__sorting = [ [ "merge_sort.cpp", "d5/df4/merge__sort_8cpp.html", null ], [ "wiggle_sort.cpp", "d1/dcc/wiggle__sort_8cpp.html", null ], - [ "sorting", "d5/d91/namespacesorting.html", null ], [ "displayElements", "d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72", null ], [ "heapSort", "d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f", null ], [ "main", "d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4", null ], diff --git a/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.map index 774730826..837261c23 100644 --- a/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.map +++ b/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -1,7 +1,8 @@ - + - - + + + diff --git a/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.md5 index edfe1eedc..6f045dd5a 100644 --- a/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.md5 +++ b/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -1 +1 @@ -41ff53f51a93e0a29abc3e8135681538 \ No newline at end of file +137d724c82716f591a92ebe98d4f074e \ No newline at end of file diff --git a/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 61ec10785..268434cdb 100644 --- a/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -4,17 +4,17 @@ - - + + test - + Node1 - -test + +test @@ -22,61 +22,76 @@ Node2 - -displayElements + +displayElements Node1->Node2 - - + + Node3 - - -std::rand + + +std::rand Node1->Node3 - - + + Node4 - - -std::srand + + +std::vector::size Node1->Node4 - - + + Node5 - - -std::time + + +std::srand Node1->Node5 - - + + + + + +Node6 + + +std::time + + + + + +Node1->Node6 + + diff --git a/d5/d55/classgraph_1_1_rooted_tree-members.html b/d5/d55/classgraph_1_1_rooted_tree-members.html index d8295cc29..555ba123d 100644 --- a/d5/d55/classgraph_1_1_rooted_tree-members.html +++ b/d5/d55/classgraph_1_1_rooted_tree-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@
    - + @@ -114,7 +114,7 @@ $(document).ready(function(){initNavTree('d0/d58/classgraph_1_1_rooted_tree.html diff --git a/d5/d5f/namespacegeometry.html b/d5/d5f/namespacegeometry.html index a27b5b314..393e66575 100644 --- a/d5/d5f/namespacegeometry.html +++ b/d5/d5f/namespacegeometry.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: geometry Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d5/d5f/namespacegeometry.html','../../ diff --git a/d5/d5f/namespacegeometry.js b/d5/d5f/namespacegeometry.js index 3e3c46e81..0d82909e3 100644 --- a/d5/d5f/namespacegeometry.js +++ b/d5/d5f/namespacegeometry.js @@ -1,7 +1,7 @@ var namespacegeometry = [ [ "jarvis", null, [ - [ "Convexhull", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull" ], - [ "Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", "d9/d5a/structgeometry_1_1jarvis_1_1_point" ] + [ "Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", "d9/d5a/structgeometry_1_1jarvis_1_1_point" ], + [ "Convexhull", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull" ] ] ] ]; \ No newline at end of file diff --git a/d5/d67/bayes__theorem_8cpp.html b/d5/d67/bayes__theorem_8cpp.html index 45b73d269..72cd495dd 100644 --- a/d5/d67/bayes__theorem_8cpp.html +++ b/d5/d67/bayes__theorem_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: probability/bayes_theorem.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -222,6 +222,10 @@ Note that \(P(A|B)\) is read 'The probability of A given that the event B has oc
    32  std::cout << "B given A = " << bayes_BgivenA(AgivenB, A, B) << std::endl;
    33  return 0;
    34 }
    + +
    bayes_AgivenB
    double bayes_AgivenB(double BgivenA, double A, double B)
    Definition: bayes_theorem.cpp:14
    +
    bayes_BgivenA
    double bayes_BgivenA(double AgivenB, double A, double B)
    Definition: bayes_theorem.cpp:20
    +
    std::endl
    T endl(T... args)
    Here is the call graph for this function:
    @@ -233,15 +237,11 @@ Here is the call graph for this function:
    - -
    bayes_BgivenA
    double bayes_BgivenA(double AgivenB, double A, double B)
    Definition: bayes_theorem.cpp:20
    -
    std::endl
    T endl(T... args)
    -
    bayes_AgivenB
    double bayes_AgivenB(double BgivenA, double A, double B)
    Definition: bayes_theorem.cpp:14
    diff --git a/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 4ae1e5b84..614e1e9ed 100644 --- a/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -51,7 +51,7 @@ Node4 - + std::endl diff --git a/d5/d67/complex__numbers_8cpp.html b/d5/d67/complex__numbers_8cpp.html index 6aaa95cf1..631cae22e 100644 --- a/d5/d67/complex__numbers_8cpp.html +++ b/d5/d67/complex__numbers_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/complex_numbers.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -161,6 +161,7 @@ double  269  tests();
    270  return 0;
    271 }
    +
    tests
    void tests()
    Definition: complex_numbers.cpp:206
    Here is the call graph for this function:
    @@ -214,6 +215,8 @@ Here is the call graph for this function:
    193  os << "i)";
    194  return os;
    195 }
    +
    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
    Here is the call graph for this function:
    @@ -345,6 +348,16 @@ Here is the call graph for this function:
    261  (num1.abs() == std::abs(cnum1))));
    262  std::cout << "Seventh test passes.\n";
    263 }
    + +
    Complex
    Class Complex to represent complex numbers as a field.
    Definition: complex_numbers.cpp:20
    +
    get_rand
    double get_rand()
    Function to get random numbers to generate our complex numbers for test.
    Definition: complex_numbers.cpp:201
    + +
    std::endl
    T endl(T... args)
    +
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition: fibonacci_sum.cpp:76
    +
    std::complex::imag
    T imag(T... args)
    +
    std::complex::real
    T real(T... args)
    +
    std::srand
    T srand(T... args)
    +
    std::time
    T time(T... args)
    Here is the call graph for this function:
    @@ -356,24 +369,11 @@ Here is the call graph for this function:
    -
    std::srand
    T srand(T... args)
    -
    Complex
    Class Complex to represent complex numbers as a field.
    Definition: complex_numbers.cpp:20
    -
    get_rand
    double get_rand()
    Function to get random numbers to generate our complex numbers for test.
    Definition: complex_numbers.cpp:201
    -
    tests
    void tests()
    Definition: complex_numbers.cpp:206
    -
    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
    - -
    std::complex::real
    T real(T... args)
    -
    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
    -
    std::endl
    T endl(T... args)
    -
    std::complex
    STL class.
    -
    std::complex::imag
    T imag(T... args)
    -
    std::time
    T time(T... args)
    -
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition: fibonacci_sum.cpp:76
    diff --git a/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg index cecab3c7e..842d61b9b 100644 --- a/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg +++ b/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -51,7 +51,7 @@ Node5 - + std::complex::imag @@ -66,7 +66,7 @@ Node6 - + std::complex::real @@ -81,7 +81,7 @@ Node7 - + std::srand @@ -96,7 +96,7 @@ Node8 - + std::time @@ -111,7 +111,7 @@ Node4 - + std::rand diff --git a/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 37ea5b740..4abe69d7a 100644 --- a/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::endl @@ -66,7 +66,7 @@ Node6 - + std::complex::imag @@ -81,7 +81,7 @@ Node7 - + std::complex::real @@ -96,7 +96,7 @@ Node8 - + std::srand @@ -111,7 +111,7 @@ Node9 - + std::time @@ -126,7 +126,7 @@ Node5 - + std::rand diff --git a/d5/d7a/largest__power_8cpp.html b/d5/d7a/largest__power_8cpp.html index 5bb6f98a1..d0a4b89ba 100644 --- a/d5/d7a/largest__power_8cpp.html +++ b/d5/d7a/largest__power_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/largest_power.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -112,7 +112,7 @@ Include dependency graph for largest_power.cpp:

    Namespaces

     math - for std::vector
    + for std::vector
     
    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
    Here is the call graph for this function:
    @@ -209,6 +210,9 @@ Here is the call graph for this function:
    66  assert(test_case_5==2);
    67  std::cout<<"Test 5 Passed!"<<std::endl;
    68 }
    + +
    std::endl
    T endl(T... args)
    +
    math::largestPower
    uint64_t largestPower(uint32_t n, const uint16_t &p)
    Function to calculate largest power.
    Definition: largest_power.cpp:26
    Here is the call graph for this function:
    @@ -220,15 +224,11 @@ Here is the call graph for this function:
    -
    test
    static void test()
    Function for testing largestPower function. test cases and assert statement.
    Definition: largest_power.cpp:47
    - -
    std::endl
    T endl(T... args)
    -
    math::largestPower
    uint64_t largestPower(uint32_t n, const uint16_t &p)
    Function to calculate largest power.
    Definition: largest_power.cpp:26
    diff --git a/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 7028d7975..d2c071c9d 100644 --- a/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 9699dec35..56db72033 100644 --- a/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::endl diff --git a/d5/d83/lcm__sum_8cpp.html b/d5/d83/lcm__sum_8cpp.html index a97af4543..081739d18 100644 --- a/d5/d83/lcm__sum_8cpp.html +++ b/d5/d83/lcm__sum_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/lcm_sum.cpp File Reference @@ -42,10 +42,10 @@

    @@ -154,6 +154,7 @@ Functions

    - + @@ -113,7 +113,7 @@ Include dependency graph for lcm_sum.cpp:

    Namespaces

     math - for std::vector
    + for std::vector
     
    97  test(); // execute the tests
    98  return 0;
    99 }
    +
    test
    static void test()
    Definition: lcm_sum.cpp:65
    Here is the call graph for this function:
    @@ -213,6 +214,12 @@ Here is the call graph for this function:
    88  assert(test_5 == 1110);
    89  std::cout << "Passed Test 5!" << std::endl;
    90 }
    + +
    std::endl
    T endl(T... args)
    +
    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
    +
    math::lcmSum
    uint64_t lcmSum(const uint16_t &num)
    Definition: lcm_sum.cpp:29
    Here is the call graph for this function:
    @@ -224,18 +231,11 @@ Here is the call graph for this function:
    -
    math::lcmSum
    uint64_t lcmSum(const uint16_t &num)
    Definition: lcm_sum.cpp:29
    -
    test_3
    static void test_3()
    Definition: heavy_light_decomposition.cpp:592
    -
    test_2
    static void test_2()
    Definition: heavy_light_decomposition.cpp:549
    -
    test
    static void test()
    Definition: lcm_sum.cpp:65
    - -
    test_1
    static void test_1()
    Definition: heavy_light_decomposition.cpp:505
    -
    std::endl
    T endl(T... args)
    diff --git a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map index 8a93290e8..310706624 100644 --- a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map +++ b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -1,26 +1,27 @@ - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 index 2c5a2fcc1..01512d43c 100644 --- a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 +++ b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -1 +1 @@ -667bca0f8cecb1055658de31467871af \ No newline at end of file +42405adb78342cfb193015ccbc96d261 \ No newline at end of file diff --git a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index ba181ed31..c5b082ccd 100644 --- a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -4,7 +4,7 @@ - + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + test2 - + Node1 @@ -80,50 +34,50 @@ var sectionId = 'dynsection-2'; - - -Node12 - + + +Node4 + data_structures::tree _234::Tree234::Print - - -Node1->Node12 + + +Node1->Node4 - - -Node17 - + + +Node9 + std::to_string - - -Node1->Node17 + + +Node1->Node9 - - -Node18 - + + +Node10 + data_structures::tree _234::Tree234::Traverse - - -Node1->Node18 + + +Node1->Node10 @@ -143,247 +97,72 @@ var sectionId = 'dynsection-2'; - - -Node4 - - -std::unique_ptr::get - - - - - -Node3->Node4 - - - Node5 - - -data_structures::tree -_234::Tree234::MergeNodeNotFull - - - - - -Node3->Node5 - - - - - -Node11 - - -data_structures::tree -_234::Tree234::SplitNode - - - - - -Node3->Node11 - - - - - -Node6 - - -data_structures::tree -_234::Node::InsertItem - - - - - -Node5->Node6 - - - - - -Node9 - - -data_structures::tree -_234::Node::IsFull - - - - - -Node5->Node9 - - - - - -Node10 - - -data_structures::tree -_234::Node::SetChild - - - - - -Node5->Node10 - - - - - -Node7 - - -data_structures::tree -_234::Node::Contains - - - - - -Node6->Node7 - - - - - -Node8 - - -data_structures::tree -_234::Node::InsertItemByIndex - - - - - -Node6->Node8 - - - - - -Node6->Node9 - - - - - -Node13 - + std::ofstream::close - - -Node12->Node13 + + +Node4->Node5 - - -Node14 - + + +Node6 + std::endl - - -Node12->Node14 + + +Node4->Node6 - - -Node15 - + + +Node7 + std::ofstream::open - - -Node12->Node15 + + +Node4->Node7 - - -Node16 - + + +Node8 + data_structures::tree _234::Tree234::PrintNode - - -Node12->Node16 + + +Node4->Node8 - - -Node18->Node14 + + +Node10->Node6 - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph_org.svg b/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph_org.svg deleted file mode 100644 index a261c2005..000000000 --- a/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph_org.svg +++ /dev/null @@ -1,301 +0,0 @@ - - - - - - -test2 - - - -Node1 - - -test2 - - - - - -Node2 - - -data_structures::tree -_234::Tree234::Insert - - - - - -Node1->Node2 - - - - - -Node12 - - -data_structures::tree -_234::Tree234::Print - - - - - -Node1->Node12 - - - - - -Node17 - - -std::to_string - - - - - -Node1->Node17 - - - - - -Node18 - - -data_structures::tree -_234::Tree234::Traverse - - - - - -Node1->Node18 - - - - - -Node3 - - -data_structures::tree -_234::Tree234::InsertPreSplit - - - - - -Node2->Node3 - - - - - -Node4 - - -std::unique_ptr::get - - - - - -Node3->Node4 - - - - - -Node5 - - -data_structures::tree -_234::Tree234::MergeNodeNotFull - - - - - -Node3->Node5 - - - - - -Node11 - - -data_structures::tree -_234::Tree234::SplitNode - - - - - -Node3->Node11 - - - - - -Node6 - - -data_structures::tree -_234::Node::InsertItem - - - - - -Node5->Node6 - - - - - -Node9 - - -data_structures::tree -_234::Node::IsFull - - - - - -Node5->Node9 - - - - - -Node10 - - -data_structures::tree -_234::Node::SetChild - - - - - -Node5->Node10 - - - - - -Node7 - - -data_structures::tree -_234::Node::Contains - - - - - -Node6->Node7 - - - - - -Node8 - - -data_structures::tree -_234::Node::InsertItemByIndex - - - - - -Node6->Node8 - - - - - -Node6->Node9 - - - - - -Node13 - - -std::ofstream::close - - - - - -Node12->Node13 - - - - - -Node14 - - -std::endl - - - - - -Node12->Node14 - - - - - -Node15 - - -std::ofstream::open - - - - - -Node12->Node15 - - - - - -Node16 - - -data_structures::tree -_234::Tree234::PrintNode - - - - - -Node12->Node16 - - - - - -Node18->Node14 - - - - - diff --git a/db/dc0/namespacebacktracking.html b/db/dc0/namespacebacktracking.html index abe8c8b40..00e13a679 100644 --- a/db/dc0/namespacebacktracking.html +++ b/db/dc0/namespacebacktracking.html @@ -3,7 +3,7 @@ - +Algorithms_in_C++: backtracking Namespace Reference @@ -42,10 +42,10 @@

    @@ -155,6 +155,7 @@ Functions

    - + @@ -209,6 +209,7 @@ template<size_t V>
    88  }
    89  }
    90  }
    +
    graph
    Graph Algorithms.
    @@ -493,6 +494,11 @@ template<size_t T>
    46 
    47  return is_max ? std::max(v1, v2) : std::min(v1, v2);
    48 }
    +
    height
    int height(node *root)
    Definition: avltree.cpp:31
    +
    std::max
    T max(T... args)
    +
    std::min
    T min(T... args)
    +
    backtracking::minimax
    int minimax(int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)
    Definition: minimax.cpp:38
    +
    std
    STL namespace.
    Here is the call graph for this function:
    @@ -568,6 +574,8 @@ template<size_t V>
    82  std::cout << std::endl;
    83  }
    84  }
    + +
    std::endl
    T endl(T... args)
    Here is the call graph for this function:
    @@ -711,6 +719,7 @@ template<size_t V>
    72  }
    73  return false;
    74  }
    +
    mov
    void mov(tower *From, tower *To)
    Definition: tower_of_hanoi.cpp:39
    Here is the call graph for this function:
    @@ -825,20 +834,11 @@ template<size_t V>
    -
    mov
    void mov(tower *From, tower *To)
    Definition: tower_of_hanoi.cpp:39
    - -
    height
    int height(node *root)
    Definition: avltree.cpp:31
    -
    std::min
    T min(T... args)
    -
    backtracking::minimax
    int minimax(int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)
    Definition: minimax.cpp:38
    -
    std::endl
    T endl(T... args)
    -
    std
    STL namespace.
    -
    graph
    Graph Algorithms.
    -
    std::max
    T max(T... args)
    diff --git a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.svg b/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.svg index 1607e060c..48b0139d7 100644 --- a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.svg +++ b/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::max @@ -51,7 +51,7 @@ Node4 - + std::min diff --git a/db/dc0/namespacebacktracking_ae1a76e21cb3934368d01cea7672d3906_cgraph.svg b/db/dc0/namespacebacktracking_ae1a76e21cb3934368d01cea7672d3906_cgraph.svg index 7d8633a15..eaaf89a1e 100644 --- a/db/dc0/namespacebacktracking_ae1a76e21cb3934368d01cea7672d3906_cgraph.svg +++ b/db/dc0/namespacebacktracking_ae1a76e21cb3934368d01cea7672d3906_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/db/dca/kadane2_8cpp.html b/db/dca/kadane2_8cpp.html index 0bb1a2b3c..3b1bc7010 100644 --- a/db/dca/kadane2_8cpp.html +++ b/db/dca/kadane2_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: dynamic_programming/kadane2.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -170,6 +170,9 @@ Algorithm
    72 
    73  return 0;
    74 }
    + + + @@ -216,6 +219,7 @@ template<size_t N>
    50  }
    51  return max_sum; // returning the value of max_sum
    52 }
    +
    std::max
    T max(T... args)
    Here is the call graph for this function:
    @@ -227,15 +231,11 @@ Here is the call graph for this function:
    - -
    std::array
    STL class.
    -
    std::max
    T max(T... args)
    - diff --git a/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg b/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg index e9718ccc4..747f95ad5 100644 --- a/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg +++ b/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg @@ -28,7 +28,7 @@ Node2 - + std::max diff --git a/db/dd3/ode__forward__euler_8cpp.html b/db/dd3/ode__forward__euler_8cpp.html index bf25d0112..9dffb912a 100644 --- a/db/dd3/ode__forward__euler_8cpp.html +++ b/db/dd3/ode__forward__euler_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: numerical_methods/ode_forward_euler.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -143,7 +143,7 @@ Functions

    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
    +
    See also
    ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp

    Function Documentation

    ◆ exact_solution()

    @@ -183,6 +183,8 @@ Functions
    68  y[0][0] = std::cos(x);
    69  y[0][1] = -std::sin(x);
    70 }
    +
    std::cos
    T cos(T... args)
    +
    std::sin
    T sin(T... args)
    Here is the call graph for this function:
    @@ -241,6 +243,12 @@ Here is the call graph for this function:
    209 
    210  return 0;
    211 }
    +
    std::atof
    T atof(T... args)
    + + +
    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
    +
    Here is the call graph for this function:
    @@ -377,6 +385,11 @@ Here is the call graph for this function:
    182 
    183  fp.close();
    184 }
    + +
    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
    +
    std::perror
    T perror(T... args)
    Here is the call graph for this function:
    @@ -388,24 +401,11 @@ Here is the call graph for this function:
    - -
    std::cos
    T cos(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
    -
    std::atof
    T atof(T... args)
    -
    std::clock
    T clock(T... args)
    -
    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
    - -
    std::ofstream
    STL class.
    -
    std::perror
    T perror(T... args)
    - -
    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
    -
    std::sin
    T sin(T... args)
    - diff --git a/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg index c9d01d11d..2d3bb6620 100644 --- a/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg +++ b/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::atof @@ -66,7 +66,7 @@ Node4 - + std::clock @@ -81,7 +81,7 @@ Node5 - + std::ofstream::close @@ -111,7 +111,7 @@ Node8 - + std::ofstream::is_open @@ -126,7 +126,7 @@ Node9 - + std::ofstream::open @@ -141,7 +141,7 @@ Node10 - + std::perror @@ -210,7 +210,7 @@ Node13 - + std::cos @@ -225,7 +225,7 @@ Node14 - + std::sin diff --git a/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg index 30f3d6127..04a1bc30d 100644 --- a/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg +++ b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::clock @@ -36,7 +36,7 @@ Node3 - + std::ofstream::close @@ -66,7 +66,7 @@ Node7 - + std::ofstream::is_open @@ -81,7 +81,7 @@ Node8 - + std::perror @@ -96,7 +96,7 @@ Node5 - + std::cos @@ -111,7 +111,7 @@ Node6 - + std::sin diff --git a/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg index dbc0da0c7..5e840b81d 100644 --- a/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg +++ b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::cos @@ -36,7 +36,7 @@ Node3 - + std::sin diff --git a/db/dd4/structlist__coll__graph.svg b/db/dd4/structlist__coll__graph.svg index a6a0f500c..00469df06 100644 --- a/db/dd4/structlist__coll__graph.svg +++ b/db/dd4/structlist__coll__graph.svg @@ -28,7 +28,7 @@ Node2 - + std::array< int, 50 > diff --git a/db/ddb/classhash__chain__coll__graph.map b/db/ddb/classhash__chain__coll__graph.map index ede8a6f69..57ca31d57 100644 --- a/db/ddb/classhash__chain__coll__graph.map +++ b/db/ddb/classhash__chain__coll__graph.map @@ -1,7 +1,6 @@ - - - - - + + + + diff --git a/db/ddb/classhash__chain__coll__graph.md5 b/db/ddb/classhash__chain__coll__graph.md5 index ce0f37420..3b55a8617 100644 --- a/db/ddb/classhash__chain__coll__graph.md5 +++ b/db/ddb/classhash__chain__coll__graph.md5 @@ -1 +1 @@ -719e3e0bc1ab9d3e0bacde59b97efd3d \ No newline at end of file +684d0e13cb53a171dbe65822b8749b3d \ 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 aa98d0d18..aa9486b02 100644 --- a/db/ddb/classhash__chain__coll__graph.svg +++ b/db/ddb/classhash__chain__coll__graph.svg @@ -4,99 +4,69 @@ - - + + hash_chain - + Node1 - -hash_chain + +hash_chain Node2 - - -std::shared_ptr< struct - Node > + + +std::shared_ptr< struct + Node > Node2->Node1 - - - next + + + next Node3 - - -Node + + +std::vector< std::shared +_ptr< Node > > - + -Node3->Node2 - - - ptr - - - -Node3->Node3 - - - next - - - -Node5 - - -std::shared_ptr< Node > - - - - - -Node3->Node5 - - - ptr +Node3->Node1 + + + head Node4 - - -std::vector< std::shared -_ptr< Node > > + + +std::shared_ptr< Node > - - -Node4->Node1 - - - head - - - -Node5->Node4 - - - elements + + +Node4->Node3 + + + elements diff --git a/db/df3/happy__number_8cpp.html b/db/df3/happy__number_8cpp.html index d68b4ee51..0d0fb7b6e 100644 --- a/db/df3/happy__number_8cpp.html +++ b/db/df3/happy__number_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: others/happy_number.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -179,6 +179,10 @@ template<typename T >
    37  std::cout << n << " is not a happy number" << std::endl;
    38  return 0;
    39 }
    + + +
    std::endl
    T endl(T... args)
    +
    is_happy
    bool is_happy(T n)
    Definition: happy_number.cpp:14
    Here is the call graph for this function:
    @@ -190,15 +194,11 @@ Here is the call graph for this function:
    - -
    is_happy
    bool is_happy(T n)
    Definition: happy_number.cpp:14
    -
    std::endl
    T endl(T... args)
    - diff --git a/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index c013b9478..7c016da2a 100644 --- a/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl 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 63b930d51..2e9bf53c2 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,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -130,7 +130,7 @@ $(document).ready(function(){initNavTree('d3/d95/classdata__structures_1_1tree__ diff --git a/dc/d1a/pascal__triangle_8cpp.html b/dc/d1a/pascal__triangle_8cpp.html index 8d8d553a5..0b6393e39 100644 --- a/dc/d1a/pascal__triangle_8cpp.html +++ b/dc/d1a/pascal__triangle_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: others/pascal_triangle.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -161,6 +161,12 @@ Functions
    73 
    74  return 0;
    75 }
    + + +
    std::endl
    T endl(T... args)
    +
    std::memset
    T memset(T... args)
    +
    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
    Here is the call graph for this function:
    @@ -261,6 +267,7 @@ Here is the call graph for this function:
    26  std::cout << std::endl;
    27  }
    28 }
    +
    std::setw
    T setw(T... args)
    Here is the call graph for this function:
    @@ -272,18 +279,11 @@ Here is the call graph for this function:
    -
    pascal_triangle
    int ** pascal_triangle(int **arr, int n)
    Definition: pascal_triangle.cpp:36
    - -
    std::endl
    T endl(T... args)
    -
    std::setw
    T setw(T... args)
    - -
    show_pascal
    void show_pascal(int **arr, int n)
    Definition: pascal_triangle.cpp:18
    -
    std::memset
    T memset(T... args)
    diff --git a/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg b/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg index 21ebe8da9..e302dad15 100644 --- a/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg +++ b/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -36,7 +36,7 @@ Node3 - + std::setw diff --git a/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 1f154aaa3..3fdab4d30 100644 --- a/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -72,7 +72,7 @@ Node5 - + std::setw diff --git a/dc/d25/structdata__structures_1_1_node-members.html b/dc/d25/structdata__structures_1_1_node-members.html index ba807e028..d35d6a039 100644 --- a/dc/d25/structdata__structures_1_1_node-members.html +++ b/dc/d25/structdata__structures_1_1_node-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -106,7 +106,7 @@ $(document).ready(function(){initNavTree('d9/d49/structdata__structures_1_1_node diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp.html b/dc/d38/ordinary__least__squares__regressor_8cpp.html index 4bdd034f4..8303f0c68 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp.html +++ b/dc/d38/ordinary__least__squares__regressor_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: machine_learning/ordinary_least_squares_regressor.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -222,6 +222,11 @@ 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
    +
    std::vector::push_back
    T push_back(T... args)
    +
    std::vector::size
    T size(T... args)
    +
    Here is the call graph for this function:
    @@ -316,6 +321,9 @@ template<typename T >
    291 
    292  return inverse;
    293 }
    + +
    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
    Here is the call graph for this function:
    @@ -354,6 +362,7 @@ template<typename T >
    309  }
    310  return result;
    311 }
    +
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition: fibonacci_sum.cpp:76
    @@ -465,6 +474,11 @@ template<typename T >
    473 
    474  return 0;
    475 }
    + +
    data
    int data[MAX]
    test data
    Definition: hash_search.cpp:24
    +
    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
    +
    ols_test
    void ols_test()
    Definition: ordinary_least_squares_regressor.cpp:369
    +
    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:
    @@ -935,6 +949,9 @@ template<typename T >
    34 
    35  return out;
    36 }
    +
    std::left
    T left(T... args)
    +
    std::setfill
    T setfill(T... args)
    +
    std::setw
    T setw(T... args)
    Here is the call graph for this function:
    @@ -1048,28 +1065,11 @@ template<typename T >
    -
    std::vector
    STL class.
    -
    std::vector::size
    T size(T... args)
    -
    std::setfill
    T setfill(T... args)
    -
    is_square
    bool is_square(std::vector< std::vector< T >> const &A)
    Definition: ordinary_least_squares_regressor.cpp:59
    -
    std::vector::push_back
    T push_back(T... args)
    - -
    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
    -
    data
    int data[MAX]
    test data
    Definition: hash_search.cpp:24
    -
    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
    -
    std::endl
    T endl(T... args)
    -
    get_inverse
    std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T >> const &A)
    Definition: ordinary_least_squares_regressor.cpp:226
    -
    std::left
    T left(T... args)
    -
    ols_test
    void ols_test()
    Definition: ordinary_least_squares_regressor.cpp:369
    -
    std::setw
    T setw(T... args)
    - -
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition: fibonacci_sum.cpp:76
    -
    get_transpose
    std::vector< std::vector< T > > get_transpose(std::vector< std::vector< T >> const &A)
    Definition: ordinary_least_squares_regressor.cpp:300
    diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.svg index a069c561b..6fe97be65 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.svg +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -36,7 +36,7 @@ Node3 - + std::vector::size diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.svg index 84af80cdf..83de0e973 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.svg +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.svg @@ -51,7 +51,7 @@ Node6 - + std::vector::push_back @@ -66,7 +66,7 @@ Node7 - + std::vector::size @@ -81,7 +81,7 @@ Node3 - + std::endl diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.svg index a3b4065a5..68d71eec8 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.svg +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -51,7 +51,7 @@ Node8 - + std::vector::size @@ -111,7 +111,7 @@ Node7 - + std::vector::push_back diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.svg index 94999bf6b..824443966 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.svg +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -36,7 +36,7 @@ Node3 - + std::vector::size diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.svg index 7008f0272..874a9e6a0 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.svg +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg index 31dd55c90..3fc45aaea 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -36,7 +36,7 @@ Node3 - + std::left @@ -51,7 +51,7 @@ Node4 - + std::setfill @@ -66,7 +66,7 @@ Node5 - + std::setw diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.svg index d1629ac68..989cfdf55 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.svg +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::vector::size diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.svg index 435792ec9..196ab0ef4 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.svg +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::left @@ -36,7 +36,7 @@ Node3 - + std::setfill @@ -51,7 +51,7 @@ Node4 - + std::setw @@ -66,7 +66,7 @@ Node5 - + std::vector::size diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 831ec0b65..672298769 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -67,7 +67,7 @@ var sectionId = 'dynsection-3'; Node2 - + std::endl @@ -157,7 +157,7 @@ var sectionId = 'dynsection-3'; Node7 - + std::vector::push_back @@ -172,7 +172,7 @@ var sectionId = 'dynsection-3'; Node8 - + std::vector::size diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 15dd44b40..87827db74 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -111,7 +111,7 @@ Node7 - + std::vector::push_back @@ -126,7 +126,7 @@ Node8 - + std::vector::size diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.svg index d1629ac68..989cfdf55 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.svg +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::vector::size diff --git a/dc/d5a/rat__maze_8cpp.html b/dc/d5a/rat__maze_8cpp.html index 07ed192e5..1959698c2 100644 --- a/dc/d5a/rat__maze_8cpp.html +++ b/dc/d5a/rat__maze_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: backtracking/rat_maze.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -98,8 +98,8 @@ $(document).ready(function(){initNavTree('dc/d5a/rat__maze_8cpp.html','../../');
    -

    Implements Rat in a Maze algorithm. +

    Implements <a href="https://www.codesdope.com/blog/article/backtracking-to- +solve-a-rat-in-a-maze-c-java-pytho/". More...

    #include <array>
    #include <iostream>
    @@ -117,8 +117,8 @@ Namespaces  Backtracking algorithms.
       rat_maze - Functions for Rat in a Maze algorithm.
    + Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to- +solve-a-rat-in-a-maze-c-java-pytho/".
     

    @@ -135,8 +135,9 @@ Functions

     

    Detailed Description

    -

    Implements Rat in a Maze algorithm.

    +

    Implements <a href="https://www.codesdope.com/blog/article/backtracking-to- +solve-a-rat-in-a-maze-c-java-pytho/".

    +

    >Rat in a Maze algorithm

    A Maze is given as N*N binary matrix of blocks where source block is the upper left most block i.e., maze[0][0] and destination block is lower rightmost block i.e., maze[N-1][N-1]. A rat starts from source and has to reach destination. The rat can move only in two directions: forward and down. In the maze matrix, 0 means the block is dead end and 1 means the block can be used in the path from source to destination.

    Author
    Vaibhav Thakkar
    @@ -164,6 +165,7 @@ solve-a-rat-in-a-maze-c-java-pytho/">Rat in a Maze algorithm.

    111  test(); // run the tests
    112  return 0;
    113 }
    +
    test
    static void test()
    Test implementations.
    Definition: rat_maze.cpp:84
    Here is the call graph for this function:
    @@ -260,6 +262,9 @@ template<size_t size>
    74  return false;
    75  }
    76 }
    + +
    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:45
    Here is the call graph for this function:
    @@ -317,21 +322,17 @@ Here is the call graph for this function:
    102  assert(backtracking::rat_maze::solveMaze<size>(currposrow, currposcol, maze,
    103  soln) == 1);
    104 }
    +
    -
    test
    static void test()
    Test implementations.
    Definition: rat_maze.cpp:84
    -
    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:45
    - -
    std::array
    STL class.
    -
    std::endl
    T endl(T... args)
    diff --git a/dc/d61/classgraph_1_1_graph.html b/dc/d61/classgraph_1_1_graph.html index 28a8a0575..9a054b9ac 100644 --- a/dc/d61/classgraph_1_1_graph.html +++ b/dc/d61/classgraph_1_1_graph.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: graph::Graph< T > Class Template Reference @@ -42,10 +42,10 @@ - + @@ -193,6 +193,9 @@ template<typename T >
    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
    +
    std::vector::push_back
    T push_back(T... args)
    +
    std::vector::resize
    T resize(T... args)
    Here is the call graph for this function:
    @@ -262,6 +265,7 @@ template<typename T >
    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
    @@ -339,6 +343,14 @@ template<typename T >
    131  }
    132  return visited;
    133  }
    +
    std::queue::empty
    T empty(T... args)
    +
    std::queue::front
    T front(T... args)
    +
    node
    struct list node
    + +
    std::queue::pop
    T pop(T... args)
    +
    std::queue::push
    T push(T... args)
    + +
    node
    Definition: avltree.cpp:13
    Here is the call graph for this function:
    @@ -374,6 +386,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(); }
    +
    std::vector::size
    T size(T... args)
    Here is the call graph for this function:
    @@ -415,24 +428,11 @@ template<typename T >
    -
    std::vector::resize
    T resize(T... args)
    -
    std::vector::size
    T size(T... args)
    -
    node
    Definition: avltree.cpp:13
    -
    node
    struct list node
    -
    std::queue
    STL class.
    -
    std::queue::front
    T front(T... args)
    -
    std::vector::push_back
    T push_back(T... args)
    -
    std::queue::pop
    T pop(T... args)
    -
    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::map
    STL class.
    -
    std::queue::empty
    T empty(T... args)
    -
    std::queue::push
    T push(T... args)
    -
    graph::Graph::adjacency_list
    std::map< T, std::list< T > > adjacency_list
    Definition: breadth_first_search.cpp:69
    diff --git a/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.svg b/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.svg index 59fcc8567..2d3ae56f8 100644 --- a/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.svg +++ b/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::vector::push_back @@ -36,7 +36,7 @@ Node3 - + std::vector::resize diff --git a/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.svg b/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.svg index e20d54f69..c92ab697f 100644 --- a/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.svg +++ b/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::vector::size diff --git a/dc/d61/classgraph_1_1_graph_ab1a1a96cd4cddf0d4feb02855c4c16af_cgraph.svg b/dc/d61/classgraph_1_1_graph_ab1a1a96cd4cddf0d4feb02855c4c16af_cgraph.svg index bd73585ba..1edfb52e6 100644 --- a/dc/d61/classgraph_1_1_graph_ab1a1a96cd4cddf0d4feb02855c4c16af_cgraph.svg +++ b/dc/d61/classgraph_1_1_graph_ab1a1a96cd4cddf0d4feb02855c4c16af_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::queue::empty @@ -37,7 +37,7 @@ Node3 - + std::queue::front @@ -52,7 +52,7 @@ Node4 - + std::queue::pop @@ -67,7 +67,7 @@ Node5 - + std::queue::push 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 cda053b5d..ded7cdb51 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,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -108,7 +108,7 @@ $(document).ready(function(){initNavTree('de/d00/classgraph_1_1is__graph__bipart diff --git a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html index 88fc0cf93..93491a3da 100644 --- a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html +++ b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: machine_learning::neural_network::layers::DenseLayer Class Reference @@ -42,10 +42,10 @@ - + @@ -101,7 +101,7 @@ $(document).ready(function(){initNavTree('dc/d93/classmachine__learning_1_1neura
    Collaboration diagram for machine_learning::neural_network::layers::DenseLayer:
    -
    +
    [legend]
    @@ -231,6 +231,11 @@ int 
    174  unit_matrix_initialization(kernel, kernel_shape);
    175  }
    176  }
    + +
    std::endl
    T endl(T... args)
    +
    std::exit
    T exit(T... args)
    +
    machine_learning::uniform_random_initialization
    void uniform_random_initialization(std::vector< std::valarray< T >> &A, const std::pair< size_t, size_t > &shape, const T &low, const T &high)
    Definition: vector_ops.hpp:166
    +
    machine_learning::unit_matrix_initialization
    void unit_matrix_initialization(std::vector< std::valarray< T >> &A, const std::pair< size_t, size_t > &shape)
    Definition: vector_ops.hpp:193
    Here is the call graph for this function:
    @@ -471,16 +476,11 @@ Here is the call graph for this function:
    -
    machine_learning::uniform_random_initialization
    void uniform_random_initialization(std::vector< std::valarray< T >> &A, const std::pair< size_t, size_t > &shape, const T &low, const T &high)
    Definition: vector_ops.hpp:166
    -
    machine_learning::unit_matrix_initialization
    void unit_matrix_initialization(std::vector< std::valarray< T >> &A, const std::pair< size_t, size_t > &shape)
    Definition: vector_ops.hpp:193
    - -
    std::endl
    T endl(T... args)
    -
    std::exit
    T exit(T... args)
    diff --git a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.svg b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.svg index cd075e2c5..ba950bf9e 100644 --- a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.svg +++ b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.svg @@ -23,7 +23,7 @@ Node2 - + std::endl @@ -38,7 +38,7 @@ Node3 - + std::exit @@ -85,7 +85,7 @@ Node5 - + std::chrono::system _clock::now diff --git a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a35ab6f1b2840f89a858ca36b78739b69_cgraph.svg b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a35ab6f1b2840f89a858ca36b78739b69_cgraph.svg index 3be26aaee..32d5f6540 100644 --- a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a35ab6f1b2840f89a858ca36b78739b69_cgraph.svg +++ b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a35ab6f1b2840f89a858ca36b78739b69_cgraph.svg @@ -23,7 +23,7 @@ Node2 - + std::endl @@ -38,7 +38,7 @@ Node3 - + std::exit diff --git a/dc/d93/trie__modern_8cpp.html b/dc/d93/trie__modern_8cpp.html index 0f14593c4..6ccb8e68f 100644 --- a/dc/d93/trie__modern_8cpp.html +++ b/dc/d93/trie__modern_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: data_structures/trie_modern.cpp File Reference @@ -42,10 +42,10 @@
    neurons
    - + @@ -151,6 +151,10 @@ Functions
    166 
    167  return 0;
    168 }
    + +
    Trie
    Definition: trie_modern.cpp:16
    +
    Trie::search
    bool search(const std::string &word)
    Definition: trie_modern.cpp:132
    +
    Trie::insert
    void insert(const std::string &word)
    Definition: trie_modern.cpp:109
    Here is the call graph for this function:
    @@ -162,15 +166,11 @@ Here is the call graph for this function:
    -
    Trie
    Definition: trie_modern.cpp:16
    -
    Trie::insert
    void insert(const std::string &word)
    Definition: trie_modern.cpp:109
    - -
    Trie::search
    bool search(const std::string &word)
    Definition: trie_modern.cpp:132
    diff --git a/dc/db4/md__r_e_v_i_e_w_e_r__c_o_d_e.html b/dc/db4/md__r_e_v_i_e_w_e_r__c_o_d_e.html index 94fd27e2a..ac575ec4f 100644 --- a/dc/db4/md__r_e_v_i_e_w_e_r__c_o_d_e.html +++ b/dc/db4/md__r_e_v_i_e_w_e_r__c_o_d_e.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Guidelines for reviewers and maintainers @@ -42,10 +42,10 @@ - + @@ -112,7 +112,7 @@ $(document).ready(function(){initNavTree('dc/db4/md__r_e_v_i_e_w_e_r__c_o_d_e.ht diff --git a/dc/db5/struct_queue.html b/dc/db5/struct_queue.html index 0119c9ea0..ce7fed4b2 100644 --- a/dc/db5/struct_queue.html +++ b/dc/db5/struct_queue.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Queue Class Reference @@ -42,10 +42,10 @@ - + @@ -152,7 +152,7 @@ Private Attributes diff --git a/dc/db5/text__search_8cpp.html b/dc/db5/text__search_8cpp.html index 9e9184053..20cdcb7da 100644 --- a/dc/db5/text__search_8cpp.html +++ b/dc/db5/text__search_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: search/text_search.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -138,10 +138,10 @@ Functions
    17  std::cout << "Please enter your paragraph: \n";
    18  std::getline(std::cin, paragraph);
    19  std::cout << "\nHello, your paragraph is:\n " << paragraph << "!\n";
    -
    20  std::cout << "\nThe size of your paragraph = " << paragraph.size()
    +
    20  std::cout << "\nThe size of your paragraph = " << paragraph.size()
    21  << " characters. \n\n";
    22 
    -
    23  if (paragraph.empty()) {
    +
    23  if (paragraph.empty()) {
    24  std::cout << "\nThe paragraph is empty" << std::endl;
    25  } else {
    26  while (true) {
    @@ -149,22 +149,30 @@ Functions
    28  std::cout << "Please enter the word you are searching for: ";
    29  std::getline(std::cin, word);
    30  std::cout << "Hello, your word is " << word << "!\n";
    -
    31  if (paragraph.find(word) == std::string::npos) {
    +
    31  if (paragraph.find(word) == std::string::npos) {
    32  std::cout << word << " does not exist in the sentence"
    33  << std::endl;
    34  } else {
    35  std::cout << "The word " << word << " is now found at location "
    -
    36  << paragraph.find(word) << std::endl
    +
    36  << paragraph.find(word) << std::endl
    37  << std::endl;
    38  }
    39  std::cin.get();
    40  }
    41  }
    42 }
    + + + +
    std::string::empty
    T empty(T... args)
    +
    std::endl
    T endl(T... args)
    +
    std::string::find
    T find(T... args)
    +
    std::getline
    T getline(T... args)
    +
    std::string::size
    T size(T... args)
    Here is the call graph for this function:
    -
    +
    @@ -172,16 +180,11 @@ Here is the call graph for this function:
    -
    std::string
    STL class.
    - -
    std::endl
    T endl(T... args)
    -
    std::getline
    T getline(T... args)
    - diff --git a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index c7f518c63..61d634a00 100644 --- a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,5 +1,8 @@ - - - + + + + + + diff --git a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 1ae58b103..7761e71e6 100644 --- a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -d453a58bf13c943c631226105ce54d4e \ No newline at end of file +7851fd9236c80df0b3133dc482cd4fc5 \ 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 64c9b6fd7..86d268094 100644 --- a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,49 +4,94 @@ - - + + main - + Node1 - -main + +main Node2 - - -std::endl + + +std::string::empty Node1->Node2 - - + + Node3 - - -std::getline + + +std::endl Node1->Node3 - - + + + + + +Node4 + + +std::string::find + + + + + +Node1->Node4 + + + + + +Node5 + + +std::getline + + + + + +Node1->Node5 + + + + + +Node6 + + +std::string::size + + + + + +Node1->Node6 + + 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 dc8a21b4d..d439af17a 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,7 +3,7 @@ - + Algorithms_in_C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp @@ -42,10 +42,10 @@ - + @@ -116,9 +116,9 @@ $(document).ready(function(){initNavTree('dc/dc4/_2_users_2runner_2work_2_c-_plu
    * There can be many such equations
    */
    #include <cassert> /// asserting the test functions
    -
    #include <iostream> /// for io operations
    -
    #include <vector> /// for using the vector container
    -
    +
    #include <iostream> /// for io operations
    +
    #include <vector> /// for using the vector container
    +
    /**
    * @brief The change() function is used
    * to return the updated iterative value corresponding
    @@ -228,21 +228,21 @@ $(document).ready(function(){initNavTree('dc/dc4/_2_users_2runner_2work_2_c-_plu
    test(); // Execute the tests
    return 0;
    }
    - - -
    test
    static void test()
    Test implementations.
    Definition: rat_maze.cpp:84
    -
    numerical_methods
    for io operations
    - -
    main
    int main()
    Definition: graph_coloring.cpp:96
    +
    main
    int main()
    Definition: graph_coloring.cpp:96
    h
    int h(int key)
    Definition: hash_search.cpp:45
    +
    numerical_methods
    for io operations
    runge_kutta
    Functions for Runge Kutta fourth order method.
    +
    test
    static void test()
    Test implementations.
    Definition: rat_maze.cpp:84
    change
    static double change(double x, double y)
    for using the vector container
    Definition: rungekutta.cpp:33
    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
    + + + diff --git a/dc/dc5/paranthesis__matching_8cpp.html b/dc/dc5/paranthesis__matching_8cpp.html index d0a47a8bd..6841d85c9 100644 --- a/dc/dc5/paranthesis__matching_8cpp.html +++ b/dc/dc5/paranthesis__matching_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: others/paranthesis_matching.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -218,7 +218,7 @@ Implementation is C-type and does not utilize the C++ constructs diff --git a/dc/dcf/vector__ops_8hpp__incl.map b/dc/dcf/vector__ops_8hpp__incl.map index df33c791e..123dd2c02 100644 --- a/dc/dcf/vector__ops_8hpp__incl.map +++ b/dc/dcf/vector__ops_8hpp__incl.map @@ -1,5 +1,5 @@ - + diff --git a/dc/dcf/vector__ops_8hpp__incl.md5 b/dc/dcf/vector__ops_8hpp__incl.md5 index 9d9321824..b3e1c34e6 100644 --- a/dc/dcf/vector__ops_8hpp__incl.md5 +++ b/dc/dcf/vector__ops_8hpp__incl.md5 @@ -1 +1 @@ -8017d5c250ed37f46a8a064dc33012bd \ No newline at end of file +c2c4a2b4224486d3ae3ed23ea7243887 \ No newline at end of file diff --git a/dc/dcf/vector__ops_8hpp__incl.svg b/dc/dcf/vector__ops_8hpp__incl.svg index 9118078b4..d67af2f1c 100644 --- a/dc/dcf/vector__ops_8hpp__incl.svg +++ b/dc/dcf/vector__ops_8hpp__incl.svg @@ -12,7 +12,7 @@ Node1 - + machine_learning/vector _ops.hpp diff --git a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.svg b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.svg index 0d749e3e5..203ed08d7 100644 --- a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.svg +++ b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.svg @@ -86,7 +86,7 @@ var sectionId = 'dynsection-1'; Node3 - + std::vector< std::vector < int > > @@ -103,7 +103,7 @@ var sectionId = 'dynsection-1'; Node4 - + std::vector< int > @@ -136,7 +136,7 @@ var sectionId = 'dynsection-1'; Node5 - + std::vector< std::list < int > > @@ -153,7 +153,7 @@ var sectionId = 'dynsection-1'; Node6 - + std::list< int > @@ -169,7 +169,7 @@ var sectionId = 'dynsection-1'; Node7 - + std::vector< X > diff --git a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg index 6282f4a75..792bc2d78 100644 --- a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg +++ b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg @@ -40,7 +40,7 @@ Node3 - + std::vector< std::vector < int > > @@ -57,7 +57,7 @@ Node4 - + std::vector< int > @@ -90,7 +90,7 @@ Node5 - + std::vector< std::list < int > > @@ -107,7 +107,7 @@ Node6 - + std::list< int > @@ -123,7 +123,7 @@ Node7 - + std::vector< X > diff --git a/dc/dd9/strand__sort_8cpp.html b/dc/dd9/strand__sort_8cpp.html index 1c6041282..e7185e1c2 100644 --- a/dc/dd9/strand__sort_8cpp.html +++ b/dc/dd9/strand__sort_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: sorting/strand_sort.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -159,6 +159,7 @@ Functions
    85  test();
    86  return 0;
    87 }
    +
    test
    static void test()
    Function for testing.
    Definition: strand_sort.cpp:64
    Here is the call graph for this function:
    @@ -221,6 +222,17 @@ template<typename T >
    54  }
    55  return result; // Returns sorted list
    56  }
    +
    std::list::back
    T back(T... args)
    +
    std::list::begin
    T begin(T... args)
    +
    std::list::empty
    T empty(T... args)
    +
    std::list::end
    T end(T... args)
    +
    std::list::erase
    T erase(T... args)
    +
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition: fibonacci_sum.cpp:76
    +
    std::list::front
    T front(T... args)
    + +
    std::list::pop_front
    T pop_front(T... args)
    +
    std::list::push_back
    T push_back(T... args)
    +
    std::list::size
    T size(T... args)
    Here is the call graph for this function:
    @@ -270,30 +282,18 @@ Here is the call graph for this function:
    76  std::cout << item << " ";
    77  }
    78 }
    + +
    sorting::strand::strand_sort
    std::list< T > strand_sort(std::list< T > lst)
    Apply sorting.
    Definition: strand_sort.cpp:36
    -
    test
    static void test()
    Function for testing.
    Definition: strand_sort.cpp:64
    -
    std::list
    STL class.
    -
    sorting::strand::strand_sort
    std::list< T > strand_sort(std::list< T > lst)
    Apply sorting.
    Definition: strand_sort.cpp:36
    -
    std::list::pop_front
    T pop_front(T... args)
    -
    std::list::size
    T size(T... args)
    -
    std::list::back
    T back(T... args)
    -
    std::list::front
    T front(T... args)
    -
    std::list::push_back
    T push_back(T... args)
    - -
    std::list::erase
    T erase(T... args)
    -
    std::list::begin
    T begin(T... args)
    -
    std::list::empty
    T empty(T... args)
    -
    std::list::end
    T end(T... args)
    -
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition: fibonacci_sum.cpp:76
    diff --git a/dc/dd9/strand__sort_8cpp_ad75dc6a599ecfe31dadfaf449ee565f6_cgraph.svg b/dc/dd9/strand__sort_8cpp_ad75dc6a599ecfe31dadfaf449ee565f6_cgraph.svg index ddf8b79c8..2afb54928 100644 --- a/dc/dd9/strand__sort_8cpp_ad75dc6a599ecfe31dadfaf449ee565f6_cgraph.svg +++ b/dc/dd9/strand__sort_8cpp_ad75dc6a599ecfe31dadfaf449ee565f6_cgraph.svg @@ -27,7 +27,7 @@ Node2 - + std::list::back @@ -42,7 +42,7 @@ Node3 - + std::list::begin @@ -57,7 +57,7 @@ Node4 - + std::list::empty @@ -72,7 +72,7 @@ Node5 - + std::list::end @@ -87,7 +87,7 @@ Node6 - + std::list::erase @@ -102,7 +102,7 @@ Node7 - + std::list::front @@ -117,7 +117,7 @@ Node8 - + std::list::pop_front @@ -132,7 +132,7 @@ Node9 - + std::list::push_back @@ -147,7 +147,7 @@ Node10 - + std::list::size 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 cf5244c6a..728bd6b85 100644 --- a/dc/dea/classgraph_1_1_h_k_graph-members.html +++ b/dc/dea/classgraph_1_1_h_k_graph-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -116,7 +116,7 @@ $(document).ready(function(){initNavTree('d8/d69/classgraph_1_1_h_k_graph.html', diff --git a/dc/dfe/ternary__search_8cpp.html b/dc/dfe/ternary__search_8cpp.html index 24ee638f1..39fead07f 100644 --- a/dc/dfe/ternary__search_8cpp.html +++ b/dc/dfe/ternary__search_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: search/ternary_search.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -270,6 +270,8 @@ Functions
    76  }
    77  }
    78 }
    +
    std::right
    T right(T... args)
    +
    absolutePrecision
    #define absolutePrecision
    Definition: ternary_search.cpp:22
    @@ -296,6 +298,9 @@ Functions
    138  ternary_search(N, A, _target);
    139  return 0;
    140 }
    +
    _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:
    @@ -382,6 +387,7 @@ Here is the call graph for this function:
    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
    @@ -429,6 +435,9 @@ Here is the call graph for this function:
    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
    Here is the call graph for this function:
    @@ -440,20 +449,11 @@ Here is the call graph for this function:
    -
    ternary_search
    void ternary_search(int N, int A[], int target)
    Definition: ternary_search.cpp:127
    -
    absolutePrecision
    #define absolutePrecision
    Definition: ternary_search.cpp:22
    -
    rec_ternary_search
    int rec_ternary_search(int left, int right, int A[], int target)
    Definition: ternary_search.cpp:90
    - -
    _target
    #define _target
    Definition: ternary_search.cpp:27
    -
    it_ternary_search
    int it_ternary_search(int left, int right, int A[], int target)
    Definition: ternary_search.cpp:48
    -
    std::endl
    T endl(T... args)
    -
    std::right
    T right(T... args)
    -
    get_input
    void get_input()
    Definition: ternary_search.cpp:36
    diff --git a/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index df624dda6..a375ed748 100644 --- a/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -51,7 +51,7 @@ Node4 - + std::endl diff --git a/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.svg b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.svg index 26286ed80..0aaecef0d 100644 --- a/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.svg +++ b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/dd/d0c/hamiltons__cycle_8cpp.html b/dd/d0c/hamiltons__cycle_8cpp.html index 6624aa221..8f8ca1c78 100644 --- a/dd/d0c/hamiltons__cycle_8cpp.html +++ b/dd/d0c/hamiltons__cycle_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: graph/hamiltons_cycle.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -200,6 +200,10 @@ Functions
    72  }
    73  return is_cycle;
    74 }
    +
    height
    int height(node *root)
    Definition: avltree.cpp:31
    +
    std::vector::push_back
    T push_back(T... args)
    +
    std::vector::size
    T size(T... args)
    +
    Here is the call graph for this function:
    @@ -248,6 +252,9 @@ Here is the call graph for this function:
    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
    Here is the call graph for this function:
    @@ -292,6 +299,9 @@ Here is the call graph for this function:
    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
    +
    ans
    ll ans(ll n)
    Definition: matrix_exponentiation.cpp:91
    Here is the call graph for this function:
    @@ -398,21 +408,11 @@ Here is the call graph for this function:
    -
    std::vector
    STL class.
    -
    std::vector::size
    T size(T... args)
    -
    ans
    ll ans(ll n)
    Definition: matrix_exponentiation.cpp:91
    -
    test1
    static void test1()
    Definition: hamiltons_cycle.cpp:81
    -
    std::vector::push_back
    T push_back(T... args)
    - -
    test2
    static void test2()
    Definition: hamiltons_cycle.cpp:103
    -
    height
    int height(node *root)
    Definition: avltree.cpp:31
    -
    hamilton_cycle
    bool hamilton_cycle(const std::vector< std::vector< bool >> &routes)
    Definition: hamiltons_cycle.cpp:30
    -
    test3
    static void test3()
    Definition: hamiltons_cycle.cpp:122
    diff --git a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.svg b/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.svg index 780c51bdf..b275db1a7 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.svg +++ b/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.svg @@ -66,7 +66,7 @@ Node5 - + std::vector::push_back diff --git a/dd/d0c/hamiltons__cycle_8cpp_a0ceb473236b5dc53a85e281ef528dd96_cgraph.svg b/dd/d0c/hamiltons__cycle_8cpp_a0ceb473236b5dc53a85e281ef528dd96_cgraph.svg index 7c8e91572..0c5f09449 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_a0ceb473236b5dc53a85e281ef528dd96_cgraph.svg +++ b/dd/d0c/hamiltons__cycle_8cpp_a0ceb473236b5dc53a85e281ef528dd96_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::vector::push_back diff --git a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg index 54a0c9532..84a6c7b65 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg +++ b/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg @@ -111,7 +111,7 @@ Node6 - + std::vector::push_back diff --git a/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg b/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg index 37c749faf..8155b7266 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg +++ b/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg @@ -66,7 +66,7 @@ Node5 - + std::vector::push_back diff --git a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg b/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg index 09c079786..569128614 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg +++ b/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg @@ -66,7 +66,7 @@ Node5 - + std::vector::push_back diff --git a/dd/d0d/insertion__sort_8cpp.html b/dd/d0d/insertion__sort_8cpp.html index f1dcdb12e..03f1a70df 100644 --- a/dd/d0d/insertion__sort_8cpp.html +++ b/dd/d0d/insertion__sort_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: sorting/insertion_sort.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -220,6 +220,7 @@ template<typename T >
    104  arr[N] = static_cast<T>(r);
    105  }
    106 }
    +
    std::rand
    T rand(T... args)
    Here is the call graph for this function:
    @@ -277,6 +278,11 @@ Here is the call graph for this function:
    177  delete[] arr;
    178  return 0;
    179 }
    + + +
    std::endl
    T endl(T... args)
    +
    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:
    @@ -340,6 +346,11 @@ Here is the call graph for this function:
    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
    +
    std::is_sorted
    T is_sorted(T... args)
    +
    Here is the call graph for this function:
    @@ -351,22 +362,11 @@ Here is the call graph for this function:
    -
    std::vector
    STL class.
    -
    sorting::insertionSort
    void insertionSort(T *arr, int n)
    Insertion Sort Function.
    Definition: insertion_sort.cpp:59
    -
    std::is_sorted
    T is_sorted(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
    -
    std::rand
    T rand(T... args)
    -
    std::endl
    T endl(T... args)
    -
    std::begin
    T begin(T... args)
    -
    tests
    void tests()
    Definition: insertion_sort.cpp:109
    -
    std::end
    T end(T... args)
    - diff --git a/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.svg b/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.svg index ebfb2d2b4..9a4f24f0b 100644 --- a/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.svg +++ b/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::rand diff --git a/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg index 2380c214c..e28d1963b 100644 --- a/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg +++ b/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::begin @@ -51,7 +51,7 @@ Node5 - + std::end @@ -66,7 +66,7 @@ Node6 - + std::endl @@ -96,7 +96,7 @@ Node8 - + std::is_sorted @@ -111,7 +111,7 @@ Node4 - + std::rand diff --git a/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index a9d7f0b6c..b88b72c16 100644 --- a/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -78,7 +78,7 @@ Node5 - + std::begin @@ -108,7 +108,7 @@ Node8 - + std::end @@ -123,7 +123,7 @@ Node9 - + std::is_sorted @@ -138,7 +138,7 @@ Node7 - + std::rand diff --git a/dd/d12/vigenere__cipher_8cpp.html b/dd/d12/vigenere__cipher_8cpp.html index 0a7cfc24a..3f2ce24b8 100644 --- a/dd/d12/vigenere__cipher_8cpp.html +++ b/dd/d12/vigenere__cipher_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: ciphers/vigenere_cipher.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -196,6 +196,8 @@ This program implements Vigenère cipher for only uppercase English alphabet cha
    102  }
    103  return decrypted_text; // Returning decrypted text
    104  }
    + +
    std::string::length
    T length(T... args)
    Here is the call graph for this function:
    @@ -281,6 +283,7 @@ Here is the call graph for this function:
    133  test();
    134  return 0;
    135 }
    +
    test
    void test()
    Definition: vigenere_cipher.cpp:111
    Here is the call graph for this function:
    @@ -323,6 +326,10 @@ Here is the call graph for this function:
    126  std::cout << " , Encrypted text (with key = REALLY) : " << encrypted2;
    127  std::cout << " , Decrypted text : "<< decrypted2 << std::endl;
    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
    Here is the call graph for this function:
    @@ -334,18 +341,11 @@ Here is the call graph for this function:
    -
    std::string
    STL class.
    -
    std::string::length
    T length(T... args)
    -
    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
    - -
    test
    void test()
    Definition: vigenere_cipher.cpp:111
    -
    std::endl
    T endl(T... args)
    diff --git a/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.svg b/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.svg index 6980889f7..a7a37372a 100644 --- a/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.svg +++ b/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::string::length diff --git a/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.svg b/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.svg index 76a11dcd7..fbf981567 100644 --- a/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.svg +++ b/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::string::length diff --git a/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg b/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg index 7befa5568..fd10392f5 100644 --- a/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg +++ b/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl diff --git a/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 2459508bc..00bc1b2a4 100644 --- a/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::endl diff --git a/dd/d1b/structquery.html b/dd/d1b/structquery.html index eda75e6fb..d15d3d993 100644 --- a/dd/d1b/structquery.html +++ b/dd/d1b/structquery.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: query Struct Reference @@ -42,10 +42,10 @@ - + @@ -119,7 +119,7 @@ int i diff --git a/dd/d1c/classhash__chain.html b/dd/d1c/classhash__chain.html index 832e07492..2caa112b5 100644 --- a/dd/d1c/classhash__chain.html +++ b/dd/d1c/classhash__chain.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: hash_chain Class Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('dd/d1c/classhash__chain.html','../../'
    Collaboration diagram for hash_chain:
    -
    +
    [legend]
    @@ -187,6 +187,9 @@ int 
    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:24
    +
    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:
    @@ -253,6 +256,9 @@ Here is the call graph for this function:
    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:
    @@ -334,6 +340,7 @@ Here is the call graph for this function:
    125  std::cout << "Element not found";
    126  return false;
    127  }
    +
    Here is the call graph for this function:
    @@ -385,18 +392,11 @@ Here is the call graph for this function:
    - -
    hash_chain::head
    std::vector< std::shared_ptr< Node > > head
    array of nodes
    Definition: chaining.cpp:24
    -
    Node
    Definition: linkedlist_implentation_usingarray.cpp:14
    -
    std::vector::push_back
    T push_back(T... args)
    -
    hash_chain::_mod
    int _mod
    modulus of the class
    Definition: chaining.cpp:27
    - -
    h
    int h(int key)
    Definition: hash_search.cpp:45
    diff --git a/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.svg b/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.svg index a2b63e48a..5947faf59 100644 --- a/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.svg +++ b/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::vector::push_back diff --git a/dd/d24/namespacedynamic__programming.html b/dd/d24/namespacedynamic__programming.html index 0826a2f5e..4082ced17 100644 --- a/dd/d24/namespacedynamic__programming.html +++ b/dd/d24/namespacedynamic__programming.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: dynamic_programming Namespace Reference @@ -42,10 +42,10 @@
    - + @@ -107,7 +107,7 @@ $(document).ready(function(){initNavTree('dd/d24/namespacedynamic__programming.h diff --git a/dd/d29/false__position_8cpp.html b/dd/d29/false__position_8cpp.html index 87588170c..072b73e41 100644 --- a/dd/d29/false__position_8cpp.html +++ b/dd/d29/false__position_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: numerical_methods/false_position.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -234,6 +234,9 @@ Here is the call graph for this function:
    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
    @@ -282,6 +285,8 @@ Here is the call graph for this function:
    92  std::cout << "Your " << count << "th root is : " << root << std::endl;
    93  }
    94 }
    + +
    std::endl
    T endl(T... args)
    Here is the call graph for this function:
    @@ -380,16 +385,11 @@ Here is the call graph for this function:
    -
    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
    - -
    std::endl
    T endl(T... args)
    -
    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
    diff --git a/dd/d2f/class_trie.html b/dd/d2f/class_trie.html index e62006c59..44f239a2d 100644 --- a/dd/d2f/class_trie.html +++ b/dd/d2f/class_trie.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Trie Class Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('dd/d2f/class_trie.html','../../'); ini
    Collaboration diagram for Trie:
    -
    +
    [legend]
    @@ -193,6 +193,7 @@ static constexpr size_t 
    AL
    46  }
    47  return false;
    48  }
    +
    node
    Definition: avltree.cpp:13
    @@ -331,6 +332,12 @@ static constexpr size_t     		AL
    97  }
    98  return nullptr;
    99  }
    + +
    Trie::hasChildren
    static bool hasChildren(std::shared_ptr< TrieNode > node)
    Definition: trie_modern.cpp:41
    +
    Trie::removeWordHelper
    std::shared_ptr< TrieNode > removeWordHelper(const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)
    Definition: trie_modern.cpp:64
    +
    std::move
    T move(T... args)
    + +
    std::string::size
    T size(T... args)
    Here is the call graph for this function:
    @@ -394,18 +401,11 @@ False if word is not found in trie or isEndOfWord is set to false.
    -
    std::string
    STL class.
    -
    std::move
    T move(T... args)
    -
    std::string::size
    T size(T... args)
    -
    Trie::hasChildren
    static bool hasChildren(std::shared_ptr< TrieNode > node)
    Definition: trie_modern.cpp:41
    -
    node
    Definition: avltree.cpp:13
    - -
    Trie::removeWordHelper
    std::shared_ptr< TrieNode > removeWordHelper(const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)
    Definition: trie_modern.cpp:64
    diff --git a/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.svg b/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.svg index 736ad60b6..ce49fee00 100644 --- a/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.svg +++ b/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::move @@ -51,7 +51,7 @@ Node4 - + std::string::size 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 fb3f7a26b..137c2ad6d 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,7 +3,7 @@ - + Algorithms_in_C++: data_structures::tree_234::Node Class Reference @@ -42,10 +42,10 @@
    - + @@ -235,6 +235,9 @@ int8_t 
    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
    @@ -764,6 +767,9 @@ int8_t  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
    Here is the call graph for this function:
    @@ -1024,6 +1030,7 @@ Here is the call graph for this function:
    228  count--;
    229  return removed_child;
    230  }
    +
    Node
    Definition: linkedlist_implentation_usingarray.cpp:14
    @@ -1164,18 +1171,11 @@ Here is the call graph for this function: -
    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::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
    -
    Node
    Definition: linkedlist_implentation_usingarray.cpp:14
    -
    data_structures::tree_234::Node::children
    std::array< Node *, 4 > children
    store the children pointers
    Definition: tree_234.cpp:317
    -
    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
    diff --git a/dd/d47/namespacemath.html b/dd/d47/namespacemath.html index 24b25c8a0..ab589d9dc 100644 --- a/dd/d47/namespacemath.html +++ b/dd/d47/namespacemath.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math Namespace Reference @@ -42,10 +42,10 @@ - + @@ -97,7 +97,7 @@ $(document).ready(function(){initNavTree('dd/d47/namespacemath.html','../../');
    -

    for std::vector +

    for std::vector More...

    @@ -120,7 +120,7 @@ Functions

     

    Detailed Description

    -

    for std::vector

    +

    for std::vector

    for std::cin and std::cout

    for io operations

    for assert

    @@ -263,6 +263,7 @@ Functions
    55 
    56  return ((sumOfEulerTotient[num] + 1) * num) / 2;
    57 }
    +
    @@ -301,6 +302,7 @@ Functions
    42  return false;
    43  }
    44 }
    +
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition: fibonacci_sum.cpp:76
    @@ -358,6 +360,7 @@ template<class T >
    43  }
    44  return ans;
    45 }
    +
    ans
    ll ans(ll n)
    Definition: matrix_exponentiation.cpp:91
    Here is the call graph for this function:
    @@ -417,10 +420,10 @@ Here is the call graph for this function:

    b = b/2

    35  {
    36  uint64_t ans = 1; /// Initialize the answer to be returned
    -
    37  a = a % c; /// Update a if it is more than or equal to c
    -
    38  if (a == 0) {
    +
    37  a = a % c; /// Update a if it is more than or equal to c
    +
    38  if (a == 0) {
    39  return 0; /// In case a is divisible by c;
    -
    40  }
    +
    40  }
    41  while (b > 0) {
    42  /// If b is odd, multiply a with answer
    43  if (b & 1) {
    @@ -428,7 +431,7 @@ Here is the call graph for this function:
    45  }
    46  /// b must be even now
    47  b = b >> 1; /// b = b/2
    -
    48  a = ((a % c) * (a % c)) % c;
    +
    48  a = ((a % c) * (a % c)) % c;
    49  }
    50  return ans;
    51 }
    @@ -443,14 +446,11 @@ Here is the call graph for this function: - -
    ans
    ll ans(ll n)
    Definition: matrix_exponentiation.cpp:91
    -
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition: fibonacci_sum.cpp:76
    diff --git a/dd/d47/namespacemath.js b/dd/d47/namespacemath.js index f47132c62..18c508b67 100644 --- a/dd/d47/namespacemath.js +++ b/dd/d47/namespacemath.js @@ -1,6 +1,19 @@ var namespacemath = [ + [ "fibonacci_sum", null, [ + [ "matrix", "de/dc3/fibonacci__sum_8cpp.html#ae18ea07a8d7fe90ff25abb7c7d1ee5b1", null ], + [ "fiboSum", "de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742", null ], + [ "multiply", "de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e", null ], + [ "power", "de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311", null ], + [ "result", "de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa", null ] + ] ], [ "ncr_modulo_p", null, [ [ "NCRModuloP", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p" ] - ] ] + ] ], + [ "binomialCoeffSum", "dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea", null ], + [ "largestPower", "dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f", null ], + [ "lcmSum", "dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244", null ], + [ "magic_number", "dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0", null ], + [ "n_choose_r", "dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967", null ], + [ "power", "dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d", null ] ]; \ No newline at end of file diff --git a/dd/d4f/class_solution.html b/dd/d4f/class_solution.html index d8cb4da89..e0adb8f2c 100644 --- a/dd/d4f/class_solution.html +++ b/dd/d4f/class_solution.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Solution Class Reference @@ -42,10 +42,10 @@ - + @@ -148,7 +148,7 @@ int timer = 0
    • Solution
      • -
    • Generated by doxygen 1.8.20
      • +
    • Generated by doxygen 1.9.1
    diff --git a/dd/d51/classstack-members.html b/dd/d51/classstack-members.html index b4b8c43ce..c5d08d979 100644 --- a/dd/d51/classstack-members.html +++ b/dd/d51/classstack-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -114,7 +114,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 e673925d0..0aefc0ba5 100644 --- a/dd/d53/structdouble__hashing_1_1_entry-members.html +++ b/dd/d53/structdouble__hashing_1_1_entry-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -104,7 +104,7 @@ $(document).ready(function(){initNavTree('d9/dde/structdouble__hashing_1_1_entry diff --git a/dd/d65/lu__decompose_8cpp.html b/dd/d65/lu__decompose_8cpp.html index 7187d3e96..060238321 100644 --- a/dd/d65/lu__decompose_8cpp.html +++ b/dd/d65/lu__decompose_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: numerical_methods/lu_decompose.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -160,6 +160,10 @@ Functions
    88  test2();
    89  return 0;
    90 }
    +
    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)
    Here is the call graph for this function:
    @@ -210,6 +214,11 @@ template<typename T >
    28 
    29  return out;
    30 }
    +
    std::endl
    T endl(T... args)
    +
    std::left
    T left(T... args)
    +
    std::setfill
    T setfill(T... args)
    +
    std::setw
    T setw(T... args)
    +
    std::vector::size
    T size(T... args)
    Here is the call graph for this function:
    @@ -260,6 +269,14 @@ Here is the call graph for this function:
    59  std::cout << "L = \n" << L << "\n";
    60  std::cout << "U = \n" << U << "\n";
    61 }
    + +
    std::clock
    T clock(T... args)
    + +
    lu_decomposition
    int lu_decomposition(const matrix< T > &A, matrix< double > *L, matrix< double > *U)
    Definition: lu_decomposition.h:29
    +
    mat_size
    ll mat_size
    Definition: matrix_exponentiation.cpp:45
    +
    std::rand
    T rand(T... args)
    + +
    Here is the call graph for this function:
    @@ -300,6 +317,7 @@ Here is the call graph for this function:
    79  assert(determinant_lu(A3) == 3.63);
    80  std::cout << "passed\n";
    81 }
    +
    determinant_lu
    double determinant_lu(const matrix< T > &A)
    Definition: lu_decomposition.h:90
    Here is the call graph for this function:
    @@ -311,29 +329,11 @@ Here is the call graph for this function:
    -
    std::srand
    T srand(T... args)
    -
    mat_size
    ll mat_size
    Definition: matrix_exponentiation.cpp:45
    - -
    std::vector
    STL class.
    -
    test2
    void test2()
    Definition: lu_decompose.cpp:66
    -
    std::vector::size
    T size(T... args)
    -
    std::setfill
    T setfill(T... args)
    -
    std::clock
    T clock(T... args)
    -
    test1
    void test1()
    Definition: lu_decompose.cpp:36
    - - -
    std::rand
    T rand(T... args)
    -
    lu_decomposition
    int lu_decomposition(const matrix< T > &A, matrix< double > *L, matrix< double > *U)
    Definition: lu_decomposition.h:29
    -
    std::endl
    T endl(T... args)
    -
    std::left
    T left(T... args)
    -
    determinant_lu
    double determinant_lu(const matrix< T > &A)
    Definition: lu_decomposition.h:90
    -
    std::time
    T time(T... args)
    -
    std::setw
    T setw(T... args)
    diff --git a/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg index 25f7eebea..bb23cfb08 100644 --- a/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg +++ b/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg @@ -51,7 +51,7 @@ Node4 - + std::vector::size diff --git a/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg index d632c4ec4..6cd3d763b 100644 --- a/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg +++ b/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::clock @@ -51,7 +51,7 @@ Node5 - + std::rand @@ -66,7 +66,7 @@ Node4 - + std::vector::size diff --git a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg index fe6b30461..b16f66178 100644 --- a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg +++ b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg @@ -67,7 +67,7 @@ var sectionId = 'dynsection-1'; Node2 - + std::srand @@ -112,7 +112,7 @@ var sectionId = 'dynsection-1'; Node10 - + std::time @@ -127,7 +127,7 @@ var sectionId = 'dynsection-1'; Node4 - + std::clock @@ -157,7 +157,7 @@ var sectionId = 'dynsection-1'; Node7 - + std::rand @@ -172,7 +172,7 @@ var sectionId = 'dynsection-1'; Node6 - + std::vector::size diff --git a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg index 3af6a2500..8826c67f0 100644 --- a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg +++ b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -21,7 +21,7 @@ Node2 - + std::srand @@ -66,7 +66,7 @@ Node10 - + std::time @@ -81,7 +81,7 @@ Node4 - + std::clock @@ -111,7 +111,7 @@ Node7 - + std::rand @@ -126,7 +126,7 @@ Node6 - + std::vector::size diff --git a/dd/d65/lu__decompose_8cpp_a9459fcd1f020373d73eae2bad43786d0_cgraph.svg b/dd/d65/lu__decompose_8cpp_a9459fcd1f020373d73eae2bad43786d0_cgraph.svg index 254772c29..3373f0d5c 100644 --- a/dd/d65/lu__decompose_8cpp_a9459fcd1f020373d73eae2bad43786d0_cgraph.svg +++ b/dd/d65/lu__decompose_8cpp_a9459fcd1f020373d73eae2bad43786d0_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -36,7 +36,7 @@ Node3 - + std::left @@ -51,7 +51,7 @@ Node4 - + std::setfill @@ -66,7 +66,7 @@ Node5 - + std::setw @@ -81,7 +81,7 @@ Node6 - + std::vector::size diff --git a/dd/d69/namespacerange__queries.html b/dd/d69/namespacerange__queries.html index 642b54312..dfdf674e5 100644 --- a/dd/d69/namespacerange__queries.html +++ b/dd/d69/namespacerange__queries.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: range_queries Namespace Reference @@ -42,10 +42,10 @@ - + @@ -106,7 +106,7 @@ $(document).ready(function(){initNavTree('dd/d69/namespacerange__queries.html',' diff --git a/dd/d69/namespacerange__queries.js b/dd/d69/namespacerange__queries.js index 780516d23..83be3a7b4 100644 --- a/dd/d69/namespacerange__queries.js +++ b/dd/d69/namespacerange__queries.js @@ -1,8 +1,13 @@ var namespacerange__queries = [ [ "heavy_light_decomposition", null, [ - [ "HLD", "d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html", "d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d" ], + [ "Tree", "d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html", "d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree" ], [ "SG", "d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html", "d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g" ], - [ "Tree", "d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html", "d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree" ] + [ "HLD", "d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html", "d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d" ] + ] ], + [ "sparse_table", null, [ + [ "buildTable", "d8/dab/sparse__table_8cpp.html#a328ed1c01cccd07aeb1500c11b609be3", null ], + [ "computeLogs", "d8/dab/sparse__table_8cpp.html#ad71ae7840af3a52e7ee56186bb0c3063", null ], + [ "getMinimum", "d8/dab/sparse__table_8cpp.html#a932816c3de9e5ad122b180de60978e8f", null ] ] ] ]; \ No newline at end of file diff --git a/dd/d7a/classdouble__linked__list-members.html b/dd/d7a/classdouble__linked__list-members.html index 9cc580cb4..68f9f7d5c 100644 --- a/dd/d7a/classdouble__linked__list-members.html +++ b/dd/d7a/classdouble__linked__list-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -108,7 +108,7 @@ $(document).ready(function(){initNavTree('d9/dee/classdouble__linked__list.html' diff --git a/dd/d81/namespacecaesar.html b/dd/d81/namespacecaesar.html index 9d5c9cdff..69a7a2c69 100644 --- a/dd/d81/namespacecaesar.html +++ b/dd/d81/namespacecaesar.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: caesar Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('dd/d81/namespacecaesar.html','../../') diff --git a/dd/d91/class_fenwick_tree.html b/dd/d91/class_fenwick_tree.html index 4b2dbd8b0..382bd4f1c 100644 --- a/dd/d91/class_fenwick_tree.html +++ b/dd/d91/class_fenwick_tree.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: FenwickTree Class Reference @@ -42,10 +42,10 @@ - + @@ -172,6 +172,9 @@ int n
    32  update(i, arr[i]);
    33  }
    34  }
    +
    std::vector::assign
    T assign(T... args)
    +
    FenwickTree::update
    void update(int id, int val)
    Definition: fenwick_tree.cpp:45
    +
    std::vector::size
    T size(T... args)
    Here is the call graph for this function:
    @@ -285,6 +288,7 @@ Here is the call graph for this function:
    60  }
    61  return res;
    62  }
    +
    FenwickTree::offset
    int offset(int x)
    Definition: fenwick_tree.cpp:22
    Here is the call graph for this function:
    @@ -329,6 +333,7 @@ Here is the call graph for this function:

    Returns the prefix sum in range from l to r

    65 { return sum(r) - sum(l - 1); }
    +
    FenwickTree::sum
    int sum(int id)
    Definition: fenwick_tree.cpp:54
    Here is the call graph for this function:
    @@ -393,16 +398,11 @@ Here is the call graph for this function:
    -
    std::vector::size
    T size(T... args)
    -
    FenwickTree::offset
    int offset(int x)
    Definition: fenwick_tree.cpp:22
    -
    FenwickTree::update
    void update(int id, int val)
    Definition: fenwick_tree.cpp:45
    -
    std::vector::assign
    T assign(T... args)
    -
    FenwickTree::sum
    int sum(int id)
    Definition: fenwick_tree.cpp:54
    diff --git a/dd/d91/class_fenwick_tree_a70f8c261393ca09ec1ad716ac806ead6_cgraph.svg b/dd/d91/class_fenwick_tree_a70f8c261393ca09ec1ad716ac806ead6_cgraph.svg index 28a80e0c7..1cdaee79e 100644 --- a/dd/d91/class_fenwick_tree_a70f8c261393ca09ec1ad716ac806ead6_cgraph.svg +++ b/dd/d91/class_fenwick_tree_a70f8c261393ca09ec1ad716ac806ead6_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::vector::assign diff --git a/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.svg b/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.svg index b7db5974b..535bb7eae 100644 --- a/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.svg +++ b/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::vector::assign @@ -36,7 +36,7 @@ Node3 - + std::vector::size diff --git a/dd/da0/todo.html b/dd/da0/todo.html index e8bd53f01..9d7410fd7 100644 --- a/dd/da0/todo.html +++ b/dd/da0/todo.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Todo List @@ -42,10 +42,10 @@ - + @@ -95,34 +95,34 @@ $(document).ready(function(){initNavTree('dd/da0/todo.html','../../'); initResiz
    -
    File hill_cipher.cpp
    -
    Better matrix generation algorithm.
    File avltree.cpp
    update code to use C++ STL library features and OO structure
    File binary_search_tree.cpp
    update code to use C++ STL library features and OO structure
    -
    File list_array.cpp
    -
    Add documentation
    -
    Member data_structures::trie::deleteString (const std::string &str, int index)
    -
    review the function ::data_structure::trie::deleteString and the commented lines
    -
    Member test1 ()
    -
    better ways to self-check a matrix output?
    -
    Member mat_size
    -
    @stepfencurryxiao add documetnation
    -
    Member fib_b
    -
    @stepfencurryxiao add documetnation
    -
    File paranthesis_matching.cpp
    -
    implement as a C++ class
    -
    Member test3 ()
    -
    This test fails
    -
    File heavy_light_decomposition.cpp
    -
    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
    -
    File hash_search.cpp
    -
    fix the program for memory leaks and better structure in C++ and not C fashion
    Member create_list (int key)
    fix memory leak
    +
    Member data_structures::trie::deleteString (const std::string &str, int index)
    +
    review the function ::data_structure::trie::deleteString and the commented lines
    +
    Member fib_b
    +
    @stepfencurryxiao add documetnation
    Member get_input ()
    -
    @christianbender Get input from STDIO or write input to memory as done above.
    +
    @christianbender Get input from STDIO or write input to memory as done above.
    +
    File hash_search.cpp
    +
    fix the program for memory leaks and better structure in C++ and not C fashion
    +
    File heavy_light_decomposition.cpp
    +
    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
    +
    File hill_cipher.cpp
    +
    Better matrix generation algorithm.
    +
    File list_array.cpp
    +
    Add documentation
    +
    Member mat_size
    +
    @stepfencurryxiao add documetnation
    +
    File paranthesis_matching.cpp
    +
    implement as a C++ class
    +
    Member test1 ()
    +
    better ways to self-check a matrix output?
    +
    Member test3 ()
    +
    This test fails
    @@ -130,7 +130,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 16c1cf0d9..06a9dd10b 100644 --- a/dd/da8/pigeonhole__sort_8cpp.html +++ b/dd/da8/pigeonhole__sort_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: sorting/pigeonhole_sort.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -133,7 +133,8 @@ Functions

    Detailed Description

    Implementation of Pigeonhole Sort algorithm

    -
    Author
    Lownish Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number of elements and the number of possible key values are approximately the same. It requires O(n + Range) time where n is number of elements in input array and ‘Range’ is number of possible values in array.
    +
    Author
    Lownish
    +

    Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number of elements and the number of possible key values are approximately the same. It requires O(n + Range) time where n is number of elements in input array and ‘Range’ is number of possible values in array.

    The time Complexity of the algorithm is \(O(n+N)\).

    Function Documentation

    @@ -159,6 +160,9 @@ Functions
    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
    Here is the call graph for this function:
    @@ -205,6 +209,12 @@ Here is the call graph for this function:
    79  }
    80  std::cout << "\nPassed\n";
    81 }
    + +
    std::array::at
    T at(T... args)
    + +
    std::begin
    T begin(T... args)
    +
    std::end
    T end(T... args)
    +
    std::is_sorted
    T is_sorted(T... args)
    Here is the call graph for this function:
    @@ -309,20 +319,11 @@ Here is the call graph for this function:
    -
    std::is_sorted
    T is_sorted(T... args)
    -
    std::array::at
    T at(T... args)
    - -
    std::array
    STL class.
    -
    test_1
    static void test_1()
    Definition: pigeonhole_sort.cpp:68
    -
    test_3
    static void test_3()
    Definition: pigeonhole_sort.cpp:109
    -
    std::begin
    T begin(T... args)
    -
    std::end
    T end(T... args)
    -
    test_2
    static void test_2()
    Definition: pigeonhole_sort.cpp:88
    diff --git a/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg b/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg index a5b0ff5d4..16a3fb39f 100644 --- a/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg +++ b/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::array::at @@ -36,7 +36,7 @@ Node3 - + std::begin @@ -51,7 +51,7 @@ Node4 - + std::end @@ -66,7 +66,7 @@ Node5 - + std::is_sorted diff --git a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg b/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg index c44ecd27f..5fb094b82 100644 --- a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg +++ b/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::array::at @@ -36,7 +36,7 @@ Node3 - + std::begin @@ -51,7 +51,7 @@ Node4 - + std::end @@ -66,7 +66,7 @@ Node5 - + std::is_sorted diff --git a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index ca0dca3cd..dfe50643e 100644 --- a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -66,7 +66,7 @@ Node3 - + std::array::at @@ -81,7 +81,7 @@ Node4 - + std::begin @@ -96,7 +96,7 @@ Node5 - + std::end @@ -111,7 +111,7 @@ Node6 - + std::is_sorted diff --git a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg b/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg index 5a60256b2..9748f7dfc 100644 --- a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg +++ b/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::array::at @@ -36,7 +36,7 @@ Node3 - + std::begin @@ -51,7 +51,7 @@ Node4 - + std::end @@ -66,7 +66,7 @@ Node5 - + std::is_sorted diff --git a/dd/da8/struct_segment_intersection-members.html b/dd/da8/struct_segment_intersection-members.html index 77e3960ab..15c858316 100644 --- a/dd/da8/struct_segment_intersection-members.html +++ b/dd/da8/struct_segment_intersection-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d4/db4/struct_segment_intersection.htm diff --git a/dd/dae/structquadratic__probing_1_1_entry-members.html b/dd/dae/structquadratic__probing_1_1_entry-members.html index 366241302..e1bc0b15a 100644 --- a/dd/dae/structquadratic__probing_1_1_entry-members.html +++ b/dd/dae/structquadratic__probing_1_1_entry-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -104,7 +104,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 b12bf7077..d24d77b78 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,7 +3,7 @@ - + Algorithms_in_C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp @@ -42,10 +42,10 @@ - + @@ -118,7 +118,7 @@ $(document).ready(function(){initNavTree('dd/db0/_2_users_2runner_2work_2_c-_plu
    #include <cassert>
    #include <ctime>
    #include <iostream> /// for io operations
    -
    #include <vector>
    +
    #include <vector>
    /**
    * @namespace sorting
    @@ -227,26 +227,26 @@ $(document).ready(function(){initNavTree('dd/db0/_2_users_2runner_2work_2_c-_plu
    }
    /** @} */
    + +
    std::endl
    T endl(T... args)
    +
    main
    int main()
    Definition: graph_coloring.cpp:96
    +
    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
    +
    sorting
    Sorting algorithms.
    +
    wiggle_sort
    Functions for Wiggle Sort algorithm.
    +
    std::rand
    T rand(T... args)
    +
    test
    static void test()
    Test implementations.
    Definition: rat_maze.cpp:84
    +
    std::vector::size
    T size(T... args)
    +
    std::srand
    T srand(T... args)
    +
    std::swap
    T swap(T... args)
    +
    std::time
    T time(T... args)
    + +
    sorting::wiggle_sort::wiggleSort
    std::vector< T > wiggleSort(const std::vector< T > &arr)
    Function used for sorting the elements in wave form.
    Definition: wiggle_sort.cpp:53
    -
    std::srand
    T srand(T... args)
    -
    test
    static void test()
    Test implementations.
    Definition: rat_maze.cpp:84
    -
    std::vector
    STL class.
    -
    std::vector::size
    T size(T... args)
    -
    sorting
    Sorting algorithms.
    -
    main
    int main()
    Definition: graph_coloring.cpp:96
    - -
    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
    -
    sorting::wiggle_sort::wiggleSort
    std::vector< T > wiggleSort(const std::vector< T > &arr)
    Function used for sorting the elements in wave form.
    Definition: wiggle_sort.cpp:53
    -
    std::rand
    T rand(T... args)
    -
    std::swap
    T swap(T... args)
    -
    std::endl
    T endl(T... args)
    -
    wiggle_sort
    Functions for Wiggle Sort algorithm.
    -
    std::time
    T time(T... args)
    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 d467d9c06..f102c22e7 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,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -137,7 +137,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 27cd657f4..ba8e64a68 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,7 +3,7 @@ - + Algorithms_in_C++: graph::is_graph_bipartite::Graph Class Reference @@ -42,10 +42,10 @@ - + @@ -174,6 +174,10 @@ int  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
    +
    std::vector::resize
    T resize(T... args)
    @@ -216,6 +220,7 @@ int  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)
    Here is the call graph for this function:
    @@ -269,6 +274,8 @@ Here is the call graph for this function:
    126  }
    127  return check;
    128 }
    + +
    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
    @@ -277,18 +284,11 @@ Here is the call graph for this function: -
    std::vector::resize
    T resize(T... args)
    -
    std::queue
    STL class.
    -
    std::vector::push_back
    T push_back(T... args)
    -
    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::side
    std::vector< int > side
    stores the side of the vertex
    Definition: is_graph_bipartite.cpp:58
    -
    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
    -
    graph::is_graph_bipartite::Graph::n
    int n
    size of the graph
    Definition: is_graph_bipartite.cpp:53
    diff --git a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_ad8c10df34357b2cd865c81e0c4f0bd8c_cgraph.svg b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_ad8c10df34357b2cd865c81e0c4f0bd8c_cgraph.svg index 968527c3c..4ca9d607f 100644 --- a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_ad8c10df34357b2cd865c81e0c4f0bd8c_cgraph.svg +++ b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_ad8c10df34357b2cd865c81e0c4f0bd8c_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::vector::push_back diff --git a/de/d07/cycle__sort_8cpp.html b/de/d07/cycle__sort_8cpp.html index b4231977e..9a514934f 100644 --- a/de/d07/cycle__sort_8cpp.html +++ b/de/d07/cycle__sort_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: sorting/cycle_sort.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -210,6 +210,8 @@ template<typename T >
    76  }
    77  return arr;
    78 }
    +
    std::swap
    T swap(T... args)
    +
    Here is the call graph for this function:
    @@ -241,6 +243,7 @@ Here is the call graph for this function:
    108  test(); // execute the test
    109  return 0;
    110 }
    +
    test
    static void test()
    Test implementations.
    Definition: cycle_sort.cpp:86
    Here is the call graph for this function:
    @@ -291,6 +294,12 @@ Here is the call graph for this function:
    99  assert(std::is_sorted(std::begin(arr2), std::end(arr2)));
    100  std::cout << "passed" << std::endl;
    101 }
    + +
    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:39
    +
    std::end
    T end(T... args)
    +
    std::endl
    T endl(T... args)
    +
    std::is_sorted
    T is_sorted(T... args)
    Here is the call graph for this function:
    @@ -302,20 +311,11 @@ Here is the call graph for this function:
    -
    std::vector
    STL class.
    -
    std::is_sorted
    T is_sorted(T... args)
    - -
    test
    static void test()
    Test implementations.
    Definition: cycle_sort.cpp:86
    -
    sorting::cycle_sort::cycleSort
    std::vector< T > cycleSort(const std::vector< T > &in_arr)
    The main function implements cycleSort.
    Definition: cycle_sort.cpp:39
    -
    std::swap
    T swap(T... args)
    -
    std::endl
    T endl(T... args)
    -
    std::begin
    T begin(T... args)
    -
    std::end
    T end(T... args)
    diff --git a/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 7172239a6..b4ef74221 100644 --- a/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::begin @@ -36,7 +36,7 @@ Node3 - + std::end @@ -51,7 +51,7 @@ Node4 - + std::endl @@ -66,7 +66,7 @@ Node5 - + std::is_sorted diff --git a/de/d07/cycle__sort_8cpp_ad0cfe2e54b1d3f9d0ca648265d917c6a_cgraph.svg b/de/d07/cycle__sort_8cpp_ad0cfe2e54b1d3f9d0ca648265d917c6a_cgraph.svg index cafd7b60d..7735f046a 100644 --- a/de/d07/cycle__sort_8cpp_ad0cfe2e54b1d3f9d0ca648265d917c6a_cgraph.svg +++ b/de/d07/cycle__sort_8cpp_ad0cfe2e54b1d3f9d0ca648265d917c6a_cgraph.svg @@ -28,7 +28,7 @@ Node2 - + std::vector::size @@ -43,7 +43,7 @@ Node3 - + std::swap diff --git a/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index c7b946104..d35c10aa5 100644 --- a/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::begin @@ -51,7 +51,7 @@ Node4 - + std::end @@ -66,7 +66,7 @@ Node5 - + std::endl @@ -81,7 +81,7 @@ Node6 - + std::is_sorted diff --git a/de/d0a/namespacemerge__insertion.html b/de/d0a/namespacemerge__insertion.html index 019e07b0f..7f60b0d30 100644 --- a/de/d0a/namespacemerge__insertion.html +++ b/de/d0a/namespacemerge__insertion.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: merge_insertion Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('de/d0a/namespacemerge__insertion.html' diff --git a/de/d0d/fibonacci__search_8cpp.html b/de/d0d/fibonacci__search_8cpp.html index 2703d0ca7..ecee09602 100644 --- a/de/d0d/fibonacci__search_8cpp.html +++ b/de/d0d/fibonacci__search_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: search/fibonacci_search.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -211,6 +211,10 @@ bool  65  // value was not found, return -1
    66  return -1;
    67 }
    +
    std::vector::empty
    T empty(T... args)
    +
    std::min
    T min(T... args)
    +
    std::next
    T next(T... args)
    +
    std::vector::size
    T size(T... args)
    Here is the call graph for this function:
    @@ -241,6 +245,8 @@ Here is the call graph for this function:
    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
    Here is the call graph for this function:
    @@ -252,17 +258,11 @@ Here is the call graph for this function:
    -
    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
    -
    std::vector::size
    T size(T... args)
    -
    std::min
    T min(T... args)
    -
    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
    -
    std::vector::empty
    T empty(T... args)
    -
    std::next
    T next(T... args)
    diff --git a/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.svg b/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.svg index 6eb809ab9..4f5a5aa3d 100644 --- a/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.svg +++ b/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::vector::empty @@ -36,7 +36,7 @@ Node3 - + std::min @@ -51,7 +51,7 @@ Node4 - + std::vector::size diff --git a/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 6c6ec9c79..80897bb3f 100644 --- a/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -51,7 +51,7 @@ Node3 - + std::vector::begin @@ -66,7 +66,7 @@ Node4 - + std::vector::clear @@ -81,7 +81,7 @@ Node5 - + std::vector::end @@ -111,7 +111,7 @@ Node10 - + std::find @@ -126,7 +126,7 @@ Node11 - + std::vector::push_back @@ -141,7 +141,7 @@ Node12 - + std::rand @@ -156,7 +156,7 @@ Node13 - + std::remove @@ -171,7 +171,7 @@ Node7 - + std::vector::empty @@ -186,7 +186,7 @@ Node8 - + std::min @@ -201,7 +201,7 @@ Node9 - + std::vector::size @@ -258,7 +258,7 @@ Node15 - + std::sort 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 11380d5db..29b19fca4 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,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -108,7 +108,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 3eeee18f8..bd9119473 100644 --- a/de/d23/disjoint__set_8cpp.html +++ b/de/d23/disjoint__set_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: data_structures/disjoint_set.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -164,6 +164,7 @@ Variables
    41  root[i] = i;
    42  }
    43 }
    + @@ -195,6 +196,7 @@ Variables
    56  }
    57  return root[x] = Find(root[x]);
    58 }
    +
    Find
    int Find(int x)
    Definition: disjoint_set.cpp:53
    @@ -278,6 +280,11 @@ Here is the call graph for this function:
    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
    +
    endl
    #define endl
    Definition: matrix_exponentiation.cpp:36
    Here is the call graph for this function:
    @@ -343,18 +350,11 @@ Here is the call graph for this function:
    -
    CreateSet
    void CreateSet(int n)
    Definition: disjoint_set.cpp:37
    -
    std::vector
    STL class.
    -
    Find
    int Find(int x)
    Definition: disjoint_set.cpp:53
    - -
    endl
    #define endl
    Definition: matrix_exponentiation.cpp:36
    -
    InSameUnion
    bool InSameUnion(int x, int y)
    Definition: disjoint_set.cpp:67
    -
    Union
    void Union(int x, int y)
    Definition: disjoint_set.cpp:78
    diff --git a/de/d29/class_fenwick_tree-members.html b/de/d29/class_fenwick_tree-members.html index 5608973b1..66bb1653e 100644 --- a/de/d29/class_fenwick_tree-members.html +++ b/de/d29/class_fenwick_tree-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -110,7 +110,7 @@ $(document).ready(function(){initNavTree('dd/d91/class_fenwick_tree.html','../.. diff --git a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.map b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.map index 8da8713f7..ec20835af 100644 --- a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.map +++ b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.map @@ -1,4 +1,4 @@ - - + + diff --git a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.md5 b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.md5 index 8e58b3886..67866c71b 100644 --- a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.md5 +++ b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.md5 @@ -1 +1 @@ -b1e11e055685e4ded564a9355fe80547 \ No newline at end of file +4bffc9d3c5d7e06e142e0fd23855edc7 \ No newline at end of file diff --git a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.svg b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.svg index 3c1c52a2d..bbdb64799 100644 --- a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.svg +++ b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.svg @@ -13,36 +13,29 @@ Node1 - -data_structures::linked -_list::link + +data_structures::linked +_list::link Node2 - - -std::shared_ptr< data -_structures::linked_list -::link > + + +std::shared_ptr< data +_structures::linked_list +::link > - - -Node1->Node2 - - - ptr - Node2->Node1 - - - psucc + + + psucc     diff --git a/de/d47/string__fibonacci_8cpp.html b/de/d47/string__fibonacci_8cpp.html index 6b96c900e..8d371d5d0 100644 --- a/de/d47/string__fibonacci_8cpp.html +++ b/de/d47/string__fibonacci_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/string_fibonacci.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -154,7 +154,7 @@ Functions -
    Returns
    sum as a std::string
    +
    Returns
    sum as a std::string
    24  {
    25  std::string temp = "";
    26 
    @@ -195,6 +195,9 @@ Functions
    61 
    62  return temp;
    63 }
    + +
    std::string::length
    T length(T... args)
    +
    std::string::substr
    T substr(T... args)
    Here is the call graph for this function:
    @@ -236,6 +239,8 @@ Here is the call graph for this function:
    76  }
    77  std::cout << fibMinus2;
    78 }
    + +
    add
    std::string add(std::string a, std::string b)
    Definition: string_fibonacci.cpp:24
    Here is the call graph for this function:
    @@ -270,6 +275,8 @@ Here is the call graph for this function:
    87 
    88  return 0;
    89 }
    + +
    fib_Accurate
    void fib_Accurate(uint64_t n)
    Definition: string_fibonacci.cpp:68
    Here is the call graph for this function:
    @@ -281,18 +288,11 @@ Here is the call graph for this function:
    -
    std::string
    STL class.
    -
    std::string::length
    T length(T... args)
    - -
    std::string::substr
    T substr(T... args)
    -
    add
    std::string add(std::string a, std::string b)
    Definition: string_fibonacci.cpp:24
    -
    fib_Accurate
    void fib_Accurate(uint64_t n)
    Definition: string_fibonacci.cpp:68
    - diff --git a/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.svg b/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.svg index c80e066b2..2f004313e 100644 --- a/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.svg +++ b/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::string::length @@ -36,7 +36,7 @@ Node3 - + std::string::substr diff --git a/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg b/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg index 26735bdc2..41abf80f9 100644 --- a/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg +++ b/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::string::length @@ -51,7 +51,7 @@ Node4 - + std::string::substr diff --git a/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 5dcca2ec4..633e0ff19 100644 --- a/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -51,7 +51,7 @@ Node4 - + std::string::length @@ -66,7 +66,7 @@ Node5 - + std::string::substr diff --git a/de/d48/struct_trie_1_1_trie_node.html b/de/d48/struct_trie_1_1_trie_node.html index df63fc83d..44b4a816e 100644 --- a/de/d48/struct_trie_1_1_trie_node.html +++ b/de/d48/struct_trie_1_1_trie_node.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Trie::TrieNode Struct Reference @@ -42,10 +42,10 @@ - + @@ -124,7 +124,7 @@ bool isEndOfWord {fals diff --git a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.svg b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.svg index 37392f652..e185fe3a6 100644 --- a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.svg +++ b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.svg @@ -23,7 +23,7 @@ Node2 - + std::vector< std::vector < int > > @@ -40,7 +40,7 @@ Node3 - + std::vector< int > @@ -64,7 +64,7 @@ Node4 - + std::vector< std::list < int > > @@ -81,7 +81,7 @@ Node5 - + std::list< int > @@ -97,7 +97,7 @@ Node6 - + std::vector< X > diff --git a/de/d6a/knuth__morris__pratt_8cpp.html b/de/d6a/knuth__morris__pratt_8cpp.html index 137dd5d24..17878e445 100644 --- a/de/d6a/knuth__morris__pratt_8cpp.html +++ b/de/d6a/knuth__morris__pratt_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: strings/knuth_morris_pratt.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -168,6 +168,10 @@ Functions
    93 
    94  return 0;
    95 }
    + + +
    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:
    @@ -179,15 +183,11 @@ Here is the call graph for this function:
    -
    std::string
    STL class.
    - -
    string_search::kmp
    bool kmp(const std::string &pattern, const std::string &text)
    Definition: knuth_morris_pratt.cpp:56
    -
    std::endl
    T endl(T... args)
    diff --git a/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 6d87aff29..dd9030dc6 100644 --- a/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::endl @@ -67,7 +67,7 @@ Node5 - + std::string::size diff --git a/de/d75/qr__eigen__values_8cpp.html b/de/d75/qr__eigen__values_8cpp.html index 630b84f85..603870856 100644 --- a/de/d75/qr__eigen__values_8cpp.html +++ b/de/d75/qr__eigen__values_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: numerical_methods/qr_eigen_values.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -198,6 +198,8 @@ Functions
    41  }
    42  }
    43 }
    +
    LIMS
    #define LIMS
    Definition: qr_eigen_values.cpp:20
    +
    std::rand
    T rand(T... args)
    Here is the call graph for this function:
    @@ -275,6 +277,18 @@ Here is the call graph for this function:
    282 
    283  return 0;
    284 }
    +
    std::atoi
    T atoi(T... args)
    + +
    std::clock
    T clock(T... args)
    +
    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
    +
    std::srand
    T srand(T... args)
    +
    std::time
    T time(T... args)
    +
    Here is the call graph for this function:
    @@ -347,6 +361,7 @@ Here is the call graph for this function:
    72  }
    73  }
    74 }
    +
    std::perror
    T perror(T... args)
    @@ -389,6 +404,8 @@ Here is the call graph for this function:
    195  }
    196  std::cout << "Test 1 Passed\n\n";
    197 }
    +
    std::endl
    T endl(T... args)
    +
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition: fibonacci_sum.cpp:76
    Here is the call graph for this function:
    @@ -456,28 +473,11 @@ Here is the call graph for this function:
    -
    std::srand
    T srand(T... args)
    -
    mat_size
    ll mat_size
    Definition: matrix_exponentiation.cpp:45
    -
    create_matrix
    void create_matrix(std::valarray< std::valarray< double >> *A)
    Definition: qr_eigen_values.cpp:28
    -
    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
    -
    std::clock
    T clock(T... args)
    -
    std::fprintf
    T fprintf(T... args)
    - -
    std::atoi
    T atoi(T... args)
    -
    std::perror
    T perror(T... args)
    -
    std::valarray
    STL class.
    -
    test2
    void test2()
    Definition: qr_eigen_values.cpp:210
    -
    std::rand
    T rand(T... args)
    -
    test1
    void test1()
    Definition: qr_eigen_values.cpp:177
    -
    std::endl
    T endl(T... args)
    -
    std::time
    T time(T... args)
    -
    LIMS
    #define LIMS
    Definition: qr_eigen_values.cpp:20
    -
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition: fibonacci_sum.cpp:76
    diff --git a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg index 93944a283..8ea1e3ce5 100644 --- a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg +++ b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg @@ -83,7 +83,7 @@ var sectionId = 'dynsection-4'; Node10 - + std::endl @@ -173,7 +173,7 @@ var sectionId = 'dynsection-4'; Node7 - + std::sqrt diff --git a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg index 7a4004b84..d4cb0eacd 100644 --- a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg +++ b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg @@ -37,7 +37,7 @@ Node10 - + std::endl @@ -127,7 +127,7 @@ Node7 - + std::sqrt diff --git a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg index a14a90495..1975a2e00 100644 --- a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg +++ b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg @@ -83,7 +83,7 @@ var sectionId = 'dynsection-3'; Node10 - + std::endl @@ -173,7 +173,7 @@ var sectionId = 'dynsection-3'; Node7 - + std::sqrt diff --git a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg index d5c5e58aa..9c9d1ae0f 100644 --- a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg +++ b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg @@ -37,7 +37,7 @@ Node10 - + std::endl @@ -127,7 +127,7 @@ Node7 - + std::sqrt diff --git a/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.svg b/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.svg index b7c41b4bb..26e78dcea 100644 --- a/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.svg +++ b/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::rand diff --git a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg index a84225627..5eecae052 100644 --- a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg +++ b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg @@ -98,7 +98,7 @@ var sectionId = 'dynsection-2'; Node12 - + std::srand @@ -143,7 +143,7 @@ var sectionId = 'dynsection-2'; Node16 - + std::time @@ -158,7 +158,7 @@ var sectionId = 'dynsection-2'; Node3 - + std::rand @@ -248,7 +248,7 @@ var sectionId = 'dynsection-2'; Node9 - + std::sqrt @@ -290,7 +290,7 @@ var sectionId = 'dynsection-2'; Node14 - + std::endl diff --git a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg index 9590ee5bd..c5ae09288 100644 --- a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg +++ b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -52,7 +52,7 @@ Node12 - + std::srand @@ -97,7 +97,7 @@ Node16 - + std::time @@ -112,7 +112,7 @@ Node3 - + std::rand @@ -202,7 +202,7 @@ Node9 - + std::sqrt @@ -244,7 +244,7 @@ Node14 - + std::endl diff --git a/de/d7b/merge__insertion__sort_8cpp.html b/de/d7b/merge__insertion__sort_8cpp.html index a0cc089c4..e8ef7267f 100644 --- a/de/d7b/merge__insertion__sort_8cpp.html +++ b/de/d7b/merge__insertion__sort_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: sorting/merge_insertion_sort.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -227,6 +227,8 @@ template<typename T , size_t N>
    52  ptr[j] = temp;
    53  }
    54 }
    +
    std::array::data
    T data(T... args)
    +
    std::end
    T end(T... args)
    Here is the call graph for this function:
    @@ -259,6 +261,9 @@ Here is the call graph for this function:
    161  test();
    162  return 0;
    163 }
    +
    test
    static void test()
    Function to test code using random arrays.
    Definition: merge_insertion_sort.cpp:132
    +
    std::srand
    T srand(T... args)
    +
    std::time
    T time(T... args)
    Here is the call graph for this function:
    @@ -358,6 +363,10 @@ template<typename T , size_t N>
    89  // for (int index = min; index <= max; index++) ptr[index] =
    90  // tempArray[index];
    91 }
    + +
    std::max
    T max(T... args)
    +
    std::memcpy
    T memcpy(T... args)
    +
    std::min
    T min(T... args)
    Here is the call graph for this function:
    @@ -440,6 +449,9 @@ template<typename T , size_t N>
    121  merge(array, min, max, mid);
    122  }
    123 }
    +
    merge
    void merge(int *arr, int l, int m, int r)
    Definition: merge_sort.cpp:33
    +
    mergeSort
    void mergeSort(int *arr, int l, int r)
    Definition: merge_sort.cpp:71
    +
    sorting::merge_insertion::InsertionSort
    static void InsertionSort(std::array< T, N > *A, size_t start, size_t end)
    Insertion merge algorithm.
    Definition: merge_insertion_sort.cpp:37
    Here is the call graph for this function:
    @@ -496,33 +508,21 @@ Here is the call graph for this function:
    151  assert(std::is_sorted(std::begin(array), std::end(array)));
    152  std::cout << "Test passed\n";
    153 }
    + +
    std::begin
    T begin(T... args)
    +
    std::endl
    T endl(T... args)
    +
    std::is_sorted
    T is_sorted(T... args)
    +
    std::rand
    T rand(T... args)
    -
    std::srand
    T srand(T... args)
    -
    std::is_sorted
    T is_sorted(T... args)
    -
    mergeSort
    void mergeSort(int *arr, int l, int r)
    Definition: merge_sort.cpp:71
    - -
    merge
    void merge(int *arr, int l, int m, int r)
    Definition: merge_sort.cpp:33
    -
    std::array
    STL class.
    -
    std::rand
    T rand(T... args)
    -
    std::min
    T min(T... args)
    -
    std::endl
    T endl(T... args)
    -
    std::begin
    T begin(T... args)
    -
    sorting::merge_insertion::InsertionSort
    static void InsertionSort(std::array< T, N > *A, size_t start, size_t end)
    Insertion merge algorithm.
    Definition: merge_insertion_sort.cpp:37
    -
    std::memcpy
    T memcpy(T... args)
    -
    std::time
    T time(T... args)
    -
    std::end
    T end(T... args)
    -
    std::max
    T max(T... args)
    -
    test
    static void test()
    Function to test code using random arrays.
    Definition: merge_insertion_sort.cpp:132
    -
    std::array::data
    T data(T... args)
    diff --git a/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.svg b/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.svg index 3054ffebd..1c7b7a092 100644 --- a/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.svg +++ b/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.svg @@ -28,7 +28,7 @@ Node2 - + std::array::data diff --git a/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.svg b/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.svg index 3681d8afa..da62ad3e4 100644 --- a/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.svg +++ b/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.svg @@ -74,7 +74,7 @@ Node3 - + std::array::data @@ -89,7 +89,7 @@ Node5 - + std::move diff --git a/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 0d0b804dc..1cdb9043a 100644 --- a/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::srand @@ -51,7 +51,7 @@ Node4 - + std::time diff --git a/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.svg b/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.svg index 7da6903e2..e7fd3ccba 100644 --- a/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.svg +++ b/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.svg @@ -22,7 +22,7 @@ Node2 - + std::array::data diff --git a/de/d7c/struct_trie_1_1_trie_node-members.html b/de/d7c/struct_trie_1_1_trie_node-members.html index 385f5062f..b2576081b 100644 --- a/de/d7c/struct_trie_1_1_trie_node-members.html +++ b/de/d7c/struct_trie_1_1_trie_node-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -104,7 +104,7 @@ $(document).ready(function(){initNavTree('de/d48/struct_trie_1_1_trie_node.html' diff --git a/de/d83/namespaceis__graph__bipartite.html b/de/d83/namespaceis__graph__bipartite.html index 9794b9745..efd6aa425 100644 --- a/de/d83/namespaceis__graph__bipartite.html +++ b/de/d83/namespaceis__graph__bipartite.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: is_graph_bipartite Namespace Reference @@ -42,10 +42,10 @@ - + @@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('de/d83/namespaceis__graph__bipartite.h diff --git a/de/d85/decimal__to__roman__numeral_8cpp.html b/de/d85/decimal__to__roman__numeral_8cpp.html index 3b21ddb0b..6c1bbc818 100644 --- a/de/d85/decimal__to__roman__numeral_8cpp.html +++ b/de/d85/decimal__to__roman__numeral_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: others/decimal_to_roman_numeral.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -155,6 +155,7 @@ Functions
    17  while (n--) s += c;
    18  return s;
    19 }
    + @@ -183,6 +184,10 @@ Functions
    96  std::cout << n << " in Lower Roman Numerals is " << tolowerRoman(n) << "\n";
    97  return 0;
    98 }
    + + +
    tolowerRoman
    std::string tolowerRoman(int n)
    Definition: decimal_to_roman_numeral.cpp:24
    +
    toupperRoman
    std::string toupperRoman(int n)
    Definition: decimal_to_roman_numeral.cpp:58
    Here is the call graph for this function:
    @@ -238,6 +243,7 @@ Here is the call graph for this function:
    51  return fill('m', n / 1000) + tolowerRoman(n % 1000);
    52  return "?";
    53 }
    +
    fill
    std::string fill(char c, int n)
    Definition: decimal_to_roman_numeral.cpp:15
    Here is the call graph for this function:
    @@ -304,17 +310,11 @@ Here is the call graph for this function:
    -
    std::string
    STL class.
    -
    tolowerRoman
    std::string tolowerRoman(int n)
    Definition: decimal_to_roman_numeral.cpp:24
    -
    fill
    std::string fill(char c, int n)
    Definition: decimal_to_roman_numeral.cpp:15
    - -
    toupperRoman
    std::string toupperRoman(int n)
    Definition: decimal_to_roman_numeral.cpp:58
    - diff --git a/de/d8a/class_trie-members.html b/de/d8a/class_trie-members.html index 5774f156d..0cdd2a230 100644 --- a/de/d8a/class_trie-members.html +++ b/de/d8a/class_trie-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -110,7 +110,7 @@ $(document).ready(function(){initNavTree('dd/d2f/class_trie.html','../../'); ini diff --git a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.svg b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.svg index e0db47776..958ccbdcc 100644 --- a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.svg +++ b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.svg @@ -22,7 +22,7 @@ Node2 - + std::array< float, 20 > diff --git a/de/d91/structlist-members.html b/de/d91/structlist-members.html index 210d28928..78c7fd012 100644 --- a/de/d91/structlist-members.html +++ b/de/d91/structlist-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -114,7 +114,7 @@ $(document).ready(function(){initNavTree('d8/d10/structlist.html','../../'); ini diff --git a/de/d9b/prime__numbers_8cpp.html b/de/d9b/prime__numbers_8cpp.html index a492b8896..861291601 100644 --- a/de/d9b/prime__numbers_8cpp.html +++ b/de/d9b/prime__numbers_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/prime_numbers.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -143,6 +143,12 @@ Functions
    31  for (int i = 0; i < ans.size(); i++) std::cout << ans[i] << ' ';
    32  std::cout << std::endl;
    33 }
    + + +
    std::endl
    T endl(T... args)
    +
    ans
    ll ans(ll n)
    Definition: matrix_exponentiation.cpp:91
    +
    primes
    std::vector< int > primes(int max)
    Definition: prime_numbers.cpp:12
    +
    Here is the call graph for this function:
    @@ -180,6 +186,8 @@ Here is the call graph for this function:
    21  }
    22  return res;
    23 }
    +
    std::max
    T max(T... args)
    +
    std::vector::push_back
    T push_back(T... args)
    Here is the call graph for this function:
    @@ -191,19 +199,11 @@ Here is the call graph for this function:
    -
    primes
    std::vector< int > primes(int max)
    Definition: prime_numbers.cpp:12
    - -
    ans
    ll ans(ll n)
    Definition: matrix_exponentiation.cpp:91
    -
    std::vector::push_back
    T push_back(T... args)
    - -
    std::endl
    T endl(T... args)
    -
    std::max
    T max(T... args)
    - diff --git a/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.svg b/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.svg index 4e0f95912..5e548335f 100644 --- a/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.svg +++ b/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.svg @@ -21,7 +21,7 @@ Node2 - + std::vector::push_back diff --git a/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index d08f6b6e9..8e454d736 100644 --- a/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -36,7 +36,7 @@ Node3 - + std::endl @@ -66,7 +66,7 @@ Node5 - + std::vector::push_back diff --git a/de/d9d/classdata__structures_1_1linked__list_1_1link.html b/de/d9d/classdata__structures_1_1linked__list_1_1link.html index 77c4b1c7b..94760fa59 100644 --- a/de/d9d/classdata__structures_1_1linked__list_1_1link.html +++ b/de/d9d/classdata__structures_1_1linked__list_1_1link.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: data_structures::linked_list::link Class Reference @@ -42,10 +42,10 @@ - + @@ -158,6 +158,8 @@ int 
    75 : pvalue(value), psucc(nullptr) {}
    +
    data_structures::linked_list::link::pvalue
    int pvalue
    value of the current link
    Definition: linked_list.cpp:55
    +
    data_structures::linked_list::link::psucc
    std::shared_ptr< link > psucc
    pointer to the next value on the list
    Definition: linked_list.cpp:56
    @@ -221,13 +223,11 @@ int 
    data_structures::linked_list::link::psucc
    std::shared_ptr< link > psucc
    pointer to the next value on the list
    Definition: linked_list.cpp:56
    -
    data_structures::linked_list::link::pvalue
    int pvalue
    value of the current link
    Definition: linked_list.cpp:55
    diff --git a/de/dab/ncr__modulo__p_8cpp.html b/de/dab/ncr__modulo__p_8cpp.html index 84c6cda44..c61c93572 100644 --- a/de/dab/ncr__modulo__p_8cpp.html +++ b/de/dab/ncr__modulo__p_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/ncr_modulo_p.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -120,7 +120,7 @@ Classes

    Namespaces

     math - for std::vector
    + for std::vector
       ncr_modulo_p  Functions for nCr modulo p implementation.
    @@ -171,6 +171,10 @@ Functions
    148  std::cout << "Assertions passed\n";
    149  return 0;
    150 }
    + +
    math::ncr_modulo_p::NCRModuloP
    Class which contains all methods required for calculating nCr mod p.
    Definition: ncr_modulo_p.cpp:31
    +
    math::ncr_modulo_p::NCRModuloP::ncr
    int64_t ncr(const uint64_t &n, const uint64_t &r, const uint64_t &p)
    Definition: ncr_modulo_p.cpp:92
    +
    tests
    static void tests(math::ncr_modulo_p::NCRModuloP ncrObj)
    Test implementations.
    Definition: ncr_modulo_p.cpp:124
    @@ -225,15 +229,11 @@ Here is the call graph for this function: -
    tests
    static void tests(math::ncr_modulo_p::NCRModuloP ncrObj)
    Test implementations.
    Definition: ncr_modulo_p.cpp:124
    -
    math::ncr_modulo_p::NCRModuloP
    Class which contains all methods required for calculating nCr mod p.
    Definition: ncr_modulo_p.cpp:31
    - -
    math::ncr_modulo_p::NCRModuloP::ncr
    int64_t ncr(const uint64_t &n, const uint64_t &r, const uint64_t &p)
    Definition: ncr_modulo_p.cpp:92
    diff --git a/de/db4/namespacedisjoint__union.html b/de/db4/namespacedisjoint__union.html new file mode 100644 index 000000000..953f272db --- /dev/null +++ b/de/db4/namespacedisjoint__union.html @@ -0,0 +1,112 @@ + + + + + + + +Algorithms_in_C++: disjoint_union Namespace Reference + + + + + + + + + + + + + + + +
    +
    + + + + + + +
    +
    Algorithms_in_C++ +  1.0.0 +
    +
    Set of algorithms implemented in C++.
    +
    +
    + + + + + + + +
    +
    + +
    +
    +
    + +
    + +
    +
    + + +
    + +
    + +
    +
    +
    disjoint_union Namespace Reference
    +
    +
    + +

    Functions for Disjoint union implementation. +More...

    +

    Detailed Description

    +

    Functions for Disjoint union implementation.

    +
    +
    + + + + diff --git a/de/db5/class_edge-members.html b/de/db5/class_edge-members.html index 1810d8424..fce3e9ec8 100644 --- a/de/db5/class_edge-members.html +++ b/de/db5/class_edge-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -42,10 +42,10 @@ - + @@ -114,7 +114,7 @@ $(document).ready(function(){initNavTree('d7/d77/class_edge.html','../../'); ini diff --git a/de/dc3/binaryheap_8cpp.html b/de/dc3/binaryheap_8cpp.html index 9806cc7d1..b26ad1596 100644 --- a/de/dc3/binaryheap_8cpp.html +++ b/de/dc3/binaryheap_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: data_structures/binaryheap.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -129,7 +129,7 @@ int main () diff --git a/de/dc3/fibonacci__sum_8cpp.html b/de/dc3/fibonacci__sum_8cpp.html index 3d260c4ad..a2984f13a 100644 --- a/de/dc3/fibonacci__sum_8cpp.html +++ b/de/dc3/fibonacci__sum_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: math/fibonacci_sum.cpp File Reference @@ -42,10 +42,10 @@ - + @@ -114,7 +114,7 @@ Include dependency graph for fibonacci_sum.cpp:

    Namespaces

     math - for std::vector
    + for std::vector
       fibonacci_sum  Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\).
    @@ -182,6 +182,7 @@ Functions
    90  {
    91  return (result(m + 2) - result(n + 1));
    92 }
    +
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition: fibonacci_sum.cpp:76
    Here is the call graph for this function:
    @@ -213,6 +214,7 @@ Here is the call graph for this function:
    137  test(); // execute the tests
    138  return 0;
    139 }
    +
    test
    static void test()
    Definition: fibonacci_sum.cpp:101
    Here is the call graph for this function:
    @@ -266,6 +268,7 @@ Here is the call graph for this function:
    47 
    48  return result;
    49 }
    +
    Here is the call graph for this function:
    @@ -321,6 +324,8 @@ Here is the call graph for this function:
    67  }
    68  return T;
    69 }
    +
    math::fibonacci_sum::power
    math::fibonacci_sum::matrix power(math::fibonacci_sum::matrix T, uint64_t ex)
    Definition: fibonacci_sum.cpp:57
    +
    machine_learning::multiply
    std::vector< std::valarray< T > > multiply(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)
    Definition: vector_ops.hpp:460
    Here is the call graph for this function:
    @@ -359,6 +364,7 @@ Here is the call graph for this function:
    80  ans = (ans - 1);
    81  return ans;
    82 }
    +
    ans
    ll ans(ll n)
    Definition: matrix_exponentiation.cpp:91
    Here is the call graph for this function:
    @@ -421,6 +427,12 @@ Here is the call graph for this function:
    128  assert(test_5 == 322);
    129  std::cout << "Passed Test 5!" << std::endl;
    130 }
    + +
    std::endl
    T endl(T... args)
    +
    math::fibonacci_sum::fiboSum
    uint64_t fiboSum(uint64_t n, uint64_t m)
    Definition: fibonacci_sum.cpp:90
    +
    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:
    @@ -432,23 +444,11 @@ Here is the call graph for this function:
    -
    math::fibonacci_sum::power
    math::fibonacci_sum::matrix power(math::fibonacci_sum::matrix T, uint64_t ex)
    Definition: fibonacci_sum.cpp:57
    -
    test_3
    static void test_3()
    Definition: heavy_light_decomposition.cpp:592
    -
    std::vector
    STL class.
    -
    test_2
    static void test_2()
    Definition: heavy_light_decomposition.cpp:549
    -
    ans
    ll ans(ll n)
    Definition: matrix_exponentiation.cpp:91
    - -
    math::fibonacci_sum::fiboSum
    uint64_t fiboSum(uint64_t n, uint64_t m)
    Definition: fibonacci_sum.cpp:90
    -
    test
    static void test()
    Definition: fibonacci_sum.cpp:101
    -
    test_1
    static void test_1()
    Definition: heavy_light_decomposition.cpp:505
    -
    std::endl
    T endl(T... args)
    -
    machine_learning::multiply
    std::vector< std::valarray< T > > multiply(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)
    Definition: vector_ops.hpp:460
    -
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition: fibonacci_sum.cpp:76
    diff --git a/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map index 4e45918de..3a89b1b29 100644 --- a/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map +++ b/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -1,25 +1,26 @@ - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 index 820a96d28..da437f973 100644 --- a/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 +++ b/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -1 +1 @@ -02f4e4d378db5d6a565edc72bcec01af \ No newline at end of file +709d0e6987d43218f53a3a7d6955e2ab \ No newline at end of file diff --git a/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 8ce6b91c8..3ec849b5f 100644 --- a/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -4,7 +4,7 @@ - +