diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html index de2d632ba..a0d760a87 100644 --- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html +++ b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html @@ -238,7 +238,7 @@ static constexpr uint8_t E
55 endOfWord = node.endOfWord;
56 frequency = node.frequency;
57 }
-
node
Definition: avltree.cpp:13
+
node
Definition: binary_search_tree.cpp:11
diff --git a/d1/d83/classuint256__t.html b/d1/d83/classuint256__t.html index dfdb513cf..20c85ba41 100644 --- a/d1/d83/classuint256__t.html +++ b/d1/d83/classuint256__t.html @@ -850,8 +850,8 @@ Here is the call graph for this function:
425 return {uint256_t(1), uint256_t(0)};
426 }
427 uint256_t tmp = p, tmp2 = *this;
-
428 uint16_t left = tmp._lez() - _lez();
-
429 tmp <<= left;
+
428 uint16_t left = tmp._lez() - _lez();
+
429 tmp <<= left;
430 uint256_t quotient(0);
431 uint256_t zero(0);
432 while (tmp2 >= p) {
@@ -859,21 +859,20 @@ Here is the call graph for this function:
434 if (shf) {
435 tmp >>= shf;
436 quotient <<= shf;
-
437 left -= shf;
+
437 left -= shf;
438 }
439 if (tmp2 < tmp) {
440 tmp >>= 1;
441 quotient <<= 1;
-
442 --left;
+
442 --left;
443 }
444 tmp2 -= tmp;
445 ++quotient;
446 }
-
447 return {quotient << left, tmp2};
+
447 return {quotient << left, tmp2};
448 }
uint256_t
class for 256-bit unsigned integer
Definition: uint256_t.hpp:33
uint256_t::_lez
uint32_t _lez()
Leading zeroes in binary.
Definition: uint256_t.hpp:123
-
std::left
T left(T... args)
Here is the call graph for this function:
diff --git a/d1/df2/structnode-members.html b/d1/df2/structnode-members.html index 99eb6a8ae..c0d749ce8 100644 --- a/d1/df2/structnode-members.html +++ b/d1/df2/structnode-members.html @@ -105,9 +105,7 @@ $(document).ready(function(){initNavTree('d5/da1/structnode.html','../../'); ini - - - + @@ -116,8 +114,7 @@ $(document).ready(function(){initNavTree('d5/da1/structnode.html','../../'); ini - - +
color (defined in node)node
data (defined in node)node
height (defined in node)node
key (defined in node)node
left (defined in node)node
key (defined in node)node
left (defined in node)node
link (defined in node)node
next (defined in node)node
parent (defined in node)node
prev (defined in node)node
right (defined in node)node
right (defined in node)node
val (defined in node)node
val (defined in node)node
diff --git a/d1/df3/hash__search_8cpp.html b/d1/df3/hash__search_8cpp.html index 01ad18430..1f30690ad 100644 --- a/d1/df3/hash__search_8cpp.html +++ b/d1/df3/hash__search_8cpp.html @@ -231,7 +231,7 @@ int data [MAX] = {1, 1
hashtab
node hashtab[HASHMAX]
array of nodes
Definition: hash_search.cpp:35
std::list
std::malloc
T malloc(T... args)
-
node
Definition: avltree.cpp:13
+
node
Definition: binary_search_tree.cpp:11
Here is the call graph for this function:
diff --git a/d2/d26/count__inversions_8cpp.html b/d2/d26/count__inversions_8cpp.html index ca416ecf9..26b183448 100644 --- a/d2/d26/count__inversions_8cpp.html +++ b/d2/d26/count__inversions_8cpp.html @@ -321,9 +321,9 @@ template<typename T >
Returns
number of inversions found in merge step
85 {
-
86 uint32_t i = left; /* i --> index of left sub-array */
+
86 uint32_t i = left; /* i --> index of left sub-array */
87 uint32_t j = mid + 1; /* j --> index for right sub-array */
-
88 uint32_t k = left; /* k --> index for resultant array temp */
+
88 uint32_t k = left; /* k --> index for resultant array temp */
89 uint32_t inv_count = 0; // inversion count
90
91 while ((i <= mid) && (j <= right)) {
@@ -344,13 +344,12 @@ template<typename T >
106 temp[k++] = arr[j++];
107 }
108 // Copy temp[] to arr[]
-
109 for (k = left; k <= right; k++) {
+
109 for (k = left; k <= right; k++) {
110 arr[k] = temp[k];
111 }
112 return inv_count;
113}
numerical_methods::simpson_method::k
double k(double x)
Another test function.
Definition: composite_simpson_rule.cpp:117
-
std::left
T left(T... args)
@@ -410,7 +409,7 @@ template<typename T >
133 uint32_t mid = 0, inv_count = 0;
134 if (right > left) {
135 // midpoint to split the array
-
136 mid = (right + left) / 2;
+
136 mid = (right + left) / 2;
137 // Add inversions in left and right sub-arrays
138 inv_count += mergeSort(arr, temp, left, mid); // left sub-array
139 inv_count += mergeSort(arr, temp, mid + 1, right);
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html index 91acfc227..b170b6185 100644 --- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html +++ b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html @@ -715,7 +715,7 @@ template<typename X >
478 Tree<X>::t_val[node] = val;
479 }
range_queries::heavy_light_decomposition::SG::update
void update(int p, X v)
Update the value at a node.
Definition: heavy_light_decomposition.cpp:293
-
node
Definition: avltree.cpp:13
+
node
Definition: binary_search_tree.cpp:11
Here is the call graph for this function:
diff --git a/d3/d26/binary__search__tree_8cpp.html b/d3/d26/binary__search__tree_8cpp.html index 7e8af0953..209cb4d6c 100644 --- a/d3/d26/binary__search__tree_8cpp.html +++ b/d3/d26/binary__search__tree_8cpp.html @@ -319,7 +319,7 @@ Variables
49 }
50 }
51}
-
node
Definition: avltree.cpp:13
+
node
Definition: binary_search_tree.cpp:11
diff --git a/d3/d39/manacher__algorithm_8cpp.html b/d3/d39/manacher__algorithm_8cpp.html index 7b4c1bb42..ec729bfbe 100644 --- a/d3/d39/manacher__algorithm_8cpp.html +++ b/d3/d39/manacher__algorithm_8cpp.html @@ -221,7 +221,7 @@ Here is the call graph for this function:
60 // substring which would be considered as the larger
61 // palindrome, having symmetric halves
62
-
63 uint64_t right = 0; // this is the maximum length of the palindrome
+
63 uint64_t right = 0; // this is the maximum length of the palindrome
64 // from 'bigger_center' to the rightmost end
65
66 // i is considered as center lying within one half of the palindrone
@@ -255,7 +255,7 @@ Here is the call graph for this function:
94 // to center i
95 if (i + palindrome_max_half_length[i] > right) {
96 bigger_center = i;
-
97 right = i + palindrome_max_half_length[i];
+
97 right = i + palindrome_max_half_length[i];
98 }
99 }
100
@@ -302,7 +302,6 @@ Here is the call graph for this function:
141}
std::string
std::end
T end(T... args)
-
std::right
T right(T... args)
std::min
T min(T... args)
std::string::size
T size(T... args)
std::vector
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html index 42e88a32c..e1c56e83d 100644 --- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html +++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html @@ -631,7 +631,7 @@ Here is the call graph for this function:
631}
data_structures::tree_234::Tree234::SplitNode
Node * SplitNode(Node *node)
Split a 4-node to 1 parent and 2 children, and return the parent node.
Definition: tree_234.cpp:745
data_structures::tree_234::Tree234::MergeNodeNotFull
void MergeNodeNotFull(Node *dst_node, Node *node)
Merge node to a not-full target node.
Definition: tree_234.cpp:730
-
node
Definition: avltree.cpp:13
+
node
Definition: binary_search_tree.cpp:11
Here is the call graph for this function:
@@ -693,18 +693,17 @@ Here is the call graph for this function:
869 {
-
870 Node *left = parent->GetItemLeftChild(index);
-
871 Node *right = parent->GetItemRightChild(index);
+
870 Node *left = parent->GetItemLeftChild(index);
+
871 Node *right = parent->GetItemRightChild(index);
872
-
873 assert(right && right->Is34Node());
-
874 assert(left && left->Is2Node());
+
873 assert(right && right->Is34Node());
+
874 assert(left && left->Is2Node());
875
-
876 left->InsertItemByIndex(left->GetCount(), parent->GetItem(index),
-
877 right->GetLeftmostChild(), false);
-
878 parent->SetItem(index, right->GetMinItem());
-
879 right->RemoveItemByIndex(0, false);
+
876 left->InsertItemByIndex(left->GetCount(), parent->GetItem(index),
+
877 right->GetLeftmostChild(), false);
+
878 parent->SetItem(index, right->GetMinItem());
+
879 right->RemoveItemByIndex(0, false);
880}
-
std::left
T left(T... args)
@@ -1467,16 +1466,16 @@ Here is the call graph for this function:
845 {
-
846 Node *left = parent->GetItemLeftChild(index);
-
847 Node *right = parent->GetItemRightChild(index);
+
846 Node *left = parent->GetItemLeftChild(index);
+
847 Node *right = parent->GetItemRightChild(index);
848
-
849 assert(left && left->Is34Node());
-
850 assert(right && right->Is2Node());
+
849 assert(left && left->Is34Node());
+
850 assert(right && right->Is2Node());
851
-
852 right->InsertItemByIndex(0, parent->GetItem(index),
-
853 left->GetRightmostChild(), true);
-
854 parent->SetItem(index, left->GetMaxItem());
-
855 left->RemoveItemByIndex(left->GetCount() - 1, true);
+
852 right->InsertItemByIndex(0, parent->GetItem(index),
+
853 left->GetRightmostChild(), true);
+
854 parent->SetItem(index, left->GetMaxItem());
+
855 left->RemoveItemByIndex(left->GetCount() - 1, true);
856}
@@ -1516,17 +1515,17 @@ Here is the call graph for this function:
745 {
746 assert(node->GetCount() == 3);
747
-
748 Node *left = node;
+
748 Node *left = node;
749
-
750 Node *right = new Node(node->GetItem(2));
-
751 right->SetChild(0, node->GetChild(2));
-
752 right->SetChild(1, node->GetChild(3));
+
750 Node *right = new Node(node->GetItem(2));
+
751 right->SetChild(0, node->GetChild(2));
+
752 right->SetChild(1, node->GetChild(3));
753
754 Node *parent = new Node(node->GetItem(1));
755 parent->SetChild(0, left);
756 parent->SetChild(1, right);
757
-
758 left->SetCount(1);
+
758 left->SetCount(1);
759
760 return parent;
761}
diff --git a/d3/dbb/class_cycle_check.html b/d3/dbb/class_cycle_check.html index 20da043c4..20f6d33c4 100644 --- a/d3/dbb/class_cycle_check.html +++ b/d3/dbb/class_cycle_check.html @@ -247,7 +247,7 @@ Static Private Member Functions
std::queue::pop
T pop(T... args)
list
Definition: hash_search.cpp:29
-
node
Definition: avltree.cpp:13
+
node
Definition: binary_search_tree.cpp:11
Here is the call graph for this function:
diff --git a/d3/dfe/perimeter_8cpp.html b/d3/dfe/perimeter_8cpp.html index fe8689659..adefa3ef5 100644 --- a/d3/dfe/perimeter_8cpp.html +++ b/d3/dfe/perimeter_8cpp.html @@ -135,7 +135,7 @@ Functions  perimeter of a rectangle ( 2(l + w) )
  template<typename T > -T math::triangle_perimeter (T base, T height, T hypotenuse) +T math::triangle_perimeter (T base, T height, T hypotenuse)  perimeter of a triangle (a + b + c)
  template<typename T > @@ -143,7 +143,7 @@ Functions  perimeter of a circle (2 * pi * r)
  template<typename T > -T math::parallelogram_perimeter (T base, T height) +T math::parallelogram_perimeter (T base, T height)  perimeter of a parallelogram 2(b + h)
  template<typename T > @@ -155,7 +155,7 @@ Functions  surface perimeter of a n-polygon ( n * l)
  template<typename T > -T math::cylinder_surface_perimeter (T radius, T height) +T math::cylinder_surface_perimeter (T radius, T height)  surface perimeter of a cylinder (2 * radius + 2 * height)
  static void test () @@ -196,7 +196,7 @@ Functions
