diff --git a/annotated.html b/annotated.html index 19308df6f..c19bb6bf8 100644 --- a/annotated.html +++ b/annotated.html @@ -95,142 +95,145 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 1234]
- - - - - - - - - - + + + + + + + + + + - - - + + + - - - + + + - - - - - - - - - - + + + + + + + + + + - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + - - - + + + - - - - - - - - - - + + + + + + + + + + + + + - - - + + + - - - - + + + + - - - - + + + + - - - - + + + + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
 NciphersAlgorithms for encryption and decryption
 Nelliptic_curve_key_exchangeNamespace elliptic_curve_key_exchange
 CHillCipherImplementation of Hill Cipher algorithm
 Ndata_structuresData Structures algorithms
 Nlinked_list
 Nlist_array
 NciphersAlgorithms for encryption and decryption
 Ndata_structuresData Structures algorithms
 Nqueue_using_array
 Nsparse_table
 Nstack_using_queue
 Ntree_234
 Ntrie_using_hashmap
 CNode
 CSkipList
 CtrieTrie implementation for small-case English alphabets a-z
 Ndouble_hashingAn implementation of hash table using double hashing algorithm
 CEntry
 NgeometryGeometry algorithms
 Njarvis
 Ndouble_hashingAn implementation of hash table using double hashing algorithm
 NgeometryGeometry algorithms
 NgraphGraph Algorithms
 Nis_graph_bipartite
 CGraph
 CHKGraphRepresents Bipartite graph for Hopcroft Karp implementation
 CLowestCommonAncestor
 CRootedTree
 Nlinear_probingAn implementation of hash table using linear probing algorithm
 CEntry
 Nmachine_learningA* search algorithm
 Naystar_search
 Nneural_network
 NgraphGraph Algorithms
 Nlinear_probingAn implementation of hash table using linear probing algorithm
 Nmachine_learningA* search algorithm
 Cadaline
 NmathFor M_PI definition and pow()
 Nncr_modulo_p
 NmathFor M_PI definition and pow()
 Noperations_on_datastructuresFor std::vector
 Ninorder_traversal_of_bst
 Nreverse_binary_tree
 Ntrie_operations
 NothersFor vector
 Niterative_tree_traversals
 Noperations_on_datastructuresFor std::vector
 NothersFor vector
 Nlru_cache
 Npostfix_expression
 NprobabilityProbability algorithms
 Ngeometric_dist
 Nwindowed_median
 NprobabilityProbability algorithms
 Nquadratic_probingAn implementation of hash table using quadratic probing algorithm
 CEntry
 Nrange_queriesAlgorithms and Data Structures that support range queries and updates
 Nheavy_light_decomposition
 Nquadratic_probingAn implementation of hash table using quadratic probing algorithm
 Nrange_queriesAlgorithms and Data Structures that support range queries and updates
 CperSegTreeRange query here is range sum, but the code can be modified to make different queries like range max or min
 NsearchFor std::vector
 Nsublist_search
 NsearchFor std::vector
 NstatisticsStatistical algorithms
 Cstats_computer1
 Cstats_computer2
 NstdSTL namespace
 Cis_arithmetic< uint128_t >
 Cis_arithmetic< uint256_t >
 Cis_integral< uint128_t >
 Cis_integral< uint256_t >
 Cis_unsigned< uint128_t >
 Cis_unsigned< uint256_t >
 Cbinary_search_treeThe Binary Search Tree class
 Cbst_nodeA struct to represent a node in the Binary Search Tree
 CBtree
 Ccll
 CCompareComparator class for priority queue
 Ccompare
 CComplexClass Complex to represent complex numbers as a field
 CCycleCheck
 Cdouble_linked_list
 CdsuDisjoint sets union data structure, class based representation
 CEasterYearMonthDayFor IO operations
 CEdge
 CFCFSClass which implements the FCFS scheduling algorithm
 CFenwickTree
 CGraph
 Chash_chainChain class with a given modulus
 CItem
 Clarge_number
 Clinkedlist
 Clist
 CMinHeap
 CMinHeapNode
 Cmst
 CNode
 Cnode
 CPoint
 Cquery
 CQueue
 Cqueue
 CRBtree
 CSegmentIntersection
 CSolution
 Cstack
 Cstack_linkedList
 CTestCasesClass encapsulating the necessary test cases
 Ctower
 CTrie
 CTrieNode
 NstatisticsStatistical algorithms
 NstdSTL namespace
 Cbinary_search_treeThe Binary Search Tree class
 CBtree
 Ccll
 Ccompare
 CCompareComparator class for priority queue
 CComplexClass Complex to represent complex numbers as a field
 CCycleCheck
 Cdouble_linked_list
 CdsuDisjoint sets union data structure, class based representation
 CEasterYearMonthDayFor IO operations
 CEdge
 CFCFSClass which implements the FCFS scheduling algorithm
 CFenwickTree
 CGraph
 Chash_chainChain class with a given modulus
 CItem
 Clarge_number
 Clinkedlist
 Clist
 CMinHeap
 CMinHeapNode
 Cmst
 CNode
 Cnode
 CPoint
 Cquery
 CQueue
 Cqueue
 CRBtree
 CSegmentIntersection
 CSolution
 Cstack
 Cstack_linkedList
 CTestCasesClass encapsulating the necessary test cases
 Ctower
 CTrie
 Cuint128_tClass for 128-bit unsigned integer
 Cuint256_tClass for 256-bit unsigned integer
