diff --git a/annotated.html b/annotated.html index d7483f10f..5a85b5abb 100644 --- a/annotated.html +++ b/annotated.html @@ -264,80 +264,73 @@ document.addEventListener('DOMContentLoaded',() => { initNavTree('annotated.html  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 > - NstringsString algorithms -  Nboyer_mooreFunctions for the Boyer Moore algorithm implementation -   CpatternA structure representing all the data we need to search the preprocessed pattern in text - NtestsTestcases to check Union of Two Arrays -  CCircularLinkedListA class that implements a Circular Linked List -  CNodeA Node struct that represents a single Node in a Binary Tree - Cadaline - Cbinary_search_treeThe Binary Search Tree class -  Cbst_nodeA struct to represent a node in the Binary Search Tree - CBtree - Ccatalan_numbersComputes and caches Catalan numbers - 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 assert - CEdge - CEntry - CFCFSClass which implements the FCFS scheduling algorithm - CGraph - Chash_chainChain class with a given modulus - CHKGraphRepresents Bipartite graph for Hopcroft Karp implementation - CItem - Clarge_number - Clinkedlist - Clist - CListNodeFor IO operations - CLongest_SubstringClass that solves the Longest Substring Without Repeating Characters problem - CMemorisedFactorial - CMinHeap - CMinHeapNode - Cmst - CNode - Cnode - CPoint - Cpriority_queueSTL class - Cquery - CQueue - Cqueue - CRBtree - CSegmentIntersection - CSJFClass which implements the SJF scheduling algorithm - CSolution - CstackFor std::invalid_argument - Cstack_linkedList - Cstats_computer1 - Cstats_computer2 - CTestCaseSingle example inputs and expected output of the function longest_common_string_length - CTestCasesClass encapsulating the necessary test cases - Ctower - CTrie -  CTrieNode - Cuint128_tClass for 128-bit unsigned integer - Cuint256_tClass for 256-bit unsigned integer - Cunordered_setSTL class -  CiteratorSTL iterator class -  Cconst_iteratorSTL iterator class -  Creverse_iteratorSTL iterator class -  Cconst_reverse_iteratorSTL iterator class - CvectorSTL class -  CiteratorSTL iterator class -  Cconst_iteratorSTL iterator class -  Creverse_iteratorSTL iterator class -  Cconst_reverse_iteratorSTL iterator class + NstringsString algorithms +  Nboyer_mooreFunctions for the Boyer Moore algorithm implementation +   CpatternA structure representing all the data we need to search the preprocessed pattern in text + NtestsTestcases to check Union of Two Arrays +  CCircularLinkedListA class that implements a Circular Linked List +  CNodeA Node struct that represents a single Node in a Binary Tree + Cadaline + Cbinary_search_treeThe Binary Search Tree class +  Cbst_nodeA struct to represent a node in the Binary Search Tree + CBtree + Ccatalan_numbersComputes and caches Catalan numbers + 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 assert + CEdge + CEntry + CFCFSClass which implements the FCFS scheduling algorithm + CGraph + Chash_chainChain class with a given modulus + CHKGraphRepresents Bipartite graph for Hopcroft Karp implementation + CItem + Clarge_number + Clinkedlist + Clist + CListNodeFor IO operations + CLongest_SubstringClass that solves the Longest Substring Without Repeating Characters problem + CMemorisedFactorial + CMinHeap + CMinHeapNode + Cmst + CNode + Cnode + CPoint + Cpriority_queueSTL class + Cquery + CQueue + Cqueue + CRBtree + CSegmentIntersection + CSJFClass which implements the SJF scheduling algorithm + CSolution + CstackFor std::invalid_argument + Cstack_linkedList + Cstats_computer1 + Cstats_computer2 + CTestCaseSingle example inputs and expected output of the function longest_common_string_length + CTestCasesClass encapsulating the necessary test cases + Ctower + CTrie +  CTrieNode + Cuint128_tClass for 128-bit unsigned integer + Cuint256_tClass for 256-bit unsigned integer + Cunordered_setSTL class +  CiteratorSTL iterator class +  Cconst_iteratorSTL iterator class +  Creverse_iteratorSTL iterator class +  Cconst_reverse_iteratorSTL iterator class + CvectorSTL class +  CiteratorSTL iterator class +  Cconst_iteratorSTL iterator class +  Creverse_iteratorSTL iterator class +  Cconst_reverse_iteratorSTL iterator class diff --git a/annotated_dup.js b/annotated_dup.js index fb0f42191..0ccc4e802 100644 --- a/annotated_dup.js +++ b/annotated_dup.js @@ -173,14 +173,6 @@ var annotated_dup = [ "stats_computer1", "d7/d7c/classstatistics_1_1stats__computer1.html", "d7/d7c/classstatistics_1_1stats__computer1" ], [ "stats_computer2", "d8/dab/classstatistics_1_1stats__computer2.html", "d8/dab/classstatistics_1_1stats__computer2" ] ] ], - [ "std", null, [ - [ "is_arithmetic< uint128_t >", "d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html", null ], - [ "is_arithmetic< uint256_t >", "dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html", null ], - [ "is_integral< uint128_t >", "d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html", null ], - [ "is_integral< uint256_t >", "d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html", null ], - [ "is_unsigned< uint128_t >", "d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html", null ], - [ "is_unsigned< uint256_t >", "df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html", null ] - ] ], [ "strings", "df/dcb/namespacestrings.html", [ [ "boyer_moore", "d0/dbc/namespacestrings_1_1boyer__moore.html", [ [ "pattern", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern" ] diff --git a/classes.html b/classes.html index 671c0360f..0b83407d0 100644 --- a/classes.html +++ b/classes.html @@ -165,7 +165,7 @@ document.addEventListener('DOMContentLoaded',() => { initNavTree('classes.html',
Hash (hashing::sha256)
hash_chain
HillCipher (ciphers)
HKGraph (graph)
HKGraph
HLD (range_queries::heavy_light_decomposition)
I
-
AyStarSearch::Info (machine_learning::aystar_search)
is_arithmetic< uint128_t > (std)
is_arithmetic< uint256_t > (std)
is_integral< uint128_t > (std)
is_integral< uint256_t > (std)
is_unsigned< uint128_t > (std)
is_unsigned< uint256_t > (std)
Item
unordered_set::iterator
vector::iterator
+
AyStarSearch::Info (machine_learning::aystar_search)
Item
unordered_set::iterator
vector::iterator
K
Knn (machine_learning::k_nearest_neighbors)
diff --git a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.map b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.map deleted file mode 100644 index e136109d8..000000000 --- a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.md5 b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.md5 deleted file mode 100644 index 7da104bd8..000000000 --- a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -38418cdb629a508d14caedeb9b71e651 \ No newline at end of file diff --git a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.svg b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.svg deleted file mode 100644 index a255ddefd..000000000 --- a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.svg +++ /dev/null @@ -1,60 +0,0 @@ - - - - - - - - - - - - -std::is_arithmetic< uint256_t > - - -Node1 - - -std::is_arithmetic -< uint256_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - - - - - diff --git a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph_org.svg b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph_org.svg deleted file mode 100644 index 6695e83bd..000000000 --- a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph_org.svg +++ /dev/null @@ -1,40 +0,0 @@ - - - - - - -std::is_arithmetic< uint256_t > - - -Node1 - - -std::is_arithmetic -< uint256_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - diff --git a/d1/d83/classuint256__t.html b/d1/d83/classuint256__t.html index a84235df3..d60912b52 100644 --- a/d1/d83/classuint256__t.html +++ b/d1/d83/classuint256__t.html @@ -360,7 +360,7 @@ Friends

Detailed Description

class for 256-bit unsigned integer

-

Definition at line 33 of file uint256_t.hpp.

+

Definition at line 24 of file uint256_t.hpp.

Constructor & Destructor Documentation

◆ uint256_t() [1/6]

@@ -401,8 +401,8 @@ template<typename T, typename = typename std::enable_if< -

Definition at line 75 of file uint256_t.hpp.

-
75: f(0), s(low) {}
+

Definition at line 66 of file uint256_t.hpp.

+
66: f(0), s(low) {}
@@ -437,11 +437,11 @@ template<typename T, typename = typename std::enable_if< -

Definition at line 81 of file uint256_t.hpp.

-
81 {
-
82 __get_integer_from_string(str);
-
83 }
-
void __get_integer_from_string(const std::string &str)
First and second half of 256 bit number.
Definition uint256_t.hpp:43
+

Definition at line 72 of file uint256_t.hpp.

+
72 {
+ +
74 }
+
void __get_integer_from_string(const std::string &str)
First and second half of 256 bit number.
Definition uint256_t.hpp:34
@@ -509,8 +509,8 @@ template<typename T, typename = typename std::enable_if< -

Definition at line 95 of file uint256_t.hpp.

-
96 : f(std::move(num.f)), s(std::move(num.s)) {}
+

Definition at line 86 of file uint256_t.hpp.

+
87 : f(std::move(num.f)), s(std::move(num.s)) {}
@@ -550,8 +550,8 @@ template<typename T, typename = typename std::enable_if< -

Definition at line 103 of file uint256_t.hpp.

-
104 : f(std::move(high)), s(std::move(low)) {}
+

Definition at line 94 of file uint256_t.hpp.

+
95 : f(std::move(high)), s(std::move(low)) {}
@@ -591,8 +591,8 @@ template<typename T, typename = typename std::enable_if< -

Definition at line 111 of file uint256_t.hpp.

-
111: f(high), s(low) {}
+

Definition at line 102 of file uint256_t.hpp.

+
102: f(high), s(low) {}
@@ -630,27 +630,27 @@ template<typename T, typename = typename std::enable_if<
Returns
void
-

Definition at line 43 of file uint256_t.hpp.

-
43 {
-
44 this->f = this->s = uint128_t(0);
-
45 if (str.size() > 1 && str[1] == 'x') {
-
46 for (auto i = 2; i < str.size(); ++i) {
-
47 *this *= 16LL;
-
48 if (str[i] >= '0' && str[i] <= '9') {
-
49 *this += (str[i] - '0');
-
50 } else if (str[i] >= 'A' && str[i] <= 'F') {
-
51 *this += (str[i] - 'A' + 10);
-
52 } else if (str[i] >= 'a' && str[i] <= 'f') {
-
53 *this += (str[i] - 'a' + 10);
-
54 }
-
55 }
-
56 } else {
-
57 for (auto &x : str) {
-
58 *this *= 10LL;
-
59 *this += (x - '0');
-
60 }
-
61 }
-
62 }
+

Definition at line 34 of file uint256_t.hpp.

+
34 {
+
35 this->f = this->s = uint128_t(0);
+
36 if (str.size() > 1 && str[1] == 'x') {
+
37 for (auto i = 2; i < str.size(); ++i) {
+
38 *this *= 16LL;
+
39 if (str[i] >= '0' && str[i] <= '9') {
+
40 *this += (str[i] - '0');
+
41 } else if (str[i] >= 'A' && str[i] <= 'F') {
+
42 *this += (str[i] - 'A' + 10);
+
43 } else if (str[i] >= 'a' && str[i] <= 'f') {
+
44 *this += (str[i] - 'a' + 10);
+
45 }
+
46 }
+
47 } else {
+
48 for (auto &x : str) {
+
49 *this *= 10LL;
+
50 *this += (x - '0');
+
51 }
+
52 }
+
53 }
@@ -680,13 +680,13 @@ template<typename T, typename = typename std::enable_if<

Leading zeroes in binary.

Calculates leading zeros in 256-bit integer

Returns
Integer denoting leading zeroes
-

Definition at line 123 of file uint256_t.hpp.

-
123 {
-
124 if (f) {
-
125 return f._lez();
-
126 }
-
127 return 128 + s._lez();
-
128 }
+

Definition at line 114 of file uint256_t.hpp.

+
114 {
+
115 if (f) {
+
116 return f._lez();
+
117 }
+
118 return 128 + s._lez();
+
119 }
@@ -716,13 +716,13 @@ template<typename T, typename = typename std::enable_if<

Trailing zeroes in binary.

Calculates leading zeros in 256-bit integer

Returns
Integer denoting Trailing zeroes
-

Definition at line 135 of file uint256_t.hpp.

-
135 {
-
136 if (s) {
-
137 return s._trz();
-
138 }
-
139 return 128 + f._trz();
-
140 }
+

Definition at line 126 of file uint256_t.hpp.

+
126 {
+
127 if (s) {
+
128 return s._trz();
+
129 }
+
130 return 128 + f._trz();
+
131 }
@@ -758,36 +758,36 @@ template<typename T, typename = typename std::enable_if<
Returns
pair denoting quotient and remainder.
-

Definition at line 421 of file uint256_t.hpp.

-
421 {
-
422 if (*this < p) { // if this is less than divisor
-
423 return {uint256_t(0), *this};
-
424 } else if (*this == p) { // if this is equal to divisor
-
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;
-
430 uint256_t quotient(0);
-
431 uint256_t zero(0);
-
432 while (tmp2 >= p) {
-
433 uint16_t shf = tmp2._lez() - tmp._lez();
-
434 if (shf) {
-
435 tmp >>= shf;
-
436 quotient <<= shf;
-
437 left -= shf;
-
438 }
-
439 if (tmp2 < tmp) {
-
440 tmp >>= 1;
-
441 quotient <<= 1;
-
442 --left;
-
443 }
-
444 tmp2 -= tmp;
-
445 ++quotient;
-
446 }
-
447 return {quotient << left, tmp2};
-
448 }
-
uint32_t _lez()
Leading zeroes in binary.
+

Definition at line 412 of file uint256_t.hpp.

+
412 {
+
413 if (*this < p) { // if this is less than divisor
+
414 return {uint256_t(0), *this};
+
415 } else if (*this == p) { // if this is equal to divisor
+
416 return {uint256_t(1), uint256_t(0)};
+
417 }
+
418 uint256_t tmp = p, tmp2 = *this;
+
419 uint16_t left = tmp._lez() - _lez();
+
420 tmp <<= left;
+
421 uint256_t quotient(0);
+
422 uint256_t zero(0);
+
423 while (tmp2 >= p) {
+
424 uint16_t shf = tmp2._lez() - tmp._lez();
+
425 if (shf) {
+
426 tmp >>= shf;
+
427 quotient <<= shf;
+
428 left -= shf;
+
429 }
+
430 if (tmp2 < tmp) {
+
431 tmp >>= 1;
+
432 quotient <<= 1;
+
433 --left;
+
434 }
+
435 tmp2 -= tmp;
+
436 ++quotient;
+
437 }
+
438 return {quotient << left, tmp2};
+
439 }
+
uint32_t _lez()
Leading zeroes in binary.
@@ -817,8 +817,8 @@ template<typename T, typename = typename std::enable_if<

returns lower 128-bit integer part

Returns
returns lower 128-bit integer part
-

Definition at line 169 of file uint256_t.hpp.

-
169{ return s; }
+

Definition at line 160 of file uint256_t.hpp.

+
160{ return s; }
@@ -848,8 +848,8 @@ template<typename T, typename = typename std::enable_if<

casting operator to boolean value

Returns
true if value of this is non-zero, else false
-

Definition at line 146 of file uint256_t.hpp.

-
146{ return f || s; }
+

Definition at line 137 of file uint256_t.hpp.

+
137{ return f || s; }
@@ -887,10 +887,10 @@ template<typename T, typename = typename std::enable_if<
Returns
integer value casted to mentioned type
-

Definition at line 155 of file uint256_t.hpp.

-
155 {
-
156 return static_cast<T>(s);
-
157 }
+

Definition at line 146 of file uint256_t.hpp.

+
146 {
+
147 return static_cast<T>(s);
+
148 }
@@ -920,8 +920,8 @@ template<typename T, typename = typename std::enable_if<

casting operator to uint128_t

Returns
returns lower 128-bit integer part
-

Definition at line 163 of file uint256_t.hpp.

-
163{ return s; }
+

Definition at line 154 of file uint256_t.hpp.

+
154{ return s; }
@@ -951,8 +951,8 @@ template<typename T, typename = typename std::enable_if<

operator ! for uint256_t

Returns
true if this has zero value, else false
-

Definition at line 596 of file uint256_t.hpp.

-
596{ return !f && !s; }
+

Definition at line 587 of file uint256_t.hpp.

+
587{ return !f && !s; }
@@ -996,10 +996,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is not equal to other, else false
-

Definition at line 690 of file uint256_t.hpp.

-
690 {
-
691 return *this != uint256_t(other);
-
692 }
+

Definition at line 681 of file uint256_t.hpp.

+
681 {
+
682 return *this != uint256_t(other);
+
683 }
@@ -1035,10 +1035,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is not equal than other, else false
-

Definition at line 588 of file uint256_t.hpp.

-
588 {
-
589 return !((*this) == other);
-
590 }
+

Definition at line 579 of file uint256_t.hpp.

+
579 {
+
580 return !((*this) == other);
+
581 }
@@ -1082,12 +1082,12 @@ template<typename T, typename = typename std::enable_if<
Returns
unsigned 256-bit remainder.
-

Definition at line 509 of file uint256_t.hpp.

-
509 {
-
510 uint256_t tmp = *this;
-
511 tmp %= uint256_t(p);
-
512 return tmp;
-
513 }
+

Definition at line 500 of file uint256_t.hpp.

+
500 {
+
501 uint256_t tmp = *this;
+
502 tmp %= uint256_t(p);
+
503 return tmp;
+
504 }
@@ -1123,9 +1123,9 @@ template<typename T, typename = typename std::enable_if<
Returns
unsigned 256-bit remainder.
-

Definition at line 499 of file uint256_t.hpp.

-
499{ return divide(p).second; }
-
std::pair< uint256_t, uint256_t > divide(const uint256_t &p)
divide function for uint256_t and other integer types.
+

Definition at line 490 of file uint256_t.hpp.

+
490{ return divide(p).second; }
+
std::pair< uint256_t, uint256_t > divide(const uint256_t &p)
divide function for uint256_t and other integer types.
@@ -1169,11 +1169,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this set as unsigned 256-bit remainder.
-

Definition at line 533 of file uint256_t.hpp.

-
533 {
-
534 *this %= uint256_t(p);
-
535 return *this;
-
536 }
+

Definition at line 524 of file uint256_t.hpp.

+
524 {
+
525 *this %= uint256_t(p);
+
526 return *this;
+
527 }
@@ -1209,11 +1209,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this set as unsigned 256-bit remainder.
-

Definition at line 520 of file uint256_t.hpp.

-
520 {
-
521 *this = divide(p).second;
-
522 return *this;
-
523 }
+

Definition at line 511 of file uint256_t.hpp.

+
511 {
+
512 *this = divide(p).second;
+
513 return *this;
+
514 }
@@ -1257,10 +1257,10 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this & p (& is bit-wise operator)
-

Definition at line 811 of file uint256_t.hpp.

-
811 {
-
812 return *this & uint256_t(p);
-
813 }
+

Definition at line 802 of file uint256_t.hpp.

+
802 {
+
803 return *this & uint256_t(p);
+
804 }
@@ -1296,10 +1296,10 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this & p (& is bit-wise operator)
-

Definition at line 820 of file uint256_t.hpp.

-
820 {
-
821 return {f & p.f, s & p.s};
-
822 }
+

Definition at line 811 of file uint256_t.hpp.

+
811 {
+
812 return {f & p.f, s & p.s};
+
813 }
@@ -1343,10 +1343,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is both values are non-zero, else false
-

Definition at line 702 of file uint256_t.hpp.

-
702 {
-
703 return (s || f) && (b);
-
704 }
+

Definition at line 693 of file uint256_t.hpp.

+
693 {
+
694 return (s || f) && (b);
+
695 }
@@ -1382,10 +1382,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if both of the values are not zero, else false
-

Definition at line 603 of file uint256_t.hpp.

-
603 {
-
604 return (s || f) && (b.s || b.f);
-
605 }
+

Definition at line 594 of file uint256_t.hpp.

+
594 {
+
595 return (s || f) && (b.s || b.f);
+
596 }
@@ -1429,11 +1429,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this = this & p (& is bit-wise operator)
-

Definition at line 843 of file uint256_t.hpp.

-
843 {
-
844 s &= p.s;
-
845 return *this;
-
846 }
+

Definition at line 834 of file uint256_t.hpp.

+
834 {
+
835 s &= p.s;
+
836 return *this;
+
837 }
@@ -1469,12 +1469,12 @@ template<typename T, typename = typename std::enable_if<
Returns
this = this & p (& is bit-wise operator)
-

Definition at line 829 of file uint256_t.hpp.

-
829 {
-
830 f &= p.f;
-
831 s &= p.s;
-
832 return *this;
-
833 }
+

Definition at line 820 of file uint256_t.hpp.

+
820 {
+
821 f &= p.f;
+
822 s &= p.s;
+
823 return *this;
+
824 }
@@ -1504,8 +1504,8 @@ template<typename T, typename = typename std::enable_if<

operator () for uint256_t

Returns
true if this value is non-zero, else false
-

Definition at line 620 of file uint256_t.hpp.

-
620{ return s || f; }
+

Definition at line 611 of file uint256_t.hpp.

+
611{ return s || f; }
@@ -1549,10 +1549,10 @@ template<typename T, typename = typename std::enable_if<
Returns
multiplication of this and p, returning uint256_t integer
-

Definition at line 362 of file uint256_t.hpp.

-
362 {
-
363 return *this * uint256_t(p);
-
364 }
+

Definition at line 353 of file uint256_t.hpp.

+
353 {
+
354 return *this * uint256_t(p);
+
355 }
@@ -1588,21 +1588,21 @@ template<typename T, typename = typename std::enable_if<
Returns
multiplication of this and p, returning uint256_t integer
-

Definition at line 371 of file uint256_t.hpp.

-
371 {
-
372 uint128_t f_first(s.upper()), f_second(s.lower()), s_first(p.s.upper()),
-
373 s_second(p.s.lower());
-
374 uint128_t fi = f_first * s_first, se = f_first * s_second,
-
375 th = s_first * f_second, fo = s_second * f_second;
-
376 uint128_t tmp = se << 64, tmp2 = th << 64;
-
377 int cc = (tmp + tmp2 < tmp);
-
378 tmp += tmp2;
-
379 cc += (tmp + fo < tmp);
-
380 return {f * p.s + s * p.f + fi + se.upper() + th.upper() + cc,
-
381 tmp + fo};
-
382 }
-
uint64_t upper() const
returns upper 64-bit integer part
-
uint64_t lower() const
returns lower 64-bit integer part
+

Definition at line 362 of file uint256_t.hpp.

+
362 {
+
363 uint128_t f_first(s.upper()), f_second(s.lower()), s_first(p.s.upper()),
+
364 s_second(p.s.lower());
+
365 uint128_t fi = f_first * s_first, se = f_first * s_second,
+
366 th = s_first * f_second, fo = s_second * f_second;
+
367 uint128_t tmp = se << 64, tmp2 = th << 64;
+
368 int cc = (tmp + tmp2 < tmp);
+
369 tmp += tmp2;
+
370 cc += (tmp + fo < tmp);
+
371 return {f * p.s + s * p.f + fi + se.upper() + th.upper() + cc,
+
372 tmp + fo};
+
373 }
+
uint64_t upper() const
returns upper 64-bit integer part
+
uint64_t lower() const
returns lower 64-bit integer part
@@ -1646,10 +1646,10 @@ template<typename T, typename = typename std::enable_if<
Returns
multiplication of this and p, returning this
-

Definition at line 392 of file uint256_t.hpp.

-
392 {
-
393 return (*this *= uint256_t(p));
-
394 }
+

Definition at line 383 of file uint256_t.hpp.

+
383 {
+
384 return (*this *= uint256_t(p));
+
385 }
@@ -1685,20 +1685,20 @@ template<typename T, typename = typename std::enable_if<
Returns
multiplication of this and p, returning this
-

Definition at line 401 of file uint256_t.hpp.

-
401 {
-
402 uint128_t f_first(s.upper()), f_second(s.lower()), s_first(p.s.upper()),
-
403 s_second(p.s.lower());
-
404 uint128_t fi = f_first * s_first, se = f_first * s_second,
-
405 th = s_first * f_second, fo = s_second * f_second;
-
406 uint128_t tmp = se << 64, tmp2 = th << 64;
-
407 int cc = (tmp + tmp2 < tmp);
-
408 tmp += tmp2;
-
409 cc += (tmp + fo < tmp);
-
410 f = f * p.s + s * p.f + fi + se.upper() + th.upper() + cc;
-
411 s = tmp + fo;
-
412 return *this;
-
413 }
+

Definition at line 392 of file uint256_t.hpp.

+
392 {
+
393 uint128_t f_first(s.upper()), f_second(s.lower()), s_first(p.s.upper()),
+
394 s_second(p.s.lower());
+
395 uint128_t fi = f_first * s_first, se = f_first * s_second,
+
396 th = s_first * f_second, fo = s_second * f_second;
+
397 uint128_t tmp = se << 64, tmp2 = th << 64;
+
398 int cc = (tmp + tmp2 < tmp);
+
399 tmp += tmp2;
+
400 cc += (tmp + fo < tmp);
+
401 f = f * p.s + s * p.f + fi + se.upper() + th.upper() + cc;
+
402 s = tmp + fo;
+
403 return *this;
+
404 }
@@ -1742,11 +1742,11 @@ template<typename T, typename = typename std::enable_if<
Returns
addition of this and p, returning uint256_t integer
-

Definition at line 220 of file uint256_t.hpp.

-
220 {
-
221 bool app = s + p < s;
-
222 return uint256_t(f + app, s + p);
-
223 }
+

Definition at line 211 of file uint256_t.hpp.

+
211 {
+
212 bool app = s + p < s;
+
213 return uint256_t(f + app, s + p);
+
214 }
@@ -1782,11 +1782,11 @@ template<typename T, typename = typename std::enable_if<
Returns
addition of this and p, returning uint256_t integer
-

Definition at line 230 of file uint256_t.hpp.

-
230 {
-
231 bool app = (s + p.s < s);
-
232 return {f + app + p.f, s + p.s};
-
233 }
+

Definition at line 221 of file uint256_t.hpp.

+
221 {
+
222 bool app = (s + p.s < s);
+
223 return {f + app + p.f, s + p.s};
+
224 }
@@ -1816,11 +1816,11 @@ template<typename T, typename = typename std::enable_if<

pre-increment operator

Returns
incremented value of this.
-

Definition at line 266 of file uint256_t.hpp.

-
266 {
-
267 *this += 1;
-
268 return *this;
-
269 }
+

Definition at line 257 of file uint256_t.hpp.

+
257 {
+
258 *this += 1;
+
259 return *this;
+
260 }
@@ -1850,11 +1850,11 @@ template<typename T, typename = typename std::enable_if<

post-increment operator

Returns
incremented value of this.
-

Definition at line 275 of file uint256_t.hpp.

-
275 {
-
276 ++*this;
-
277 return *this;
-
278 }
+

Definition at line 266 of file uint256_t.hpp.

+
266 {
+
267 ++*this;
+
268 return *this;
+
269 }
@@ -1898,13 +1898,13 @@ template<typename T, typename = typename std::enable_if<
Returns
addition of this and p, returning this
-

Definition at line 243 of file uint256_t.hpp.

-
243 {
-
244 bool app = (p + s < s);
-
245 this->f += app;
-
246 this->s += p;
-
247 return *this;
-
248 }
+

Definition at line 234 of file uint256_t.hpp.

+
234 {
+
235 bool app = (p + s < s);
+
236 this->f += app;
+
237 this->s += p;
+
238 return *this;
+
239 }
@@ -1940,13 +1940,13 @@ template<typename T, typename = typename std::enable_if<
Returns
addition of this and p, returning this
-

Definition at line 255 of file uint256_t.hpp.

-
255 {
-
256 bool app = (s + p.s < s);
-
257 f = f + app + p.f;
-
258 s = s + p.s;
-
259 return *this;
-
260 }
+

Definition at line 246 of file uint256_t.hpp.

+
246 {
+
247 bool app = (s + p.s < s);
+
248 f = f + app + p.f;
+
249 s = s + p.s;
+
250 return *this;
+
251 }
@@ -1976,8 +1976,8 @@ template<typename T, typename = typename std::enable_if<

operator - using twos complement

Returns
2's complement of this.
-

Definition at line 307 of file uint256_t.hpp.

-
307{ return ~*this + uint256_t(1); }
+

Definition at line 298 of file uint256_t.hpp.

+
298{ return ~*this + uint256_t(1); }
@@ -2021,11 +2021,11 @@ template<typename T, typename = typename std::enable_if<
Returns
subtraction of this and p, returning uint256_t integer
-

Definition at line 288 of file uint256_t.hpp.

-
288 {
-
289 bool app = (p > s);
-
290 return uint256_t(f - app, s - p);
-
291 }
+

Definition at line 279 of file uint256_t.hpp.

+
279 {
+
280 bool app = (p > s);
+
281 return uint256_t(f - app, s - p);
+
282 }
@@ -2061,11 +2061,11 @@ template<typename T, typename = typename std::enable_if<
Returns
subtraction of this and p, returning uint256_t integer
-

Definition at line 298 of file uint256_t.hpp.

-
298 {
-
299 bool app = s < p.s;
-
300 return {f - p.f - app, s - p.s};
-
301 }
+

Definition at line 289 of file uint256_t.hpp.

+
289 {
+
290 bool app = s < p.s;
+
291 return {f - p.f - app, s - p.s};
+
292 }
@@ -2095,11 +2095,11 @@ template<typename T, typename = typename std::enable_if<

operator – (pre-decrement)

Returns
decremented value of this
-

Definition at line 313 of file uint256_t.hpp.

-
313 {
-
314 *this -= 1;
-
315 return *this;
-
316 }
+

Definition at line 304 of file uint256_t.hpp.

+
304 {
+
305 *this -= 1;
+
306 return *this;
+
307 }
@@ -2129,11 +2129,11 @@ template<typename T, typename = typename std::enable_if<

operator – (post-decrement)

Returns
decremented value of this
-

Definition at line 322 of file uint256_t.hpp.

-
322 {
-
323 --*this;
-
324 return *this;
-
325 }
+

Definition at line 313 of file uint256_t.hpp.

+
313 {
+
314 --*this;
+
315 return *this;
+
316 }
@@ -2177,13 +2177,13 @@ template<typename T, typename = typename std::enable_if<
Returns
subtraction of this and p, returning this
-

Definition at line 335 of file uint256_t.hpp.

-
335 {
-
336 bool app = (p > s);
-
337 f = f - app;
-
338 s = s - p;
-
339 return *this;
-
340 }
+

Definition at line 326 of file uint256_t.hpp.

+
326 {
+
327 bool app = (p > s);
+
328 f = f - app;
+
329 s = s - p;
+
330 return *this;
+
331 }
@@ -2219,13 +2219,13 @@ template<typename T, typename = typename std::enable_if<
Returns
subtraction of this and p, returning this
-

Definition at line 347 of file uint256_t.hpp.

-
347 {
-
348 bool app = s < p.s;
-
349 f = f - app - p.f;
-
350 s = s - p.s;
-
351 return *this;
-
352 }
+

Definition at line 338 of file uint256_t.hpp.

+
338 {
+
339 bool app = s < p.s;
+
340 f = f - app - p.f;
+
341 s = s - p.s;
+
342 return *this;
+
343 }
@@ -2269,12 +2269,12 @@ template<typename T, typename = typename std::enable_if<
Returns
unsigned 256-bit quotient.
-

Definition at line 458 of file uint256_t.hpp.

-
458 {
-
459 uint256_t tmp = *this;
-
460 tmp /= uint256_t(p);
-
461 return tmp;
-
462 }
+

Definition at line 449 of file uint256_t.hpp.

+
449 {
+
450 uint256_t tmp = *this;
+
451 tmp /= uint256_t(p);
+
452 return tmp;
+
453 }
@@ -2310,8 +2310,8 @@ template<typename T, typename = typename std::enable_if<
Returns
unsigned 256-bit quotient.
-

Definition at line 469 of file uint256_t.hpp.

-
469{ return divide(p).first; }
+

Definition at line 460 of file uint256_t.hpp.

+
460{ return divide(p).first; }
@@ -2355,11 +2355,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this set as unsigned 256-bit quotient.
-

Definition at line 489 of file uint256_t.hpp.

-
489 {
-
490 *this /= uint256_t(p);
-
491 return *this;
-
492 }
+

Definition at line 480 of file uint256_t.hpp.

+
480 {
+
481 *this /= uint256_t(p);
+
482 return *this;
+
483 }
@@ -2395,11 +2395,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this set as unsigned 256-bit quotient.
-

Definition at line 476 of file uint256_t.hpp.

-
476 {
-
477 *this = divide(p).first;
-
478 return *this;
-
479 }
+

Definition at line 467 of file uint256_t.hpp.

+
467 {
+
468 *this = divide(p).first;
+
469 return *this;
+
470 }
@@ -2443,10 +2443,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is less than other, else false
-

Definition at line 630 of file uint256_t.hpp.

-
630 {
-
631 return *this < uint256_t(other);
-
632 }
+

Definition at line 621 of file uint256_t.hpp.

+
621 {
+
622 return *this < uint256_t(other);
+
623 }
@@ -2482,10 +2482,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is less than other, else false
-

Definition at line 543 of file uint256_t.hpp.

-
543 {
-
544 return f < other.f || (f == other.f && s < other.s);
-
545 }
+

Definition at line 534 of file uint256_t.hpp.

+
534 {
+
535 return f < other.f || (f == other.f && s < other.s);
+
536 }
@@ -2529,16 +2529,16 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this shifted by p to left
-

Definition at line 733 of file uint256_t.hpp.

-
733 {
-
734 if (!p) {
-
735 return {this->f, this->s};
-
736 } else if (p >= 128) {
-
737 return uint256_t((this->s << (p - 128)), uint128_t(0));
-
738 }
-
739 return uint256_t((this->f << p) + (this->s >> (128 - p)),
-
740 (this->s << p));
-
741 }
+

Definition at line 724 of file uint256_t.hpp.

+
724 {
+
725 if (!p) {
+
726 return {this->f, this->s};
+
727 } else if (p >= 128) {
+
728 return uint256_t((this->s << (p - 128)), uint128_t(0));
+
729 }
+
730 return uint256_t((this->f << p) + (this->s >> (128 - p)),
+
731 (this->s << p));
+
732 }
@@ -2582,19 +2582,19 @@ template<typename T, typename = typename std::enable_if<
Returns
this shifted by p to left
-

Definition at line 751 of file uint256_t.hpp.

-
751 {
-
752 if (p) {
-
753 if (p >= 128) {
-
754 this->f = (this->s << (p - 128));
-
755 this->s = uint128_t(0);
-
756 } else {
-
757 f = ((this->s >> (128 - p)) + (this->f << p));
-
758 s = (this->s << p);
-
759 }
-
760 }
-
761 return *this;
-
762 }
+

Definition at line 742 of file uint256_t.hpp.

+
742 {
+
743 if (p) {
+
744 if (p >= 128) {
+
745 this->f = (this->s << (p - 128));
+
746 this->s = uint128_t(0);
+
747 } else {
+
748 f = ((this->s >> (128 - p)) + (this->f << p));
+
749 s = (this->s << p);
+
750 }
+
751 }
+
752 return *this;
+
753 }
@@ -2638,10 +2638,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is less than or equal to other, else false
-

Definition at line 642 of file uint256_t.hpp.

-
642 {
-
643 return *this <= uint256_t(other);
-
644 }
+

Definition at line 633 of file uint256_t.hpp.

+
633 {
+
634 return *this <= uint256_t(other);
+
635 }
@@ -2677,10 +2677,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is less than or equal to other, else false
-

Definition at line 552 of file uint256_t.hpp.

-
552 {
-
553 return f < other.f || (f == other.f && s <= other.s);
-
554 }
+

Definition at line 543 of file uint256_t.hpp.

+
543 {
+
544 return f < other.f || (f == other.f && s <= other.s);
+
545 }
@@ -2716,11 +2716,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this pointer with it's value equal to p
-

Definition at line 202 of file uint256_t.hpp.

-
202 {
-
203 __get_integer_from_string(p);
-
204 return *this;
-
205 }
+

Definition at line 193 of file uint256_t.hpp.

+
193 {
+ +
195 return *this;
+
196 }
@@ -2764,11 +2764,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this pointer with it's value equal to p
-

Definition at line 192 of file uint256_t.hpp.

-
192 {
-
193 this->s = p;
-
194 return *this;
-
195 }
+

Definition at line 183 of file uint256_t.hpp.

+
183 {
+
184 this->s = p;
+
185 return *this;
+
186 }
@@ -2846,10 +2846,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is equal to other, else false
-

Definition at line 678 of file uint256_t.hpp.

-
678 {
-
679 return *this == uint256_t(other);
-
680 }
+

Definition at line 669 of file uint256_t.hpp.

+
669 {
+
670 return *this == uint256_t(other);
+
671 }
@@ -2885,10 +2885,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is equal than other, else false
-

Definition at line 579 of file uint256_t.hpp.

-
579 {
-
580 return f == other.f && s == other.s;
-
581 }
+

Definition at line 570 of file uint256_t.hpp.

+
570 {
+
571 return f == other.f && s == other.s;
+
572 }
@@ -2932,10 +2932,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is greater than other, else false
-

Definition at line 654 of file uint256_t.hpp.

-
654 {
-
655 return *this > uint256_t(other);
-
656 }
+

Definition at line 645 of file uint256_t.hpp.

+
645 {
+
646 return *this > uint256_t(other);
+
647 }
@@ -2971,10 +2971,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is greater than other, else false
-

Definition at line 561 of file uint256_t.hpp.

-
561 {
-
562 return f > other.f || (f == other.f && s > other.s);
-
563 }
+

Definition at line 552 of file uint256_t.hpp.

+
552 {
+
553 return f > other.f || (f == other.f && s > other.s);
+
554 }
@@ -3018,10 +3018,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is greater than or equal other, else false
-

Definition at line 666 of file uint256_t.hpp.

-
666 {
-
667 return *this >= uint256_t(other);
-
668 }
+

Definition at line 657 of file uint256_t.hpp.

+
657 {
+
658 return *this >= uint256_t(other);
+
659 }
@@ -3057,10 +3057,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is greater than or equal than other, else false
-

Definition at line 570 of file uint256_t.hpp.

-
570 {
-
571 return (f > other.f) || (f == other.f && s >= other.s);
-
572 }
+

Definition at line 561 of file uint256_t.hpp.

+
561 {
+
562 return (f > other.f) || (f == other.f && s >= other.s);
+
563 }
@@ -3104,16 +3104,16 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this shifted by p to right
-

Definition at line 772 of file uint256_t.hpp.

-
772 {
-
773 if (!p) {
-
774 return {this->f, this->s};
-
775 } else if (p >= 128) {
-
776 return uint256_t(uint128_t(0), (this->f >> (p - 128)));
-
777 }
-
778 return uint256_t((this->f >> p),
-
779 (this->s >> p) + (this->f << (128 - p)));
-
780 }
+

Definition at line 763 of file uint256_t.hpp.

+
763 {
+
764 if (!p) {
+
765 return {this->f, this->s};
+
766 } else if (p >= 128) {
+
767 return uint256_t(uint128_t(0), (this->f >> (p - 128)));
+
768 }
+
769 return uint256_t((this->f >> p),
+
770 (this->s >> p) + (this->f << (128 - p)));
+
771 }
@@ -3157,19 +3157,19 @@ template<typename T, typename = typename std::enable_if<
Returns
this shifted by p to right
-

Definition at line 790 of file uint256_t.hpp.

-
790 {
-
791 if (p) {
-
792 if (p >= 128) {
-
793 f = uint128_t(0);
-
794 s = (this->f >> (p - 128));
-
795 } else {
-
796 s = (this->s >> p) + (this->f << (128 - p));
-
797 f = (this->f >> p);
-
798 }
-
799 }
-
800 return *this;
-
801 }
+

Definition at line 781 of file uint256_t.hpp.

+
781 {
+
782 if (p) {
+
783 if (p >= 128) {
+
784 f = uint128_t(0);
+
785 s = (this->f >> (p - 128));
+
786 } else {
+
787 s = (this->s >> p) + (this->f << (128 - p));
+
788 f = (this->f >> p);
+
789 }
+
790 }
+
791 return *this;
+
792 }
@@ -3213,10 +3213,10 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this ^ p (^ is bit-wise XOR operator)
-

Definition at line 901 of file uint256_t.hpp.

-
901 {
-
902 return uint256_t(f, s ^ p);
-
903 }
+

Definition at line 892 of file uint256_t.hpp.

+
892 {
+
893 return uint256_t(f, s ^ p);
+
894 }
@@ -3252,10 +3252,10 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this ^ p (^ is bit-wise XOR operator)
-

Definition at line 910 of file uint256_t.hpp.

-
910 {
-
911 return {this->f ^ p.f, this->s ^ p.s};
-
912 }
+

Definition at line 901 of file uint256_t.hpp.

+
901 {
+
902 return {this->f ^ p.f, this->s ^ p.s};
+
903 }
@@ -3299,11 +3299,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this = this ^ p (^ is bit-wise XOR operator)
-

Definition at line 933 of file uint256_t.hpp.

-
933 {
-
934 s ^= p;
-
935 return *this;
-
936 }
+

Definition at line 924 of file uint256_t.hpp.

+
924 {
+
925 s ^= p;
+
926 return *this;
+
927 }
@@ -3339,12 +3339,12 @@ template<typename T, typename = typename std::enable_if<
Returns
this = this ^ p (^ is bit-wise XOR operator)
-

Definition at line 919 of file uint256_t.hpp.

-
919 {
-
920 f ^= p.f;
-
921 s ^= p.s;
-
922 return *this;
-
923 }
+

Definition at line 910 of file uint256_t.hpp.

+
910 {
+
911 f ^= p.f;
+
912 s ^= p.s;
+
913 return *this;
+
914 }
@@ -3388,10 +3388,10 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this | p (| is bit-wise operator)
-

Definition at line 856 of file uint256_t.hpp.

-
856 {
-
857 return *this | uint256_t(p);
-
858 }
+

Definition at line 847 of file uint256_t.hpp.

+
847 {
+
848 return *this | uint256_t(p);
+
849 }
@@ -3427,10 +3427,10 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this | p (| is bit-wise OR operator)
-

Definition at line 865 of file uint256_t.hpp.

-
865 {
-
866 return {this->f | p.f, this->s | p.s};
-
867 }
+

Definition at line 856 of file uint256_t.hpp.

+
856 {
+
857 return {this->f | p.f, this->s | p.s};
+
858 }
@@ -3474,11 +3474,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this = this | p (| is bit-wise OR operator)
-

Definition at line 877 of file uint256_t.hpp.

-
877 {
-
878 s |= p;
-
879 return *this;
-
880 }
+

Definition at line 868 of file uint256_t.hpp.

+
868 {
+
869 s |= p;
+
870 return *this;
+
871 }
@@ -3514,12 +3514,12 @@ template<typename T, typename = typename std::enable_if<
Returns
this = this | p (| is bit-wise OR operator)
-

Definition at line 887 of file uint256_t.hpp.

-
887 {
-
888 f |= p.f;
-
889 s |= p.s;
-
890 return *this;
-
891 }
+

Definition at line 878 of file uint256_t.hpp.

+
878 {
+
879 f |= p.f;
+
880 s |= p.s;
+
881 return *this;
+
882 }
@@ -3563,10 +3563,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is either one of the values are non-zero, else false
-

Definition at line 715 of file uint256_t.hpp.

-
715 {
-
716 return (s || f) || (b);
-
717 }
+

Definition at line 706 of file uint256_t.hpp.

+
706 {
+
707 return (s || f) || (b);
+
708 }
@@ -3602,10 +3602,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if one of the values are not zero, else false
-

Definition at line 612 of file uint256_t.hpp.

-
612 {
-
613 return (s || f) || (b.s || b.f);
-
614 }
+

Definition at line 603 of file uint256_t.hpp.

+
603 {
+
604 return (s || f) || (b.s || b.f);
+
605 }
@@ -3635,8 +3635,8 @@ template<typename T, typename = typename std::enable_if<

operator ~ for uint256_t

Returns
1's complement of this number
-

Definition at line 723 of file uint256_t.hpp.

-
723{ return {~f, ~s}; }
+

Definition at line 714 of file uint256_t.hpp.

+
714{ return {~f, ~s}; }
@@ -3666,8 +3666,8 @@ template<typename T, typename = typename std::enable_if<

returns upper 128-bit integer part

Returns
returns upper 128-bit integer part
-

Definition at line 175 of file uint256_t.hpp.

-
175{ return f; }
+

Definition at line 166 of file uint256_t.hpp.

+
166{ return f; }
@@ -3710,33 +3710,33 @@ template<typename T, typename = typename std::enable_if<
Returns
op, ostream object.
-

Definition at line 947 of file uint256_t.hpp.

-
947 {
-
948 if (!p.f) {
-
949 op << p.s;
-
950 } else {
-
951 std::string out = "0", p_2 = "1";
-
952 uint128_t L(1);
-
953 for (uint64_t i = 0; i < 128; ++i) {
-
954 if ((p.s & L)) {
-
955 out = add(out, p_2);
-
956 }
-
957 p_2 = add(p_2, p_2);
-
958 L <<= 1;
-
959 }
-
960 L = uint128_t(1);
-
961 for (int i = 0; i < 128; ++i) {
-
962 if ((p.f & L)) {
-
963 out = add(out, p_2);
-
964 }
-
965 p_2 = add(p_2, p_2);
-
966 L <<= 1;
-
967 }
-
968 op << out;
-
969 }
-
970 return op;
-
971 }
-
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:38
+

Definition at line 938 of file uint256_t.hpp.

+
938 {
+
939 if (!p.f) {
+
940 op << p.s;
+
941 } else {
+
942 std::string out = "0", p_2 = "1";
+
943 uint128_t L(1);
+
944 for (uint64_t i = 0; i < 128; ++i) {
+
945 if ((p.s & L)) {
+
946 out = add(out, p_2);
+
947 }
+
948 p_2 = add(p_2, p_2);
+
949 L <<= 1;
+
950 }
+
951 L = uint128_t(1);
+
952 for (int i = 0; i < 128; ++i) {
+
953 if ((p.f & L)) {
+
954 out = add(out, p_2);
+
955 }
+
956 p_2 = add(p_2, p_2);
+
957 L <<= 1;
+
958 }
+
959 op << out;
+
960 }
+
961 return op;
+
962 }
+
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:31
@@ -3761,7 +3761,7 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 34 of file uint256_t.hpp.

+

Definition at line 25 of file uint256_t.hpp.

@@ -3785,7 +3785,7 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 34 of file uint256_t.hpp.

+

Definition at line 25 of file uint256_t.hpp.

diff --git a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.map b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.map deleted file mode 100644 index df590ca59..000000000 --- a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.md5 b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.md5 deleted file mode 100644 index 10a023df0..000000000 --- a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -d8e72a5cac00bd09a7e428aa97dcd5b4 \ No newline at end of file diff --git a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg deleted file mode 100644 index 9c396d273..000000000 --- a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg +++ /dev/null @@ -1,59 +0,0 @@ - - - - - - - - - - - - -std::is_integral< uint128_t > - - -Node1 - - -std::is_integral< uint128_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - - - - - diff --git a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph_org.svg b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph_org.svg deleted file mode 100644 index f86e30687..000000000 --- a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph_org.svg +++ /dev/null @@ -1,39 +0,0 @@ - - - - - - -std::is_integral< uint128_t > - - -Node1 - - -std::is_integral< uint128_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - diff --git a/d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html b/d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html deleted file mode 100644 index 3f74d4fc8..000000000 --- a/d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html +++ /dev/null @@ -1,174 +0,0 @@ - - - - - - - - -TheAlgorithms/C++: std::is_integral< uint128_t > Struct Reference - - - - - - - - - - - - - - - - - - - - -
-
- - - - - - - -
-
TheAlgorithms/C++ 1.0.0 -
-
All the algorithms implemented in C++
-
-
- - - - - - - - - -
-
- -
-
-
- -
-
- -
-
- - -
-
-
-
-
-
Loading...
-
Searching...
-
No Matches
-
-
-
-
- -
-
std::is_integral< uint128_t > Struct Reference
-
-
-
-Inheritance diagram for std::is_integral< uint128_t >:
-
-
-
[legend]
-
-Collaboration diagram for std::is_integral< uint128_t >:
-
-
-
[legend]
-

Detailed Description

-
-

Definition at line 25 of file uint128_t.hpp.

-

The documentation for this struct was generated from the following file: -
-
- -
- - - - diff --git a/d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html b/d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html deleted file mode 100644 index a9599a230..000000000 --- a/d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html +++ /dev/null @@ -1,174 +0,0 @@ - - - - - - - - -TheAlgorithms/C++: std::is_arithmetic< uint128_t > Struct Reference - - - - - - - - - - - - - - - - - - - - -
-
- - - - - - - -
-
TheAlgorithms/C++ 1.0.0 -
-
All the algorithms implemented in C++
-
-
- - - - - - - - - -
-
- -
-
-
- -
-
- -
-
- - -
-
-
-
-
-
Loading...
-
Searching...
-
No Matches
-
-
-
-
- -
-
std::is_arithmetic< uint128_t > Struct Reference
-
-
-
-Inheritance diagram for std::is_arithmetic< uint128_t >:
-
-
-
[legend]
-
-Collaboration diagram for std::is_arithmetic< uint128_t >:
-
-
-
[legend]
-

Detailed Description

-
-

Definition at line 27 of file uint128_t.hpp.

-

The documentation for this struct was generated from the following file: -
-
- -
- - - - diff --git a/d3/d53/mo_8cpp_source.html b/d3/d53/mo_8cpp_source.html index bd1b6ef82..f955dfdcb 100644 --- a/d3/d53/mo_8cpp_source.html +++ b/d3/d53/mo_8cpp_source.html @@ -192,7 +192,7 @@ document.addEventListener('DOMContentLoaded',() => { initNavTree('d3/d53/mo_8cpp
67}
main
int main()
Main function.
Definition generate_parentheses.cpp:110
query
Definition mo.cpp:9
-
add
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:38
+
add
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:31
diff --git a/d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html b/d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html deleted file mode 100644 index 166bd25e9..000000000 --- a/d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html +++ /dev/null @@ -1,174 +0,0 @@ - - - - - - - - -TheAlgorithms/C++: std::is_unsigned< uint128_t > Struct Reference - - - - - - - - - - - - - - - - - - - - -
-
- - - - - - - -
-
TheAlgorithms/C++ 1.0.0 -
-
All the algorithms implemented in C++
-
-
- - - - - - - - - -
-
- -
-
-
- -
-
- -
-
- - -
-
-
-
-
-
Loading...
-
Searching...
-
No Matches
-
-
-
-
- -
-
std::is_unsigned< uint128_t > Struct Reference
-
-
-
-Inheritance diagram for std::is_unsigned< uint128_t >:
-
-
-
[legend]
-
-Collaboration diagram for std::is_unsigned< uint128_t >:
-
-
-
[legend]
-

Detailed Description

-
-

Definition at line 29 of file uint128_t.hpp.

-

The documentation for this struct was generated from the following file: -
-
- -
- - - - diff --git a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.map b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.map deleted file mode 100644 index df590ca59..000000000 --- a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.md5 b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.md5 deleted file mode 100644 index 10a023df0..000000000 --- a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -d8e72a5cac00bd09a7e428aa97dcd5b4 \ No newline at end of file diff --git a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.svg b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.svg deleted file mode 100644 index 9c396d273..000000000 --- a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.svg +++ /dev/null @@ -1,59 +0,0 @@ - - - - - - - - - - - - -std::is_integral< uint128_t > - - -Node1 - - -std::is_integral< uint128_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - - - - - diff --git a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph_org.svg b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph_org.svg deleted file mode 100644 index f86e30687..000000000 --- a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph_org.svg +++ /dev/null @@ -1,39 +0,0 @@ - - - - - - -std::is_integral< uint128_t > - - -Node1 - - -std::is_integral< uint128_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - diff --git a/d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html b/d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html deleted file mode 100644 index 110e16952..000000000 --- a/d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html +++ /dev/null @@ -1,174 +0,0 @@ - - - - - - - - -TheAlgorithms/C++: std::is_integral< uint256_t > Struct Reference - - - - - - - - - - - - - - - - - - - - -
-
- - - - - - - -
-
TheAlgorithms/C++ 1.0.0 -
-
All the algorithms implemented in C++
-
-
- - - - - - - - - -
-
- -
-
-
- -
-
- -
-
- - -
-
-
-
-
-
Loading...
-
Searching...
-
No Matches
-
-
-
-
- -
-
std::is_integral< uint256_t > Struct Reference
-
-
-
-Inheritance diagram for std::is_integral< uint256_t >:
-
-
-
[legend]
-
-Collaboration diagram for std::is_integral< uint256_t >:
-
-
-
[legend]
-

Detailed Description

-
-

Definition at line 21 of file uint256_t.hpp.

-

The documentation for this struct was generated from the following file: -
-
- -
- - - - diff --git a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.map b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.map deleted file mode 100644 index 08b79302f..000000000 --- a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.md5 b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.md5 deleted file mode 100644 index 6915f6ced..000000000 --- a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -5da2e6ca4e559ac9044af5cacb5a1e60 \ No newline at end of file diff --git a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.svg b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.svg deleted file mode 100644 index 60685f49d..000000000 --- a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.svg +++ /dev/null @@ -1,59 +0,0 @@ - - - - - - - - - - - - -std::is_unsigned< uint256_t > - - -Node1 - - -std::is_unsigned< uint256_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - - - - - diff --git a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph_org.svg b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph_org.svg deleted file mode 100644 index 7d086d616..000000000 --- a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph_org.svg +++ /dev/null @@ -1,39 +0,0 @@ - - - - - - -std::is_unsigned< uint256_t > - - -Node1 - - -std::is_unsigned< uint256_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - diff --git a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.map b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.map deleted file mode 100644 index 91ffb9f25..000000000 --- a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.md5 b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.md5 deleted file mode 100644 index 1a663bd01..000000000 --- a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -bbaa537b5da9cdc9be75d53307994ca9 \ No newline at end of file diff --git a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.svg b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.svg deleted file mode 100644 index 9ef9b06a9..000000000 --- a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.svg +++ /dev/null @@ -1,59 +0,0 @@ - - - - - - - - - - - - -std::is_integral< uint256_t > - - -Node1 - - -std::is_integral< uint256_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - - - - - diff --git a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph_org.svg b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph_org.svg deleted file mode 100644 index a94d4c20f..000000000 --- a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph_org.svg +++ /dev/null @@ -1,39 +0,0 @@ - - - - - - -std::is_integral< uint256_t > - - -Node1 - - -std::is_integral< uint256_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - diff --git a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.map b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.map deleted file mode 100644 index edbb18852..000000000 --- a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.md5 b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.md5 deleted file mode 100644 index 3fc38ad4b..000000000 --- a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -3d20965ba8a5558c00e18791af7f0bdd \ No newline at end of file diff --git a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.svg b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.svg deleted file mode 100644 index ea1619e5d..000000000 --- a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.svg +++ /dev/null @@ -1,60 +0,0 @@ - - - - - - - - - - - - -std::is_arithmetic< uint128_t > - - -Node1 - - -std::is_arithmetic -< uint128_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - - - - - diff --git a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph_org.svg b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph_org.svg deleted file mode 100644 index e9adafba9..000000000 --- a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph_org.svg +++ /dev/null @@ -1,40 +0,0 @@ - - - - - - -std::is_arithmetic< uint128_t > - - -Node1 - - -std::is_arithmetic -< uint128_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - diff --git a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.map b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.map deleted file mode 100644 index 076a0ee16..000000000 --- a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.md5 b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.md5 deleted file mode 100644 index a5d3325c5..000000000 --- a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -a8f7d2e6c774fe67f34c2f81999b394c \ No newline at end of file diff --git a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.svg b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.svg deleted file mode 100644 index e83676f2d..000000000 --- a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.svg +++ /dev/null @@ -1,59 +0,0 @@ - - - - - - - - - - - - -std::is_unsigned< uint128_t > - - -Node1 - - -std::is_unsigned< uint128_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - - - - - diff --git a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph_org.svg b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph_org.svg deleted file mode 100644 index eee5d38e0..000000000 --- a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph_org.svg +++ /dev/null @@ -1,39 +0,0 @@ - - - - - - -std::is_unsigned< uint128_t > - - -Node1 - - -std::is_unsigned< uint128_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - diff --git a/da/d41/uint128__t_8hpp.html b/da/d41/uint128__t_8hpp.html index 084e86c79..52b4dda36 100644 --- a/da/d41/uint128__t_8hpp.html +++ b/da/d41/uint128__t_8hpp.html @@ -157,9 +157,6 @@ This graph shows which files directly or indirectly include this file: - - -

Classes

struct  std::is_integral< uint128_t >
struct  std::is_arithmetic< uint128_t >
struct  std::is_unsigned< uint128_t >
class  uint128_t
 class for 128-bit unsigned integer More...
@@ -260,25 +257,25 @@ Functions
Returns
string denoting the addition of both the strings
-

Definition at line 38 of file uint128_t.hpp.

-
38 {
-
39 std::string third;
-
40 int16_t sum = 0, carry = 0;
-
41 for (int32_t i = static_cast<int32_t>(first.size()) - 1,
-
42 j = static_cast<int32_t>(second.size()) - 1;
-
43 i >= 0 || j >= 0; --i, --j) {
-
44 sum = ((i >= 0 ? first[i] - '0' : 0) + (j >= 0 ? second[j] - '0' : 0) +
-
45 carry);
-
46 carry = sum / 10;
-
47 sum %= 10;
-
48 third.push_back(sum + '0');
-
49 }
-
50 if (carry) {
-
51 third.push_back('1');
-
52 }
-
53 std::reverse(third.begin(), third.end());
-
54 return third;
-
55}
+

Definition at line 31 of file uint128_t.hpp.

+
31 {
+
32 std::string third;
+
33 int16_t sum = 0, carry = 0;
+
34 for (int32_t i = static_cast<int32_t>(first.size()) - 1,
+
35 j = static_cast<int32_t>(second.size()) - 1;
+
36 i >= 0 || j >= 0; --i, --j) {
+
37 sum = ((i >= 0 ? first[i] - '0' : 0) + (j >= 0 ? second[j] - '0' : 0) +
+
38 carry);
+
39 carry = sum / 10;
+
40 sum %= 10;
+
41 third.push_back(sum + '0');
+
42 }
+
43 if (carry) {
+
44 third.push_back('1');
+
45 }
+
46 std::reverse(third.begin(), third.end());
+
47 return third;
+
48}
T sum(const std::vector< std::valarray< T > > &A)
@@ -312,11 +309,11 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1079 of file uint128_t.hpp.

-
1079 {
-
1080 return uint128_t(p) != q;
-
1081}
-
class for 128-bit unsigned integer
Definition uint128_t.hpp:60
+

Definition at line 1072 of file uint128_t.hpp.

+
1072 {
+
1073 return uint128_t(p) != q;
+
1074}
+
class for 128-bit unsigned integer
Definition uint128_t.hpp:53
@@ -349,10 +346,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1034 of file uint128_t.hpp.

-
1034 {
-
1035 return uint128_t(p) % q;
-
1036}
+

Definition at line 1027 of file uint128_t.hpp.

+
1027 {
+
1028 return uint128_t(p) % q;
+
1029}
@@ -385,10 +382,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1041 of file uint128_t.hpp.

-
1041 {
-
1042 return uint128_t(p) & q;
-
1043}
+

Definition at line 1034 of file uint128_t.hpp.

+
1034 {
+
1035 return uint128_t(p) & q;
+
1036}
@@ -421,10 +418,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1060 of file uint128_t.hpp.

-
1060 {
-
1061 return uint128_t(p) && q;
-
1062}
+

Definition at line 1053 of file uint128_t.hpp.

+
1053 {
+
1054 return uint128_t(p) && q;
+
1055}
@@ -457,10 +454,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1022 of file uint128_t.hpp.

-
1022 {
-
1023 return uint128_t(p) * q;
-
1024}
+

Definition at line 1015 of file uint128_t.hpp.

+
1015 {
+
1016 return uint128_t(p) * q;
+
1017}
@@ -493,10 +490,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1010 of file uint128_t.hpp.

-
1010 {
-
1011 return uint128_t(p) + q;
-
1012}
+

Definition at line 1003 of file uint128_t.hpp.

+
1003 {
+
1004 return uint128_t(p) + q;
+
1005}
@@ -529,10 +526,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1016 of file uint128_t.hpp.

-
1016 {
-
1017 return uint128_t(p) - q;
-
1018}
+

Definition at line 1009 of file uint128_t.hpp.

+
1009 {
+
1010 return uint128_t(p) - q;
+
1011}
@@ -565,10 +562,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1028 of file uint128_t.hpp.

-
1028 {
-
1029 return uint128_t(p) / q;
-
1030}
+

Definition at line 1021 of file uint128_t.hpp.

+
1021 {
+
1022 return uint128_t(p) / q;
+
1023}
@@ -601,10 +598,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1085 of file uint128_t.hpp.

-
1085 {
-
1086 return uint128_t(p) < q;
-
1087}
+

Definition at line 1078 of file uint128_t.hpp.

+
1078 {
+
1079 return uint128_t(p) < q;
+
1080}
@@ -637,10 +634,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1091 of file uint128_t.hpp.

-
1091 {
-
1092 return uint128_t(p) <= q;
-
1093}
+

Definition at line 1084 of file uint128_t.hpp.

+
1084 {
+
1085 return uint128_t(p) <= q;
+
1086}
@@ -673,10 +670,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1073 of file uint128_t.hpp.

-
1073 {
-
1074 return uint128_t(p) == q;
-
1075}
+

Definition at line 1066 of file uint128_t.hpp.

+
1066 {
+
1067 return uint128_t(p) == q;
+
1068}
@@ -709,10 +706,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1097 of file uint128_t.hpp.

-
1097 {
-
1098 return uint128_t(p) > q;
-
1099}
+

Definition at line 1090 of file uint128_t.hpp.

+
1090 {
+
1091 return uint128_t(p) > q;
+
1092}
@@ -745,10 +742,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1103 of file uint128_t.hpp.

-
1103 {
-
1104 return uint128_t(p) >= q;
-
1105}
+

Definition at line 1096 of file uint128_t.hpp.

+
1096 {
+
1097 return uint128_t(p) >= q;
+
1098}
@@ -781,10 +778,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1053 of file uint128_t.hpp.

-
1053 {
-
1054 return uint128_t(p) ^ q;
-
1055}
+

Definition at line 1046 of file uint128_t.hpp.

+
1046 {
+
1047 return uint128_t(p) ^ q;
+
1048}
@@ -817,10 +814,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1047 of file uint128_t.hpp.

-
1047 {
-
1048 return uint128_t(p) | q;
-
1049}
+

Definition at line 1040 of file uint128_t.hpp.

+
1040 {
+
1041 return uint128_t(p) | q;
+
1042}
@@ -853,10 +850,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1066 of file uint128_t.hpp.

-
1066 {
-
1067 return uint128_t(p) || q;
-
1068}
+

Definition at line 1059 of file uint128_t.hpp.

+
1059 {
+
1060 return uint128_t(p) || q;
+
1061}
diff --git a/da/d41/uint128__t_8hpp.js b/da/d41/uint128__t_8hpp.js index 32c164ec5..a9f51c81d 100644 --- a/da/d41/uint128__t_8hpp.js +++ b/da/d41/uint128__t_8hpp.js @@ -1,8 +1,5 @@ var uint128__t_8hpp = [ - [ "std::is_integral< uint128_t >", "d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html", null ], - [ "std::is_arithmetic< uint128_t >", "d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html", null ], - [ "std::is_unsigned< uint128_t >", "d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html", null ], [ "uint128_t", "db/d9a/classuint128__t.html", "db/d9a/classuint128__t" ], [ "CIPHERS_UINT128_T_HPP_", "da/d41/uint128__t_8hpp.html#acce684d03a24f9c13a9ed36de6d24a57", null ], [ "add", "da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3", null ] diff --git a/da/d41/uint128__t_8hpp_source.html b/da/d41/uint128__t_8hpp_source.html index 4750b7303..95b0aa981 100644 --- a/da/d41/uint128__t_8hpp_source.html +++ b/da/d41/uint128__t_8hpp_source.html @@ -125,9 +125,9 @@ document.addEventListener('DOMContentLoaded',() => { initNavTree('da/d41/uint128
9
10#include <algorithm>
11#include <cstdint>
-
12#include <ostream>
-
13#include <string>
-
14#include <utility>
+
12#include <ostream>
+
13#include <string>
+
14#include <utility>
15
16#ifdef _MSC_VER
17#include <intrin.h>
@@ -136,876 +136,869 @@ document.addEventListener('DOMContentLoaded',() => { initNavTree('da/d41/uint128
20#ifndef CIPHERS_UINT128_T_HPP_
21#define CIPHERS_UINT128_T_HPP_
22class uint128_t;
-
23
-
24template <>
-
25struct std::is_integral<uint128_t> : std::true_type {};
-
26template <>
-
27struct std::is_arithmetic<uint128_t> : std::true_type {};
-
28template <>
-
29struct std::is_unsigned<uint128_t> : std::true_type {};
-
30
-
-
38std::string add(const std::string &first, const std::string &second) {
-
39 std::string third;
-
40 int16_t sum = 0, carry = 0;
-
41 for (int32_t i = static_cast<int32_t>(first.size()) - 1,
-
42 j = static_cast<int32_t>(second.size()) - 1;
-
43 i >= 0 || j >= 0; --i, --j) {
-
44 sum = ((i >= 0 ? first[i] - '0' : 0) + (j >= 0 ? second[j] - '0' : 0) +
-
45 carry);
-
46 carry = sum / 10;
-
47 sum %= 10;
-
48 third.push_back(sum + '0');
-
49 }
-
50 if (carry) {
-
51 third.push_back('1');
-
52 }
-
53 std::reverse(third.begin(), third.end());
-
54 return third;
-
55}
+
23
+
+
31std::string add(const std::string &first, const std::string &second) {
+
32 std::string third;
+
33 int16_t sum = 0, carry = 0;
+
34 for (int32_t i = static_cast<int32_t>(first.size()) - 1,
+
35 j = static_cast<int32_t>(second.size()) - 1;
+
36 i >= 0 || j >= 0; --i, --j) {
+
37 sum = ((i >= 0 ? first[i] - '0' : 0) + (j >= 0 ? second[j] - '0' : 0) +
+
38 carry);
+
39 carry = sum / 10;
+
40 sum %= 10;
+
41 third.push_back(sum + '0');
+
42 }
+
43 if (carry) {
+
44 third.push_back('1');
+
45 }
+
46 std::reverse(third.begin(), third.end());
+
47 return third;
+
48}
-
56
-
-
60class uint128_t {
-
61 uint64_t f{}, s{};
-
62
-
-
70 void __get_integer_from_string(const std::string &str) {
-
71 this->f = this->s = 0;
-
72 if (str.size() > 1 && str[1] == 'x') { // if hexadecimal
-
73 for (auto i = 2; i < str.size(); ++i) {
-
74 *this *= 16LL;
-
75 if (str[i] >= '0' && str[i] <= '9') {
-
76 *this += (str[i] - '0');
-
77 } else if (str[i] >= 'A' && str[i] <= 'F') {
-
78 *this += (str[i] - 'A' + 10);
-
79 } else if (str[i] >= 'a' && str[i] <= 'f') {
-
80 *this += (str[i] - 'a' + 10);
-
81 }
-
82 }
-
83 } else { // if decimal
-
84 for (auto &x : str) {
-
85 *this *= 10LL;
-
86 *this += (x - '0');
-
87 }
-
88 }
-
89 }
+
49
+
+
53class uint128_t {
+
54 uint64_t f{}, s{};
+
55
+
+
63 void __get_integer_from_string(const std::string &str) {
+
64 this->f = this->s = 0;
+
65 if (str.size() > 1 && str[1] == 'x') { // if hexadecimal
+
66 for (auto i = 2; i < str.size(); ++i) {
+
67 *this *= 16LL;
+
68 if (str[i] >= '0' && str[i] <= '9') {
+
69 *this += (str[i] - '0');
+
70 } else if (str[i] >= 'A' && str[i] <= 'F') {
+
71 *this += (str[i] - 'A' + 10);
+
72 } else if (str[i] >= 'a' && str[i] <= 'f') {
+
73 *this += (str[i] - 'a' + 10);
+
74 }
+
75 }
+
76 } else { // if decimal
+
77 for (auto &x : str) {
+
78 *this *= 10LL;
+
79 *this += (x - '0');
+
80 }
+
81 }
+
82 }
-
90
-
91 public:
-
92 uint128_t() = default;
-
93
-
99 template <typename T, typename = typename std::enable_if<
-
100 std::is_integral<T>::value, T>::type>
-
101 explicit uint128_t(T low) : s(low) {}
-
102
-
-
107 explicit uint128_t(const std::string &str) {
- -
109 }
+
83
+
84 public:
+
85 uint128_t() = default;
+
86
+
92 template <typename T, typename = typename std::enable_if<
+
93 std::is_integral<T>::value, T>::type>
+
94 explicit uint128_t(T low) : s(low) {}
+
95
+
+
100 explicit uint128_t(const std::string &str) {
+ +
102 }
+
103
+
109 uint128_t(const uint64_t high, const uint64_t low) : f(high), s(low) {}
110
-
116 uint128_t(const uint64_t high, const uint64_t low) : f(high), s(low) {}
-
117
-
122 uint128_t(const uint128_t &num) = default;
-
123
-
128 uint128_t(uint128_t &&num) noexcept : f(num.f), s(num.s) {}
-
129
-
133 ~uint128_t() = default;
-
134
-
-
140 inline uint32_t _lez() {
-
141#ifndef _MSC_VER
-
142 if (f) {
-
143 return __builtin_clzll(f);
-
144 }
-
145 return 64 + __builtin_clzll(s);
-
146#else
-
147 unsigned long r = 0;
-
148 _BitScanForward64(&r, f);
-
149 if (r == 64) {
-
150 unsigned long l = 0;
-
151 _BitScanForward64(&l, s);
-
152 return 64 + l;
-
153 }
-
154 return r;
-
155#endif
-
156 }
+
115 uint128_t(const uint128_t &num) = default;
+
116
+
121 uint128_t(uint128_t &&num) noexcept : f(num.f), s(num.s) {}
+
122
+
126 ~uint128_t() = default;
+
127
+
+
133 inline uint32_t _lez() {
+
134#ifndef _MSC_VER
+
135 if (f) {
+
136 return __builtin_clzll(f);
+
137 }
+
138 return 64 + __builtin_clzll(s);
+
139#else
+
140 unsigned long r = 0;
+
141 _BitScanForward64(&r, f);
+
142 if (r == 64) {
+
143 unsigned long l = 0;
+
144 _BitScanForward64(&l, s);
+
145 return 64 + l;
+
146 }
+
147 return r;
+
148#endif
+
149 }
-
157
-
-
163 inline uint32_t _trz() {
-
164#ifndef _MSC_VER
-
165 if (f) {
-
166 return __builtin_ctzll(f);
-
167 }
-
168 return 64 + __builtin_ctzll(s);
-
169#else
-
170 unsigned long r = 0;
-
171 _BitScanReverse64(&r, s);
-
172 if (r == 64) {
-
173 unsigned long l = 0;
-
174 _BitScanReverse64(&l, f);
-
175 return 64 + l;
-
176 }
-
177 return r;
-
178#endif
-
179 }
+
150
+
+
156 inline uint32_t _trz() {
+
157#ifndef _MSC_VER
+
158 if (f) {
+
159 return __builtin_ctzll(f);
+
160 }
+
161 return 64 + __builtin_ctzll(s);
+
162#else
+
163 unsigned long r = 0;
+
164 _BitScanReverse64(&r, s);
+
165 if (r == 64) {
+
166 unsigned long l = 0;
+
167 _BitScanReverse64(&l, f);
+
168 return 64 + l;
+
169 }
+
170 return r;
+
171#endif
+
172 }
-
180
-
185 inline explicit operator bool() const { return (f || s); }
-
186
-
192 template <typename T, typename = typename std::enable_if<
-
193 std::is_integral<T>::value, T>::type>
-
-
194 inline explicit operator T() const {
-
195 return static_cast<T>(s);
-
196 }
+
173
+
178 inline explicit operator bool() const { return (f || s); }
+
179
+
185 template <typename T, typename = typename std::enable_if<
+
186 std::is_integral<T>::value, T>::type>
+
+
187 inline explicit operator T() const {
+
188 return static_cast<T>(s);
+
189 }
-
197
-
202 inline uint64_t lower() const { return s; }
-
203
-
208 inline uint64_t upper() const { return f; }
-
209
-
216 template <typename T, typename = typename std::enable_if<
-
217 std::is_integral<T>::value, T>::type>
-
-
218 inline uint128_t &operator=(const T &p) {
-
219 this->s = p;
-
220 return *this;
-
221 }
+
190
+
195 inline uint64_t lower() const { return s; }
+
196
+
201 inline uint64_t upper() const { return f; }
+
202
+
209 template <typename T, typename = typename std::enable_if<
+
210 std::is_integral<T>::value, T>::type>
+
+
211 inline uint128_t &operator=(const T &p) {
+
212 this->s = p;
+
213 return *this;
+
214 }
-
222
-
-
228 inline uint128_t &operator=(const std::string &p) {
- -
230 return *this;
-
231 }
+
215
+
+
221 inline uint128_t &operator=(const std::string &p) {
+ +
223 return *this;
+
224 }
+
225
+
231 inline uint128_t &operator=(const uint128_t &p) = default;
232
-
238 inline uint128_t &operator=(const uint128_t &p) = default;
-
239
-
243 inline uint128_t &operator=(uint128_t &&p) = default;
-
244
-
251 template <typename T, typename = typename std::enable_if<
-
252 std::is_integral<T>::value, T>::type>
-
-
253 inline uint128_t operator+(const T p) {
-
254 return uint128_t(f + (p + s < s), p + s);
-
255 }
+
236 inline uint128_t &operator=(uint128_t &&p) = default;
+
237
+
244 template <typename T, typename = typename std::enable_if<
+
245 std::is_integral<T>::value, T>::type>
+
+
246 inline uint128_t operator+(const T p) {
+
247 return uint128_t(f + (p + s < s), p + s);
+
248 }
-
256
-
-
262 inline uint128_t operator+(const uint128_t &p) {
-
263 return uint128_t(f + (p.s + s < s) + p.f, p.s + s);
-
264 }
+
249
+
+
255 inline uint128_t operator+(const uint128_t &p) {
+
256 return uint128_t(f + (p.s + s < s) + p.f, p.s + s);
+
257 }
-
265
-
272 template <typename T, typename = typename std::enable_if<
-
273 std::is_integral<T>::value, T>::type>
-
-
274 inline uint128_t &operator+=(const T p) {
-
275 bool app = p + s < s;
-
276 this->f += app;
-
277 this->s += p;
-
278 return *this;
-
279 }
+
258
+
265 template <typename T, typename = typename std::enable_if<
+
266 std::is_integral<T>::value, T>::type>
+
+
267 inline uint128_t &operator+=(const T p) {
+
268 bool app = p + s < s;
+
269 this->f += app;
+
270 this->s += p;
+
271 return *this;
+
272 }
-
280
-
-
286 uint128_t &operator+=(const uint128_t &p) {
-
287 bool app = p.s + s < s;
-
288 f = f + app + p.f;
-
289 s = p.s + s;
-
290 return *this;
-
291 }
+
273
+
+
279 uint128_t &operator+=(const uint128_t &p) {
+
280 bool app = p.s + s < s;
+
281 f = f + app + p.f;
+
282 s = p.s + s;
+
283 return *this;
+
284 }
-
292
-
-
297 inline uint128_t &operator++() {
-
298 *this += 1;
-
299 return *this;
-
300 }
+
285
+
+
290 inline uint128_t &operator++() {
+
291 *this += 1;
+
292 return *this;
+
293 }
-
301
-
-
306 inline uint128_t operator++(int) {
-
307 ++*this;
-
308 return *this;
-
309 }
+
294
+
+
299 inline uint128_t operator++(int) {
+
300 ++*this;
+
301 return *this;
+
302 }
-
310
-
317 template <typename T, typename = typename std::enable_if<
-
318 std::is_integral<T>::value, T>::type>
-
-
319 inline uint128_t operator-(const T &p) {
-
320 bool app = p > s;
-
321 return uint128_t(f - app, s - p);
-
322 }
+
303
+
310 template <typename T, typename = typename std::enable_if<
+
311 std::is_integral<T>::value, T>::type>
+
+
312 inline uint128_t operator-(const T &p) {
+
313 bool app = p > s;
+
314 return uint128_t(f - app, s - p);
+
315 }
-
323
-
-
329 inline uint128_t operator-(const uint128_t &p) {
-
330 bool app = p.s > s;
-
331 return uint128_t(f - p.f - app, s - p.s);
-
332 }
+
316
+
+
322 inline uint128_t operator-(const uint128_t &p) {
+
323 bool app = p.s > s;
+
324 return uint128_t(f - p.f - app, s - p.s);
+
325 }
-
333
-
338 inline uint128_t operator-() { return ~*this + uint128_t(1); }
-
339
-
-
344 inline uint128_t &operator--() {
-
345 *this -= 1;
-
346 return *this;
-
347 }
+
326
+
331 inline uint128_t operator-() { return ~*this + uint128_t(1); }
+
332
+
+
337 inline uint128_t &operator--() {
+
338 *this -= 1;
+
339 return *this;
+
340 }
-
348
-
-
353 inline uint128_t operator--(int) {
-
354 --*this;
-
355 return *this;
-
356 }
+
341
+
+
346 inline uint128_t operator--(int) {
+
347 --*this;
+
348 return *this;
+
349 }
-
357
-
364 template <typename T, typename = typename std::enable_if<
-
365 std::is_integral<T>::value, T>::type>
-
-
366 uint128_t &operator-=(const T &p) {
-
367 bool app = p > s;
-
368 f -= app;
-
369 s -= p;
-
370 return *this;
-
371 }
+
350
+
357 template <typename T, typename = typename std::enable_if<
+
358 std::is_integral<T>::value, T>::type>
+
+
359 uint128_t &operator-=(const T &p) {
+
360 bool app = p > s;
+
361 f -= app;
+
362 s -= p;
+
363 return *this;
+
364 }
-
372
-
-
378 uint128_t &operator-=(const uint128_t &p) {
-
379 bool app = p.s > s;
-
380 f = f - p.f - app;
-
381 s = s - p.s;
-
382 return *this;
-
383 }
+
365
+
+
371 uint128_t &operator-=(const uint128_t &p) {
+
372 bool app = p.s > s;
+
373 f = f - p.f - app;
+
374 s = s - p.s;
+
375 return *this;
+
376 }
-
384
-
391 template <typename T, typename = typename std::enable_if<
-
392 std::is_integral<T>::value, T>::type>
-
-
393 inline uint128_t operator*(const T p) {
-
394 return *this * uint128_t(p);
-
395 }
+
377
+
384 template <typename T, typename = typename std::enable_if<
+
385 std::is_integral<T>::value, T>::type>
+
+
386 inline uint128_t operator*(const T p) {
+
387 return *this * uint128_t(p);
+
388 }
-
396
-
-
402 uint128_t operator*(const uint128_t &p) {
-
403 uint64_t f_first = s >> 32, f_second = s & 0xFFFFFFFF,
-
404 s_first = p.s >> 32, s_second = p.s & 0xFFFFFFFF;
-
405 uint64_t fi = f_first * s_first, se = f_first * s_second,
-
406 th = s_first * f_second, fo = s_second * f_second;
-
407 uint64_t tmp = ((se & 0xFFFFFFFF) << 32), tmp2 = (th & 0xFFFFFFFF)
-
408 << 32;
-
409 int cc = (tmp + tmp2 < tmp);
-
410 tmp += tmp2;
-
411 cc += (tmp + fo < tmp);
-
412 uint64_t carry = fi + (se >> 32) + (th >> 32);
-
413 return uint128_t(this->f * p.s + this->s * p.f + carry + cc, tmp + fo);
-
414 }
+
389
+
+
395 uint128_t operator*(const uint128_t &p) {
+
396 uint64_t f_first = s >> 32, f_second = s & 0xFFFFFFFF,
+
397 s_first = p.s >> 32, s_second = p.s & 0xFFFFFFFF;
+
398 uint64_t fi = f_first * s_first, se = f_first * s_second,
+
399 th = s_first * f_second, fo = s_second * f_second;
+
400 uint64_t tmp = ((se & 0xFFFFFFFF) << 32), tmp2 = (th & 0xFFFFFFFF)
+
401 << 32;
+
402 int cc = (tmp + tmp2 < tmp);
+
403 tmp += tmp2;
+
404 cc += (tmp + fo < tmp);
+
405 uint64_t carry = fi + (se >> 32) + (th >> 32);
+
406 return uint128_t(this->f * p.s + this->s * p.f + carry + cc, tmp + fo);
+
407 }
-
415
-
422 template <typename T, typename = typename std::enable_if<
-
423 std::is_integral<T>::value, T>::type>
-
-
424 inline uint128_t &operator*=(const T p) {
-
425 *this *= uint128_t(p);
-
426 return *this;
-
427 }
+
408
+
415 template <typename T, typename = typename std::enable_if<
+
416 std::is_integral<T>::value, T>::type>
+
+
417 inline uint128_t &operator*=(const T p) {
+
418 *this *= uint128_t(p);
+
419 return *this;
+
420 }
-
428
-
-
434 uint128_t &operator*=(const uint128_t &p) {
-
435 uint64_t f_first = s >> 32, f_second = s & 0xFFFFFFFF,
-
436 s_first = p.s >> 32, s_second = p.s & 0xFFFFFFFF;
-
437 uint64_t fi = f_first * s_first, se = f_first * s_second,
-
438 th = s_first * f_second, fo = s_second * f_second;
-
439 uint64_t tmp = (se << 32), tmp2 = (th << 32);
-
440 int cc = (tmp + tmp2 < tmp);
-
441 tmp += tmp2;
-
442 cc += (tmp + fo < tmp);
-
443 uint64_t carry = fi + (se >> 32) + (th >> 32);
-
444 f = this->f * p.s + this->s * p.f + carry + cc;
-
445 s = tmp + fo;
-
446 return *this;
-
447 }
+
421
+
+
427 uint128_t &operator*=(const uint128_t &p) {
+
428 uint64_t f_first = s >> 32, f_second = s & 0xFFFFFFFF,
+
429 s_first = p.s >> 32, s_second = p.s & 0xFFFFFFFF;
+
430 uint64_t fi = f_first * s_first, se = f_first * s_second,
+
431 th = s_first * f_second, fo = s_second * f_second;
+
432 uint64_t tmp = (se << 32), tmp2 = (th << 32);
+
433 int cc = (tmp + tmp2 < tmp);
+
434 tmp += tmp2;
+
435 cc += (tmp + fo < tmp);
+
436 uint64_t carry = fi + (se >> 32) + (th >> 32);
+
437 f = this->f * p.s + this->s * p.f + carry + cc;
+
438 s = tmp + fo;
+
439 return *this;
+
440 }
-
448
-
-
455 std::pair<uint128_t, uint128_t> divide(const uint128_t &p) {
-
456 if (*this < p) { // if this is less than divisor
-
457 return {uint128_t(0), *this};
-
458 } else if (*this == p) { // if this is equal to divisor
-
459 return {uint128_t(1), uint128_t(0)};
-
460 }
-
461 uint128_t tmp = p, tmp2 = *this;
-
462 uint16_t left = tmp._lez() - _lez();
-
463 tmp <<= left;
-
464 uint128_t quotient(0);
-
465 uint128_t zero(0);
-
466 while (tmp2 >= p) {
-
467 uint16_t shf = tmp2._lez() - tmp._lez();
-
468 if (shf) {
-
469 tmp >>= shf;
-
470 quotient <<= shf;
-
471 left -= shf;
-
472 }
-
473 if (tmp2 < tmp) {
-
474 tmp >>= 1;
-
475 quotient <<= 1;
-
476 --left;
-
477 }
-
478 tmp2 -= tmp;
-
479 ++quotient;
-
480 }
-
481 return {quotient << left, tmp2};
-
482 }
+
441
+
+
448 std::pair<uint128_t, uint128_t> divide(const uint128_t &p) {
+
449 if (*this < p) { // if this is less than divisor
+
450 return {uint128_t(0), *this};
+
451 } else if (*this == p) { // if this is equal to divisor
+
452 return {uint128_t(1), uint128_t(0)};
+
453 }
+
454 uint128_t tmp = p, tmp2 = *this;
+
455 uint16_t left = tmp._lez() - _lez();
+
456 tmp <<= left;
+
457 uint128_t quotient(0);
+
458 uint128_t zero(0);
+
459 while (tmp2 >= p) {
+
460 uint16_t shf = tmp2._lez() - tmp._lez();
+
461 if (shf) {
+
462 tmp >>= shf;
+
463 quotient <<= shf;
+
464 left -= shf;
+
465 }
+
466 if (tmp2 < tmp) {
+
467 tmp >>= 1;
+
468 quotient <<= 1;
+
469 --left;
+
470 }
+
471 tmp2 -= tmp;
+
472 ++quotient;
+
473 }
+
474 return {quotient << left, tmp2};
+
475 }
+
476
+
482 inline uint128_t operator/(const uint128_t &p) { return divide(p).first; }
483
-
489 inline uint128_t operator/(const uint128_t &p) { return divide(p).first; }
-
490
-
497 template <typename T, typename = typename std::enable_if<
-
498 std::is_integral<T>::value, T>::type>
-
-
499 inline uint128_t operator/(const T p) {
-
500 uint128_t tmp = *this;
-
501 tmp /= uint128_t(0, p);
-
502 return tmp;
-
503 }
+
490 template <typename T, typename = typename std::enable_if<
+
491 std::is_integral<T>::value, T>::type>
+
+
492 inline uint128_t operator/(const T p) {
+
493 uint128_t tmp = *this;
+
494 tmp /= uint128_t(0, p);
+
495 return tmp;
+
496 }
-
504
-
-
510 inline uint128_t &operator/=(const uint128_t &p) {
-
511 *this = divide(p).first;
-
512 return *this;
-
513 }
+
497
+
+
503 inline uint128_t &operator/=(const uint128_t &p) {
+
504 *this = divide(p).first;
+
505 return *this;
+
506 }
-
514
-
521 template <typename T, typename = typename std::enable_if<
-
522 std::is_integral<T>::value, T>::type>
-
-
523 inline uint128_t &operator/=(const T p) {
-
524 *this /= uint128_t(0, p);
-
525 return *this;
-
526 }
+
507
+
514 template <typename T, typename = typename std::enable_if<
+
515 std::is_integral<T>::value, T>::type>
+
+
516 inline uint128_t &operator/=(const T p) {
+
517 *this /= uint128_t(0, p);
+
518 return *this;
+
519 }
+
520
+
526 inline uint128_t operator%(const uint128_t &p) { return divide(p).second; }
527
-
533 inline uint128_t operator%(const uint128_t &p) { return divide(p).second; }
-
534
-
541 template <typename T, typename = typename std::enable_if<
-
542 std::is_integral<T>::value, T>::type>
-
-
543 inline uint128_t operator%(const T &p) {
-
544 return *this % uint128_t(p);
-
545 }
+
534 template <typename T, typename = typename std::enable_if<
+
535 std::is_integral<T>::value, T>::type>
+
+
536 inline uint128_t operator%(const T &p) {
+
537 return *this % uint128_t(p);
+
538 }
-
546
-
-
552 inline uint128_t &operator%=(const uint128_t &p) {
-
553 *this = divide(p).second;
-
554 return *this;
-
555 }
+
539
+
+
545 inline uint128_t &operator%=(const uint128_t &p) {
+
546 *this = divide(p).second;
+
547 return *this;
+
548 }
-
556
-
563 template <typename T, typename = typename std::enable_if<
-
564 std::is_integral<T>::value, T>::type>
-
-
565 inline uint128_t &operator%=(const T &p) {
-
566 *this %= uint128_t(p);
-
567 return *this;
-
568 }
+
549
+
556 template <typename T, typename = typename std::enable_if<
+
557 std::is_integral<T>::value, T>::type>
+
+
558 inline uint128_t &operator%=(const T &p) {
+
559 *this %= uint128_t(p);
+
560 return *this;
+
561 }
-
569
-
-
575 inline bool operator<(const uint128_t &other) {
-
576 return f < other.f || (f == other.f && s < other.s);
-
577 }
+
562
+
+
568 inline bool operator<(const uint128_t &other) {
+
569 return f < other.f || (f == other.f && s < other.s);
+
570 }
-
578
-
-
584 inline bool operator<=(const uint128_t &other) {
-
585 return f < other.f || (f == other.f && s <= other.s);
-
586 }
+
571
+
+
577 inline bool operator<=(const uint128_t &other) {
+
578 return f < other.f || (f == other.f && s <= other.s);
+
579 }
-
587
-
-
593 inline bool operator>(const uint128_t &other) {
-
594 return f > other.f || (f == other.f && s > other.s);
-
595 }
+
580
+
+
586 inline bool operator>(const uint128_t &other) {
+
587 return f > other.f || (f == other.f && s > other.s);
+
588 }
-
596
-
-
602 inline bool operator>=(const uint128_t &other) {
-
603 return (f > other.f) || (f == other.f && s >= other.s);
-
604 }
+
589
+
+
595 inline bool operator>=(const uint128_t &other) {
+
596 return (f > other.f) || (f == other.f && s >= other.s);
+
597 }
-
605
-
-
611 inline bool operator==(const uint128_t &other) {
-
612 return f == other.f && s == other.s;
-
613 }
+
598
+
+
604 inline bool operator==(const uint128_t &other) {
+
605 return f == other.f && s == other.s;
+
606 }
-
614
-
-
620 inline bool operator!=(const uint128_t &other) {
-
621 return f != other.f || s != other.s;
-
622 }
+
607
+
+
613 inline bool operator!=(const uint128_t &other) {
+
614 return f != other.f || s != other.s;
+
615 }
-
623
-
628 inline bool operator!() { return !f && !s; }
-
629
-
-
635 inline bool operator&&(const uint128_t &b) {
-
636 return (s || f) && (b.s || b.f);
-
637 }
+
616
+
621 inline bool operator!() { return !f && !s; }
+
622
+
+
628 inline bool operator&&(const uint128_t &b) {
+
629 return (s || f) && (b.s || b.f);
+
630 }
-
638
-
-
644 inline bool operator||(const uint128_t &b) {
-
645 return (s || f) || (b.s || b.f);
-
646 }
+
631
+
+
637 inline bool operator||(const uint128_t &b) {
+
638 return (s || f) || (b.s || b.f);
+
639 }
-
647
-
652 inline bool operator()() { return s || f; }
-
653
-
660 template <typename T, typename = typename std::enable_if<
-
661 std::is_integral<T>::value, T>::type>
-
-
662 inline bool operator<(const T other) {
-
663 return *this < uint128_t(other);
-
664 }
+
640
+
645 inline bool operator()() { return s || f; }
+
646
+
653 template <typename T, typename = typename std::enable_if<
+
654 std::is_integral<T>::value, T>::type>
+
+
655 inline bool operator<(const T other) {
+
656 return *this < uint128_t(other);
+
657 }
-
665
-
672 template <typename T, typename = typename std::enable_if<
-
673 std::is_integral<T>::value, T>::type>
-
-
674 inline bool operator<=(const T other) {
-
675 return *this <= uint128_t(other);
-
676 }
+
658
+
665 template <typename T, typename = typename std::enable_if<
+
666 std::is_integral<T>::value, T>::type>
+
+
667 inline bool operator<=(const T other) {
+
668 return *this <= uint128_t(other);
+
669 }
-
677
-
684 template <typename T, typename = typename std::enable_if<
-
685 std::is_integral<T>::value, T>::type>
-
-
686 inline bool operator>(const T other) {
-
687 return *this > uint128_t(other);
-
688 }
+
670
+
677 template <typename T, typename = typename std::enable_if<
+
678 std::is_integral<T>::value, T>::type>
+
+
679 inline bool operator>(const T other) {
+
680 return *this > uint128_t(other);
+
681 }
-
689
-
696 template <typename T, typename = typename std::enable_if<
-
697 std::is_integral<T>::value, T>::type>
-
-
698 inline bool operator>=(const T other) {
-
699 return *this >= uint128_t(other);
-
700 }
+
682
+
689 template <typename T, typename = typename std::enable_if<
+
690 std::is_integral<T>::value, T>::type>
+
+
691 inline bool operator>=(const T other) {
+
692 return *this >= uint128_t(other);
+
693 }
-
701
-
708 template <typename T, typename = typename std::enable_if<
-
709 std::is_integral<T>::value, T>::type>
-
-
710 inline bool operator==(const T other) {
-
711 return *this == uint128_t(other);
-
712 }
+
694
+
701 template <typename T, typename = typename std::enable_if<
+
702 std::is_integral<T>::value, T>::type>
+
+
703 inline bool operator==(const T other) {
+
704 return *this == uint128_t(other);
+
705 }
-
713
-
720 template <typename T, typename = typename std::enable_if<
-
721 std::is_integral<T>::value, T>::type>
-
-
722 inline bool operator!=(const T other) {
-
723 return *this != uint128_t(other);
-
724 }
+
706
+
713 template <typename T, typename = typename std::enable_if<
+
714 std::is_integral<T>::value, T>::type>
+
+
715 inline bool operator!=(const T other) {
+
716 return *this != uint128_t(other);
+
717 }
-
725
-
732 template <typename T, typename = typename std::enable_if<
-
733 std::is_integral<T>::value, T>::type>
-
-
734 inline bool operator&&(const T b) {
-
735 return (f || s) && b;
-
736 }
+
718
+
725 template <typename T, typename = typename std::enable_if<
+
726 std::is_integral<T>::value, T>::type>
+
+
727 inline bool operator&&(const T b) {
+
728 return (f || s) && b;
+
729 }
-
737
-
745 template <typename T, typename = typename std::enable_if<
-
746 std::is_integral<T>::value, T>::type>
-
-
747 inline bool operator||(const T b) {
-
748 return (f || s) || b;
-
749 }
+
730
+
738 template <typename T, typename = typename std::enable_if<
+
739 std::is_integral<T>::value, T>::type>
+
+
740 inline bool operator||(const T b) {
+
741 return (f || s) || b;
+
742 }
-
750
-
755 uint128_t operator~() { return uint128_t(~this->f, ~this->s); }
-
756
-
763 template <typename T, typename = typename std::enable_if<
-
764 std::is_integral<T>::value, T>::type>
-
-
765 uint128_t operator<<(const T p) {
-
766 if (!p) {
-
767 return uint128_t(f, s);
-
768 } else if (p >= 64 && p <= 128) {
-
769 return uint128_t((this->s << (p - 64)), 0);
-
770 } else if (p < 64 && p > 0) {
-
771 return uint128_t((this->f << p) + ((this->s >> (64 - p))),
-
772 this->s << p);
-
773 }
-
774 return uint128_t(0);
-
775 }
+
743
+
748 uint128_t operator~() { return uint128_t(~this->f, ~this->s); }
+
749
+
756 template <typename T, typename = typename std::enable_if<
+
757 std::is_integral<T>::value, T>::type>
+
+
758 uint128_t operator<<(const T p) {
+
759 if (!p) {
+
760 return uint128_t(f, s);
+
761 } else if (p >= 64 && p <= 128) {
+
762 return uint128_t((this->s << (p - 64)), 0);
+
763 } else if (p < 64 && p > 0) {
+
764 return uint128_t((this->f << p) + ((this->s >> (64 - p))),
+
765 this->s << p);
+
766 }
+
767 return uint128_t(0);
+
768 }
-
776
-
783 template <typename T, typename = typename std::enable_if<
-
784 std::is_integral<T>::value, T>::type>
-
-
785 uint128_t &operator<<=(const T p) {
-
786 if (p) {
-
787 if (p >= 64 && p <= 128) {
-
788 this->f = (this->s << (p - 64));
-
789 this->s = 0;
-
790 } else {
-
791 f = ((this->f << p) + (this->s >> (64 - p)));
-
792 s = (this->s << p);
-
793 }
-
794 }
-
795 return *this;
-
796 }
+
769
+
776 template <typename T, typename = typename std::enable_if<
+
777 std::is_integral<T>::value, T>::type>
+
+
778 uint128_t &operator<<=(const T p) {
+
779 if (p) {
+
780 if (p >= 64 && p <= 128) {
+
781 this->f = (this->s << (p - 64));
+
782 this->s = 0;
+
783 } else {
+
784 f = ((this->f << p) + (this->s >> (64 - p)));
+
785 s = (this->s << p);
+
786 }
+
787 }
+
788 return *this;
+
789 }
-
797
-
804 template <typename T, typename = typename std::enable_if<
-
805 std::is_integral<T>::value, T>::type>
-
-
806 uint128_t operator>>(const T p) {
-
807 if (!p) {
-
808 return uint128_t(this->f, this->s);
-
809 } else if (p >= 64 && p <= 128) {
-
810 return uint128_t(0, (this->f >> (p - 64)));
-
811 } else if (p < 64 && p > 0) {
-
812 return uint128_t((this->f >> p),
-
813 (this->s >> p) + (this->f << (64 - p)));
-
814 }
-
815 return uint128_t(0);
-
816 }
+
790
+
797 template <typename T, typename = typename std::enable_if<
+
798 std::is_integral<T>::value, T>::type>
+
+
799 uint128_t operator>>(const T p) {
+
800 if (!p) {
+
801 return uint128_t(this->f, this->s);
+
802 } else if (p >= 64 && p <= 128) {
+
803 return uint128_t(0, (this->f >> (p - 64)));
+
804 } else if (p < 64 && p > 0) {
+
805 return uint128_t((this->f >> p),
+
806 (this->s >> p) + (this->f << (64 - p)));
+
807 }
+
808 return uint128_t(0);
+
809 }
-
817
-
824 template <typename T, typename = typename std::enable_if<
-
825 std::is_integral<T>::value, T>::type>
-
-
826 uint128_t &operator>>=(const T p) {
-
827 if (p) {
-
828 if (p >= 64) {
-
829 f = 0;
-
830 s = (this->f >> (p - 64));
-
831 } else {
-
832 s = (this->s >> p) + (this->f << (64 - p));
-
833 f = (this->f >> p);
-
834 }
-
835 }
-
836 return *this;
-
837 }
+
810
+
817 template <typename T, typename = typename std::enable_if<
+
818 std::is_integral<T>::value, T>::type>
+
+
819 uint128_t &operator>>=(const T p) {
+
820 if (p) {
+
821 if (p >= 64) {
+
822 f = 0;
+
823 s = (this->f >> (p - 64));
+
824 } else {
+
825 s = (this->s >> p) + (this->f << (64 - p));
+
826 f = (this->f >> p);
+
827 }
+
828 }
+
829 return *this;
+
830 }
-
838
-
-
844 inline uint128_t operator&(const uint128_t &p) {
-
845 return uint128_t(this->f & p.f, this->s & p.s);
-
846 }
+
831
+
+
837 inline uint128_t operator&(const uint128_t &p) {
+
838 return uint128_t(this->f & p.f, this->s & p.s);
+
839 }
-
847
-
854 template <typename T, typename = typename std::enable_if<
-
855 std::is_integral<T>::value, T>::type>
-
-
856 uint128_t operator&(const T p) {
-
857 uint128_t tmp = *this;
-
858 return tmp & uint128_t(p);
-
859 }
+
840
+
847 template <typename T, typename = typename std::enable_if<
+
848 std::is_integral<T>::value, T>::type>
+
+
849 uint128_t operator&(const T p) {
+
850 uint128_t tmp = *this;
+
851 return tmp & uint128_t(p);
+
852 }
-
860
-
-
866 uint128_t &operator&=(const uint128_t &p) {
-
867 this->f &= p.f;
-
868 this->s &= p.s;
-
869 return *this;
-
870 }
+
853
+
+
859 uint128_t &operator&=(const uint128_t &p) {
+
860 this->f &= p.f;
+
861 this->s &= p.s;
+
862 return *this;
+
863 }
-
871
-
878 template <typename T, typename = typename std::enable_if<
-
879 std::is_integral<T>::value, T>::type>
-
-
880 uint128_t &operator&=(const T p) {
-
881 *this &= uint128_t(p);
-
882 return *this;
-
883 }
+
864
+
871 template <typename T, typename = typename std::enable_if<
+
872 std::is_integral<T>::value, T>::type>
+
+
873 uint128_t &operator&=(const T p) {
+
874 *this &= uint128_t(p);
+
875 return *this;
+
876 }
-
884
-
891 template <typename T, typename = typename std::enable_if<
-
892 std::is_integral<T>::value, T>::type>
-
-
893 inline uint128_t operator|(const T p) {
-
894 return uint128_t(p | s);
-
895 }
+
877
+
884 template <typename T, typename = typename std::enable_if<
+
885 std::is_integral<T>::value, T>::type>
+
+
886 inline uint128_t operator|(const T p) {
+
887 return uint128_t(p | s);
+
888 }
-
896
-
-
902 inline uint128_t operator|(const uint128_t &p) {
-
903 return uint128_t(this->f | p.f, this->s | p.s);
-
904 }
+
889
+
+
895 inline uint128_t operator|(const uint128_t &p) {
+
896 return uint128_t(this->f | p.f, this->s | p.s);
+
897 }
-
905
-
-
911 uint128_t &operator|=(const uint128_t &p) {
-
912 f |= p.f;
-
913 s |= p.s;
-
914 return *this;
-
915 }
+
898
+
+
904 uint128_t &operator|=(const uint128_t &p) {
+
905 f |= p.f;
+
906 s |= p.s;
+
907 return *this;
+
908 }
-
916
-
923 template <typename T, typename = typename std::enable_if<
-
924 std::is_integral<T>::value, T>::type>
-
-
925 inline uint128_t &operator|=(const T p) {
-
926 s |= p.s;
-
927 return *this;
-
928 }
+
909
+
916 template <typename T, typename = typename std::enable_if<
+
917 std::is_integral<T>::value, T>::type>
+
+
918 inline uint128_t &operator|=(const T p) {
+
919 s |= p.s;
+
920 return *this;
+
921 }
-
929
-
936 template <typename T, typename = typename std::enable_if<
-
937 std::is_integral<T>::value, T>::type>
-
-
938 inline uint128_t operator^(const T p) {
-
939 return uint128_t(this->f, this->s ^ p);
-
940 }
+
922
+
929 template <typename T, typename = typename std::enable_if<
+
930 std::is_integral<T>::value, T>::type>
+
+
931 inline uint128_t operator^(const T p) {
+
932 return uint128_t(this->f, this->s ^ p);
+
933 }
-
941
-
-
947 inline uint128_t operator^(const uint128_t &p) {
-
948 return uint128_t(this->f ^ p.f, this->s ^ p.s);
-
949 }
+
934
+
+
940 inline uint128_t operator^(const uint128_t &p) {
+
941 return uint128_t(this->f ^ p.f, this->s ^ p.s);
+
942 }
-
950
-
-
956 uint128_t &operator^=(const uint128_t &p) {
-
957 f ^= p.f;
-
958 s ^= p.s;
-
959 return *this;
-
960 }
+
943
+
+
949 uint128_t &operator^=(const uint128_t &p) {
+
950 f ^= p.f;
+
951 s ^= p.s;
+
952 return *this;
+
953 }
-
961
-
968 template <typename T, typename = typename std::enable_if<
-
969 std::is_integral<T>::value, T>::type>
-
-
970 inline uint128_t &operator^=(const T &p) {
-
971 s ^= p;
-
972 return *this;
-
973 }
+
954
+
961 template <typename T, typename = typename std::enable_if<
+
962 std::is_integral<T>::value, T>::type>
+
+
963 inline uint128_t &operator^=(const T &p) {
+
964 s ^= p;
+
965 return *this;
+
966 }
-
974
-
-
984 friend std::ostream &operator<<(std::ostream &op, const uint128_t &p) {
-
985 if (!p.f) {
-
986 op << p.s;
-
987 } else {
-
988 std::string out = "0", p_2 = "1";
-
989 for (int i = 0; i < 64; ++i) {
-
990 if (p.s & (1LL << i)) {
-
991 out = add(out, p_2);
-
992 }
-
993 p_2 = add(p_2, p_2);
-
994 }
-
995 for (int i = 0; i < 64; ++i) {
-
996 if (p.f & (1LL << i)) {
-
997 out = add(out, p_2);
-
998 }
-
999 p_2 = add(p_2, p_2);
-
1000 }
-
1001 op << out;
-
1002 }
-
1003 return op;
-
1004 }
+
967
+
+
977 friend std::ostream &operator<<(std::ostream &op, const uint128_t &p) {
+
978 if (!p.f) {
+
979 op << p.s;
+
980 } else {
+
981 std::string out = "0", p_2 = "1";
+
982 for (int i = 0; i < 64; ++i) {
+
983 if (p.s & (1LL << i)) {
+
984 out = add(out, p_2);
+
985 }
+
986 p_2 = add(p_2, p_2);
+
987 }
+
988 for (int i = 0; i < 64; ++i) {
+
989 if (p.f & (1LL << i)) {
+
990 out = add(out, p_2);
+
991 }
+
992 p_2 = add(p_2, p_2);
+
993 }
+
994 op << out;
+
995 }
+
996 return op;
+
997 }
-
1005};
+
998};
+
999
+
1000// Arithmetic operators
+
1001template <typename T, typename = typename std::enable_if<
+
1002 std::is_integral<T>::value, T>::type>
+
1003inline uint128_t operator+(const T &p, const uint128_t &q) {
+
1004 return uint128_t(p) + q;
+
1005}
1006
-
1007// Arithmetic operators
-
1008template <typename T, typename = typename std::enable_if<
-
1009 std::is_integral<T>::value, T>::type>
-
1010inline uint128_t operator+(const T &p, const uint128_t &q) {
-
1011 return uint128_t(p) + q;
-
1012}
-
1013
-
1014template <typename T, typename = typename std::enable_if<
-
1015 std::is_integral<T>::value, T>::type>
-
1016inline uint128_t operator-(const T p, const uint128_t &q) {
-
1017 return uint128_t(p) - q;
-
1018}
-
1019
-
1020template <typename T, typename = typename std::enable_if<
-
1021 std::is_integral<T>::value, T>::type>
-
1022inline uint128_t operator*(const T p, const uint128_t &q) {
-
1023 return uint128_t(p) * q;
-
1024}
-
1025
-
1026template <typename T, typename = typename std::enable_if<
-
1027 std::is_integral<T>::value, T>::type>
-
1028inline uint128_t operator/(const T p, const uint128_t &q) {
-
1029 return uint128_t(p) / q;
-
1030}
-
1031
+
1007template <typename T, typename = typename std::enable_if<
+
1008 std::is_integral<T>::value, T>::type>
+
1009inline uint128_t operator-(const T p, const uint128_t &q) {
+
1010 return uint128_t(p) - q;
+
1011}
+
1012
+
1013template <typename T, typename = typename std::enable_if<
+
1014 std::is_integral<T>::value, T>::type>
+
1015inline uint128_t operator*(const T p, const uint128_t &q) {
+
1016 return uint128_t(p) * q;
+
1017}
+
1018
+
1019template <typename T, typename = typename std::enable_if<
+
1020 std::is_integral<T>::value, T>::type>
+
1021inline uint128_t operator/(const T p, const uint128_t &q) {
+
1022 return uint128_t(p) / q;
+
1023}
+
1024
+
1025template <typename T, typename = typename std::enable_if<
+
1026 std::is_integral<T>::value, T>::type>
+
1027inline uint128_t operator%(const T p, const uint128_t &q) {
+
1028 return uint128_t(p) % q;
+
1029}
+
1030
+
1031// Bitwise operators
1032template <typename T, typename = typename std::enable_if<
1033 std::is_integral<T>::value, T>::type>
-
1034inline uint128_t operator%(const T p, const uint128_t &q) {
-
1035 return uint128_t(p) % q;
+
1034inline uint128_t operator&(const T &p, const uint128_t &q) {
+
1035 return uint128_t(p) & q;
1036}
1037
-
1038// Bitwise operators
-
1039template <typename T, typename = typename std::enable_if<
-
1040 std::is_integral<T>::value, T>::type>
-
1041inline uint128_t operator&(const T &p, const uint128_t &q) {
-
1042 return uint128_t(p) & q;
-
1043}
-
1044
-
1045template <typename T, typename = typename std::enable_if<
-
1046 std::is_integral<T>::value, T>::type>
-
1047inline uint128_t operator|(const T p, const uint128_t &q) {
-
1048 return uint128_t(p) | q;
-
1049}
-
1050
+
1038template <typename T, typename = typename std::enable_if<
+
1039 std::is_integral<T>::value, T>::type>
+
1040inline uint128_t operator|(const T p, const uint128_t &q) {
+
1041 return uint128_t(p) | q;
+
1042}
+
1043
+
1044template <typename T, typename = typename std::enable_if<
+
1045 std::is_integral<T>::value, T>::type>
+
1046inline uint128_t operator^(const T p, const uint128_t &q) {
+
1047 return uint128_t(p) ^ q;
+
1048}
+
1049
+
1050// Boolean operators
1051template <typename T, typename = typename std::enable_if<
1052 std::is_integral<T>::value, T>::type>
-
1053inline uint128_t operator^(const T p, const uint128_t &q) {
-
1054 return uint128_t(p) ^ q;
+
1053inline bool operator&&(const T p, const uint128_t &q) {
+
1054 return uint128_t(p) && q;
1055}
1056
-
1057// Boolean operators
-
1058template <typename T, typename = typename std::enable_if<
-
1059 std::is_integral<T>::value, T>::type>
-
1060inline bool operator&&(const T p, const uint128_t &q) {
-
1061 return uint128_t(p) && q;
-
1062}
-
1063
+
1057template <typename T, typename = typename std::enable_if<
+
1058 std::is_integral<T>::value, T>::type>
+
1059inline bool operator||(const T p, const uint128_t &q) {
+
1060 return uint128_t(p) || q;
+
1061}
+
1062
+
1063// Comparison operators
1064template <typename T, typename = typename std::enable_if<
1065 std::is_integral<T>::value, T>::type>
-
1066inline bool operator||(const T p, const uint128_t &q) {
-
1067 return uint128_t(p) || q;
+
1066inline bool operator==(const T p, const uint128_t &q) {
+
1067 return uint128_t(p) == q;
1068}
1069
-
1070// Comparison operators
-
1071template <typename T, typename = typename std::enable_if<
-
1072 std::is_integral<T>::value, T>::type>
-
1073inline bool operator==(const T p, const uint128_t &q) {
-
1074 return uint128_t(p) == q;
-
1075}
-
1076
-
1077template <typename T, typename = typename std::enable_if<
-
1078 std::is_integral<T>::value, T>::type>
-
1079inline bool operator!=(const T p, const uint128_t &q) {
-
1080 return uint128_t(p) != q;
-
1081}
-
1082
-
1083template <typename T, typename = typename std::enable_if<
-
1084 std::is_integral<T>::value, T>::type>
-
1085inline bool operator<(const T p, const uint128_t &q) {
-
1086 return uint128_t(p) < q;
-
1087}
-
1088
-
1089template <typename T, typename = typename std::enable_if<
-
1090 std::is_integral<T>::value, T>::type>
-
1091inline bool operator<=(const T p, const uint128_t &q) {
-
1092 return uint128_t(p) <= q;
-
1093}
-
1094
-
1095template <typename T, typename = typename std::enable_if<
-
1096 std::is_integral<T>::value, T>::type>
-
1097inline bool operator>(const T p, const uint128_t &q) {
-
1098 return uint128_t(p) > q;
-
1099}
-
1100
-
1101template <typename T, typename = typename std::enable_if<
-
1102 std::is_integral<T>::value, T>::type>
-
1103inline bool operator>=(const T p, const uint128_t &q) {
-
1104 return uint128_t(p) >= q;
-
1105}
-
1106
-
1107#endif // CIPHERS_UINT128_T_HPP_
-
class for 128-bit unsigned integer
Definition uint128_t.hpp:60
-
uint128_t & operator%=(const T &p)
operator %= for uint128_t
-
uint128_t operator-()
operator - using twos complement
-
uint128_t & operator-=(const T &p)
operator -= for uint128_t and other integer types.
-
bool operator&&(const T b)
operator && for other types
-
uint128_t & operator>>=(const T p)
operator >>= for uint128_t
-
uint128_t(const std::string &str)
Parameterized constructor.
-
uint128_t operator+(const uint128_t &p)
operator + for uint128_t and other integer types.
-
uint128_t operator<<(const T p)
operator << for uint128_t
-
bool operator<=(const uint128_t &other)
operator <= for uint128_t
-
uint128_t & operator--()
operator – (pre-decrement)
-
uint64_t upper() const
returns upper 64-bit integer part
-
uint128_t & operator&=(const T p)
operator &= for other types (bitwise operator)
-
uint128_t & operator%=(const uint128_t &p)
operator %= for uint128_t
-
bool operator>(const uint128_t &other)
operator > for uint128_t
-
uint128_t operator|(const uint128_t &p)
operator | for uint128_t (bitwise operator)
-
uint128_t & operator/=(const uint128_t &p)
operator /= for uint128_t
-
uint128_t & operator*=(const T p)
operator *= for uint128_t and other integer types.
-
uint128_t operator/(const uint128_t &p)
operator / for uint128_t and other integer types.
-
bool operator||(const uint128_t &b)
operator || for uint128_t
-
bool operator>=(const T other)
operator >= for other types
+
1070template <typename T, typename = typename std::enable_if<
+
1071 std::is_integral<T>::value, T>::type>
+
1072inline bool operator!=(const T p, const uint128_t &q) {
+
1073 return uint128_t(p) != q;
+
1074}
+
1075
+
1076template <typename T, typename = typename std::enable_if<
+
1077 std::is_integral<T>::value, T>::type>
+
1078inline bool operator<(const T p, const uint128_t &q) {
+
1079 return uint128_t(p) < q;
+
1080}
+
1081
+
1082template <typename T, typename = typename std::enable_if<
+
1083 std::is_integral<T>::value, T>::type>
+
1084inline bool operator<=(const T p, const uint128_t &q) {
+
1085 return uint128_t(p) <= q;
+
1086}
+
1087
+
1088template <typename T, typename = typename std::enable_if<
+
1089 std::is_integral<T>::value, T>::type>
+
1090inline bool operator>(const T p, const uint128_t &q) {
+
1091 return uint128_t(p) > q;
+
1092}
+
1093
+
1094template <typename T, typename = typename std::enable_if<
+
1095 std::is_integral<T>::value, T>::type>
+
1096inline bool operator>=(const T p, const uint128_t &q) {
+
1097 return uint128_t(p) >= q;
+
1098}
+
1099
+
1100#endif // CIPHERS_UINT128_T_HPP_
+
class for 128-bit unsigned integer
Definition uint128_t.hpp:53
+
uint128_t & operator%=(const T &p)
operator %= for uint128_t
+
uint128_t operator-()
operator - using twos complement
+
uint128_t & operator-=(const T &p)
operator -= for uint128_t and other integer types.
+
bool operator&&(const T b)
operator && for other types
+
uint128_t & operator>>=(const T p)
operator >>= for uint128_t
+
uint128_t(const std::string &str)
Parameterized constructor.
+
uint128_t operator+(const uint128_t &p)
operator + for uint128_t and other integer types.
+
uint128_t operator<<(const T p)
operator << for uint128_t
+
bool operator<=(const uint128_t &other)
operator <= for uint128_t
+
uint128_t & operator--()
operator – (pre-decrement)
+
uint64_t upper() const
returns upper 64-bit integer part
+
uint128_t & operator&=(const T p)
operator &= for other types (bitwise operator)
+
uint128_t & operator%=(const uint128_t &p)
operator %= for uint128_t
+
bool operator>(const uint128_t &other)
operator > for uint128_t
+
uint128_t operator|(const uint128_t &p)
operator | for uint128_t (bitwise operator)
+
uint128_t & operator/=(const uint128_t &p)
operator /= for uint128_t
+
uint128_t & operator*=(const T p)
operator *= for uint128_t and other integer types.
+
uint128_t operator/(const uint128_t &p)
operator / for uint128_t and other integer types.
+
bool operator||(const uint128_t &b)
operator || for uint128_t
+
bool operator>=(const T other)
operator >= for other types
uint128_t & operator=(uint128_t &&p)=default
Move assignment operator.
-
uint128_t operator|(const T p)
operator | for other types (bitwise operator)
+
uint128_t operator|(const T p)
operator | for other types (bitwise operator)
~uint128_t()=default
Destructor for uint128_t.
-
uint128_t operator~()
operator ~ for uint128_t
-
uint128_t operator*(const uint128_t &p)
operator * for uint128_t and other integer types.
-
uint128_t & operator^=(const T &p)
operator ^= for other types (bitwise operator)
-
bool operator<=(const T other)
operator <= for other types
-
uint128_t operator*(const T p)
operator * for uint128_t and other integer types.
-
uint128_t operator+(const T p)
operator + for uint128_t and other integer types.
-
uint128_t & operator+=(const T p)
operator += for uint128_t and other integer types.
-
bool operator<(const T other)
operator < for other types
-
friend std::ostream & operator<<(std::ostream &op, const uint128_t &p)
operator << for printing uint128_t integer
+
uint128_t operator~()
operator ~ for uint128_t
+
uint128_t operator*(const uint128_t &p)
operator * for uint128_t and other integer types.
+
uint128_t & operator^=(const T &p)
operator ^= for other types (bitwise operator)
+
bool operator<=(const T other)
operator <= for other types
+
uint128_t operator*(const T p)
operator * for uint128_t and other integer types.
+
uint128_t operator+(const T p)
operator + for uint128_t and other integer types.
+
uint128_t & operator+=(const T p)
operator += for uint128_t and other integer types.
+
bool operator<(const T other)
operator < for other types
+
friend std::ostream & operator<<(std::ostream &op, const uint128_t &p)
operator << for printing uint128_t integer
uint128_t(const uint128_t &num)=default
Copy constructor.
-
uint128_t & operator|=(const T p)
operator |= for other types (bitwise operator)
-
uint128_t operator-(const T &p)
operator - for uint128_t and other integer types.
-
uint128_t operator>>(const T p)
operator >> for uint128_t
-
uint128_t operator--(int)
operator – (post-decrement)
-
bool operator!=(const T other)
operator != for other types
-
bool operator==(const T other)
operator == for other types
-
bool operator==(const uint128_t &other)
operator == for uint128_t
-
uint32_t _trz()
Trailing zeroes in binary.
-
uint128_t(uint128_t &&num) noexcept
Move constructor.
-
bool operator||(const T b)
operator || for other types
-
uint128_t operator-(const uint128_t &p)
operator - for uint128_t
-
bool operator>(const T other)
operator > for other types
-
void __get_integer_from_string(const std::string &str)
First and second half of 128 bit number.
Definition uint128_t.hpp:70
-
std::pair< uint128_t, uint128_t > divide(const uint128_t &p)
divide function for uint128_t and other integer types.
-
uint128_t operator^(const uint128_t &p)
operator ^ for uint128_t (bitwise operator)
-
uint128_t(const uint64_t high, const uint64_t low)
Parameterized constructor.
-
uint128_t & operator*=(const uint128_t &p)
operator *= for uint128_t and other integer types.
-
uint128_t & operator+=(const uint128_t &p)
operator += for uint128_t
-
uint128_t operator&(const T p)
operator & for other types (bitwise operator)
-
uint128_t & operator<<=(const T p)
operator <<= for uint128_t
-
uint64_t lower() const
returns lower 64-bit integer part
-
uint128_t & operator/=(const T p)
operator /= for uint128_t and other integer types.
-
uint128_t operator^(const T p)
operator ^ for other types (bitwise operator)
-
bool operator&&(const uint128_t &b)
operator && for uint128_t
-
bool operator!=(const uint128_t &other)
operator != for uint128_t
+
uint128_t & operator|=(const T p)
operator |= for other types (bitwise operator)
+
uint128_t operator-(const T &p)
operator - for uint128_t and other integer types.
+
uint128_t operator>>(const T p)
operator >> for uint128_t
+
uint128_t operator--(int)
operator – (post-decrement)
+
bool operator!=(const T other)
operator != for other types
+
bool operator==(const T other)
operator == for other types
+
bool operator==(const uint128_t &other)
operator == for uint128_t
+
uint32_t _trz()
Trailing zeroes in binary.
+
uint128_t(uint128_t &&num) noexcept
Move constructor.
+
bool operator||(const T b)
operator || for other types
+
uint128_t operator-(const uint128_t &p)
operator - for uint128_t
+
bool operator>(const T other)
operator > for other types
+
void __get_integer_from_string(const std::string &str)
First and second half of 128 bit number.
Definition uint128_t.hpp:63
+
std::pair< uint128_t, uint128_t > divide(const uint128_t &p)
divide function for uint128_t and other integer types.
+
uint128_t operator^(const uint128_t &p)
operator ^ for uint128_t (bitwise operator)
+
uint128_t(const uint64_t high, const uint64_t low)
Parameterized constructor.
+
uint128_t & operator*=(const uint128_t &p)
operator *= for uint128_t and other integer types.
+
uint128_t & operator+=(const uint128_t &p)
operator += for uint128_t
+
uint128_t operator&(const T p)
operator & for other types (bitwise operator)
+
uint128_t & operator<<=(const T p)
operator <<= for uint128_t
+
uint64_t lower() const
returns lower 64-bit integer part
+
uint128_t & operator/=(const T p)
operator /= for uint128_t and other integer types.
+
uint128_t operator^(const T p)
operator ^ for other types (bitwise operator)
+
bool operator&&(const uint128_t &b)
operator && for uint128_t
+
bool operator!=(const uint128_t &other)
operator != for uint128_t
uint128_t & operator=(const uint128_t &p)=default
operator = for uint128_t
-
uint128_t & operator|=(const uint128_t &p)
operator |= for uint128_t (bitwise operator)
-
uint128_t & operator=(const std::string &p)
operator = for type string
-
uint128_t & operator-=(const uint128_t &p)
operator -= for uint128_t
-
uint128_t operator%(const uint128_t &p)
operator % for uint128_t
-
uint128_t & operator&=(const uint128_t &p)
operator &= for uint128_t (bitwise operator)
-
uint128_t & operator++()
pre-increment operator
-
uint128_t & operator=(const T &p)
operator = for other types
-
bool operator<(const uint128_t &other)
operator < for uint128_t
-
uint128_t operator&(const uint128_t &p)
operator & for uint128_t (bitwise operator)
-
bool operator!()
operator ! for uint128_t
-
uint128_t(T low)
Parameterized constructor.
-
uint128_t operator%(const T &p)
operator % for uint128_t and other integer types.
-
uint128_t & operator^=(const uint128_t &p)
operator ^= for uint128_t (bitwise operator)
-
bool operator>=(const uint128_t &other)
operator >= for uint128_t
-
uint128_t operator/(const T p)
operator / for uint128_t and other integer types.
-
uint32_t _lez()
Leading zeroes in binary.
-
bool operator()()
operator () for uint128_t
-
uint128_t operator++(int)
post-increment operator
-
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:38
+
uint128_t & operator|=(const uint128_t &p)
operator |= for uint128_t (bitwise operator)
+
uint128_t & operator=(const std::string &p)
operator = for type string
+
uint128_t & operator-=(const uint128_t &p)
operator -= for uint128_t
+
uint128_t operator%(const uint128_t &p)
operator % for uint128_t
+
uint128_t & operator&=(const uint128_t &p)
operator &= for uint128_t (bitwise operator)
+
uint128_t & operator++()
pre-increment operator
+
uint128_t & operator=(const T &p)
operator = for other types
+
bool operator<(const uint128_t &other)
operator < for uint128_t
+
uint128_t operator&(const uint128_t &p)
operator & for uint128_t (bitwise operator)
+
bool operator!()
operator ! for uint128_t
+
uint128_t(T low)
Parameterized constructor.
Definition uint128_t.hpp:94
+
uint128_t operator%(const T &p)
operator % for uint128_t and other integer types.
+
uint128_t & operator^=(const uint128_t &p)
operator ^= for uint128_t (bitwise operator)
+
bool operator>=(const uint128_t &other)
operator >= for uint128_t
+
uint128_t operator/(const T p)
operator / for uint128_t and other integer types.
+
uint32_t _lez()
Leading zeroes in binary.
+
bool operator()()
operator () for uint128_t
+
uint128_t operator++(int)
post-increment operator
+
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:31
diff --git a/da/da3/uint256__t_8hpp.html b/da/da3/uint256__t_8hpp.html index 3d0859c73..abaa381a5 100644 --- a/da/da3/uint256__t_8hpp.html +++ b/da/da3/uint256__t_8hpp.html @@ -155,9 +155,6 @@ This graph shows which files directly or indirectly include this file:
- - -

Classes

struct  std::is_integral< uint256_t >
struct  std::is_arithmetic< uint256_t >
struct  std::is_unsigned< uint256_t >
class  uint256_t
 class for 256-bit unsigned integer More...
@@ -256,11 +253,11 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1046 of file uint256_t.hpp.

-
1046 {
-
1047 return uint256_t(p) != q;
-
1048}
-
class for 256-bit unsigned integer
Definition uint256_t.hpp:33
+

Definition at line 1037 of file uint256_t.hpp.

+
1037 {
+
1038 return uint256_t(p) != q;
+
1039}
+
class for 256-bit unsigned integer
Definition uint256_t.hpp:24
@@ -293,10 +290,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1001 of file uint256_t.hpp.

-
1001 {
-
1002 return uint256_t(p) % q;
-
1003}
+

Definition at line 992 of file uint256_t.hpp.

+
992 {
+
993 return uint256_t(p) % q;
+
994}
@@ -329,10 +326,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1008 of file uint256_t.hpp.

-
1008 {
-
1009 return uint256_t(p) & q;
-
1010}
+

Definition at line 999 of file uint256_t.hpp.

+
999 {
+
1000 return uint256_t(p) & q;
+
1001}
@@ -365,10 +362,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1027 of file uint256_t.hpp.

-
1027 {
-
1028 return uint256_t(p) && q;
-
1029}
+

Definition at line 1018 of file uint256_t.hpp.

+
1018 {
+
1019 return uint256_t(p) && q;
+
1020}
@@ -401,10 +398,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 989 of file uint256_t.hpp.

-
989 {
-
990 return uint256_t(p) * q;
-
991}
+

Definition at line 980 of file uint256_t.hpp.

+
980 {
+
981 return uint256_t(p) * q;
+
982}
@@ -437,10 +434,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 977 of file uint256_t.hpp.

-
977 {
-
978 return uint256_t(p) + q;
-
979}
+

Definition at line 968 of file uint256_t.hpp.

+
968 {
+
969 return uint256_t(p) + q;
+
970}
@@ -473,10 +470,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 983 of file uint256_t.hpp.

-
983 {
-
984 return (uint256_t(p) - q);
-
985}
+

Definition at line 974 of file uint256_t.hpp.

+
974 {
+
975 return (uint256_t(p) - q);
+
976}
@@ -509,10 +506,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 995 of file uint256_t.hpp.

-
995 {
-
996 return uint256_t(p) / q;
-
997}
+

Definition at line 986 of file uint256_t.hpp.

+
986 {
+
987 return uint256_t(p) / q;
+
988}
@@ -545,10 +542,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1052 of file uint256_t.hpp.

-
1052 {
-
1053 return uint256_t(p) < q;
-
1054}
+

Definition at line 1043 of file uint256_t.hpp.

+
1043 {
+
1044 return uint256_t(p) < q;
+
1045}
@@ -581,10 +578,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1058 of file uint256_t.hpp.

-
1058 {
-
1059 return uint256_t(p) <= q;
-
1060}
+

Definition at line 1049 of file uint256_t.hpp.

+
1049 {
+
1050 return uint256_t(p) <= q;
+
1051}
@@ -617,10 +614,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1040 of file uint256_t.hpp.

-
1040 {
-
1041 return uint256_t(p) == q;
-
1042}
+

Definition at line 1031 of file uint256_t.hpp.

+
1031 {
+
1032 return uint256_t(p) == q;
+
1033}
@@ -653,10 +650,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1064 of file uint256_t.hpp.

-
1064 {
-
1065 return uint256_t(p) > q;
-
1066}
+

Definition at line 1055 of file uint256_t.hpp.

+
1055 {
+
1056 return uint256_t(p) > q;
+
1057}
@@ -689,10 +686,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1070 of file uint256_t.hpp.

-
1070 {
-
1071 return uint256_t(p) >= q;
-
1072}
+

Definition at line 1061 of file uint256_t.hpp.

+
1061 {
+
1062 return uint256_t(p) >= q;
+
1063}
@@ -725,10 +722,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1020 of file uint256_t.hpp.

-
1020 {
-
1021 return uint256_t(p) ^ q;
-
1022}
+

Definition at line 1011 of file uint256_t.hpp.

+
1011 {
+
1012 return uint256_t(p) ^ q;
+
1013}
@@ -761,10 +758,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1014 of file uint256_t.hpp.

-
1014 {
-
1015 return uint256_t(p) | q;
-
1016}
+

Definition at line 1005 of file uint256_t.hpp.

+
1005 {
+
1006 return uint256_t(p) | q;
+
1007}
@@ -797,10 +794,10 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 1033 of file uint256_t.hpp.

-
1033 {
-
1034 return uint256_t(p) || q;
-
1035}
+

Definition at line 1024 of file uint256_t.hpp.

+
1024 {
+
1025 return uint256_t(p) || q;
+
1026}
diff --git a/da/da3/uint256__t_8hpp.js b/da/da3/uint256__t_8hpp.js index 8e99e8aab..8789de2d7 100644 --- a/da/da3/uint256__t_8hpp.js +++ b/da/da3/uint256__t_8hpp.js @@ -1,8 +1,5 @@ var uint256__t_8hpp = [ - [ "std::is_integral< uint256_t >", "d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html", null ], - [ "std::is_arithmetic< uint256_t >", "dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html", null ], - [ "std::is_unsigned< uint256_t >", "df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html", null ], [ "uint256_t", "d1/d83/classuint256__t.html", "d1/d83/classuint256__t" ], [ "CIPHERS_UINT256_T_HPP_", "da/da3/uint256__t_8hpp.html#a1d8c5ec5b5e419c5c8a740251485102c", null ] ]; \ No newline at end of file diff --git a/da/da3/uint256__t_8hpp_source.html b/da/da3/uint256__t_8hpp_source.html index e28da4f8c..23dc01dbe 100644 --- a/da/da3/uint256__t_8hpp_source.html +++ b/da/da3/uint256__t_8hpp_source.html @@ -131,851 +131,842 @@ document.addEventListener('DOMContentLoaded',() => { initNavTree('da/da3/uint256
16#define CIPHERS_UINT256_T_HPP_
17
18class uint256_t;
-
19
-
20template <>
-
21struct std::is_integral<uint256_t> : std::true_type {};
-
22
-
23template <>
-
24struct std::is_arithmetic<uint256_t> : std::true_type {};
-
25
-
26template <>
-
27struct std::is_unsigned<uint256_t> : std::true_type {};
-
28
-
-
33class uint256_t {
-
34 uint128_t f{}, s{};
-
35
-
-
43 void __get_integer_from_string(const std::string &str) {
-
44 this->f = this->s = uint128_t(0);
-
45 if (str.size() > 1 && str[1] == 'x') {
-
46 for (auto i = 2; i < str.size(); ++i) {
-
47 *this *= 16LL;
-
48 if (str[i] >= '0' && str[i] <= '9') {
-
49 *this += (str[i] - '0');
-
50 } else if (str[i] >= 'A' && str[i] <= 'F') {
-
51 *this += (str[i] - 'A' + 10);
-
52 } else if (str[i] >= 'a' && str[i] <= 'f') {
-
53 *this += (str[i] - 'a' + 10);
-
54 }
-
55 }
-
56 } else {
-
57 for (auto &x : str) {
-
58 *this *= 10LL;
-
59 *this += (x - '0');
-
60 }
-
61 }
-
62 }
+
19
+
+
24class uint256_t {
+
25 uint128_t f{}, s{};
+
26
+
+
34 void __get_integer_from_string(const std::string &str) {
+
35 this->f = this->s = uint128_t(0);
+
36 if (str.size() > 1 && str[1] == 'x') {
+
37 for (auto i = 2; i < str.size(); ++i) {
+
38 *this *= 16LL;
+
39 if (str[i] >= '0' && str[i] <= '9') {
+
40 *this += (str[i] - '0');
+
41 } else if (str[i] >= 'A' && str[i] <= 'F') {
+
42 *this += (str[i] - 'A' + 10);
+
43 } else if (str[i] >= 'a' && str[i] <= 'f') {
+
44 *this += (str[i] - 'a' + 10);
+
45 }
+
46 }
+
47 } else {
+
48 for (auto &x : str) {
+
49 *this *= 10LL;
+
50 *this += (x - '0');
+
51 }
+
52 }
+
53 }
-
63
-
64 public:
-
65 // Constructors
-
66 uint256_t() = default;
+
54
+
55 public:
+
56 // Constructors
+
57 uint256_t() = default;
+
58
+
64 template <typename T, typename = typename std::enable_if<
+
65 std::is_integral<T>::value, T>::type>
+
66 explicit uint256_t(T low) : f(0), s(low) {}
67
-
73 template <typename T, typename = typename std::enable_if<
-
74 std::is_integral<T>::value, T>::type>
-
75 explicit uint256_t(T low) : f(0), s(low) {}
-
76
-
-
81 explicit uint256_t(const std::string &str) {
- -
83 }
+
+
72 explicit uint256_t(const std::string &str) {
+ +
74 }
-
84
-
89 uint256_t(const uint256_t &num) = default;
-
90
-
-
95 uint256_t(uint256_t &&num) noexcept
-
96 : f(std::move(num.f)), s(std::move(num.s)) {}
+
75
+
80 uint256_t(const uint256_t &num) = default;
+
81
+
+
86 uint256_t(uint256_t &&num) noexcept
+
87 : f(std::move(num.f)), s(std::move(num.s)) {}
-
97
-
- -
104 : f(std::move(high)), s(std::move(low)) {}
+
88
+
+ +
95 : f(std::move(high)), s(std::move(low)) {}
-
105
-
111 uint256_t(const uint64_t high, const uint64_t low) : f(high), s(low) {}
-
112
-
116 ~uint256_t() = default;
-
117
-
-
123 inline uint32_t _lez() {
-
124 if (f) {
-
125 return f._lez();
-
126 }
-
127 return 128 + s._lez();
-
128 }
+
96
+
102 uint256_t(const uint64_t high, const uint64_t low) : f(high), s(low) {}
+
103
+
107 ~uint256_t() = default;
+
108
+
+
114 inline uint32_t _lez() {
+
115 if (f) {
+
116 return f._lez();
+
117 }
+
118 return 128 + s._lez();
+
119 }
-
129
-
-
135 inline uint32_t _trz() {
-
136 if (s) {
-
137 return s._trz();
-
138 }
-
139 return 128 + f._trz();
-
140 }
+
120
+
+
126 inline uint32_t _trz() {
+
127 if (s) {
+
128 return s._trz();
+
129 }
+
130 return 128 + f._trz();
+
131 }
-
141
-
146 inline explicit operator bool() const { return f || s; }
-
147
-
153 template <typename T, typename = typename std::enable_if<
-
154 std::is_integral<T>::value, T>::type>
-
-
155 inline explicit operator T() const {
-
156 return static_cast<T>(s);
-
157 }
+
132
+
137 inline explicit operator bool() const { return f || s; }
+
138
+
144 template <typename T, typename = typename std::enable_if<
+
145 std::is_integral<T>::value, T>::type>
+
+
146 inline explicit operator T() const {
+
147 return static_cast<T>(s);
+
148 }
-
158
-
163 inline explicit operator uint128_t() const { return s; }
-
164
-
169 inline uint128_t lower() const { return s; }
-
170
-
175 inline uint128_t upper() const { return f; }
-
176
-
182 inline uint256_t &operator=(const uint256_t &p) = default;
-
183
-
190 template <typename T, typename = typename std::enable_if<
-
191 std::is_integral<T>::value, T>::type>
-
-
192 inline uint256_t &operator=(const T &p) {
-
193 this->s = p;
-
194 return *this;
-
195 }
+
149
+
154 inline explicit operator uint128_t() const { return s; }
+
155
+
160 inline uint128_t lower() const { return s; }
+
161
+
166 inline uint128_t upper() const { return f; }
+
167
+
173 inline uint256_t &operator=(const uint256_t &p) = default;
+
174
+
181 template <typename T, typename = typename std::enable_if<
+
182 std::is_integral<T>::value, T>::type>
+
+
183 inline uint256_t &operator=(const T &p) {
+
184 this->s = p;
+
185 return *this;
+
186 }
-
196
-
-
202 inline uint256_t &operator=(const std::string &p) {
- -
204 return *this;
-
205 }
+
187
+
+
193 inline uint256_t &operator=(const std::string &p) {
+ +
195 return *this;
+
196 }
-
206
-
210 inline uint256_t &operator=(uint256_t &&p) = default;
-
211
-
218 template <typename T, typename = typename std::enable_if<
-
219 std::is_integral<T>::value, T>::type>
-
-
220 inline uint256_t operator+(const T &p) {
-
221 bool app = s + p < s;
-
222 return uint256_t(f + app, s + p);
-
223 }
+
197
+
201 inline uint256_t &operator=(uint256_t &&p) = default;
+
202
+
209 template <typename T, typename = typename std::enable_if<
+
210 std::is_integral<T>::value, T>::type>
+
+
211 inline uint256_t operator+(const T &p) {
+
212 bool app = s + p < s;
+
213 return uint256_t(f + app, s + p);
+
214 }
-
224
-
-
230 inline uint256_t operator+(const uint256_t &p) {
-
231 bool app = (s + p.s < s);
-
232 return {f + app + p.f, s + p.s};
-
233 }
+
215
+
+
221 inline uint256_t operator+(const uint256_t &p) {
+
222 bool app = (s + p.s < s);
+
223 return {f + app + p.f, s + p.s};
+
224 }
-
234
-
241 template <typename T, typename = typename std::enable_if<
-
242 std::is_integral<T>::value, T>::type>
-
-
243 inline uint256_t &operator+=(const T &p) {
-
244 bool app = (p + s < s);
-
245 this->f += app;
-
246 this->s += p;
-
247 return *this;
-
248 }
+
225
+
232 template <typename T, typename = typename std::enable_if<
+
233 std::is_integral<T>::value, T>::type>
+
+
234 inline uint256_t &operator+=(const T &p) {
+
235 bool app = (p + s < s);
+
236 this->f += app;
+
237 this->s += p;
+
238 return *this;
+
239 }
-
249
-
-
255 inline uint256_t &operator+=(const uint256_t &p) {
-
256 bool app = (s + p.s < s);
-
257 f = f + app + p.f;
-
258 s = s + p.s;
+
240
+
+
246 inline uint256_t &operator+=(const uint256_t &p) {
+
247 bool app = (s + p.s < s);
+
248 f = f + app + p.f;
+
249 s = s + p.s;
+
250 return *this;
+
251 }
+
+
252
+
+
257 inline uint256_t &operator++() {
+
258 *this += 1;
259 return *this;
260 }
261
-
266 inline uint256_t &operator++() {
-
267 *this += 1;
+
266 inline uint256_t operator++(int) {
+
267 ++*this;
268 return *this;
269 }
270
-
-
275 inline uint256_t operator++(int) {
-
276 ++*this;
-
277 return *this;
-
278 }
+
277 template <typename T, typename = typename std::enable_if<
+
278 std::is_integral<T>::value, T>::type>
+
+
279 inline uint256_t operator-(const T &p) {
+
280 bool app = (p > s);
+
281 return uint256_t(f - app, s - p);
+
282 }
-
279
-
286 template <typename T, typename = typename std::enable_if<
-
287 std::is_integral<T>::value, T>::type>
-
-
288 inline uint256_t operator-(const T &p) {
-
289 bool app = (p > s);
-
290 return uint256_t(f - app, s - p);
-
291 }
+
283
+
+
289 inline uint256_t operator-(const uint256_t &p) {
+
290 bool app = s < p.s;
+
291 return {f - p.f - app, s - p.s};
+
292 }
-
292
-
-
298 inline uint256_t operator-(const uint256_t &p) {
-
299 bool app = s < p.s;
-
300 return {f - p.f - app, s - p.s};
-
301 }
+
293
+
298 inline uint256_t operator-() { return ~*this + uint256_t(1); }
+
299
+
+
304 inline uint256_t &operator--() {
+
305 *this -= 1;
+
306 return *this;
+
307 }
-
302
-
307 inline uint256_t operator-() { return ~*this + uint256_t(1); }
308
-
313 inline uint256_t &operator--() {
-
314 *this -= 1;
+
313 inline uint256_t operator--(int) {
+
314 --*this;
315 return *this;
316 }
317
-
-
322 inline uint256_t operator--(int) {
-
323 --*this;
-
324 return *this;
-
325 }
+
324 template <typename T, typename = typename std::enable_if<
+
325 std::is_integral<T>::value, T>::type>
+
+
326 inline uint256_t operator-=(const T p) {
+
327 bool app = (p > s);
+
328 f = f - app;
+
329 s = s - p;
+
330 return *this;
+
331 }
-
326
-
333 template <typename T, typename = typename std::enable_if<
-
334 std::is_integral<T>::value, T>::type>
-
-
335 inline uint256_t operator-=(const T p) {
-
336 bool app = (p > s);
-
337 f = f - app;
-
338 s = s - p;
-
339 return *this;
-
340 }
+
332
+
+
338 inline uint256_t &operator-=(const uint256_t &p) {
+
339 bool app = s < p.s;
+
340 f = f - app - p.f;
+
341 s = s - p.s;
+
342 return *this;
+
343 }
-
341
-
-
347 inline uint256_t &operator-=(const uint256_t &p) {
-
348 bool app = s < p.s;
-
349 f = f - app - p.f;
-
350 s = s - p.s;
-
351 return *this;
-
352 }
+
344
+
351 template <typename T, typename = typename std::enable_if<
+
352 std::is_integral<T>::value, T>::type>
+
+
353 inline uint256_t operator*(const T &p) {
+
354 return *this * uint256_t(p);
+
355 }
-
353
-
360 template <typename T, typename = typename std::enable_if<
-
361 std::is_integral<T>::value, T>::type>
+
356
-
362 inline uint256_t operator*(const T &p) {
-
363 return *this * uint256_t(p);
-
364 }
+
362 uint256_t operator*(const uint256_t &p) {
+
363 uint128_t f_first(s.upper()), f_second(s.lower()), s_first(p.s.upper()),
+
364 s_second(p.s.lower());
+
365 uint128_t fi = f_first * s_first, se = f_first * s_second,
+
366 th = s_first * f_second, fo = s_second * f_second;
+
367 uint128_t tmp = se << 64, tmp2 = th << 64;
+
368 int cc = (tmp + tmp2 < tmp);
+
369 tmp += tmp2;
+
370 cc += (tmp + fo < tmp);
+
371 return {f * p.s + s * p.f + fi + se.upper() + th.upper() + cc,
+
372 tmp + fo};
+
373 }
-
365
-
-
371 uint256_t operator*(const uint256_t &p) {
-
372 uint128_t f_first(s.upper()), f_second(s.lower()), s_first(p.s.upper()),
-
373 s_second(p.s.lower());
-
374 uint128_t fi = f_first * s_first, se = f_first * s_second,
-
375 th = s_first * f_second, fo = s_second * f_second;
-
376 uint128_t tmp = se << 64, tmp2 = th << 64;
-
377 int cc = (tmp + tmp2 < tmp);
-
378 tmp += tmp2;
-
379 cc += (tmp + fo < tmp);
-
380 return {f * p.s + s * p.f + fi + se.upper() + th.upper() + cc,
-
381 tmp + fo};
-
382 }
+
374
+
381 template <typename T, typename = typename std::enable_if<
+
382 std::is_integral<T>::value, T>::type>
+
+
383 inline uint256_t &operator*=(const T &p) {
+
384 return (*this *= uint256_t(p));
+
385 }
-
383
-
390 template <typename T, typename = typename std::enable_if<
-
391 std::is_integral<T>::value, T>::type>
+
386
-
392 inline uint256_t &operator*=(const T &p) {
-
393 return (*this *= uint256_t(p));
-
394 }
+
392 uint256_t &operator*=(const uint256_t &p) {
+
393 uint128_t f_first(s.upper()), f_second(s.lower()), s_first(p.s.upper()),
+
394 s_second(p.s.lower());
+
395 uint128_t fi = f_first * s_first, se = f_first * s_second,
+
396 th = s_first * f_second, fo = s_second * f_second;
+
397 uint128_t tmp = se << 64, tmp2 = th << 64;
+
398 int cc = (tmp + tmp2 < tmp);
+
399 tmp += tmp2;
+
400 cc += (tmp + fo < tmp);
+
401 f = f * p.s + s * p.f + fi + se.upper() + th.upper() + cc;
+
402 s = tmp + fo;
+
403 return *this;
+
404 }
-
395
-
-
401 uint256_t &operator*=(const uint256_t &p) {
-
402 uint128_t f_first(s.upper()), f_second(s.lower()), s_first(p.s.upper()),
-
403 s_second(p.s.lower());
-
404 uint128_t fi = f_first * s_first, se = f_first * s_second,
-
405 th = s_first * f_second, fo = s_second * f_second;
-
406 uint128_t tmp = se << 64, tmp2 = th << 64;
-
407 int cc = (tmp + tmp2 < tmp);
-
408 tmp += tmp2;
-
409 cc += (tmp + fo < tmp);
-
410 f = f * p.s + s * p.f + fi + se.upper() + th.upper() + cc;
-
411 s = tmp + fo;
-
412 return *this;
-
413 }
+
405
+
+
412 std::pair<uint256_t, uint256_t> divide(const uint256_t &p) {
+
413 if (*this < p) { // if this is less than divisor
+
414 return {uint256_t(0), *this};
+
415 } else if (*this == p) { // if this is equal to divisor
+
416 return {uint256_t(1), uint256_t(0)};
+
417 }
+
418 uint256_t tmp = p, tmp2 = *this;
+
419 uint16_t left = tmp._lez() - _lez();
+
420 tmp <<= left;
+
421 uint256_t quotient(0);
+
422 uint256_t zero(0);
+
423 while (tmp2 >= p) {
+
424 uint16_t shf = tmp2._lez() - tmp._lez();
+
425 if (shf) {
+
426 tmp >>= shf;
+
427 quotient <<= shf;
+
428 left -= shf;
+
429 }
+
430 if (tmp2 < tmp) {
+
431 tmp >>= 1;
+
432 quotient <<= 1;
+
433 --left;
+
434 }
+
435 tmp2 -= tmp;
+
436 ++quotient;
+
437 }
+
438 return {quotient << left, tmp2};
+
439 }
-
414
-
-
421 std::pair<uint256_t, uint256_t> divide(const uint256_t &p) {
-
422 if (*this < p) { // if this is less than divisor
-
423 return {uint256_t(0), *this};
-
424 } else if (*this == p) { // if this is equal to divisor
-
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;
-
430 uint256_t quotient(0);
-
431 uint256_t zero(0);
-
432 while (tmp2 >= p) {
-
433 uint16_t shf = tmp2._lez() - tmp._lez();
-
434 if (shf) {
-
435 tmp >>= shf;
-
436 quotient <<= shf;
-
437 left -= shf;
-
438 }
-
439 if (tmp2 < tmp) {
-
440 tmp >>= 1;
-
441 quotient <<= 1;
-
442 --left;
-
443 }
-
444 tmp2 -= tmp;
-
445 ++quotient;
-
446 }
-
447 return {quotient << left, tmp2};
-
448 }
+
440
+
447 template <typename T, typename = typename std::enable_if<
+
448 std::is_integral<T>::value, T>::type>
+
+
449 inline uint256_t operator/(const T &p) {
+
450 uint256_t tmp = *this;
+
451 tmp /= uint256_t(p);
+
452 return tmp;
+
453 }
-
449
-
456 template <typename T, typename = typename std::enable_if<
-
457 std::is_integral<T>::value, T>::type>
-
-
458 inline uint256_t operator/(const T &p) {
-
459 uint256_t tmp = *this;
-
460 tmp /= uint256_t(p);
-
461 return tmp;
-
462 }
+
454
+
460 inline uint256_t operator/(const uint256_t &p) { return divide(p).first; }
+
461
+
+
467 inline uint256_t &operator/=(const uint256_t &p) {
+
468 *this = divide(p).first;
+
469 return *this;
+
470 }
-
463
-
469 inline uint256_t operator/(const uint256_t &p) { return divide(p).first; }
-
470
-
-
476 inline uint256_t &operator/=(const uint256_t &p) {
-
477 *this = divide(p).first;
-
478 return *this;
-
479 }
+
471
+
478 template <typename T, typename = typename std::enable_if<
+
479 std::is_integral<T>::value, T>::type>
+
+
480 inline uint256_t &operator/=(const T &p) {
+
481 *this /= uint256_t(p);
+
482 return *this;
+
483 }
-
480
-
487 template <typename T, typename = typename std::enable_if<
-
488 std::is_integral<T>::value, T>::type>
-
-
489 inline uint256_t &operator/=(const T &p) {
-
490 *this /= uint256_t(p);
-
491 return *this;
-
492 }
+
484
+
490 inline uint256_t operator%(const uint256_t &p) { return divide(p).second; }
+
491
+
498 template <typename T, typename = typename std::enable_if<
+
499 std::is_integral<T>::value, T>::type>
+
+
500 inline uint256_t operator%(const T &p) {
+
501 uint256_t tmp = *this;
+
502 tmp %= uint256_t(p);
+
503 return tmp;
+
504 }
-
493
-
499 inline uint256_t operator%(const uint256_t &p) { return divide(p).second; }
-
500
-
507 template <typename T, typename = typename std::enable_if<
-
508 std::is_integral<T>::value, T>::type>
-
-
509 inline uint256_t operator%(const T &p) {
-
510 uint256_t tmp = *this;
-
511 tmp %= uint256_t(p);
-
512 return tmp;
-
513 }
+
505
+
+
511 inline uint256_t &operator%=(const uint256_t &p) {
+
512 *this = divide(p).second;
+
513 return *this;
+
514 }
-
514
-
-
520 inline uint256_t &operator%=(const uint256_t &p) {
-
521 *this = divide(p).second;
-
522 return *this;
-
523 }
+
515
+
522 template <typename T, typename = typename std::enable_if<
+
523 std::is_integral<T>::value, T>::type>
+
+
524 inline uint256_t &operator%=(const T &p) {
+
525 *this %= uint256_t(p);
+
526 return *this;
+
527 }
-
524
-
531 template <typename T, typename = typename std::enable_if<
-
532 std::is_integral<T>::value, T>::type>
-
-
533 inline uint256_t &operator%=(const T &p) {
-
534 *this %= uint256_t(p);
-
535 return *this;
+
528
+
+
534 inline bool operator<(const uint256_t &other) {
+
535 return f < other.f || (f == other.f && s < other.s);
536 }
537
-
543 inline bool operator<(const uint256_t &other) {
-
544 return f < other.f || (f == other.f && s < other.s);
+
543 inline bool operator<=(const uint256_t &other) {
+
544 return f < other.f || (f == other.f && s <= other.s);
545 }
546
-
552 inline bool operator<=(const uint256_t &other) {
-
553 return f < other.f || (f == other.f && s <= other.s);
+
552 inline bool operator>(const uint256_t &other) {
+
553 return f > other.f || (f == other.f && s > other.s);
554 }
555
-
561 inline bool operator>(const uint256_t &other) {
-
562 return f > other.f || (f == other.f && s > other.s);
+
561 inline bool operator>=(const uint256_t &other) {
+
562 return (f > other.f) || (f == other.f && s >= other.s);
563 }
564
-
570 inline bool operator>=(const uint256_t &other) {
-
571 return (f > other.f) || (f == other.f && s >= other.s);
+
570 inline bool operator==(const uint256_t &other) {
+
571 return f == other.f && s == other.s;
572 }
573
-
579 inline bool operator==(const uint256_t &other) {
-
580 return f == other.f && s == other.s;
+
579 inline bool operator!=(const uint256_t &other) {
+
580 return !((*this) == other);
581 }
582
-
-
588 inline bool operator!=(const uint256_t &other) {
-
589 return !((*this) == other);
-
590 }
+
587 inline bool operator!() { return !f && !s; }
+
588
+
+
594 inline bool operator&&(const uint256_t &b) {
+
595 return (s || f) && (b.s || b.f);
+
596 }
-
591
-
596 inline bool operator!() { return !f && !s; }
597
-
603 inline bool operator&&(const uint256_t &b) {
-
604 return (s || f) && (b.s || b.f);
+
603 inline bool operator||(const uint256_t &b) {
+
604 return (s || f) || (b.s || b.f);
605 }
606
-
-
612 inline bool operator||(const uint256_t &b) {
-
613 return (s || f) || (b.s || b.f);
-
614 }
+
611 inline bool operator()() { return s || f; }
+
612
+
619 template <typename T, typename = typename std::enable_if<
+
620 std::is_integral<T>::value, T>::type>
+
+
621 bool operator<(const T &other) {
+
622 return *this < uint256_t(other);
+
623 }
-
615
-
620 inline bool operator()() { return s || f; }
-
621
-
628 template <typename T, typename = typename std::enable_if<
-
629 std::is_integral<T>::value, T>::type>
-
-
630 bool operator<(const T &other) {
-
631 return *this < uint256_t(other);
-
632 }
+
624
+
631 template <typename T, typename = typename std::enable_if<
+
632 std::is_integral<T>::value, T>::type>
+
+
633 bool operator<=(const T &other) {
+
634 return *this <= uint256_t(other);
+
635 }
-
633
-
640 template <typename T, typename = typename std::enable_if<
-
641 std::is_integral<T>::value, T>::type>
-
-
642 bool operator<=(const T &other) {
-
643 return *this <= uint256_t(other);
-
644 }
+
636
+
643 template <typename T, typename = typename std::enable_if<
+
644 std::is_integral<T>::value, T>::type>
+
+
645 bool operator>(const T &other) {
+
646 return *this > uint256_t(other);
+
647 }
-
645
-
652 template <typename T, typename = typename std::enable_if<
-
653 std::is_integral<T>::value, T>::type>
-
-
654 bool operator>(const T &other) {
-
655 return *this > uint256_t(other);
-
656 }
+
648
+
655 template <typename T, typename = typename std::enable_if<
+
656 std::is_integral<T>::value, T>::type>
+
+
657 bool operator>=(const T &other) {
+
658 return *this >= uint256_t(other);
+
659 }
-
657
-
664 template <typename T, typename = typename std::enable_if<
-
665 std::is_integral<T>::value, T>::type>
-
-
666 bool operator>=(const T &other) {
-
667 return *this >= uint256_t(other);
-
668 }
+
660
+
667 template <typename T, typename = typename std::enable_if<
+
668 std::is_integral<T>::value, T>::type>
+
+
669 bool operator==(const T &other) {
+
670 return *this == uint256_t(other);
+
671 }
-
669
-
676 template <typename T, typename = typename std::enable_if<
-
677 std::is_integral<T>::value, T>::type>
-
-
678 bool operator==(const T &other) {
-
679 return *this == uint256_t(other);
-
680 }
+
672
+
679 template <typename T, typename = typename std::enable_if<
+
680 std::is_integral<T>::value, T>::type>
+
+
681 bool operator!=(const T &other) {
+
682 return *this != uint256_t(other);
+
683 }
-
681
-
688 template <typename T, typename = typename std::enable_if<
-
689 std::is_integral<T>::value, T>::type>
-
-
690 bool operator!=(const T &other) {
-
691 return *this != uint256_t(other);
-
692 }
+
684
+
691 template <typename T, typename = typename std::enable_if<
+
692 std::is_integral<T>::value, T>::type>
+
+
693 inline bool operator&&(const T &b) {
+
694 return (s || f) && (b);
+
695 }
-
693
-
700 template <typename T, typename = typename std::enable_if<
-
701 std::is_integral<T>::value, T>::type>
-
-
702 inline bool operator&&(const T &b) {
-
703 return (s || f) && (b);
-
704 }
+
696
+
704 template <typename T, typename = typename std::enable_if<
+
705 std::is_integral<T>::value, T>::type>
+
+
706 inline bool operator||(const T &b) {
+
707 return (s || f) || (b);
+
708 }
-
705
-
713 template <typename T, typename = typename std::enable_if<
-
714 std::is_integral<T>::value, T>::type>
-
-
715 inline bool operator||(const T &b) {
-
716 return (s || f) || (b);
-
717 }
+
709
+
714 inline uint256_t operator~() { return {~f, ~s}; }
+
715
+
722 template <typename T, typename = typename std::enable_if<
+
723 std::is_integral<T>::value, T>::type>
+
+
724 uint256_t operator<<(const T &p) {
+
725 if (!p) {
+
726 return {this->f, this->s};
+
727 } else if (p >= 128) {
+
728 return uint256_t((this->s << (p - 128)), uint128_t(0));
+
729 }
+
730 return uint256_t((this->f << p) + (this->s >> (128 - p)),
+
731 (this->s << p));
+
732 }
-
718
-
723 inline uint256_t operator~() { return {~f, ~s}; }
-
724
-
731 template <typename T, typename = typename std::enable_if<
-
732 std::is_integral<T>::value, T>::type>
-
-
733 uint256_t operator<<(const T &p) {
-
734 if (!p) {
-
735 return {this->f, this->s};
-
736 } else if (p >= 128) {
-
737 return uint256_t((this->s << (p - 128)), uint128_t(0));
-
738 }
-
739 return uint256_t((this->f << p) + (this->s >> (128 - p)),
-
740 (this->s << p));
-
741 }
+
733
+
740 template <typename T, typename = typename std::enable_if<
+
741 std::is_integral<T>::value, T>::type>
+
+
742 uint256_t &operator<<=(const T &p) {
+
743 if (p) {
+
744 if (p >= 128) {
+
745 this->f = (this->s << (p - 128));
+
746 this->s = uint128_t(0);
+
747 } else {
+
748 f = ((this->s >> (128 - p)) + (this->f << p));
+
749 s = (this->s << p);
+
750 }
+
751 }
+
752 return *this;
+
753 }
-
742
-
749 template <typename T, typename = typename std::enable_if<
-
750 std::is_integral<T>::value, T>::type>
-
-
751 uint256_t &operator<<=(const T &p) {
-
752 if (p) {
-
753 if (p >= 128) {
-
754 this->f = (this->s << (p - 128));
-
755 this->s = uint128_t(0);
-
756 } else {
-
757 f = ((this->s >> (128 - p)) + (this->f << p));
-
758 s = (this->s << p);
-
759 }
-
760 }
-
761 return *this;
-
762 }
+
754
+
761 template <typename T, typename = typename std::enable_if<
+
762 std::is_integral<T>::value, T>::type>
+
+
763 uint256_t operator>>(const T &p) {
+
764 if (!p) {
+
765 return {this->f, this->s};
+
766 } else if (p >= 128) {
+
767 return uint256_t(uint128_t(0), (this->f >> (p - 128)));
+
768 }
+
769 return uint256_t((this->f >> p),
+
770 (this->s >> p) + (this->f << (128 - p)));
+
771 }
-
763
-
770 template <typename T, typename = typename std::enable_if<
-
771 std::is_integral<T>::value, T>::type>
-
-
772 uint256_t operator>>(const T &p) {
-
773 if (!p) {
-
774 return {this->f, this->s};
-
775 } else if (p >= 128) {
-
776 return uint256_t(uint128_t(0), (this->f >> (p - 128)));
-
777 }
-
778 return uint256_t((this->f >> p),
-
779 (this->s >> p) + (this->f << (128 - p)));
-
780 }
+
772
+
779 template <typename T, typename = typename std::enable_if<
+
780 std::is_integral<T>::value, T>::type>
+
+
781 uint256_t &operator>>=(const T &p) {
+
782 if (p) {
+
783 if (p >= 128) {
+
784 f = uint128_t(0);
+
785 s = (this->f >> (p - 128));
+
786 } else {
+
787 s = (this->s >> p) + (this->f << (128 - p));
+
788 f = (this->f >> p);
+
789 }
+
790 }
+
791 return *this;
+
792 }
-
781
-
788 template <typename T, typename = typename std::enable_if<
-
789 std::is_integral<T>::value, T>::type>
-
-
790 uint256_t &operator>>=(const T &p) {
-
791 if (p) {
-
792 if (p >= 128) {
-
793 f = uint128_t(0);
-
794 s = (this->f >> (p - 128));
-
795 } else {
-
796 s = (this->s >> p) + (this->f << (128 - p));
-
797 f = (this->f >> p);
-
798 }
-
799 }
-
800 return *this;
-
801 }
+
793
+
800 template <typename T, typename = typename std::enable_if<
+
801 std::is_integral<T>::value, T>::type>
+
+
802 inline uint256_t operator&(const T &p) {
+
803 return *this & uint256_t(p);
+
804 }
-
802
-
809 template <typename T, typename = typename std::enable_if<
-
810 std::is_integral<T>::value, T>::type>
+
805
-
811 inline uint256_t operator&(const T &p) {
-
812 return *this & uint256_t(p);
+
811 inline uint256_t operator&(const uint256_t &p) {
+
812 return {f & p.f, s & p.s};
813 }
814
-
820 inline uint256_t operator&(const uint256_t &p) {
-
821 return {f & p.f, s & p.s};
-
822 }
+
820 inline uint256_t &operator&=(const uint256_t &p) {
+
821 f &= p.f;
+
822 s &= p.s;
+
823 return *this;
+
824 }
-
823
-
-
829 inline uint256_t &operator&=(const uint256_t &p) {
-
830 f &= p.f;
-
831 s &= p.s;
-
832 return *this;
-
833 }
+
825
+
832 template <typename T, typename = typename std::enable_if<
+
833 std::is_integral<T>::value, T>::type>
+
+
834 inline uint256_t &operator&=(const T p) {
+
835 s &= p.s;
+
836 return *this;
+
837 }
-
834
-
841 template <typename T, typename = typename std::enable_if<
-
842 std::is_integral<T>::value, T>::type>
-
-
843 inline uint256_t &operator&=(const T p) {
-
844 s &= p.s;
-
845 return *this;
-
846 }
+
838
+
845 template <typename T, typename = typename std::enable_if<
+
846 std::is_integral<T>::value, T>::type>
+
+
847 inline uint256_t operator|(const T &p) {
+
848 return *this | uint256_t(p);
+
849 }
-
847
-
854 template <typename T, typename = typename std::enable_if<
-
855 std::is_integral<T>::value, T>::type>
+
850
-
856 inline uint256_t operator|(const T &p) {
-
857 return *this | uint256_t(p);
+
856 inline uint256_t operator|(const uint256_t &p) {
+
857 return {this->f | p.f, this->s | p.s};
858 }
859
-
-
865 inline uint256_t operator|(const uint256_t &p) {
-
866 return {this->f | p.f, this->s | p.s};
-
867 }
+
866 template <typename T, typename = typename std::enable_if<
+
867 std::is_integral<T>::value, T>::type>
+
+
868 inline uint256_t &operator|=(const T &p) {
+
869 s |= p;
+
870 return *this;
+
871 }
-
868
-
875 template <typename T, typename = typename std::enable_if<
-
876 std::is_integral<T>::value, T>::type>
-
-
877 inline uint256_t &operator|=(const T &p) {
-
878 s |= p;
-
879 return *this;
-
880 }
+
872
+
+
878 inline uint256_t &operator|=(const uint256_t &p) {
+
879 f |= p.f;
+
880 s |= p.s;
+
881 return *this;
+
882 }
-
881
-
-
887 inline uint256_t &operator|=(const uint256_t &p) {
-
888 f |= p.f;
-
889 s |= p.s;
-
890 return *this;
-
891 }
+
883
+
890 template <typename T, typename = typename std::enable_if<
+
891 std::is_integral<T>::value, T>::type>
+
+
892 inline uint256_t operator^(const T &p) {
+
893 return uint256_t(f, s ^ p);
+
894 }
-
892
-
899 template <typename T, typename = typename std::enable_if<
-
900 std::is_integral<T>::value, T>::type>
+
895
-
901 inline uint256_t operator^(const T &p) {
-
902 return uint256_t(f, s ^ p);
+
901 inline uint256_t operator^(const uint256_t &p) {
+
902 return {this->f ^ p.f, this->s ^ p.s};
903 }
904
-
910 inline uint256_t operator^(const uint256_t &p) {
-
911 return {this->f ^ p.f, this->s ^ p.s};
-
912 }
+
910 inline uint256_t &operator^=(const uint256_t &p) {
+
911 f ^= p.f;
+
912 s ^= p.s;
+
913 return *this;
+
914 }
-
913
-
-
919 inline uint256_t &operator^=(const uint256_t &p) {
-
920 f ^= p.f;
-
921 s ^= p.s;
-
922 return *this;
-
923 }
+
915
+
922 template <typename T, typename = typename std::enable_if<
+
923 std::is_integral<T>::value, T>::type>
+
+
924 inline uint256_t &operator^=(const T &p) {
+
925 s ^= p;
+
926 return *this;
+
927 }
-
924
-
931 template <typename T, typename = typename std::enable_if<
-
932 std::is_integral<T>::value, T>::type>
-
-
933 inline uint256_t &operator^=(const T &p) {
-
934 s ^= p;
-
935 return *this;
-
936 }
+
928
+
+
938 friend std::ostream &operator<<(std::ostream &op, uint256_t p) {
+
939 if (!p.f) {
+
940 op << p.s;
+
941 } else {
+
942 std::string out = "0", p_2 = "1";
+
943 uint128_t L(1);
+
944 for (uint64_t i = 0; i < 128; ++i) {
+
945 if ((p.s & L)) {
+
946 out = add(out, p_2);
+
947 }
+
948 p_2 = add(p_2, p_2);
+
949 L <<= 1;
+
950 }
+
951 L = uint128_t(1);
+
952 for (int i = 0; i < 128; ++i) {
+
953 if ((p.f & L)) {
+
954 out = add(out, p_2);
+
955 }
+
956 p_2 = add(p_2, p_2);
+
957 L <<= 1;
+
958 }
+
959 op << out;
+
960 }
+
961 return op;
+
962 }
-
937
-
-
947 friend std::ostream &operator<<(std::ostream &op, uint256_t p) {
-
948 if (!p.f) {
-
949 op << p.s;
-
950 } else {
-
951 std::string out = "0", p_2 = "1";
-
952 uint128_t L(1);
-
953 for (uint64_t i = 0; i < 128; ++i) {
-
954 if ((p.s & L)) {
-
955 out = add(out, p_2);
-
956 }
-
957 p_2 = add(p_2, p_2);
-
958 L <<= 1;
-
959 }
-
960 L = uint128_t(1);
-
961 for (int i = 0; i < 128; ++i) {
-
962 if ((p.f & L)) {
-
963 out = add(out, p_2);
-
964 }
-
965 p_2 = add(p_2, p_2);
-
966 L <<= 1;
-
967 }
-
968 op << out;
-
969 }
-
970 return op;
-
971 }
+
963};
-
972};
-
-
973
-
974// Artihmetic
-
975template <typename T, typename = typename std::enable_if<
-
976 std::is_integral<T>::value, T>::type>
-
977inline uint256_t operator+(const T p, const uint256_t &q) {
-
978 return uint256_t(p) + q;
-
979}
-
980
-
981template <typename T, typename = typename std::enable_if<
-
982 std::is_integral<T>::value, T>::type>
-
983inline uint256_t operator-(const T p, const uint256_t &q) {
-
984 return (uint256_t(p) - q);
-
985}
-
986
-
987template <typename T, typename = typename std::enable_if<
-
988 std::is_integral<T>::value, T>::type>
-
989inline uint256_t operator*(const T p, const uint256_t &q) {
-
990 return uint256_t(p) * q;
-
991}
-
992
-
993template <typename T, typename = typename std::enable_if<
-
994 std::is_integral<T>::value, T>::type>
-
995inline uint256_t operator/(const T p, const uint256_t &q) {
-
996 return uint256_t(p) / q;
-
997}
-
998
-
999template <typename T, typename = typename std::enable_if<
-
1000 std::is_integral<T>::value, T>::type>
-
1001inline uint256_t operator%(const T p, const uint256_t &q) {
-
1002 return uint256_t(p) % q;
-
1003}
-
1004
-
1005// Bitwise operators
-
1006template <typename T, typename = typename std::enable_if<
-
1007 std::is_integral<T>::value, T>::type>
-
1008inline uint256_t operator&(const T &p, const uint256_t &q) {
-
1009 return uint256_t(p) & q;
-
1010}
-
1011
-
1012template <typename T, typename = typename std::enable_if<
-
1013 std::is_integral<T>::value, T>::type>
-
1014inline uint256_t operator|(const T p, const uint256_t &q) {
-
1015 return uint256_t(p) | q;
-
1016}
-
1017
-
1018template <typename T, typename = typename std::enable_if<
-
1019 std::is_integral<T>::value, T>::type>
-
1020inline uint256_t operator^(const T p, const uint256_t &q) {
-
1021 return uint256_t(p) ^ q;
-
1022}
-
1023
-
1024// Boolean operators
-
1025template <typename T, typename = typename std::enable_if<
-
1026 std::is_integral<T>::value, T>::type>
-
1027inline bool operator&&(const T p, const uint256_t &q) {
-
1028 return uint256_t(p) && q;
-
1029}
-
1030
-
1031template <typename T, typename = typename std::enable_if<
-
1032 std::is_integral<T>::value, T>::type>
-
1033inline bool operator||(const T p, const uint256_t &q) {
-
1034 return uint256_t(p) || q;
-
1035}
-
1036
-
1037// Comparison operators
-
1038template <typename T, typename = typename std::enable_if<
-
1039 std::is_integral<T>::value, T>::type>
-
1040inline bool operator==(const T p, const uint256_t &q) {
-
1041 return uint256_t(p) == q;
-
1042}
-
1043
-
1044template <typename T, typename = typename std::enable_if<
-
1045 std::is_integral<T>::value, T>::type>
-
1046inline bool operator!=(const T p, const uint256_t &q) {
-
1047 return uint256_t(p) != q;
-
1048}
-
1049
-
1050template <typename T, typename = typename std::enable_if<
-
1051 std::is_integral<T>::value, T>::type>
-
1052inline bool operator<(const T p, const uint256_t &q) {
-
1053 return uint256_t(p) < q;
-
1054}
-
1055
-
1056template <typename T, typename = typename std::enable_if<
-
1057 std::is_integral<T>::value, T>::type>
-
1058inline bool operator<=(const T p, const uint256_t &q) {
-
1059 return uint256_t(p) <= q;
-
1060}
-
1061
-
1062template <typename T, typename = typename std::enable_if<
-
1063 std::is_integral<T>::value, T>::type>
-
1064inline bool operator>(const T p, const uint256_t &q) {
-
1065 return uint256_t(p) > q;
-
1066}
-
1067
-
1068template <typename T, typename = typename std::enable_if<
-
1069 std::is_integral<T>::value, T>::type>
-
1070inline bool operator>=(const T p, const uint256_t &q) {
-
1071 return uint256_t(p) >= q;
-
1072}
-
1073
-
1074#endif // CIPHERS_UINT256_T_HPP_
-
class for 128-bit unsigned integer
Definition uint128_t.hpp:60
-
uint64_t upper() const
returns upper 64-bit integer part
-
uint64_t lower() const
returns lower 64-bit integer part
-
class for 256-bit unsigned integer
Definition uint256_t.hpp:33
-
uint256_t(uint128_t high, uint128_t low)
Parameterized constructor.
-
bool operator!()
operator ! for uint256_t
-
uint32_t _lez()
Leading zeroes in binary.
-
uint256_t(uint256_t &&num) noexcept
Move constructor.
Definition uint256_t.hpp:95
-
uint256_t & operator<<=(const T &p)
operator <<= for uint256_t
-
bool operator<=(const uint256_t &other)
operator <= for uint256_t
-
uint256_t(const std::string &str)
Parameterized constructor.
Definition uint256_t.hpp:81
-
bool operator<=(const T &other)
operator <= for other types
-
uint256_t operator+(const T &p)
operator + for uint256_t and other integer types.
-
uint256_t(const uint64_t high, const uint64_t low)
Parameterized constructor.
-
uint256_t & operator%=(const uint256_t &p)
operator %= for uint256_t
-
uint256_t operator|(const uint256_t &p)
operator | for uint256_t (bitwise operator)
-
bool operator&&(const T &b)
operator && for other types
-
uint256_t & operator&=(const uint256_t &p)
operator &= for uint256_t (bitwise operator)
-
uint256_t & operator^=(const T &p)
operator ^= for other types (bitwise operator)
+
964
+
965// Artihmetic
+
966template <typename T, typename = typename std::enable_if<
+
967 std::is_integral<T>::value, T>::type>
+
968inline uint256_t operator+(const T p, const uint256_t &q) {
+
969 return uint256_t(p) + q;
+
970}
+
971
+
972template <typename T, typename = typename std::enable_if<
+
973 std::is_integral<T>::value, T>::type>
+
974inline uint256_t operator-(const T p, const uint256_t &q) {
+
975 return (uint256_t(p) - q);
+
976}
+
977
+
978template <typename T, typename = typename std::enable_if<
+
979 std::is_integral<T>::value, T>::type>
+
980inline uint256_t operator*(const T p, const uint256_t &q) {
+
981 return uint256_t(p) * q;
+
982}
+
983
+
984template <typename T, typename = typename std::enable_if<
+
985 std::is_integral<T>::value, T>::type>
+
986inline uint256_t operator/(const T p, const uint256_t &q) {
+
987 return uint256_t(p) / q;
+
988}
+
989
+
990template <typename T, typename = typename std::enable_if<
+
991 std::is_integral<T>::value, T>::type>
+
992inline uint256_t operator%(const T p, const uint256_t &q) {
+
993 return uint256_t(p) % q;
+
994}
+
995
+
996// Bitwise operators
+
997template <typename T, typename = typename std::enable_if<
+
998 std::is_integral<T>::value, T>::type>
+
999inline uint256_t operator&(const T &p, const uint256_t &q) {
+
1000 return uint256_t(p) & q;
+
1001}
+
1002
+
1003template <typename T, typename = typename std::enable_if<
+
1004 std::is_integral<T>::value, T>::type>
+
1005inline uint256_t operator|(const T p, const uint256_t &q) {
+
1006 return uint256_t(p) | q;
+
1007}
+
1008
+
1009template <typename T, typename = typename std::enable_if<
+
1010 std::is_integral<T>::value, T>::type>
+
1011inline uint256_t operator^(const T p, const uint256_t &q) {
+
1012 return uint256_t(p) ^ q;
+
1013}
+
1014
+
1015// Boolean operators
+
1016template <typename T, typename = typename std::enable_if<
+
1017 std::is_integral<T>::value, T>::type>
+
1018inline bool operator&&(const T p, const uint256_t &q) {
+
1019 return uint256_t(p) && q;
+
1020}
+
1021
+
1022template <typename T, typename = typename std::enable_if<
+
1023 std::is_integral<T>::value, T>::type>
+
1024inline bool operator||(const T p, const uint256_t &q) {
+
1025 return uint256_t(p) || q;
+
1026}
+
1027
+
1028// Comparison operators
+
1029template <typename T, typename = typename std::enable_if<
+
1030 std::is_integral<T>::value, T>::type>
+
1031inline bool operator==(const T p, const uint256_t &q) {
+
1032 return uint256_t(p) == q;
+
1033}
+
1034
+
1035template <typename T, typename = typename std::enable_if<
+
1036 std::is_integral<T>::value, T>::type>
+
1037inline bool operator!=(const T p, const uint256_t &q) {
+
1038 return uint256_t(p) != q;
+
1039}
+
1040
+
1041template <typename T, typename = typename std::enable_if<
+
1042 std::is_integral<T>::value, T>::type>
+
1043inline bool operator<(const T p, const uint256_t &q) {
+
1044 return uint256_t(p) < q;
+
1045}
+
1046
+
1047template <typename T, typename = typename std::enable_if<
+
1048 std::is_integral<T>::value, T>::type>
+
1049inline bool operator<=(const T p, const uint256_t &q) {
+
1050 return uint256_t(p) <= q;
+
1051}
+
1052
+
1053template <typename T, typename = typename std::enable_if<
+
1054 std::is_integral<T>::value, T>::type>
+
1055inline bool operator>(const T p, const uint256_t &q) {
+
1056 return uint256_t(p) > q;
+
1057}
+
1058
+
1059template <typename T, typename = typename std::enable_if<
+
1060 std::is_integral<T>::value, T>::type>
+
1061inline bool operator>=(const T p, const uint256_t &q) {
+
1062 return uint256_t(p) >= q;
+
1063}
+
1064
+
1065#endif // CIPHERS_UINT256_T_HPP_
+
class for 128-bit unsigned integer
Definition uint128_t.hpp:53
+
uint64_t upper() const
returns upper 64-bit integer part
+
uint64_t lower() const
returns lower 64-bit integer part
+
class for 256-bit unsigned integer
Definition uint256_t.hpp:24
+
uint256_t(uint128_t high, uint128_t low)
Parameterized constructor.
Definition uint256_t.hpp:94
+
bool operator!()
operator ! for uint256_t
+
uint32_t _lez()
Leading zeroes in binary.
+
uint256_t(uint256_t &&num) noexcept
Move constructor.
Definition uint256_t.hpp:86
+
uint256_t & operator<<=(const T &p)
operator <<= for uint256_t
+
bool operator<=(const uint256_t &other)
operator <= for uint256_t
+
uint256_t(const std::string &str)
Parameterized constructor.
Definition uint256_t.hpp:72
+
bool operator<=(const T &other)
operator <= for other types
+
uint256_t operator+(const T &p)
operator + for uint256_t and other integer types.
+
uint256_t(const uint64_t high, const uint64_t low)
Parameterized constructor.
+
uint256_t & operator%=(const uint256_t &p)
operator %= for uint256_t
+
uint256_t operator|(const uint256_t &p)
operator | for uint256_t (bitwise operator)
+
bool operator&&(const T &b)
operator && for other types
+
uint256_t & operator&=(const uint256_t &p)
operator &= for uint256_t (bitwise operator)
+
uint256_t & operator^=(const T &p)
operator ^= for other types (bitwise operator)
~uint256_t()=default
Destructor for uint256_t.
-
uint256_t operator-()
operator - using twos complement
-
bool operator||(const uint256_t &b)
operator || for uint256_t
+
uint256_t operator-()
operator - using twos complement
+
bool operator||(const uint256_t &b)
operator || for uint256_t
uint256_t(const uint256_t &num)=default
Copy constructor.
-
uint256_t & operator*=(const uint256_t &p)
operator *= for uint256_t and other integer types.
-
uint256_t operator>>(const T &p)
operator >> for uint256_t
-
uint256_t operator<<(const T &p)
operator << for uint256_t
-
bool operator||(const T &b)
operator || for other types
+
uint256_t & operator*=(const uint256_t &p)
operator *= for uint256_t and other integer types.
+
uint256_t operator>>(const T &p)
operator >> for uint256_t
+
uint256_t operator<<(const T &p)
operator << for uint256_t
+
bool operator||(const T &b)
operator || for other types
uint256_t & operator=(const uint256_t &p)=default
operator = for uint256_t
-
uint256_t operator/(const uint256_t &p)
operator / for uint256_t and other integer types.
-
uint256_t & operator+=(const T &p)
operator += for uint256_t and other integer types.
-
uint256_t & operator-=(const uint256_t &p)
operator -= for uint256_t
-
uint256_t operator--(int)
operator – (post-decrement)
+
uint256_t operator/(const uint256_t &p)
operator / for uint256_t and other integer types.
+
uint256_t & operator+=(const T &p)
operator += for uint256_t and other integer types.
+
uint256_t & operator-=(const uint256_t &p)
operator -= for uint256_t
+
uint256_t operator--(int)
operator – (post-decrement)
uint256_t & operator=(uint256_t &&p)=default
Move assignment operator.
-
uint256_t operator&(const T &p)
operator & for other types (bitwise operator)
-
uint256_t operator~()
operator ~ for uint256_t
-
uint256_t operator^(const uint256_t &p)
operator ^ for uint256_t (bitwise operator)
-
uint256_t & operator%=(const T &p)
operator %= for uint256_t
-
bool operator()()
operator () for uint256_t
-
uint256_t operator++(int)
post-increment operator
-
uint256_t operator%(const T &p)
operator % for uint256_t and other integer types.
-
std::pair< uint256_t, uint256_t > divide(const uint256_t &p)
divide function for uint256_t and other integer types.
-
uint256_t & operator=(const std::string &p)
operator = for type string
-
uint256_t operator-(const T &p)
operator - for uint256_t and other integer types.
-
bool operator!=(const T &other)
operator != for other types
-
bool operator==(const uint256_t &other)
operator == for uint256_t
-
friend std::ostream & operator<<(std::ostream &op, uint256_t p)
operator << for printing uint256_t integer
-
bool operator==(const T &other)
operator == for other types
-
uint256_t operator&(const uint256_t &p)
operator & for uint256_t (bitwise operator)
-
uint32_t _trz()
Trailing zeroes in binary.
-
uint256_t & operator--()
operator – (pre-decrement)
-
bool operator&&(const uint256_t &b)
operator && for uint256_t
-
uint256_t & operator|=(const uint256_t &p)
operator |= for uint256_t (bitwise operator)
-
uint128_t lower() const
returns lower 128-bit integer part
-
uint256_t operator*(const uint256_t &p)
operator * for uint256_t and other integer types.
-
uint256_t operator*(const T &p)
operator * for uint256_t and other integer types.
-
bool operator!=(const uint256_t &other)
operator != for uint256_t
-
uint256_t operator-(const uint256_t &p)
operator - for uint256_t
-
uint256_t & operator/=(const T &p)
operator /= for uint256_t and other integer types.
-
uint256_t & operator/=(const uint256_t &p)
operator /= for uint256_t
-
bool operator<(const T &other)
operator < for other types
-
uint256_t & operator+=(const uint256_t &p)
operator += for uint256_t
-
uint256_t & operator^=(const uint256_t &p)
operator ^= for uint256_t (bitwise operator)
-
uint256_t operator/(const T &p)
operator / for uint256_t and other integer types.
-
bool operator>(const uint256_t &other)
operator > for uint256_t
-
uint256_t operator^(const T &p)
operator ^ for other types (bitwise operator)
-
uint256_t operator-=(const T p)
operator -= for uint256_t and other integer types.
-
uint256_t operator|(const T &p)
operator | for other types (bitwise operator)
-
uint256_t operator%(const uint256_t &p)
operator % for uint256_t
-
bool operator>(const T &other)
operator > for other types
-
uint256_t & operator>>=(const T &p)
operator >>= for uint256_t
-
uint256_t & operator=(const T &p)
operator = for other types
-
bool operator>=(const uint256_t &other)
operator >= for uint256_t
-
uint128_t upper() const
returns upper 128-bit integer part
-
uint256_t(T low)
Parameterized constructor.
Definition uint256_t.hpp:75
-
uint256_t & operator|=(const T &p)
operator |= for other types (bitwise operator)
-
uint256_t & operator++()
pre-increment operator
-
uint256_t operator+(const uint256_t &p)
operator + for uint256_t and other integer types.
-
uint256_t & operator*=(const T &p)
operator *= for uint256_t and other integer types.
-
uint256_t & operator&=(const T p)
operator &= for other types (bitwise operator)
-
bool operator<(const uint256_t &other)
operator < for uint256_t
-
void __get_integer_from_string(const std::string &str)
First and second half of 256 bit number.
Definition uint256_t.hpp:43
-
bool operator>=(const T &other)
operator >= for other types
+
uint256_t operator&(const T &p)
operator & for other types (bitwise operator)
+
uint256_t operator~()
operator ~ for uint256_t
+
uint256_t operator^(const uint256_t &p)
operator ^ for uint256_t (bitwise operator)
+
uint256_t & operator%=(const T &p)
operator %= for uint256_t
+
bool operator()()
operator () for uint256_t
+
uint256_t operator++(int)
post-increment operator
+
uint256_t operator%(const T &p)
operator % for uint256_t and other integer types.
+
std::pair< uint256_t, uint256_t > divide(const uint256_t &p)
divide function for uint256_t and other integer types.
+
uint256_t & operator=(const std::string &p)
operator = for type string
+
uint256_t operator-(const T &p)
operator - for uint256_t and other integer types.
+
bool operator!=(const T &other)
operator != for other types
+
bool operator==(const uint256_t &other)
operator == for uint256_t
+
friend std::ostream & operator<<(std::ostream &op, uint256_t p)
operator << for printing uint256_t integer
+
bool operator==(const T &other)
operator == for other types
+
uint256_t operator&(const uint256_t &p)
operator & for uint256_t (bitwise operator)
+
uint32_t _trz()
Trailing zeroes in binary.
+
uint256_t & operator--()
operator – (pre-decrement)
+
bool operator&&(const uint256_t &b)
operator && for uint256_t
+
uint256_t & operator|=(const uint256_t &p)
operator |= for uint256_t (bitwise operator)
+
uint128_t lower() const
returns lower 128-bit integer part
+
uint256_t operator*(const uint256_t &p)
operator * for uint256_t and other integer types.
+
uint256_t operator*(const T &p)
operator * for uint256_t and other integer types.
+
bool operator!=(const uint256_t &other)
operator != for uint256_t
+
uint256_t operator-(const uint256_t &p)
operator - for uint256_t
+
uint256_t & operator/=(const T &p)
operator /= for uint256_t and other integer types.
+
uint256_t & operator/=(const uint256_t &p)
operator /= for uint256_t
+
bool operator<(const T &other)
operator < for other types
+
uint256_t & operator+=(const uint256_t &p)
operator += for uint256_t
+
uint256_t & operator^=(const uint256_t &p)
operator ^= for uint256_t (bitwise operator)
+
uint256_t operator/(const T &p)
operator / for uint256_t and other integer types.
+
bool operator>(const uint256_t &other)
operator > for uint256_t
+
uint256_t operator^(const T &p)
operator ^ for other types (bitwise operator)
+
uint256_t operator-=(const T p)
operator -= for uint256_t and other integer types.
+
uint256_t operator|(const T &p)
operator | for other types (bitwise operator)
+
uint256_t operator%(const uint256_t &p)
operator % for uint256_t
+
bool operator>(const T &other)
operator > for other types
+
uint256_t & operator>>=(const T &p)
operator >>= for uint256_t
+
uint256_t & operator=(const T &p)
operator = for other types
+
bool operator>=(const uint256_t &other)
operator >= for uint256_t
+
uint128_t upper() const
returns upper 128-bit integer part
+
uint256_t(T low)
Parameterized constructor.
Definition uint256_t.hpp:66
+
uint256_t & operator|=(const T &p)
operator |= for other types (bitwise operator)
+
uint256_t & operator++()
pre-increment operator
+
uint256_t operator+(const uint256_t &p)
operator + for uint256_t and other integer types.
+
uint256_t & operator*=(const T &p)
operator *= for uint256_t and other integer types.
+
uint256_t & operator&=(const T p)
operator &= for other types (bitwise operator)
+
bool operator<(const uint256_t &other)
operator < for uint256_t
+
void __get_integer_from_string(const std::string &str)
First and second half of 256 bit number.
Definition uint256_t.hpp:34
+
bool operator>=(const T &other)
operator >= for other types
-
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:38
+
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:31
diff --git a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.map b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.map deleted file mode 100644 index 076a0ee16..000000000 --- a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.md5 b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.md5 deleted file mode 100644 index a5d3325c5..000000000 --- a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -a8f7d2e6c774fe67f34c2f81999b394c \ No newline at end of file diff --git a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.svg b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.svg deleted file mode 100644 index e83676f2d..000000000 --- a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.svg +++ /dev/null @@ -1,59 +0,0 @@ - - - - - - - - - - - - -std::is_unsigned< uint128_t > - - -Node1 - - -std::is_unsigned< uint128_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - - - - - diff --git a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph_org.svg b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph_org.svg deleted file mode 100644 index eee5d38e0..000000000 --- a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph_org.svg +++ /dev/null @@ -1,39 +0,0 @@ - - - - - - -std::is_unsigned< uint128_t > - - -Node1 - - -std::is_unsigned< uint128_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - diff --git a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.map b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.map deleted file mode 100644 index 08b79302f..000000000 --- a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.md5 b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.md5 deleted file mode 100644 index 6915f6ced..000000000 --- a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -5da2e6ca4e559ac9044af5cacb5a1e60 \ No newline at end of file diff --git a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.svg b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.svg deleted file mode 100644 index 60685f49d..000000000 --- a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.svg +++ /dev/null @@ -1,59 +0,0 @@ - - - - - - - - - - - - -std::is_unsigned< uint256_t > - - -Node1 - - -std::is_unsigned< uint256_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - - - - - diff --git a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph_org.svg b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph_org.svg deleted file mode 100644 index 7d086d616..000000000 --- a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph_org.svg +++ /dev/null @@ -1,39 +0,0 @@ - - - - - - -std::is_unsigned< uint256_t > - - -Node1 - - -std::is_unsigned< uint256_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - diff --git a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.map b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.map deleted file mode 100644 index edbb18852..000000000 --- a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.md5 b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.md5 deleted file mode 100644 index 3fc38ad4b..000000000 --- a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -3d20965ba8a5558c00e18791af7f0bdd \ No newline at end of file diff --git a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg deleted file mode 100644 index ea1619e5d..000000000 --- a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg +++ /dev/null @@ -1,60 +0,0 @@ - - - - - - - - - - - - -std::is_arithmetic< uint128_t > - - -Node1 - - -std::is_arithmetic -< uint128_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - - - - - diff --git a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph_org.svg b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph_org.svg deleted file mode 100644 index e9adafba9..000000000 --- a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph_org.svg +++ /dev/null @@ -1,40 +0,0 @@ - - - - - - -std::is_arithmetic< uint128_t > - - -Node1 - - -std::is_arithmetic -< uint128_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - diff --git a/db/d9a/classuint128__t.html b/db/d9a/classuint128__t.html index 8330e6c87..6138d432f 100644 --- a/db/d9a/classuint128__t.html +++ b/db/d9a/classuint128__t.html @@ -351,7 +351,7 @@ Friends

Detailed Description

class for 128-bit unsigned integer

-

Definition at line 60 of file uint128_t.hpp.

+

Definition at line 53 of file uint128_t.hpp.

Constructor & Destructor Documentation

◆ uint128_t() [1/5]

@@ -392,8 +392,8 @@ template<typename T, typename = typename std::enable_if< -

Definition at line 101 of file uint128_t.hpp.

-
101: s(low) {}
+

Definition at line 94 of file uint128_t.hpp.

+
94: s(low) {}
@@ -428,11 +428,11 @@ template<typename T, typename = typename std::enable_if< -

Definition at line 107 of file uint128_t.hpp.

-
107 {
- -
109 }
-
void __get_integer_from_string(const std::string &str)
First and second half of 128 bit number.
Definition uint128_t.hpp:70
+

Definition at line 100 of file uint128_t.hpp.

+
100 {
+ +
102 }
+
void __get_integer_from_string(const std::string &str)
First and second half of 128 bit number.
Definition uint128_t.hpp:63
@@ -472,8 +472,8 @@ template<typename T, typename = typename std::enable_if< -

Definition at line 116 of file uint128_t.hpp.

-
116: f(high), s(low) {}
+

Definition at line 109 of file uint128_t.hpp.

+
109: f(high), s(low) {}
@@ -541,8 +541,8 @@ template<typename T, typename = typename std::enable_if< -

Definition at line 128 of file uint128_t.hpp.

-
128: f(num.f), s(num.s) {}
+

Definition at line 121 of file uint128_t.hpp.

+
121: f(num.f), s(num.s) {}
@@ -580,27 +580,27 @@ template<typename T, typename = typename std::enable_if<
Returns
void
-

Definition at line 70 of file uint128_t.hpp.

-
70 {
-
71 this->f = this->s = 0;
-
72 if (str.size() > 1 && str[1] == 'x') { // if hexadecimal
-
73 for (auto i = 2; i < str.size(); ++i) {
-
74 *this *= 16LL;
-
75 if (str[i] >= '0' && str[i] <= '9') {
-
76 *this += (str[i] - '0');
-
77 } else if (str[i] >= 'A' && str[i] <= 'F') {
-
78 *this += (str[i] - 'A' + 10);
-
79 } else if (str[i] >= 'a' && str[i] <= 'f') {
-
80 *this += (str[i] - 'a' + 10);
-
81 }
-
82 }
-
83 } else { // if decimal
-
84 for (auto &x : str) {
-
85 *this *= 10LL;
-
86 *this += (x - '0');
-
87 }
-
88 }
-
89 }
+

Definition at line 63 of file uint128_t.hpp.

+
63 {
+
64 this->f = this->s = 0;
+
65 if (str.size() > 1 && str[1] == 'x') { // if hexadecimal
+
66 for (auto i = 2; i < str.size(); ++i) {
+
67 *this *= 16LL;
+
68 if (str[i] >= '0' && str[i] <= '9') {
+
69 *this += (str[i] - '0');
+
70 } else if (str[i] >= 'A' && str[i] <= 'F') {
+
71 *this += (str[i] - 'A' + 10);
+
72 } else if (str[i] >= 'a' && str[i] <= 'f') {
+
73 *this += (str[i] - 'a' + 10);
+
74 }
+
75 }
+
76 } else { // if decimal
+
77 for (auto &x : str) {
+
78 *this *= 10LL;
+
79 *this += (x - '0');
+
80 }
+
81 }
+
82 }
@@ -630,24 +630,24 @@ template<typename T, typename = typename std::enable_if<

Leading zeroes in binary.

Calculates leading zeros in 128-bit integer

Returns
Integer denoting leading zeroes
-

Definition at line 140 of file uint128_t.hpp.

-
140 {
-
141#ifndef _MSC_VER
-
142 if (f) {
-
143 return __builtin_clzll(f);
-
144 }
-
145 return 64 + __builtin_clzll(s);
-
146#else
-
147 unsigned long r = 0;
-
148 _BitScanForward64(&r, f);
-
149 if (r == 64) {
-
150 unsigned long l = 0;
-
151 _BitScanForward64(&l, s);
-
152 return 64 + l;
-
153 }
-
154 return r;
-
155#endif
-
156 }
+

Definition at line 133 of file uint128_t.hpp.

+
133 {
+
134#ifndef _MSC_VER
+
135 if (f) {
+
136 return __builtin_clzll(f);
+
137 }
+
138 return 64 + __builtin_clzll(s);
+
139#else
+
140 unsigned long r = 0;
+
141 _BitScanForward64(&r, f);
+
142 if (r == 64) {
+
143 unsigned long l = 0;
+
144 _BitScanForward64(&l, s);
+
145 return 64 + l;
+
146 }
+
147 return r;
+
148#endif
+
149 }
double l(double x)
Another test function.
@@ -678,24 +678,24 @@ template<typename T, typename = typename std::enable_if<

Trailing zeroes in binary.

Calculates leading zeros in 128-bit integer

Returns
Integer denoting Trailing zeroes
-

Definition at line 163 of file uint128_t.hpp.

-
163 {
-
164#ifndef _MSC_VER
-
165 if (f) {
-
166 return __builtin_ctzll(f);
-
167 }
-
168 return 64 + __builtin_ctzll(s);
-
169#else
-
170 unsigned long r = 0;
-
171 _BitScanReverse64(&r, s);
-
172 if (r == 64) {
-
173 unsigned long l = 0;
-
174 _BitScanReverse64(&l, f);
-
175 return 64 + l;
-
176 }
-
177 return r;
-
178#endif
-
179 }
+

Definition at line 156 of file uint128_t.hpp.

+
156 {
+
157#ifndef _MSC_VER
+
158 if (f) {
+
159 return __builtin_ctzll(f);
+
160 }
+
161 return 64 + __builtin_ctzll(s);
+
162#else
+
163 unsigned long r = 0;
+
164 _BitScanReverse64(&r, s);
+
165 if (r == 64) {
+
166 unsigned long l = 0;
+
167 _BitScanReverse64(&l, f);
+
168 return 64 + l;
+
169 }
+
170 return r;
+
171#endif
+
172 }
@@ -731,36 +731,36 @@ template<typename T, typename = typename std::enable_if<
Returns
pair denoting quotient and remainder.
-

Definition at line 455 of file uint128_t.hpp.

-
455 {
-
456 if (*this < p) { // if this is less than divisor
-
457 return {uint128_t(0), *this};
-
458 } else if (*this == p) { // if this is equal to divisor
-
459 return {uint128_t(1), uint128_t(0)};
-
460 }
-
461 uint128_t tmp = p, tmp2 = *this;
-
462 uint16_t left = tmp._lez() - _lez();
-
463 tmp <<= left;
-
464 uint128_t quotient(0);
-
465 uint128_t zero(0);
-
466 while (tmp2 >= p) {
-
467 uint16_t shf = tmp2._lez() - tmp._lez();
-
468 if (shf) {
-
469 tmp >>= shf;
-
470 quotient <<= shf;
-
471 left -= shf;
-
472 }
-
473 if (tmp2 < tmp) {
-
474 tmp >>= 1;
-
475 quotient <<= 1;
-
476 --left;
-
477 }
-
478 tmp2 -= tmp;
-
479 ++quotient;
-
480 }
-
481 return {quotient << left, tmp2};
-
482 }
-
uint32_t _lez()
Leading zeroes in binary.
+

Definition at line 448 of file uint128_t.hpp.

+
448 {
+
449 if (*this < p) { // if this is less than divisor
+
450 return {uint128_t(0), *this};
+
451 } else if (*this == p) { // if this is equal to divisor
+
452 return {uint128_t(1), uint128_t(0)};
+
453 }
+
454 uint128_t tmp = p, tmp2 = *this;
+
455 uint16_t left = tmp._lez() - _lez();
+
456 tmp <<= left;
+
457 uint128_t quotient(0);
+
458 uint128_t zero(0);
+
459 while (tmp2 >= p) {
+
460 uint16_t shf = tmp2._lez() - tmp._lez();
+
461 if (shf) {
+
462 tmp >>= shf;
+
463 quotient <<= shf;
+
464 left -= shf;
+
465 }
+
466 if (tmp2 < tmp) {
+
467 tmp >>= 1;
+
468 quotient <<= 1;
+
469 --left;
+
470 }
+
471 tmp2 -= tmp;
+
472 ++quotient;
+
473 }
+
474 return {quotient << left, tmp2};
+
475 }
+
uint32_t _lez()
Leading zeroes in binary.
@@ -790,8 +790,8 @@ template<typename T, typename = typename std::enable_if<

returns lower 64-bit integer part

Returns
returns lower 64-bit integer part
-

Definition at line 202 of file uint128_t.hpp.

-
202{ return s; }
+

Definition at line 195 of file uint128_t.hpp.

+
195{ return s; }
@@ -821,8 +821,8 @@ template<typename T, typename = typename std::enable_if<

casting operator to boolean value

Returns
true if value of this is non-zero, else false
-

Definition at line 185 of file uint128_t.hpp.

-
185{ return (f || s); }
+

Definition at line 178 of file uint128_t.hpp.

+
178{ return (f || s); }
@@ -860,10 +860,10 @@ template<typename T, typename = typename std::enable_if<
Returns
integer value casted to mentioned type
-

Definition at line 194 of file uint128_t.hpp.

-
194 {
-
195 return static_cast<T>(s);
-
196 }
+

Definition at line 187 of file uint128_t.hpp.

+
187 {
+
188 return static_cast<T>(s);
+
189 }
@@ -893,8 +893,8 @@ template<typename T, typename = typename std::enable_if<

operator ! for uint128_t

Returns
true if this has zero value, else false
-

Definition at line 628 of file uint128_t.hpp.

-
628{ return !f && !s; }
+

Definition at line 621 of file uint128_t.hpp.

+
621{ return !f && !s; }
@@ -938,10 +938,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is not equal to other, else false
-

Definition at line 722 of file uint128_t.hpp.

-
722 {
-
723 return *this != uint128_t(other);
-
724 }
+

Definition at line 715 of file uint128_t.hpp.

+
715 {
+
716 return *this != uint128_t(other);
+
717 }
@@ -977,10 +977,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is not equal than other, else false
-

Definition at line 620 of file uint128_t.hpp.

-
620 {
-
621 return f != other.f || s != other.s;
-
622 }
+

Definition at line 613 of file uint128_t.hpp.

+
613 {
+
614 return f != other.f || s != other.s;
+
615 }
@@ -1024,10 +1024,10 @@ template<typename T, typename = typename std::enable_if<
Returns
unsigned 128-bit remainder.
-

Definition at line 543 of file uint128_t.hpp.

-
543 {
-
544 return *this % uint128_t(p);
-
545 }
+

Definition at line 536 of file uint128_t.hpp.

+
536 {
+
537 return *this % uint128_t(p);
+
538 }
@@ -1063,9 +1063,9 @@ template<typename T, typename = typename std::enable_if<
Returns
unsigned 128-bit remainder.
-

Definition at line 533 of file uint128_t.hpp.

-
533{ return divide(p).second; }
-
std::pair< uint128_t, uint128_t > divide(const uint128_t &p)
divide function for uint128_t and other integer types.
+

Definition at line 526 of file uint128_t.hpp.

+
526{ return divide(p).second; }
+
std::pair< uint128_t, uint128_t > divide(const uint128_t &p)
divide function for uint128_t and other integer types.
@@ -1109,11 +1109,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this set as unsigned 128-bit remainder.
-

Definition at line 565 of file uint128_t.hpp.

-
565 {
-
566 *this %= uint128_t(p);
-
567 return *this;
-
568 }
+

Definition at line 558 of file uint128_t.hpp.

+
558 {
+
559 *this %= uint128_t(p);
+
560 return *this;
+
561 }
@@ -1149,11 +1149,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this set as unsigned 128-bit remainder.
-

Definition at line 552 of file uint128_t.hpp.

-
552 {
-
553 *this = divide(p).second;
-
554 return *this;
-
555 }
+

Definition at line 545 of file uint128_t.hpp.

+
545 {
+
546 *this = divide(p).second;
+
547 return *this;
+
548 }
@@ -1197,11 +1197,11 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this & p (& is bit-wise operator)
-

Definition at line 856 of file uint128_t.hpp.

-
856 {
-
857 uint128_t tmp = *this;
-
858 return tmp & uint128_t(p);
-
859 }
+

Definition at line 849 of file uint128_t.hpp.

+
849 {
+
850 uint128_t tmp = *this;
+
851 return tmp & uint128_t(p);
+
852 }
@@ -1237,10 +1237,10 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this & p (& is bit-wise operator)
-

Definition at line 844 of file uint128_t.hpp.

-
844 {
-
845 return uint128_t(this->f & p.f, this->s & p.s);
-
846 }
+

Definition at line 837 of file uint128_t.hpp.

+
837 {
+
838 return uint128_t(this->f & p.f, this->s & p.s);
+
839 }
@@ -1284,10 +1284,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is both values are non-zero, else false
-

Definition at line 734 of file uint128_t.hpp.

-
734 {
-
735 return (f || s) && b;
-
736 }
+

Definition at line 727 of file uint128_t.hpp.

+
727 {
+
728 return (f || s) && b;
+
729 }
@@ -1323,10 +1323,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if both of the values are not zero, else false
-

Definition at line 635 of file uint128_t.hpp.

-
635 {
-
636 return (s || f) && (b.s || b.f);
-
637 }
+

Definition at line 628 of file uint128_t.hpp.

+
628 {
+
629 return (s || f) && (b.s || b.f);
+
630 }
@@ -1370,11 +1370,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this = this & p (& is bit-wise operator)
-

Definition at line 880 of file uint128_t.hpp.

-
880 {
-
881 *this &= uint128_t(p);
-
882 return *this;
-
883 }
+

Definition at line 873 of file uint128_t.hpp.

+
873 {
+
874 *this &= uint128_t(p);
+
875 return *this;
+
876 }
@@ -1410,12 +1410,12 @@ template<typename T, typename = typename std::enable_if<
Returns
this = this & p (& is bit-wise operator)
-

Definition at line 866 of file uint128_t.hpp.

-
866 {
-
867 this->f &= p.f;
-
868 this->s &= p.s;
-
869 return *this;
-
870 }
+

Definition at line 859 of file uint128_t.hpp.

+
859 {
+
860 this->f &= p.f;
+
861 this->s &= p.s;
+
862 return *this;
+
863 }
@@ -1445,8 +1445,8 @@ template<typename T, typename = typename std::enable_if<

operator () for uint128_t

Returns
true if this value is non-zero, else false
-

Definition at line 652 of file uint128_t.hpp.

-
652{ return s || f; }
+

Definition at line 645 of file uint128_t.hpp.

+
645{ return s || f; }
@@ -1490,10 +1490,10 @@ template<typename T, typename = typename std::enable_if<
Returns
multiplication of this and p, returning uint128_t integer
-

Definition at line 393 of file uint128_t.hpp.

-
393 {
-
394 return *this * uint128_t(p);
-
395 }
+

Definition at line 386 of file uint128_t.hpp.

+
386 {
+
387 return *this * uint128_t(p);
+
388 }
@@ -1529,20 +1529,20 @@ template<typename T, typename = typename std::enable_if<
Returns
multiplication of this and p, returning uint128_t integer
-

Definition at line 402 of file uint128_t.hpp.

-
402 {
-
403 uint64_t f_first = s >> 32, f_second = s & 0xFFFFFFFF,
-
404 s_first = p.s >> 32, s_second = p.s & 0xFFFFFFFF;
-
405 uint64_t fi = f_first * s_first, se = f_first * s_second,
-
406 th = s_first * f_second, fo = s_second * f_second;
-
407 uint64_t tmp = ((se & 0xFFFFFFFF) << 32), tmp2 = (th & 0xFFFFFFFF)
-
408 << 32;
-
409 int cc = (tmp + tmp2 < tmp);
-
410 tmp += tmp2;
-
411 cc += (tmp + fo < tmp);
-
412 uint64_t carry = fi + (se >> 32) + (th >> 32);
-
413 return uint128_t(this->f * p.s + this->s * p.f + carry + cc, tmp + fo);
-
414 }
+

Definition at line 395 of file uint128_t.hpp.

+
395 {
+
396 uint64_t f_first = s >> 32, f_second = s & 0xFFFFFFFF,
+
397 s_first = p.s >> 32, s_second = p.s & 0xFFFFFFFF;
+
398 uint64_t fi = f_first * s_first, se = f_first * s_second,
+
399 th = s_first * f_second, fo = s_second * f_second;
+
400 uint64_t tmp = ((se & 0xFFFFFFFF) << 32), tmp2 = (th & 0xFFFFFFFF)
+
401 << 32;
+
402 int cc = (tmp + tmp2 < tmp);
+
403 tmp += tmp2;
+
404 cc += (tmp + fo < tmp);
+
405 uint64_t carry = fi + (se >> 32) + (th >> 32);
+
406 return uint128_t(this->f * p.s + this->s * p.f + carry + cc, tmp + fo);
+
407 }
@@ -1586,11 +1586,11 @@ template<typename T, typename = typename std::enable_if<
Returns
multiplication of this and p, returning this
-

Definition at line 424 of file uint128_t.hpp.

-
424 {
-
425 *this *= uint128_t(p);
-
426 return *this;
-
427 }
+

Definition at line 417 of file uint128_t.hpp.

+
417 {
+
418 *this *= uint128_t(p);
+
419 return *this;
+
420 }
@@ -1626,21 +1626,21 @@ template<typename T, typename = typename std::enable_if<
Returns
multiplication of this and p, returning this
-

Definition at line 434 of file uint128_t.hpp.

-
434 {
-
435 uint64_t f_first = s >> 32, f_second = s & 0xFFFFFFFF,
-
436 s_first = p.s >> 32, s_second = p.s & 0xFFFFFFFF;
-
437 uint64_t fi = f_first * s_first, se = f_first * s_second,
-
438 th = s_first * f_second, fo = s_second * f_second;
-
439 uint64_t tmp = (se << 32), tmp2 = (th << 32);
-
440 int cc = (tmp + tmp2 < tmp);
-
441 tmp += tmp2;
-
442 cc += (tmp + fo < tmp);
-
443 uint64_t carry = fi + (se >> 32) + (th >> 32);
-
444 f = this->f * p.s + this->s * p.f + carry + cc;
-
445 s = tmp + fo;
-
446 return *this;
-
447 }
+

Definition at line 427 of file uint128_t.hpp.

+
427 {
+
428 uint64_t f_first = s >> 32, f_second = s & 0xFFFFFFFF,
+
429 s_first = p.s >> 32, s_second = p.s & 0xFFFFFFFF;
+
430 uint64_t fi = f_first * s_first, se = f_first * s_second,
+
431 th = s_first * f_second, fo = s_second * f_second;
+
432 uint64_t tmp = (se << 32), tmp2 = (th << 32);
+
433 int cc = (tmp + tmp2 < tmp);
+
434 tmp += tmp2;
+
435 cc += (tmp + fo < tmp);
+
436 uint64_t carry = fi + (se >> 32) + (th >> 32);
+
437 f = this->f * p.s + this->s * p.f + carry + cc;
+
438 s = tmp + fo;
+
439 return *this;
+
440 }
@@ -1684,10 +1684,10 @@ template<typename T, typename = typename std::enable_if<
Returns
addition of this and p, returning uint128_t integer
-

Definition at line 253 of file uint128_t.hpp.

-
253 {
-
254 return uint128_t(f + (p + s < s), p + s);
-
255 }
+

Definition at line 246 of file uint128_t.hpp.

+
246 {
+
247 return uint128_t(f + (p + s < s), p + s);
+
248 }
@@ -1723,10 +1723,10 @@ template<typename T, typename = typename std::enable_if<
Returns
addition of this and p, returning uint128_t integer
-

Definition at line 262 of file uint128_t.hpp.

-
262 {
-
263 return uint128_t(f + (p.s + s < s) + p.f, p.s + s);
-
264 }
+

Definition at line 255 of file uint128_t.hpp.

+
255 {
+
256 return uint128_t(f + (p.s + s < s) + p.f, p.s + s);
+
257 }
@@ -1756,11 +1756,11 @@ template<typename T, typename = typename std::enable_if<

pre-increment operator

Returns
incremented value of this.
-

Definition at line 297 of file uint128_t.hpp.

-
297 {
-
298 *this += 1;
-
299 return *this;
-
300 }
+

Definition at line 290 of file uint128_t.hpp.

+
290 {
+
291 *this += 1;
+
292 return *this;
+
293 }
@@ -1790,11 +1790,11 @@ template<typename T, typename = typename std::enable_if<

post-increment operator

Returns
incremented value of this.
-

Definition at line 306 of file uint128_t.hpp.

-
306 {
-
307 ++*this;
-
308 return *this;
-
309 }
+

Definition at line 299 of file uint128_t.hpp.

+
299 {
+
300 ++*this;
+
301 return *this;
+
302 }
@@ -1838,13 +1838,13 @@ template<typename T, typename = typename std::enable_if<
Returns
addition of this and p, returning this
-

Definition at line 274 of file uint128_t.hpp.

-
274 {
-
275 bool app = p + s < s;
-
276 this->f += app;
-
277 this->s += p;
-
278 return *this;
-
279 }
+

Definition at line 267 of file uint128_t.hpp.

+
267 {
+
268 bool app = p + s < s;
+
269 this->f += app;
+
270 this->s += p;
+
271 return *this;
+
272 }
@@ -1880,13 +1880,13 @@ template<typename T, typename = typename std::enable_if<
Returns
addition of this and p, returning this
-

Definition at line 286 of file uint128_t.hpp.

-
286 {
-
287 bool app = p.s + s < s;
-
288 f = f + app + p.f;
-
289 s = p.s + s;
-
290 return *this;
-
291 }
+

Definition at line 279 of file uint128_t.hpp.

+
279 {
+
280 bool app = p.s + s < s;
+
281 f = f + app + p.f;
+
282 s = p.s + s;
+
283 return *this;
+
284 }
@@ -1916,8 +1916,8 @@ template<typename T, typename = typename std::enable_if<

operator - using twos complement

Returns
2's complement of this.
-

Definition at line 338 of file uint128_t.hpp.

-
338{ return ~*this + uint128_t(1); }
+

Definition at line 331 of file uint128_t.hpp.

+
331{ return ~*this + uint128_t(1); }
@@ -1961,11 +1961,11 @@ template<typename T, typename = typename std::enable_if<
Returns
subtraction of this and p, returning uint128_t integer
-

Definition at line 319 of file uint128_t.hpp.

-
319 {
-
320 bool app = p > s;
-
321 return uint128_t(f - app, s - p);
-
322 }
+

Definition at line 312 of file uint128_t.hpp.

+
312 {
+
313 bool app = p > s;
+
314 return uint128_t(f - app, s - p);
+
315 }
@@ -2001,11 +2001,11 @@ template<typename T, typename = typename std::enable_if<
Returns
subtraction of this and p, returning uint128_t integer
-

Definition at line 329 of file uint128_t.hpp.

-
329 {
-
330 bool app = p.s > s;
-
331 return uint128_t(f - p.f - app, s - p.s);
-
332 }
+

Definition at line 322 of file uint128_t.hpp.

+
322 {
+
323 bool app = p.s > s;
+
324 return uint128_t(f - p.f - app, s - p.s);
+
325 }
@@ -2035,11 +2035,11 @@ template<typename T, typename = typename std::enable_if<

operator – (pre-decrement)

Returns
decremented value of this
-

Definition at line 344 of file uint128_t.hpp.

-
344 {
-
345 *this -= 1;
-
346 return *this;
-
347 }
+

Definition at line 337 of file uint128_t.hpp.

+
337 {
+
338 *this -= 1;
+
339 return *this;
+
340 }
@@ -2069,11 +2069,11 @@ template<typename T, typename = typename std::enable_if<

operator – (post-decrement)

Returns
decremented value of this
-

Definition at line 353 of file uint128_t.hpp.

-
353 {
-
354 --*this;
-
355 return *this;
-
356 }
+

Definition at line 346 of file uint128_t.hpp.

+
346 {
+
347 --*this;
+
348 return *this;
+
349 }
@@ -2117,13 +2117,13 @@ template<typename T, typename = typename std::enable_if<
Returns
subtraction of this and p, returning this
-

Definition at line 366 of file uint128_t.hpp.

-
366 {
-
367 bool app = p > s;
-
368 f -= app;
-
369 s -= p;
-
370 return *this;
-
371 }
+

Definition at line 359 of file uint128_t.hpp.

+
359 {
+
360 bool app = p > s;
+
361 f -= app;
+
362 s -= p;
+
363 return *this;
+
364 }
@@ -2159,13 +2159,13 @@ template<typename T, typename = typename std::enable_if<
Returns
subtraction of this and p, returning this
-

Definition at line 378 of file uint128_t.hpp.

-
378 {
-
379 bool app = p.s > s;
-
380 f = f - p.f - app;
-
381 s = s - p.s;
-
382 return *this;
-
383 }
+

Definition at line 371 of file uint128_t.hpp.

+
371 {
+
372 bool app = p.s > s;
+
373 f = f - p.f - app;
+
374 s = s - p.s;
+
375 return *this;
+
376 }
@@ -2209,12 +2209,12 @@ template<typename T, typename = typename std::enable_if<
Returns
unsigned 128-bit quotient.
-

Definition at line 499 of file uint128_t.hpp.

-
499 {
-
500 uint128_t tmp = *this;
-
501 tmp /= uint128_t(0, p);
-
502 return tmp;
-
503 }
+

Definition at line 492 of file uint128_t.hpp.

+
492 {
+
493 uint128_t tmp = *this;
+
494 tmp /= uint128_t(0, p);
+
495 return tmp;
+
496 }
@@ -2250,8 +2250,8 @@ template<typename T, typename = typename std::enable_if<
Returns
unsigned 128-bit quotient.
-

Definition at line 489 of file uint128_t.hpp.

-
489{ return divide(p).first; }
+

Definition at line 482 of file uint128_t.hpp.

+
482{ return divide(p).first; }
@@ -2295,11 +2295,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this set as unsigned 128-bit quotient.
-

Definition at line 523 of file uint128_t.hpp.

-
523 {
-
524 *this /= uint128_t(0, p);
-
525 return *this;
-
526 }
+

Definition at line 516 of file uint128_t.hpp.

+
516 {
+
517 *this /= uint128_t(0, p);
+
518 return *this;
+
519 }
@@ -2335,11 +2335,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this set as unsigned 128-bit quotient.
-

Definition at line 510 of file uint128_t.hpp.

-
510 {
-
511 *this = divide(p).first;
-
512 return *this;
-
513 }
+

Definition at line 503 of file uint128_t.hpp.

+
503 {
+
504 *this = divide(p).first;
+
505 return *this;
+
506 }
@@ -2383,10 +2383,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is less than other, else false
-

Definition at line 662 of file uint128_t.hpp.

-
662 {
-
663 return *this < uint128_t(other);
-
664 }
+

Definition at line 655 of file uint128_t.hpp.

+
655 {
+
656 return *this < uint128_t(other);
+
657 }
@@ -2422,10 +2422,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is less than other, else false
-

Definition at line 575 of file uint128_t.hpp.

-
575 {
-
576 return f < other.f || (f == other.f && s < other.s);
-
577 }
+

Definition at line 568 of file uint128_t.hpp.

+
568 {
+
569 return f < other.f || (f == other.f && s < other.s);
+
570 }
@@ -2469,18 +2469,18 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this shifted by p to left
-

Definition at line 765 of file uint128_t.hpp.

-
765 {
-
766 if (!p) {
-
767 return uint128_t(f, s);
-
768 } else if (p >= 64 && p <= 128) {
-
769 return uint128_t((this->s << (p - 64)), 0);
-
770 } else if (p < 64 && p > 0) {
-
771 return uint128_t((this->f << p) + ((this->s >> (64 - p))),
-
772 this->s << p);
-
773 }
-
774 return uint128_t(0);
-
775 }
+

Definition at line 758 of file uint128_t.hpp.

+
758 {
+
759 if (!p) {
+
760 return uint128_t(f, s);
+
761 } else if (p >= 64 && p <= 128) {
+
762 return uint128_t((this->s << (p - 64)), 0);
+
763 } else if (p < 64 && p > 0) {
+
764 return uint128_t((this->f << p) + ((this->s >> (64 - p))),
+
765 this->s << p);
+
766 }
+
767 return uint128_t(0);
+
768 }
@@ -2524,19 +2524,19 @@ template<typename T, typename = typename std::enable_if<
Returns
this shifted by p to left
-

Definition at line 785 of file uint128_t.hpp.

-
785 {
-
786 if (p) {
-
787 if (p >= 64 && p <= 128) {
-
788 this->f = (this->s << (p - 64));
-
789 this->s = 0;
-
790 } else {
-
791 f = ((this->f << p) + (this->s >> (64 - p)));
-
792 s = (this->s << p);
-
793 }
-
794 }
-
795 return *this;
-
796 }
+

Definition at line 778 of file uint128_t.hpp.

+
778 {
+
779 if (p) {
+
780 if (p >= 64 && p <= 128) {
+
781 this->f = (this->s << (p - 64));
+
782 this->s = 0;
+
783 } else {
+
784 f = ((this->f << p) + (this->s >> (64 - p)));
+
785 s = (this->s << p);
+
786 }
+
787 }
+
788 return *this;
+
789 }
@@ -2580,10 +2580,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is less than or equal to other, else false
-

Definition at line 674 of file uint128_t.hpp.

-
674 {
-
675 return *this <= uint128_t(other);
-
676 }
+

Definition at line 667 of file uint128_t.hpp.

+
667 {
+
668 return *this <= uint128_t(other);
+
669 }
@@ -2619,10 +2619,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is less than or equal to other, else false
-

Definition at line 584 of file uint128_t.hpp.

-
584 {
-
585 return f < other.f || (f == other.f && s <= other.s);
-
586 }
+

Definition at line 577 of file uint128_t.hpp.

+
577 {
+
578 return f < other.f || (f == other.f && s <= other.s);
+
579 }
@@ -2658,11 +2658,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this pointer with it's value equal to p
-

Definition at line 228 of file uint128_t.hpp.

-
228 {
- -
230 return *this;
-
231 }
+

Definition at line 221 of file uint128_t.hpp.

+
221 {
+ +
223 return *this;
+
224 }
@@ -2706,11 +2706,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this pointer with it's value equal to p
-

Definition at line 218 of file uint128_t.hpp.

-
218 {
-
219 this->s = p;
-
220 return *this;
-
221 }
+

Definition at line 211 of file uint128_t.hpp.

+
211 {
+
212 this->s = p;
+
213 return *this;
+
214 }
@@ -2788,10 +2788,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is equal to other, else false
-

Definition at line 710 of file uint128_t.hpp.

-
710 {
-
711 return *this == uint128_t(other);
-
712 }
+

Definition at line 703 of file uint128_t.hpp.

+
703 {
+
704 return *this == uint128_t(other);
+
705 }
@@ -2827,10 +2827,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is equal than other, else false
-

Definition at line 611 of file uint128_t.hpp.

-
611 {
-
612 return f == other.f && s == other.s;
-
613 }
+

Definition at line 604 of file uint128_t.hpp.

+
604 {
+
605 return f == other.f && s == other.s;
+
606 }
@@ -2874,10 +2874,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is greater than other, else false
-

Definition at line 686 of file uint128_t.hpp.

-
686 {
-
687 return *this > uint128_t(other);
-
688 }
+

Definition at line 679 of file uint128_t.hpp.

+
679 {
+
680 return *this > uint128_t(other);
+
681 }
@@ -2913,10 +2913,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is greater than other, else false
-

Definition at line 593 of file uint128_t.hpp.

-
593 {
-
594 return f > other.f || (f == other.f && s > other.s);
-
595 }
+

Definition at line 586 of file uint128_t.hpp.

+
586 {
+
587 return f > other.f || (f == other.f && s > other.s);
+
588 }
@@ -2960,10 +2960,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is greater than or equal other, else false
-

Definition at line 698 of file uint128_t.hpp.

-
698 {
-
699 return *this >= uint128_t(other);
-
700 }
+

Definition at line 691 of file uint128_t.hpp.

+
691 {
+
692 return *this >= uint128_t(other);
+
693 }
@@ -2999,10 +2999,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is greater than or equal than other, else false
-

Definition at line 602 of file uint128_t.hpp.

-
602 {
-
603 return (f > other.f) || (f == other.f && s >= other.s);
-
604 }
+

Definition at line 595 of file uint128_t.hpp.

+
595 {
+
596 return (f > other.f) || (f == other.f && s >= other.s);
+
597 }
@@ -3046,18 +3046,18 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this shifted by p to right
-

Definition at line 806 of file uint128_t.hpp.

-
806 {
-
807 if (!p) {
-
808 return uint128_t(this->f, this->s);
-
809 } else if (p >= 64 && p <= 128) {
-
810 return uint128_t(0, (this->f >> (p - 64)));
-
811 } else if (p < 64 && p > 0) {
-
812 return uint128_t((this->f >> p),
-
813 (this->s >> p) + (this->f << (64 - p)));
-
814 }
-
815 return uint128_t(0);
-
816 }
+

Definition at line 799 of file uint128_t.hpp.

+
799 {
+
800 if (!p) {
+
801 return uint128_t(this->f, this->s);
+
802 } else if (p >= 64 && p <= 128) {
+
803 return uint128_t(0, (this->f >> (p - 64)));
+
804 } else if (p < 64 && p > 0) {
+
805 return uint128_t((this->f >> p),
+
806 (this->s >> p) + (this->f << (64 - p)));
+
807 }
+
808 return uint128_t(0);
+
809 }
@@ -3101,19 +3101,19 @@ template<typename T, typename = typename std::enable_if<
Returns
this shifted by p to right
-

Definition at line 826 of file uint128_t.hpp.

-
826 {
-
827 if (p) {
-
828 if (p >= 64) {
-
829 f = 0;
-
830 s = (this->f >> (p - 64));
-
831 } else {
-
832 s = (this->s >> p) + (this->f << (64 - p));
-
833 f = (this->f >> p);
-
834 }
-
835 }
-
836 return *this;
-
837 }
+

Definition at line 819 of file uint128_t.hpp.

+
819 {
+
820 if (p) {
+
821 if (p >= 64) {
+
822 f = 0;
+
823 s = (this->f >> (p - 64));
+
824 } else {
+
825 s = (this->s >> p) + (this->f << (64 - p));
+
826 f = (this->f >> p);
+
827 }
+
828 }
+
829 return *this;
+
830 }
@@ -3157,10 +3157,10 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this ^ p (^ is bit-wise XOR operator)
-

Definition at line 938 of file uint128_t.hpp.

-
938 {
-
939 return uint128_t(this->f, this->s ^ p);
-
940 }
+

Definition at line 931 of file uint128_t.hpp.

+
931 {
+
932 return uint128_t(this->f, this->s ^ p);
+
933 }
@@ -3196,10 +3196,10 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this ^ p (^ is bit-wise XOR operator)
-

Definition at line 947 of file uint128_t.hpp.

-
947 {
-
948 return uint128_t(this->f ^ p.f, this->s ^ p.s);
-
949 }
+

Definition at line 940 of file uint128_t.hpp.

+
940 {
+
941 return uint128_t(this->f ^ p.f, this->s ^ p.s);
+
942 }
@@ -3243,11 +3243,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this = this ^ p (^ is bit-wise XOR operator)
-

Definition at line 970 of file uint128_t.hpp.

-
970 {
-
971 s ^= p;
-
972 return *this;
-
973 }
+

Definition at line 963 of file uint128_t.hpp.

+
963 {
+
964 s ^= p;
+
965 return *this;
+
966 }
@@ -3283,12 +3283,12 @@ template<typename T, typename = typename std::enable_if<
Returns
this = this ^ p (^ is bit-wise XOR operator)
-

Definition at line 956 of file uint128_t.hpp.

-
956 {
-
957 f ^= p.f;
-
958 s ^= p.s;
-
959 return *this;
-
960 }
+

Definition at line 949 of file uint128_t.hpp.

+
949 {
+
950 f ^= p.f;
+
951 s ^= p.s;
+
952 return *this;
+
953 }
@@ -3332,10 +3332,10 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this | p (| is bit-wise operator)
-

Definition at line 893 of file uint128_t.hpp.

-
893 {
-
894 return uint128_t(p | s);
-
895 }
+

Definition at line 886 of file uint128_t.hpp.

+
886 {
+
887 return uint128_t(p | s);
+
888 }
@@ -3371,10 +3371,10 @@ template<typename T, typename = typename std::enable_if<
Returns
value of this | p (| is bit-wise OR operator)
-

Definition at line 902 of file uint128_t.hpp.

-
902 {
-
903 return uint128_t(this->f | p.f, this->s | p.s);
-
904 }
+

Definition at line 895 of file uint128_t.hpp.

+
895 {
+
896 return uint128_t(this->f | p.f, this->s | p.s);
+
897 }
@@ -3418,11 +3418,11 @@ template<typename T, typename = typename std::enable_if<
Returns
this = this | p (| is bit-wise OR operator)
-

Definition at line 925 of file uint128_t.hpp.

-
925 {
-
926 s |= p.s;
-
927 return *this;
-
928 }
+

Definition at line 918 of file uint128_t.hpp.

+
918 {
+
919 s |= p.s;
+
920 return *this;
+
921 }
@@ -3458,12 +3458,12 @@ template<typename T, typename = typename std::enable_if<
Returns
this = this | p (| is bit-wise OR operator)
-

Definition at line 911 of file uint128_t.hpp.

-
911 {
-
912 f |= p.f;
-
913 s |= p.s;
-
914 return *this;
-
915 }
+

Definition at line 904 of file uint128_t.hpp.

+
904 {
+
905 f |= p.f;
+
906 s |= p.s;
+
907 return *this;
+
908 }
@@ -3507,10 +3507,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if this is either one of the values are non-zero, else false
-

Definition at line 747 of file uint128_t.hpp.

-
747 {
-
748 return (f || s) || b;
-
749 }
+

Definition at line 740 of file uint128_t.hpp.

+
740 {
+
741 return (f || s) || b;
+
742 }
@@ -3546,10 +3546,10 @@ template<typename T, typename = typename std::enable_if<
Returns
true if one of the values are not zero, else false
-

Definition at line 644 of file uint128_t.hpp.

-
644 {
-
645 return (s || f) || (b.s || b.f);
-
646 }
+

Definition at line 637 of file uint128_t.hpp.

+
637 {
+
638 return (s || f) || (b.s || b.f);
+
639 }
@@ -3579,8 +3579,8 @@ template<typename T, typename = typename std::enable_if<

operator ~ for uint128_t

Returns
1's complement of this number
-

Definition at line 755 of file uint128_t.hpp.

-
755{ return uint128_t(~this->f, ~this->s); }
+

Definition at line 748 of file uint128_t.hpp.

+
748{ return uint128_t(~this->f, ~this->s); }
@@ -3610,8 +3610,8 @@ template<typename T, typename = typename std::enable_if<

returns upper 64-bit integer part

Returns
returns upper 64-bit integer part
-

Definition at line 208 of file uint128_t.hpp.

-
208{ return f; }
+

Definition at line 201 of file uint128_t.hpp.

+
201{ return f; }
@@ -3654,29 +3654,29 @@ template<typename T, typename = typename std::enable_if<
Returns
op, ostream object.
-

Definition at line 984 of file uint128_t.hpp.

-
984 {
-
985 if (!p.f) {
-
986 op << p.s;
-
987 } else {
-
988 std::string out = "0", p_2 = "1";
-
989 for (int i = 0; i < 64; ++i) {
-
990 if (p.s & (1LL << i)) {
-
991 out = add(out, p_2);
-
992 }
-
993 p_2 = add(p_2, p_2);
-
994 }
-
995 for (int i = 0; i < 64; ++i) {
-
996 if (p.f & (1LL << i)) {
-
997 out = add(out, p_2);
-
998 }
-
999 p_2 = add(p_2, p_2);
-
1000 }
-
1001 op << out;
-
1002 }
-
1003 return op;
-
1004 }
-
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:38
+

Definition at line 977 of file uint128_t.hpp.

+
977 {
+
978 if (!p.f) {
+
979 op << p.s;
+
980 } else {
+
981 std::string out = "0", p_2 = "1";
+
982 for (int i = 0; i < 64; ++i) {
+
983 if (p.s & (1LL << i)) {
+
984 out = add(out, p_2);
+
985 }
+
986 p_2 = add(p_2, p_2);
+
987 }
+
988 for (int i = 0; i < 64; ++i) {
+
989 if (p.f & (1LL << i)) {
+
990 out = add(out, p_2);
+
991 }
+
992 p_2 = add(p_2, p_2);
+
993 }
+
994 op << out;
+
995 }
+
996 return op;
+
997 }
+
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:31
@@ -3701,7 +3701,7 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 61 of file uint128_t.hpp.

+

Definition at line 54 of file uint128_t.hpp.

@@ -3725,7 +3725,7 @@ template<typename T, typename = typename std::enable_if<
-

Definition at line 61 of file uint128_t.hpp.

+

Definition at line 54 of file uint128_t.hpp.

diff --git a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.map b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.map deleted file mode 100644 index 91ffb9f25..000000000 --- a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.md5 b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.md5 deleted file mode 100644 index 1a663bd01..000000000 --- a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -bbaa537b5da9cdc9be75d53307994ca9 \ No newline at end of file diff --git a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.svg b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.svg deleted file mode 100644 index 9ef9b06a9..000000000 --- a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.svg +++ /dev/null @@ -1,59 +0,0 @@ - - - - - - - - - - - - -std::is_integral< uint256_t > - - -Node1 - - -std::is_integral< uint256_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - - - - - diff --git a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph_org.svg b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph_org.svg deleted file mode 100644 index a94d4c20f..000000000 --- a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph_org.svg +++ /dev/null @@ -1,39 +0,0 @@ - - - - - - -std::is_integral< uint256_t > - - -Node1 - - -std::is_integral< uint256_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - diff --git a/dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html b/dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html deleted file mode 100644 index f7a8f3a76..000000000 --- a/dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html +++ /dev/null @@ -1,174 +0,0 @@ - - - - - - - - -TheAlgorithms/C++: std::is_arithmetic< uint256_t > Struct Reference - - - - - - - - - - - - - - - - - - - - -
-
- - - - - - - -
-
TheAlgorithms/C++ 1.0.0 -
-
All the algorithms implemented in C++
-
-
- - - - - - - - - -
-
- -
-
-
- -
-
- -
-
- - -
-
-
-
-
-
Loading...
-
Searching...
-
No Matches
-
-
-
-
- -
-
std::is_arithmetic< uint256_t > Struct Reference
-
-
-
-Inheritance diagram for std::is_arithmetic< uint256_t >:
-
-
-
[legend]
-
-Collaboration diagram for std::is_arithmetic< uint256_t >:
-
-
-
[legend]
-

Detailed Description

-
-

Definition at line 24 of file uint256_t.hpp.

-

The documentation for this struct was generated from the following file: -
-
- -
- - - - diff --git a/de/d47/string__fibonacci_8cpp.html b/de/d47/string__fibonacci_8cpp.html index 35a36e154..852710293 100644 --- a/de/d47/string__fibonacci_8cpp.html +++ b/de/d47/string__fibonacci_8cpp.html @@ -268,7 +268,7 @@ Functions
77 }
78 std::cout << fibMinus2;
79}
-
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:38
+
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:31
diff --git a/de/d47/string__fibonacci_8cpp_source.html b/de/d47/string__fibonacci_8cpp_source.html index e4056893f..38812f770 100644 --- a/de/d47/string__fibonacci_8cpp_source.html +++ b/de/d47/string__fibonacci_8cpp_source.html @@ -201,7 +201,7 @@ document.addEventListener('DOMContentLoaded',() => { initNavTree('de/d47/string_
int main()
Main function.
void fib_Accurate(uint64_t n)
-
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:38
+
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:31
diff --git a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.map b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.map deleted file mode 100644 index e136109d8..000000000 --- a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.md5 b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.md5 deleted file mode 100644 index 7da104bd8..000000000 --- a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -38418cdb629a508d14caedeb9b71e651 \ No newline at end of file diff --git a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.svg b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.svg deleted file mode 100644 index a255ddefd..000000000 --- a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.svg +++ /dev/null @@ -1,60 +0,0 @@ - - - - - - - - - - - - -std::is_arithmetic< uint256_t > - - -Node1 - - -std::is_arithmetic -< uint256_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - - - - - diff --git a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph_org.svg b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph_org.svg deleted file mode 100644 index 6695e83bd..000000000 --- a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph_org.svg +++ /dev/null @@ -1,40 +0,0 @@ - - - - - - -std::is_arithmetic< uint256_t > - - -Node1 - - -std::is_arithmetic -< uint256_t > - - - - - -Node2 - - -std::true_type - - - - - -Node2->Node1 - - - - - - - - diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp.html b/df/d2c/elliptic__curve__key__exchange_8cpp.html index 7dfa9beb3..b1bc5295b 100644 --- a/df/d2c/elliptic__curve__key__exchange_8cpp.html +++ b/df/d2c/elliptic__curve__key__exchange_8cpp.html @@ -297,7 +297,7 @@ Functions
312 // Check whether shared keys are equal
313 assert(alice_shared_key == bob_shared_key);
314}
-
class for 256-bit unsigned integer
Definition uint256_t.hpp:33
+
class for 256-bit unsigned integer
Definition uint256_t.hpp:24
int multiply(int x, int res[], int res_size)
@@ -357,7 +357,7 @@ Functions
221 assert((a ^ b) == uint128_t("12321421424217440294"));
222 assert((a << 64) == uint128_t("227290107637132170748078080907806769152"));
223}
-
class for 128-bit unsigned integer
Definition uint128_t.hpp:60
+
class for 128-bit unsigned integer
Definition uint128_t.hpp:53
diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp_source.html b/df/d2c/elliptic__curve__key__exchange_8cpp_source.html index 452250609..79195312e 100644 --- a/df/d2c/elliptic__curve__key__exchange_8cpp_source.html +++ b/df/d2c/elliptic__curve__key__exchange_8cpp_source.html @@ -356,8 +356,8 @@ document.addEventListener('DOMContentLoaded',() => { initNavTree('df/d2c/ellipti
325}
test
void test()
Definition caesar_cipher.cpp:100
-
uint128_t
class for 128-bit unsigned integer
Definition uint128_t.hpp:60
-
uint256_t
class for 256-bit unsigned integer
Definition uint256_t.hpp:33
+
uint128_t
class for 128-bit unsigned integer
Definition uint128_t.hpp:53
+
uint256_t
class for 256-bit unsigned integer
Definition uint256_t.hpp:24
uint256_t_tests
static void uint256_t_tests()
Function to test the uint256_t header.
Definition elliptic_curve_key_exchange.cpp:230
uint128_t_tests
static void uint128_t_tests()
Function to test the uint128_t header.
Definition elliptic_curve_key_exchange.cpp:197
main
int main()
Main function.
Definition generate_parentheses.cpp:110
diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html index b2663d90b..cb68110db 100644 --- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html +++ b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html @@ -260,7 +260,7 @@ Functions
150 c.y = (((lambda * (a.x + mod - c.x)) % mod) + mod - a.y) % mod;
151 return c;
152}
-
uint256_t
class for 256-bit unsigned integer
Definition uint256_t.hpp:33
+
uint256_t
class for 256-bit unsigned integer
Definition uint256_t.hpp:24
ciphers::elliptic_curve_key_exchange::exp
uint256_t exp(uint256_t number, uint256_t power, const uint256_t &mod)
This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio...
Definition elliptic_curve_key_exchange.cpp:78
Point::y
int y
Point respect to x coordinate.
Definition line_segment_intersection.cpp:14
ciphers::elliptic_curve_key_exchange::Point
Definition of struct Point.
Definition elliptic_curve_key_exchange.cpp:46
diff --git a/df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html b/df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html deleted file mode 100644 index d845d1451..000000000 --- a/df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html +++ /dev/null @@ -1,174 +0,0 @@ - - - - - - - - -TheAlgorithms/C++: std::is_unsigned< uint256_t > Struct Reference - - - - - - - - - - - - - - - - - - - - -
-
- - - - - - - -
-
TheAlgorithms/C++ 1.0.0 -
-
All the algorithms implemented in C++
-
-
- - - - - - - - - -
-
- -
-
-
- -
-
- -
-
- - -
-
-
-
-
-
Loading...
-
Searching...
-
No Matches
-
-
-
-
- -
-
std::is_unsigned< uint256_t > Struct Reference
-
-
-
-Inheritance diagram for std::is_unsigned< uint256_t >:
-
-
-
[legend]
-
-Collaboration diagram for std::is_unsigned< uint256_t >:
-
-
-
[legend]
-

Detailed Description

-
-

Definition at line 27 of file uint256_t.hpp.

-

The documentation for this struct was generated from the following file: -
-
- -
- - - - diff --git a/doxygen_crawl.html b/doxygen_crawl.html index bd4d78ac0..b66cd48bd 100644 --- a/doxygen_crawl.html +++ b/doxygen_crawl.html @@ -515,7 +515,6 @@ - @@ -526,7 +525,6 @@ - @@ -973,7 +971,6 @@ - @@ -1448,7 +1445,6 @@ - @@ -2641,7 +2637,6 @@ - @@ -3271,7 +3266,6 @@ - diff --git a/hierarchy.html b/hierarchy.html index 9b41562ad..62daa63b5 100644 --- a/hierarchy.html +++ b/hierarchy.html @@ -274,18 +274,11 @@ This inheritance list is sorted roughly, but not completely, alphabetically: CTrie  Cdata_structures::trieTrie implementation for small-case English alphabets a-z  CTrie::TrieNode - Cstd::true_type -  Cstd::is_arithmetic< uint128_t > -  Cstd::is_arithmetic< uint256_t > -  Cstd::is_integral< uint128_t > -  Cstd::is_integral< uint256_t > -  Cstd::is_unsigned< uint128_t > -  Cstd::is_unsigned< uint256_t > - Cuint128_tClass for 128-bit unsigned integer - Cuint256_tClass for 256-bit unsigned integer - Cunordered_set< K >STL class - Cvector< T >STL class - Cprobability::windowed_median::WindowedMedianA class to calculate the median of a leading sliding window at the back of a stream of integer values + Cuint128_tClass for 128-bit unsigned integer + Cuint256_tClass for 256-bit unsigned integer + Cunordered_set< K >STL class + Cvector< T >STL class + Cprobability::windowed_median::WindowedMedianA class to calculate the median of a leading sliding window at the back of a stream of integer values diff --git a/hierarchy.js b/hierarchy.js index 54ba3d494..fe7576a13 100644 --- a/hierarchy.js +++ b/hierarchy.js @@ -136,14 +136,6 @@ var hierarchy = [ "Trie", "dd/d2f/class_trie.html", null ], [ "data_structures::trie", "d0/d3e/classdata__structures_1_1trie.html", null ], [ "Trie::TrieNode", "de/d48/struct_trie_1_1_trie_node.html", null ], - [ "std::true_type", null, [ - [ "std::is_arithmetic< uint128_t >", "d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html", null ], - [ "std::is_arithmetic< uint256_t >", "dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html", null ], - [ "std::is_integral< uint128_t >", "d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html", null ], - [ "std::is_integral< uint256_t >", "d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html", null ], - [ "std::is_unsigned< uint128_t >", "d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html", null ], - [ "std::is_unsigned< uint256_t >", "df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html", null ] - ] ], [ "uint128_t", "db/d9a/classuint128__t.html", null ], [ "uint256_t", "d1/d83/classuint256__t.html", null ], [ "unordered_set< K >", "d3/d6d/classunordered__set.html", null ], diff --git a/inherit_graph_114.map b/inherit_graph_114.map index 9ce473872..453f8f72c 100644 --- a/inherit_graph_114.map +++ b/inherit_graph_114.map @@ -1,15 +1,3 @@ - - - - - - - - - - - - - + diff --git a/inherit_graph_114.md5 b/inherit_graph_114.md5 index 23de87cac..d2b23f2ce 100644 --- a/inherit_graph_114.md5 +++ b/inherit_graph_114.md5 @@ -1 +1 @@ -40148db2c502b9385ae4dd5781440f30 \ No newline at end of file +d6ee5f042479b5982faa79c9932e1b9c \ No newline at end of file diff --git a/inherit_graph_114.svg b/inherit_graph_114.svg index 4ba3fa05a..1d5575a27 100644 --- a/inherit_graph_114.svg +++ b/inherit_graph_114.svg @@ -4,126 +4,17 @@ - - + + Graphical Class Hierarchy Node0 - - -std::true_type - - - - - -Node1 - - -std::is_arithmetic -< uint128_t > - - - - - -Node0->Node1 - - - - - - - - -Node2 - - -std::is_arithmetic -< uint256_t > - - - - - -Node0->Node2 - - - - - - - - -Node3 - - -std::is_integral< uint128_t > - - - - - -Node0->Node3 - - - - - - - - -Node4 - - -std::is_integral< uint256_t > - - - - - -Node0->Node4 - - - - - - - - -Node5 - - -std::is_unsigned< uint128_t > - - - - - -Node0->Node5 - - - - - - - - -Node6 - - -std::is_unsigned< uint256_t > - - - - - -Node0->Node6 - - - + + +strings::boyer_moore +::pattern diff --git a/inherit_graph_115.map b/inherit_graph_115.map index 453f8f72c..cd9e94752 100644 --- a/inherit_graph_115.map +++ b/inherit_graph_115.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_115.md5 b/inherit_graph_115.md5 index d2b23f2ce..2cfb4dbc5 100644 --- a/inherit_graph_115.md5 +++ b/inherit_graph_115.md5 @@ -1 +1 @@ -d6ee5f042479b5982faa79c9932e1b9c \ No newline at end of file +abd7e48c602c9ba41e00a619e3234e23 \ No newline at end of file diff --git a/inherit_graph_115.svg b/inherit_graph_115.svg index 1d5575a27..9e41d66f4 100644 --- a/inherit_graph_115.svg +++ b/inherit_graph_115.svg @@ -4,17 +4,16 @@ - - + + Graphical Class Hierarchy Node0 - - -strings::boyer_moore -::pattern + + +TestCase diff --git a/inherit_graph_116.map b/inherit_graph_116.map index cd9e94752..e74b1f7a1 100644 --- a/inherit_graph_116.map +++ b/inherit_graph_116.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_116.md5 b/inherit_graph_116.md5 index 2cfb4dbc5..078c92174 100644 --- a/inherit_graph_116.md5 +++ b/inherit_graph_116.md5 @@ -1 +1 @@ -abd7e48c602c9ba41e00a619e3234e23 \ No newline at end of file +a9d8d2a80cdf35dfac76eecdbb209456 \ No newline at end of file diff --git a/inherit_graph_116.svg b/inherit_graph_116.svg index 9e41d66f4..47af33246 100644 --- a/inherit_graph_116.svg +++ b/inherit_graph_116.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -TestCase + + +TestCases diff --git a/inherit_graph_117.map b/inherit_graph_117.map index e74b1f7a1..841a8f125 100644 --- a/inherit_graph_117.map +++ b/inherit_graph_117.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_117.md5 b/inherit_graph_117.md5 index 078c92174..63fa19da8 100644 --- a/inherit_graph_117.md5 +++ b/inherit_graph_117.md5 @@ -1 +1 @@ -a9d8d2a80cdf35dfac76eecdbb209456 \ No newline at end of file +1582871a9977d1f8d834882bd9106e10 \ No newline at end of file diff --git a/inherit_graph_117.svg b/inherit_graph_117.svg index 47af33246..8e6fe137e 100644 --- a/inherit_graph_117.svg +++ b/inherit_graph_117.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -TestCases + + +tests::CircularLinkedList diff --git a/inherit_graph_118.map b/inherit_graph_118.map index 841a8f125..c53212423 100644 --- a/inherit_graph_118.map +++ b/inherit_graph_118.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_118.md5 b/inherit_graph_118.md5 index 63fa19da8..40517ff58 100644 --- a/inherit_graph_118.md5 +++ b/inherit_graph_118.md5 @@ -1 +1 @@ -1582871a9977d1f8d834882bd9106e10 \ No newline at end of file +f45d6d50ceb0ddd3bcef9faae75ffa44 \ No newline at end of file diff --git a/inherit_graph_118.svg b/inherit_graph_118.svg index 8e6fe137e..d76897ded 100644 --- a/inherit_graph_118.svg +++ b/inherit_graph_118.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -tests::CircularLinkedList + + +tests::Node diff --git a/inherit_graph_119.map b/inherit_graph_119.map index c53212423..a7d2146ab 100644 --- a/inherit_graph_119.map +++ b/inherit_graph_119.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_119.md5 b/inherit_graph_119.md5 index 40517ff58..74da2954d 100644 --- a/inherit_graph_119.md5 +++ b/inherit_graph_119.md5 @@ -1 +1 @@ -f45d6d50ceb0ddd3bcef9faae75ffa44 \ No newline at end of file +76f1c23145670e75e2e13d0451b74420 \ No newline at end of file diff --git a/inherit_graph_119.svg b/inherit_graph_119.svg index d76897ded..20df9ddad 100644 --- a/inherit_graph_119.svg +++ b/inherit_graph_119.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -tests::Node + + +tower diff --git a/inherit_graph_120.map b/inherit_graph_120.map index a7d2146ab..49a477185 100644 --- a/inherit_graph_120.map +++ b/inherit_graph_120.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_120.md5 b/inherit_graph_120.md5 index 74da2954d..94955023c 100644 --- a/inherit_graph_120.md5 +++ b/inherit_graph_120.md5 @@ -1 +1 @@ -76f1c23145670e75e2e13d0451b74420 \ No newline at end of file +845eae9f7c70e50cf22fb926bd9e034b \ No newline at end of file diff --git a/inherit_graph_120.svg b/inherit_graph_120.svg index 20df9ddad..23f8ef979 100644 --- a/inherit_graph_120.svg +++ b/inherit_graph_120.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -tower + + +Trie diff --git a/inherit_graph_121.map b/inherit_graph_121.map index 49a477185..9694ad8d8 100644 --- a/inherit_graph_121.map +++ b/inherit_graph_121.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_121.md5 b/inherit_graph_121.md5 index 94955023c..0362b08cb 100644 --- a/inherit_graph_121.md5 +++ b/inherit_graph_121.md5 @@ -1 +1 @@ -845eae9f7c70e50cf22fb926bd9e034b \ No newline at end of file +a8666508fe9ca12fb7281895f580da44 \ No newline at end of file diff --git a/inherit_graph_121.svg b/inherit_graph_121.svg index 23f8ef979..1e815fae2 100644 --- a/inherit_graph_121.svg +++ b/inherit_graph_121.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -Trie + + +Trie::TrieNode diff --git a/inherit_graph_122.map b/inherit_graph_122.map index 9694ad8d8..09e168ce1 100644 --- a/inherit_graph_122.map +++ b/inherit_graph_122.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_122.md5 b/inherit_graph_122.md5 index 0362b08cb..f04050dca 100644 --- a/inherit_graph_122.md5 +++ b/inherit_graph_122.md5 @@ -1 +1 @@ -a8666508fe9ca12fb7281895f580da44 \ No newline at end of file +eed75a69314afbb385b920f554ca3c5d \ No newline at end of file diff --git a/inherit_graph_122.svg b/inherit_graph_122.svg index 1e815fae2..f31f429b8 100644 --- a/inherit_graph_122.svg +++ b/inherit_graph_122.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -Trie::TrieNode + + +uint128_t diff --git a/inherit_graph_123.map b/inherit_graph_123.map index 09e168ce1..3f8684b8d 100644 --- a/inherit_graph_123.map +++ b/inherit_graph_123.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_123.md5 b/inherit_graph_123.md5 index f04050dca..8c62d9521 100644 --- a/inherit_graph_123.md5 +++ b/inherit_graph_123.md5 @@ -1 +1 @@ -eed75a69314afbb385b920f554ca3c5d \ No newline at end of file +805bd0d28e53f8af03d7b4e5906cc299 \ No newline at end of file diff --git a/inherit_graph_123.svg b/inherit_graph_123.svg index f31f429b8..47f709731 100644 --- a/inherit_graph_123.svg +++ b/inherit_graph_123.svg @@ -11,9 +11,9 @@ Node0 - + -uint128_t +uint256_t diff --git a/inherit_graph_124.map b/inherit_graph_124.map index 3f8684b8d..10b9ad051 100644 --- a/inherit_graph_124.map +++ b/inherit_graph_124.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_124.md5 b/inherit_graph_124.md5 index 8c62d9521..54fdc777a 100644 --- a/inherit_graph_124.md5 +++ b/inherit_graph_124.md5 @@ -1 +1 @@ -805bd0d28e53f8af03d7b4e5906cc299 \ No newline at end of file +5fe4884033b64eb41fe44c44e59aee59 \ No newline at end of file diff --git a/inherit_graph_124.svg b/inherit_graph_124.svg index 47f709731..83dd45f29 100644 --- a/inherit_graph_124.svg +++ b/inherit_graph_124.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -uint256_t + + +unordered_set< K > diff --git a/inherit_graph_125.map b/inherit_graph_125.map index 10b9ad051..249bdf5b5 100644 --- a/inherit_graph_125.map +++ b/inherit_graph_125.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_125.md5 b/inherit_graph_125.md5 index 54fdc777a..30062d7f6 100644 --- a/inherit_graph_125.md5 +++ b/inherit_graph_125.md5 @@ -1 +1 @@ -5fe4884033b64eb41fe44c44e59aee59 \ No newline at end of file +bc85700fd7a036122fb3c15121d43845 \ No newline at end of file diff --git a/inherit_graph_125.svg b/inherit_graph_125.svg index 83dd45f29..954e550ff 100644 --- a/inherit_graph_125.svg +++ b/inherit_graph_125.svg @@ -4,16 +4,17 @@ - - + + Graphical Class Hierarchy Node0 - - -unordered_set< K > + + +unordered_set< K > +::const_iterator diff --git a/inherit_graph_126.map b/inherit_graph_126.map index 249bdf5b5..180153bbc 100644 --- a/inherit_graph_126.map +++ b/inherit_graph_126.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_126.md5 b/inherit_graph_126.md5 index 30062d7f6..3d40106eb 100644 --- a/inherit_graph_126.md5 +++ b/inherit_graph_126.md5 @@ -1 +1 @@ -bc85700fd7a036122fb3c15121d43845 \ No newline at end of file +fcf28c9d89cca0709eac3878d94430f4 \ No newline at end of file diff --git a/inherit_graph_126.svg b/inherit_graph_126.svg index 954e550ff..0ac1f59c0 100644 --- a/inherit_graph_126.svg +++ b/inherit_graph_126.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy Node0 - - + + unordered_set< K > -::const_iterator +::const_reverse_iterator diff --git a/inherit_graph_127.map b/inherit_graph_127.map index 180153bbc..40f71bbf4 100644 --- a/inherit_graph_127.map +++ b/inherit_graph_127.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_127.md5 b/inherit_graph_127.md5 index 3d40106eb..7176e9459 100644 --- a/inherit_graph_127.md5 +++ b/inherit_graph_127.md5 @@ -1 +1 @@ -fcf28c9d89cca0709eac3878d94430f4 \ No newline at end of file +d726de060ffc7b8e70f3bd633c5e676f \ No newline at end of file diff --git a/inherit_graph_127.svg b/inherit_graph_127.svg index 0ac1f59c0..2631b8add 100644 --- a/inherit_graph_127.svg +++ b/inherit_graph_127.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy Node0 - - + + unordered_set< K > -::const_reverse_iterator +::iterator diff --git a/inherit_graph_128.map b/inherit_graph_128.map index 40f71bbf4..8a46a1ac5 100644 --- a/inherit_graph_128.map +++ b/inherit_graph_128.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_128.md5 b/inherit_graph_128.md5 index 7176e9459..e7c7fb621 100644 --- a/inherit_graph_128.md5 +++ b/inherit_graph_128.md5 @@ -1 +1 @@ -d726de060ffc7b8e70f3bd633c5e676f \ No newline at end of file +29bd013de83f56ba5a403fae138c97e7 \ No newline at end of file diff --git a/inherit_graph_128.svg b/inherit_graph_128.svg index 2631b8add..cc69dcc98 100644 --- a/inherit_graph_128.svg +++ b/inherit_graph_128.svg @@ -11,10 +11,10 @@ Node0 - + unordered_set< K > -::iterator +::reverse_iterator diff --git a/inherit_graph_129.map b/inherit_graph_129.map index 8a46a1ac5..55e14b180 100644 --- a/inherit_graph_129.map +++ b/inherit_graph_129.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_129.md5 b/inherit_graph_129.md5 index e7c7fb621..e39a10289 100644 --- a/inherit_graph_129.md5 +++ b/inherit_graph_129.md5 @@ -1 +1 @@ -29bd013de83f56ba5a403fae138c97e7 \ No newline at end of file +9ea647f257244648e1a88e8a1e6b5d1a \ No newline at end of file diff --git a/inherit_graph_129.svg b/inherit_graph_129.svg index cc69dcc98..ba66de5ee 100644 --- a/inherit_graph_129.svg +++ b/inherit_graph_129.svg @@ -4,17 +4,16 @@ - - + + Graphical Class Hierarchy Node0 - - -unordered_set< K > -::reverse_iterator + + +vector< T > diff --git a/inherit_graph_130.map b/inherit_graph_130.map index 55e14b180..2ee84d09b 100644 --- a/inherit_graph_130.map +++ b/inherit_graph_130.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_130.md5 b/inherit_graph_130.md5 index e39a10289..f4691547e 100644 --- a/inherit_graph_130.md5 +++ b/inherit_graph_130.md5 @@ -1 +1 @@ -9ea647f257244648e1a88e8a1e6b5d1a \ No newline at end of file +37245481f3061bb863879ae1b2d666fd \ No newline at end of file diff --git a/inherit_graph_130.svg b/inherit_graph_130.svg index ba66de5ee..ce0068d60 100644 --- a/inherit_graph_130.svg +++ b/inherit_graph_130.svg @@ -4,16 +4,17 @@ - - + + Graphical Class Hierarchy Node0 - - -vector< T > + + +vector< T >::const +_iterator diff --git a/inherit_graph_131.map b/inherit_graph_131.map index 2ee84d09b..034484c0e 100644 --- a/inherit_graph_131.map +++ b/inherit_graph_131.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_131.md5 b/inherit_graph_131.md5 index f4691547e..ab64738e8 100644 --- a/inherit_graph_131.md5 +++ b/inherit_graph_131.md5 @@ -1 +1 @@ -37245481f3061bb863879ae1b2d666fd \ No newline at end of file +0b5d4fb4ca57707b9dc4b19d184f069a \ No newline at end of file diff --git a/inherit_graph_131.svg b/inherit_graph_131.svg index ce0068d60..ba99a8ac3 100644 --- a/inherit_graph_131.svg +++ b/inherit_graph_131.svg @@ -11,10 +11,10 @@ Node0 - + vector< T >::const -_iterator +_reverse_iterator diff --git a/inherit_graph_132.map b/inherit_graph_132.map index 034484c0e..42b167a8c 100644 --- a/inherit_graph_132.map +++ b/inherit_graph_132.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_132.md5 b/inherit_graph_132.md5 index ab64738e8..17e5199f4 100644 --- a/inherit_graph_132.md5 +++ b/inherit_graph_132.md5 @@ -1 +1 @@ -0b5d4fb4ca57707b9dc4b19d184f069a \ No newline at end of file +daf29995081b133c5824f0e49272ff99 \ No newline at end of file diff --git a/inherit_graph_132.svg b/inherit_graph_132.svg index ba99a8ac3..fe91299ae 100644 --- a/inherit_graph_132.svg +++ b/inherit_graph_132.svg @@ -4,17 +4,16 @@ - - + + Graphical Class Hierarchy Node0 - - -vector< T >::const -_reverse_iterator + + +vector< T >::iterator diff --git a/inherit_graph_133.map b/inherit_graph_133.map index 42b167a8c..09cd2ecd8 100644 --- a/inherit_graph_133.map +++ b/inherit_graph_133.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_133.md5 b/inherit_graph_133.md5 index 17e5199f4..19af07e0c 100644 --- a/inherit_graph_133.md5 +++ b/inherit_graph_133.md5 @@ -1 +1 @@ -daf29995081b133c5824f0e49272ff99 \ No newline at end of file +327ae94d174893e7ba33fccc595787c2 \ No newline at end of file diff --git a/inherit_graph_133.svg b/inherit_graph_133.svg index fe91299ae..8ae09eb99 100644 --- a/inherit_graph_133.svg +++ b/inherit_graph_133.svg @@ -4,16 +4,17 @@ - - + + Graphical Class Hierarchy Node0 - - -vector< T >::iterator + + +vector< T >::reverse +_iterator diff --git a/inherit_graph_134.map b/inherit_graph_134.map deleted file mode 100644 index 09cd2ecd8..000000000 --- a/inherit_graph_134.map +++ /dev/null @@ -1,3 +0,0 @@ - - - diff --git a/inherit_graph_134.md5 b/inherit_graph_134.md5 deleted file mode 100644 index 19af07e0c..000000000 --- a/inherit_graph_134.md5 +++ /dev/null @@ -1 +0,0 @@ -327ae94d174893e7ba33fccc595787c2 \ No newline at end of file diff --git a/inherit_graph_134.svg b/inherit_graph_134.svg deleted file mode 100644 index 8ae09eb99..000000000 --- a/inherit_graph_134.svg +++ /dev/null @@ -1,22 +0,0 @@ - - - - - - -Graphical Class Hierarchy - - -Node0 - - -vector< T >::reverse -_iterator - - - - - diff --git a/inherits.html b/inherits.html index 9e0efe13d..c5c104901 100644 --- a/inherits.html +++ b/inherits.html @@ -254,27 +254,26 @@ document.addEventListener('DOMContentLoaded',() => { initNavTree('hierarchy.html

This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.

- - - - - - - - - + + + + + + + + + - - - - + + + + - - + + - - - + + diff --git a/navtreedata.js b/navtreedata.js index 6b8635ffd..e6ad03879 100644 --- a/navtreedata.js +++ b/navtreedata.js @@ -137,18 +137,18 @@ var NAVTREEINDEX = [ "annotated.html", "d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028", -"d3/d06/ode__semi__implicit__euler_8cpp_source.html", -"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", -"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c", -"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154", -"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7", -"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3", -"da/d0d/longest__common__string_8cpp_source.html", -"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7", -"dc/d53/classtests_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9", -"dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656", -"de/dc3/fibonacci__sum_8cpp_source.html", -"dir_e3380d2178455503f266746fb14246a5.html" +"d3/d09/node_8hpp_source.html", +"d4/d90/classdata__structures_1_1_skip_list.html", +"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04", +"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933", +"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea", +"d9/d00/factorial_8cpp.html", +"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5", +"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2", +"dc/d53/classtests_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208", +"dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5", +"de/dcd/kadanes3_8cpp.html", +"files.html" ]; const SYNCONMSG = 'click to disable panel synchronization'; diff --git a/navtreeindex0.js b/navtreeindex0.js index 123da62e2..b8d986e09 100644 --- a/navtreeindex0.js +++ b/navtreeindex0.js @@ -12,7 +12,7 @@ var NAVTREEINDEX0 = "d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,17,21,3], "d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad":[10,0,17,21,4], "d0/d01/smallest__circle_8cpp_source.html":[10,0,17,21], -"d0/d05/classvector_1_1iterator.html":[9,0,72,0], +"d0/d05/classvector_1_1iterator.html":[9,0,71,0], "d0/d08/realtime__stats_8cpp.html":[10,0,14,53], "d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd":[10,0,14,53,5], "d0/d08/realtime__stats_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,53,4], @@ -127,14 +127,14 @@ var NAVTREEINDEX0 = "d0/de2/gaussian__elimination_8cpp_source.html":[10,0,15,7], "d0/dea/strassen__matrix__multiplication_8cpp_source.html":[10,0,5,1], "d0/df8/namespaceabbreviation.html":[8,0,1], -"d0/dff/structlinkedlist.html":[9,0,42], +"d0/dff/structlinkedlist.html":[9,0,41], "d1/d11/gcd__of__n__numbers_8cpp.html":[10,0,14,24], "d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,24,4], "d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,24,3], "d1/d11/gcd__of__n__numbers_8cpp_source.html":[10,0,14,24], "d1/d12/tree_8cpp_source.html":[10,0,4,35], -"d1/d1b/classpriority__queue.html":[9,0,53], -"d1/d1b/classpriority__queue.html#a4df2ae826d2b2caf4a6755adbd34a836":[9,0,53,0], +"d1/d1b/classpriority__queue.html":[9,0,52], +"d1/d1b/classpriority__queue.html#a4df2ae826d2b2caf4a6755adbd34a836":[9,0,52,0], "d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html":[10,0,9,20], "d1/d1c/base64__encoding_8cpp_source.html":[10,0,2,2], "d1/d21/quick__sort_8cpp.html":[10,0,23,25], @@ -171,83 +171,83 @@ var NAVTREEINDEX0 = "d1/d76/buzz__number_8cpp.html":[10,0,17,0], "d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,17,0,0], "d1/d76/buzz__number_8cpp_source.html":[10,0,17,0], -"d1/d77/structmst.html":[9,0,49], +"d1/d77/structmst.html":[9,0,48], "d1/d7c/fibonacci__bottom__up_8cpp_source.html":[10,0,6,10], -"d1/d83/classuint256__t.html":[9,0,70], -"d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3":[9,0,70,4], -"d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c":[9,0,70,15], -"d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163":[9,0,70,8], -"d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa":[9,0,70,3], -"d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5":[9,0,70,53], -"d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88":[9,0,70,55], -"d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39":[9,0,70,1], -"d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2":[9,0,70,54], -"d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f":[9,0,70,33], -"d1/d83/classuint256__t.html#a28aa5786bbfce1b00398a8d38691bdaa":[9,0,70,12], -"d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052":[9,0,70,5], -"d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb":[9,0,70,21], -"d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2":[9,0,70,73], -"d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409":[9,0,70,24], -"d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d":[9,0,70,27], -"d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3":[9,0,70,70], -"d1/d83/classuint256__t.html#a3ff17ab14b2371eb3239107d10947067":[9,0,70,6], -"d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06":[9,0,70,39], -"d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7":[9,0,70,77], -"d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e":[9,0,70,2], -"d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21":[9,0,70,32], -"d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51":[9,0,70,66], -"d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5":[9,0,70,52], -"d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7":[9,0,70,76], -"d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc":[9,0,70,58], -"d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df":[9,0,70,47], -"d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1":[9,0,70,37], -"d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45":[9,0,70,45], -"d1/d83/classuint256__t.html#a63f1095009e27a797986c835651cd14a":[9,0,70,43], -"d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638":[9,0,70,59], -"d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8":[9,0,70,22], -"d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2":[9,0,70,78], -"d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7":[9,0,70,69], -"d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d":[9,0,70,20], -"d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b":[9,0,70,28], -"d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c":[9,0,70,36], -"d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc":[9,0,70,18], -"d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1":[9,0,70,10], -"d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2":[9,0,70,56], -"d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4":[9,0,70,40], -"d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb":[9,0,70,16], -"d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261":[9,0,70,61], -"d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a":[9,0,70,80], -"d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484":[9,0,70,60], -"d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839":[9,0,70,23], -"d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250":[9,0,70,9], -"d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363":[9,0,70,13], -"d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183":[9,0,70,42], -"d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963":[9,0,70,25], -"d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc":[9,0,70,75], -"d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1":[9,0,70,11], -"d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967":[9,0,70,30], -"d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616":[9,0,70,29], -"d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547":[9,0,70,17], -"d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d":[9,0,70,41], -"d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259":[9,0,70,48], -"d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4":[9,0,70,49], -"d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056":[9,0,70,50], -"d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e":[9,0,70,38], -"d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7":[9,0,70,71], -"d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6":[9,0,70,46], -"d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d":[9,0,70,63], -"d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e":[9,0,70,68], -"d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7":[9,0,70,44], -"d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf":[9,0,70,72], -"d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2":[9,0,70,19], -"d1/d83/classuint256__t.html#ad5bd38b2d3becca998457af1124d6e8b":[9,0,70,14], -"d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13":[9,0,70,62], -"d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78":[9,0,70,67], -"d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c":[9,0,70,57], -"d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad":[9,0,70,65], -"d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5":[9,0,70,79], -"d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc":[9,0,70,0], -"d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b":[9,0,70,74], -"d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9":[9,0,70,35], -"d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75":[9,0,70,34] +"d1/d83/classuint256__t.html":[9,0,69], +"d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3":[9,0,69,4], +"d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c":[9,0,69,15], +"d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163":[9,0,69,8], +"d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa":[9,0,69,3], +"d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5":[9,0,69,53], +"d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88":[9,0,69,55], +"d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39":[9,0,69,1], +"d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2":[9,0,69,54], +"d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f":[9,0,69,33], +"d1/d83/classuint256__t.html#a28aa5786bbfce1b00398a8d38691bdaa":[9,0,69,12], +"d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052":[9,0,69,5], +"d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb":[9,0,69,21], +"d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2":[9,0,69,73], +"d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409":[9,0,69,24], +"d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d":[9,0,69,27], +"d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3":[9,0,69,70], +"d1/d83/classuint256__t.html#a3ff17ab14b2371eb3239107d10947067":[9,0,69,6], +"d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06":[9,0,69,39], +"d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7":[9,0,69,77], +"d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e":[9,0,69,2], +"d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21":[9,0,69,32], +"d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51":[9,0,69,66], +"d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5":[9,0,69,52], +"d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7":[9,0,69,76], +"d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc":[9,0,69,58], +"d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df":[9,0,69,47], +"d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1":[9,0,69,37], +"d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45":[9,0,69,45], +"d1/d83/classuint256__t.html#a63f1095009e27a797986c835651cd14a":[9,0,69,43], +"d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638":[9,0,69,59], +"d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8":[9,0,69,22], +"d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2":[9,0,69,78], +"d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7":[9,0,69,69], +"d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d":[9,0,69,20], +"d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b":[9,0,69,28], +"d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c":[9,0,69,36], +"d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc":[9,0,69,18], +"d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1":[9,0,69,10], +"d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2":[9,0,69,56], +"d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4":[9,0,69,40], +"d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb":[9,0,69,16], +"d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261":[9,0,69,61], +"d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a":[9,0,69,80], +"d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484":[9,0,69,60], +"d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839":[9,0,69,23], +"d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250":[9,0,69,9], +"d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363":[9,0,69,13], +"d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183":[9,0,69,42], +"d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963":[9,0,69,25], +"d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc":[9,0,69,75], +"d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1":[9,0,69,11], +"d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967":[9,0,69,30], +"d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616":[9,0,69,29], +"d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547":[9,0,69,17], +"d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d":[9,0,69,41], +"d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259":[9,0,69,48], +"d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4":[9,0,69,49], +"d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056":[9,0,69,50], +"d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e":[9,0,69,38], +"d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7":[9,0,69,71], +"d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6":[9,0,69,46], +"d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d":[9,0,69,63], +"d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e":[9,0,69,68], +"d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7":[9,0,69,44], +"d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf":[9,0,69,72], +"d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2":[9,0,69,19], +"d1/d83/classuint256__t.html#ad5bd38b2d3becca998457af1124d6e8b":[9,0,69,14], +"d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13":[9,0,69,62], +"d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78":[9,0,69,67], +"d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c":[9,0,69,57], +"d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad":[9,0,69,65], +"d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5":[9,0,69,79], +"d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc":[9,0,69,0], +"d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b":[9,0,69,74], +"d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9":[9,0,69,35], +"d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75":[9,0,69,34] }; diff --git a/navtreeindex1.js b/navtreeindex1.js index f50238169..6900bf68a 100644 --- a/navtreeindex1.js +++ b/navtreeindex1.js @@ -1,10 +1,10 @@ var NAVTREEINDEX1 = { -"d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028":[9,0,70,31], -"d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5":[9,0,70,26], -"d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96":[9,0,70,51], -"d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4":[9,0,70,7], -"d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad":[9,0,70,64], +"d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028":[9,0,69,31], +"d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5":[9,0,69,26], +"d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96":[9,0,69,51], +"d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4":[9,0,69,7], +"d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad":[9,0,69,64], "d1/d9a/hopcroft__karp_8cpp.html":[10,0,9,10], "d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[10,0,9,10,3], "d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,9,10,2], @@ -26,7 +26,7 @@ var NAVTREEINDEX1 = "d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,23,30,7], "d1/daa/random__pivot__quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,23,30,3], "d1/daa/random__pivot__quick__sort_8cpp_source.html":[10,0,23,30], -"d1/db3/structcompare.html":[9,0,28], +"d1/db3/structcompare.html":[9,0,27], "d1/db6/namespaceknight__tour.html":[8,0,60], "d1/dbb/n__choose__r_8cpp.html":[10,0,14,43], "d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,43,2], @@ -37,15 +37,15 @@ var NAVTREEINDEX1 = "d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509":[10,0,15,12,2], "d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4":[10,0,15,12,0], "d1/dbe/lu__decomposition_8h_source.html":[10,0,15,12], -"d1/dc2/classstack.html":[9,0,61], -"d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e":[9,0,61,6], -"d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5":[9,0,61,2], -"d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0":[9,0,61,3], -"d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092":[9,0,61,0], -"d1/dc2/classstack.html#a8bce109630118a34faae717f72986033":[9,0,61,1], -"d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d":[9,0,61,4], -"d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709":[9,0,61,5], -"d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8":[9,0,61,7], +"d1/dc2/classstack.html":[9,0,60], +"d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e":[9,0,60,6], +"d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5":[9,0,60,2], +"d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0":[9,0,60,3], +"d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092":[9,0,60,0], +"d1/dc2/classstack.html#a8bce109630118a34faae717f72986033":[9,0,60,1], +"d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d":[9,0,60,4], +"d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709":[9,0,60,5], +"d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8":[9,0,60,7], "d1/dc7/linear__probing__hash__table_8cpp.html":[10,0,12,2], "d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,12,2,6], "d1/dc7/linear__probing__hash__table_8cpp_source.html":[10,0,12,2], @@ -91,34 +91,34 @@ var NAVTREEINDEX1 = "d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,22,4,8], "d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d":[10,0,22,4,10], "d1/df3/hash__search_8cpp_source.html":[10,0,22,4], -"d1/df6/class_easter_year_month_day.html":[9,0,33], -"d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde":[9,0,33,1], -"d1/df6/class_easter_year_month_day.html#a28d3cd09391390250932b7fb58fe61dc":[9,0,33,2], -"d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51":[9,0,33,0], -"d2/d05/class_min_heap.html":[9,0,47], -"d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820":[9,0,47,0], -"d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130":[9,0,47,4], -"d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e":[9,0,47,10], -"d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29":[9,0,47,2], -"d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980":[9,0,47,3], -"d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02":[9,0,47,9], -"d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5":[9,0,47,1], -"d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca":[9,0,47,6], -"d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad":[9,0,47,7], -"d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e":[9,0,47,8], -"d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913":[9,0,47,11], -"d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82":[9,0,47,5], +"d1/df6/class_easter_year_month_day.html":[9,0,32], +"d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde":[9,0,32,1], +"d1/df6/class_easter_year_month_day.html#a28d3cd09391390250932b7fb58fe61dc":[9,0,32,2], +"d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51":[9,0,32,0], +"d2/d05/class_min_heap.html":[9,0,46], +"d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820":[9,0,46,0], +"d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130":[9,0,46,4], +"d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e":[9,0,46,10], +"d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29":[9,0,46,2], +"d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980":[9,0,46,3], +"d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02":[9,0,46,9], +"d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5":[9,0,46,1], +"d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca":[9,0,46,6], +"d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad":[9,0,46,7], +"d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e":[9,0,46,8], +"d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913":[9,0,46,11], +"d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82":[9,0,46,5], "d2/d0b/fast__power_8cpp.html":[10,0,14,16], "d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d":[10,0,14,16,0], "d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445":[10,0,14,16,1], "d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,16,2], "d2/d0b/fast__power_8cpp_source.html":[10,0,14,16], -"d2/d0f/classstats__computer1.html":[9,0,63], -"d2/d0f/classstats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92":[9,0,63,3], -"d2/d0f/classstats__computer1.html#a350bf6c429691d3578c4dfc6679a0797":[9,0,63,4], -"d2/d0f/classstats__computer1.html#a390697dcee210b91823ceff04b25081b":[9,0,63,0], -"d2/d0f/classstats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2":[9,0,63,1], -"d2/d0f/classstats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1":[9,0,63,2], +"d2/d0f/classstats__computer1.html":[9,0,62], +"d2/d0f/classstats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92":[9,0,62,3], +"d2/d0f/classstats__computer1.html#a350bf6c429691d3578c4dfc6679a0797":[9,0,62,4], +"d2/d0f/classstats__computer1.html#a390697dcee210b91823ceff04b25081b":[9,0,62,0], +"d2/d0f/classstats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2":[9,0,62,1], +"d2/d0f/classstats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1":[9,0,62,2], "d2/d21/gnome__sort_8cpp.html":[10,0,23,13], "d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,23,13,3], "d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,23,13,2], @@ -130,9 +130,9 @@ var NAVTREEINDEX1 = "d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,23,8,5], "d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,23,8,1], "d2/d26/count__inversions_8cpp_source.html":[10,0,23,8], -"d2/d2c/structtower.html":[9,0,67], -"d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9":[9,0,67,1], -"d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d":[9,0,67,0], +"d2/d2c/structtower.html":[9,0,66], +"d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9":[9,0,66,1], +"d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d":[9,0,66,0], "d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html":[8,0,43,0], "d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8":[8,0,43,0,3], "d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71":[8,0,43,0,2], @@ -205,7 +205,7 @@ var NAVTREEINDEX1 = "d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc":[8,0,43,0,0,0], "d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc":[9,0,7,0,0,0], "d2/db0/namespacesieve__of__eratosthenes.html":[8,0,112], -"d2/dc4/classstack__linked_list.html":[9,0,62], +"d2/dc4/classstack__linked_list.html":[9,0,61], "d2/dc8/classdata__structures_1_1_stack.html":[8,0,21,6], "d2/dc8/classdata__structures_1_1_stack.html":[9,0,2,13], "d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080":[8,0,21,6,2], @@ -231,7 +231,6 @@ var NAVTREEINDEX1 = "d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b":[8,0,21,6,4], "d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b":[9,0,2,13,4], "d2/dcf/namespacestatistics.html":[8,0,118], -"d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html":[9,0,19,2], "d2/ddb/namespacegcd__of__n__numbers.html":[8,0,36], "d2/de1/namespacehouse__robber.html":[8,0,49], "d2/de7/namespacerunge__kutta.html":[8,0,105], @@ -241,7 +240,6 @@ var NAVTREEINDEX1 = "d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,20,1,3], "d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a":[10,0,20,1,6], "d2/de9/heavy__light__decomposition_8cpp_source.html":[10,0,20,1], -"d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html":[9,0,19,0], "d3/d05/sudoku__solver_8cpp.html":[10,0,0,11], "d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,0,11,1], "d3/d05/sudoku__solver_8cpp_source.html":[10,0,0,11], @@ -249,5 +247,7 @@ var NAVTREEINDEX1 = "d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[10,0,15,17,1], "d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f":[10,0,15,17,3], "d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe":[10,0,15,17,2], -"d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b":[10,0,15,17,0] +"d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b":[10,0,15,17,0], +"d3/d06/ode__semi__implicit__euler_8cpp_source.html":[10,0,15,17], +"d3/d09/node_8hpp.html":[10,0,4,15] }; diff --git a/navtreeindex10.js b/navtreeindex10.js index 0855cd168..94799b67f 100644 --- a/navtreeindex10.js +++ b/navtreeindex10.js @@ -1,16 +1,12 @@ var NAVTREEINDEX10 = { -"dc/d53/classtests_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9":[9,0,21,0,9], -"dc/d53/classtests_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888":[8,0,129,0,0], -"dc/d53/classtests_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888":[9,0,21,0,0], -"dc/d53/classtests_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208":[8,0,129,0,14], -"dc/d53/classtests_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208":[9,0,21,0,14], +"dc/d53/classtests_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208":[9,0,20,0,14], "dc/d53/classtests_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2":[8,0,129,0,2], -"dc/d53/classtests_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2":[9,0,21,0,2], +"dc/d53/classtests_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2":[9,0,20,0,2], "dc/d53/classtests_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592":[8,0,129,0,10], -"dc/d53/classtests_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592":[9,0,21,0,10], +"dc/d53/classtests_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592":[9,0,20,0,10], "dc/d53/classtests_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d":[8,0,129,0,5], -"dc/d53/classtests_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d":[9,0,21,0,5], +"dc/d53/classtests_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d":[9,0,20,0,5], "dc/d5a/rat__maze_8cpp.html":[10,0,0,8], "dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,0,8,2], "dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,0,8,0], @@ -40,7 +36,6 @@ var NAVTREEINDEX10 = "dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,1,8,2], "dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,1,8,1], "dc/d6d/power__of__2_8cpp_source.html":[10,0,1,8], -"dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html":[9,0,19,1], "dc/d82/area_8cpp.html":[10,0,14,2], "dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,2,9], "dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,2,4], @@ -60,12 +55,12 @@ var NAVTREEINDEX10 = "dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,15,0,2], "dc/d9c/babylonian__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,15,0,1], "dc/d9c/babylonian__method_8cpp_source.html":[10,0,15,0], -"dc/da8/classunordered__set_1_1reverse__iterator.html":[9,0,71,2], +"dc/da8/classunordered__set_1_1reverse__iterator.html":[9,0,70,2], "dc/daa/lru__cache2_8cpp.html":[10,0,17,13], "dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,17,13,3], "dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,17,13,2], "dc/daa/lru__cache2_8cpp_source.html":[10,0,17,13], -"dc/db5/struct_queue.html":[9,0,55], +"dc/db5/struct_queue.html":[9,0,54], "dc/db5/text__search_8cpp.html":[10,0,22,15], "dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9":[10,0,22,15,0], "dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,22,15,2], @@ -135,39 +130,39 @@ var NAVTREEINDEX10 = "dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[10,0,2,9,3], "dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,2,9,2], "dd/d12/vigenere__cipher_8cpp_source.html":[10,0,2,9], -"dd/d1b/structquery.html":[9,0,54], -"dd/d1c/classhash__chain.html":[9,0,38], -"dd/d1c/classhash__chain.html#a534671ef7adc936f39e1382bb70d7300":[9,0,38,0], -"dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a":[9,0,38,4], -"dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff":[9,0,38,2], -"dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed":[9,0,38,3], -"dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595":[9,0,38,1], -"dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64":[9,0,38,5], -"dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0":[9,0,38,7], -"dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2":[9,0,38,6], +"dd/d1b/structquery.html":[9,0,53], +"dd/d1c/classhash__chain.html":[9,0,37], +"dd/d1c/classhash__chain.html#a534671ef7adc936f39e1382bb70d7300":[9,0,37,0], +"dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a":[9,0,37,4], +"dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff":[9,0,37,2], +"dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed":[9,0,37,3], +"dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595":[9,0,37,1], +"dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64":[9,0,37,5], +"dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0":[9,0,37,7], +"dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2":[9,0,37,6], "dd/d1e/generate__parentheses_8cpp.html":[10,0,0,0], "dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,0,0,2], "dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,0,0,1], "dd/d1e/generate__parentheses_8cpp_source.html":[10,0,0,0], -"dd/d1f/classdsu.html":[9,0,32], -"dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a":[9,0,32,4], -"dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72":[9,0,32,0], -"dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72":[9,0,32,1], -"dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c":[9,0,32,2], -"dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c":[9,0,32,3], -"dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c":[9,0,32,10], -"dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63":[9,0,32,15], -"dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb":[9,0,32,16], -"dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53":[9,0,32,14], -"dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429":[9,0,32,13], -"dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303":[9,0,32,8], -"dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303":[9,0,32,9], -"dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde":[9,0,32,5], -"dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559":[9,0,32,11], -"dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f":[9,0,32,12], -"dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280":[9,0,32,7], -"dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55":[9,0,32,17], -"dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415":[9,0,32,6], +"dd/d1f/classdsu.html":[9,0,31], +"dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a":[9,0,31,4], +"dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72":[9,0,31,0], +"dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72":[9,0,31,1], +"dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c":[9,0,31,2], +"dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c":[9,0,31,3], +"dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c":[9,0,31,10], +"dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63":[9,0,31,15], +"dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb":[9,0,31,16], +"dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53":[9,0,31,14], +"dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429":[9,0,31,13], +"dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303":[9,0,31,8], +"dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303":[9,0,31,9], +"dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde":[9,0,31,5], +"dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559":[9,0,31,11], +"dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f":[9,0,31,12], +"dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280":[9,0,31,7], +"dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55":[9,0,31,17], +"dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415":[9,0,31,6], "dd/d21/namespacewindowed__median.html":[8,0,142], "dd/d24/namespacedynamic__programming.html":[8,0,28], "dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8":[8,0,28,4], @@ -180,15 +175,15 @@ var NAVTREEINDEX10 = "dd/d29/false__position_8cpp_source.html":[10,0,15,5], "dd/d2e/namespacedata__structures_1_1treap.html":[8,0,21,0], "dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099":[8,0,21,0,1], -"dd/d2f/class_trie.html":[9,0,68], -"dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d":[9,0,68,4], -"dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206":[9,0,68,5], -"dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908":[9,0,68,1], -"dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb":[9,0,68,2], -"dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2":[9,0,68,3], -"dd/d3b/struct_entry.html":[9,0,35], -"dd/d3b/struct_entry.html#a287b92112b6b43b34808a93778873475":[9,0,35,0], -"dd/d3b/struct_entry.html#ae114967c89dbba3b754dc4976bba3248":[9,0,35,1], +"dd/d2f/class_trie.html":[9,0,67], +"dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d":[9,0,67,4], +"dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206":[9,0,67,5], +"dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908":[9,0,67,1], +"dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb":[9,0,67,2], +"dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2":[9,0,67,3], +"dd/d3b/struct_entry.html":[9,0,34], +"dd/d3b/struct_entry.html#a287b92112b6b43b34808a93778873475":[9,0,34,0], +"dd/d3b/struct_entry.html#ae114967c89dbba3b754dc4976bba3248":[9,0,34,1], "dd/d40/classdata__structures_1_1tree__234_1_1_node.html":[9,0,2,6,0], "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4":[9,0,2,6,0,2], "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f":[9,0,2,6,0,1], @@ -249,5 +244,10 @@ var NAVTREEINDEX10 = "dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb":[8,0,70,32], "dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca":[8,0,70,33], "dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf":[8,0,70,1], -"dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc":[8,0,70,43] +"dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc":[8,0,70,43], +"dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656":[8,0,70,37], +"dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c":[8,0,70,8], +"dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444":[8,0,70,18], +"dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca":[8,0,70,13], +"dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188":[8,0,70,2] }; diff --git a/navtreeindex11.js b/navtreeindex11.js index 54809e664..b9e62859b 100644 --- a/navtreeindex11.js +++ b/navtreeindex11.js @@ -1,10 +1,5 @@ var NAVTREEINDEX11 = { -"dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656":[8,0,70,37], -"dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c":[8,0,70,8], -"dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444":[8,0,70,18], -"dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca":[8,0,70,13], -"dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188":[8,0,70,2], "dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5":[8,0,70,27], "dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864":[8,0,70,11], "dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4":[8,0,70,30], @@ -15,14 +10,14 @@ var NAVTREEINDEX11 = "dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a":[8,0,70,41], "dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f":[8,0,70,20], "dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d":[8,0,70,28], -"dd/d4f/class_solution.html":[9,0,60], -"dd/d51/classvector_1_1const__reverse__iterator.html":[9,0,72,3], +"dd/d4f/class_solution.html":[9,0,59], +"dd/d51/classvector_1_1const__reverse__iterator.html":[9,0,71,3], "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html":[8,0,123,0,0], -"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html":[9,0,20,0,0], +"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html":[9,0,19,0,0], "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e":[8,0,123,0,0,1], -"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e":[9,0,20,0,0,1], +"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e":[9,0,19,0,0,1], "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645":[8,0,123,0,0,0], -"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645":[9,0,20,0,0,0], +"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645":[9,0,19,0,0,0], "dd/d65/lu__decompose_8cpp.html":[10,0,15,11], "dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0":[10,0,15,11,3], "dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[10,0,15,11,2], @@ -63,7 +58,7 @@ var NAVTREEINDEX11 = "dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52":[9,0,2,11,2], "dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17":[8,0,21,4,5], "dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17":[9,0,2,11,5], -"dd/d96/classvector_1_1reverse__iterator.html":[9,0,72,2], +"dd/d96/classvector_1_1reverse__iterator.html":[9,0,71,2], "dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html":[8,0,43,1], "dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c":[8,0,43,1,0], "dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html":[9,0,10,0,0], @@ -94,18 +89,18 @@ var NAVTREEINDEX11 = "dd/da8/pigeonhole__sort_8cpp_source.html":[10,0,23,24], "dd/dae/namespacecount__of__set__bits.html":[8,0,16], "dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html":[11,4], -"dd/db6/structbinary__search__tree_1_1bst__node.html":[9,0,23,0], -"dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df":[9,0,23,0,2], -"dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29":[9,0,23,0,3], -"dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778":[9,0,23,0,0], -"dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788":[9,0,23,0,1], +"dd/db6/structbinary__search__tree_1_1bst__node.html":[9,0,22,0], +"dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df":[9,0,22,0,2], +"dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29":[9,0,22,0,3], +"dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778":[9,0,22,0,0], +"dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788":[9,0,22,0,1], "dd/dba/namespacedivide__and__conquer.html":[8,0,24], "dd/dc3/is__graph__bipartite2_8cpp_source.html":[10,0,9,12], -"dd/dca/class_f_c_f_s.html":[9,0,36], -"dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69":[9,0,36,0], -"dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91":[9,0,36,2], -"dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793":[9,0,36,1], -"dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46":[9,0,36,3], +"dd/dca/class_f_c_f_s.html":[9,0,35], +"dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69":[9,0,35,0], +"dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91":[9,0,35,2], +"dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793":[9,0,35,1], +"dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46":[9,0,35,3], "dd/dd5/swap__sort_8cpp_source.html":[10,0,23,39], "dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html":[9,0,13,3,1], "dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5":[9,0,13,3,1,2], @@ -176,10 +171,10 @@ var NAVTREEINDEX11 = "de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca":[10,0,14,56,1], "de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,56,2], "de/d47/string__fibonacci_8cpp_source.html":[10,0,14,56], -"de/d48/struct_trie_1_1_trie_node.html":[9,0,68,0], -"de/d4a/class_compare.html":[9,0,27], -"de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c":[9,0,27,0], -"de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c":[9,0,27,1], +"de/d48/struct_trie_1_1_trie_node.html":[9,0,67,0], +"de/d4a/class_compare.html":[9,0,26], +"de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c":[9,0,26,0], +"de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c":[9,0,26,1], "de/d5b/queue__using__linkedlist_8cpp_source.html":[10,0,4,20], "de/d6a/knuth__morris__pratt_8cpp.html":[10,0,24,4], "de/d6a/knuth__morris__pratt_8cpp.html#a1e37af2f023495129cb57338c801209e":[10,0,24,4,1], @@ -249,5 +244,10 @@ var NAVTREEINDEX11 = "de/dc3/binaryheap_8cpp_source.html":[10,0,4,4], "de/dc3/fibonacci__sum_8cpp.html":[10,0,14,21], "de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,21,5], -"de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,21,1] +"de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,21,1], +"de/dc3/fibonacci__sum_8cpp_source.html":[10,0,14,21], +"de/dc5/intersection__of__two__arrays_8cpp.html":[10,0,16,6], +"de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,16,6,5], +"de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,16,6,2], +"de/dc5/intersection__of__two__arrays_8cpp_source.html":[10,0,16,6] }; diff --git a/navtreeindex12.js b/navtreeindex12.js index cd4ebbb61..f14651e7a 100644 --- a/navtreeindex12.js +++ b/navtreeindex12.js @@ -1,10 +1,5 @@ var NAVTREEINDEX12 = { -"de/dc3/fibonacci__sum_8cpp_source.html":[10,0,14,21], -"de/dc5/intersection__of__two__arrays_8cpp.html":[10,0,16,6], -"de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,16,6,5], -"de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,16,6,2], -"de/dc5/intersection__of__two__arrays_8cpp_source.html":[10,0,16,6], "de/dcd/kadanes3_8cpp.html":[10,0,17,8], "de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147":[10,0,17,8,1], "de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,17,8,2], @@ -166,7 +161,6 @@ var NAVTREEINDEX12 = "df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,0,9,0], "df/d94/subarray__sum_8cpp_source.html":[10,0,0,9], "df/d97/main__cll_8cpp_source.html":[10,0,4,0,2], -"df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html":[9,0,19,5], "df/da7/queue__using__array2_8cpp_source.html":[10,0,4,18], "df/dc8/successive__approximation_8cpp.html":[10,0,15,22], "df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389":[10,0,15,22,0], @@ -207,19 +201,19 @@ var NAVTREEINDEX12 = "df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160":[8,0,5,0,0], "df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160":[9,0,0,0,0], "df/dea/namespacefalse__position.html":[8,0,31], -"df/dee/class_h_k_graph.html":[9,0,39], -"df/dee/class_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[9,0,39,1], -"df/dee/class_h_k_graph.html#a35893def7a1c5cd60907b4893117796f":[9,0,39,6], -"df/dee/class_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a":[9,0,39,2], -"df/dee/class_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74":[9,0,39,8], -"df/dee/class_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a":[9,0,39,7], -"df/dee/class_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c":[9,0,39,9], -"df/dee/class_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93":[9,0,39,3], -"df/dee/class_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b":[9,0,39,10], -"df/dee/class_h_k_graph.html#a976ee239402cc2726a280e781c706d77":[9,0,39,11], -"df/dee/class_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d":[9,0,39,5], -"df/dee/class_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0":[9,0,39,4], -"df/dee/class_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9":[9,0,39,0], +"df/dee/class_h_k_graph.html":[9,0,38], +"df/dee/class_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[9,0,38,1], +"df/dee/class_h_k_graph.html#a35893def7a1c5cd60907b4893117796f":[9,0,38,6], +"df/dee/class_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a":[9,0,38,2], +"df/dee/class_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74":[9,0,38,8], +"df/dee/class_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a":[9,0,38,7], +"df/dee/class_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c":[9,0,38,9], +"df/dee/class_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93":[9,0,38,3], +"df/dee/class_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b":[9,0,38,10], +"df/dee/class_h_k_graph.html#a976ee239402cc2726a280e781c706d77":[9,0,38,11], +"df/dee/class_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d":[9,0,38,5], +"df/dee/class_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0":[9,0,38,4], +"df/dee/class_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9":[9,0,38,0], "df/def/power__for__huge__numbers_8cpp.html":[10,0,14,47], "df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326":[10,0,14,47,0], "df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9":[10,0,14,47,2], @@ -249,5 +243,11 @@ var NAVTREEINDEX12 = "dir_9c6faab82c22511b50177aa2e38e2780.html":[10,0,15], "dir_bb1b521853a9c46347182a9d10420771.html":[10,0,23], "dir_c11585dfcef32a26e29098facab6c144.html":[10,0,0], -"dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html":[10,0,3] +"dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html":[10,0,3], +"dir_e3380d2178455503f266746fb14246a5.html":[10,0,8], +"dir_e79632891301b850df87e9c0030293fa.html":[10,0,10], +"dir_ece9b94c107bbaa1dd68197a8c9983b9.html":[10,0,12], +"dir_f1797d0c2a0a12033e7d74efffeb14e1.html":[10,0,4,0], +"dir_f3c4fbc4e901afa0a54d0623c5574aa7.html":[10,0,1], +"examples.html":[11] }; diff --git a/navtreeindex13.js b/navtreeindex13.js index e37a641f0..7838e65f1 100644 --- a/navtreeindex13.js +++ b/navtreeindex13.js @@ -1,11 +1,5 @@ var NAVTREEINDEX13 = { -"dir_e3380d2178455503f266746fb14246a5.html":[10,0,8], -"dir_e79632891301b850df87e9c0030293fa.html":[10,0,10], -"dir_ece9b94c107bbaa1dd68197a8c9983b9.html":[10,0,12], -"dir_f1797d0c2a0a12033e7d74efffeb14e1.html":[10,0,4,0], -"dir_f3c4fbc4e901afa0a54d0623c5574aa7.html":[10,0,1], -"examples.html":[11], "files.html":[10,0], "functions.html":[9,3,0], "functions.html":[9,3,0,0], diff --git a/navtreeindex2.js b/navtreeindex2.js index 26e2c1885..72e6b9403 100644 --- a/navtreeindex2.js +++ b/navtreeindex2.js @@ -1,7 +1,5 @@ var NAVTREEINDEX2 = { -"d3/d06/ode__semi__implicit__euler_8cpp_source.html":[10,0,15,17], -"d3/d09/node_8hpp.html":[10,0,4,15], "d3/d09/node_8hpp_source.html":[10,0,4,15], "d3/d17/namespaceutil__functions.html":[8,0,135], "d3/d19/sparse__matrix_8cpp.html":[10,0,17,22], @@ -56,8 +54,8 @@ var NAVTREEINDEX2 = "d3/d61/vector__important__functions_8cpp.html":[10,0,17,26], "d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,17,26,0], "d3/d61/vector__important__functions_8cpp_source.html":[10,0,17,26], -"d3/d6d/classunordered__set.html":[9,0,71], -"d3/d6d/classunordered__set.html#a9401ae48c5b80204409ee475f277cdb0":[9,0,71,4], +"d3/d6d/classunordered__set.html":[9,0,70], +"d3/d6d/classunordered__set.html#a9401ae48c5b80204409ee475f277cdb0":[9,0,70,4], "d3/d6d/namespacesimpson__method.html":[8,0,113], "d3/d7d/brute__force__string__searching_8cpp.html":[10,0,24,1], "d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123":[10,0,24,1,3], @@ -119,10 +117,10 @@ var NAVTREEINDEX2 = "d3/db3/lru__cache_8cpp.html":[10,0,17,12], "d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,17,12,2], "d3/db3/lru__cache_8cpp_source.html":[10,0,17,12], -"d3/dbb/class_cycle_check.html":[9,0,30], -"d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b":[9,0,30,2], -"d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5":[9,0,30,0], -"d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474":[9,0,30,1], +"d3/dbb/class_cycle_check.html":[9,0,29], +"d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b":[9,0,29,2], +"d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5":[9,0,29,0], +"d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474":[9,0,29,1], "d3/dc1/bucket__sort_8cpp_source.html":[10,0,23,5], "d3/dc9/namespacefibonacci__sum.html":[8,0,33], "d3/dce/linkedlist__implentation__usingarray_8cpp.html":[10,0,4,12], @@ -249,5 +247,7 @@ var NAVTREEINDEX2 = "d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,8,2,2], "d4/d8d/jarvis__algorithm_8cpp_source.html":[10,0,8,2], "d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html":[10,0,1,10], -"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,1,10,1] +"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,1,10,1], +"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,1,10,0], +"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html":[10,0,1,10] }; diff --git a/navtreeindex3.js b/navtreeindex3.js index 016bfdf0f..1439129a5 100644 --- a/navtreeindex3.js +++ b/navtreeindex3.js @@ -1,7 +1,5 @@ var NAVTREEINDEX3 = { -"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,1,10,0], -"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html":[10,0,1,10], "d4/d90/classdata__structures_1_1_skip_list.html":[8,0,21,5], "d4/d90/classdata__structures_1_1_skip_list.html":[9,0,2,12], "d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650":[8,0,21,5,7], @@ -41,9 +39,9 @@ var NAVTREEINDEX3 = "d4/da0/kadane_8cpp.html":[10,0,6,13], "d4/da0/kadane_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,6,13,0], "d4/da0/kadane_8cpp_source.html":[10,0,6,13], -"d4/db4/struct_segment_intersection.html":[9,0,58], -"d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf":[9,0,58,1], -"d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655":[9,0,58,0], +"d4/db4/struct_segment_intersection.html":[9,0,57], +"d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf":[9,0,57,1], +"d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655":[9,0,57,0], "d4/db6/reverse__binary__tree_8cpp.html":[10,0,16,8], "d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,16,8,3], "d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,16,8,2], @@ -101,13 +99,13 @@ var NAVTREEINDEX3 = "d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8973f687738ddd76f93b5562feae4027":[9,0,10,2,1,4], "d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08":[9,0,10,2,1,1], "d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e":[9,0,10,2,1,8], -"d4/df5/classvector_1_1const__iterator.html":[9,0,72,1], +"d4/df5/classvector_1_1const__iterator.html":[9,0,71,1], "d4/dfb/namespacecycle__sort.html":[8,0,20], "d5/d02/namespacehorspool.html":[8,0,48], "d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html":[9,0,2,7,0,0], "d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e":[9,0,2,7,0,0,0], "d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a3cdb077745d3dc97212d693132371219":[9,0,2,7,0,0,1], -"d5/d15/classcll.html":[9,0,26], +"d5/d15/classcll.html":[9,0,25], "d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html":[10,0,1,7], "d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,1,7,2], "d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,1,7,0], @@ -115,8 +113,7 @@ var NAVTREEINDEX3 = "d5/d1e/tim__sort_8cpp_source.html":[10,0,23,40], "d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html":[10,0,6,17], "d5/d25/bead__sort_8cpp_source.html":[10,0,23,0], -"d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html":[9,0,19,4], -"d5/d29/struct_min_heap_node.html":[9,0,48], +"d5/d29/struct_min_heap_node.html":[9,0,47], "d5/d2c/namespacelayers.html":[8,0,61], "d5/d33/gram__schmidt_8cpp.html":[10,0,15,9], "d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,15,9,5], @@ -142,22 +139,22 @@ var NAVTREEINDEX3 = "d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d":[7,3,9], "d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7":[7,3,7], "d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4":[7,3,5], -"d5/d58/class_test_cases.html":[9,0,66], -"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[9,0,66,0], -"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[9,0,66,1], -"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[9,0,66,2], -"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[9,0,66,9], -"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[9,0,66,10], -"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[9,0,66,11], -"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[9,0,66,6], -"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[9,0,66,7], -"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[9,0,66,8], -"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[9,0,66,12], -"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[9,0,66,13], -"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[9,0,66,14], -"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[9,0,66,3], -"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[9,0,66,4], -"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[9,0,66,5], +"d5/d58/class_test_cases.html":[9,0,65], +"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[9,0,65,0], +"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[9,0,65,1], +"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[9,0,65,2], +"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[9,0,65,9], +"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[9,0,65,10], +"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[9,0,65,11], +"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[9,0,65,6], +"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[9,0,65,7], +"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[9,0,65,8], +"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[9,0,65,12], +"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[9,0,65,13], +"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[9,0,65,14], +"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[9,0,65,3], +"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[9,0,65,4], +"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[9,0,65,5], "d5/d58/persistent__seg__tree__lazy__prop_8cpp.html":[10,0,20,3], "d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,20,3,3], "d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,20,3,2], @@ -249,5 +246,8 @@ var NAVTREEINDEX3 = "d5/d95/structdata__structures_1_1treap_1_1_treap.html":[8,0,21,0,0], "d5/d95/structdata__structures_1_1treap_1_1_treap.html":[9,0,2,5,0], "d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425":[8,0,21,0,0,19], -"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425":[9,0,2,5,0,19] +"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425":[9,0,2,5,0,19], +"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c":[8,0,21,0,0,17], +"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c":[9,0,2,5,0,17], +"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04":[8,0,21,0,0,15] }; diff --git a/navtreeindex4.js b/navtreeindex4.js index a80ea0958..43f419620 100644 --- a/navtreeindex4.js +++ b/navtreeindex4.js @@ -1,8 +1,5 @@ var NAVTREEINDEX4 = { -"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c":[8,0,21,0,0,17], -"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c":[9,0,2,5,0,17], -"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04":[8,0,21,0,0,15], "d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04":[9,0,2,5,0,15], "d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683":[8,0,21,0,0,0], "d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683":[9,0,2,5,0,0], @@ -43,7 +40,7 @@ var NAVTREEINDEX4 = "d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661":[10,0,12,3,2], "d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,12,3,5], "d5/d96/md5_8cpp_source.html":[10,0,12,3], -"d5/da1/structnode.html":[9,0,51], +"d5/da1/structnode.html":[9,0,50], "d5/da7/namespacejarvis.html":[8,0,55], "d5/dab/structdata__structures_1_1list__array_1_1list.html":[9,0,2,1,0], "d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e":[9,0,2,1,0,4], @@ -220,15 +217,15 @@ var NAVTREEINDEX4 = "d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,15,8,2], "d6/d7a/golden__search__extrema_8cpp_source.html":[10,0,15,8], "d6/d7c/structtests_1_1_node.html":[8,0,129,1], -"d6/d7c/structtests_1_1_node.html":[9,0,21,1], +"d6/d7c/structtests_1_1_node.html":[9,0,20,1], "d6/d7c/structtests_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5":[8,0,129,1,0], -"d6/d7c/structtests_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5":[9,0,21,1,0], +"d6/d7c/structtests_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5":[9,0,20,1,0], "d6/d7c/structtests_1_1_node.html#a12a06eef5ccaf667f319506eee655d95":[8,0,129,1,1], -"d6/d7c/structtests_1_1_node.html#a12a06eef5ccaf667f319506eee655d95":[9,0,21,1,1], +"d6/d7c/structtests_1_1_node.html#a12a06eef5ccaf667f319506eee655d95":[9,0,20,1,1], "d6/d7c/structtests_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1":[8,0,129,1,2], -"d6/d7c/structtests_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1":[9,0,21,1,2], +"d6/d7c/structtests_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1":[9,0,20,1,2], "d6/d7c/structtests_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77":[8,0,129,1,3], -"d6/d7c/structtests_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77":[9,0,21,1,3], +"d6/d7c/structtests_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77":[9,0,20,1,3], "d6/d80/double__hash__hash__table_8cpp.html":[10,0,12,1], "d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,12,1,7], "d6/d80/double__hash__hash__table_8cpp_source.html":[10,0,12,1], @@ -249,5 +246,8 @@ var NAVTREEINDEX4 = "d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a09cbe562b0c396329607f5d388d57c9c":[9,0,13,2,0,7], "d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a1aafd0444b410e0fcb66287e9954c893":[9,0,13,2,0,8], "d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8":[9,0,13,2,0,5], -"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4":[9,0,13,2,0,0] +"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4":[9,0,13,2,0,0], +"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154":[9,0,13,2,0,6], +"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2":[9,0,13,2,0,3], +"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602":[9,0,13,2,0,4] }; diff --git a/navtreeindex5.js b/navtreeindex5.js index dfc713792..2f5208672 100644 --- a/navtreeindex5.js +++ b/navtreeindex5.js @@ -1,8 +1,5 @@ var NAVTREEINDEX5 = { -"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154":[9,0,13,2,0,6], -"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2":[9,0,13,2,0,3], -"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602":[9,0,13,2,0,4], "d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933":[9,0,13,2,0,2], "d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c":[9,0,13,2,0,9], "d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53":[9,0,13,2,0,1], @@ -85,7 +82,7 @@ var NAVTREEINDEX5 = "d7/d1a/non__preemptive__sjf__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,3,1,3], "d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html":[10,0,3,1], "d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html":[5], -"d7/d21/classunordered__set_1_1const__reverse__iterator.html":[9,0,71,3], +"d7/d21/classunordered__set_1_1const__reverse__iterator.html":[9,0,70,3], "d7/d24/nqueen__print__all__solutions_8cpp.html":[10,0,0,7], "d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,0,7,1], "d7/d24/nqueen__print__all__solutions_8cpp_source.html":[10,0,0,7], @@ -105,7 +102,6 @@ var NAVTREEINDEX5 = "d7/d3f/namespacetravelling_salesman__bitmanipulation.html":[8,0,131], "d7/d43/stack__using__queue_8cpp_source.html":[10,0,4,30], "d7/d47/namespace_x_o_r.html":[8,0,144], -"d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html":[9,0,19,3], "d7/d48/structgeometry_1_1grahamscan_1_1_point.html":[9,0,5,0,0], "d7/d4c/namespacek__nearest__neighbors.html":[8,0,56], "d7/d50/namespacemodular__inverse__fermat.html":[8,0,78], @@ -136,8 +132,8 @@ var NAVTREEINDEX5 = "d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15":[10,0,17,18,4], "d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,17,18,2], "d7/d75/postfix__evaluation_8cpp_source.html":[10,0,17,18], -"d7/d77/class_edge.html":[9,0,34], -"d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980":[9,0,34,0], +"d7/d77/class_edge.html":[9,0,33], +"d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980":[9,0,33,0], "d7/d7a/namespacebinomial.html":[8,0,8], "d7/d7c/classstatistics_1_1stats__computer1.html":[8,0,118,0], "d7/d7c/classstatistics_1_1stats__computer1.html":[9,0,18,0], @@ -167,17 +163,17 @@ var NAVTREEINDEX5 = "d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981":[10,0,14,10,3], "d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,10,2], "d7/d89/double__factorial_8cpp_source.html":[10,0,14,10], -"d7/d9f/class_s_j_f.html":[9,0,59], -"d7/d9f/class_s_j_f.html#a42d7016523e3adfe5b946fab18ce7905":[9,0,59,1], -"d7/d9f/class_s_j_f.html#a61b76afcc94e573d7232ab51c351fd30":[9,0,59,2], -"d7/d9f/class_s_j_f.html#ac86d31ea081e671adeb82b3f92376fea":[9,0,59,3], -"d7/d9f/class_s_j_f.html#af73fe815835075184724a13c12f613ed":[9,0,59,0], -"d7/da4/struct_list_node.html":[9,0,44], -"d7/da4/struct_list_node.html#a3cfee2eb667c332dc32595208164ef0a":[9,0,44,0], -"d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3":[9,0,44,4], -"d7/da4/struct_list_node.html#aaad9b553e2f936726f5b35ff2734125d":[9,0,44,1], -"d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1":[9,0,44,3], -"d7/da4/struct_list_node.html#afc97c5b9d2e7cc82d0718245688f6ff9":[9,0,44,2], +"d7/d9f/class_s_j_f.html":[9,0,58], +"d7/d9f/class_s_j_f.html#a42d7016523e3adfe5b946fab18ce7905":[9,0,58,1], +"d7/d9f/class_s_j_f.html#a61b76afcc94e573d7232ab51c351fd30":[9,0,58,2], +"d7/d9f/class_s_j_f.html#ac86d31ea081e671adeb82b3f92376fea":[9,0,58,3], +"d7/d9f/class_s_j_f.html#af73fe815835075184724a13c12f613ed":[9,0,58,0], +"d7/da4/struct_list_node.html":[9,0,43], +"d7/da4/struct_list_node.html#a3cfee2eb667c332dc32595208164ef0a":[9,0,43,0], +"d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3":[9,0,43,4], +"d7/da4/struct_list_node.html#aaad9b553e2f936726f5b35ff2734125d":[9,0,43,1], +"d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1":[9,0,43,3], +"d7/da4/struct_list_node.html#afc97c5b9d2e7cc82d0718245688f6ff9":[9,0,43,2], "d7/da6/eratosthenes_8cpp.html":[10,0,14,11], "d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[10,0,14,11,0], "d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,11,3], @@ -196,11 +192,11 @@ var NAVTREEINDEX5 = "d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,16,10,2], "d7/def/trie__multiple__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,16,10,1], "d7/def/trie__multiple__search_8cpp_source.html":[10,0,16,10], -"d7/dfc/classvector.html":[9,0,72], -"d7/dfc/classvector.html#a2396209900e8f592db1f0b2467f7d899":[9,0,72,4], -"d8/d10/structlist.html":[9,0,43], -"d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f":[9,0,43,1], -"d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c":[9,0,43,0], +"d7/dfc/classvector.html":[9,0,71], +"d7/dfc/classvector.html#a2396209900e8f592db1f0b2467f7d899":[9,0,71,4], +"d8/d10/structlist.html":[9,0,42], +"d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f":[9,0,42,1], +"d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c":[9,0,42,0], "d8/d13/bubble__sort_8cpp.html":[10,0,23,4], "d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,23,4,2], "d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,23,4,1], @@ -249,5 +245,9 @@ var NAVTREEINDEX5 = "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f":[8,0,89,0,2,0], "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f":[9,0,13,0,2,0], "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5":[8,0,89,0,2,12], -"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5":[9,0,13,0,2,12] +"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5":[9,0,13,0,2,12], +"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7":[8,0,89,0,2,6], +"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7":[9,0,13,0,2,6], +"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e":[8,0,89,0,2,3], +"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e":[9,0,13,0,2,3] }; diff --git a/navtreeindex6.js b/navtreeindex6.js index 786b887b1..62f5aea2a 100644 --- a/navtreeindex6.js +++ b/navtreeindex6.js @@ -1,9 +1,5 @@ var NAVTREEINDEX6 = { -"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7":[8,0,89,0,2,6], -"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7":[9,0,13,0,2,6], -"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e":[8,0,89,0,2,3], -"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e":[9,0,13,0,2,3], "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea":[8,0,89,0,2,4], "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea":[9,0,13,0,2,4], "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4":[8,0,89,0,2,5], @@ -64,7 +60,7 @@ var NAVTREEINDEX6 = "d8/d6c/line__segment__intersection_8cpp.html":[10,0,8,3], "d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,8,3,2], "d8/d6c/line__segment__intersection_8cpp_source.html":[10,0,8,3], -"d8/d72/class_r_btree.html":[9,0,57], +"d8/d72/class_r_btree.html":[9,0,56], "d8/d76/morse__code_8cpp.html":[10,0,2,6], "d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,2,6,5], "d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,2,6,3], @@ -197,11 +193,11 @@ var NAVTREEINDEX6 = "d8/db9/topological__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,9,19,2], "d8/db9/topological__sort_8cpp_source.html":[10,0,9,19], "d8/dc6/namespacemanacher.html":[8,0,69], -"d8/dc8/struct_point.html":[9,0,52], -"d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7":[9,0,52,2], -"d8/dc8/struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7":[9,0,52,1], -"d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a":[9,0,52,0], -"d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8":[9,0,52,3], +"d8/dc8/struct_point.html":[9,0,51], +"d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7":[9,0,51,2], +"d8/dc8/struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7":[9,0,51,1], +"d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a":[9,0,51,0], +"d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8":[9,0,51,3], "d8/dcc/binary__insertion__sort_8cpp.html":[10,0,23,1], "d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,23,1,3], "d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,23,1,2], @@ -234,20 +230,24 @@ var NAVTREEINDEX6 = "d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8":[10,0,4,17,2], "d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,4,17,1], "d8/df0/queue__using__array_8cpp_source.html":[10,0,4,17], -"d8/df2/classadaline.html":[9,0,22], -"d8/df2/classadaline.html#a082f758fb55fe19f22b3df66f89b2325":[9,0,22,1], -"d8/df2/classadaline.html#a0acbe32aaab897e7939e5b0454035b8c":[9,0,22,0], -"d8/df2/classadaline.html#a28160d17e492597a2f112e0d38551cda":[9,0,22,8], -"d8/df2/classadaline.html#a4cd8fe438032fedaa66f93bfd66f5492":[9,0,22,9], -"d8/df2/classadaline.html#a74e3c6c037b67895014414c5d75465e5":[9,0,22,3], -"d8/df2/classadaline.html#a8d61f9ed872eef26bca39388cbda6a91":[9,0,22,4], -"d8/df2/classadaline.html#aa23d60262f917f35836ef4b1c1d9f7d3":[9,0,22,7], -"d8/df2/classadaline.html#ab11242d9ad5b03a75911e29b04f78fd3":[9,0,22,5], -"d8/df2/classadaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56":[9,0,22,2], -"d8/df2/classadaline.html#ae347040516e995c8fb8ca2e5c0496daa":[9,0,22,6], +"d8/df2/classadaline.html":[9,0,21], +"d8/df2/classadaline.html#a082f758fb55fe19f22b3df66f89b2325":[9,0,21,1], +"d8/df2/classadaline.html#a0acbe32aaab897e7939e5b0454035b8c":[9,0,21,0], +"d8/df2/classadaline.html#a28160d17e492597a2f112e0d38551cda":[9,0,21,8], +"d8/df2/classadaline.html#a4cd8fe438032fedaa66f93bfd66f5492":[9,0,21,9], +"d8/df2/classadaline.html#a74e3c6c037b67895014414c5d75465e5":[9,0,21,3], +"d8/df2/classadaline.html#a8d61f9ed872eef26bca39388cbda6a91":[9,0,21,4], +"d8/df2/classadaline.html#aa23d60262f917f35836ef4b1c1d9f7d3":[9,0,21,7], +"d8/df2/classadaline.html#ab11242d9ad5b03a75911e29b04f78fd3":[9,0,21,5], +"d8/df2/classadaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56":[9,0,21,2], +"d8/df2/classadaline.html#ae347040516e995c8fb8ca2e5c0496daa":[9,0,21,6], "d8/dfa/median__search2_8cpp.html":[10,0,22,11], "d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,22,11,3], "d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,22,11,1], "d8/dfa/median__search2_8cpp_source.html":[10,0,22,11], -"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html":[9,0,12,2,0] +"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html":[9,0,12,2,0], +"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3":[9,0,12,2,0,0], +"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256":[9,0,12,2,0,3], +"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f":[9,0,12,2,0,1], +"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352":[9,0,12,2,0,2] }; diff --git a/navtreeindex7.js b/navtreeindex7.js index 52bde2143..e7d2cadd7 100644 --- a/navtreeindex7.js +++ b/navtreeindex7.js @@ -1,9 +1,5 @@ var NAVTREEINDEX7 = { -"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3":[9,0,12,2,0,0], -"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256":[9,0,12,2,0,3], -"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f":[9,0,12,2,0,1], -"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352":[9,0,12,2,0,2], "d9/d00/factorial_8cpp.html":[10,0,14,14], "d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,14,14,2], "d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,14,1], @@ -102,7 +98,7 @@ var NAVTREEINDEX7 = "d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d":[10,0,14,13,0], "d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,13,2], "d9/d5d/extended__euclid__algorithm_8cpp_source.html":[10,0,14,13], -"d9/d5e/classunordered__set_1_1iterator.html":[9,0,71,0], +"d9/d5e/classunordered__set_1_1iterator.html":[9,0,70,0], "d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html":[10,0,22,9], "d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e":[10,0,22,9,0], "d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,22,9,2], @@ -135,7 +131,7 @@ var NAVTREEINDEX7 = "d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,17,2], "d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,17,1], "d9/d89/fibonacci_8cpp_source.html":[10,0,14,17], -"d9/d90/struct_btree.html":[9,0,24], +"d9/d90/struct_btree.html":[9,0,23], "d9/d92/chaining_8cpp.html":[10,0,12,0], "d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,12,0,1], "d9/d92/chaining_8cpp_source.html":[10,0,12,0], @@ -172,27 +168,27 @@ var NAVTREEINDEX7 = "d9/dd1/namespacelinear__recurrence__matrix.html":[8,0,63], "d9/dd2/cocktail__selection__sort_8cpp_source.html":[10,0,23,6], "d9/dd7/interpolation__search_8cpp_source.html":[10,0,22,5], -"d9/dde/classbinary__search__tree.html":[9,0,23], -"d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc":[9,0,23,20], -"d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a":[9,0,23,8], -"d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd":[9,0,23,16], -"d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0":[9,0,23,5], -"d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3":[9,0,23,15], -"d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13":[9,0,23,10], -"d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff":[9,0,23,9], -"d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63":[9,0,23,3], -"d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb":[9,0,23,4], -"d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0":[9,0,23,12], -"d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362":[9,0,23,17], -"d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb":[9,0,23,14], -"d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778":[9,0,23,11], -"d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50":[9,0,23,19], -"d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2":[9,0,23,2], -"d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6":[9,0,23,1], -"d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1":[9,0,23,18], -"d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03":[9,0,23,7], -"d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153":[9,0,23,13], -"d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153":[9,0,23,6], +"d9/dde/classbinary__search__tree.html":[9,0,22], +"d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc":[9,0,22,20], +"d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a":[9,0,22,8], +"d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd":[9,0,22,16], +"d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0":[9,0,22,5], +"d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3":[9,0,22,15], +"d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13":[9,0,22,10], +"d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff":[9,0,22,9], +"d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63":[9,0,22,3], +"d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb":[9,0,22,4], +"d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0":[9,0,22,12], +"d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362":[9,0,22,17], +"d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb":[9,0,22,14], +"d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778":[9,0,22,11], +"d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50":[9,0,22,19], +"d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2":[9,0,22,2], +"d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6":[9,0,22,1], +"d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1":[9,0,22,18], +"d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03":[9,0,22,7], +"d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153":[9,0,22,13], +"d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153":[9,0,22,6], "d9/dde/structdouble__hashing_1_1_entry.html":[8,0,26,0], "d9/dde/structdouble__hashing_1_1_entry.html":[9,0,4,0], "d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475":[8,0,26,0,0], @@ -203,7 +199,7 @@ var NAVTREEINDEX7 = "d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,6,30,2], "d9/dec/unbounded__0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,6,30,1], "d9/dec/unbounded__0__1__knapsack_8cpp_source.html":[10,0,6,30], -"d9/dee/classdouble__linked__list.html":[9,0,31], +"d9/dee/classdouble__linked__list.html":[9,0,30], "d9/def/namespacesublist__search.html":[8,0,125], "d9/df0/fast__integer__input_8cpp.html":[10,0,17,5], "d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82":[10,0,17,5,0], @@ -240,7 +236,7 @@ var NAVTREEINDEX7 = "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a47b9bc9815a2e7123ac1dc13e5377301":[9,0,10,0,1,2], "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201":[9,0,10,0,1,4], "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e":[9,0,10,0,1,3], -"da/d02/classunordered__set_1_1const__iterator.html":[9,0,71,1], +"da/d02/classunordered__set_1_1const__iterator.html":[9,0,70,1], "da/d0d/longest__common__string_8cpp.html":[10,0,6,14], "da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe":[10,0,6,14,6], "da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,6,14,8], @@ -249,5 +245,9 @@ var NAVTREEINDEX7 = "da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5":[10,0,6,14,2], "da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541":[10,0,6,14,4], "da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155":[10,0,6,14,7], -"da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,6,14,3] +"da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,6,14,3], +"da/d0d/longest__common__string_8cpp_source.html":[10,0,6,14], +"da/d15/class_memorised_factorial.html":[9,0,45], +"da/d15/class_memorised_factorial.html#a35506357960575f150b44ae32fcbad29":[9,0,45,0], +"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html":[9,0,12,0,0] }; diff --git a/navtreeindex8.js b/navtreeindex8.js index 15a681272..16ac646a0 100644 --- a/navtreeindex8.js +++ b/navtreeindex8.js @@ -1,9 +1,5 @@ var NAVTREEINDEX8 = { -"da/d0d/longest__common__string_8cpp_source.html":[10,0,6,14], -"da/d15/class_memorised_factorial.html":[9,0,46], -"da/d15/class_memorised_factorial.html#a35506357960575f150b44ae32fcbad29":[9,0,46,0], -"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html":[9,0,12,0,0], "da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5":[9,0,12,0,0,0], "da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95":[9,0,12,0,0,1], "da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1":[9,0,12,0,0,2], @@ -24,8 +20,8 @@ var NAVTREEINDEX8 = "da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3":[9,0,14,0,0,9], "da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960":[9,0,14,0,0,8], "da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1":[9,0,14,0,0,5], -"da/d21/class_longest___substring.html":[9,0,45], -"da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d":[9,0,45,0], +"da/d21/class_longest___substring.html":[9,0,44], +"da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d":[9,0,44,0], "da/d23/eulers__totient__function_8cpp.html":[10,0,14,12], "da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,12,2], "da/d23/eulers__totient__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,12,0], @@ -46,8 +42,8 @@ var NAVTREEINDEX8 = "da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,60,3], "da/d39/volume_8cpp_source.html":[10,0,14,60], "da/d41/uint128__t_8hpp.html":[10,0,2,7], -"da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3":[10,0,2,7,5], -"da/d41/uint128__t_8hpp.html#acce684d03a24f9c13a9ed36de6d24a57":[10,0,2,7,4], +"da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3":[10,0,2,7,2], +"da/d41/uint128__t_8hpp.html#acce684d03a24f9c13a9ed36de6d24a57":[10,0,2,7,1], "da/d41/uint128__t_8hpp_source.html":[10,0,2,7], "da/d49/classgreedy__algorithms_1_1_digit_separation.html":[8,0,43,3], "da/d49/classgreedy__algorithms_1_1_digit_separation.html":[9,0,7,2], @@ -73,19 +69,19 @@ var NAVTREEINDEX8 = "da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,6,21,3], "da/d52/minimum__edit__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,6,21,1], "da/d52/minimum__edit__distance_8cpp_source.html":[10,0,6,21], -"da/d5a/class_complex.html":[9,0,29], -"da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6":[9,0,29,11], -"da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da":[9,0,29,7], -"da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867":[9,0,29,0], -"da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323":[9,0,29,1], -"da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac":[9,0,29,9], -"da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c":[9,0,29,6], -"da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d":[9,0,29,10], -"da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d":[9,0,29,5], -"da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90":[9,0,29,8], -"da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41":[9,0,29,3], -"da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556":[9,0,29,2], -"da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974":[9,0,29,4], +"da/d5a/class_complex.html":[9,0,28], +"da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6":[9,0,28,11], +"da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da":[9,0,28,7], +"da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867":[9,0,28,0], +"da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323":[9,0,28,1], +"da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac":[9,0,28,9], +"da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c":[9,0,28,6], +"da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d":[9,0,28,10], +"da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d":[9,0,28,5], +"da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90":[9,0,28,8], +"da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41":[9,0,28,3], +"da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556":[9,0,28,2], +"da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974":[9,0,28,4], "da/d61/structsearch_1_1sublist__search_1_1_node.html":[9,0,17,0,0], "da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b":[9,0,17,0,0,0], "da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a":[9,0,17,0,0,1], @@ -117,7 +113,7 @@ var NAVTREEINDEX8 = "da/d7b/primality__test_8cpp_source.html":[10,0,17,19], "da/d82/namespacecycle__detection.html":[8,0,19], "da/d83/kosaraju_8cpp_source.html":[10,0,9,13], -"da/d86/struct_test_case.html":[9,0,65], +"da/d86/struct_test_case.html":[9,0,64], "da/d8d/depth__first__search_8cpp.html":[10,0,9,6], "da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,9,6,3], "da/d8d/depth__first__search_8cpp_source.html":[10,0,9,6], @@ -131,21 +127,21 @@ var NAVTREEINDEX8 = "da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b":[9,0,10,1,0,1], "da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563":[9,0,10,1,0,5], "da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#afe732a33112b457b738f403622d226e5":[9,0,10,1,0,3], -"da/d9a/class_graph.html":[9,0,37], -"da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d":[9,0,37,6], -"da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3":[9,0,37,1], -"da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1":[9,0,37,7], -"da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1":[9,0,37,2], -"da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413":[9,0,37,5], -"da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910":[9,0,37,4], -"da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d":[9,0,37,0], -"da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5":[9,0,37,3], +"da/d9a/class_graph.html":[9,0,36], +"da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d":[9,0,36,6], +"da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3":[9,0,36,1], +"da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1":[9,0,36,7], +"da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1":[9,0,36,2], +"da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413":[9,0,36,5], +"da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910":[9,0,36,4], +"da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d":[9,0,36,0], +"da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5":[9,0,36,3], "da/d9a/palindrome__of__number_8cpp.html":[10,0,17,15], "da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,17,15,0], "da/d9a/palindrome__of__number_8cpp_source.html":[10,0,17,15], "da/d9c/namespacegames.html":[8,0,35], "da/da3/uint256__t_8hpp.html":[10,0,2,8], -"da/da3/uint256__t_8hpp.html#a1d8c5ec5b5e419c5c8a740251485102c":[10,0,2,8,4], +"da/da3/uint256__t_8hpp.html#a1d8c5ec5b5e419c5c8a740251485102c":[10,0,2,8,1], "da/da3/uint256__t_8hpp_source.html":[10,0,2,8], "da/dac/n__queens__all__solution__optimised_8cpp.html":[10,0,0,6], "da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,0,6,1], @@ -249,5 +245,9 @@ var NAVTREEINDEX8 = "db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,27,2], "db/d40/integral__approximation2_8cpp_source.html":[10,0,14,27], "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html":[9,0,2,4,0], -"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323":[9,0,2,4,0,4] +"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323":[9,0,2,4,0,4], +"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7":[9,0,2,4,0,3], +"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb":[9,0,2,4,0,0], +"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39":[9,0,2,4,0,2], +"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6":[9,0,2,4,0,6] }; diff --git a/navtreeindex9.js b/navtreeindex9.js index 98b500951..96259b8c2 100644 --- a/navtreeindex9.js +++ b/navtreeindex9.js @@ -1,12 +1,8 @@ var NAVTREEINDEX9 = { -"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7":[9,0,2,4,0,3], -"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb":[9,0,2,4,0,0], -"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39":[9,0,2,4,0,2], -"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6":[9,0,2,4,0,6], "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2":[9,0,2,4,0,1], "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b":[9,0,2,4,0,5], -"db/d66/struct_item.html":[9,0,40], +"db/d66/struct_item.html":[9,0,39], "db/d6b/kelvin__to__celsius_8cpp.html":[10,0,17,9], "db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,17,9,3], "db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,17,9,2], @@ -19,127 +15,127 @@ var NAVTREEINDEX9 = "db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,11,4,2], "db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,11,4,1], "db/d80/gale__shapley_8cpp_source.html":[10,0,11,4], -"db/d82/classlarge__number.html":[9,0,41], -"db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872":[9,0,41,2], -"db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337":[9,0,41,0], -"db/d82/classlarge__number.html#a13282908dfc4888392ed3d1fc6aae492":[9,0,41,17], -"db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc":[9,0,41,6], -"db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a":[9,0,41,9], -"db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615":[9,0,41,4], -"db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94":[9,0,41,15], -"db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f":[9,0,41,3], -"db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350":[9,0,41,8], -"db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca":[9,0,41,18], -"db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08":[9,0,41,13], -"db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687":[9,0,41,10], -"db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9":[9,0,41,14], -"db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf":[9,0,41,11], -"db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b":[9,0,41,12], -"db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46":[9,0,41,16], -"db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93":[9,0,41,7], -"db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac":[9,0,41,5], -"db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57":[9,0,41,19], -"db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a":[9,0,41,1], -"db/d8b/struct_node.html":[9,0,50], +"db/d82/classlarge__number.html":[9,0,40], +"db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872":[9,0,40,2], +"db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337":[9,0,40,0], +"db/d82/classlarge__number.html#a13282908dfc4888392ed3d1fc6aae492":[9,0,40,17], +"db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc":[9,0,40,6], +"db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a":[9,0,40,9], +"db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615":[9,0,40,4], +"db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94":[9,0,40,15], +"db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f":[9,0,40,3], +"db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350":[9,0,40,8], +"db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca":[9,0,40,18], +"db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08":[9,0,40,13], +"db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687":[9,0,40,10], +"db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9":[9,0,40,14], +"db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf":[9,0,40,11], +"db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b":[9,0,40,12], +"db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46":[9,0,40,16], +"db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93":[9,0,40,7], +"db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac":[9,0,40,5], +"db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57":[9,0,40,19], +"db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a":[9,0,40,1], +"db/d8b/struct_node.html":[9,0,49], "db/d93/check__prime_8cpp.html":[10,0,14,8], "db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,14,8,2], "db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,8,1], "db/d93/check__prime_8cpp_source.html":[10,0,14,8], -"db/d9a/classuint128__t.html":[9,0,69], -"db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40":[9,0,69,18], -"db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3":[9,0,69,37], -"db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798":[9,0,69,42], -"db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a":[9,0,69,22], -"db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9":[9,0,69,65], -"db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac":[9,0,69,1], -"db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606":[9,0,69,32], -"db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190":[9,0,69,50], -"db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a":[9,0,69,53], -"db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed":[9,0,69,40], -"db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705":[9,0,69,77], -"db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640":[9,0,69,24], -"db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2":[9,0,69,19], -"db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440":[9,0,69,61], -"db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd":[9,0,69,71], -"db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db":[9,0,69,47], -"db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092":[9,0,69,29], -"db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee":[9,0,69,45], -"db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03":[9,0,69,75], -"db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481":[9,0,69,62], -"db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a":[9,0,69,57], -"db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304":[9,0,69,70], -"db/d9a/classuint128__t.html#a4147188abcdcdb12c61bfbe4e4c0a363":[9,0,69,5], -"db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f":[9,0,69,76], -"db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860":[9,0,69,28], -"db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67":[9,0,69,68], -"db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c":[9,0,69,52], -"db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30":[9,0,69,27], -"db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d":[9,0,69,31], -"db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004":[9,0,69,35], -"db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc":[9,0,69,48], -"db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953":[9,0,69,78], -"db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b":[9,0,69,3], -"db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee":[9,0,69,72], -"db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec":[9,0,69,38], -"db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e":[9,0,69,11], -"db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848":[9,0,69,64], -"db/d9a/classuint128__t.html#a6f2499a97b351adf66a14778ccbb13d1":[9,0,69,41], -"db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639":[9,0,69,12], -"db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696":[9,0,69,14], -"db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896":[9,0,69,58], -"db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e":[9,0,69,59], -"db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e":[9,0,69,8], -"db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c":[9,0,69,4], -"db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503":[9,0,69,74], -"db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c":[9,0,69,39], -"db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e":[9,0,69,60], -"db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df":[9,0,69,6], -"db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c":[9,0,69,9], -"db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b":[9,0,69,67], -"db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d":[9,0,69,2], -"db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295":[9,0,69,30], -"db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb":[9,0,69,36], -"db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4":[9,0,69,20], -"db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a":[9,0,69,51], -"db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd":[9,0,69,10], -"db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b":[9,0,69,46], -"db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37":[9,0,69,66], -"db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1":[9,0,69,23], -"db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e":[9,0,69,15], -"db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5":[9,0,69,56], -"db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d":[9,0,69,73], -"db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74":[9,0,69,54], -"db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8":[9,0,69,43], -"db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066":[9,0,69,17], -"db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050":[9,0,69,25], -"db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e":[9,0,69,33], -"db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544":[9,0,69,55], -"db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4":[9,0,69,49], -"db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244":[9,0,69,21], -"db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d":[9,0,69,13], -"db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040":[9,0,69,0], -"db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad":[9,0,69,16], -"db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a":[9,0,69,69], -"db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292":[9,0,69,63], -"db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94":[9,0,69,44], -"db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2":[9,0,69,7], -"db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733":[9,0,69,26], -"db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6":[9,0,69,34], +"db/d9a/classuint128__t.html":[9,0,68], +"db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40":[9,0,68,18], +"db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3":[9,0,68,37], +"db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798":[9,0,68,42], +"db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a":[9,0,68,22], +"db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9":[9,0,68,65], +"db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac":[9,0,68,1], +"db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606":[9,0,68,32], +"db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190":[9,0,68,50], +"db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a":[9,0,68,53], +"db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed":[9,0,68,40], +"db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705":[9,0,68,77], +"db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640":[9,0,68,24], +"db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2":[9,0,68,19], +"db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440":[9,0,68,61], +"db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd":[9,0,68,71], +"db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db":[9,0,68,47], +"db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092":[9,0,68,29], +"db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee":[9,0,68,45], +"db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03":[9,0,68,75], +"db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481":[9,0,68,62], +"db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a":[9,0,68,57], +"db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304":[9,0,68,70], +"db/d9a/classuint128__t.html#a4147188abcdcdb12c61bfbe4e4c0a363":[9,0,68,5], +"db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f":[9,0,68,76], +"db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860":[9,0,68,28], +"db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67":[9,0,68,68], +"db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c":[9,0,68,52], +"db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30":[9,0,68,27], +"db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d":[9,0,68,31], +"db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004":[9,0,68,35], +"db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc":[9,0,68,48], +"db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953":[9,0,68,78], +"db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b":[9,0,68,3], +"db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee":[9,0,68,72], +"db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec":[9,0,68,38], +"db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e":[9,0,68,11], +"db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848":[9,0,68,64], +"db/d9a/classuint128__t.html#a6f2499a97b351adf66a14778ccbb13d1":[9,0,68,41], +"db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639":[9,0,68,12], +"db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696":[9,0,68,14], +"db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896":[9,0,68,58], +"db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e":[9,0,68,59], +"db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e":[9,0,68,8], +"db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c":[9,0,68,4], +"db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503":[9,0,68,74], +"db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c":[9,0,68,39], +"db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e":[9,0,68,60], +"db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df":[9,0,68,6], +"db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c":[9,0,68,9], +"db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b":[9,0,68,67], +"db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d":[9,0,68,2], +"db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295":[9,0,68,30], +"db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb":[9,0,68,36], +"db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4":[9,0,68,20], +"db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a":[9,0,68,51], +"db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd":[9,0,68,10], +"db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b":[9,0,68,46], +"db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37":[9,0,68,66], +"db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1":[9,0,68,23], +"db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e":[9,0,68,15], +"db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5":[9,0,68,56], +"db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d":[9,0,68,73], +"db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74":[9,0,68,54], +"db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8":[9,0,68,43], +"db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066":[9,0,68,17], +"db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050":[9,0,68,25], +"db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e":[9,0,68,33], +"db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544":[9,0,68,55], +"db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4":[9,0,68,49], +"db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244":[9,0,68,21], +"db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d":[9,0,68,13], +"db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040":[9,0,68,0], +"db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad":[9,0,68,16], +"db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a":[9,0,68,69], +"db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292":[9,0,68,63], +"db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94":[9,0,68,44], +"db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2":[9,0,68,7], +"db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733":[9,0,68,26], +"db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6":[9,0,68,34], "db/d9f/iterative__factorial_8cpp.html":[10,0,14,29], "db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,29,2], "db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,29,1], "db/d9f/iterative__factorial_8cpp_source.html":[10,0,14,29], -"db/da9/classqueue.html":[9,0,56], -"db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368":[9,0,56,2], -"db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d":[9,0,56,7], -"db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec":[9,0,56,6], -"db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375":[9,0,56,0], -"db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7":[9,0,56,5], -"db/da9/classqueue.html#a7611df63ebefae613d311039d7305143":[9,0,56,9], -"db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604":[9,0,56,4], -"db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d":[9,0,56,3], -"db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85":[9,0,56,1], -"db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094":[9,0,56,8], +"db/da9/classqueue.html":[9,0,55], +"db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368":[9,0,55,2], +"db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d":[9,0,55,7], +"db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec":[9,0,55,6], +"db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375":[9,0,55,0], +"db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7":[9,0,55,5], +"db/da9/classqueue.html#a7611df63ebefae613d311039d7305143":[9,0,55,9], +"db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604":[9,0,55,4], +"db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d":[9,0,55,3], +"db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85":[9,0,55,1], +"db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094":[9,0,55,8], "db/db2/counting__sort__string_8cpp_source.html":[10,0,23,10], "db/db5/slow__sort_8cpp_source.html":[10,0,23,36], "db/dbc/tree__234_8cpp.html":[10,0,4,36], @@ -171,12 +167,12 @@ var NAVTREEINDEX9 = "db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,6,20,2], "db/dfb/maximum__circular__subarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,6,20,0], "db/dfb/maximum__circular__subarray_8cpp_source.html":[10,0,6,20], -"dc/d02/classstats__computer2.html":[9,0,64], -"dc/d02/classstats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[9,0,64,0], -"dc/d02/classstats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a":[9,0,64,4], -"dc/d02/classstats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e":[9,0,64,2], -"dc/d02/classstats__computer2.html#ade6de704deea24fdc88077b3d9a0d534":[9,0,64,1], -"dc/d02/classstats__computer2.html#af6198817084276113b3c064e87ce0555":[9,0,64,3], +"dc/d02/classstats__computer2.html":[9,0,63], +"dc/d02/classstats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[9,0,63,0], +"dc/d02/classstats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a":[9,0,63,4], +"dc/d02/classstats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e":[9,0,63,2], +"dc/d02/classstats__computer2.html#ade6de704deea24fdc88077b3d9a0d534":[9,0,63,1], +"dc/d02/classstats__computer2.html#af6198817084276113b3c064e87ce0555":[9,0,63,3], "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html":[9,0,3,0,0], "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256":[9,0,3,0,0,0], "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17":[9,0,3,0,0,14], @@ -204,8 +200,8 @@ var NAVTREEINDEX9 = "dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c":[10,0,17,17,2], "dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,17,17,0], "dc/d1a/pascal__triangle_8cpp_source.html":[10,0,17,17], -"dc/d1f/classcatalan__numbers.html":[9,0,25], -"dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8":[9,0,25,0], +"dc/d1f/classcatalan__numbers.html":[9,0,24], +"dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8":[9,0,24,0], "dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html":[8,0,17], "dc/d38/ordinary__least__squares__regressor_8cpp.html":[10,0,13,6], "dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f":[10,0,13,6,10], @@ -228,26 +224,30 @@ var NAVTREEINDEX9 = "dc/d3a/namespacesubset__sum.html":[8,0,126], "dc/d52/linear__recurrence__matrix_8cpp_source.html":[10,0,14,35], "dc/d53/classtests_1_1_circular_linked_list.html":[8,0,129,0], -"dc/d53/classtests_1_1_circular_linked_list.html":[9,0,21,0], +"dc/d53/classtests_1_1_circular_linked_list.html":[9,0,20,0], "dc/d53/classtests_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42":[8,0,129,0,13], -"dc/d53/classtests_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42":[9,0,21,0,13], +"dc/d53/classtests_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42":[9,0,20,0,13], "dc/d53/classtests_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1":[8,0,129,0,1], -"dc/d53/classtests_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1":[9,0,21,0,1], +"dc/d53/classtests_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1":[9,0,20,0,1], "dc/d53/classtests_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae":[8,0,129,0,7], -"dc/d53/classtests_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae":[9,0,21,0,7], +"dc/d53/classtests_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae":[9,0,20,0,7], "dc/d53/classtests_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986":[8,0,129,0,4], -"dc/d53/classtests_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986":[9,0,21,0,4], +"dc/d53/classtests_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986":[9,0,20,0,4], "dc/d53/classtests_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4":[8,0,129,0,6], -"dc/d53/classtests_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4":[9,0,21,0,6], +"dc/d53/classtests_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4":[9,0,20,0,6], "dc/d53/classtests_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21":[8,0,129,0,11], -"dc/d53/classtests_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21":[9,0,21,0,11], +"dc/d53/classtests_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21":[9,0,20,0,11], "dc/d53/classtests_1_1_circular_linked_list.html#a46195fcf11b636064c7172cb74b55dd0":[8,0,129,0,3], -"dc/d53/classtests_1_1_circular_linked_list.html#a46195fcf11b636064c7172cb74b55dd0":[9,0,21,0,3], +"dc/d53/classtests_1_1_circular_linked_list.html#a46195fcf11b636064c7172cb74b55dd0":[9,0,20,0,3], "dc/d53/classtests_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de":[8,0,129,0,12], -"dc/d53/classtests_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de":[9,0,21,0,12], +"dc/d53/classtests_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de":[9,0,20,0,12], "dc/d53/classtests_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13":[8,0,129,0,15], -"dc/d53/classtests_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13":[9,0,21,0,15], +"dc/d53/classtests_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13":[9,0,20,0,15], "dc/d53/classtests_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5":[8,0,129,0,8], -"dc/d53/classtests_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5":[9,0,21,0,8], -"dc/d53/classtests_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9":[8,0,129,0,9] +"dc/d53/classtests_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5":[9,0,20,0,8], +"dc/d53/classtests_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9":[8,0,129,0,9], +"dc/d53/classtests_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9":[9,0,20,0,9], +"dc/d53/classtests_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888":[8,0,129,0,0], +"dc/d53/classtests_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888":[9,0,20,0,0], +"dc/d53/classtests_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208":[8,0,129,0,14] }; diff --git a/search/all_e.js b/search/all_e.js index f8cc968e7..f848408c4 100644 --- a/search/all_e.js +++ b/search/all_e.js @@ -53,54 +53,48 @@ var searchData= ['inversion_50',['inversion',['../d9/d13/namespaceinversion.html',1,'']]], ['is2node_51',['Is2Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631',1,'data_structures::tree_234::Node']]], ['is34node_52',['Is34Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18',1,'data_structures::tree_234::Node']]], - ['is_5farithmetic_3c_20uint128_5ft_20_3e_53',['is_arithmetic< uint128_t >',['../d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html',1,'std']]], - ['is_5farithmetic_3c_20uint256_5ft_20_3e_54',['is_arithmetic< uint256_t >',['../dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html',1,'std']]], - ['is_5farmstrong_55',['is_armstrong',['../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26',1,'dynamic_programming']]], - ['is_5fbipartite_56',['is_bipartite',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9b0c6400693a5cfff971f768dd5ca5ca',1,'graph::is_graph_bipartite::Graph']]], - ['is_5feven_57',['is_even',['../d4/dcd/check__even__odd_8cpp.html#ac1cbf9fb33c4a37de47d1ed519abc20a',1,'bit_manipulation::even_odd']]], - ['is_5ffactorial_58',['is_factorial',['../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca',1,'math']]], - ['is_5fgraph_5fbipartite_59',['is_graph_bipartite',['../de/d83/namespaceis__graph__bipartite.html',1,'']]], - ['is_5fgraph_5fbipartite_2ecpp_60',['is_graph_bipartite.cpp',['../d6/dd8/is__graph__bipartite_8cpp.html',1,'']]], - ['is_5fhappy_61',['is_happy',['../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7',1,'happy_number.cpp']]], - ['is_5fintegral_3c_20uint128_5ft_20_3e_62',['is_integral< uint128_t >',['../d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html',1,'std']]], - ['is_5fintegral_3c_20uint256_5ft_20_3e_63',['is_integral< uint256_t >',['../d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html',1,'std']]], - ['is_5fnumber_64',['is_number',['../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59',1,'games::memory_game::is_number()'],['../d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a',1,'others::postfix_expression::is_number()']]], - ['is_5fprefix_65',['is_prefix',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a',1,'strings::boyer_moore']]], - ['is_5fprime_66',['is_prime',['../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444',1,'math']]], - ['is_5fsquare_67',['is_square',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e',1,'ordinary_least_squares_regressor.cpp']]], - ['is_5funsigned_3c_20uint128_5ft_20_3e_68',['is_unsigned< uint128_t >',['../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html',1,'std']]], - ['is_5funsigned_3c_20uint256_5ft_20_3e_69',['is_unsigned< uint256_t >',['../df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html',1,'std']]], - ['isbigendian_70',['isBigEndian',['../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446',1,'hashing::md5']]], - ['isbipartite_71',['isBipartite',['../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b',1,'graph']]], - ['iscyclicbfs_72',['isCyclicBFS',['../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5',1,'CycleCheck']]], - ['iscyclicdfs_73',['isCyclicDFS',['../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474',1,'CycleCheck']]], - ['iscyclicdfshelper_74',['isCyclicDFSHelper',['../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b',1,'CycleCheck']]], - ['isdigit_75',['isDigit',['../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180',1,'data_structures::linked_list']]], - ['isempty_76',['isEmpty',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a',1,'data_structures::linked_list::list::isEmpty()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6d50919d34481a2b96cb74627d227c0e',1,'data_structures::linked_list::list::isEmpty() const']]], - ['isemptyqueue_77',['isEmptyQueue',['../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec',1,'queue']]], - ['isemptystack_78',['isEmptyStack',['../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5',1,'stack']]], - ['isendofword_79',['isEndofWord',['../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6',1,'data_structures::trie']]], - ['isfull_80',['IsFull',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd',1,'data_structures::tree_234::Node']]], - ['isleaf_81',['IsLeaf',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8',1,'data_structures::tree_234::Node']]], - ['ispossible_82',['isPossible',['../d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0',1,'backtracking::sudoku_solver']]], - ['ispoweroftwo_83',['isPowerOfTwo',['../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f',1,'bit_manipulation']]], - ['isprime_84',['IsPrime',['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'primality_test.cpp']]], - ['isprime_85',['isPrime',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e',1,'math::modular_inverse_fermat']]], - ['isprime_86',['isprime',['../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23',1,'prime_factorization.cpp']]], - ['issafe_87',['isSafe',['../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d',1,'backtracking::graph_coloring::isSafe()'],['../d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160',1,'backtracking::n_queens::isSafe()']]], - ['issafe_88',['issafe',['../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2',1,'backtracking::knight_tour']]], - ['issame_89',['isSame',['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)'],['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)']]], - ['isvalidbinarystring_90',['isValidBinaryString',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2',1,'greedy_algorithms::BinaryAddition']]], - ['it_5fternary_5fsearch_91',['it_ternary_search',['../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0',1,'ternary_search.cpp']]], - ['item_92',['Item',['../db/d66/struct_item.html',1,'']]], - ['items_93',['items',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9',1,'data_structures::tree_234::Node']]], - ['iterative_20inorder_20traversal_20of_20a_20tree_94',['Iterative Inorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree']]], - ['iterative_20postorder_20traversal_20of_20a_20tree_95',['Iterative Postorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree']]], - ['iterative_20preorder_20traversal_20of_20a_20tree_96',['Iterative Preorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]], - ['iterative_5ffactorial_2ecpp_97',['iterative_factorial.cpp',['../db/d9f/iterative__factorial_8cpp.html',1,'']]], - ['iterative_5ftree_5ftraversals_98',['iterative_tree_traversals',['../dd/d73/namespaceiterative__tree__traversals.html',1,'']]], - ['iterative_5ftree_5ftraversals_2ecpp_99',['iterative_tree_traversals.cpp',['../d8/d90/iterative__tree__traversals_8cpp.html',1,'']]], - ['iterativefactorial_100',['iterativeFactorial',['../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a',1,'math']]], - ['iterativequicksort_101',['iterativeQuickSort',['../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5',1,'sorting']]], - ['iterator_102',['iterator',['../d9/d5e/classunordered__set_1_1iterator.html',1,'unordered_set< K >::iterator'],['../d0/d05/classvector_1_1iterator.html',1,'vector< T >::iterator']]] + ['is_5farmstrong_53',['is_armstrong',['../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26',1,'dynamic_programming']]], + ['is_5fbipartite_54',['is_bipartite',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9b0c6400693a5cfff971f768dd5ca5ca',1,'graph::is_graph_bipartite::Graph']]], + ['is_5feven_55',['is_even',['../d4/dcd/check__even__odd_8cpp.html#ac1cbf9fb33c4a37de47d1ed519abc20a',1,'bit_manipulation::even_odd']]], + ['is_5ffactorial_56',['is_factorial',['../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca',1,'math']]], + ['is_5fgraph_5fbipartite_57',['is_graph_bipartite',['../de/d83/namespaceis__graph__bipartite.html',1,'']]], + ['is_5fgraph_5fbipartite_2ecpp_58',['is_graph_bipartite.cpp',['../d6/dd8/is__graph__bipartite_8cpp.html',1,'']]], + ['is_5fhappy_59',['is_happy',['../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7',1,'happy_number.cpp']]], + ['is_5fnumber_60',['is_number',['../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59',1,'games::memory_game::is_number()'],['../d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a',1,'others::postfix_expression::is_number()']]], + ['is_5fprefix_61',['is_prefix',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a',1,'strings::boyer_moore']]], + ['is_5fprime_62',['is_prime',['../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444',1,'math']]], + ['is_5fsquare_63',['is_square',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e',1,'ordinary_least_squares_regressor.cpp']]], + ['isbigendian_64',['isBigEndian',['../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446',1,'hashing::md5']]], + ['isbipartite_65',['isBipartite',['../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b',1,'graph']]], + ['iscyclicbfs_66',['isCyclicBFS',['../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5',1,'CycleCheck']]], + ['iscyclicdfs_67',['isCyclicDFS',['../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474',1,'CycleCheck']]], + ['iscyclicdfshelper_68',['isCyclicDFSHelper',['../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b',1,'CycleCheck']]], + ['isdigit_69',['isDigit',['../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180',1,'data_structures::linked_list']]], + ['isempty_70',['isEmpty',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a',1,'data_structures::linked_list::list::isEmpty()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6d50919d34481a2b96cb74627d227c0e',1,'data_structures::linked_list::list::isEmpty() const']]], + ['isemptyqueue_71',['isEmptyQueue',['../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec',1,'queue']]], + ['isemptystack_72',['isEmptyStack',['../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5',1,'stack']]], + ['isendofword_73',['isEndofWord',['../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6',1,'data_structures::trie']]], + ['isfull_74',['IsFull',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd',1,'data_structures::tree_234::Node']]], + ['isleaf_75',['IsLeaf',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8',1,'data_structures::tree_234::Node']]], + ['ispossible_76',['isPossible',['../d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0',1,'backtracking::sudoku_solver']]], + ['ispoweroftwo_77',['isPowerOfTwo',['../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f',1,'bit_manipulation']]], + ['isprime_78',['IsPrime',['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'primality_test.cpp']]], + ['isprime_79',['isPrime',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e',1,'math::modular_inverse_fermat']]], + ['isprime_80',['isprime',['../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23',1,'prime_factorization.cpp']]], + ['issafe_81',['isSafe',['../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d',1,'backtracking::graph_coloring::isSafe()'],['../d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160',1,'backtracking::n_queens::isSafe()']]], + ['issafe_82',['issafe',['../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2',1,'backtracking::knight_tour']]], + ['issame_83',['isSame',['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)'],['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)']]], + ['isvalidbinarystring_84',['isValidBinaryString',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2',1,'greedy_algorithms::BinaryAddition']]], + ['it_5fternary_5fsearch_85',['it_ternary_search',['../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0',1,'ternary_search.cpp']]], + ['item_86',['Item',['../db/d66/struct_item.html',1,'']]], + ['items_87',['items',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9',1,'data_structures::tree_234::Node']]], + ['iterative_20inorder_20traversal_20of_20a_20tree_88',['Iterative Inorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree']]], + ['iterative_20postorder_20traversal_20of_20a_20tree_89',['Iterative Postorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree']]], + ['iterative_20preorder_20traversal_20of_20a_20tree_90',['Iterative Preorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]], + ['iterative_5ffactorial_2ecpp_91',['iterative_factorial.cpp',['../db/d9f/iterative__factorial_8cpp.html',1,'']]], + ['iterative_5ftree_5ftraversals_92',['iterative_tree_traversals',['../dd/d73/namespaceiterative__tree__traversals.html',1,'']]], + ['iterative_5ftree_5ftraversals_2ecpp_93',['iterative_tree_traversals.cpp',['../d8/d90/iterative__tree__traversals_8cpp.html',1,'']]], + ['iterativefactorial_94',['iterativeFactorial',['../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a',1,'math']]], + ['iterativequicksort_95',['iterativeQuickSort',['../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5',1,'sorting']]], + ['iterator_96',['iterator',['../d9/d5e/classunordered__set_1_1iterator.html',1,'unordered_set< K >::iterator'],['../d0/d05/classvector_1_1iterator.html',1,'vector< T >::iterator']]] ]; diff --git a/search/classes_8.js b/search/classes_8.js index a6e6e5622..f9d201725 100644 --- a/search/classes_8.js +++ b/search/classes_8.js @@ -1,12 +1,6 @@ var searchData= [ ['info_0',['Info',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html',1,'machine_learning::aystar_search::AyStarSearch']]], - ['is_5farithmetic_3c_20uint128_5ft_20_3e_1',['is_arithmetic< uint128_t >',['../d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html',1,'std']]], - ['is_5farithmetic_3c_20uint256_5ft_20_3e_2',['is_arithmetic< uint256_t >',['../dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html',1,'std']]], - ['is_5fintegral_3c_20uint128_5ft_20_3e_3',['is_integral< uint128_t >',['../d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html',1,'std']]], - ['is_5fintegral_3c_20uint256_5ft_20_3e_4',['is_integral< uint256_t >',['../d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html',1,'std']]], - ['is_5funsigned_3c_20uint128_5ft_20_3e_5',['is_unsigned< uint128_t >',['../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html',1,'std']]], - ['is_5funsigned_3c_20uint256_5ft_20_3e_6',['is_unsigned< uint256_t >',['../df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html',1,'std']]], - ['item_7',['Item',['../db/d66/struct_item.html',1,'']]], - ['iterator_8',['iterator',['../d9/d5e/classunordered__set_1_1iterator.html',1,'unordered_set< K >::iterator'],['../d0/d05/classvector_1_1iterator.html',1,'vector< T >::iterator']]] + ['item_1',['Item',['../db/d66/struct_item.html',1,'']]], + ['iterator_2',['iterator',['../d9/d5e/classunordered__set_1_1iterator.html',1,'unordered_set< K >::iterator'],['../d0/d05/classvector_1_1iterator.html',1,'vector< T >::iterator']]] ];