Here is the call graph for this function:
-
+
@@ -399,7 +399,7 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
diff --git a/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map index e1c4db5a6..5a9a1604e 100644 --- a/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map +++ b/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -3,12 +3,10 @@ - - - - - - - - + + + + + + diff --git a/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 index c0125ff70..3406cb00b 100644 --- a/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 +++ b/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -1 +1 @@ -989bd7fb1e44d35aecc89db0048afc45 \ No newline at end of file +f84b11cad6dc23c87cf77f891fc7dbc1 \ No newline at end of file diff --git a/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index e820d1370..90ed962eb 100644 --- a/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -4,8 +4,8 @@ - + test @@ -64,145 +64,97 @@ - - -Node7 - + + +Node5 + std::endl - - -Node1->Node7 + + +Node1->Node5 - - -Node8 - + + +Node6 + math::n_polygon_surface _perimeter - - -Node1->Node8 + + +Node1->Node6 - - -Node9 - + + +Node7 + math::parallelogram _perimeter - - -Node1->Node9 + + +Node1->Node7 - - -Node10 - + + +Node8 + math::rect_perimeter - - -Node1->Node10 + + +Node1->Node8 - - -Node11 - + + +Node9 + math::square_perimeter - - -Node1->Node11 + + +Node1->Node9 - - -Node12 - + + +Node10 + math::triangle_perimeter - - -Node1->Node12 + + +Node1->Node10 - - -Node5 - - -height - - - - - -Node4->Node5 - - - - - -Node5->Node5 - - - - - -Node6 - - -std::max - - - - - -Node5->Node6 - - - - - -Node9->Node5 - - - - - -Node12->Node5 - - - diff --git a/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 171a74f2b..a1a91b081 100644 --- a/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -4,12 +4,10 @@ - - - - - - - - + + + + + + diff --git a/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 69207583d..1c5c5a125 100644 --- a/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -27345001eea71257805d60bb050901cd \ No newline at end of file +23a7900f17250ee18c47ef25f86ed4d6 \ No newline at end of file diff --git a/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 87a19e48a..c980a470c 100644 --- a/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,8 +4,8 @@ - + main @@ -79,145 +79,97 @@ - - -Node8 - + + +Node6 + std::endl - - -Node2->Node8 + + +Node2->Node6 - - -Node9 - + + +Node7 + math::n_polygon_surface _perimeter - - -Node2->Node9 + + +Node2->Node7 - - -Node10 - + + +Node8 + math::parallelogram _perimeter - - -Node2->Node10 + + +Node2->Node8 - - -Node11 - + + +Node9 + math::rect_perimeter - - -Node2->Node11 + + +Node2->Node9 - - -Node12 - + + +Node10 + math::square_perimeter - - -Node2->Node12 + + +Node2->Node10 - - -Node13 - + + +Node11 + math::triangle_perimeter - - -Node2->Node13 + + +Node2->Node11 - - -Node6 - - -height - - - - - -Node5->Node6 - - - - - -Node6->Node6 - - - - - -Node7 - - -std::max - - - - - -Node6->Node7 - - - - - -Node10->Node6 - - - - - -Node13->Node6 - - - diff --git a/d4/d32/inorder__successor__of__bst_8cpp.html b/d4/d32/inorder__successor__of__bst_8cpp.html index 65e6ac8de..9903e27c5 100644 --- a/d4/d32/inorder__successor__of__bst_8cpp.html +++ b/d4/d32/inorder__successor__of__bst_8cpp.html @@ -642,7 +642,7 @@ Here is the call graph for this function:
72 node->right = nullptr; ///< setting right child as null
73 return node;
74}
-
node
Definition: avltree.cpp:13
+
node
Definition: binary_search_tree.cpp:11
Here is the call graph for this function:
diff --git a/d4/d90/classdata__structures_1_1_skip_list.html b/d4/d90/classdata__structures_1_1_skip_list.html index d654a58d1..8072f4e54 100644 --- a/d4/d90/classdata__structures_1_1_skip_list.html +++ b/d4/d90/classdata__structures_1_1_skip_list.html @@ -284,7 +284,7 @@ Here is the call graph for this function:
200 std::cout << std::endl;
201 }
202 }
-
node
Definition: avltree.cpp:13
+
node
Definition: binary_search_tree.cpp:11
Here is the call graph for this function:
diff --git a/d5/d15/classcll.html b/d5/d15/classcll.html index 35c3b0a01..9ebbac26f 100644 --- a/d5/d15/classcll.html +++ b/d5/d15/classcll.html @@ -209,7 +209,7 @@ int total
30}
endl
#define endl
Definition: matrix_exponentiation.cpp:36
-
node
Definition: avltree.cpp:13
+
node
Definition: binary_search_tree.cpp:11
diff --git a/d5/d45/sublist__search_8cpp.html b/d5/d45/sublist__search_8cpp.html index e475405df..b89bb7085 100644 --- a/d5/d45/sublist__search_8cpp.html +++ b/d5/d45/sublist__search_8cpp.html @@ -305,7 +305,7 @@ Here is the call graph for this function:
91}
data
int data[MAX]
test data
Definition: hash_search.cpp:24
Node
Definition: linkedlist_implentation_usingarray.cpp:14
-
node
Definition: avltree.cpp:13
+
node
Definition: binary_search_tree.cpp:11
Here is the call graph for this function:
diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html index ad3e5ce08..36c372448 100644 --- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html +++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html @@ -122,6 +122,7 @@ Bit Manipulation
  • Count Of Trailing Ciphers In Factorial N
  • Find Non Repeating Number
  • Hamming Distance
    • +
  • Power Of 2
  • Set Kth Bit
  • Travelling Salesman Using Bit Manipulation
    • diff --git a/d5/da1/structnode.html b/d5/da1/structnode.html index b86ef5417..987ac8d1f 100644 --- a/d5/da1/structnode.html +++ b/d5/da1/structnode.html @@ -118,27 +118,18 @@ Public Member Functions - - - - - - - - - - - + - + + + @@ -194,7 +185,6 @@ char 
    The documentation for this class was generated from the following files:

    Public Attributes

    -int data
     
    -int height
     
    -struct node * left
     
    -struct node * right
     
    int val
     
    +
    node * left
     
    +
     
    node * right
     
     
    +int data
     
    struct node * next
     
    color