diff --git a/annotated_dup.js b/annotated_dup.js index 8e76be849..cf94bf039 100644 --- a/annotated_dup.js +++ b/annotated_dup.js @@ -75,6 +75,10 @@ var annotated_dup = ] ] ] ], [ "operations_on_datastructures", "da/d6d/namespaceoperations__on__datastructures.html", [ + [ "circular_linked_list", null, [ + [ "CircularLinkedList", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list" ], + [ "Node", "da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html", "da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node" ] + ] ], [ "inorder_traversal_of_bst", null, [ [ "Node", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node" ] ] ], @@ -137,8 +141,8 @@ var annotated_dup = [ "binary_search_tree", "d9/dde/classbinary__search__tree.html", "d9/dde/classbinary__search__tree" ], [ "Btree", "d9/d90/struct_btree.html", null ], [ "cll", "d5/d15/classcll.html", null ], - [ "Compare", "de/d4a/class_compare.html", "de/d4a/class_compare" ], [ "compare", "d1/db3/structcompare.html", null ], + [ "Compare", "de/d4a/class_compare.html", "de/d4a/class_compare" ], [ "Complex", "da/d5a/class_complex.html", "da/d5a/class_complex" ], [ "CycleCheck", "d3/dbb/class_cycle_check.html", "d3/dbb/class_cycle_check" ], [ "double_linked_list", "d9/dee/classdouble__linked__list.html", null ], diff --git a/classes.html b/classes.html index 4795117d0..45cd11402 100644 --- a/classes.html +++ b/classes.html @@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
binary_search_tree
BinaryTree (operations_on_datastructures::reverse_binary_tree)
BinaryTree (others::iterative_tree_traversals)
binary_search_tree::bst_node
Btree
C
-
cll
Compare
compare
AyStarSearch::comparison_operator (machine_learning::aystar_search)
Complex
Convexhull (geometry::jarvis)
CycleCheck
+
CircularLinkedList (operations_on_datastructures::circular_linked_list)
cll
compare
Compare
AyStarSearch::comparison_operator (machine_learning::aystar_search)
Complex
Convexhull (geometry::jarvis)
CycleCheck
D
DenseLayer (machine_learning::neural_network::layers)
double_linked_list
dsu
@@ -130,7 +130,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
MinHeap
MinHeapNode
mst
N
-
NCRModuloP (math::ncr_modulo_p)
NeuralNetwork (machine_learning::neural_network)
Node (data_structures::linked_list)
Node (data_structures)
Node (data_structures::tree_234)
Trie::Node (data_structures::trie_using_hashmap)
Node
node
Node (operations_on_datastructures::inorder_traversal_of_bst)
Node (operations_on_datastructures::reverse_binary_tree)
Node (others::iterative_tree_traversals)
perSegTree::Node (range_queries)
Node (search::sublist_search)
+
NCRModuloP (math::ncr_modulo_p)
NeuralNetwork (machine_learning::neural_network)
Node (data_structures::linked_list)
Node (data_structures)
Node (data_structures::tree_234)
Trie::Node (data_structures::trie_using_hashmap)
Node
node
Node (operations_on_datastructures::circular_linked_list)
Node (operations_on_datastructures::inorder_traversal_of_bst)
Node (operations_on_datastructures::reverse_binary_tree)
Node (others::iterative_tree_traversals)
perSegTree::Node (range_queries)
Node (search::sublist_search)
P
perSegTree (range_queries)
Point (ciphers::elliptic_curve_key_exchange)
Point (geometry::jarvis)
Point
diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg index 7f693e43e..c072bbbf3 100644 --- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg +++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg @@ -1,7 +1,7 @@ - diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg index 71a2ef85e..e0f5a9998 100644 --- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg +++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - diff --git a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg index 6b817c557..b3b062acd 100644 --- a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg +++ b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg @@ -1,7 +1,7 @@ - - - diff --git a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg index 009961780..7e12bb786 100644 --- a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg +++ b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 0e1ab80b0..11b03d5e1 100644 --- a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - diff --git a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg index 208d811bb..a0de5227b 100644 --- a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg +++ b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph_org.svg index 99d3b3077..2c0a1e8af 100644 --- a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph_org.svg +++ b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg index b9f186290..c7b0657b9 100644 --- a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg +++ b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - diff --git a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg index 28e0f1a37..f62c08cab 100644 --- a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg +++ b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg index a25b21b6d..135cd2bc7 100644 --- a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg +++ b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg index be594d746..54b6d6681 100644 --- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg +++ b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - diff --git a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index 33b5cafe8..5e12e132b 100644 --- a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - diff --git a/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph_org.svg b/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph_org.svg index bb608db98..39865105e 100644 --- a/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph_org.svg +++ b/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d2/d23/neural__network_8cpp__incl_org.svg b/d2/d23/neural__network_8cpp__incl_org.svg index 9377926c8..fe238da22 100644 --- a/d2/d23/neural__network_8cpp__incl_org.svg +++ b/d2/d23/neural__network_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - diff --git a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph_org.svg b/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph_org.svg index 503f21d24..65ac124d1 100644 --- a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph_org.svg +++ b/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - diff --git a/d2/d4b/spirograph_8cpp__incl_org.svg b/d2/d4b/spirograph_8cpp__incl_org.svg index 4323aef52..05d864314 100644 --- a/d2/d4b/spirograph_8cpp__incl_org.svg +++ b/d2/d4b/spirograph_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - + + + + + diff --git a/d2/d53/circular__linked__list_8cpp__incl.md5 b/d2/d53/circular__linked__list_8cpp__incl.md5 new file mode 100644 index 000000000..503944b56 --- /dev/null +++ b/d2/d53/circular__linked__list_8cpp__incl.md5 @@ -0,0 +1 @@ +4a5df2f20d9ab3d1adea97dcc129f753 \ No newline at end of file diff --git a/d2/d53/circular__linked__list_8cpp__incl.svg b/d2/d53/circular__linked__list_8cpp__incl.svg new file mode 100644 index 000000000..97d0ecb07 --- /dev/null +++ b/d2/d53/circular__linked__list_8cpp__incl.svg @@ -0,0 +1,68 @@ + + + + + + +operations_on_datastructures/circular_linked_list.cpp + + + +Node1 + + +operations_on_datastructures +/circular_linked_list.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + +Node4 + + +vector + + + + + +Node1->Node4 + + + + + diff --git a/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.svg b/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.svg index 0760a18ad..55c795333 100644 --- a/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.svg +++ b/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.svg @@ -1,7 +1,7 @@ - - - - - - - - diff --git a/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index 949227361..3cc48d822 100644 --- a/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 2b41d7fb4..93cafa31d 100644 --- a/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg b/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg index a3ba188e8..7b3f8f041 100644 --- a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg +++ b/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg b/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg index 6839856d5..7475b346d 100644 --- a/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg +++ b/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 8e8850674..c22ec1e2c 100644 --- a/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg b/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg index 0c9df7bcf..c0c978644 100644 --- a/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg +++ b/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - diff --git a/d3/d1a/hill__cipher_8cpp__incl_org.svg b/d3/d1a/hill__cipher_8cpp__incl_org.svg index 66670ee2e..428efd90d 100644 --- a/d3/d1a/hill__cipher_8cpp__incl_org.svg +++ b/d3/d1a/hill__cipher_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - diff --git a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg index b5605f9d9..22d017a7d 100644 --- a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg +++ b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 91e6390bc..811f0fab1 100644 --- a/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - diff --git a/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph_org.svg b/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph_org.svg index b738f1310..21c120dfb 100644 --- a/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph_org.svg +++ b/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph_org.svg index 0b1a98721..654911164 100644 --- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph_org.svg +++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph_org.svg index 629ee4532..7b24e15e9 100644 --- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph_org.svg +++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph_org.svg index 97668d60d..988802c54 100644 --- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph_org.svg +++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph_org.svg index ea72fdb75..4db3713f0 100644 --- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph_org.svg +++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph_org.svg index cdd29b134..5c03c2b93 100644 --- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph_org.svg +++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d4/d26/durand__kerner__roots_8cpp__incl_org.svg b/d4/d26/durand__kerner__roots_8cpp__incl_org.svg index 0b9652dce..b67206630 100644 --- a/d4/d26/durand__kerner__roots_8cpp__incl_org.svg +++ b/d4/d26/durand__kerner__roots_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - diff --git a/d4/d2f/fcfs__scheduling_8cpp__incl_org.svg b/d4/d2f/fcfs__scheduling_8cpp__incl_org.svg index 050bfbc2c..23c997a2e 100644 --- a/d4/d2f/fcfs__scheduling_8cpp__incl_org.svg +++ b/d4/d2f/fcfs__scheduling_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg index 6ec4f8554..4b04e427a 100644 --- a/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg +++ b/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - diff --git a/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index 33b5cafe8..5e12e132b 100644 --- a/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - diff --git a/d4/d60/kohonen__som__trace_8cpp__incl_org.svg b/d4/d60/kohonen__som__trace_8cpp__incl_org.svg index 90b741d01..cb597aa77 100644 --- a/d4/d60/kohonen__som__trace_8cpp__incl_org.svg +++ b/d4/d60/kohonen__som__trace_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 4842a7df4..c1732b7ba 100644 --- a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - - + + + + + + +Algorithms_in_C++: circular_linked_list Namespace Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ 1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
circular_linked_list Namespace Reference
+
+
+ +

Functions for the Circular Linked List implementation. +More...

+

Detailed Description

+

Functions for the Circular Linked List implementation.

+
+
+ + + + diff --git a/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.svg b/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.svg index be9764ba1..cf56eadb2 100644 --- a/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.svg +++ b/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.svg @@ -1,7 +1,7 @@ - - - diff --git a/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph_org.svg b/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph_org.svg index 6d92c01b9..55352288e 100644 --- a/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph_org.svg +++ b/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - diff --git a/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph_org.svg b/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph_org.svg index 14c53ab3a..3f151f08f 100644 --- a/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph_org.svg +++ b/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph_org.svg @@ -1,7 +1,7 @@ - - - diff --git a/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph_org.svg b/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph_org.svg index d39ee919e..9d7126ee8 100644 --- a/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph_org.svg +++ b/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - 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 b90842545..100b8d0ca 100644 --- a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg +++ b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg @@ -1,7 +1,7 @@ - - - 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 0941177cd..1a67ff572 100644 --- a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg +++ b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg @@ -1,7 +1,7 @@ - - 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 65a8bf13e..5b4cb5912 100644 --- a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg +++ b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - 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 7f49e7c1a..61950afd0 100644 --- a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg +++ b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph_org.svg index ff6274b2d..d344a94e2 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph_org.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph_org.svg @@ -1,7 +1,7 @@ - - - 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 242fc935d..a6e89baee 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 @@ -1,7 +1,7 @@ - - diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph_org.svg index f7e4b2e0a..4ddaa79a4 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph_org.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - 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 2f45dc941..7babec360 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 @@ -1,7 +1,7 @@ - - - - - diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph_org.svg index 6c1ae1fde..11e223b2c 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph_org.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph_org.svg index 85b249ed3..59721cfc6 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph_org.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph_org.svg index 01002e854..991a0554b 100644 --- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph_org.svg +++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - diff --git a/d5/d33/gram__schmidt_8cpp_aa31ca28f60c880802462335eedc5d91f_cgraph_org.svg b/d5/d33/gram__schmidt_8cpp_aa31ca28f60c880802462335eedc5d91f_cgraph_org.svg index b6fe22fff..77f197258 100644 --- a/d5/d33/gram__schmidt_8cpp_aa31ca28f60c880802462335eedc5d91f_cgraph_org.svg +++ b/d5/d33/gram__schmidt_8cpp_aa31ca28f60c880802462335eedc5d91f_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - diff --git a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg index 432351d69..0525e343b 100644 --- a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg +++ b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index 33b5cafe8..5e12e132b 100644 --- a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index 2a14c44f3..cac1a9690 100644 --- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 7744d432d..5e29e9349 100644 --- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - diff --git a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 2093e8927..181dccb6f 100644 --- a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph_org.svg b/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph_org.svg index 706bf1dfd..724a0d499 100644 --- a/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph_org.svg +++ b/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - -
  • data_structures/stack.h
  • data_structures/stack_using_linked_list.cpp
  • data_structures/tree.cpp
  • -
  • operations_on_datastructures/circular_linked_list.cpp
  • operations_on_datastructures/reverse_a_linked_list_using_recusion.cpp
  • operations_on_datastructures/selectionsortlinkedlist.cpp
  • diff --git a/d5/dab/structdata__structures_1_1list__array_1_1list_a39a712c8413b0d7861695ec019474469_cgraph.svg b/d5/dab/structdata__structures_1_1list__array_1_1list_a39a712c8413b0d7861695ec019474469_cgraph.svg index 497be0e9a..b70b0f3d0 100644 --- a/d5/dab/structdata__structures_1_1list__array_1_1list_a39a712c8413b0d7861695ec019474469_cgraph.svg +++ b/d5/dab/structdata__structures_1_1list__array_1_1list_a39a712c8413b0d7861695ec019474469_cgraph.svg @@ -1,7 +1,7 @@ - - - - diff --git a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg index 3e97b3d90..1ab1a2332 100644 --- a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg +++ b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg index 6b9eee219..449da1495 100644 --- a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg +++ b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg index 9ff1920a9..8e1ef8ef2 100644 --- a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg +++ b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg index 98a36fb32..c88f66236 100644 --- a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg +++ b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - diff --git a/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg b/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg index 8c3edfe2c..e8cfe5e23 100644 --- a/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg +++ b/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - diff --git a/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index c3d3856c3..9d7bc9327 100644 --- a/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg index 540ab563b..5bdfb3b6e 100644 --- a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg +++ b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph_org.svg b/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph_org.svg index 7f48cab62..3b658337f 100644 --- a/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph_org.svg +++ b/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - diff --git a/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg b/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg index 9d2f2b327..2076b72ca 100644 --- a/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg +++ b/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph_org.svg b/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph_org.svg index d49a8123e..c5e3a7632 100644 --- a/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph_org.svg +++ b/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph_org.svg @@ -1,7 +1,7 @@ - - - diff --git a/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 6e923eb61..b3bdd6cb2 100644 --- a/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - diff --git a/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index f8be2f4b5..253349150 100644 --- a/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_a6b95277f5f527beacc8d0f3bc91fcd08_cgraph_org.svg b/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_a6b95277f5f527beacc8d0f3bc91fcd08_cgraph_org.svg index 81c52cc71..9ca5b8e98 100644 --- a/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_a6b95277f5f527beacc8d0f3bc91fcd08_cgraph_org.svg +++ b/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_a6b95277f5f527beacc8d0f3bc91fcd08_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - + + + diff --git a/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.md5 b/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.md5 new file mode 100644 index 000000000..73c2c444a --- /dev/null +++ b/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.md5 @@ -0,0 +1 @@ +2f996be444fbc8dcfbcfce36e34c778b \ No newline at end of file diff --git a/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.svg b/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.svg new file mode 100644 index 000000000..05d12b35d --- /dev/null +++ b/d6/dfa/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list__coll__graph.svg @@ -0,0 +1,49 @@ + + + + + + +operations_on_datastructures::circular_linked_list::CircularLinkedList + + + +Node1 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList + + + + + +Node2 + + +operations_on_datastructures +::circular_linked_list::Node + + + + + +Node2->Node1 + + + end +root + + + +Node2->Node2 + + + next + + + diff --git a/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 69f807e92..fce56ef29 100644 --- a/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d7/da7/adaline__learning_8cpp__incl_org.svg b/d7/da7/adaline__learning_8cpp__incl_org.svg index ffa0fa0d2..3a74efbbd 100644 --- a/d7/da7/adaline__learning_8cpp__incl_org.svg +++ b/d7/da7/adaline__learning_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - diff --git a/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph_org.svg b/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph_org.svg index da951f739..e8e780046 100644 --- a/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph_org.svg +++ b/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph_org.svg b/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph_org.svg index 3ef7d2a94..167ef0b93 100644 --- a/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph_org.svg +++ b/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph_org.svg @@ -1,7 +1,7 @@ - - - diff --git a/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 0af09cacb..c091882bd 100644 --- a/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph_org.svg b/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph_org.svg index fb2f4e135..cc71b8b22 100644 --- a/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph_org.svg +++ b/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph_org.svg @@ -1,7 +1,7 @@ - - - diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph_org.svg b/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph_org.svg index 2a55abfe1..d4bd81ae4 100644 --- a/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph_org.svg +++ b/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - diff --git a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph_org.svg b/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph_org.svg index 735998ab0..8aa870d0d 100644 --- a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph_org.svg +++ b/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - diff --git a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph_org.svg b/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph_org.svg index 56145d2e7..5ba1eef5d 100644 --- a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph_org.svg +++ b/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - + + + + + + +Algorithms_in_C++: operations_on_datastructures::circular_linked_list::CircularLinkedList Class Reference + + + + + + + + + + + + + + + +
    +
    + + + + + + +
    +
    Algorithms_in_C++ 1.0.0 +
    +
    Set of algorithms implemented in C++.
    +
    +
    + + + + + + + +
    +
    + +
    +
    +
    + +
    + +
    +
    + + +
    + +
    + +
    + +
    operations_on_datastructures::circular_linked_list::CircularLinkedList Class Reference
    +
    +
    + +

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

    +
    +Collaboration diagram for operations_on_datastructures::circular_linked_list::CircularLinkedList:
    +
    +
    +
    +
    [legend]
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Public Member Functions

     CircularLinkedList ()
     Creates an empty CircularLinkedList. More...
     
     CircularLinkedList (const CircularLinkedList &copy)
     Copy constructor for CircularLinkedList. More...
     
     CircularLinkedList (CircularLinkedList &&source) noexcept
     Move constructor for CircularLinkedList. More...
     
    CircularLinkedListoperator= (const CircularLinkedList &other)
     Copy assignment operator. More...
     
    CircularLinkedListoperator= (CircularLinkedList &&other) noexcept
     Move assignment operator. More...
     
     ~CircularLinkedList ()
     Cleans up memory when destroyed. More...
     
    void erase ()
     
    void insert (const std::vector< int64_t > &values)
     Inserts all the values from a vector into the Circular Linked List. More...
     
    void insert (int64_t data)
     Inserts a single value into the Circular Linked List. More...
     
    void insert (Node *node)
     Inserts a given Node into the Circular Linked List. More...
     
    void print ()
     Prints the values of the Circular Linked List, beginning from the root Node. More...
     
    void print (Node *root)
     Prints the values of the Circular Linked List, beginning from a given Node to be used as the root. More...
     
    std::vector< int64_t > values ()
     Returns a std::vector of the values of the Circular Linked List. More...
     
    std::vector< int64_t > values (Node *root)
     Returns a std::vector of the values of the Circular Linked List, beginning from a given Node. More...
     
    + + + + + + + +

    +Private Attributes

    +Noderoot
     Pointer to the root Node.
     
    +Nodeend {}
     Pointer to the last Node.
     
    +

    Detailed Description

    +

    A class that implements a Circular Linked List.

    +

    Constructor & Destructor Documentation

    + +

    ◆ CircularLinkedList() [1/3]

    + +
    +
    + + + + + +
    + + + + + + + +
    operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList ()
    +
    +inline
    +
    + +

    Creates an empty CircularLinkedList.

    +
    66 {
    +
    67 root = nullptr;
    +
    68 end = nullptr;
    +
    69 }
    +
    Node * root
    Pointer to the root Node.
    Definition: circular_linked_list.cpp:59
    +
    Node * end
    Pointer to the last Node.
    Definition: circular_linked_list.cpp:60
    +
    +
    +
    + +

    ◆ CircularLinkedList() [2/3]

    + +
    +
    + + + + + +
    + + + + + + + + +
    operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList (const CircularLinkedListcopy)
    +
    +inline
    +
    + +

    Copy constructor for CircularLinkedList.

    +
    73 {
    +
    74 erase();
    +
    75 root = nullptr;
    +
    76 Node* node = copy.root;
    +
    77 while (node != nullptr) {
    +
    78 insert(node->data);
    +
    79 node = node->next;
    +
    80 }
    +
    81 }
    +
    void erase()
    Definition: circular_linked_list.cpp:126
    +
    void insert(const std::vector< int64_t > &values)
    Inserts all the values from a vector into the Circular Linked List.
    Definition: circular_linked_list.cpp:146
    +
    T copy(T... args)
    +
    Definition: linkedlist_implentation_usingarray.cpp:14
    +
    Definition: avltree.cpp:13
    +
    +Here is the call graph for this function:
    +
    +
    +
    +
    + +
    +
    + +

    ◆ CircularLinkedList() [3/3]

    + +
    +
    + + + + + +
    + + + + + + + + +
    operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList (CircularLinkedList && source)
    +
    +inlinenoexcept
    +
    + +

    Move constructor for CircularLinkedList.

    +
    Parameters
    + + +
    sourcervalue reference to a Circular Linked List
    +
    +
    +
    86 {
    +
    87 root = source.root;
    +
    88 end = source.end;
    +
    89 source.root = nullptr;
    +
    90 source.end = nullptr;
    +
    91 }
    +
    +
    +
    + +

    ◆ ~CircularLinkedList()

    + +
    +
    + + + + + +
    + + + + + + + +
    operations_on_datastructures::circular_linked_list::CircularLinkedList::~CircularLinkedList ()
    +
    +inline
    +
    + +

    Cleans up memory when destroyed.

    +
    122{ erase(); }
    +
    +Here is the call graph for this function:
    +
    +
    +
    +
    + +
    +
    +

    Member Function Documentation

    + +

    ◆ erase()

    + +
    +
    + + + + + +
    + + + + + + + +
    void operations_on_datastructures::circular_linked_list::CircularLinkedList::erase ()
    +
    +inline
    +
    +

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

    +
    126 {
    +
    127 if (root == nullptr) {
    +
    128 return;
    +
    129 }
    +
    130 Node* node = root;
    +
    131 do {
    +
    132 Node* temp = node;
    +
    133 node = node->next;
    +
    134 delete (temp);
    +
    135 } while (node != root);
    +
    136 root = nullptr;
    +
    137 end = nullptr;
    +
    138 }
    +
    struct list node
    +
    +
    +
    + +

    ◆ insert() [1/3]

    + +
    +
    + + + + + +
    + + + + + + + + +
    void operations_on_datastructures::circular_linked_list::CircularLinkedList::insert (const std::vector< int64_t > & values)
    +
    +inline
    +
    + +

    Inserts all the values from a vector into the Circular Linked List.

    +

    Goes through each element in the vector sequentially, inserting it into the list

    Parameters
    + + +
    valuesThe vector of integer values that is to be inserted
    +
    +
    +
    Returns
    void
    +
    146 {
    +
    147 for (int64_t value : values) {
    +
    148 insert(value);
    +
    149 }
    +
    150 }
    +
    std::vector< int64_t > values()
    Returns a std::vector of the values of the Circular Linked List.
    Definition: circular_linked_list.cpp:214
    +
    +Here is the call graph for this function:
    +
    +
    +
    +
    + +
    +
    + +

    ◆ insert() [2/3]

    + +
    +
    + + + + + +
    + + + + + + + + +
    void operations_on_datastructures::circular_linked_list::CircularLinkedList::insert (int64_t data)
    +
    +inline
    +
    + +

    Inserts a single value into the Circular Linked List.

    +

    Creates a Node with the given value, pointing to the root Node and inserts it into the list

    Parameters
    + + +
    dataThe integer valus to be inserted
    +
    +
    +
    Returns
    void
    +
    158 {
    +
    159 Node* node = new Node(data, root);
    +
    160 insert(node);
    +
    161 }
    +
    int data[MAX]
    test data
    Definition: hash_search.cpp:24
    +
    +Here is the call graph for this function:
    +
    +
    +
    +
    + +
    +
    + +

    ◆ insert() [3/3]

    + +
    +
    + + + + + +
    + + + + + + + + +
    void operations_on_datastructures::circular_linked_list::CircularLinkedList::insert (Nodenode)
    +
    +inline
    +
    + +

    Inserts a given Node into the Circular Linked List.

    +

    Checks wheter the list is empty, and inserts the Node, modifying the end pointer

    Parameters
    + + +
    nodeThe Node that is to be inserted
    +
    +
    +
    Returns
    void
    +

    < Set node as the root

    +

    < Point node to itself

    +

    < Set the end to the root

    +

    < Append node to the end

    +

    < Set the next value to the root

    +

    < Make end point to node

    +
    169 {
    +
    170 if (root == nullptr) {
    +
    171 root = node; ///< Set node as the root
    +
    172 node->next = root; ///< Point node to itself
    +
    173 end = root; ///< Set the end to the root
    +
    174 } else {
    +
    175 end->next = node; ///< Append node to the end
    +
    176 node->next = root; ///< Set the next value to the root
    +
    177 end = node; ///< Make end point to node
    +
    178 }
    +
    179 }
    +
    Node * next
    The Node's successor.
    Definition: circular_linked_list.cpp:34
    +
    +
    +
    + +

    ◆ operator=() [1/2]

    + +
    +
    + + + + + +
    + + + + + + + + +
    CircularLinkedList & operations_on_datastructures::circular_linked_list::CircularLinkedList::operator= (CircularLinkedList && other)
    +
    +inlinenoexcept
    +
    + +

    Move assignment operator.

    +
    Parameters
    + + +
    otherrvalue reference to a Circular Linked List
    +
    +
    +
    Returns
    Reference to CircularLinkedList
    +
    112 {
    +
    113 root = other.root;
    +
    114 end = other.end;
    +
    115 other.root = nullptr;
    +
    116 other.end = nullptr;
    +
    117 return *this;
    +
    118 }
    +
    +
    +
    + +

    ◆ operator=() [2/2]

    + +
    +
    + + + + + +
    + + + + + + + + +
    CircularLinkedList & operations_on_datastructures::circular_linked_list::CircularLinkedList::operator= (const CircularLinkedListother)
    +
    +inline
    +
    + +

    Copy assignment operator.

    +
    Parameters
    + + +
    otherReference to a Circular Linked List
    +
    +
    +
    Returns
    Reference to CircularLinkedList
    +
    97 {
    +
    98 erase();
    +
    99 root = nullptr;
    +
    100 Node* node = other.root;
    +
    101 while (node != nullptr) {
    +
    102 insert(node->data);
    +
    103 node = node->next;
    +
    104 }
    +
    105 return *this;
    +
    106 }
    +
    +Here is the call graph for this function:
    +
    +
    +
    +
    + +
    +
    + +

    ◆ print() [1/2]

    + +
    +
    + + + + + +
    + + + + + + + +
    void operations_on_datastructures::circular_linked_list::CircularLinkedList::print ()
    +
    +inline
    +
    + +

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

    +

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

    Returns
    void
    +
    187{ print(root); }
    +
    void print()
    Prints the values of the Circular Linked List, beginning from the root Node.
    Definition: circular_linked_list.cpp:187
    +
    +Here is the call graph for this function:
    +
    +
    +
    +
    + +
    +
    + +

    ◆ print() [2/2]

    + +
    +
    + + + + + +
    + + + + + + + + +
    void operations_on_datastructures::circular_linked_list::CircularLinkedList::print (Noderoot)
    +
    +inline
    +
    + +

    Prints the values of the Circular Linked List, beginning from a given Node to be used as the root.

    +

    Goes through each Node from the given Node and prints them out in order. If the list is empty, it prints the message 'Empty List!'

    Parameters
    + + +
    rootThe Node to start at
    +
    +
    +
    Returns
    void
    +
    196 {
    +
    197 Node* temp = root;
    +
    198 if (root == nullptr) {
    +
    199 std::cout << "Empty List!\n";
    +
    200 return;
    +
    201 }
    +
    202 do {
    +
    203 std::cout << temp->data << " ";
    +
    204 temp = temp->next;
    +
    205 } while (temp != root);
    +
    206 std::cout << "\n";
    +
    207 }
    + +
    +
    +
    + +

    ◆ values() [1/2]

    + +
    +
    + + + + + +
    + + + + + + + +
    std::vector< int64_t > operations_on_datastructures::circular_linked_list::CircularLinkedList::values ()
    +
    +inline
    +
    + +

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

    +

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

    Returns
    A std::vector of the list's values
    +
    214{ return values(root); }
    +
    +Here is the call graph for this function:
    +
    +
    +
    +
    + +
    +
    + +

    ◆ values() [2/2]

    + +
    +
    + + + + + +
    + + + + + + + + +
    std::vector< int64_t > operations_on_datastructures::circular_linked_list::CircularLinkedList::values (Noderoot)
    +
    +inline
    +
    + +

    Returns a std::vector of the values of the Circular Linked List, beginning from a given Node.

    +

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

    Parameters
    + + +
    rootThe Node to start at
    +
    +
    +
    Returns
    A std::vector of the list's values
    +

    < Return empty vector

    +
    223 {
    + +
    225 if (root == nullptr) {
    +
    226 return res; ///< Return empty vector
    +
    227 }
    +
    228 Node* temp = root;
    +
    229 do {
    +
    230 res.push_back(temp->data);
    +
    231 temp = temp->next;
    +
    232 } while (temp != root);
    +
    233 return res;
    +
    234 }
    +
    T push_back(T... args)
    + +
    +Here is the call graph for this function:
    +
    +
    +
    +
    + +
    +
    +
    The documentation for this class was generated from the following file: +
    +
    + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.js b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.js new file mode 100644 index 000000000..a9d69d536 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.js @@ -0,0 +1,19 @@ +var classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list = +[ + [ "CircularLinkedList", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888", null ], + [ "CircularLinkedList", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1", null ], + [ "CircularLinkedList", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2", null ], + [ "~CircularLinkedList", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a46195fcf11b636064c7172cb74b55dd0", null ], + [ "erase", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986", null ], + [ "insert", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d", null ], + [ "insert", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4", null ], + [ "insert", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae", null ], + [ "operator=", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5", null ], + [ "operator=", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9", null ], + [ "print", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592", null ], + [ "print", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21", null ], + [ "values", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de", null ], + [ "values", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42", null ], + [ "end", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208", null ], + [ "root", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13", null ] +]; \ No newline at end of file diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.map new file mode 100644 index 000000000..e62d2aa57 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.md5 new file mode 100644 index 000000000..cbc604276 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.md5 @@ -0,0 +1 @@ +4dfffdb2af44418e510ef47964fac080 \ No newline at end of file diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.svg new file mode 100644 index 000000000..06197f0b2 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.svg @@ -0,0 +1,39 @@ + + + + + + +operations_on_datastructures::circular_linked_list::CircularLinkedList::values + + + +Node1 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::values + + + + + +Node2 + + +std::vector::push_back + + + + + +Node1->Node2 + + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.map new file mode 100644 index 000000000..b8cbac3c0 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.md5 new file mode 100644 index 000000000..bebf08e7f --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.md5 @@ -0,0 +1 @@ +1d848dd7a723e96ff50a16dc313ba734 \ No newline at end of file diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.svg new file mode 100644 index 000000000..549bfe7ba --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.svg @@ -0,0 +1,175 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList + + + +Node1 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::CircularLinkedList + + + + + +Node2 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::erase + + + + + +Node1->Node2 + + + + + +Node3 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::insert + + + + + +Node1->Node3 + + + + + +Node3->Node3 + + + + + +Node4 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::values + + + + + +Node3->Node4 + + + + + +Node4->Node4 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph_org.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph_org.svg new file mode 100644 index 000000000..0b439b3fd --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph_org.svg @@ -0,0 +1,87 @@ + + + + + + +operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList + + + +Node1 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::CircularLinkedList + + + + + +Node2 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::erase + + + + + +Node1->Node2 + + + + + +Node3 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::insert + + + + + +Node1->Node3 + + + + + +Node3->Node3 + + + + + +Node4 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::values + + + + + +Node3->Node4 + + + + + +Node4->Node4 + + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.map new file mode 100644 index 000000000..402a03c63 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.md5 new file mode 100644 index 000000000..1a9c80881 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.md5 @@ -0,0 +1 @@ +e7af5a49c8cbb584eb97acaa011e9e57 \ No newline at end of file diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.svg new file mode 100644 index 000000000..a08297626 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.svg @@ -0,0 +1,158 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +operations_on_datastructures::circular_linked_list::CircularLinkedList::insert + + + +Node1 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::insert + + + + + +Node2 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::insert + + + + + +Node1->Node2 + + + + + +Node2->Node2 + + + + + +Node3 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::values + + + + + +Node2->Node3 + + + + + +Node3->Node3 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph_org.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph_org.svg new file mode 100644 index 000000000..4ab37a231 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph_org.svg @@ -0,0 +1,70 @@ + + + + + + +operations_on_datastructures::circular_linked_list::CircularLinkedList::insert + + + +Node1 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::insert + + + + + +Node2 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::insert + + + + + +Node1->Node2 + + + + + +Node2->Node2 + + + + + +Node3 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::values + + + + + +Node2->Node3 + + + + + +Node3->Node3 + + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.map new file mode 100644 index 000000000..5d4d1cca9 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.md5 new file mode 100644 index 000000000..6aba06f91 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.md5 @@ -0,0 +1 @@ +e2b10b943bdada30358b956c6db6f4de \ No newline at end of file diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.svg new file mode 100644 index 000000000..738ab3801 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.svg @@ -0,0 +1,41 @@ + + + + + + +operations_on_datastructures::circular_linked_list::CircularLinkedList::~CircularLinkedList + + + +Node1 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::~CircularLinkedList + + + + + +Node2 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::erase + + + + + +Node1->Node2 + + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.map new file mode 100644 index 000000000..e4ae2c5c5 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.map @@ -0,0 +1,3 @@ + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.md5 new file mode 100644 index 000000000..45fa95e09 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.md5 @@ -0,0 +1 @@ +9a3a1db13fc0f9a0e14d43a480d9cb21 \ No newline at end of file diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.svg new file mode 100644 index 000000000..f184d1cba --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.svg @@ -0,0 +1,30 @@ + + + + + + +operations_on_datastructures::circular_linked_list::CircularLinkedList::values + + + +Node1 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::values + + + + + +Node1->Node1 + + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.map new file mode 100644 index 000000000..7e7971a52 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.md5 new file mode 100644 index 000000000..901ab8919 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.md5 @@ -0,0 +1 @@ +418ee61cf02613f744ef1b83d568ac36 \ No newline at end of file diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.svg new file mode 100644 index 000000000..c5a9a674e --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.svg @@ -0,0 +1,175 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +operations_on_datastructures::circular_linked_list::CircularLinkedList::operator= + + + +Node1 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::operator= + + + + + +Node2 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::erase + + + + + +Node1->Node2 + + + + + +Node3 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::insert + + + + + +Node1->Node3 + + + + + +Node3->Node3 + + + + + +Node4 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::values + + + + + +Node3->Node4 + + + + + +Node4->Node4 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph_org.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph_org.svg new file mode 100644 index 000000000..798a95d3f --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph_org.svg @@ -0,0 +1,87 @@ + + + + + + +operations_on_datastructures::circular_linked_list::CircularLinkedList::operator= + + + +Node1 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::operator= + + + + + +Node2 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::erase + + + + + +Node1->Node2 + + + + + +Node3 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::insert + + + + + +Node1->Node3 + + + + + +Node3->Node3 + + + + + +Node4 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::values + + + + + +Node3->Node4 + + + + + +Node4->Node4 + + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.map new file mode 100644 index 000000000..d511d047b --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.map @@ -0,0 +1,3 @@ + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.md5 new file mode 100644 index 000000000..f13d66741 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.md5 @@ -0,0 +1 @@ +f12f56b5f224b27f9810ce37e2993f5a \ No newline at end of file diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.svg new file mode 100644 index 000000000..27b3963ca --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.svg @@ -0,0 +1,30 @@ + + + + + + +operations_on_datastructures::circular_linked_list::CircularLinkedList::print + + + +Node1 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::print + + + + + +Node1->Node1 + + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.map new file mode 100644 index 000000000..210a0d3b4 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.md5 new file mode 100644 index 000000000..ab7484858 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.md5 @@ -0,0 +1 @@ +f430ae35458622ea353e79192d3c846f \ No newline at end of file diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.svg new file mode 100644 index 000000000..7dd3068a1 --- /dev/null +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.svg @@ -0,0 +1,53 @@ + + + + + + +operations_on_datastructures::circular_linked_list::CircularLinkedList::insert + + + +Node1 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::insert + + + + + +Node1->Node1 + + + + + +Node2 + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList::values + + + + + +Node1->Node2 + + + + + +Node2->Node2 + + + + + diff --git a/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.svg b/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.svg index a75dd266a..eefd657c8 100644 --- a/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.svg +++ b/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.svg @@ -1,7 +1,7 @@ - diff --git a/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph_org.svg b/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph_org.svg index b014b717c..52d4836df 100644 --- a/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph_org.svg +++ b/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - diff --git a/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph_org.svg b/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph_org.svg index ca8ee6b89..a16572419 100644 --- a/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph_org.svg +++ b/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph_org.svg b/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph_org.svg index cd551b0dc..67e199dbb 100644 --- a/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph_org.svg +++ b/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - diff --git a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index ed5981b8b..6e3140af8 100644 --- a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - diff --git a/d8/dc0/heavy__light__decomposition_8cpp__incl_org.svg b/d8/dc0/heavy__light__decomposition_8cpp__incl_org.svg index 0fa33f0cf..8752a8c84 100644 --- a/d8/dc0/heavy__light__decomposition_8cpp__incl_org.svg +++ b/d8/dc0/heavy__light__decomposition_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - diff --git a/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 3b6c317e7..4ac00b234 100644 --- a/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph_org.svg b/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph_org.svg index 0950dcce6..e8d8f3a71 100644 --- a/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph_org.svg +++ b/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - diff --git a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg index d5ed1337a..da03ff49a 100644 --- a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg +++ b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg index d085e7657..6b8e278d6 100644 --- a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg +++ b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg index e31566d73..2bfe7681e 100644 --- a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg +++ b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -1,7 +1,7 @@ - - - diff --git a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg index 02a5cb3b8..e3e1f79bd 100644 --- a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg +++ b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

    Detailed Description

    Testcases to check Union of Two Arrays.

    Testcases to check Reversal of Binary Tree.

    -

    Testcases to check intersection of Two Arrays.

    +

    Testcases to check intersection of Two Arrays.

    +

    Testcases to check Circular Linked List.

    Function Documentation

    ◆ test1()

    @@ -143,6 +144,7 @@ Functions

    A Test to check an simple case.

    < Use the BinaryTree

    A Test to check an edge case (two empty arrays)

    +

    A Test to check a single value.

    Returns
    void

    A Test to check an edge case (single element reversal)

    < Should print 3 4 5 1 2

    @@ -204,6 +206,7 @@ Here is the call graph for this function:

    A Test to check an empty vector.

    A Test to check an edge case (NULL root element)

    A Test to check an edge case (one empty array)

    +

    A Test to check a few values.

    Returns
    void

    < Should print empty newline

    < Should print empty newline

    @@ -258,6 +261,7 @@ Here is the call graph for this function:

    A Test to check an invalid shift value.

    A Test to check correct reversal of a Binary Tree.

    A Test to check correct functionality with a simple test case.

    +

    A Test to check an input array.

    Returns
    void

    < 7 > 5

    < Should print empty newline

    @@ -314,14 +318,17 @@ Here is the call graph for this function:

    A Test to check a very large input.

    A Test to check correct functionality with duplicate values.

    +

    A Test to check using a specific Node as the starting point.

    Returns
    void

    < Should print {4, 6, ..., 420, 2}

    < Should print {420, 2, 4, ..., 418}

    +

    < Node we will start printing from

    < Check if result is correct

    < Should print 4 6

    < Check if result is correct

    < Should print 2 3 4 6 7

    < Should print {420, 2, 4, ..., 418}

    +

    < Node we will start printing from

    < Check if result is correct

    < Should print 4 6

    < Check if result is correct

    @@ -372,6 +379,7 @@ Here is the call graph for this function:

    A Test to check a shift of zero.

    A Test to check correct functionality with a harder test case.

    +

    A Test to check an empty list.

    Returns
    void

    < Should print 1 2 3 4 5

    < Should print 1 2 3 4 5

    diff --git a/d9/df4/namespacetests_a167c24bd817469ae47358d12e034f2d5_cgraph.svg b/d9/df4/namespacetests_a167c24bd817469ae47358d12e034f2d5_cgraph.svg index 99c062e36..a016777d5 100644 --- a/d9/df4/namespacetests_a167c24bd817469ae47358d12e034f2d5_cgraph.svg +++ b/d9/df4/namespacetests_a167c24bd817469ae47358d12e034f2d5_cgraph.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - + + + + + + +Algorithms_in_C++: operations_on_datastructures::circular_linked_list::Node Struct Reference + + + + + + + + + + + + + + + +
    +
    + + + + + + +
    +
    Algorithms_in_C++ 1.0.0 +
    +
    Set of algorithms implemented in C++.
    +
    +
    + + + + + + + +
    +
    + +
    +
    +
    + +
    + +
    +
    + + +
    + +
    + +
    + +
    operations_on_datastructures::circular_linked_list::Node Struct Reference
    +
    +
    + +

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

    +
    +Collaboration diagram for operations_on_datastructures::circular_linked_list::Node:
    +
    +
    +
    +
    [legend]
    + + + + + + + + +

    +Public Member Functions

     Node (int64_t _data)
     Creates a new Node with some initial data. More...
     
     Node (int64_t _data, Node *_next)
     Creates a new Node with initial data and a successor. More...
     
    + + + + + + + +

    +Public Attributes

    +int64_t data
     The value of the Node.
     
    +Nodenext
     The Node's successor.
     
    +

    Detailed Description

    +

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

    +

    Constructor & Destructor Documentation

    + +

    ◆ Node() [1/2]

    + +
    +
    + + + + + +
    + + + + + + + + +
    operations_on_datastructures::circular_linked_list::Node::Node (int64_t _data)
    +
    +inlineexplicit
    +
    + +

    Creates a new Node with some initial data.

    +
    Parameters
    + + +
    _dataValue of Node
    +
    +
    +

    < Set value of Node data

    +

    < Initialize successor

    +
    39 {
    +
    40 data = _data; ///< Set value of Node data
    +
    41 next = nullptr; ///< Initialize successor
    +
    42 }
    +
    int64_t data
    The value of the Node.
    Definition: circular_linked_list.cpp:33
    +
    Node * next
    The Node's successor.
    Definition: circular_linked_list.cpp:34
    +
    +
    +
    + +

    ◆ Node() [2/2]

    + +
    +
    + + + + + +
    + + + + + + + + + + + + + + + + + + +
    operations_on_datastructures::circular_linked_list::Node::Node (int64_t _data,
    Node_next 
    )
    +
    +inlineexplicit
    +
    + +

    Creates a new Node with initial data and a successor.

    +
    Parameters
    + + + +
    _dataValue of Node
    _nextPointer to the next Node
    +
    +
    +

    < Set value of Node data

    +

    < Initialize successor

    +
    48 {
    +
    49 data = _data; ///< Set value of Node data
    +
    50 next = _next; ///< Initialize successor
    +
    51 }
    +
    +
    +
    +
    The documentation for this struct was generated from the following file: +
    +
    + + + + diff --git a/da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.js b/da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.js new file mode 100644 index 000000000..cd5731d7b --- /dev/null +++ b/da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.js @@ -0,0 +1,7 @@ +var structoperations__on__datastructures_1_1circular__linked__list_1_1_node = +[ + [ "Node", "da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5", null ], + [ "Node", "da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95", null ], + [ "data", "da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1", null ], + [ "next", "da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77", null ] +]; \ No newline at end of file diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.svg b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.svg index 166f32ca3..baadc2278 100644 --- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.svg +++ b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg index e67debeb3..504fa69b0 100644 --- a/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg +++ b/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
    +
    + + + + + + +
    +
    Algorithms_in_C++ 1.0.0 +
    +
    Set of algorithms implemented in C++.
    +
    +
    + + + + + + + +
    +
    + +
    +
    +
    + +
    + +
    +
    + + +
    + +
    + +
    +
    operations_on_datastructures::circular_linked_list::Node Member List
    +
    +
    + +

    This is the complete list of members for operations_on_datastructures::circular_linked_list::Node, including all inherited members.

    + + + + + +
    dataoperations_on_datastructures::circular_linked_list::Node
    nextoperations_on_datastructures::circular_linked_list::Node
    Node(int64_t _data)operations_on_datastructures::circular_linked_list::Nodeinlineexplicit
    Node(int64_t _data, Node *_next)operations_on_datastructures::circular_linked_list::Nodeinlineexplicit
    +
    + + + + diff --git a/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.svg b/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.svg index b46e20ed1..9f0741044 100644 --- a/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.svg +++ b/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg index 9042e6492..b6de0466c 100644 --- a/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg +++ b/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg b/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg index 22efd292b..c24230f85 100644 --- a/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg +++ b/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - + + diff --git a/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.md5 b/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.md5 new file mode 100644 index 000000000..095a51882 --- /dev/null +++ b/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.md5 @@ -0,0 +1 @@ +47097aa513efd0ccae17d8a3e9ab216e \ No newline at end of file diff --git a/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.svg b/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.svg new file mode 100644 index 000000000..a879fb40d --- /dev/null +++ b/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.svg @@ -0,0 +1,30 @@ + + + + + + +operations_on_datastructures::circular_linked_list::Node + + + +Node1 + + +operations_on_datastructures +::circular_linked_list::Node + + + + + +Node1->Node1 + + + next + + + diff --git a/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 06ebc0659..419e5302b 100644 --- a/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - 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 491856050..f6284d9c9 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 @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
    +
    + + + + + + +
    +
    Algorithms_in_C++ 1.0.0 +
    +
    Set of algorithms implemented in C++.
    +
    +
    + + + + + + + +
    +
    + +
    +
    +
    + +
    + +
    +
    + + +
    + +
    + +
    +
    operations_on_datastructures::circular_linked_list::CircularLinkedList Member List
    +
    +
    + +

    This is the complete list of members for operations_on_datastructures::circular_linked_list::CircularLinkedList, including all inherited members.

    + + + + + + + + + + + + + + + + + +
    CircularLinkedList()operations_on_datastructures::circular_linked_list::CircularLinkedListinline
    CircularLinkedList(const CircularLinkedList &copy)operations_on_datastructures::circular_linked_list::CircularLinkedListinline
    CircularLinkedList(CircularLinkedList &&source) noexceptoperations_on_datastructures::circular_linked_list::CircularLinkedListinline
    endoperations_on_datastructures::circular_linked_list::CircularLinkedListprivate
    erase()operations_on_datastructures::circular_linked_list::CircularLinkedListinline
    insert(const std::vector< int64_t > &values)operations_on_datastructures::circular_linked_list::CircularLinkedListinline
    insert(int64_t data)operations_on_datastructures::circular_linked_list::CircularLinkedListinline
    insert(Node *node)operations_on_datastructures::circular_linked_list::CircularLinkedListinline
    operator=(const CircularLinkedList &other)operations_on_datastructures::circular_linked_list::CircularLinkedListinline
    operator=(CircularLinkedList &&other) noexceptoperations_on_datastructures::circular_linked_list::CircularLinkedListinline
    print()operations_on_datastructures::circular_linked_list::CircularLinkedListinline
    print(Node *root)operations_on_datastructures::circular_linked_list::CircularLinkedListinline
    rootoperations_on_datastructures::circular_linked_list::CircularLinkedListprivate
    values()operations_on_datastructures::circular_linked_list::CircularLinkedListinline
    values(Node *root)operations_on_datastructures::circular_linked_list::CircularLinkedListinline
    ~CircularLinkedList()operations_on_datastructures::circular_linked_list::CircularLinkedListinline
    +
    + + + + diff --git a/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.svg b/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.svg index 42381c2d6..7c9377348 100644 --- a/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.svg +++ b/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg index 068e59169..3245bb107 100644 --- a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg +++ b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + +Algorithms_in_C++: operations_on_datastructures/circular_linked_list.cpp File Reference + + + + + + + + + + + + + + + +
    +
    + + + + + + +
    +
    Algorithms_in_C++ 1.0.0 +
    +
    Set of algorithms implemented in C++.
    +
    +
    + + + + + + + +
    +
    + +
    +
    +
    + +
    + +
    +
    + + +
    + +
    + +
    + +
    circular_linked_list.cpp File Reference
    +
    +
    + +

    Implementation for a Circular Linked List. +More...

    +
    #include <cassert>
    +#include <iostream>
    +#include <vector>
    +
    +Include dependency graph for circular_linked_list.cpp:
    +
    +
    +
    +
    +
    + + + + + + + +

    +Classes

    struct  operations_on_datastructures::circular_linked_list::Node
     A Node struct that represents a single Node in a Binary Tree. More...
     
    class  operations_on_datastructures::circular_linked_list::CircularLinkedList
     A class that implements a Circular Linked List. More...
     
    + + + + + + + + + + +

    +Namespaces

    namespace  operations_on_datastructures
     for std::vector
     
    namespace  circular_linked_list
     Functions for the Circular Linked List implementation.
     
    namespace  tests
     Testcases to check Union of Two Arrays.
     
    + + + + + + + + + + + + + + + + + + + + + + +

    +Functions

    void tests::test1 ()
     A Test to check an simple case. More...
     
    void tests::test2 ()
     A Test to check an empty vector. More...
     
    void tests::test3 ()
     A Test to check an invalid shift value. More...
     
    void tests::test4 ()
     A Test to check a very large input. More...
     
    void tests::test5 ()
     A Test to check a shift of zero. More...
     
    static void test ()
     Function to test the correctness of the Circular Linked List. More...
     
    int main ()
     main function More...
     
    +

    Detailed Description

    +

    Implementation for a Circular Linked List.

    +

    A Circular Linked List is a variation on the regular linked list, in which the last node has a pointer to the first node, which creates a full circle. Consequently, this allows any node to be used as the starting point for the list.

    Author
    Alvin
    +

    Function Documentation

    + +

    ◆ main()

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

    main function

    +
    Returns
    0 on exit
    +
    345 {
    +
    346 test(); // run self-test implementations
    +
    347 return 0;
    +
    348}
    +
    static void test()
    Function to test the correctness of the Circular Linked List.
    Definition: circular_linked_list.cpp:333
    +
    +Here is the call graph for this function:
    +
    +
    +
    +
    + +
    +
    + +

    ◆ test()

    + +
    +
    + + + + + +
    + + + + + + + +
    static void test ()
    +
    +static
    +
    + +

    Function to test the correctness of the Circular Linked List.

    +
    Returns
    void
    +
    333 {
    +
    334 tests::test1();
    +
    335 tests::test2();
    +
    336 tests::test3();
    +
    337 tests::test4();
    +
    338 tests::test5();
    +
    339}
    +
    void test1()
    A Test to check an simple case.
    Definition: array_left_rotation.cpp:75
    +
    void test4()
    A Test to check a very large input.
    Definition: array_left_rotation.cpp:120
    +
    void test3()
    A Test to check an invalid shift value.
    Definition: array_left_rotation.cpp:105
    +
    void test2()
    A Test to check an empty vector.
    Definition: array_left_rotation.cpp:90
    +
    void test5()
    A Test to check a shift of zero.
    Definition: array_left_rotation.cpp:143
    +
    +Here is the call graph for this function:
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + + diff --git a/de/d33/circular__linked__list_8cpp.js b/de/d33/circular__linked__list_8cpp.js new file mode 100644 index 000000000..8de874947 --- /dev/null +++ b/de/d33/circular__linked__list_8cpp.js @@ -0,0 +1,12 @@ +var circular__linked__list_8cpp = +[ + [ "operations_on_datastructures::circular_linked_list::Node", "da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html", "da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node" ], + [ "operations_on_datastructures::circular_linked_list::CircularLinkedList", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list" ], + [ "main", "de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "test", "de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ], + [ "test1", "de/d33/circular__linked__list_8cpp.html#a167c24bd817469ae47358d12e034f2d5", null ], + [ "test2", "de/d33/circular__linked__list_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669", null ], + [ "test3", "de/d33/circular__linked__list_8cpp.html#aa515639572647508b94986489aab6d76", null ], + [ "test4", "de/d33/circular__linked__list_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d", null ], + [ "test5", "de/d33/circular__linked__list_8cpp.html#af7b81d7a1534216af6a36a80135beb86", null ] +]; \ No newline at end of file diff --git a/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map new file mode 100644 index 000000000..1f84b2a31 --- /dev/null +++ b/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -0,0 +1,14 @@ + + + + + + + + + + + + + + diff --git a/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 new file mode 100644 index 000000000..7c094a124 --- /dev/null +++ b/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -0,0 +1 @@ +ebcbcc6dcb35f22238db8a6048e6db60 \ No newline at end of file diff --git a/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg new file mode 100644 index 000000000..c0c1ad58a --- /dev/null +++ b/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -0,0 +1,236 @@ + + + + + + +test + + + +Node1 + + +test + + + + + +Node2 + + +tests::test1 + + + + + +Node1->Node2 + + + + + +Node8 + + +tests::test2 + + + + + +Node1->Node8 + + + + + +Node9 + + +tests::test3 + + + + + +Node1->Node9 + + + + + +Node10 + + +tests::test4 + + + + + +Node1->Node10 + + + + + +Node12 + + +tests::test5 + + + + + +Node1->Node12 + + + + + +Node3 + + +print + + + + + +Node2->Node3 + + + + + +Node6 + + +operations_on_datastructures +::shift_left + + + + + +Node2->Node6 + + + + + +Node4 + + +std::endl + + + + + +Node3->Node4 + + + + + +Node5 + + +is_prime + + + + + +Node3->Node5 + + + + + +Node7 + + +std::vector::size + + + + + +Node6->Node7 + + + + + +Node8->Node3 + + + + + +Node8->Node6 + + + + + +Node9->Node3 + + + + + +Node9->Node6 + + + + + +Node10->Node3 + + + + + +Node10->Node6 + + + + + +Node11 + + +std::vector::push_back + + + + + +Node10->Node11 + + + + + +Node12->Node3 + + + + + +Node12->Node6 + + + + + diff --git a/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..6812e1226 --- /dev/null +++ b/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + diff --git a/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..492cb2b32 --- /dev/null +++ b/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +b0da492e8619afccf643b3c111ac9498 \ No newline at end of file diff --git a/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..31d31ab47 --- /dev/null +++ b/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,339 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +test + + + + + +Node1->Node2 + + + + + +Node3 + + +tests::test1 + + + + + +Node2->Node3 + + + + + +Node9 + + +tests::test2 + + + + + +Node2->Node9 + + + + + +Node10 + + +tests::test3 + + + + + +Node2->Node10 + + + + + +Node11 + + +tests::test4 + + + + + +Node2->Node11 + + + + + +Node13 + + +tests::test5 + + + + + +Node2->Node13 + + + + + +Node4 + + +print + + + + + +Node3->Node4 + + + + + +Node7 + + +operations_on_datastructures +::shift_left + + + + + +Node3->Node7 + + + + + +Node5 + + +std::endl + + + + + +Node4->Node5 + + + + + +Node6 + + +is_prime + + + + + +Node4->Node6 + + + + + +Node8 + + +std::vector::size + + + + + +Node7->Node8 + + + + + +Node9->Node4 + + + + + +Node9->Node7 + + + + + +Node10->Node4 + + + + + +Node10->Node7 + + + + + +Node11->Node4 + + + + + +Node11->Node7 + + + + + +Node12 + + +std::vector::push_back + + + + + +Node11->Node12 + + + + + +Node13->Node4 + + + + + +Node13->Node7 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg new file mode 100644 index 000000000..a8eecaee5 --- /dev/null +++ b/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -0,0 +1,251 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +test + + + + + +Node1->Node2 + + + + + +Node3 + + +tests::test1 + + + + + +Node2->Node3 + + + + + +Node9 + + +tests::test2 + + + + + +Node2->Node9 + + + + + +Node10 + + +tests::test3 + + + + + +Node2->Node10 + + + + + +Node11 + + +tests::test4 + + + + + +Node2->Node11 + + + + + +Node13 + + +tests::test5 + + + + + +Node2->Node13 + + + + + +Node4 + + +print + + + + + +Node3->Node4 + + + + + +Node7 + + +operations_on_datastructures +::shift_left + + + + + +Node3->Node7 + + + + + +Node5 + + +std::endl + + + + + +Node4->Node5 + + + + + +Node6 + + +is_prime + + + + + +Node4->Node6 + + + + + +Node8 + + +std::vector::size + + + + + +Node7->Node8 + + + + + +Node9->Node4 + + + + + +Node9->Node7 + + + + + +Node10->Node4 + + + + + +Node10->Node7 + + + + + +Node11->Node4 + + + + + +Node11->Node7 + + + + + +Node12 + + +std::vector::push_back + + + + + +Node11->Node12 + + + + + +Node13->Node4 + + + + + +Node13->Node7 + + + + + diff --git a/de/d36/binary__exponent_8cpp__incl.svg b/de/d36/binary__exponent_8cpp__incl.svg index b45d5e691..f1b468c17 100644 --- a/de/d36/binary__exponent_8cpp__incl.svg +++ b/de/d36/binary__exponent_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - diff --git a/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph_org.svg b/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph_org.svg index 29026e4e8..309bac8af 100644 --- a/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph_org.svg +++ b/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph_org.svg @@ -1,7 +1,7 @@ - - - diff --git a/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index dc6f33d93..4d2d8f1e0 100644 --- a/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index c6e61f881..9e72e828e 100644 --- a/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - 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 e350b44f8..cd306ce16 100644 --- a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg +++ b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg @@ -1,7 +1,7 @@ - - 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 99251d390..74eea6c9a 100644 --- a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg +++ b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg @@ -1,7 +1,7 @@ - - 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 62c78a5dc..74a59a3fc 100644 --- a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg +++ b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - diff --git a/de/dab/ncr__modulo__p_8cpp_af0a3e6827f41c151e47451f5ff98b1f1_cgraph_org.svg b/de/dab/ncr__modulo__p_8cpp_af0a3e6827f41c151e47451f5ff98b1f1_cgraph_org.svg index c51cbe218..75726d29b 100644 --- a/de/dab/ncr__modulo__p_8cpp_af0a3e6827f41c151e47451f5ff98b1f1_cgraph_org.svg +++ b/de/dab/ncr__modulo__p_8cpp_af0a3e6827f41c151e47451f5ff98b1f1_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - diff --git a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index bc9cad9d4..1196cd1de 100644 --- a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph_org.svg b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph_org.svg index e5256edeb..32f8ea3b1 100644 --- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph_org.svg +++ b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index 7b4538b84..7bb11368a 100644 --- a/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 045877aed..6b0f8b657 100644 --- a/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/df/d2c/geometric__dist_8cpp__incl_org.svg b/df/d2c/geometric__dist_8cpp__incl_org.svg index 1c20060af..85d6e77b6 100644 --- a/df/d2c/geometric__dist_8cpp__incl_org.svg +++ b/df/d2c/geometric__dist_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph_org.svg b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph_org.svg index 1c3bde9d4..e3872df11 100644 --- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph_org.svg +++ b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/df/dd6/a1z26__cipher_8cpp__incl_org.svg b/df/dd6/a1z26__cipher_8cpp__incl_org.svg index fcfe809ea..07168eb7b 100644 --- a/df/dd6/a1z26__cipher_8cpp__incl_org.svg +++ b/df/dd6/a1z26__cipher_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - -
    file  array_right_rotation.cpp
     Implementation for the Array right Rotation algorithm.

      +file  circular_linked_list.cpp + Implementation for a Circular Linked List.
    +  file  inorder_successor_of_bst.cpp  An implementation for finding the Inorder successor of a binary search tree Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal.
      diff --git a/dir_35422be6552f1b3672c1b6c4aba2da64.js b/dir_35422be6552f1b3672c1b6c4aba2da64.js index 8eb3d0b0e..b74cebda3 100644 --- a/dir_35422be6552f1b3672c1b6c4aba2da64.js +++ b/dir_35422be6552f1b3672c1b6c4aba2da64.js @@ -2,6 +2,7 @@ var dir_35422be6552f1b3672c1b6c4aba2da64 = [ [ "array_left_rotation.cpp", "d9/d14/array__left__rotation_8cpp.html", "d9/d14/array__left__rotation_8cpp" ], [ "array_right_rotation.cpp", "d6/d57/array__right__rotation_8cpp.html", "d6/d57/array__right__rotation_8cpp" ], + [ "circular_linked_list.cpp", "de/d33/circular__linked__list_8cpp.html", "de/d33/circular__linked__list_8cpp" ], [ "inorder_successor_of_bst.cpp", "d4/d32/inorder__successor__of__bst_8cpp.html", "d4/d32/inorder__successor__of__bst_8cpp" ], [ "intersection_of_two_arrays.cpp", "de/dc5/intersection__of__two__arrays_8cpp.html", "de/dc5/intersection__of__two__arrays_8cpp" ], [ "reverse_binary_tree.cpp", "d4/db6/reverse__binary__tree_8cpp.html", "d4/db6/reverse__binary__tree_8cpp" ], diff --git a/dir_4d6e05837bf820fb089a8a8cdf2f42b7_dep.svg b/dir_4d6e05837bf820fb089a8a8cdf2f42b7_dep.svg index 0bf5b5fca..ebf3c55b5 100644 --- a/dir_4d6e05837bf820fb089a8a8cdf2f42b7_dep.svg +++ b/dir_4d6e05837bf820fb089a8a8cdf2f42b7_dep.svg @@ -1,7 +1,7 @@ -
      operations_on_datastructures  array_left_rotation.cppImplementation for the Array Left Rotation algorithm  array_right_rotation.cppImplementation for the Array right Rotation algorithm - inorder_successor_of_bst.cppAn implementation for finding the Inorder successor of a binary search tree Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal - intersection_of_two_arrays.cppImplementation for the Intersection of two sorted Arrays algorithm - reverse_binary_tree.cppImplementation for the Reversing a Binary Tree recursively algorithm - trie_multiple_search.cppTrie datastructure with search variants - union_of_two_arrays.cppImplementation for the Union of two sorted Arrays algorithm + circular_linked_list.cppImplementation for a Circular Linked List + inorder_successor_of_bst.cppAn implementation for finding the Inorder successor of a binary search tree Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal + intersection_of_two_arrays.cppImplementation for the Intersection of two sorted Arrays algorithm + reverse_binary_tree.cppImplementation for the Reversing a Binary Tree recursively algorithm + trie_multiple_search.cppTrie datastructure with search variants + union_of_two_arrays.cppImplementation for the Union of two sorted Arrays algorithm   others  buzz_number.cppA buzz number is a number that is either divisible by 7 or has last digit as 7  decimal_to_binary.cppFunction to convert decimal number to binary representation diff --git a/functions_c.html b/functions_c.html index f9d3d639c..16f9c70e1 100644 --- a/functions_c.html +++ b/functions_c.html @@ -100,6 +100,7 @@ $(document).ready(function(){initNavTree('functions_c.html',''); initResizable()
  • char_to_int() : data_structures::trie
  • check_size_match() : machine_learning::adaline
  • children : data_structures::tree_234::Node, data_structures::trie_using_hashmap::Trie::Node
  • +
  • CircularLinkedList() : operations_on_datastructures::circular_linked_list::CircularLinkedList
  • clear() : queue< Kind >, stack< Type >
  • codec() : ciphers::HillCipher
  • combine() : range_queries::heavy_light_decomposition::SG< X >
  • diff --git a/functions_d.html b/functions_d.html index 858f92433..7984d9903 100644 --- a/functions_d.html +++ b/functions_d.html @@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('functions_d.html',''); initResizable()
    Here is a list of all documented class members with links to the class documentation for each member:

    - d -