diff --git a/annotated.html b/annotated.html index f6eefa169..ae80b7486 100644 --- a/annotated.html +++ b/annotated.html @@ -98,10 +98,10 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
[detail level 1234]
- - - - + + + + diff --git a/annotated_dup.js b/annotated_dup.js index ea6885471..aa969bc90 100644 --- a/annotated_dup.js +++ b/annotated_dup.js @@ -1,7 +1,7 @@ var annotated_dup = [ [ "ciphers", "d6/d4e/namespaceciphers.html", "d6/d4e/namespaceciphers" ], - [ "data_structure", "d1/db4/namespacedata__structure.html", "d1/db4/namespacedata__structure" ], + [ "data_structures", "d5/d3c/namespacedata__structures.html", "d5/d3c/namespacedata__structures" ], [ "double_hashing", "d0/d65/namespacedouble__hashing.html", "d0/d65/namespacedouble__hashing" ], [ "geometry", "d5/d5f/namespacegeometry.html", "d5/d5f/namespacegeometry" ], [ "graph", "df/dce/namespacegraph.html", "df/dce/namespacegraph" ], diff --git a/classes.html b/classes.html index a05a8e1ca..206a5f3f7 100644 --- a/classes.html +++ b/classes.html @@ -139,7 +139,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); }) - + @@ -177,8 +177,8 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); }) - - + + diff --git a/d0/d6e/classdata__structure_1_1trie.html b/d0/d3e/classdata__structures_1_1trie.html similarity index 67% rename from d0/d6e/classdata__structure_1_1trie.html rename to d0/d3e/classdata__structures_1_1trie.html index 1db591af0..03a46c1f5 100644 --- a/d0/d6e/classdata__structure_1_1trie.html +++ b/d0/d3e/classdata__structures_1_1trie.html @@ -5,7 +5,7 @@ -Algorithms_in_C++: data_structure::trie Class Reference +Algorithms_in_C++: data_structures::trie Class Reference @@ -71,7 +71,7 @@ $(function() {
@@ -95,65 +95,65 @@ $(document).ready(function(){initNavTree('d0/d6e/classdata__structure_1_1trie.ht Private Member Functions | Private Attributes | Static Private Attributes | -List of all members
+List of all members
-
data_structure::trie Class Reference
+
data_structures::trie Class Reference

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

+ More...

-Collaboration diagram for data_structure::trie:
+Collaboration diagram for data_structures::trie:
-
+
[legend]
 ▼NciphersAlgorithms for encryption and decryption
 CHillCipherImplementation of Hill Cipher algorithm
 ▼Ndata_structureData-structure algorithms
 CNode
 CSkipList
 CtrieTrie implementation for small-case English alphabets a-z
 ▼Ndata_structuresData-structure algorithms
 CNode
 CSkipList
 CtrieTrie implementation for small-case English alphabets a-z
 ▼Ndouble_hashingAn implementation of hash table using double hashing algorithm
 CEntry
 ▼NgeometryGeometry algorithms
  m  
 Queue_Array   trie (data_structure)   trie (data_structures)   
  r  
SG (range_queries::heavy_light_decomposition)   
HillCipher (ciphers)   Node (data_structure)   SkipList (data_structure)   Node (data_structures)   SkipList (data_structures)   
DenseLayer (machine_learning::neural_network::layers)    HLD (range_queries::heavy_light_decomposition)   
- - - - - - - - - + + + + + + + + +

Public Member Functions

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

Private Member Functions

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

Private Attributes

-std::array< std::shared_ptr< trie >, NUM_CHARS<< 1 > arr
 Recursive tree nodes as an array of shared-pointers.
 
-bool isEndofWord = false
 identifier if a node is terminal node
 
+std::array< std::shared_ptr< trie >, NUM_CHARS<< 1 > arr
 Recursive tree nodes as an array of shared-pointers.
 
+bool isEndofWord = false
 identifier if a node is terminal node
 
- - - + + +

Static Private Attributes

-static constexpr uint8_t NUM_CHARS = 26
 Number of alphabets.
 
+static constexpr uint8_t NUM_CHARS = 26
 Number of alphabets.
 

Detailed Description

Trie implementation for small-case English alphabets a-z

Member Function Documentation

- -

◆ char_to_int()

+ +

◆ char_to_int()

@@ -162,7 +162,7 @@ static constexpr uint8_t  - + @@ -188,7 +188,7 @@ static constexpr uint8_t 
uint8_t data_structure::trie::char_to_int uint8_t data_structures::trie::char_to_int ( const char &  ch) 39  if (ch >= 'A' && ch <= 'Z') {
40  return ch - 'A';
41  } else if (ch >= 'a' && ch <= 'z') {
-
42  return ch - 'a' + NUM_CHARS;
+
42  return ch - 'a' + NUM_CHARS;
43  }
44 
45  std::cerr << "Invalid character present. Exiting...";
@@ -198,14 +198,14 @@ static constexpr uint8_t 
Here is the call graph for this function:
-
+
- -

◆ deleteString()

+ +

◆ deleteString()

@@ -214,7 +214,7 @@ Here is the call graph for this function:
 - + @@ -237,8 +237,8 @@ Here is the call graph for this function:
bool data_structure::trie::deleteString bool data_structures::trie::deleteString ( const std::string &  str,
-

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

Note
the function data_structure::trie::deleteString might be erroneous
-
Todo:
review the function data_structure::trie::deleteString and the commented lines
+

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

Note
the function ::data_structure::trie::deleteString might be erroneous
+
Todo:
review the function ::data_structure::trie::deleteString and the commented lines
Parameters
@@ -251,29 +251,29 @@ Here is the call graph for this function:false if unsuccessful
134  {
135  if (index == str.length()) {
-
136  if (!isEndofWord) {
+
136  if (!isEndofWord) {
137  return false;
138  }
-
139  isEndofWord = false;
+
139  isEndofWord = false;
140  // following lines - possible source of error?
141  // for (int i = 0; i < NUM_CHARS; i++)
142  // if (!arr[i])
143  // return false;
144  return true;
145  }
-
146  int j = char_to_int(str[index]);
-
147  if (!arr[j]) {
+
146  int j = char_to_int(str[index]);
+
147  if (!arr[j]) {
148  return false;
149  }
-
150  bool var = deleteString(str, index + 1);
+
150  bool var = deleteString(str, index + 1);
151  if (var) {
-
152  arr[j].reset();
-
153  if (isEndofWord) {
+
152  arr[j].reset();
+
153  if (isEndofWord) {
154  return false;
155  } else {
156  int i = 0;
-
157  for (i = 0; i < NUM_CHARS; i++) {
-
158  if (arr[i]) {
+
157  for (i = 0; i < NUM_CHARS; i++) {
+
158  if (arr[i]) {
159  return false;
160  }
161  }
@@ -289,14 +289,14 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
- -

◆ insert()

+ +

◆ insert()

@@ -305,7 +305,7 @@ Here is the call graph for this function:
strstring to remove
- + @@ -328,20 +328,20 @@ Here is the call graph for this function:
78  std::shared_ptr<trie> root(nullptr);
79 
80  for (const char& ch : str) {
-
81  int j = char_to_int(ch);
+
81  int j = char_to_int(ch);
82  if (root) {
83  if (root->arr[j]) {
84  root = root->arr[j];
85  } else {
-
86  std::shared_ptr<trie> temp(new trie());
+
86  std::shared_ptr<trie> temp(new trie());
87  root->arr[j] = temp;
88  root = temp;
89  }
-
90  } else if (arr[j]) {
-
91  root = arr[j];
+
90  } else if (arr[j]) {
+
91  root = arr[j];
92  } else {
-
93  std::shared_ptr<trie> temp(new trie());
-
94  arr[j] = temp;
+
93  std::shared_ptr<trie> temp(new trie());
+
94  arr[j] = temp;
95  root = temp;
96  }
97  }
@@ -350,8 +350,8 @@ Here is the call graph for this function: - -

◆ search() [1/2]

+ +

◆ search() [1/2]

@@ -360,9 +360,9 @@ Here is the call graph for this function:
void data_structure::trie::insert void data_structures::trie::insert ( const std::string &  str) - + - + @@ -396,7 +396,7 @@ Here is the call graph for this function:
bool data_structure::trie::search bool data_structures::trie::search (const std::shared_ptr< trie > & const std::shared_ptr< trie > &  root,
-
Returns
tre if found
+
Returns
true if found
false if not found
57  {
@@ -406,17 +406,17 @@ Here is the call graph for this function:
61  }
62  return true;
63  }
-
64  int j = char_to_int(str[index]);
+
64  int j = char_to_int(str[index]);
65  if (!root->arr[j]) {
66  return false;
67  }
-
68  return search(root->arr[j], str, index + 1);
+
68  return search(root->arr[j], str, index + 1);
69  }
- -

◆ search() [2/2]

+ +

◆ search() [2/2]

@@ -425,7 +425,7 @@ Here is the call graph for this function:
 - + @@ -460,21 +460,21 @@ Here is the call graph for this function:false if not found
107  {
108  if (index == str.length()) {
-
109  if (!isEndofWord) {
+
109  if (!isEndofWord) {
110  return false;
111  }
112  return true;
113  }
-
114  int j = char_to_int(str[index]);
-
115  if (!arr[j]) {
+
114  int j = char_to_int(str[index]);
+
115  if (!arr[j]) {
116  return false;
117  }
-
118  return search(arr[j], str, index + 1);
+
118  return search(arr[j], str, index + 1);
119  }
Here is the call graph for this function:
-
+
@@ -486,20 +486,20 @@ Here is the call graph for this function:
std::shared_ptr
STL class.
+
data_structures::trie::trie
trie()=default
Class default constructor.
std::string::length
T length(T... args)
-
data_structure::trie::isEndofWord
bool isEndofWord
identifier if a node is terminal node
Definition: trie_tree.cpp:30
-
data_structure::trie::trie
trie()=default
Class default constructor.
+
data_structures::trie::isEndofWord
bool isEndofWord
identifier if a node is terminal node
Definition: trie_tree.cpp:30
-
data_structure::trie::NUM_CHARS
static constexpr uint8_t NUM_CHARS
Number of alphabets.
Definition: trie_tree.cpp:27
-
data_structure::trie::deleteString
bool deleteString(const std::string &str, int index)
Definition: trie_tree.cpp:134
-
data_structure::trie::arr
std::array< std::shared_ptr< trie >, NUM_CHARS<< 1 > arr
Recursive tree nodes as an array of shared-pointers.
Definition: trie_tree.cpp:29
-
data_structure::trie::char_to_int
uint8_t char_to_int(const char &ch) const
Convert a character to integer for indexing.
Definition: trie_tree.cpp:38
-
data_structure::trie::search
bool search(const std::shared_ptr< trie > &root, const std::string &str, int index)
Definition: trie_tree.cpp:56
+
data_structures::trie::NUM_CHARS
static constexpr uint8_t NUM_CHARS
Number of alphabets.
Definition: trie_tree.cpp:27
+
data_structures::trie::char_to_int
uint8_t char_to_int(const char &ch) const
Convert a character to integer for indexing.
Definition: trie_tree.cpp:38
+
data_structures::trie::deleteString
bool deleteString(const std::string &str, int index)
Definition: trie_tree.cpp:134
+
data_structures::trie::arr
std::array< std::shared_ptr< trie >, NUM_CHARS<< 1 > arr
Recursive tree nodes as an array of shared-pointers.
Definition: trie_tree.cpp:29
+
data_structures::trie::search
bool search(const std::shared_ptr< trie > &root, const std::string &str, int index)
Definition: trie_tree.cpp:56
std::exit
T exit(T... args)
diff --git a/d0/d3e/classdata__structures_1_1trie.js b/d0/d3e/classdata__structures_1_1trie.js new file mode 100644 index 000000000..98a013827 --- /dev/null +++ b/d0/d3e/classdata__structures_1_1trie.js @@ -0,0 +1,12 @@ +var classdata__structures_1_1trie = +[ + [ "trie", "d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8", null ], + [ "char_to_int", "d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988", null ], + [ "deleteString", "d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab", null ], + [ "insert", "d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546", null ], + [ "search", "d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63", null ], + [ "search", "d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d", null ], + [ "arr", "d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b", null ], + [ "isEndofWord", "d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6", null ], + [ "NUM_CHARS", "d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191", null ] +]; \ No newline at end of file diff --git a/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.map b/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.map new file mode 100644 index 000000000..d7c252e14 --- /dev/null +++ b/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.md5 b/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.md5 new file mode 100644 index 000000000..2393e9285 --- /dev/null +++ b/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.md5 @@ -0,0 +1 @@ +c3907ea850c83be9392ebdd9bbe1a748 \ No newline at end of file diff --git a/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.svg b/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.svg new file mode 100644 index 000000000..5154d84ab --- /dev/null +++ b/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.svg @@ -0,0 +1,85 @@ + + + + + + +data_structures::trie::search + + + +Node1 + + +data_structures::trie +::search + + + + + +Node2 + + +data_structures::trie +::char_to_int + + + + + +Node1->Node2 + + + + + +Node4 + + +std::string::length + + + + + +Node1->Node4 + + + + + +Node5 + + +data_structures::trie +::search + + + + + +Node1->Node5 + + + + + +Node3 + + +std::exit + + + + + +Node2->Node3 + + + + + diff --git a/d0/d6e/classdata__structure_1_1trie_aeb479dcc88415154fb61c2fbb589d6d0_cgraph.map b/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.map similarity index 50% rename from d0/d6e/classdata__structure_1_1trie_aeb479dcc88415154fb61c2fbb589d6d0_cgraph.map rename to d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.map index 29ac68ed6..35309e68d 100644 --- a/d0/d6e/classdata__structure_1_1trie_aeb479dcc88415154fb61c2fbb589d6d0_cgraph.map +++ b/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.map @@ -1,4 +1,4 @@ - - - + + + diff --git a/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.md5 b/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.md5 new file mode 100644 index 000000000..31505941a --- /dev/null +++ b/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.md5 @@ -0,0 +1 @@ +aa1699468622a9d6f1b63f2ae18e589e \ No newline at end of file diff --git a/d0/d6e/classdata__structure_1_1trie_aeb479dcc88415154fb61c2fbb589d6d0_cgraph.svg b/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.svg similarity index 57% rename from d0/d6e/classdata__structure_1_1trie_aeb479dcc88415154fb61c2fbb589d6d0_cgraph.svg rename to d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.svg index a547e1e3a..a518e1104 100644 --- a/d0/d6e/classdata__structure_1_1trie_aeb479dcc88415154fb61c2fbb589d6d0_cgraph.svg +++ b/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.svg @@ -3,19 +3,19 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - - + + -data_structure::trie::char_to_int - +data_structures::trie::char_to_int + Node1 - -data_structure::trie -::char_to_int + +data_structures::trie +::char_to_int @@ -23,16 +23,16 @@ Node2 - -std::exit + +std::exit Node1->Node2 - - + + diff --git a/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.map b/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.map new file mode 100644 index 000000000..d22453d41 --- /dev/null +++ b/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.md5 b/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.md5 new file mode 100644 index 000000000..cbad8faa3 --- /dev/null +++ b/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.md5 @@ -0,0 +1 @@ +58d4feca0fdac37785db0336ce32a8e4 \ No newline at end of file diff --git a/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.svg b/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.svg new file mode 100644 index 000000000..e72d3c864 --- /dev/null +++ b/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.svg @@ -0,0 +1,69 @@ + + + + + + +data_structures::trie::deleteString + + + +Node1 + + +data_structures::trie +::deleteString + + + + + +Node2 + + +data_structures::trie +::char_to_int + + + + + +Node1->Node2 + + + + + +Node4 + + +std::string::length + + + + + +Node1->Node4 + + + + + +Node3 + + +std::exit + + + + + +Node2->Node3 + + + + + diff --git a/d0/d5a/skip__list_8cpp.html b/d0/d5a/skip__list_8cpp.html index 2e8923cbe..bea245c4a 100644 --- a/d0/d5a/skip__list_8cpp.html +++ b/d0/d5a/skip__list_8cpp.html @@ -117,15 +117,15 @@ Include dependency graph for skip_list.cpp:
bool data_structure::trie::search bool data_structures::trie::search ( const std::string &  str,
- + - +

Classes

struct  data_structure::Node
struct  data_structures::Node
 
class  data_structure::SkipList
class  data_structures::SkipList
 
- - + +

Namespaces

 data_structure
 Data-structure algorithms.
 data_structures
 Data-structure algorithms.
 

@@ -135,14 +135,14 @@ Functions

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

Variables

-constexpr int data_structure::MAX_LEVEL = 2
 Maximum level of skip list.
 
-constexpr float data_structure::PROBABILITY = 0.5
 Current probability for "coin toss".
 
+constexpr int data_structures::MAX_LEVEL = 2
 Maximum level of skip list.
 
+constexpr float data_structures::PROBABILITY = 0.5
 Current probability for "coin toss".
 

Detailed Description

Data structure for fast searching and insertion in \(O(\log n)\) time.

@@ -170,21 +170,21 @@ constexpr float 
208  {
209  std::srand(std::time(nullptr));
210 
-
211  data_structure::SkipList lst;
+
211  data_structures::SkipList lst;
212 
-
213  for (int j = 0; j < (1 << (data_structure::MAX_LEVEL + 1)); j++) {
-
214  int k = (std::rand() % (1 << (data_structure::MAX_LEVEL + 2)) + 1);
-
215  lst.insertElement(k, &j);
+
213  for (int j = 0; j < (1 << (data_structures::MAX_LEVEL + 1)); j++) {
+
214  int k = (std::rand() % (1 << (data_structures::MAX_LEVEL + 2)) + 1);
+
215  lst.insertElement(k, &j);
216  }
217 
-
218  lst.displayList();
-
219 
+
218  lst.displayList();
+
219 
220  return 0;
221 }
Here is the call graph for this function:
-
+
@@ -193,12 +193,12 @@ Here is the call graph for this function:
std::srand
T srand(T... args)
-
data_structure::SkipList::insertElement
void insertElement(int key, void *value)
Definition: skip_list.cpp:89
-
data_structure::SkipList::displayList
void displayList()
Definition: skip_list.cpp:187
-
data_structure::SkipList
Definition: skip_list.cpp:55
+
data_structures::SkipList::displayList
void displayList()
Definition: skip_list.cpp:187
+
data_structures::MAX_LEVEL
constexpr int MAX_LEVEL
Maximum level of skip list.
Definition: skip_list.cpp:27
+
data_structures::SkipList
Definition: skip_list.cpp:55
std::rand
T rand(T... args)
-
data_structure::MAX_LEVEL
constexpr int MAX_LEVEL
Maximum level of skip list.
Definition: skip_list.cpp:27
std::time
T time(T... args)
+
data_structures::SkipList::insertElement
void insertElement(int key, void *value)
Definition: skip_list.cpp:89
@@ -91,21 +91,21 @@ $(document).ready(function(){initNavTree('d0/d6e/classdata__structure_1_1trie.ht
-
data_structure::trie Member List
+
data_structures::trie Member List
-

This is the complete list of members for data_structure::trie, including all inherited members.

+

This is the complete list of members for data_structures::trie, including all inherited members.

- - - - - - - - - + + + + + + + + +
arrdata_structure::trieprivate
char_to_int(const char &ch) constdata_structure::trieinlineprivate
deleteString(const std::string &str, int index)data_structure::trieinline
insert(const std::string &str)data_structure::trieinline
isEndofWorddata_structure::trieprivate
NUM_CHARSdata_structure::trieprivatestatic
search(const std::shared_ptr< trie > &root, const std::string &str, int index)data_structure::trieinlineprivate
search(const std::string &str, int index)data_structure::trieinline
trie()=defaultdata_structure::trie
arrdata_structures::trieprivate
char_to_int(const char &ch) constdata_structures::trieinlineprivate
deleteString(const std::string &str, int index)data_structures::trieinline
insert(const std::string &str)data_structures::trieinline
isEndofWorddata_structures::trieprivate
NUM_CHARSdata_structures::trieprivatestatic
search(const std::shared_ptr< trie > &root, const std::string &str, int index)data_structures::trieinlineprivate
search(const std::string &str, int index)data_structures::trieinline
trie()=defaultdata_structures::trie
diff --git a/d1/db4/namespacedata__structure.js b/d1/db4/namespacedata__structure.js deleted file mode 100644 index e4cff6e5a..000000000 --- a/d1/db4/namespacedata__structure.js +++ /dev/null @@ -1,6 +0,0 @@ -var namespacedata__structure = -[ - [ "Node", "d3/d6f/structdata__structure_1_1_node.html", "d3/d6f/structdata__structure_1_1_node" ], - [ "SkipList", "d1/d46/classdata__structure_1_1_skip_list.html", "d1/d46/classdata__structure_1_1_skip_list" ], - [ "trie", "d0/d6e/classdata__structure_1_1trie.html", "d0/d6e/classdata__structure_1_1trie" ] -]; \ No newline at end of file diff --git a/d7/d99/classdata__structure_1_1trie__coll__graph.map b/d2/d84/classdata__structures_1_1trie__coll__graph.map similarity index 68% rename from d7/d99/classdata__structure_1_1trie__coll__graph.map rename to d2/d84/classdata__structures_1_1trie__coll__graph.map index f5a6ad087..cc7f397f7 100644 --- a/d7/d99/classdata__structure_1_1trie__coll__graph.map +++ b/d2/d84/classdata__structures_1_1trie__coll__graph.map @@ -1,5 +1,5 @@ - - + + - + diff --git a/d2/d84/classdata__structures_1_1trie__coll__graph.md5 b/d2/d84/classdata__structures_1_1trie__coll__graph.md5 new file mode 100644 index 000000000..290d872a4 --- /dev/null +++ b/d2/d84/classdata__structures_1_1trie__coll__graph.md5 @@ -0,0 +1 @@ +b5b59746154af1ad1fc8e5780f67df66 \ No newline at end of file diff --git a/d7/d99/classdata__structure_1_1trie__coll__graph.svg b/d2/d84/classdata__structures_1_1trie__coll__graph.svg similarity index 76% rename from d7/d99/classdata__structure_1_1trie__coll__graph.svg rename to d2/d84/classdata__structures_1_1trie__coll__graph.svg index 8af1b2396..31ae2c8be 100644 --- a/d7/d99/classdata__structure_1_1trie__coll__graph.svg +++ b/d2/d84/classdata__structures_1_1trie__coll__graph.svg @@ -3,18 +3,18 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - - + + -data_structure::trie - +data_structures::trie + Node1 - -data_structure::trie + +data_structures::trie @@ -24,7 +24,7 @@ std::shared_ptr< data -_structure::trie > +_structures::trie > @@ -39,10 +39,10 @@ Node2 - -std::shared_ptr< data -_structure::trie >, NUM -_CHARS<< 1 > + +std::shared_ptr< data +_structures::trie >, + NUM_CHARS<< 1 > diff --git a/d3/d6f/structdata__structure_1_1_node.js b/d3/d6f/structdata__structure_1_1_node.js deleted file mode 100644 index 74b7ee8e7..000000000 --- a/d3/d6f/structdata__structure_1_1_node.js +++ /dev/null @@ -1,7 +0,0 @@ -var structdata__structure_1_1_node = -[ - [ "Node", "d3/d6f/structdata__structure_1_1_node.html#af7f19e61975f1362b22d1488bee87077", null ], - [ "forward", "d3/d6f/structdata__structure_1_1_node.html#a0e80ff706591f718f763c5a7feaa2394", null ], - [ "key", "d3/d6f/structdata__structure_1_1_node.html#a089ebc844c81777652d4e577be0739c8", null ], - [ "value", "d3/d6f/structdata__structure_1_1_node.html#a24580ec4e79f7bb82e55a9c4d8369a6e", null ] -]; \ No newline at end of file diff --git a/d3/d6f/structdata__structure_1_1_node_af7f19e61975f1362b22d1488bee87077_cgraph.map b/d3/d6f/structdata__structure_1_1_node_af7f19e61975f1362b22d1488bee87077_cgraph.map deleted file mode 100644 index f041c97ca..000000000 --- a/d3/d6f/structdata__structure_1_1_node_af7f19e61975f1362b22d1488bee87077_cgraph.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/d3/d6f/structdata__structure_1_1_node_af7f19e61975f1362b22d1488bee87077_cgraph.md5 b/d3/d6f/structdata__structure_1_1_node_af7f19e61975f1362b22d1488bee87077_cgraph.md5 deleted file mode 100644 index 28876b6e8..000000000 --- a/d3/d6f/structdata__structure_1_1_node_af7f19e61975f1362b22d1488bee87077_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -972af60cf6a7627e3c8c8de3ee19f0d5 \ No newline at end of file diff --git a/d1/d46/classdata__structure_1_1_skip_list.html b/d4/d90/classdata__structures_1_1_skip_list.html similarity index 71% rename from d1/d46/classdata__structure_1_1_skip_list.html rename to d4/d90/classdata__structures_1_1_skip_list.html index 6ba13a125..491bcd4a8 100644 --- a/d1/d46/classdata__structure_1_1_skip_list.html +++ b/d4/d90/classdata__structures_1_1_skip_list.html @@ -5,7 +5,7 @@ -Algorithms_in_C++: data_structure::SkipList Class Reference +Algorithms_in_C++: data_structures::SkipList Class Reference @@ -71,7 +71,7 @@ $(function() {
@@ -93,49 +93,49 @@ $(document).ready(function(){initNavTree('d1/d46/classdata__structure_1_1_skip_l
Public Member Functions | Private Attributes | -List of all members
+List of all members
-
data_structure::SkipList Class Reference
+
data_structures::SkipList Class Reference
-Collaboration diagram for data_structure::SkipList:
+Collaboration diagram for data_structures::SkipList:
-
+
[legend]
- - - - - - - - - - - - + + + + + + + + + + + +

Public Member Functions

 SkipList ()
 
int randomLevel ()
 
void insertElement (int key, void *value)
 
void deleteElement (int key)
 
void * searchElement (int key)
 
void displayList ()
 
 SkipList ()
 
int randomLevel ()
 
void insertElement (int key, void *value)
 
void deleteElement (int key)
 
void * searchElement (int key)
 
void displayList ()
 
- - - - - - + + + + + +

Private Attributes

-int level
 Maximum level of the skiplist.
 
-std::shared_ptr< Node > header
 Pointer to the header node.
 
+int level
 Maximum level of the skiplist.
 
+std::shared_ptr< Node > header
 Pointer to the header node.
 

Detailed Description

-

SkipList class implementation with basic methods

+

SkipList class implementation with basic methods

Constructor & Destructor Documentation

- -

◆ SkipList()

+ +

◆ SkipList()

@@ -144,7 +144,7 @@ int 
 - + @@ -156,18 +156,18 @@ int 
data_structure::SkipList::SkipList data_structures::SkipList::SkipList ( ) -

Skip List constructor. Initializes header, start Node for searching in the list

+

Skip List constructor. Initializes header, start Node for searching in the list

64  {
-
65  level = 0;
+
65  level = 0;
66  // Header initialization
-
67  header = std::shared_ptr<Node>(new Node(-1, MAX_LEVEL));
+
67  header = std::shared_ptr<Node>(new Node(-1, MAX_LEVEL));
68  }

Member Function Documentation

- -

◆ deleteElement()

+ +

◆ deleteElement()

@@ -176,7 +176,7 @@ int 
 - + @@ -196,12 +196,12 @@ int 
void data_structure::SkipList::deleteElement void data_structures::SkipList::deleteElement ( int  key)
131  {
-
132  std::shared_ptr<Node> x = header;
+
132  std::shared_ptr<Node> x = header;
133 
-
134  std::array<std::shared_ptr<Node>, MAX_LEVEL + 1> update;
+
134  std::array<std::shared_ptr<Node>, MAX_LEVEL + 1> update;
135  update.fill(nullptr);
136 
-
137  for (int i = level; i >= 0; i--) {
+
137  for (int i = level; i >= 0; i--) {
138  while (x->forward[i] != nullptr && x->forward[i]->key < key)
139  x = x->forward[i];
140  update[i] = x;
@@ -212,13 +212,13 @@ int 		 145  bool doesnt_exist = (x == nullptr || x->key != key);
146 
147  if (!doesnt_exist) {
-
148  for (int i = 0; i <= level; i++) {
+
148  for (int i = 0; i <= level; i++) {
149  if (update[i]->forward[i] != x)
150  break;
151  update[i]->forward[i] = x->forward[i];
152  }
153  /* Remove empty levels*/
-
154  while (level > 0 && header->forward[level] == nullptr) level--;
+
154  while (level > 0 && header->forward[level] == nullptr) level--;
155  std::cout << "Deleted" << std::endl;
156  } else {
157  std::cout << "Doesn't exist" << std::endl;
@@ -227,14 +227,14 @@ int 		 Here is the call graph for this function:
-
+
- -

◆ displayList()

+ +

◆ displayList()

@@ -243,7 +243,7 @@ Here is the call graph for this function:
 - + @@ -258,8 +258,8 @@ Here is the call graph for this function:

Display skip list level

187  {
188  std::cout << "Displaying list:\n";
-
189  for (int i = 0; i <= level; i++) {
-
190  std::shared_ptr<Node> node = header->forward[i];
+
189  for (int i = 0; i <= level; i++) {
+
190  std::shared_ptr<Node> node = header->forward[i];
191  std::cout << "Level " << (i) << ": ";
192  while (node != nullptr) {
193  std::cout << node->key << " ";
@@ -271,14 +271,14 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
- -

◆ insertElement()

+ +

◆ insertElement()

@@ -287,7 +287,7 @@ Here is the call graph for this function:
void data_structure::SkipList::displayList void data_structures::SkipList::displayList ( ) - + @@ -310,7 +310,7 @@ Here is the call graph for this function:
void data_structure::SkipList::insertElement void data_structures::SkipList::insertElement ( int  key,
-

Inserts elements with given key and value; It's level is computed by randomLevel() function.

Parameters
+

Inserts elements with given key and value; It's level is computed by randomLevel() function.

Parameters
@@ -319,11 +319,11 @@ Here is the call graph for this function:
89  {
90  std::cout << "Inserting" << key << "...";
-
91  std::shared_ptr<Node> x = header;
-
92  std::array<std::shared_ptr<Node>, MAX_LEVEL + 1> update;
+
91  std::shared_ptr<Node> x = header;
+
92  std::array<std::shared_ptr<Node>, MAX_LEVEL + 1> update;
93  update.fill(nullptr);
94 
-
95  for (int i = level; i >= 0; i--) {
+
95  for (int i = level; i >= 0; i--) {
96  while (x->forward[i] != nullptr && x->forward[i]->key < key)
97  x = x->forward[i];
98  update[i] = x;
@@ -333,13 +333,13 @@ Here is the call graph for this function:
102 
103  bool doesnt_exist = (x == nullptr || x->key != key);
104  if (doesnt_exist) {
-
105  int rlevel = randomLevel();
+
105  int rlevel = randomLevel();
106 
-
107  if (rlevel > level) {
-
108  for (int i = level + 1; i < rlevel + 1; i++) update[i] = header;
+
107  if (rlevel > level) {
+
108  for (int i = level + 1; i < rlevel + 1; i++) update[i] = header;
109 
110  // Update current level
-
111  level = rlevel;
+
111  level = rlevel;
112  }
113 
114  std::shared_ptr<Node> n =
@@ -357,14 +357,14 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
- -

◆ randomLevel()

+ +

◆ randomLevel()

@@ -373,7 +373,7 @@ Here is the call graph for this function:
keyis number that is used for comparision
valuepointer to a value, that can be any type
- + @@ -388,22 +388,22 @@ Here is the call graph for this function:

Returns random level of the skip list. Every higher level is 2 times less likely.

Returns
random level for skip list
75  {
76  int lvl = 0;
-
77  while (static_cast<float>(std::rand()) / RAND_MAX < PROBABILITY &&
-
78  lvl < MAX_LEVEL)
+
77  while (static_cast<float>(std::rand()) / RAND_MAX < PROBABILITY &&
+
78  lvl < MAX_LEVEL)
79  lvl++;
80  return lvl;
81  }
Here is the call graph for this function:
-
+
- -

◆ searchElement()

+ +

◆ searchElement()

@@ -412,7 +412,7 @@ Here is the call graph for this function:
- - - diff --git a/namespacemembers.html b/namespacemembers.html index 9e0d46354..d3e15a9aa 100644 --- a/namespacemembers.html +++ b/namespacemembers.html @@ -251,7 +251,7 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza

- m -

  • MAX_LEVEL -: data_structure +: data_structures
  • merge() : sorting @@ -321,7 +321,7 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza : backtracking
  • PROBABILITY -: data_structure +: data_structures
  • putProber() : double_hashing diff --git a/namespacemembers_vars.html b/namespacemembers_vars.html index db9ddcf75..961ee54fe 100644 --- a/namespacemembers_vars.html +++ b/namespacemembers_vars.html @@ -92,13 +92,13 @@ $(document).ready(function(){initNavTree('namespacemembers_vars.html',''); initR
     
- + diff --git a/namespaces_dup.js b/namespaces_dup.js index b932b6020..5a21e1fe7 100644 --- a/namespaces_dup.js +++ b/namespaces_dup.js @@ -4,7 +4,7 @@ var namespaces_dup = [ "backtracking", "db/dc0/namespacebacktracking.html", null ], [ "caesar", "dd/d81/namespacecaesar.html", null ], [ "ciphers", "d6/d4e/namespaceciphers.html", null ], - [ "data_structure", "d1/db4/namespacedata__structure.html", null ], + [ "data_structures", "d5/d3c/namespacedata__structures.html", null ], [ "double_hashing", "d0/d65/namespacedouble__hashing.html", null ], [ "dynamic_programming", "dd/d24/namespacedynamic__programming.html", null ], [ "geometry", "d5/d5f/namespacegeometry.html", null ], diff --git a/navtreedata.js b/navtreedata.js index 347a67dbe..d72f847da 100644 --- a/navtreedata.js +++ b/navtreedata.js @@ -109,9 +109,9 @@ var NAVTREE = var NAVTREEINDEX = [ "annotated.html", -"d3/d26/binary__search__tree_8cpp.html#aa65d9b7fa9bd517ace3d819abc85c8b6", -"d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859", -"d8/d8a/exponential__search_8cpp.html#a67e9c84b4e2eb30e3c5170eabfbb363d", +"d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda", +"d5/df6/check__amicable__pair_8cpp.html", +"d8/d95/vector__ops_8hpp.html#a2055c2f3a076b3d4146aade5eb35666d", "da/df2/durand__kerner__roots_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627", "dd/d91/class_fenwick_tree.html#aaddab1f03d4941212a82cc647b1adb17" ]; diff --git a/navtreeindex0.js b/navtreeindex0.js index d5ced8990..5e064c4bf 100644 --- a/navtreeindex0.js +++ b/navtreeindex0.js @@ -15,6 +15,16 @@ var NAVTREEINDEX0 = "d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[8,0,9,26,2], "d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd":[8,0,9,26,3], "d0/d2e/namespaceneural__network.html":[6,0,18], +"d0/d3e/classdata__structures_1_1trie.html":[7,0,1,2], +"d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546":[7,0,1,2,3], +"d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b":[7,0,1,2,6], +"d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d":[7,0,1,2,5], +"d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191":[7,0,1,2,8], +"d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6":[7,0,1,2,7], +"d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8":[7,0,1,2,0], +"d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63":[7,0,1,2,4], +"d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[7,0,1,2,1], +"d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[7,0,1,2,2], "d0/d58/classgraph_1_1_rooted_tree.html":[7,0,4,3], "d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3":[7,0,4,3,2], "d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43":[7,0,4,3,3], @@ -22,21 +32,11 @@ var NAVTREEINDEX0 = "d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe":[7,0,4,3,4], "d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e":[7,0,4,3,1], "d0/d5a/skip__list_8cpp.html":[8,0,2,9], -"d0/d5a/skip__list_8cpp.html#a039855c4d1684de1fec104057df9f26d":[8,0,2,9,3], -"d0/d5a/skip__list_8cpp.html#a38234f668624bca86341240f34a95193":[8,0,2,9,4], +"d0/d5a/skip__list_8cpp.html#a903639d8e6f955dd8d5c263781455d61":[8,0,2,9,4], +"d0/d5a/skip__list_8cpp.html#ac0d7e0be24da9f41bcb19745873c436a":[8,0,2,9,3], "d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,2,9,2], -"d0/d65/namespacedouble__hashing.html":[7,0,2], "d0/d65/namespacedouble__hashing.html":[6,0,5], -"d0/d6e/classdata__structure_1_1trie.html":[7,0,1,2], -"d0/d6e/classdata__structure_1_1trie.html#a0bc4f25351be960f3570e562cfb4a070":[7,0,1,2,7], -"d0/d6e/classdata__structure_1_1trie.html#a36a41761149fd541850834aef29f9b7f":[7,0,1,2,0], -"d0/d6e/classdata__structure_1_1trie.html#a3c243c5c7221799ea5edae04c9c45129":[7,0,1,2,8], -"d0/d6e/classdata__structure_1_1trie.html#a8b9a51c90291a3402904c8cd16bbe30d":[7,0,1,2,3], -"d0/d6e/classdata__structure_1_1trie.html#a98a0d54a781a680903eac14085fcbc2e":[7,0,1,2,2], -"d0/d6e/classdata__structure_1_1trie.html#aa5b8dc9452c3f7a805a4cb17034d6549":[7,0,1,2,6], -"d0/d6e/classdata__structure_1_1trie.html#adff53199439d06776ebbaf917741774f":[7,0,1,2,5], -"d0/d6e/classdata__structure_1_1trie.html#ae9c45cbd4b52db9a39d27e12ca912abc":[7,0,1,2,4], -"d0/d6e/classdata__structure_1_1trie.html#aeb479dcc88415154fb61c2fbb589d6d0":[7,0,1,2,1], +"d0/d65/namespacedouble__hashing.html":[7,0,2], "d0/da2/number__of__positive__divisors_8cpp.html":[8,0,9,21], "d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[8,0,9,21,2], "d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb":[8,0,9,21,1], @@ -73,15 +73,6 @@ var NAVTREEINDEX0 = "d1/d2a/knight__tour_8cpp.html#a531de8cb2d4d16ca63353d9c72158257":[8,0,0,1,0], "d1/d2a/knight__tour_8cpp.html#a932e38e8912742cedf7b5a837168e03a":[8,0,0,1,2], "d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,0,1,1], -"d1/d46/classdata__structure_1_1_skip_list.html":[7,0,1,1], -"d1/d46/classdata__structure_1_1_skip_list.html#a10800369c9efa08dd86de0ce552c874e":[7,0,1,1,4], -"d1/d46/classdata__structure_1_1_skip_list.html#a1574d62ca0a5a821601d246c07215335":[7,0,1,1,2], -"d1/d46/classdata__structure_1_1_skip_list.html#a1c6c04c0fb45ea2e2378de7ab9cb465b":[7,0,1,1,3], -"d1/d46/classdata__structure_1_1_skip_list.html#a4b8eb18c9ca24f53e9de91b74febd666":[7,0,1,1,1], -"d1/d46/classdata__structure_1_1_skip_list.html#a7aed753e3b47953229f5ac94f0fc9aad":[7,0,1,1,6], -"d1/d46/classdata__structure_1_1_skip_list.html#a7cda6370f8bd2b6d1db28bd5ca586a21":[7,0,1,1,5], -"d1/d46/classdata__structure_1_1_skip_list.html#ae0c022174510fd9ca1b84d8e996cd1a5":[7,0,1,1,7], -"d1/d46/classdata__structure_1_1_skip_list.html#aed414cf88cfacb9554ecfd184b03fe04":[7,0,1,1,0], "d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html":[7,0,8,0,2], "d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70":[7,0,8,0,2,9], "d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1":[7,0,8,0,2,12], @@ -110,8 +101,6 @@ var NAVTREEINDEX0 = "d1/d77/structmst.html#a59feb15588a49aac1c243bf649b97c72":[7,0,26,0], "d1/db3/structcompare.html":[7,0,12], "d1/db3/structcompare.html#a8471ed92f607eeb23021dc4afde9bae0":[7,0,12,0], -"d1/db4/namespacedata__structure.html":[6,0,4], -"d1/db4/namespacedata__structure.html":[7,0,1], "d1/dbe/lu__decomposition_8h.html":[8,0,10,7], "d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f":[8,0,10,7,1], "d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509":[8,0,10,7,2], @@ -249,5 +238,16 @@ var NAVTREEINDEX0 = "d3/d26/binary__search__tree_8cpp.html#a4392f2f3d0680befc1a6db07d94d6c5d":[8,0,2,2,11], "d3/d26/binary__search__tree_8cpp.html#a4a1aaff44d949318d93231e1fa5c7863":[8,0,2,2,5], "d3/d26/binary__search__tree_8cpp.html#a521ea77f195e491750e602292c6dc335":[8,0,2,2,7], -"d3/d26/binary__search__tree_8cpp.html#a9e98619e1c6cea9d6c56849a16ecc416":[8,0,2,2,10] +"d3/d26/binary__search__tree_8cpp.html#a9e98619e1c6cea9d6c56849a16ecc416":[8,0,2,2,10], +"d3/d26/binary__search__tree_8cpp.html#aa65d9b7fa9bd517ace3d819abc85c8b6":[8,0,2,2,2], +"d3/d26/binary__search__tree_8cpp.html#ad7a062d9cfb533d97192fd65fad1415c":[8,0,2,2,3], +"d3/d26/binary__search__tree_8cpp.html#adb338121baec7856c9593d79ddeb5e18":[8,0,2,2,6], +"d3/d26/binary__search__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,2,2,8], +"d3/d26/binary__search__tree_8cpp.html#aebb1a5194a2cd7efe7ee7fc417e78293":[8,0,2,2,12], +"d3/d40/graph__coloring_8cpp.html":[8,0,0,0], +"d3/d40/graph__coloring_8cpp.html#a29360ddb1bad75caa61ec895b6e71986":[8,0,0,0,0], +"d3/d40/graph__coloring_8cpp.html#a5a6c3c2b065ea1c07adf2f638f8efc43":[8,0,0,0,1], +"d3/d40/graph__coloring_8cpp.html#a8cfb2d08840766ac4402196079308a36":[8,0,0,0,3], +"d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,0,0,2], +"d3/d4c/quick__sort__3_8cpp.html":[8,0,15,10] }; diff --git a/navtreeindex1.js b/navtreeindex1.js index 89213e74a..7d5782f32 100644 --- a/navtreeindex1.js +++ b/navtreeindex1.js @@ -1,16 +1,5 @@ var NAVTREEINDEX1 = { -"d3/d26/binary__search__tree_8cpp.html#aa65d9b7fa9bd517ace3d819abc85c8b6":[8,0,2,2,2], -"d3/d26/binary__search__tree_8cpp.html#ad7a062d9cfb533d97192fd65fad1415c":[8,0,2,2,3], -"d3/d26/binary__search__tree_8cpp.html#adb338121baec7856c9593d79ddeb5e18":[8,0,2,2,6], -"d3/d26/binary__search__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,2,2,8], -"d3/d26/binary__search__tree_8cpp.html#aebb1a5194a2cd7efe7ee7fc417e78293":[8,0,2,2,12], -"d3/d40/graph__coloring_8cpp.html":[8,0,0,0], -"d3/d40/graph__coloring_8cpp.html#a29360ddb1bad75caa61ec895b6e71986":[8,0,0,0,0], -"d3/d40/graph__coloring_8cpp.html#a5a6c3c2b065ea1c07adf2f638f8efc43":[8,0,0,0,1], -"d3/d40/graph__coloring_8cpp.html#a8cfb2d08840766ac4402196079308a36":[8,0,0,0,3], -"d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,0,0,2], -"d3/d4c/quick__sort__3_8cpp.html":[8,0,15,10], "d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda":[8,0,15,10,4], "d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792":[8,0,15,10,3], "d3/d4c/quick__sort__3_8cpp.html#a9d4eb6ea3c35540d804d451f1716622d":[8,0,15,10,2], @@ -23,11 +12,6 @@ var NAVTREEINDEX1 = "d3/d4c/xor__cipher_8cpp.html#aeff72a463ffc580c16cc849cbbdc58ef":[8,0,1,3,1], "d3/d61/vector__important__functions_8cpp.html":[8,0,11,16], "d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,11,16,0], -"d3/d6f/structdata__structure_1_1_node.html":[7,0,1,0], -"d3/d6f/structdata__structure_1_1_node.html#a089ebc844c81777652d4e577be0739c8":[7,0,1,0,2], -"d3/d6f/structdata__structure_1_1_node.html#a0e80ff706591f718f763c5a7feaa2394":[7,0,1,0,1], -"d3/d6f/structdata__structure_1_1_node.html#a24580ec4e79f7bb82e55a9c4d8369a6e":[7,0,1,0,3], -"d3/d6f/structdata__structure_1_1_node.html#af7f19e61975f1362b22d1488bee87077":[7,0,1,0,0], "d3/d7d/brute__force__string__searching_8cpp.html":[8,0,16,0], "d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123":[8,0,16,0,2], "d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,16,0,1], @@ -105,6 +89,15 @@ var NAVTREEINDEX1 = "d4/d8d/jarvis__algorithm_8cpp.html":[8,0,4,0], "d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[8,0,4,0,3], "d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,4,0,2], +"d4/d90/classdata__structures_1_1_skip_list.html":[7,0,1,1], +"d4/d90/classdata__structures_1_1_skip_list.html#a2249e3ab2f8a0f2334b90635202de4f2":[7,0,1,1,5], +"d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650":[7,0,1,1,7], +"d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9":[7,0,1,1,3], +"d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4":[7,0,1,1,0], +"d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c":[7,0,1,1,2], +"d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0":[7,0,1,1,1], +"d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4":[7,0,1,1,4], +"d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16":[7,0,1,1,6], "d4/d9c/primes__up__to__billion_8cpp.html":[8,0,9,25], "d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c":[8,0,9,25,1], "d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95":[8,0,9,25,2], @@ -178,6 +171,8 @@ var NAVTREEINDEX1 = "d5/d29/struct_min_heap_node.html#ad06549be842d9a2cacdb3e55b019e68c":[7,0,25,3], "d5/d2c/namespacelayers.html":[6,0,12], "d5/d39/namespaceactivations.html":[6,0,0], +"d5/d3c/namespacedata__structures.html":[6,0,4], +"d5/d3c/namespacedata__structures.html":[7,0,1], "d5/d4c/group__sorting.html":[5,3], "d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07":[5,3,5], "d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07":[8,0,15,6,3], @@ -249,5 +244,10 @@ var NAVTREEINDEX1 = "d5/ddb/bogo__sort_8cpp.html":[8,0,15,0], "d5/ddb/bogo__sort_8cpp.html#a4c5bd73ffb6082f63dc57d8dcc76794f":[8,0,15,0,1], "d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[8,0,15,0,4], -"d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,15,0,0] +"d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,15,0,0], +"d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859":[8,0,15,0,2], +"d5/ddb/bogo__sort_8cpp.html#aedfb88e2d6fff1871f038221fe5870fe":[8,0,15,0,3], +"d5/def/stairs__pattern_8cpp.html":[8,0,11,14], +"d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,11,14,0], +"d5/df4/merge__sort_8cpp.html":[8,0,15,6] }; diff --git a/navtreeindex2.js b/navtreeindex2.js index 0f5e7f675..b484a4722 100644 --- a/navtreeindex2.js +++ b/navtreeindex2.js @@ -1,10 +1,5 @@ var NAVTREEINDEX2 = { -"d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859":[8,0,15,0,2], -"d5/ddb/bogo__sort_8cpp.html#aedfb88e2d6fff1871f038221fe5870fe":[8,0,15,0,3], -"d5/def/stairs__pattern_8cpp.html":[8,0,11,14], -"d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,11,14,0], -"d5/df4/merge__sort_8cpp.html":[8,0,15,6], "d5/df6/check__amicable__pair_8cpp.html":[8,0,9,2], "d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576":[8,0,9,2,2], "d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[8,0,9,2,3], @@ -246,8 +241,13 @@ var NAVTREEINDEX2 = "d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,4,1,2], "d8/d77/namespacemachine__learning.html":[6,0,14], "d8/d77/namespacemachine__learning.html":[7,0,6], -"d8/d89/namespacelinear__probing.html":[7,0,5], "d8/d89/namespacelinear__probing.html":[6,0,13], +"d8/d89/namespacelinear__probing.html":[7,0,5], "d8/d8a/exponential__search_8cpp.html":[8,0,14,1], -"d8/d8a/exponential__search_8cpp.html#a0f697e2a3b5193324ab84bd4045088f7":[8,0,14,1,0] +"d8/d8a/exponential__search_8cpp.html#a0f697e2a3b5193324ab84bd4045088f7":[8,0,14,1,0], +"d8/d8a/exponential__search_8cpp.html#a67e9c84b4e2eb30e3c5170eabfbb363d":[8,0,14,1,2], +"d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,14,1,1], +"d8/d95/vector__ops_8hpp.html":[8,0,8,5], +"d8/d95/vector__ops_8hpp.html#a05b9445c6ab65053b9bf9897a96af82d":[8,0,8,5,6], +"d8/d95/vector__ops_8hpp.html#a1b42d24ad7bedbfa8e5b59fe96987a44":[8,0,8,5,1] }; diff --git a/navtreeindex3.js b/navtreeindex3.js index eef00b150..bed51a4f4 100644 --- a/navtreeindex3.js +++ b/navtreeindex3.js @@ -1,10 +1,5 @@ var NAVTREEINDEX3 = { -"d8/d8a/exponential__search_8cpp.html#a67e9c84b4e2eb30e3c5170eabfbb363d":[8,0,14,1,2], -"d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,14,1,1], -"d8/d95/vector__ops_8hpp.html":[8,0,8,5], -"d8/d95/vector__ops_8hpp.html#a05b9445c6ab65053b9bf9897a96af82d":[8,0,8,5,6], -"d8/d95/vector__ops_8hpp.html#a1b42d24ad7bedbfa8e5b59fe96987a44":[8,0,8,5,1], "d8/d95/vector__ops_8hpp.html#a2055c2f3a076b3d4146aade5eb35666d":[8,0,8,5,11], "d8/d95/vector__ops_8hpp.html#a2a282c162e12f193c58232f26f0fa62d":[8,0,8,5,12], "d8/d95/vector__ops_8hpp.html#a4d136cbf20e3126ed9b934ab2d03f18b":[8,0,8,5,21], @@ -101,6 +96,11 @@ var NAVTREEINDEX3 = "d9/d49/kohonen__som__trace_8cpp.html#a9ab8c79ffb674a63f151f282faeb723b":[8,0,8,2,9], "d9/d49/kohonen__som__trace_8cpp.html#ab47fb569e63648bd76e7edfdacc02dbd":[8,0,8,2,10], "d9/d49/kohonen__som__trace_8cpp.html#acc6a28f40512dbda75ab1a3969248898":[8,0,8,2,3], +"d9/d49/structdata__structures_1_1_node.html":[7,0,1,0], +"d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78":[7,0,1,0,0], +"d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731":[7,0,1,0,3], +"d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68":[7,0,1,0,2], +"d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e":[7,0,1,0,1], "d9/d5a/structgeometry_1_1jarvis_1_1_point.html":[7,0,3,0,1], "d9/d5a/structgeometry_1_1jarvis_1_1_point.html#a6c52f5bd4f7360d2d1db0bf6537a10e0":[7,0,3,0,1,1], "d9/d5a/structgeometry_1_1jarvis_1_1_point.html#af14ad1652ac763c92e5c79a86796d044":[7,0,3,0,1,0], diff --git a/navtreeindex4.js b/navtreeindex4.js index e292a22e7..6ee06dac3 100644 --- a/navtreeindex4.js +++ b/navtreeindex4.js @@ -240,8 +240,8 @@ var NAVTREEINDEX4 = "dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[8,0,10,6,2], "dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[8,0,10,6,0], "dd/d65/lu__decompose_8cpp.html#a9459fcd1f020373d73eae2bad43786d0":[8,0,10,6,1], -"dd/d69/namespacerange__queries.html":[6,0,21], "dd/d69/namespacerange__queries.html":[7,0,8], +"dd/d69/namespacerange__queries.html":[6,0,21], "dd/d81/namespacecaesar.html":[6,0,2], "dd/d91/class_fenwick_tree.html":[7,0,17], "dd/d91/class_fenwick_tree.html#a115ff5c548b429b737ea09f75817d1f9":[7,0,17,4], diff --git a/navtreeindex5.js b/navtreeindex5.js index b9041c400..4fce6f5a2 100644 --- a/navtreeindex5.js +++ b/navtreeindex5.js @@ -134,8 +134,8 @@ var NAVTREEINDEX5 = "dir_ece9b94c107bbaa1dd68197a8c9983b9.html":[8,0,7], "dir_f1797d0c2a0a12033e7d74efffeb14e1.html":[8,0,2,0], "files.html":[8,0], -"functions.html":[7,3,0], "functions.html":[7,3,0,0], +"functions.html":[7,3,0], "functions_a.html":[7,3,0,1], "functions_b.html":[7,3,0,2], "functions_c.html":[7,3,0,3], @@ -165,8 +165,8 @@ var NAVTREEINDEX5 = "functions_x.html":[7,3,0,23], "functions_y.html":[7,3,0,24], "functions_~.html":[7,3,0,25], -"globals.html":[8,1,0], "globals.html":[8,1,0,0], +"globals.html":[8,1,0], "globals_a.html":[8,1,0,1], "globals_b.html":[8,1,0,2], "globals_c.html":[8,1,0,3], @@ -213,8 +213,8 @@ var NAVTREEINDEX5 = "globals_u.html":[8,1,0,20], "globals_vars.html":[8,1,2], "hierarchy.html":[7,2], -"index.html":[0], "index.html":[], +"index.html":[0], "index.html#autotoc_md40":[0,0], "index.html#autotoc_md41":[0,1], "index.html#autotoc_md42":[0,2], @@ -225,9 +225,9 @@ var NAVTREEINDEX5 = "namespacemembers_vars.html":[6,1,2], "namespaces.html":[6,0], "pages.html":[], -"":[7,0,6,0,0], -"":[7,0,3,0], "":[7,0,6,0], +"":[7,0,3,0], +"":[7,0,6,0,0], "":[7,0,8,0], "":[7,0,4,0] }; diff --git a/search/all_1.js b/search/all_1.js index bffd28358..42da9052b 100644 --- a/search/all_1.js +++ b/search/all_1.js @@ -60,7 +60,7 @@ var searchData= ['arg_64',['arg',['../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41',1,'Complex']]], ['argmax_65',['argmax',['../d8/d77/namespacemachine__learning.html#a1b42d24ad7bedbfa8e5b59fe96987a44',1,'machine_learning']]], ['armstrong_5fnumber_2ecpp_66',['armstrong_number.cpp',['../d4/d5d/math_2armstrong__number_8cpp.html',1,'']]], - ['arr_67',['arr',['../d0/d6e/classdata__structure_1_1trie.html#aa5b8dc9452c3f7a805a4cb17034d6549',1,'data_structure::trie']]], + ['arr_67',['arr',['../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b',1,'data_structures::trie']]], ['array_68',['array',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], ['asctime_69',['asctime',['http://en.cppreference.com/w/cpp/chrono/c/asctime.html',0,'std']]], ['asin_70',['asin',['http://en.cppreference.com/w/cpp/numeric/math/asin.html',0,'std']]], diff --git a/search/all_10.js b/search/all_10.js index f984542e4..9316ba5d2 100644 --- a/search/all_10.js +++ b/search/all_10.js @@ -80,7 +80,7 @@ var searchData= ['printsolution_1327',['printSolution',['../db/dc0/namespacebacktracking.html#a8cfb2d08840766ac4402196079308a36',1,'backtracking::printSolution()'],['../d4/d3e/n__queens_8cpp.html#a40ae0c7fd04eb20e7f3bff13fc6a5808',1,'backtracking::n_queens::printSolution()']]], ['priority_5fqueue_1328',['priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue.html',0,'std::priority_queue< T >'],['http://en.cppreference.com/w/cpp/container/priority_queue/priority_queue.html',0,'std::priority_queue::priority_queue()']]], ['probabilities_1329',['probabilities',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/probabilities.html',0,'std::discrete_distribution']]], - ['probability_1330',['PROBABILITY',['../d1/db4/namespacedata__structure.html#a38234f668624bca86341240f34a95193',1,'data_structure']]], + ['probability_1330',['PROBABILITY',['../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61',1,'data_structures']]], ['problem_1331',['problem',['../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_semi_implicit_euler.cpp']]], ['promise_1332',['promise',['http://en.cppreference.com/w/cpp/thread/promise.html',0,'std::promise'],['http://en.cppreference.com/w/cpp/thread/promise/promise.html',0,'std::promise::promise()']]], ['ptrdiff_5ft_1333',['ptrdiff_t',['http://en.cppreference.com/w/cpp/types/ptrdiff_t.html',0,'std']]], diff --git a/search/all_12.js b/search/all_12.js index 5f786ea86..2786d59af 100644 --- a/search/all_12.js +++ b/search/all_12.js @@ -10,7 +10,7 @@ var searchData= ['random_5fshuffle_1382',['random_shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std']]], ['random_5ftests_1383',['random_tests',['../de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f',1,'fibonacci_search.cpp']]], ['randomized_5fbogosort_1384',['randomized_bogosort',['../d5/d91/namespacesorting.html#a4c5bd73ffb6082f63dc57d8dcc76794f',1,'sorting']]], - ['randomlevel_1385',['randomLevel',['../d1/d46/classdata__structure_1_1_skip_list.html#a10800369c9efa08dd86de0ce552c874e',1,'data_structure::SkipList']]], + ['randomlevel_1385',['randomLevel',['../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4',1,'data_structures::SkipList']]], ['range_5ferror_1386',['range_error',['http://en.cppreference.com/w/cpp/error/range_error.html',0,'std::range_error'],['http://en.cppreference.com/w/cpp/error/range_error.html',0,'std::range_error::range_error()']]], ['range_5fqueries_1387',['range_queries',['../dd/d69/namespacerange__queries.html',1,'']]], ['rank_1388',['rank',['http://en.cppreference.com/w/cpp/types/rank.html',0,'std']]], diff --git a/search/all_13.js b/search/all_13.js index 7f29ce813..98b776a8f 100644 --- a/search/all_13.js +++ b/search/all_13.js @@ -20,9 +20,9 @@ var searchData= ['scientific_1496',['scientific',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], ['scoped_5fallocator_5fadaptor_1497',['scoped_allocator_adaptor',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor.html',0,'std::scoped_allocator_adaptor'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/scoped_allocator_adaptor.html',0,'std::scoped_allocator_adaptor::scoped_allocator_adaptor()']]], ['scs_1498',['scs',['../d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6',1,'dynamic_programming::shortest_common_supersequence']]], - ['search_1499',['search',['../d9/dca/namespacesearch.html',1,'search'],['../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206',1,'Trie::search()'],['../d0/d6e/classdata__structure_1_1trie.html#ae9c45cbd4b52db9a39d27e12ca912abc',1,'data_structure::trie::search(const std::shared_ptr< trie > &root, const std::string &str, int index)'],['../d0/d6e/classdata__structure_1_1trie.html#adff53199439d06776ebbaf917741774f',1,'data_structure::trie::search(const std::string &str, int index)'],['http://en.cppreference.com/w/cpp/algorithm/search.html',0,'std::search()']]], + ['search_1499',['search',['../d9/dca/namespacesearch.html',1,'search'],['../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206',1,'Trie::search()'],['../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63',1,'data_structures::trie::search(const std::shared_ptr< trie > &root, const std::string &str, int index)'],['../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d',1,'data_structures::trie::search(const std::string &str, int index)'],['http://en.cppreference.com/w/cpp/algorithm/search.html',0,'std::search()']]], ['search_5fn_1500',['search_n',['http://en.cppreference.com/w/cpp/algorithm/search_n.html',0,'std']]], - ['searchelement_1501',['searchElement',['../d1/d46/classdata__structure_1_1_skip_list.html#a7cda6370f8bd2b6d1db28bd5ca586a21',1,'data_structure::SkipList']]], + ['searchelement_1501',['searchElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a2249e3ab2f8a0f2334b90635202de4f2',1,'data_structures::SkipList']]], ['searchingprober_1502',['searchingProber',['../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6',1,'double_hashing::searchingProber()'],['../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77',1,'linear_probing::searchingProber()'],['../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6',1,'quadratic_probing::searchingProber()']]], ['seconds_1503',['seconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::seconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::seconds::seconds()']]], ['seed_1504',['seed',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937_64::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux24_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux48::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::discard_block_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mersenne_twister_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/seed.html',0,'std::independent_bits_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux48_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::shuffle_order_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux24::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::linear_congruential_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::knuth_b::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand0::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::subtract_with_carry_engine::seed()']]], @@ -72,9 +72,9 @@ var searchData= ['shared_5ffuture_1548',['shared_future',['http://en.cppreference.com/w/cpp/thread/shared_future.html',0,'std::shared_future'],['http://en.cppreference.com/w/cpp/thread/shared_future/shared_future.html',0,'std::shared_future::shared_future()']]], ['shared_5flock_1549',['shared_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock.html',0,'std::shared_lock< T >'],['http://en.cppreference.com/w/cpp/thread/shared_lock/shared_lock.html',0,'std::shared_lock::shared_lock()']]], ['shared_5fptr_1550',['shared_ptr',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std::shared_ptr< T >'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/shared_ptr.html',0,'std::shared_ptr::shared_ptr()']]], - ['shared_5fptr_3c_20data_5fstructure_3a_3anode_20_3e_1551',['shared_ptr< data_structure::Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20data_5fstructure_3a_3atrie_20_3e_1552',['shared_ptr< data_structure::trie >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20data_5fstructure_3a_3atrie_20_3e_2c_20num_5fchars_3c_3c_201_20_3e_1553',['shared_ptr< data_structure::trie >, NUM_CHARS<< 1 >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['shared_5fptr_3c_20data_5fstructures_3a_3anode_20_3e_1551',['shared_ptr< data_structures::Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5fptr_3c_20data_5fstructures_3a_3atrie_20_3e_1552',['shared_ptr< data_structures::trie >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5fptr_3c_20data_5fstructures_3a_3atrie_20_3e_2c_20num_5fchars_3c_3c_201_20_3e_1553',['shared_ptr< data_structures::trie >, NUM_CHARS<< 1 >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], ['shared_5fptr_3c_20node_20_3e_1554',['shared_ptr< Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], ['shared_5fptr_3c_20struct_20node_20_3e_1555',['shared_ptr< struct Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], ['shared_5fptr_3c_20trie_3a_3atrienode_20_3e_1556',['shared_ptr< Trie::TrieNode >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], @@ -109,7 +109,7 @@ var searchData= ['size_1585',['size',['../d1/dc2/classstack.html#ac512a3efdc84a5f5c9f53905c8e219b0',1,'stack::size()'],['http://en.cppreference.com/w/cpp/container/dynarray/size.html',0,'std::dynarray::size()'],['http://en.cppreference.com/w/cpp/container/vector/size.html',0,'std::vector::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::match_results::size()'],['http://en.cppreference.com/w/cpp/container/multiset/size.html',0,'std::multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::size()'],['http://en.cppreference.com/w/cpp/container/set/size.html',0,'std::set::size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/size.html',0,'std::unordered_map::size()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/size.html',0,'std::initializer_list::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wsmatch::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::smatch::size()'],['http://en.cppreference.com/w/cpp/container/stack/size.html',0,'std::stack::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/size.html',0,'std::unordered_multimap::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wcmatch::size()'],['http://en.cppreference.com/w/cpp/container/deque/size.html',0,'std::deque::size()'],['http://en.cppreference.com/w/cpp/container/queue/size.html',0,'std::queue::size()'],['http://en.cppreference.com/w/cpp/utility/bitset/size.html',0,'std::bitset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::size()'],['http://en.cppreference.com/w/cpp/container/priority_queue/size.html',0,'std::priority_queue::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/size.html',0,'std::unordered_multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::size()'],['http://en.cppreference.com/w/cpp/container/list/size.html',0,'std::list::size()'],['http://en.cppreference.com/w/cpp/container/map/size.html',0,'std::map::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::cmatch::size()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/size.html',0,'std::seed_seq::size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/size.html',0,'std::unordered_set::size()'],['http://en.cppreference.com/w/cpp/container/multimap/size.html',0,'std::multimap::size()'],['http://en.cppreference.com/w/cpp/container/array/size.html',0,'std::array::size()']]], ['size_5ft_1586',['size_t',['http://en.cppreference.com/w/cpp/types/size_t.html',0,'std']]], ['skip_5flist_2ecpp_1587',['skip_list.cpp',['../d0/d5a/skip__list_8cpp.html',1,'']]], - ['skiplist_1588',['SkipList',['../d1/d46/classdata__structure_1_1_skip_list.html',1,'data_structure::SkipList'],['../d1/d46/classdata__structure_1_1_skip_list.html#aed414cf88cfacb9554ecfd184b03fe04',1,'data_structure::SkipList::SkipList()']]], + ['skiplist_1588',['SkipList',['../d4/d90/classdata__structures_1_1_skip_list.html',1,'data_structures::SkipList'],['../d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4',1,'data_structures::SkipList::SkipList()']]], ['skipws_1589',['skipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]], ['sleep_5ffor_1590',['sleep_for',['http://en.cppreference.com/w/cpp/thread/sleep_for.html',0,'std::this_thread']]], ['sleep_5funtil_1591',['sleep_until',['http://en.cppreference.com/w/cpp/thread/sleep_until.html',0,'std::this_thread']]], diff --git a/search/all_14.js b/search/all_14.js index 3b7d4bf62..b0c01bad9 100644 --- a/search/all_14.js +++ b/search/all_14.js @@ -89,7 +89,7 @@ var searchData= ['treat_5fas_5ffloating_5fpoint_1802',['treat_as_floating_point',['http://en.cppreference.com/w/cpp/chrono/treat_as_floating_point.html',0,'std::chrono']]], ['tree_1803',['Tree',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html',1,'range_queries::heavy_light_decomposition::Tree< X >'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1',1,'range_queries::heavy_light_decomposition::Tree::Tree()']]], ['trianglearea_1804',['TriangleArea',['../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc',1,'smallest_circle.cpp']]], - ['trie_1805',['trie',['../d0/d6e/classdata__structure_1_1trie.html',1,'data_structure::trie'],['../dd/d2f/class_trie.html',1,'Trie'],['../d0/d6e/classdata__structure_1_1trie.html#a36a41761149fd541850834aef29f9b7f',1,'data_structure::trie::trie()'],['../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908',1,'Trie::Trie()']]], + ['trie_1805',['trie',['../d0/d3e/classdata__structures_1_1trie.html',1,'data_structures::trie'],['../dd/d2f/class_trie.html',1,'Trie'],['../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8',1,'data_structures::trie::trie()'],['../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908',1,'Trie::Trie()']]], ['trie_5fmodern_2ecpp_1806',['trie_modern.cpp',['../dc/d93/trie__modern_8cpp.html',1,'']]], ['trie_5ftree_2ecpp_1807',['trie_tree.cpp',['../d7/d83/trie__tree_8cpp.html',1,'']]], ['trienode_1808',['TrieNode',['../de/d48/struct_trie_1_1_trie_node.html',1,'Trie']]], diff --git a/search/all_16.js b/search/all_16.js index 8e2122813..c9bd2ac90 100644 --- a/search/all_16.js +++ b/search/all_16.js @@ -4,9 +4,9 @@ var searchData= ['valarray_1889',['valarray',['http://en.cppreference.com/w/cpp/numeric/valarray.html',0,'std']]], ['valarray_3c_20double_20_3e_1890',['valarray< double >',['http://en.cppreference.com/w/cpp/numeric/valarray.html',0,'std']]], ['valid_1891',['valid',['http://en.cppreference.com/w/cpp/thread/shared_future/valid.html',0,'std::shared_future::valid()'],['http://en.cppreference.com/w/cpp/thread/future/valid.html',0,'std::future::valid()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/valid.html',0,'std::packaged_task::valid()']]], - ['value_1892',['value',['../d3/d6f/structdata__structure_1_1_node.html#a24580ec4e79f7bb82e55a9c4d8369a6e',1,'data_structure::Node::value()'],['http://en.cppreference.com/w/cpp/error/error_code/value.html',0,'std::error_code::value()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/value.html',0,'std::regex_traits::value()'],['http://en.cppreference.com/w/cpp/error/error_condition/value.html',0,'std::error_condition::value()'],['http://en.cppreference.com/w/cpp/experimental/optional/value.html',0,'std::experimental::optional::value()']]], + ['value_1892',['value',['../d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731',1,'data_structures::Node::value()'],['http://en.cppreference.com/w/cpp/error/error_code/value.html',0,'std::error_code::value()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/value.html',0,'std::regex_traits::value()'],['http://en.cppreference.com/w/cpp/error/error_condition/value.html',0,'std::error_condition::value()'],['http://en.cppreference.com/w/cpp/experimental/optional/value.html',0,'std::experimental::optional::value()']]], ['value_5fcomp_1893',['value_comp',['http://en.cppreference.com/w/cpp/container/multiset/value_comp.html',0,'std::multiset::value_comp()'],['http://en.cppreference.com/w/cpp/container/set/value_comp.html',0,'std::set::value_comp()'],['http://en.cppreference.com/w/cpp/container/map/value_comp.html',0,'std::map::value_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/value_comp.html',0,'std::multimap::value_comp()']]], - ['value_5fcompare_1894',['value_compare',['http://en.cppreference.com/w/cpp/container/multimap/value_compare.html',0,'std::multimap< K, T >::value_compare'],['http://en.cppreference.com/w/cpp/container/map/value_compare.html',0,'std::map< K, T >::value_compare']]], + ['value_5fcompare_1894',['value_compare',['http://en.cppreference.com/w/cpp/container/map/value_compare.html',0,'std::map< K, T >::value_compare'],['http://en.cppreference.com/w/cpp/container/multimap/value_compare.html',0,'std::multimap< K, T >::value_compare']]], ['value_5for_1895',['value_or',['http://en.cppreference.com/w/cpp/experimental/optional/value_or.html',0,'std::experimental::optional']]], ['values_1896',['values',['../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9',1,'tower']]], ['variance_1897',['variance',['../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92',1,'statistics::stats_computer1::variance()'],['../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555',1,'statistics::stats_computer2::variance()']]], @@ -17,7 +17,7 @@ var searchData= ['vector_3c_20int_20_3e_1902',['vector< int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20machine_5flearning_3a_3aneural_5fnetwork_3a_3alayers_3a_3adenselayer_20_3e_1903',['vector< machine_learning::neural_network::layers::DenseLayer >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20std_3a_3alist_3c_20int_20_3e_20_3e_1904',['vector< std::list< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3ashared_5fptr_3c_20data_5fstructure_3a_3anode_20_3e_20_3e_1905',['vector< std::shared_ptr< data_structure::Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3ashared_5fptr_3c_20data_5fstructures_3a_3anode_20_3e_20_3e_1905',['vector< std::shared_ptr< data_structures::Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20std_3a_3ashared_5fptr_3c_20node_20_3e_20_3e_1906',['vector< std::shared_ptr< Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20std_3a_3atuple_3c_20int_2c_20int_2c_20int_20_3e_20_3e_1907',['vector< std::tuple< int, int, int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20std_3a_3avalarray_3c_20double_20_3e_20_3e_1908',['vector< std::valarray< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], diff --git a/search/all_3.js b/search/all_3.js index 37dca267b..c2a8e808f 100644 --- a/search/all_3.js +++ b/search/all_3.js @@ -24,7 +24,7 @@ var searchData= ['chain_5fquery_218',['chain_query',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24',1,'range_queries::heavy_light_decomposition::HLD']]], ['chaining_2ecpp_219',['chaining.cpp',['../d9/d92/chaining_8cpp.html',1,'']]], ['change_5froot_220',['change_root',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0',1,'range_queries::heavy_light_decomposition::Tree']]], - ['char_5fto_5fint_221',['char_to_int',['../d0/d6e/classdata__structure_1_1trie.html#aeb479dcc88415154fb61c2fbb589d6d0',1,'data_structure::trie']]], + ['char_5fto_5fint_221',['char_to_int',['../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988',1,'data_structures::trie']]], ['char_5ftraits_222',['char_traits',['http://en.cppreference.com/w/cpp/string/char_traits.html',0,'std']]], ['char_5ftype_223',['char_type',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::char_type'],['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get::char_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct::char_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::char_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put::char_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get::char_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct::char_type'],['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate::char_type'],['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put::char_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages::char_type']]], ['check_5famicable_5fpair_2ecpp_224',['check_amicable_pair.cpp',['../d5/df6/check__amicable__pair_8cpp.html',1,'']]], diff --git a/search/all_4.js b/search/all_4.js index 4a2d770ba..6487900b3 100644 --- a/search/all_4.js +++ b/search/all_4.js @@ -1,7 +1,7 @@ var searchData= [ ['data_301',['data',['../d5/da1/structnode.html#a42309387b3fa0237ec200c025071ad37',1,'node::data()'],['http://en.cppreference.com/w/cpp/container/dynarray/data.html',0,'std::dynarray::data()'],['http://en.cppreference.com/w/cpp/container/vector/data.html',0,'std::vector::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::basic_string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::wstring::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u16string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u32string::data()'],['http://en.cppreference.com/w/cpp/container/array/data.html',0,'std::array::data()'],['../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243',1,'data(): hash_search.cpp']]], - ['data_5fstructure_302',['data_structure',['../d1/db4/namespacedata__structure.html',1,'']]], + ['data_5fstructures_302',['data_structures',['../d5/d3c/namespacedata__structures.html',1,'']]], ['date_5forder_303',['date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::date_order()']]], ['deallocate_304',['deallocate',['http://en.cppreference.com/w/cpp/memory/allocator_traits/deallocate.html',0,'std::allocator_traits::deallocate()'],['http://en.cppreference.com/w/cpp/memory/allocator/deallocate.html',0,'std::allocator::deallocate()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/deallocate.html',0,'std::scoped_allocator_adaptor::deallocate()']]], ['dec_305',['dec',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]], @@ -23,10 +23,10 @@ var searchData= ['default_5frandom_5fengine_321',['default_random_engine',['http://en.cppreference.com/w/cpp/numeric/random.html',0,'std']]], ['defaultfloat_322',['defaultfloat',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], ['defer_5flock_5ft_323',['defer_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], - ['deleteelement_324',['deleteElement',['../d1/d46/classdata__structure_1_1_skip_list.html#a4b8eb18c9ca24f53e9de91b74febd666',1,'data_structure::SkipList']]], + ['deleteelement_324',['deleteElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0',1,'data_structures::SkipList']]], ['deletekey_325',['deleteKey',['../d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29',1,'MinHeap']]], ['deletenode_326',['deleteNode',['../d8/dee/avltree_8cpp.html#a8286388b0743a716145639df3a33e541',1,'avltree.cpp']]], - ['deletestring_327',['deleteString',['../d0/d6e/classdata__structure_1_1trie.html#a98a0d54a781a680903eac14085fcbc2e',1,'data_structure::trie']]], + ['deletestring_327',['deleteString',['../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab',1,'data_structures::trie']]], ['denorm_5fmin_328',['denorm_min',['http://en.cppreference.com/w/cpp/types/numeric_limits/denorm_min.html',0,'std::numeric_limits']]], ['denselayer_329',['DenseLayer',['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html',1,'machine_learning::neural_network::layers::DenseLayer'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a51c2b942ecf10625780c6bb9d5c50ff1',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &neurons, const std::string &activation, const std::pair< size_t, size_t > &kernal_shape, const bool &random_kernal)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a04b8e21316458436c8851959928c3964',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &neurons, const std::string &activation, const std::vector< std::valarray< double >> &kernal)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const DenseLayer &layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(DenseLayer &&)=default']]], ['densities_330',['densities',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::densities()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::densities()']]], @@ -52,7 +52,7 @@ var searchData= ['discrete_5fdistribution_350',['discrete_distribution',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution.html',0,'std::discrete_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/discrete_distribution.html',0,'std::discrete_distribution::discrete_distribution()']]], ['disjoint_5fset_2ecpp_351',['disjoint_set.cpp',['../de/d23/disjoint__set_8cpp.html',1,'']]], ['display_352',['display',['../db/da9/classqueue.html#a26f48801df462ade003b50739196fa4c',1,'queue::display()'],['../d1/dc2/classstack.html#a67f65710c376f67d1ba3bde45a9cb628',1,'stack::display()'],['../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed',1,'hash_chain::display()'],['../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd',1,'double_hashing::display()'],['../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635',1,'linear_probing::display()'],['../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357',1,'quadratic_probing::display()']]], - ['displaylist_353',['displayList',['../d1/d46/classdata__structure_1_1_skip_list.html#a1574d62ca0a5a821601d246c07215335',1,'data_structure::SkipList']]], + ['displaylist_353',['displayList',['../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c',1,'data_structures::SkipList']]], ['distance_354',['distance',['http://en.cppreference.com/w/cpp/iterator/distance.html',0,'std']]], ['div_355',['div',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]], ['divides_356',['divides',['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std']]], diff --git a/search/all_6.js b/search/all_6.js index 84ea9bd30..47484e01b 100644 --- a/search/all_6.js +++ b/search/all_6.js @@ -83,7 +83,7 @@ var searchData= ['fopen_561',['fopen',['http://en.cppreference.com/w/cpp/io/c/fopen.html',0,'std']]], ['for_5feach_562',['for_each',['http://en.cppreference.com/w/cpp/algorithm/for_each.html',0,'std']]], ['format_563',['format',['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::match_results::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wsmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::smatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wcmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::cmatch::format()']]], - ['forward_564',['forward',['../d3/d6f/structdata__structure_1_1_node.html#a0e80ff706591f718f763c5a7feaa2394',1,'data_structure::Node::forward()'],['http://en.cppreference.com/w/cpp/utility/forward.html',0,'std::forward()']]], + ['forward_564',['forward',['../d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e',1,'data_structures::Node::forward()'],['http://en.cppreference.com/w/cpp/utility/forward.html',0,'std::forward()']]], ['forward_5fas_5ftuple_565',['forward_as_tuple',['http://en.cppreference.com/w/cpp/utility/tuple/forward_as_tuple.html',0,'std']]], ['forward_5feuler_566',['forward_euler',['../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9',1,'ode_forward_euler.cpp']]], ['forward_5feuler_5fstep_567',['forward_euler_step',['../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723',1,'ode_forward_euler.cpp']]], diff --git a/search/all_8.js b/search/all_8.js index 8efc1e45b..73eaf28c5 100644 --- a/search/all_8.js +++ b/search/all_8.js @@ -23,7 +23,7 @@ var searchData= ['hashmax_696',['HASHMAX',['../d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367',1,'hash_search.cpp']]], ['hashtab_697',['hashtab',['../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d',1,'hash_search.cpp']]], ['head_698',['head',['../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0',1,'hash_chain']]], - ['header_699',['header',['../d1/d46/classdata__structure_1_1_skip_list.html#a7aed753e3b47953229f5ac94f0fc9aad',1,'data_structure::SkipList']]], + ['header_699',['header',['../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16',1,'data_structures::SkipList']]], ['heap_5fsize_700',['heap_size',['../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913',1,'MinHeap']]], ['heap_5fsort_2ecpp_701',['heap_sort.cpp',['../d2/d52/heap__sort_8cpp.html',1,'']]], ['heapsort_702',['heapSort',['../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f',1,'heap_sort.cpp']]], diff --git a/search/all_9.js b/search/all_9.js index c30c18b91..cb3a817b8 100644 --- a/search/all_9.js +++ b/search/all_9.js @@ -19,12 +19,12 @@ var searchData= ['inplace_5fmerge_731',['inplace_merge',['http://en.cppreference.com/w/cpp/algorithm/inplace_merge.html',0,'std']]], ['input_5fiterator_5ftag_732',['input_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], ['insameunion_733',['InSameUnion',['../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985',1,'disjoint_set.cpp']]], - ['insert_734',['insert',['http://en.cppreference.com/w/cpp/container/vector/insert.html',0,'std::vector::insert()'],['http://en.cppreference.com/w/cpp/container/multiset/insert.html',0,'std::multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::string::insert()'],['http://en.cppreference.com/w/cpp/container/set/insert.html',0,'std::set::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_map/insert.html',0,'std::unordered_map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/insert.html',0,'std::unordered_multimap::insert()'],['http://en.cppreference.com/w/cpp/container/deque/insert.html',0,'std::deque::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::basic_string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::wstring::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/insert.html',0,'std::unordered_multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u16string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u32string::insert()'],['http://en.cppreference.com/w/cpp/container/list/insert.html',0,'std::list::insert()'],['http://en.cppreference.com/w/cpp/container/map/insert.html',0,'std::map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_set/insert.html',0,'std::unordered_set::insert()'],['http://en.cppreference.com/w/cpp/container/multimap/insert.html',0,'std::multimap::insert()'],['../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2',1,'Trie::insert()'],['../d0/d6e/classdata__structure_1_1trie.html#a8b9a51c90291a3402904c8cd16bbe30d',1,'data_structure::trie::insert()'],['../d8/dee/avltree_8cpp.html#aa7cd8a68075fae1c33df41233c1bed6a',1,'insert(): avltree.cpp']]], + ['insert_734',['insert',['http://en.cppreference.com/w/cpp/container/vector/insert.html',0,'std::vector::insert()'],['http://en.cppreference.com/w/cpp/container/multiset/insert.html',0,'std::multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::string::insert()'],['http://en.cppreference.com/w/cpp/container/set/insert.html',0,'std::set::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_map/insert.html',0,'std::unordered_map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/insert.html',0,'std::unordered_multimap::insert()'],['http://en.cppreference.com/w/cpp/container/deque/insert.html',0,'std::deque::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::basic_string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::wstring::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/insert.html',0,'std::unordered_multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u16string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u32string::insert()'],['http://en.cppreference.com/w/cpp/container/list/insert.html',0,'std::list::insert()'],['http://en.cppreference.com/w/cpp/container/map/insert.html',0,'std::map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_set/insert.html',0,'std::unordered_set::insert()'],['http://en.cppreference.com/w/cpp/container/multimap/insert.html',0,'std::multimap::insert()'],['../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2',1,'Trie::insert()'],['../d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546',1,'data_structures::trie::insert()'],['../d8/dee/avltree_8cpp.html#aa7cd8a68075fae1c33df41233c1bed6a',1,'insert(): avltree.cpp']]], ['insert_5fafter_735',['insert_after',['http://en.cppreference.com/w/cpp/container/forward_list/insert_after.html',0,'std::forward_list']]], ['insert_5felement_736',['insert_element',['../d8/d77/namespacemachine__learning.html#a725d4ccceda4f32c96348ba1d593cd3c',1,'machine_learning']]], ['insert_5fiterator_737',['insert_iterator',['http://en.cppreference.com/w/cpp/iterator/insert_iterator.html',0,'std']]], ['insertatthebeginning_738',['insertAtTheBeginning',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df',1,'linkedlist_implentation_usingarray.cpp']]], - ['insertelement_739',['insertElement',['../d1/d46/classdata__structure_1_1_skip_list.html#a1c6c04c0fb45ea2e2378de7ab9cb465b',1,'data_structure::SkipList']]], + ['insertelement_739',['insertElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9',1,'data_structures::SkipList']]], ['inserter_740',['inserter',['http://en.cppreference.com/w/cpp/iterator/inserter.html',0,'std']]], ['insertion_5fsort_2ecpp_741',['insertion_sort.cpp',['../dd/d0d/insertion__sort_8cpp.html',1,'']]], ['insertionsort_742',['insertionSort',['../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9',1,'sorting::insertionSort(T *arr, int n)'],['../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f',1,'sorting::insertionSort(std::vector< T > *arr)']]], @@ -146,7 +146,7 @@ var searchData= ['isdigit_858',['isdigit',['http://en.cppreference.com/w/cpp/string/byte/isdigit.html',0,'std']]], ['isemptyqueue_859',['isEmptyQueue',['../db/da9/classqueue.html#ac2fff88dce4d7d2eb7134af382bd1b31',1,'queue']]], ['isemptystack_860',['isEmptyStack',['../d1/dc2/classstack.html#a066e4505155b009913c47b2648b1067a',1,'stack']]], - ['isendofword_861',['isEndofWord',['../d0/d6e/classdata__structure_1_1trie.html#a0bc4f25351be960f3570e562cfb4a070',1,'data_structure::trie']]], + ['isendofword_861',['isEndofWord',['../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6',1,'data_structures::trie']]], ['isfinite_862',['isfinite',['http://en.cppreference.com/w/cpp/numeric/math/isfinite.html',0,'std']]], ['isgraph_863',['isgraph',['http://en.cppreference.com/w/cpp/string/byte/isgraph.html',0,'std']]], ['isinf_864',['isinf',['http://en.cppreference.com/w/cpp/numeric/math/isinf.html',0,'std']]], diff --git a/search/all_b.js b/search/all_b.js index ff49d53d9..af1b7cdad 100644 --- a/search/all_b.js +++ b/search/all_b.js @@ -1,7 +1,7 @@ var searchData= [ ['k_908',['k',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/params.html',0,'std::negative_binomial_distribution']]], - ['key_909',['key',['../d3/d6f/structdata__structure_1_1_node.html#a089ebc844c81777652d4e577be0739c8',1,'data_structure::Node::key()'],['../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248',1,'double_hashing::Entry::key()'],['../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a',1,'linear_probing::Entry::key()'],['../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8',1,'quadratic_probing::Entry::key()'],['../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c',1,'list::key()']]], + ['key_909',['key',['../d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68',1,'data_structures::Node::key()'],['../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248',1,'double_hashing::Entry::key()'],['../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a',1,'linear_probing::Entry::key()'],['../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8',1,'quadratic_probing::Entry::key()'],['../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c',1,'list::key()']]], ['key_5fcomp_910',['key_comp',['http://en.cppreference.com/w/cpp/container/multiset/key_comp.html',0,'std::multiset::key_comp()'],['http://en.cppreference.com/w/cpp/container/set/key_comp.html',0,'std::set::key_comp()'],['http://en.cppreference.com/w/cpp/container/map/key_comp.html',0,'std::map::key_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/key_comp.html',0,'std::multimap::key_comp()']]], ['key_5feq_911',['key_eq',['http://en.cppreference.com/w/cpp/container/unordered_map/key_eq.html',0,'std::unordered_map::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/key_eq.html',0,'std::unordered_multimap::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/key_eq.html',0,'std::unordered_multiset::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_set/key_eq.html',0,'std::unordered_set::key_eq()']]], ['kill_5fdependency_912',['kill_dependency',['http://en.cppreference.com/w/cpp/atomic/kill_dependency.html',0,'std']]], diff --git a/search/all_c.js b/search/all_c.js index 874b6d5d5..7e2fc17f0 100644 --- a/search/all_c.js +++ b/search/all_c.js @@ -20,7 +20,7 @@ var searchData= ['length_5ferror_940',['length_error',['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std::length_error'],['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std::length_error::length_error()']]], ['less_941',['less',['http://en.cppreference.com/w/cpp/utility/functional/less.html',0,'std']]], ['less_5fequal_942',['less_equal',['http://en.cppreference.com/w/cpp/utility/functional/less_equal.html',0,'std']]], - ['level_943',['level',['../d1/d46/classdata__structure_1_1_skip_list.html#ae0c022174510fd9ca1b84d8e996cd1a5',1,'data_structure::SkipList::level()'],['../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3',1,'graph::RootedTree::level()']]], + ['level_943',['level',['../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650',1,'data_structures::SkipList::level()'],['../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3',1,'graph::RootedTree::level()']]], ['levelorder_944',['levelOrder',['../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59',1,'avltree.cpp']]], ['lexicographical_5fcompare_945',['lexicographical_compare',['http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare.html',0,'std']]], ['lgamma_946',['lgamma',['http://en.cppreference.com/w/cpp/numeric/math/lgamma.html',0,'std']]], diff --git a/search/all_d.js b/search/all_d.js index 77b0ecf04..0771f5638 100644 --- a/search/all_d.js +++ b/search/all_d.js @@ -30,7 +30,7 @@ var searchData= ['max_5fiter_1026',['MAX_ITER',['../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1',1,'adaline_learning.cpp']]], ['max_5fiterations_1027',['MAX_ITERATIONS',['../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'MAX_ITERATIONS(): bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'MAX_ITERATIONS(): false_position.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d',1,'MAX_ITERATIONS(): newton_raphson_method.cpp']]], ['max_5flength_1028',['max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::max_length()']]], - ['max_5flevel_1029',['MAX_LEVEL',['../d1/db4/namespacedata__structure.html#a039855c4d1684de1fec104057df9f26d',1,'data_structure']]], + ['max_5flevel_1029',['MAX_LEVEL',['../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a',1,'data_structures']]], ['max_5fload_5ffactor_1030',['max_load_factor',['http://en.cppreference.com/w/cpp/container/unordered_map/max_load_factor.html',0,'std::unordered_map::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_load_factor.html',0,'std::unordered_multimap::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_load_factor.html',0,'std::unordered_multiset::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_load_factor.html',0,'std::unordered_set::max_load_factor()']]], ['max_5fsize_1031',['max_size',['http://en.cppreference.com/w/cpp/container/dynarray/max_size.html',0,'std::dynarray::max_size()'],['http://en.cppreference.com/w/cpp/container/vector/max_size.html',0,'std::vector::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::match_results::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator_traits/max_size.html',0,'std::allocator_traits::max_size()'],['http://en.cppreference.com/w/cpp/container/multiset/max_size.html',0,'std::multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::string::max_size()'],['http://en.cppreference.com/w/cpp/container/set/max_size.html',0,'std::set::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/max_size.html',0,'std::unordered_map::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wsmatch::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::smatch::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_size.html',0,'std::unordered_multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/forward_list/max_size.html',0,'std::forward_list::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wcmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/deque/max_size.html',0,'std::deque::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator/max_size.html',0,'std::allocator::max_size()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/max_size.html',0,'std::scoped_allocator_adaptor::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::basic_string::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::wstring::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_size.html',0,'std::unordered_multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u16string::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u32string::max_size()'],['http://en.cppreference.com/w/cpp/container/list/max_size.html',0,'std::list::max_size()'],['http://en.cppreference.com/w/cpp/container/map/max_size.html',0,'std::map::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::cmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_size.html',0,'std::unordered_set::max_size()'],['http://en.cppreference.com/w/cpp/container/multimap/max_size.html',0,'std::multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/array/max_size.html',0,'std::array::max_size()']]], ['mblen_1032',['mblen',['http://en.cppreference.com/w/cpp/string/multibyte/mblen.html',0,'std']]], diff --git a/search/all_e.js b/search/all_e.js index 8a502d25c..4c35147ff 100644 --- a/search/all_e.js +++ b/search/all_e.js @@ -33,7 +33,7 @@ var searchData= ['nexttoward_1142',['nexttoward',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]], ['no_5foccurence_5ftests_1143',['no_occurence_tests',['../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d',1,'fibonacci_search.cpp']]], ['noboolalpha_1144',['noboolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]], - ['node_1145',['Node',['../d3/d6f/structdata__structure_1_1_node.html',1,'data_structure::Node'],['../d5/da1/structnode.html',1,'node< Kind >'],['../db/d8b/struct_node.html',1,'Node'],['../dd/d1c/classhash__chain.html#a21172d047bb9621385f2426ce25e71aa',1,'hash_chain::Node()'],['../d3/d6f/structdata__structure_1_1_node.html#af7f19e61975f1362b22d1488bee87077',1,'data_structure::Node::Node()'],['../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555',1,'node(): hash_search.cpp']]], + ['node_1145',['Node',['../d9/d49/structdata__structures_1_1_node.html',1,'data_structures::Node'],['../d5/da1/structnode.html',1,'node< Kind >'],['../db/d8b/struct_node.html',1,'Node'],['../dd/d1c/classhash__chain.html#a21172d047bb9621385f2426ce25e71aa',1,'hash_chain::Node()'],['../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78',1,'data_structures::Node::Node()'],['../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555',1,'node(): hash_search.cpp']]], ['node_3c_20type_20_3e_1146',['node< Type >',['../d5/da1/structnode.html',1,'']]], ['non_5frecursive_5fmerge_5fsort_1147',['non_recursive_merge_sort',['../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)'],['../d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534',1,'sorting::non_recursive_merge_sort(const Iterator first, const size_t n)'],['../d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last)']]], ['non_5frecursive_5fmerge_5fsort_2ecpp_1148',['non_recursive_merge_sort.cpp',['../d0/db6/non__recursive__merge__sort_8cpp.html',1,'']]], @@ -59,7 +59,7 @@ var searchData= ['nqueensol_1168',['NQueenSol',['../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108',1,'backtracking::n_queens_all_solutions']]], ['nth_5felement_1169',['nth_element',['http://en.cppreference.com/w/cpp/algorithm/nth_element.html',0,'std']]], ['nullptr_5ft_1170',['nullptr_t',['http://en.cppreference.com/w/cpp/types/nullptr_t.html',0,'std']]], - ['num_5fchars_1171',['NUM_CHARS',['../d0/d6e/classdata__structure_1_1trie.html#a3c243c5c7221799ea5edae04c9c45129',1,'data_structure::trie']]], + ['num_5fchars_1171',['NUM_CHARS',['../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191',1,'data_structures::trie']]], ['num_5fdigits_1172',['num_digits',['../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93',1,'large_number']]], ['num_5fget_1173',['num_get',['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get'],['http://en.cppreference.com/w/cpp/locale/num_get/num_get.html',0,'std::num_get::num_get()']]], ['num_5fput_1174',['num_put',['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put'],['http://en.cppreference.com/w/cpp/locale/num_put/num_put.html',0,'std::num_put::num_put()']]], diff --git a/search/classes_12.js b/search/classes_12.js index 4d5e4a8ad..e77c6027c 100644 --- a/search/classes_12.js +++ b/search/classes_12.js @@ -10,9 +10,9 @@ var searchData= ['shared_5ffuture_2526',['shared_future',['http://en.cppreference.com/w/cpp/thread/shared_future.html',0,'std']]], ['shared_5flock_2527',['shared_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock.html',0,'std']]], ['shared_5fptr_2528',['shared_ptr',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20data_5fstructure_3a_3anode_20_3e_2529',['shared_ptr< data_structure::Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20data_5fstructure_3a_3atrie_20_3e_2530',['shared_ptr< data_structure::trie >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], - ['shared_5fptr_3c_20data_5fstructure_3a_3atrie_20_3e_2c_20num_5fchars_3c_3c_201_20_3e_2531',['shared_ptr< data_structure::trie >, NUM_CHARS<< 1 >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['shared_5fptr_3c_20data_5fstructures_3a_3anode_20_3e_2529',['shared_ptr< data_structures::Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5fptr_3c_20data_5fstructures_3a_3atrie_20_3e_2530',['shared_ptr< data_structures::trie >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5fptr_3c_20data_5fstructures_3a_3atrie_20_3e_2c_20num_5fchars_3c_3c_201_20_3e_2531',['shared_ptr< data_structures::trie >, NUM_CHARS<< 1 >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], ['shared_5fptr_3c_20node_20_3e_2532',['shared_ptr< Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], ['shared_5fptr_3c_20struct_20node_20_3e_2533',['shared_ptr< struct Node >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], ['shared_5fptr_3c_20trie_3a_3atrienode_20_3e_2534',['shared_ptr< Trie::TrieNode >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], @@ -20,7 +20,7 @@ var searchData= ['shuffle_5forder_5fengine_2536',['shuffle_order_engine',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std']]], ['sig_5fatomic_5ft_2537',['sig_atomic_t',['http://en.cppreference.com/w/cpp/utility/program/sig_atomic_t.html',0,'std']]], ['size_5ft_2538',['size_t',['http://en.cppreference.com/w/cpp/types/size_t.html',0,'std']]], - ['skiplist_2539',['SkipList',['../d1/d46/classdata__structure_1_1_skip_list.html',1,'data_structure']]], + ['skiplist_2539',['SkipList',['../d4/d90/classdata__structures_1_1_skip_list.html',1,'data_structures']]], ['smatch_2540',['smatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std']]], ['solution_2541',['Solution',['../dd/d4f/class_solution.html',1,'']]], ['sregex_5fiterator_2542',['sregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std']]], diff --git a/search/classes_13.js b/search/classes_13.js index 154466cbd..0da4cb060 100644 --- a/search/classes_13.js +++ b/search/classes_13.js @@ -15,7 +15,7 @@ var searchData= ['tower_2578',['tower',['../d2/d2c/structtower.html',1,'']]], ['treat_5fas_5ffloating_5fpoint_2579',['treat_as_floating_point',['http://en.cppreference.com/w/cpp/chrono/treat_as_floating_point.html',0,'std::chrono']]], ['tree_2580',['Tree',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html',1,'range_queries::heavy_light_decomposition']]], - ['trie_2581',['trie',['../d0/d6e/classdata__structure_1_1trie.html',1,'data_structure::trie'],['../dd/d2f/class_trie.html',1,'Trie']]], + ['trie_2581',['trie',['../d0/d3e/classdata__structures_1_1trie.html',1,'data_structures::trie'],['../dd/d2f/class_trie.html',1,'Trie']]], ['trienode_2582',['TrieNode',['../de/d48/struct_trie_1_1_trie_node.html',1,'Trie']]], ['true_5ftype_2583',['true_type',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]], ['try_5fto_5flock_5ft_2584',['try_to_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], diff --git a/search/classes_15.js b/search/classes_15.js index c2c26ad26..bc68f463b 100644 --- a/search/classes_15.js +++ b/search/classes_15.js @@ -3,7 +3,7 @@ var searchData= ['va_5flist_2621',['va_list',['http://en.cppreference.com/w/cpp/utility/variadic/va_list.html',0,'']]], ['valarray_2622',['valarray',['http://en.cppreference.com/w/cpp/numeric/valarray.html',0,'std']]], ['valarray_3c_20double_20_3e_2623',['valarray< double >',['http://en.cppreference.com/w/cpp/numeric/valarray.html',0,'std']]], - ['value_5fcompare_2624',['value_compare',['http://en.cppreference.com/w/cpp/container/multimap/value_compare.html',0,'std::multimap< K, T >::value_compare'],['http://en.cppreference.com/w/cpp/container/map/value_compare.html',0,'std::map< K, T >::value_compare']]], + ['value_5fcompare_2624',['value_compare',['http://en.cppreference.com/w/cpp/container/map/value_compare.html',0,'std::map< K, T >::value_compare'],['http://en.cppreference.com/w/cpp/container/multimap/value_compare.html',0,'std::multimap< K, T >::value_compare']]], ['vector_2625',['vector',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20bool_20_3e_2626',['vector< bool >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20double_20_3e_2627',['vector< double >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], @@ -11,7 +11,7 @@ var searchData= ['vector_3c_20int_20_3e_2629',['vector< int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20machine_5flearning_3a_3aneural_5fnetwork_3a_3alayers_3a_3adenselayer_20_3e_2630',['vector< machine_learning::neural_network::layers::DenseLayer >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20std_3a_3alist_3c_20int_20_3e_20_3e_2631',['vector< std::list< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3ashared_5fptr_3c_20data_5fstructure_3a_3anode_20_3e_20_3e_2632',['vector< std::shared_ptr< data_structure::Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3ashared_5fptr_3c_20data_5fstructures_3a_3anode_20_3e_20_3e_2632',['vector< std::shared_ptr< data_structures::Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20std_3a_3ashared_5fptr_3c_20node_20_3e_20_3e_2633',['vector< std::shared_ptr< Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20std_3a_3atuple_3c_20int_2c_20int_2c_20int_20_3e_20_3e_2634',['vector< std::tuple< int, int, int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20std_3a_3avalarray_3c_20double_20_3e_20_3e_2635',['vector< std::valarray< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], diff --git a/search/classes_d.js b/search/classes_d.js index 3b245a943..e22995a3b 100644 --- a/search/classes_d.js +++ b/search/classes_d.js @@ -7,7 +7,7 @@ var searchData= ['nested_5fexception_2433',['nested_exception',['http://en.cppreference.com/w/cpp/error/nested_exception.html',0,'std']]], ['neuralnetwork_2434',['NeuralNetwork',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html',1,'machine_learning::neural_network']]], ['new_5fhandler_2435',['new_handler',['http://en.cppreference.com/w/cpp/memory/new/new_handler.html',0,'std']]], - ['node_2436',['Node',['../d3/d6f/structdata__structure_1_1_node.html',1,'data_structure::Node'],['../d5/da1/structnode.html',1,'node< Kind >'],['../db/d8b/struct_node.html',1,'Node']]], + ['node_2436',['Node',['../d9/d49/structdata__structures_1_1_node.html',1,'data_structures::Node'],['../d5/da1/structnode.html',1,'node< Kind >'],['../db/d8b/struct_node.html',1,'Node']]], ['node_3c_20type_20_3e_2437',['node< Type >',['../d5/da1/structnode.html',1,'']]], ['normal_5fdistribution_2438',['normal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution.html',0,'std']]], ['not_5fequal_5fto_2439',['not_equal_to',['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std']]], diff --git a/search/functions_12.js b/search/functions_12.js index e731d5be4..9dce40970 100644 --- a/search/functions_12.js +++ b/search/functions_12.js @@ -8,7 +8,7 @@ var searchData= ['random_5fshuffle_3839',['random_shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std']]], ['random_5ftests_3840',['random_tests',['../de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f',1,'fibonacci_search.cpp']]], ['randomized_5fbogosort_3841',['randomized_bogosort',['../d5/d91/namespacesorting.html#a4c5bd73ffb6082f63dc57d8dcc76794f',1,'sorting']]], - ['randomlevel_3842',['randomLevel',['../d1/d46/classdata__structure_1_1_skip_list.html#a10800369c9efa08dd86de0ce552c874e',1,'data_structure::SkipList']]], + ['randomlevel_3842',['randomLevel',['../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4',1,'data_structures::SkipList']]], ['range_5ferror_3843',['range_error',['http://en.cppreference.com/w/cpp/error/range_error.html',0,'std::range_error']]], ['ranlux24_3844',['ranlux24',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::ranlux24']]], ['ranlux24_5fbase_3845',['ranlux24_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::ranlux24_base']]], diff --git a/search/functions_13.js b/search/functions_13.js index fd7fd76db..c79342573 100644 --- a/search/functions_13.js +++ b/search/functions_13.js @@ -14,9 +14,9 @@ var searchData= ['scientific_3922',['scientific',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], ['scoped_5fallocator_5fadaptor_3923',['scoped_allocator_adaptor',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/scoped_allocator_adaptor.html',0,'std::scoped_allocator_adaptor']]], ['scs_3924',['scs',['../d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6',1,'dynamic_programming::shortest_common_supersequence']]], - ['search_3925',['search',['../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206',1,'Trie::search()'],['../d0/d6e/classdata__structure_1_1trie.html#ae9c45cbd4b52db9a39d27e12ca912abc',1,'data_structure::trie::search(const std::shared_ptr< trie > &root, const std::string &str, int index)'],['../d0/d6e/classdata__structure_1_1trie.html#adff53199439d06776ebbaf917741774f',1,'data_structure::trie::search(const std::string &str, int index)'],['http://en.cppreference.com/w/cpp/algorithm/search.html',0,'std::search()']]], + ['search_3925',['search',['../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206',1,'Trie::search()'],['../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63',1,'data_structures::trie::search(const std::shared_ptr< trie > &root, const std::string &str, int index)'],['../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d',1,'data_structures::trie::search(const std::string &str, int index)'],['http://en.cppreference.com/w/cpp/algorithm/search.html',0,'std::search()']]], ['search_5fn_3926',['search_n',['http://en.cppreference.com/w/cpp/algorithm/search_n.html',0,'std']]], - ['searchelement_3927',['searchElement',['../d1/d46/classdata__structure_1_1_skip_list.html#a7cda6370f8bd2b6d1db28bd5ca586a21',1,'data_structure::SkipList']]], + ['searchelement_3927',['searchElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a2249e3ab2f8a0f2334b90635202de4f2',1,'data_structures::SkipList']]], ['searchingprober_3928',['searchingProber',['../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6',1,'double_hashing::searchingProber()'],['../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77',1,'linear_probing::searchingProber()'],['../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6',1,'quadratic_probing::searchingProber()']]], ['seconds_3929',['seconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::seconds']]], ['seed_3930',['seed',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937_64::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux24_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux48::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::discard_block_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mersenne_twister_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/seed.html',0,'std::independent_bits_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux48_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::shuffle_order_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux24::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::linear_congruential_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::knuth_b::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand0::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::subtract_with_carry_engine::seed()']]], @@ -88,7 +88,7 @@ var searchData= ['single_5fpredict_3996',['single_predict',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ac130322a5abb1ff763b7c1a55405a35e',1,'machine_learning::neural_network::NeuralNetwork']]], ['sinh_3997',['sinh',['http://en.cppreference.com/w/cpp/numeric/math/sinh.html',0,'std']]], ['size_3998',['size',['http://en.cppreference.com/w/cpp/container/dynarray/size.html',0,'std::dynarray::size()'],['http://en.cppreference.com/w/cpp/container/vector/size.html',0,'std::vector::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::match_results::size()'],['http://en.cppreference.com/w/cpp/container/multiset/size.html',0,'std::multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::size()'],['http://en.cppreference.com/w/cpp/container/set/size.html',0,'std::set::size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/size.html',0,'std::unordered_map::size()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/size.html',0,'std::initializer_list::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wsmatch::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::smatch::size()'],['http://en.cppreference.com/w/cpp/container/stack/size.html',0,'std::stack::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/size.html',0,'std::unordered_multimap::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wcmatch::size()'],['http://en.cppreference.com/w/cpp/container/deque/size.html',0,'std::deque::size()'],['http://en.cppreference.com/w/cpp/container/queue/size.html',0,'std::queue::size()'],['http://en.cppreference.com/w/cpp/utility/bitset/size.html',0,'std::bitset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::size()'],['http://en.cppreference.com/w/cpp/container/priority_queue/size.html',0,'std::priority_queue::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/size.html',0,'std::unordered_multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::size()'],['http://en.cppreference.com/w/cpp/container/list/size.html',0,'std::list::size()'],['http://en.cppreference.com/w/cpp/container/map/size.html',0,'std::map::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::cmatch::size()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/size.html',0,'std::seed_seq::size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/size.html',0,'std::unordered_set::size()'],['http://en.cppreference.com/w/cpp/container/multimap/size.html',0,'std::multimap::size()'],['http://en.cppreference.com/w/cpp/container/array/size.html',0,'std::array::size()']]], - ['skiplist_3999',['SkipList',['../d1/d46/classdata__structure_1_1_skip_list.html#aed414cf88cfacb9554ecfd184b03fe04',1,'data_structure::SkipList']]], + ['skiplist_3999',['SkipList',['../d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4',1,'data_structures::SkipList']]], ['skipws_4000',['skipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]], ['sleep_5ffor_4001',['sleep_for',['http://en.cppreference.com/w/cpp/thread/sleep_for.html',0,'std::this_thread']]], ['sleep_5funtil_4002',['sleep_until',['http://en.cppreference.com/w/cpp/thread/sleep_until.html',0,'std::this_thread']]], diff --git a/search/functions_14.js b/search/functions_14.js index fe4e7eccb..a754e9ff9 100644 --- a/search/functions_14.js +++ b/search/functions_14.js @@ -68,7 +68,7 @@ var searchData= ['transpose_4162',['transpose',['../d8/d77/namespacemachine__learning.html#ac7d9b358f1ef2ba2a1d475a5452ec41f',1,'machine_learning']]], ['tree_4163',['Tree',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1',1,'range_queries::heavy_light_decomposition::Tree']]], ['trianglearea_4164',['TriangleArea',['../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc',1,'smallest_circle.cpp']]], - ['trie_4165',['trie',['../d0/d6e/classdata__structure_1_1trie.html#a36a41761149fd541850834aef29f9b7f',1,'data_structure::trie::trie()'],['../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908',1,'Trie::Trie()']]], + ['trie_4165',['trie',['../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8',1,'data_structures::trie::trie()'],['../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908',1,'Trie::Trie()']]], ['truename_4166',['truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::truename()']]], ['trunc_4167',['trunc',['http://en.cppreference.com/w/cpp/numeric/math/trunc.html',0,'std']]], ['try_5flock_4168',['try_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock.html',0,'std::unique_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/try_lock.html',0,'std::recursive_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock.html',0,'std::recursive_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock.html',0,'std::shared_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock.html',0,'std::timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/try_lock.html',0,'std::mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock.html',0,'std::shared_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/try_lock.html',0,'std::try_lock()']]], diff --git a/search/functions_3.js b/search/functions_3.js index 3a35c7a4d..d2471311b 100644 --- a/search/functions_3.js +++ b/search/functions_3.js @@ -18,7 +18,7 @@ var searchData= ['cend_28int_29_3008',['cend(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::cend(int)()']]], ['chain_5fquery_3009',['chain_query',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24',1,'range_queries::heavy_light_decomposition::HLD']]], ['change_5froot_3010',['change_root',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0',1,'range_queries::heavy_light_decomposition::Tree']]], - ['char_5fto_5fint_3011',['char_to_int',['../d0/d6e/classdata__structure_1_1trie.html#aeb479dcc88415154fb61c2fbb589d6d0',1,'data_structure::trie']]], + ['char_5fto_5fint_3011',['char_to_int',['../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988',1,'data_structures::trie']]], ['check_5fif_5fequal_3012',['check_if_equal',['../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd',1,'string_search']]], ['check_5fsize_5fmatch_3013',['check_size_match',['../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56',1,'machine_learning::adaline']]], ['check_5ftermination_3014',['check_termination',['../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377',1,'durand_kerner_roots.cpp']]], diff --git a/search/functions_4.js b/search/functions_4.js index 0a17b37cf..302d914b7 100644 --- a/search/functions_4.js +++ b/search/functions_4.js @@ -14,10 +14,10 @@ var searchData= ['default_5fdelete_3080',['default_delete',['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete']]], ['default_5ferror_5fcondition_3081',['default_error_condition',['http://en.cppreference.com/w/cpp/error/error_code/default_error_condition.html',0,'std::error_code::default_error_condition()'],['http://en.cppreference.com/w/cpp/error/error_category/default_error_condition.html',0,'std::error_category::default_error_condition()']]], ['defaultfloat_3082',['defaultfloat',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], - ['deleteelement_3083',['deleteElement',['../d1/d46/classdata__structure_1_1_skip_list.html#a4b8eb18c9ca24f53e9de91b74febd666',1,'data_structure::SkipList']]], + ['deleteelement_3083',['deleteElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0',1,'data_structures::SkipList']]], ['deletekey_3084',['deleteKey',['../d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29',1,'MinHeap']]], ['deletenode_3085',['deleteNode',['../d8/dee/avltree_8cpp.html#a8286388b0743a716145639df3a33e541',1,'avltree.cpp']]], - ['deletestring_3086',['deleteString',['../d0/d6e/classdata__structure_1_1trie.html#a98a0d54a781a680903eac14085fcbc2e',1,'data_structure::trie']]], + ['deletestring_3086',['deleteString',['../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab',1,'data_structures::trie']]], ['denorm_5fmin_3087',['denorm_min',['http://en.cppreference.com/w/cpp/types/numeric_limits/denorm_min.html',0,'std::numeric_limits']]], ['denselayer_3088',['DenseLayer',['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a51c2b942ecf10625780c6bb9d5c50ff1',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &neurons, const std::string &activation, const std::pair< size_t, size_t > &kernal_shape, const bool &random_kernal)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a04b8e21316458436c8851959928c3964',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &neurons, const std::string &activation, const std::vector< std::valarray< double >> &kernal)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const DenseLayer &layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(DenseLayer &&)=default']]], ['densities_3089',['densities',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::densities()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::densities()']]], @@ -40,7 +40,7 @@ var searchData= ['discard_5fblock_5fengine_3106',['discard_block_engine',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::discard_block_engine']]], ['discrete_5fdistribution_3107',['discrete_distribution',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/discrete_distribution.html',0,'std::discrete_distribution']]], ['display_3108',['display',['../db/da9/classqueue.html#a26f48801df462ade003b50739196fa4c',1,'queue::display()'],['../d1/dc2/classstack.html#a67f65710c376f67d1ba3bde45a9cb628',1,'stack::display()'],['../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed',1,'hash_chain::display()'],['../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd',1,'double_hashing::display()'],['../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635',1,'linear_probing::display()'],['../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357',1,'quadratic_probing::display()']]], - ['displaylist_3109',['displayList',['../d1/d46/classdata__structure_1_1_skip_list.html#a1574d62ca0a5a821601d246c07215335',1,'data_structure::SkipList']]], + ['displaylist_3109',['displayList',['../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c',1,'data_structures::SkipList']]], ['distance_3110',['distance',['http://en.cppreference.com/w/cpp/iterator/distance.html',0,'std']]], ['div_3111',['div',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]], ['do_5falways_5fnoconv_3112',['do_always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::do_always_noconv()']]], diff --git a/search/functions_9.js b/search/functions_9.js index 9366d6388..8e78aa8c7 100644 --- a/search/functions_9.js +++ b/search/functions_9.js @@ -18,11 +18,11 @@ var searchData= ['inner_5fproduct_3417',['inner_product',['http://en.cppreference.com/w/cpp/algorithm/inner_product.html',0,'std']]], ['inplace_5fmerge_3418',['inplace_merge',['http://en.cppreference.com/w/cpp/algorithm/inplace_merge.html',0,'std']]], ['insameunion_3419',['InSameUnion',['../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985',1,'disjoint_set.cpp']]], - ['insert_3420',['insert',['http://en.cppreference.com/w/cpp/container/vector/insert.html',0,'std::vector::insert()'],['http://en.cppreference.com/w/cpp/container/multiset/insert.html',0,'std::multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::string::insert()'],['http://en.cppreference.com/w/cpp/container/set/insert.html',0,'std::set::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_map/insert.html',0,'std::unordered_map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/insert.html',0,'std::unordered_multimap::insert()'],['http://en.cppreference.com/w/cpp/container/deque/insert.html',0,'std::deque::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::basic_string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::wstring::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/insert.html',0,'std::unordered_multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u16string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u32string::insert()'],['http://en.cppreference.com/w/cpp/container/list/insert.html',0,'std::list::insert()'],['http://en.cppreference.com/w/cpp/container/map/insert.html',0,'std::map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_set/insert.html',0,'std::unordered_set::insert()'],['http://en.cppreference.com/w/cpp/container/multimap/insert.html',0,'std::multimap::insert()'],['../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2',1,'Trie::insert()'],['../d0/d6e/classdata__structure_1_1trie.html#a8b9a51c90291a3402904c8cd16bbe30d',1,'data_structure::trie::insert()'],['../d8/dee/avltree_8cpp.html#aa7cd8a68075fae1c33df41233c1bed6a',1,'insert(): avltree.cpp']]], + ['insert_3420',['insert',['http://en.cppreference.com/w/cpp/container/vector/insert.html',0,'std::vector::insert()'],['http://en.cppreference.com/w/cpp/container/multiset/insert.html',0,'std::multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::string::insert()'],['http://en.cppreference.com/w/cpp/container/set/insert.html',0,'std::set::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_map/insert.html',0,'std::unordered_map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/insert.html',0,'std::unordered_multimap::insert()'],['http://en.cppreference.com/w/cpp/container/deque/insert.html',0,'std::deque::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::basic_string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::wstring::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/insert.html',0,'std::unordered_multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u16string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u32string::insert()'],['http://en.cppreference.com/w/cpp/container/list/insert.html',0,'std::list::insert()'],['http://en.cppreference.com/w/cpp/container/map/insert.html',0,'std::map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_set/insert.html',0,'std::unordered_set::insert()'],['http://en.cppreference.com/w/cpp/container/multimap/insert.html',0,'std::multimap::insert()'],['../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2',1,'Trie::insert()'],['../d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546',1,'data_structures::trie::insert()'],['../d8/dee/avltree_8cpp.html#aa7cd8a68075fae1c33df41233c1bed6a',1,'insert(): avltree.cpp']]], ['insert_5fafter_3421',['insert_after',['http://en.cppreference.com/w/cpp/container/forward_list/insert_after.html',0,'std::forward_list']]], ['insert_5felement_3422',['insert_element',['../d8/d77/namespacemachine__learning.html#a725d4ccceda4f32c96348ba1d593cd3c',1,'machine_learning']]], ['insertatthebeginning_3423',['insertAtTheBeginning',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df',1,'linkedlist_implentation_usingarray.cpp']]], - ['insertelement_3424',['insertElement',['../d1/d46/classdata__structure_1_1_skip_list.html#a1c6c04c0fb45ea2e2378de7ab9cb465b',1,'data_structure::SkipList']]], + ['insertelement_3424',['insertElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9',1,'data_structures::SkipList']]], ['inserter_3425',['inserter',['http://en.cppreference.com/w/cpp/iterator/inserter.html',0,'std']]], ['insertionsort_3426',['insertionSort',['../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9',1,'sorting::insertionSort(T *arr, int n)'],['../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f',1,'sorting::insertionSort(std::vector< T > *arr)']]], ['insertkey_3427',['insertKey',['../d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82',1,'MinHeap']]], diff --git a/search/functions_e.js b/search/functions_e.js index 5af57077a..6cebce028 100644 --- a/search/functions_e.js +++ b/search/functions_e.js @@ -23,7 +23,7 @@ var searchData= ['nexttoward_3657',['nexttoward',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]], ['no_5foccurence_5ftests_3658',['no_occurence_tests',['../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d',1,'fibonacci_search.cpp']]], ['noboolalpha_3659',['noboolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]], - ['node_3660',['Node',['../d3/d6f/structdata__structure_1_1_node.html#af7f19e61975f1362b22d1488bee87077',1,'data_structure::Node']]], + ['node_3660',['Node',['../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78',1,'data_structures::Node']]], ['non_5frecursive_5fmerge_5fsort_3661',['non_recursive_merge_sort',['../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)'],['../d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534',1,'sorting::non_recursive_merge_sort(const Iterator first, const size_t n)'],['../d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last)']]], ['none_3662',['none',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], ['none_5fof_3663',['none_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], diff --git a/search/namespaces_3.js b/search/namespaces_3.js index aa543600d..7eacb0631 100644 --- a/search/namespaces_3.js +++ b/search/namespaces_3.js @@ -1,6 +1,6 @@ var searchData= [ - ['data_5fstructure_2678',['data_structure',['../d1/db4/namespacedata__structure.html',1,'']]], + ['data_5fstructures_2678',['data_structures',['../d5/d3c/namespacedata__structures.html',1,'']]], ['double_5fhashing_2679',['double_hashing',['../d0/d65/namespacedouble__hashing.html',1,'']]], ['dynamic_5fprogramming_2680',['dynamic_programming',['../dd/d24/namespacedynamic__programming.html',1,'']]] ]; diff --git a/search/variables_1.js b/search/variables_1.js index abd22f98b..4ff33d0c0 100644 --- a/search/variables_1.js +++ b/search/variables_1.js @@ -2,6 +2,6 @@ var searchData= [ ['accuracy_4415',['accuracy',['../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3',1,'machine_learning::adaline']]], ['adj_4416',['adj',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f',1,'graph::is_graph_bipartite::Graph']]], - ['arr_4417',['arr',['../d0/d6e/classdata__structure_1_1trie.html#aa5b8dc9452c3f7a805a4cb17034d6549',1,'data_structure::trie']]], + ['arr_4417',['arr',['../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b',1,'data_structures::trie']]], ['availarray_4418',['AvailArray',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c',1,'linkedlist_implentation_usingarray.cpp']]] ]; diff --git a/search/variables_12.js b/search/variables_12.js index f13fc2527..3c71cc76f 100644 --- a/search/variables_12.js +++ b/search/variables_12.js @@ -1,5 +1,5 @@ var searchData= [ - ['value_4475',['value',['../d3/d6f/structdata__structure_1_1_node.html#a24580ec4e79f7bb82e55a9c4d8369a6e',1,'data_structure::Node']]], + ['value_4475',['value',['../d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731',1,'data_structures::Node']]], ['values_4476',['values',['../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9',1,'tower']]] ]; diff --git a/search/variables_5.js b/search/variables_5.js index 99cc47db5..aebce81c4 100644 --- a/search/variables_5.js +++ b/search/variables_5.js @@ -2,5 +2,5 @@ var searchData= [ ['factors_4423',['factors',['../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b',1,'prime_factorization.cpp']]], ['fib_5fb_4424',['fib_b',['../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de',1,'matrix_exponentiation.cpp']]], - ['forward_4425',['forward',['../d3/d6f/structdata__structure_1_1_node.html#a0e80ff706591f718f763c5a7feaa2394',1,'data_structure::Node']]] + ['forward_4425',['forward',['../d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e',1,'data_structures::Node']]] ]; diff --git a/search/variables_6.js b/search/variables_6.js index e7e746da4..0b31e29f2 100644 --- a/search/variables_6.js +++ b/search/variables_6.js @@ -6,6 +6,6 @@ var searchData= ['harr_4429',['harr',['../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e',1,'MinHeap']]], ['hashtab_4430',['hashtab',['../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d',1,'hash_search.cpp']]], ['head_4431',['head',['../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0',1,'hash_chain']]], - ['header_4432',['header',['../d1/d46/classdata__structure_1_1_skip_list.html#a7aed753e3b47953229f5ac94f0fc9aad',1,'data_structure::SkipList']]], + ['header_4432',['header',['../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16',1,'data_structures::SkipList']]], ['heap_5fsize_4433',['heap_size',['../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913',1,'MinHeap']]] ]; diff --git a/search/variables_7.js b/search/variables_7.js index e8b47b561..4e32d5d72 100644 --- a/search/variables_7.js +++ b/search/variables_7.js @@ -1,5 +1,5 @@ var searchData= [ - ['isendofword_4434',['isEndofWord',['../d0/d6e/classdata__structure_1_1trie.html#a0bc4f25351be960f3570e562cfb4a070',1,'data_structure::trie']]], + ['isendofword_4434',['isEndofWord',['../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6',1,'data_structures::trie']]], ['isprime_4435',['isprime',['../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23',1,'prime_factorization.cpp']]] ]; diff --git a/search/variables_8.js b/search/variables_8.js index 2dde95ba4..74d716197 100644 --- a/search/variables_8.js +++ b/search/variables_8.js @@ -1,4 +1,4 @@ var searchData= [ - ['key_4436',['key',['../d3/d6f/structdata__structure_1_1_node.html#a089ebc844c81777652d4e577be0739c8',1,'data_structure::Node::key()'],['../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248',1,'double_hashing::Entry::key()'],['../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a',1,'linear_probing::Entry::key()'],['../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8',1,'quadratic_probing::Entry::key()'],['../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c',1,'list::key()']]] + ['key_4436',['key',['../d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68',1,'data_structures::Node::key()'],['../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248',1,'double_hashing::Entry::key()'],['../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a',1,'linear_probing::Entry::key()'],['../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8',1,'quadratic_probing::Entry::key()'],['../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c',1,'list::key()']]] ]; diff --git a/search/variables_9.js b/search/variables_9.js index 93e633aa7..3d91016f2 100644 --- a/search/variables_9.js +++ b/search/variables_9.js @@ -1,5 +1,5 @@ var searchData= [ ['label_4437',['label',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a722cc7cf2c3e4d15583601a48b09776f',1,'range_queries::heavy_light_decomposition::HLD']]], - ['level_4438',['level',['../d1/d46/classdata__structure_1_1_skip_list.html#ae0c022174510fd9ca1b84d8e996cd1a5',1,'data_structure::SkipList::level()'],['../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3',1,'graph::RootedTree::level()']]] + ['level_4438',['level',['../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650',1,'data_structures::SkipList::level()'],['../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3',1,'graph::RootedTree::level()']]] ]; diff --git a/search/variables_a.js b/search/variables_a.js index af323bf18..c4378b56c 100644 --- a/search/variables_a.js +++ b/search/variables_a.js @@ -3,6 +3,6 @@ var searchData= ['mat_5fsize_4439',['mat_size',['../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54',1,'matrix_exponentiation.cpp']]], ['max_5fiter_4440',['MAX_ITER',['../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1',1,'adaline_learning.cpp']]], ['max_5fiterations_4441',['MAX_ITERATIONS',['../de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d',1,'newton_raphson_method.cpp']]], - ['max_5flevel_4442',['MAX_LEVEL',['../d1/db4/namespacedata__structure.html#a039855c4d1684de1fec104057df9f26d',1,'data_structure']]], + ['max_5flevel_4442',['MAX_LEVEL',['../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a',1,'data_structures']]], ['min_5fdistance_4443',['MIN_DISTANCE',['../d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786',1,'machine_learning']]] ]; diff --git a/search/variables_b.js b/search/variables_b.js index 138e01fb9..fdf8da348 100644 --- a/search/variables_b.js +++ b/search/variables_b.js @@ -3,5 +3,5 @@ var searchData= ['n_4444',['n',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef',1,'graph::is_graph_bipartite::Graph']]], ['neighbors_4445',['neighbors',['../dc/d61/classgraph_1_1_graph.html#afe3c12683248e50a7a1688b40156a842',1,'graph::Graph']]], ['next_4446',['next',['../d5/da1/structnode.html#a135f25acadfbba644f848f1aa18d8350',1,'node::next()'],['../dd/d1c/classhash__chain.html#a48236d44349c3ebce4774b706f4f8a0f',1,'hash_chain::next()'],['../d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f',1,'list::next()']]], - ['num_5fchars_4447',['NUM_CHARS',['../d0/d6e/classdata__structure_1_1trie.html#a3c243c5c7221799ea5edae04c9c45129',1,'data_structure::trie']]] + ['num_5fchars_4447',['NUM_CHARS',['../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191',1,'data_structures::trie']]] ]; diff --git a/search/variables_c.js b/search/variables_c.js index 627f42c96..63632f821 100644 --- a/search/variables_c.js +++ b/search/variables_c.js @@ -3,5 +3,5 @@ var searchData= ['parent_4448',['parent',['../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43',1,'graph::RootedTree']]], ['prime_4449',['prime',['../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95',1,'primes_up_to_billion.cpp']]], ['prime_5fnumbers_4450',['prime_numbers',['../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe',1,'prime_factorization.cpp']]], - ['probability_4451',['PROBABILITY',['../d1/db4/namespacedata__structure.html#a38234f668624bca86341240f34a95193',1,'data_structure']]] + ['probability_4451',['PROBABILITY',['../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61',1,'data_structures']]] ];
int data_structure::SkipList::randomLevel int data_structures::SkipList::randomLevel ( ) - + @@ -433,10 +433,10 @@ Here is the call graph for this function:
Returns
pointer to the value of the node
166  {
-
167  std::shared_ptr<Node> x = header;
+
167  std::shared_ptr<Node> x = header;
168  std::cout << "Searching for " << key << std::endl;
169 
-
170  for (int i = level; i >= 0; i--) {
+
170  for (int i = level; i >= 0; i--) {
171  while (x->forward[i] && x->forward[i]->key < key) x = x->forward[i];
172  }
173 
@@ -452,7 +452,7 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
@@ -463,22 +463,22 @@ Here is the call graph for this function:
-
data_structure::PROBABILITY
constexpr float PROBABILITY
Current probability for "coin toss".
Definition: skip_list.cpp:28
-
data_structure::SkipList::level
int level
Maximum level of the skiplist.
Definition: skip_list.cpp:56
+
data_structures::SkipList::level
int level
Maximum level of the skiplist.
Definition: skip_list.cpp:56
+
data_structures::MAX_LEVEL
constexpr int MAX_LEVEL
Maximum level of skip list.
Definition: skip_list.cpp:27
node
Definition: avltree.cpp:13
Node
Definition: linkedlist_implentation_usingarray.cpp:14
std::array
STL class.
-
data_structure::SkipList::randomLevel
int randomLevel()
Definition: skip_list.cpp:75
std::rand
T rand(T... args)
std::endl
T endl(T... args)
-
data_structure::SkipList::header
std::shared_ptr< Node > header
Pointer to the header node.
Definition: skip_list.cpp:57
-
data_structure::MAX_LEVEL
constexpr int MAX_LEVEL
Maximum level of skip list.
Definition: skip_list.cpp:27
+
data_structures::SkipList::randomLevel
int randomLevel()
Definition: skip_list.cpp:75
+
data_structures::SkipList::header
std::shared_ptr< Node > header
Pointer to the header node.
Definition: skip_list.cpp:57
+
data_structures::PROBABILITY
constexpr float PROBABILITY
Current probability for "coin toss".
Definition: skip_list.cpp:28
diff --git a/d4/d90/classdata__structures_1_1_skip_list.js b/d4/d90/classdata__structures_1_1_skip_list.js new file mode 100644 index 000000000..6e0f28534 --- /dev/null +++ b/d4/d90/classdata__structures_1_1_skip_list.js @@ -0,0 +1,11 @@ +var classdata__structures_1_1_skip_list = +[ + [ "SkipList", "d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4", null ], + [ "deleteElement", "d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0", null ], + [ "displayList", "d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c", null ], + [ "insertElement", "d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9", null ], + [ "randomLevel", "d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4", null ], + [ "searchElement", "d4/d90/classdata__structures_1_1_skip_list.html#a2249e3ab2f8a0f2334b90635202de4f2", null ], + [ "header", "d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16", null ], + [ "level", "d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650", null ] +]; \ No newline at end of file diff --git a/d4/d90/classdata__structures_1_1_skip_list_a2249e3ab2f8a0f2334b90635202de4f2_cgraph.map b/d4/d90/classdata__structures_1_1_skip_list_a2249e3ab2f8a0f2334b90635202de4f2_cgraph.map new file mode 100644 index 000000000..f91fe2c32 --- /dev/null +++ b/d4/d90/classdata__structures_1_1_skip_list_a2249e3ab2f8a0f2334b90635202de4f2_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d4/d90/classdata__structures_1_1_skip_list_a2249e3ab2f8a0f2334b90635202de4f2_cgraph.md5 b/d4/d90/classdata__structures_1_1_skip_list_a2249e3ab2f8a0f2334b90635202de4f2_cgraph.md5 new file mode 100644 index 000000000..cf560d46e --- /dev/null +++ b/d4/d90/classdata__structures_1_1_skip_list_a2249e3ab2f8a0f2334b90635202de4f2_cgraph.md5 @@ -0,0 +1 @@ +b4d16cc29f7e2e6f699ffdda1e704acd \ No newline at end of file diff --git a/d1/d46/classdata__structure_1_1_skip_list_a4b8eb18c9ca24f53e9de91b74febd666_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_a2249e3ab2f8a0f2334b90635202de4f2_cgraph.svg similarity index 55% rename from d1/d46/classdata__structure_1_1_skip_list_a4b8eb18c9ca24f53e9de91b74febd666_cgraph.svg rename to d4/d90/classdata__structures_1_1_skip_list_a2249e3ab2f8a0f2334b90635202de4f2_cgraph.svg index ea850569d..6f0cf9fbe 100644 --- a/d1/d46/classdata__structure_1_1_skip_list_a4b8eb18c9ca24f53e9de91b74febd666_cgraph.svg +++ b/d4/d90/classdata__structures_1_1_skip_list_a2249e3ab2f8a0f2334b90635202de4f2_cgraph.svg @@ -3,19 +3,19 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - - + + -data_structure::SkipList::deleteElement - +data_structures::SkipList::searchElement + Node1 - -data_structure::SkipList -::deleteElement + +data_structures::SkipList +::searchElement @@ -23,16 +23,16 @@ Node2 - -std::endl + +std::endl Node1->Node2 - - + + diff --git a/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.map b/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.map new file mode 100644 index 000000000..3bb4d9bc3 --- /dev/null +++ b/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.md5 b/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.md5 new file mode 100644 index 000000000..5955fbf0f --- /dev/null +++ b/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.md5 @@ -0,0 +1 @@ +4d2d7fdb4639b7eb2e6b9f9cb3052f5e \ No newline at end of file diff --git a/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.svg new file mode 100644 index 000000000..f7978e755 --- /dev/null +++ b/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.svg @@ -0,0 +1,69 @@ + + + + + + +data_structures::SkipList::insertElement + + + +Node1 + + +data_structures::SkipList +::insertElement + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +data_structures::SkipList +::randomLevel + + + + + +Node1->Node3 + + + + + +Node4 + + +std::rand + + + + + +Node3->Node4 + + + + + diff --git a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.map b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.map new file mode 100644 index 000000000..96fb578ce --- /dev/null +++ b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.md5 b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.md5 new file mode 100644 index 000000000..b779cc52f --- /dev/null +++ b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.md5 @@ -0,0 +1 @@ +9c68af3fe9df1b385708afc0787061d8 \ No newline at end of file diff --git a/d1/d46/classdata__structure_1_1_skip_list_a1574d62ca0a5a821601d246c07215335_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg similarity index 56% rename from d1/d46/classdata__structure_1_1_skip_list_a1574d62ca0a5a821601d246c07215335_cgraph.svg rename to d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg index f6c096e6c..768b946ae 100644 --- a/d1/d46/classdata__structure_1_1_skip_list_a1574d62ca0a5a821601d246c07215335_cgraph.svg +++ b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg @@ -3,19 +3,19 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - - + + -data_structure::SkipList::displayList - +data_structures::SkipList::displayList + Node1 - -data_structure::SkipList -::displayList + +data_structures::SkipList +::displayList @@ -23,16 +23,16 @@ Node2 - -std::endl + +std::endl Node1->Node2 - - + + diff --git a/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.map b/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.map new file mode 100644 index 000000000..848b88b4f --- /dev/null +++ b/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.md5 b/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.md5 new file mode 100644 index 000000000..5ed46af3e --- /dev/null +++ b/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.md5 @@ -0,0 +1 @@ +95cab6fb91495582002f6254d98cb111 \ No newline at end of file diff --git a/d1/d46/classdata__structure_1_1_skip_list_a7cda6370f8bd2b6d1db28bd5ca586a21_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.svg similarity index 55% rename from d1/d46/classdata__structure_1_1_skip_list_a7cda6370f8bd2b6d1db28bd5ca586a21_cgraph.svg rename to d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.svg index 66697bdce..ebe9236dc 100644 --- a/d1/d46/classdata__structure_1_1_skip_list_a7cda6370f8bd2b6d1db28bd5ca586a21_cgraph.svg +++ b/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.svg @@ -3,19 +3,19 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - - + + -data_structure::SkipList::searchElement - +data_structures::SkipList::deleteElement + Node1 - -data_structure::SkipList -::searchElement + +data_structures::SkipList +::deleteElement @@ -23,16 +23,16 @@ Node2 - -std::endl + +std::endl Node1->Node2 - - + + diff --git a/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.map b/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.map new file mode 100644 index 000000000..8bd588625 --- /dev/null +++ b/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.md5 b/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.md5 new file mode 100644 index 000000000..3f1b3b15d --- /dev/null +++ b/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.md5 @@ -0,0 +1 @@ +2396e3846fb3588fb1ef809da653a27c \ No newline at end of file diff --git a/d1/d46/classdata__structure_1_1_skip_list_a10800369c9efa08dd86de0ce552c874e_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.svg similarity index 56% rename from d1/d46/classdata__structure_1_1_skip_list_a10800369c9efa08dd86de0ce552c874e_cgraph.svg rename to d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.svg index ff641774f..a63f45ccb 100644 --- a/d1/d46/classdata__structure_1_1_skip_list_a10800369c9efa08dd86de0ce552c874e_cgraph.svg +++ b/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.svg @@ -3,19 +3,19 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - - + + -data_structure::SkipList::randomLevel - +data_structures::SkipList::randomLevel + Node1 - -data_structure::SkipList -::randomLevel + +data_structures::SkipList +::randomLevel @@ -23,16 +23,16 @@ Node2 - -std::rand + +std::rand Node1->Node2 - - + + diff --git a/d5/d1d/structdata__structure_1_1_node__coll__graph.md5 b/d5/d1d/structdata__structure_1_1_node__coll__graph.md5 deleted file mode 100644 index c2f6503af..000000000 --- a/d5/d1d/structdata__structure_1_1_node__coll__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -7eb528aa30a27208c82a461fef52dfc4 \ No newline at end of file diff --git a/d5/d1d/structdata__structure_1_1_node__coll__graph.svg b/d5/d1d/structdata__structure_1_1_node__coll__graph.svg deleted file mode 100644 index 018fe0b91..000000000 --- a/d5/d1d/structdata__structure_1_1_node__coll__graph.svg +++ /dev/null @@ -1,63 +0,0 @@ - - - - - - -data_structure::Node - - - -Node1 - - -data_structure::Node - - - - - -Node3 - - -std::shared_ptr< data -_structure::Node > - - - - - -Node1->Node3 - - - ptr - - - -Node2 - - -std::vector< std::shared -_ptr< data_structure::Node > > - - - - - -Node2->Node1 - - - forward - - - -Node3->Node2 - - - elements - - - diff --git a/d1/db4/namespacedata__structure.html b/d5/d3c/namespacedata__structures.html similarity index 78% rename from d1/db4/namespacedata__structure.html rename to d5/d3c/namespacedata__structures.html index 6e7701822..86f5414b0 100644 --- a/d1/db4/namespacedata__structure.html +++ b/d5/d3c/namespacedata__structures.html @@ -5,7 +5,7 @@ -Algorithms_in_C++: data_structure Namespace Reference +Algorithms_in_C++: data_structures Namespace Reference @@ -71,7 +71,7 @@ $(function() {
@@ -94,33 +94,33 @@ $(document).ready(function(){initNavTree('d1/db4/namespacedata__structure.html', Classes | Variables
-
data_structure Namespace Reference
+
data_structures Namespace Reference

Data-structure algorithms. -More...

+More...

void* data_structure::SkipList::searchElement void* data_structures::SkipList::searchElement ( int  key)
- + - + - - + +

Classes

struct  Node
struct  Node
 
class  SkipList
class  SkipList
 
class  trie
 Trie implementation for small-case English alphabets a-z More...
class  trie
 Trie implementation for small-case English alphabets a-z More...
 
- - - - - - + + + + + +

Variables

-constexpr int MAX_LEVEL = 2
 Maximum level of skip list.
 
-constexpr float PROBABILITY = 0.5
 Current probability for "coin toss".
 
+constexpr int MAX_LEVEL = 2
 Maximum level of skip list.
 
+constexpr float PROBABILITY = 0.5
 Current probability for "coin toss".
 

Detailed Description

Data-structure algorithms.

@@ -129,7 +129,7 @@ constexpr float 
 diff --git a/d5/d3c/namespacedata__structures.js b/d5/d3c/namespacedata__structures.js new file mode 100644 index 000000000..471dc80cd --- /dev/null +++ b/d5/d3c/namespacedata__structures.js @@ -0,0 +1,6 @@ +var namespacedata__structures = +[ + [ "Node", "d9/d49/structdata__structures_1_1_node.html", "d9/d49/structdata__structures_1_1_node" ], + [ "SkipList", "d4/d90/classdata__structures_1_1_skip_list.html", "d4/d90/classdata__structures_1_1_skip_list" ], + [ "trie", "d0/d3e/classdata__structures_1_1trie.html", "d0/d3e/classdata__structures_1_1trie" ] +]; \ No newline at end of file diff --git a/d5/d1d/structdata__structure_1_1_node__coll__graph.map b/d5/dc3/structdata__structures_1_1_node__coll__graph.map similarity index 63% rename from d5/d1d/structdata__structure_1_1_node__coll__graph.map rename to d5/dc3/structdata__structures_1_1_node__coll__graph.map index 1d67977f8..31088add9 100644 --- a/d5/d1d/structdata__structure_1_1_node__coll__graph.map +++ b/d5/dc3/structdata__structures_1_1_node__coll__graph.map @@ -1,5 +1,5 @@ - - + + - + diff --git a/d5/dc3/structdata__structures_1_1_node__coll__graph.md5 b/d5/dc3/structdata__structures_1_1_node__coll__graph.md5 new file mode 100644 index 000000000..15a83a413 --- /dev/null +++ b/d5/dc3/structdata__structures_1_1_node__coll__graph.md5 @@ -0,0 +1 @@ +bf1ac314b294fc19ac77a97ee64b03cf \ No newline at end of file diff --git a/d5/dc3/structdata__structures_1_1_node__coll__graph.svg b/d5/dc3/structdata__structures_1_1_node__coll__graph.svg new file mode 100644 index 000000000..103c2ef47 --- /dev/null +++ b/d5/dc3/structdata__structures_1_1_node__coll__graph.svg @@ -0,0 +1,64 @@ + + + + + + +data_structures::Node + + + +Node1 + + +data_structures::Node + + + + + +Node3 + + +std::shared_ptr< data +_structures::Node > + + + + + +Node1->Node3 + + + ptr + + + +Node2 + + +std::vector< std::shared +_ptr< data_structures:: +Node > > + + + + + +Node2->Node1 + + + forward + + + +Node3->Node2 + + + elements + + + diff --git a/d9/db3/classdata__structure_1_1_skip_list-members.html b/d6/db7/classdata__structures_1_1_skip_list-members.html similarity index 61% rename from d9/db3/classdata__structure_1_1_skip_list-members.html rename to d6/db7/classdata__structures_1_1_skip_list-members.html index 7ff6c8b67..2188eb6c5 100644 --- a/d9/db3/classdata__structure_1_1_skip_list-members.html +++ b/d6/db7/classdata__structures_1_1_skip_list-members.html @@ -71,7 +71,7 @@ $(function() {
@@ -91,20 +91,20 @@ $(document).ready(function(){initNavTree('d1/d46/classdata__structure_1_1_skip_l
-
data_structure::SkipList Member List
+
data_structures::SkipList Member List
-

This is the complete list of members for data_structure::SkipList, including all inherited members.

+

This is the complete list of members for data_structures::SkipList, including all inherited members.

- - - - - - - - + + + + + + + +
deleteElement(int key)data_structure::SkipListinline
displayList()data_structure::SkipListinline
headerdata_structure::SkipListprivate
insertElement(int key, void *value)data_structure::SkipListinline
leveldata_structure::SkipListprivate
randomLevel()data_structure::SkipListinline
searchElement(int key)data_structure::SkipListinline
SkipList()data_structure::SkipListinline
deleteElement(int key)data_structures::SkipListinline
displayList()data_structures::SkipListinline
headerdata_structures::SkipListprivate
insertElement(int key, void *value)data_structures::SkipListinline
leveldata_structures::SkipListprivate
randomLevel()data_structures::SkipListinline
searchElement(int key)data_structures::SkipListinline
SkipList()data_structures::SkipListinline
diff --git a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.map b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.map new file mode 100644 index 000000000..a2898237b --- /dev/null +++ b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.md5 b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.md5 new file mode 100644 index 000000000..9aa15e7ca --- /dev/null +++ b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.md5 @@ -0,0 +1 @@ +420c91bfeb321807384867db8e195404 \ No newline at end of file diff --git a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.svg b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.svg new file mode 100644 index 000000000..6df464ad1 --- /dev/null +++ b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.svg @@ -0,0 +1,80 @@ + + + + + + +data_structures::SkipList + + + +Node1 + + +data_structures::SkipList + + + + + +Node2 + + +std::shared_ptr< data +_structures::Node > + + + + + +Node2->Node1 + + + header + + + +Node4 + + +std::vector< std::shared +_ptr< data_structures:: +Node > > + + + + + +Node2->Node4 + + + elements + + + +Node3 + + +data_structures::Node + + + + + +Node3->Node2 + + + ptr + + + +Node4->Node3 + + + forward + + + diff --git a/d7/d83/trie__tree_8cpp.html b/d7/d83/trie__tree_8cpp.html index 5a27f2f48..a252e76e1 100644 --- a/d7/d83/trie__tree_8cpp.html +++ b/d7/d83/trie__tree_8cpp.html @@ -116,14 +116,14 @@ Include dependency graph for trie_tree.cpp: - - + +

Classes

class  data_structure::trie
 Trie implementation for small-case English alphabets a-z More...
class  data_structures::trie
 Trie implementation for small-case English alphabets a-z More...
 
- - + +

Namespaces

 data_structure
 Data-structure algorithms.
 data_structures
 Data-structure algorithms.
 
Author
@Arctic2333
Krishna Vedala
-
Note
the function data_structure::trie::deleteString might be erroneous
+
Note
the function ::data_structure::trie::deleteString might be erroneous
See also
trie_modern.cpp

Function Documentation

@@ -201,7 +201,7 @@ Here is the call graph for this function:

Testing function.

Returns
void
178  {
-
179  data_structure::trie root;
+
179  data_structures::trie root;
180  root.insert("Hello");
181  root.insert("World");
182 
@@ -227,7 +227,7 @@ Here is the call graph for this function:
-
data_structure::trie
Trie implementation for small-case English alphabets a-z
Definition: trie_tree.cpp:25
+
data_structures::trie
Trie implementation for small-case English alphabets a-z
Definition: trie_tree.cpp:25
std::vector::insert
T insert(T... args)
test
static void test()
Testing function.
Definition: trie_tree.cpp:178
diff --git a/d7/d83/trie__tree_8cpp.js b/d7/d83/trie__tree_8cpp.js index 78d996df4..ad19a5451 100644 --- a/d7/d83/trie__tree_8cpp.js +++ b/d7/d83/trie__tree_8cpp.js @@ -1,6 +1,6 @@ var trie__tree_8cpp = [ - [ "trie", "d0/d6e/classdata__structure_1_1trie.html", "d0/d6e/classdata__structure_1_1trie" ], + [ "trie", "d0/d3e/classdata__structures_1_1trie.html", "d0/d3e/classdata__structures_1_1trie" ], [ "main", "d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "test", "d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] ]; \ No newline at end of file diff --git a/d7/d99/classdata__structure_1_1trie__coll__graph.md5 b/d7/d99/classdata__structure_1_1trie__coll__graph.md5 deleted file mode 100644 index ff1ae35a5..000000000 --- a/d7/d99/classdata__structure_1_1trie__coll__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -92491b71d4f48aa7fd78c8c5420df4e9 \ No newline at end of file diff --git a/d7/de0/stack_8h_source.html b/d7/de0/stack_8h_source.html index f92bf99f0..8ad5e804d 100644 --- a/d7/de0/stack_8h_source.html +++ b/d7/de0/stack_8h_source.html @@ -248,60 +248,60 @@ $(document).ready(function(){initNavTree('d7/de0/stack_8h_source.html','../../')
stack::pop
void pop()
Definition: stack.h:99
std::srand
T srand(T... args)
-
data_structure::Node::Node
Node(int key, int level, void *value=nullptr)
Definition: skip_list.cpp:44
stack::stack
stack(const stack< Type > &otherStack)
Definition: stack.h:47
-
data_structure::SkipList::insertElement
void insertElement(int key, void *value)
Definition: skip_list.cpp:89
-
data_structure::Node
Definition: skip_list.cpp:33
-
data_structure::PROBABILITY
constexpr float PROBABILITY
Current probability for "coin toss".
Definition: skip_list.cpp:28
+
data_structures::Node::Node
Node(int key, int level, void *value=nullptr)
Definition: skip_list.cpp:44
-
data_structure::SkipList::searchElement
void * searchElement(int key)
Definition: skip_list.cpp:166
-
data_structure::SkipList::displayList
void displayList()
Definition: skip_list.cpp:187
-
data_structure
Data-structure algorithms.
+
data_structures::SkipList::displayList
void displayList()
Definition: skip_list.cpp:187
+
data_structures::SkipList::level
int level
Maximum level of the skiplist.
Definition: skip_list.cpp:56
+
data_structures::MAX_LEVEL
constexpr int MAX_LEVEL
Maximum level of skip list.
Definition: skip_list.cpp:27
+
data_structures::SkipList
Definition: skip_list.cpp:55
std::vector
STL class.
-
data_structure::SkipList::deleteElement
void deleteElement(int key)
Definition: skip_list.cpp:131
std::stack
STL class.
-
data_structure::SkipList::level
int level
Maximum level of the skiplist.
Definition: skip_list.cpp:56
node
Definition: avltree.cpp:13
node
struct list node
-
data_structure::SkipList
Definition: skip_list.cpp:55
std::queue
STL class.
-
data_structure::Node::key
int key
key integer
Definition: skip_list.cpp:34
main
int main()
Definition: skip_list.cpp:208
std::vector::push_back
T push_back(T... args)
-
data_structure::SkipList::SkipList
SkipList()
Definition: skip_list.cpp:64
+
data_structures::Node
Definition: skip_list.cpp:33
+
data_structures::Node::value
void * value
pointer of value
Definition: skip_list.cpp:35
stack_linkedList
Definition: queue_using_linkedlist.cpp:10
queue_test
void queue_test()
Definition: queue_using_two_stacks.cpp:101
std::array
STL class.
linkedlist
Definition: queue_using_linkedlist.cpp:6
-
data_structure::Node::value
void * value
pointer of value
Definition: skip_list.cpp:35
-
data_structure::Node::forward
std::vector< std::shared_ptr< Node > > forward
nodes of the given one in all levels
Definition: skip_list.cpp:37
-
data_structure::SkipList::randomLevel
int randomLevel()
Definition: skip_list.cpp:75
+
data_structures
Data-structure algorithms.
stack::push
void push(Type item)
Definition: stack.h:83
+
data_structures::Node::key
int key
key integer
Definition: skip_list.cpp:34
stack::size
int size
size of stack
Definition: stack.h:147
std::rand
T rand(T... args)
+
data_structures::SkipList::SkipList
SkipList()
Definition: skip_list.cpp:64
node::next
node< Type > * next
pointer to the next node instance
Definition: stack.h:18
stack::top
Type top()
Definition: stack.h:93
data
int data[MAX]
test data
Definition: hash_search.cpp:24
main
int main()
Definition: queue_using_two_stacks.cpp:141
std::endl
T endl(T... args)
stack::stack
stack()
Definition: stack.h:41
+
data_structures::Node::forward
std::vector< std::shared_ptr< Node > > forward
nodes of the given one in all levels
Definition: skip_list.cpp:37
stack::operator=
stack< Type > & operator=(const stack< Type > &otherStack)
Definition: stack.h:115
-
data_structure::SkipList::header
std::shared_ptr< Node > header
Pointer to the header node.
Definition: skip_list.cpp:57
+
data_structures::SkipList::deleteElement
void deleteElement(int key)
Definition: skip_list.cpp:131
std
STL namespace.
show
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
+
data_structures::SkipList::randomLevel
int randomLevel()
Definition: skip_list.cpp:75
stack
Definition: stack.h:26
Queue_Array
Definition: queue_using_array.cpp:13
-
data_structure::MAX_LEVEL
constexpr int MAX_LEVEL
Maximum level of skip list.
Definition: skip_list.cpp:27
stack::display
void display()
Definition: stack.h:29
stack::isEmptyStack
bool isEmptyStack()
Definition: stack.h:80
node::data
Type data
data at current node
Definition: stack.h:17
std::time
T time(T... args)
stack::stackTop
node< Type > * stackTop
Definition: stack.h:146
+
data_structures::SkipList::header
std::shared_ptr< Node > header
Pointer to the header node.
Definition: skip_list.cpp:57
stack::~stack
~stack()
Definition: stack.h:77
push
void push(char ch)
push byte to stack variable
Definition: paranthesis_matching.cpp:26
pop
char pop()
pop a byte out of stack variable
Definition: paranthesis_matching.cpp:29
+
data_structures::PROBABILITY
constexpr float PROBABILITY
Current probability for "coin toss".
Definition: skip_list.cpp:28
+
data_structures::SkipList::searchElement
void * searchElement(int key)
Definition: skip_list.cpp:166
+
data_structures::SkipList::insertElement
void insertElement(int key, void *value)
Definition: skip_list.cpp:89
std::exit
T exit(T... args)
stack::clear
void clear()
Definition: stack.h:112
std::next
T next(T... args)
diff --git a/d8/d95/vector__ops_8hpp_source.html b/d8/d95/vector__ops_8hpp_source.html index 9f486b184..5a4cd6c33 100644 --- a/d8/d95/vector__ops_8hpp_source.html +++ b/d8/d95/vector__ops_8hpp_source.html @@ -657,7 +657,6 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
std::move
T move(T... args)
machine_learning::operator/
std::vector< std::valarray< T > > operator/(const std::vector< std::valarray< T >> &A, const T &val)
Definition: vector_ops.hpp:365
operator+
std::vector< T > operator+(std::vector< T > const &A, std::vector< T > const &B)
Definition: ordinary_least_squares_regressor.cpp:204
-
data_structure::trie::insert
void insert(const std::string &str)
Definition: trie_tree.cpp:77
linear_probing::putProber
bool putProber(const Entry &entry, int key)
Definition: linear_probing_hash_table.cpp:98
machine_learning::pop_front
std::valarray< T > pop_front(const std::valarray< T > &A)
Definition: vector_ops.hpp:102
double_hashing
An implementation of hash table using double hashing algorithm.
@@ -666,11 +665,11 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
machine_learning::neural_network::NeuralNetwork::~NeuralNetwork
~NeuralNetwork()=default
graph::RootedTree::level
std::vector< int > level
Stores the distance from the root.
Definition: lowest_common_ancestor.cpp:106
-
data_structure
Data-structure algorithms.
double_hashing::removalInfo
void removalInfo(int key)
Definition: double_hash_hash_table.cpp:227
hash_chain::find
bool find(int x, int h) const
Find if a value and corresponding hash exist.
Definition: chaining.cpp:101
std::cos
T cos(T... args)
machine_learning::adaline::adaline
adaline(int num_features, const double eta=0.01f, const double accuracy=1e-5)
Definition: adaline_learning.cpp:55
+
data_structures::trie::trie
trie()=default
Class default constructor.
geometry
Geometry algorithms.
Trie
Definition: trie_modern.cpp:16
linear_probing::rehash
void rehash()
Definition: linear_probing_hash_table.cpp:138
@@ -680,6 +679,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
quadratic_probing
An implementation of hash table using quadratic probing algorithm.
test1
void test1()
Definition: kohonen_som_topology.cpp:369
std::string::size
T size(T... args)
+
data_structures::trie::insert
void insert(const std::string &str)
Definition: trie_tree.cpp:77
machine_learning::adaline::fit
double fit(const std::vector< double > &x, const int &y)
Definition: adaline_learning.cpp:119
main
int main()
Definition: double_hash_hash_table.cpp:250
geometry::jarvis::Convexhull::Convexhull
Convexhull(const std::vector< Point > &pointList)
Definition: jarvis_algorithm.cpp:66
@@ -743,6 +743,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
hash_chain::head
std::vector< std::shared_ptr< Node > > head
array of nodes
Definition: chaining.cpp:24
std::queue::front
T front(T... args)
machine_learning::neural_network::NeuralNetwork::NeuralNetwork
NeuralNetwork(NeuralNetwork &&)=default
+
data_structures::trie
Trie implementation for small-case English alphabets a-z
Definition: trie_tree.cpp:25
std::sort
T sort(T... args)
machine_learning::operator<<
std::ostream & operator<<(std::ostream &out, std::vector< std::valarray< T >> const &A)
Definition: vector_ops.hpp:32
machine_learning::neural_network::layers::DenseLayer::operator=
DenseLayer & operator=(DenseLayer &&)=default
@@ -769,11 +770,10 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
test
static void test()
Definition: neural_network.cpp:805
std::clock
T clock(T... args)
main
int main(int argc, char **argv)
Definition: kohonen_som_trace.cpp:457
-
data_structure::trie
Trie implementation for small-case English alphabets a-z
Definition: trie_tree.cpp:25
+
data_structures::trie::isEndofWord
bool isEndofWord
identifier if a node is terminal node
Definition: trie_tree.cpp:30
Trie::insert
void insert(const std::string &word)
Definition: trie_modern.cpp:109
operator<<
std::ostream & operator<<(std::ostream &out, std::vector< std::vector< T >> const &v)
Definition: ordinary_least_squares_regressor.cpp:22
CycleCheck::isCyclicDFS
static bool isCyclicDFS(Graph const &graph)
Definition: cycle_check_directed_graph.cpp:212
-
data_structure::trie::isEndofWord
bool isEndofWord
identifier if a node is terminal node
Definition: trie_tree.cpp:30
tests
void tests()
Definition: dijkstra.cpp:113
test3
void test3()
Definition: kohonen_som_topology.cpp:537
CycleCheck
Definition: cycle_check_directed_graph.cpp:158
@@ -792,7 +792,6 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
test1
void test1(double eta=0.01)
Definition: adaline_learning.cpp:224
std::vector::at
T at(T... args)
neural_network
Neural Network or Multilayer Perceptron.
-
data_structure::trie::trie
trie()=default
Class default constructor.
graph::depth_first_search
void depth_first_search(const std::vector< std::vector< size_t >> &adj, size_t start)
initiates depth first search algorithm.
Definition: depth_first_search.cpp:99
hash_chain::_mod
int _mod
modulus of the class
Definition: chaining.cpp:27
@@ -819,7 +818,6 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
machine_learning::insert_element
std::valarray< T > insert_element(const std::valarray< T > &A, const T &ele)
Definition: vector_ops.hpp:85
test
void test()
Definition: armstrong_number.cpp:59
quadratic_probing::add
void add(int key)
Definition: quadratic_probing_hash_table.cpp:182
-
data_structure::trie::NUM_CHARS
static constexpr uint8_t NUM_CHARS
Number of alphabets.
Definition: trie_tree.cpp:27
std::ofstream::close
T close(T... args)
machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction
std::vector< std::vector< std::valarray< double > > > __detailed_single_prediction(const std::vector< std::valarray< double >> &X)
Definition: neural_network.cpp:289
machine_learning::neural_network::util_functions::square
double square(const double &x)
Definition: neural_network.cpp:106
@@ -839,10 +837,10 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
test_3d_classes1
void test_3d_classes1(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_topology.cpp:411
fib
uint64_t fib(uint64_t n)
Definition: fibonacci_fast.cpp:30
quadratic_probing::rehash
void rehash()
Definition: quadratic_probing_hash_table.cpp:160
+
data_structures
Data-structure algorithms.
test2
void test2()
Definition: kohonen_som_topology.cpp:451
SegmentIntersection::on_segment
bool on_segment(Point first_point, Point second_point, Point third_point)
Definition: line_segment_intersection.cpp:75
graph::is_graph_bipartite::Graph::is_bipartite
bool is_bipartite()
function to add edges to our graph
Definition: is_graph_bipartite.cpp:106
-
data_structure::trie::deleteString
bool deleteString(const std::string &str, int index)
Definition: trie_tree.cpp:134
double_hashing::rehash
void rehash()
Definition: double_hash_hash_table.cpp:161
endl
#define endl
Definition: matrix_exponentiation.cpp:36
stack::push
void push(Type item)
Definition: stack.h:83
@@ -853,8 +851,10 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
double_hashing::display
void display()
Definition: double_hash_hash_table.cpp:143
double_hashing::remove
void remove(int key)
Definition: double_hash_hash_table.cpp:199
graph::add_undirected_edge
void add_undirected_edge(std::vector< std::vector< int >> *graph, int u, int v)
Adds an undirected edge from vertex u to vertex v. Essentially adds too directed edges to the adjacen...
Definition: breadth_first_search.cpp:81
+
data_structures::trie::NUM_CHARS
static constexpr uint8_t NUM_CHARS
Number of alphabets.
Definition: trie_tree.cpp:27
graph::is_graph_bipartite::Graph::adj
std::vector< std::vector< int > > adj
adj stores the graph as an adjacency list
Definition: is_graph_bipartite.cpp:56
main
int main()
Definition: jarvis_algorithm.cpp:176
+
data_structures::trie::char_to_int
uint8_t char_to_int(const char &ch) const
Convert a character to integer for indexing.
Definition: trie_tree.cpp:38
machine_learning::neural_network::NeuralNetwork::fit_from_csv
void fit_from_csv(const std::string &file_name, const bool &last_label, const int &epochs, const double &learning_rate, const bool &normalize, const int &slip_lines=1, const size_t &batch_size=32, const bool &shuffle=true)
Definition: neural_network.cpp:587
print
void print(uint32_t N, const std::vector< bool > &is_prime)
Definition: sieve_of_eratosthenes.cpp:44
main
int main(int argc, char **argv)
Definition: hamiltons_cycle.cpp:142
@@ -881,14 +881,15 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
geometry::jarvis::Convexhull
Definition: jarvis_algorithm.cpp:55
tests
void tests()
Definition: breadth_first_search.cpp:122
hamilton_cycle
bool hamilton_cycle(const std::vector< std::vector< bool >> &routes)
Definition: hamiltons_cycle.cpp:30
+
data_structures::trie::deleteString
bool deleteString(const std::string &str, int index)
Definition: trie_tree.cpp:134
tests
void tests()
Definition: connected_components.cpp:93
machine_learning::neural_network::NeuralNetwork::NeuralNetwork
NeuralNetwork(const std::vector< std::pair< int, std::string >> &config, const std::vector< std::vector< std::valarray< double >>> &kernals)
Definition: neural_network.cpp:256
data
int data[MAX]
test data
Definition: hash_search.cpp:24
-
data_structure::trie::search
bool search(const std::string &str, int index)
Definition: trie_tree.cpp:107
machine_learning::neural_network::layers::DenseLayer::DenseLayer
DenseLayer(DenseLayer &&)=default
linear_probing::add
void add(int key)
Definition: linear_probing_hash_table.cpp:161
machine_learning::neural_network::NeuralNetwork::summary
void summary()
Definition: neural_network.cpp:773
std::vector::emplace_back
T emplace_back(T... args)
+
data_structures::trie::arr
std::array< std::shared_ptr< trie >, NUM_CHARS<< 1 > arr
Recursive tree nodes as an array of shared-pointers.
Definition: trie_tree.cpp:29
std::round
T round(T... args)
spirograph::test
void test()
Test function to save resulting points to a CSV file.
Definition: spirograph.cpp:93
@@ -901,6 +902,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
std::endl
T endl(T... args)
main
int main()
Definition: armstrong_number.cpp:77
get_inverse
std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:226
+
data_structures::trie::search
bool search(const std::shared_ptr< trie > &root, const std::string &str, int index)
Definition: trie_tree.cpp:56
machine_learning::neural_network::NeuralNetwork::get_XY_from_csv
std::pair< std::vector< std::vector< std::valarray< double > > >, std::vector< std::vector< std::valarray< double > > > > get_XY_from_csv(const std::string &file_name, const bool &last_label, const bool &normalize, const int &slip_lines=1)
Definition: neural_network.cpp:382
double_hashing::searchingProber
bool searchingProber(const Entry &entry, int key)
Definition: double_hash_hash_table.cpp:133
std::left
T left(T... args)
@@ -944,6 +946,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
main
int main()
Definition: linear_probing_hash_table.cpp:224
std::queue::empty
T empty(T... args)
std::vector::assign
T assign(T... args)
+
data_structures::trie::search
bool search(const std::string &str, int index)
Definition: trie_tree.cpp:107
stack::display
void display()
Definition: stack.h:29
geometry::jarvis::Point
Definition: jarvis_algorithm.cpp:47
test3
void test3()
Definition: kohonen_som_trace.cpp:414
@@ -956,7 +959,6 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
machine_learning::operator*
std::vector< std::valarray< T > > operator*(const std::vector< std::valarray< T >> &A, const T &val)
Definition: vector_ops.hpp:347
main
int main()
Definition: neural_network.cpp:830
test
static void test()
Testing function.
Definition: trie_tree.cpp:178
-
data_structure::trie::arr
std::array< std::shared_ptr< trie >, NUM_CHARS<< 1 > arr
Recursive tree nodes as an array of shared-pointers.
Definition: trie_tree.cpp:29
std::make_pair
T make_pair(T... args)
std::time
T time(T... args)
quadratic_probing::hashFxn
size_t hashFxn(int key)
Definition: quadratic_probing_hash_table.cpp:46
@@ -966,7 +968,6 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
stack
char stack[MAX]
Definition: paranthesis_matching.cpp:20
double_hashing::Entry::key
int key
key value
Definition: double_hash_hash_table.cpp:38
geometry::jarvis::Convexhull::orientation
static int orientation(const Point &p, const Point &q, const Point &r)
Definition: jarvis_algorithm.cpp:133
-
data_structure::trie::char_to_int
uint8_t char_to_int(const char &ch) const
Convert a character to integer for indexing.
Definition: trie_tree.cpp:38
std::setw
T setw(T... args)
machine_learning::adaline::accuracy
const double accuracy
model fit convergence accuracy
Definition: adaline_learning.cpp:208
std::max
T max(T... args)
@@ -997,7 +998,6 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
sorting::quickSort
void quickSort(int arr[], int low, int high)
Definition: quick_sort.cpp:63
test2
void test2(double eta=0.01)
Definition: adaline_learning.cpp:262
std::partition
T partition(T... args)
-
data_structure::trie::search
bool search(const std::shared_ptr< trie > &root, const std::string &str, int index)
Definition: trie_tree.cpp:56
test3
void test3(double eta=0.01)
Definition: adaline_learning.cpp:313
machine_learning::adaline
Definition: adaline_learning.cpp:46
test3
static void test3()
Definition: hamiltons_cycle.cpp:122
diff --git a/d3/d6f/structdata__structure_1_1_node.html b/d9/d49/structdata__structures_1_1_node.html similarity index 61% rename from d3/d6f/structdata__structure_1_1_node.html rename to d9/d49/structdata__structures_1_1_node.html index 789522a08..047e5c657 100644 --- a/d3/d6f/structdata__structure_1_1_node.html +++ b/d9/d49/structdata__structures_1_1_node.html @@ -5,7 +5,7 @@ -Algorithms_in_C++: data_structure::Node Struct Reference +Algorithms_in_C++: data_structures::Node Struct Reference @@ -71,7 +71,7 @@ $(function() {
@@ -93,43 +93,43 @@ $(document).ready(function(){initNavTree('d3/d6f/structdata__structure_1_1_node.
Public Member Functions | Public Attributes | -List of all members
+List of all members
-
data_structure::Node Struct Reference
+
data_structures::Node Struct Reference
-Collaboration diagram for data_structure::Node:
+Collaboration diagram for data_structures::Node:
-
+
[legend]

@@ -140,7 +140,7 @@ Functions

- - + +

Public Member Functions

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

Public Attributes

-int key
 key integer
 
-void * value
 pointer of value
 
-std::vector< std::shared_ptr< Node > > forward
 nodes of the given one in all levels
 
+int key
 key integer
 
+void * value
 pointer of value
 
+std::vector< std::shared_ptr< Node > > forward
 nodes of the given one in all levels
 

Detailed Description

-

Node structure [Key][Node*, Node*...]

+

Node structure [Key][Node*, Node*...]

Constructor & Destructor Documentation

- -

◆ Node()

+ +

◆ Node()

@@ -138,7 +138,7 @@ void * 
 - + @@ -174,16 +174,16 @@ void *  - + @@ -140,7 +140,7 @@ This inheritance list is sorted roughly, but not completely, alphabetically: - + @@ -149,7 +149,7 @@ This inheritance list is sorted roughly, but not completely, alphabetically: - +
data_structure::Node::Node data_structures::Node::Node ( int  key,
44  : key(key), value(value) {
+
44  : key(key), value(value) {
45  // Initialization of forward vector
46  for (int i = 0; i < (level + 1); i++) {
-
47  forward.push_back(nullptr);
+
47  forward.push_back(nullptr);
48  }
49  }
Here is the call graph for this function:
-
+
@@ -194,14 +194,14 @@ Here is the call graph for this function:
-
data_structure::Node::key
int key
key integer
Definition: skip_list.cpp:34
std::vector::push_back
T push_back(T... args)
-
data_structure::Node::value
void * value
pointer of value
Definition: skip_list.cpp:35
-
data_structure::Node::forward
std::vector< std::shared_ptr< Node > > forward
nodes of the given one in all levels
Definition: skip_list.cpp:37
+
data_structures::Node::value
void * value
pointer of value
Definition: skip_list.cpp:35
+
data_structures::Node::key
int key
key integer
Definition: skip_list.cpp:34
+
data_structures::Node::forward
std::vector< std::shared_ptr< Node > > forward
nodes of the given one in all levels
Definition: skip_list.cpp:37
diff --git a/d9/d49/structdata__structures_1_1_node.js b/d9/d49/structdata__structures_1_1_node.js new file mode 100644 index 000000000..1640ce1a2 --- /dev/null +++ b/d9/d49/structdata__structures_1_1_node.js @@ -0,0 +1,7 @@ +var structdata__structures_1_1_node = +[ + [ "Node", "d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78", null ], + [ "forward", "d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e", null ], + [ "key", "d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68", null ], + [ "value", "d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731", null ] +]; \ No newline at end of file diff --git a/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.map b/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.map new file mode 100644 index 000000000..4dbb96b6e --- /dev/null +++ b/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.md5 b/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.md5 new file mode 100644 index 000000000..0a9168edd --- /dev/null +++ b/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.md5 @@ -0,0 +1 @@ +3ef8eafe8b1a7006c5e52d9a953fe424 \ No newline at end of file diff --git a/d3/d6f/structdata__structure_1_1_node_af7f19e61975f1362b22d1488bee87077_cgraph.svg b/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.svg similarity index 54% rename from d3/d6f/structdata__structure_1_1_node_af7f19e61975f1362b22d1488bee87077_cgraph.svg rename to d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.svg index 89002698e..e13b660a2 100644 --- a/d3/d6f/structdata__structure_1_1_node_af7f19e61975f1362b22d1488bee87077_cgraph.svg +++ b/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.svg @@ -3,19 +3,19 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - - + + -data_structure::Node::Node - +data_structures::Node::Node + Node1 - -data_structure::Node -::Node + +data_structures::Node +::Node @@ -23,16 +23,16 @@ Node2 - -std::vector::push_back + +std::vector::push_back Node1->Node2 - - + + diff --git a/d9/dda/classdata__structure_1_1_skip_list__coll__graph.map b/d9/dda/classdata__structure_1_1_skip_list__coll__graph.map deleted file mode 100644 index 5d7a3b46e..000000000 --- a/d9/dda/classdata__structure_1_1_skip_list__coll__graph.map +++ /dev/null @@ -1,6 +0,0 @@ - - - - - - diff --git a/d9/dda/classdata__structure_1_1_skip_list__coll__graph.md5 b/d9/dda/classdata__structure_1_1_skip_list__coll__graph.md5 deleted file mode 100644 index dfb02832c..000000000 --- a/d9/dda/classdata__structure_1_1_skip_list__coll__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -2f27e512b3ed35fd141dbfd0af0cf9c2 \ No newline at end of file diff --git a/d9/dda/classdata__structure_1_1_skip_list__coll__graph.svg b/d9/dda/classdata__structure_1_1_skip_list__coll__graph.svg deleted file mode 100644 index 8d51caca8..000000000 --- a/d9/dda/classdata__structure_1_1_skip_list__coll__graph.svg +++ /dev/null @@ -1,79 +0,0 @@ - - - - - - -data_structure::SkipList - - - -Node1 - - -data_structure::SkipList - - - - - -Node2 - - -std::shared_ptr< data -_structure::Node > - - - - - -Node2->Node1 - - - header - - - -Node4 - - -std::vector< std::shared -_ptr< data_structure::Node > > - - - - - -Node2->Node4 - - - elements - - - -Node3 - - -data_structure::Node - - - - - -Node3->Node2 - - - ptr - - - -Node4->Node3 - - - forward - - - diff --git a/dc/d7c/structdata__structure_1_1_node-members.html b/dc/d25/structdata__structures_1_1_node-members.html similarity index 75% rename from dc/d7c/structdata__structure_1_1_node-members.html rename to dc/d25/structdata__structures_1_1_node-members.html index 592d75d00..75e4a6b1f 100644 --- a/dc/d7c/structdata__structure_1_1_node-members.html +++ b/dc/d25/structdata__structures_1_1_node-members.html @@ -71,7 +71,7 @@ $(function() {
@@ -91,16 +91,16 @@ $(document).ready(function(){initNavTree('d3/d6f/structdata__structure_1_1_node.
-
data_structure::Node Member List
+
data_structures::Node Member List
-

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

+

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

- - - - + + + +
forwarddata_structure::Node
keydata_structure::Node
Node(int key, int level, void *value=nullptr)data_structure::Nodeinline
valuedata_structure::Node
forwarddata_structures::Node
keydata_structures::Node
Node(int key, int level, void *value=nullptr)data_structures::Nodeinline
valuedata_structures::Node
diff --git a/dd/da0/todo.html b/dd/da0/todo.html index 4b0374a86..229b2d8bc 100644 --- a/dd/da0/todo.html +++ b/dd/da0/todo.html @@ -103,8 +103,8 @@ $(document).ready(function(){initNavTree('dd/da0/todo.html','../../'); initResiz
update code to use C++ STL library features and OO structure
File list_array.cpp
Add documentation
-
Member data_structure::trie::deleteString (const std::string &str, int index)
-
review the function data_structure::trie::deleteString and the commented lines
+
Member data_structures::trie::deleteString (const std::string &str, int index)
+
review the function ::data_structure::trie::deleteString and the commented lines
Member test1 ()
better ways to self-check a matrix output?
Member mat_size
diff --git a/functions_a.html b/functions_a.html index f6b1f61b0..cb0532c0c 100644 --- a/functions_a.html +++ b/functions_a.html @@ -128,7 +128,7 @@ $(document).ready(function(){initNavTree('functions_a.html',''); initResizable() : Complex
  • arr -: data_structure::trie +: data_structures::trie
    • diff --git a/functions_c.html b/functions_c.html index 8180ececa..0c60adcda 100644 --- a/functions_c.html +++ b/functions_c.html @@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('functions_c.html',''); initResizable() : range_queries::heavy_light_decomposition::Tree< X >
  • char_to_int() -: data_structure::trie +: data_structures::trie
  • check_size_match() : machine_learning::adaline diff --git a/functions_d.html b/functions_d.html index 36cd2266c..32cbb6303 100644 --- a/functions_d.html +++ b/functions_d.html @@ -103,13 +103,13 @@ $(document).ready(function(){initNavTree('functions_d.html',''); initResizable() : ciphers::HillCipher
  • deleteElement() -: data_structure::SkipList +: data_structures::SkipList
  • deleteKey() : MinHeap
  • deleteString() -: data_structure::trie +: data_structures::trie
  • DenseLayer() : machine_learning::neural_network::layers::DenseLayer @@ -144,7 +144,7 @@ $(document).ready(function(){initNavTree('functions_d.html',''); initResizable() , stack< Type >
  • displayList() -: data_structure::SkipList +: data_structures::SkipList
    • diff --git a/functions_f.html b/functions_f.html index 6166f32b7..fadb74086 100644 --- a/functions_f.html +++ b/functions_f.html @@ -107,7 +107,7 @@ $(document).ready(function(){initNavTree('functions_f.html',''); initResizable() : machine_learning::neural_network::NeuralNetwork
  • forward -: data_structure::Node +: data_structures::Node
  • front() : queue< Kind > diff --git a/functions_func.html b/functions_func.html index 33c2fab9c..ad1dc4882 100644 --- a/functions_func.html +++ b/functions_func.html @@ -146,7 +146,7 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl : range_queries::heavy_light_decomposition::Tree< X >
  • char_to_int() -: data_structure::trie +: data_structures::trie
  • check_size_match() : machine_learning::adaline @@ -178,13 +178,13 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl : ciphers::HillCipher
  • deleteElement() -: data_structure::SkipList +: data_structures::SkipList
  • deleteKey() : MinHeap
  • deleteString() -: data_structure::trie +: data_structures::trie
  • DenseLayer() : machine_learning::neural_network::layers::DenseLayer @@ -219,7 +219,7 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl , stack< Type >
  • displayList() -: data_structure::SkipList +: data_structures::SkipList
    • @@ -341,11 +341,11 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl , range_queries::heavy_light_decomposition::Tree< X >
  • insert() -: data_structure::trie +: data_structures::trie , Trie
  • insertElement() -: data_structure::SkipList +: data_structures::SkipList
  • insertKey() : MinHeap @@ -432,7 +432,7 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl , statistics::stats_computer2< T >
  • Node() -: data_structure::Node +: data_structures::Node
  • num_digits() : large_number @@ -528,7 +528,7 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl : ciphers::HillCipher
  • randomLevel() -: data_structure::SkipList +: data_structures::SkipList
  • real() : Complex @@ -550,11 +550,11 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl : machine_learning::neural_network::NeuralNetwork
  • search() -: data_structure::trie +: data_structures::trie , Trie
  • searchElement() -: data_structure::SkipList +: data_structures::SkipList
  • set_node_val() : range_queries::heavy_light_decomposition::Tree< X > @@ -569,7 +569,7 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl : machine_learning::neural_network::NeuralNetwork
  • SkipList() -: data_structure::SkipList +: data_structures::SkipList
  • stack() : stack< Type > @@ -601,7 +601,7 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl : range_queries::heavy_light_decomposition::Tree< X >
  • trie() -: data_structure::trie +: data_structures::trie
  • Trie() : Trie diff --git a/functions_h.html b/functions_h.html index ba992f4fe..af3b28586 100644 --- a/functions_h.html +++ b/functions_h.html @@ -118,7 +118,7 @@ $(document).ready(function(){initNavTree('functions_h.html',''); initResizable() : hash_chain
  • header -: data_structure::SkipList +: data_structures::SkipList
  • heap_size : MinHeap diff --git a/functions_i.html b/functions_i.html index c5f7a3a85..07af0b5d0 100644 --- a/functions_i.html +++ b/functions_i.html @@ -101,11 +101,11 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable() , range_queries::heavy_light_decomposition::Tree< X >
  • insert() -: data_structure::trie +: data_structures::trie , Trie
  • insertElement() -: data_structure::SkipList +: data_structures::SkipList
  • insertKey() : MinHeap @@ -129,7 +129,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable() : stack< Type >
  • isEndofWord -: data_structure::trie +: data_structures::trie
    • diff --git a/functions_k.html b/functions_k.html index a4a8c279c..c8fba4b23 100644 --- a/functions_k.html +++ b/functions_k.html @@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('functions_k.html',''); initResizable()

    - k -

    @@ -301,7 +301,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl

    - v -

    • value -: data_structure::Node +: data_structures::Node
    • values : tower diff --git a/hierarchy.html b/hierarchy.html index 7f6b90083..c8d5fd74c 100644 --- a/hierarchy.html +++ b/hierarchy.html @@ -127,7 +127,7 @@ This inheritance list is sorted roughly, but not completely, alphabetically:
    		 CMinHeapNode
     Cmst
     Cmachine_learning::neural_network::NeuralNetwork
     Cdata_structure::Node
     Cdata_structures::Node
     Cnode< Kind >
     CNode
     Cnode< Type >
     CSegmentIntersection
     ▼Crange_queries::heavy_light_decomposition::SG< X >Segment Tree, to store heavy chains
     Crange_queries::heavy_light_decomposition::HLD< X >The Heavy-Light Decomposition class
     Cdata_structure::SkipList
     Cdata_structures::SkipList
     CSolution
     Cstack< Type >
     Cstack_linkedList
     Ctower
     ▼Crange_queries::heavy_light_decomposition::Tree< X >A Basic Tree, which supports binary lifting
     Crange_queries::heavy_light_decomposition::HLD< X >The Heavy-Light Decomposition class
     Cdata_structure::trieTrie implementation for small-case English alphabets a-z
     Cdata_structures::trieTrie implementation for small-case English alphabets a-z
     CTrie
     CTrie::TrieNode
    diff --git a/hierarchy.js b/hierarchy.js index ef3c85512..89fb5bcd9 100644 --- a/hierarchy.js +++ b/hierarchy.js @@ -30,7 +30,7 @@ var hierarchy = [ "MinHeapNode", "d5/d29/struct_min_heap_node.html", null ], [ "mst", "d1/d77/structmst.html", null ], [ "machine_learning::neural_network::NeuralNetwork", "d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html", null ], - [ "data_structure::Node", "d3/d6f/structdata__structure_1_1_node.html", null ], + [ "data_structures::Node", "d9/d49/structdata__structures_1_1_node.html", null ], [ "node< Kind >", "d5/da1/structnode.html", null ], [ "Node", "db/d8b/struct_node.html", null ], [ "node< Type >", "d5/da1/structnode.html", null ], @@ -44,7 +44,7 @@ var hierarchy = [ "range_queries::heavy_light_decomposition::SG< X >", "d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html", [ [ "range_queries::heavy_light_decomposition::HLD< X >", "d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html", null ] ] ], - [ "data_structure::SkipList", "d1/d46/classdata__structure_1_1_skip_list.html", null ], + [ "data_structures::SkipList", "d4/d90/classdata__structures_1_1_skip_list.html", null ], [ "Solution", "dd/d4f/class_solution.html", null ], [ "stack< Type >", "d1/dc2/classstack.html", null ], [ "stack_linkedList", "d2/dc4/classstack__linked_list.html", null ], @@ -54,7 +54,7 @@ var hierarchy = [ "range_queries::heavy_light_decomposition::Tree< X >", "d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html", [ [ "range_queries::heavy_light_decomposition::HLD< X >", "d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html", null ] ] ], - [ "data_structure::trie", "d0/d6e/classdata__structure_1_1trie.html", null ], + [ "data_structures::trie", "d0/d3e/classdata__structures_1_1trie.html", null ], [ "Trie", "dd/d2f/class_trie.html", null ], [ "Trie::TrieNode", "de/d48/struct_trie_1_1_trie_node.html", null ] ]; \ No newline at end of file diff --git a/inherit_graph_6.map b/inherit_graph_6.map index a3761b027..9f17706e5 100644 --- a/inherit_graph_6.map +++ b/inherit_graph_6.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_6.md5 b/inherit_graph_6.md5 index 5d057deca..294f46259 100644 --- a/inherit_graph_6.md5 +++ b/inherit_graph_6.md5 @@ -1 +1 @@ -ffb81cb3f9284a4dd2d606c4942e7457 \ No newline at end of file +fd8db4a243911e756e3ab0d4372e4989 \ No newline at end of file diff --git a/inherit_graph_6.svg b/inherit_graph_6.svg index 2b213734c..b449a530b 100644 --- a/inherit_graph_6.svg +++ b/inherit_graph_6.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy - + Node0 - - -data_structure::Node + + +data_structures::Node diff --git a/inherit_graph_7.map b/inherit_graph_7.map index abfb96fd6..0c42a6d9f 100644 --- a/inherit_graph_7.map +++ b/inherit_graph_7.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_7.md5 b/inherit_graph_7.md5 index d05550d8b..62080a38f 100644 --- a/inherit_graph_7.md5 +++ b/inherit_graph_7.md5 @@ -1 +1 @@ -9156a9cd8ea1a8c6551dd37eadc1ff8d \ No newline at end of file +29c2cad0bf4ed559e4d21194b66ddffa \ No newline at end of file diff --git a/inherit_graph_7.svg b/inherit_graph_7.svg index dad6f6e7b..80354dab3 100644 --- a/inherit_graph_7.svg +++ b/inherit_graph_7.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy - + Node0 - - -data_structure::SkipList + + +data_structures::SkipList diff --git a/inherit_graph_8.map b/inherit_graph_8.map index eb38f237e..ad33e8513 100644 --- a/inherit_graph_8.map +++ b/inherit_graph_8.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_8.md5 b/inherit_graph_8.md5 index 3b9795819..fadd17e74 100644 --- a/inherit_graph_8.md5 +++ b/inherit_graph_8.md5 @@ -1 +1 @@ -1aae31b5b7a198b36b2376e9cbd8aad9 \ No newline at end of file +328ab509bf116ce8b376591ac881beaf \ No newline at end of file diff --git a/inherit_graph_8.svg b/inherit_graph_8.svg index 1382aea8b..915f29839 100644 --- a/inherit_graph_8.svg +++ b/inherit_graph_8.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy - + Node0 - - -data_structure::trie + + +data_structures::trie diff --git a/inherits.html b/inherits.html index bd4bb1a70..6a5eadf7b 100644 --- a/inherits.html +++ b/inherits.html @@ -109,11 +109,11 @@ $(document).ready(function(){initNavTree('hierarchy.html',''); initResizable();
    +
    +
    +
     NbacktrackingBacktracking algorithms
     NcaesarFunctions for Caesar cipher algorithm
     NciphersAlgorithms for encryption and decryption
     Ndata_structureData-structure algorithms
     Ndata_structuresData-structure algorithms
     Ndouble_hashingAn implementation of hash table using double hashing algorithm
     Ndynamic_programmingDynamic Programming algorithms
     NgeometryGeometry algorithms