diff --git a/annotated.html b/annotated.html index 8cdaff3c8..07c4e3fd0 100644 --- a/annotated.html +++ b/annotated.html @@ -101,45 +101,51 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();  ▼Ndata_structureData-structure algorithms  CNode  CSkipList - ▼Nmachine_learningMachine learning algorithms - Cadaline - ▼NstatisticsStatistical algorithms - Cstats_computer1 - Cstats_computer2 - CBtree - Ccll - Ccompare - CComplexClass Complex to represent complex numbers as a field - CCycleCheck - Cdouble_linked_list - CEdge - CEntry - CFenwickTree - CGraph - Cgraph - CItem - Clarge_number - Clca - Clinkedlist - Clist - CMinHeap - CMinHeapNode - Cmst - CNode - Cnode - CPoint - Cquery - Cqueue - CQueue - CQueue_Array - CSegmentIntersection - CSolution - Cstack - Cstack_linkedList - Ctower - Ctrie - ▼CTrie - CTrieNode + ▼Ndouble_hashingAn implementation of hash table using double hashing algorithm + CEntry + ▼Nlinear_probingAn implementation of hash table using linear probing algorithm + CEntry + ▼Nmachine_learningMachine learning algorithms + Cadaline + ▼Nquadratic_probingAn implementation of hash table using quadratic probing algorithm + CEntry + ▼NstatisticsStatistical algorithms + Cstats_computer1 + Cstats_computer2 + CBtree + Ccll + Ccompare + CComplexClass Complex to represent complex numbers as a field + CCycleCheck + Cdouble_linked_list + CEdge + CFenwickTree + CGraph + Cgraph + Chash_chainChain class with a given modulus + CItem + Clarge_number + Clca + Clinkedlist + Clist + CMinHeap + CMinHeapNode + Cmst + CNode + Cnode + CPoint + Cquery + CQueue + Cqueue + CQueue_Array + CSegmentIntersection + CSolution + Cstack + Cstack_linkedList + Ctower + Ctrie + ▼CTrie + CTrieNode diff --git a/annotated_dup.js b/annotated_dup.js index 68fae7c19..3c9d7167e 100644 --- a/annotated_dup.js +++ b/annotated_dup.js @@ -2,7 +2,10 @@ var annotated_dup = [ [ "ciphers", "d6/d4e/namespaceciphers.html", "d6/d4e/namespaceciphers" ], [ "data_structure", "d1/db4/namespacedata__structure.html", "d1/db4/namespacedata__structure" ], + [ "double_hashing", "d0/d65/namespacedouble__hashing.html", "d0/d65/namespacedouble__hashing" ], + [ "linear_probing", "d8/d89/namespacelinear__probing.html", "d8/d89/namespacelinear__probing" ], [ "machine_learning", "d8/d77/namespacemachine__learning.html", "d8/d77/namespacemachine__learning" ], + [ "quadratic_probing", "d4/dd2/namespacequadratic__probing.html", "d4/dd2/namespacequadratic__probing" ], [ "statistics", "d2/dcf/namespacestatistics.html", "d2/dcf/namespacestatistics" ], [ "Btree", "d9/d90/struct_btree.html", "d9/d90/struct_btree" ], [ "cll", "d5/d15/classcll.html", "d5/d15/classcll" ], @@ -11,10 +14,10 @@ var annotated_dup = [ "CycleCheck", "d3/dbb/class_cycle_check.html", "d3/dbb/class_cycle_check" ], [ "double_linked_list", "d9/dee/classdouble__linked__list.html", "d9/dee/classdouble__linked__list" ], [ "Edge", "d7/d77/class_edge.html", "d7/d77/class_edge" ], - [ "Entry", "dd/d3b/struct_entry.html", "dd/d3b/struct_entry" ], [ "FenwickTree", "dd/d91/class_fenwick_tree.html", "dd/d91/class_fenwick_tree" ], [ "Graph", "da/d9a/class_graph.html", "da/d9a/class_graph" ], [ "graph", "dd/d9b/classgraph.html", "dd/d9b/classgraph" ], + [ "hash_chain", "dd/d1c/classhash__chain.html", "dd/d1c/classhash__chain" ], [ "Item", "db/d66/struct_item.html", "db/d66/struct_item" ], [ "large_number", "db/d82/classlarge__number.html", "db/d82/classlarge__number" ], [ "lca", "dd/df4/structlca.html", "dd/df4/structlca" ], @@ -27,8 +30,8 @@ var annotated_dup = [ "node", "d5/da1/structnode.html", "d5/da1/structnode" ], [ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ], [ "query", "dd/d1b/structquery.html", "dd/d1b/structquery" ], - [ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ], [ "Queue", "dc/db5/struct_queue.html", "dc/db5/struct_queue" ], + [ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ], [ "Queue_Array", "d0/dd2/class_queue___array.html", "d0/dd2/class_queue___array" ], [ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ], [ "Solution", "dd/d4f/class_solution.html", "dd/d4f/class_solution" ], diff --git a/classes.html b/classes.html index 715c8611f..fd5e25dca 100644 --- a/classes.html +++ b/classes.html @@ -100,91 +100,94 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
  e  
-
  l  
+HillCipher (ciphers)    +
  n  
-Node (data_structure)    -stack    +SkipList (data_structure)    -
  p  
+
  i  
-stack_linkedList    +Solution    adaline (machine_learning)    Edge    -large_number    -stats_computer1 (statistics)    +Node    +stack   
  b  
-Entry    -lca    -Point    -stats_computer2 (statistics)    +Entry (double_hashing)    +Item    +Node (data_structure)    +stack_linkedList    -
  f  
- -linkedlist    -
  q  
- -
  t  
+Entry (linear_probing)    +
  l  
+node    +stats_computer1 (statistics)    Btree    -list    +Entry (quadratic_probing)    +
  p  
+ +stats_computer2 (statistics)   
  c  
+
  f  
+ +large_number    +
  t  
+ + +lca    +Point    + +cll    FenwickTree    +linkedlist    +
  q  
+ +tower    + +compare    +
  g  
+ +list    +trie    + +Complex   
  m  
query    -tower    - -
  g  
- -queue    -trie    - -cll    -MinHeap    -Queue    Trie    -compare    +CycleCheck    Graph    -MinHeapNode    -Queue_Array    +Queue    Trie::TrieNode    -Complex    +
  d  
+ graph    +MinHeap    +queue    + +
  h  
+ +MinHeapNode    +Queue_Array    + +double_linked_list    mst   
  s  
-CycleCheck    -
  h  
- -
  n  
- +hash_chain    + +SegmentIntersection    -
  d  
- -SegmentIntersection    - -HillCipher (ciphers)    -Node    -SkipList (data_structure)    - -double_linked_list    -
  i  
- -node    -Solution    - - -Item    -
a | b | c | d | e | f | g | h | i | l | m | n | p | q | s | t
diff --git a/d0/d61/quadratic__probing__hash__table_8cpp__incl.map b/d0/d61/quadratic__probing__hash__table_8cpp__incl.map new file mode 100644 index 000000000..4c5c8e83a --- /dev/null +++ b/d0/d61/quadratic__probing__hash__table_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d0/d61/quadratic__probing__hash__table_8cpp__incl.md5 b/d0/d61/quadratic__probing__hash__table_8cpp__incl.md5 new file mode 100644 index 000000000..b72062ef1 --- /dev/null +++ b/d0/d61/quadratic__probing__hash__table_8cpp__incl.md5 @@ -0,0 +1 @@ +428f1ba98a497db16025d4527853b408 \ No newline at end of file diff --git a/d0/d61/quadratic__probing__hash__table_8cpp__incl.svg b/d0/d61/quadratic__probing__hash__table_8cpp__incl.svg new file mode 100644 index 000000000..ddaaf78da --- /dev/null +++ b/d0/d61/quadratic__probing__hash__table_8cpp__incl.svg @@ -0,0 +1,68 @@ + + + + + + +hashing/quadratic_probing_hash_table.cpp + + + +Node1 + + +hashing/quadratic_probing +_hash_table.cpp + + + + + +Node2 + + +cmath + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + +Node4 + + +vector + + + + + +Node1->Node4 + + + + + diff --git a/d0/d65/namespacedouble__hashing.html b/d0/d65/namespacedouble__hashing.html new file mode 100644 index 000000000..034a05a37 --- /dev/null +++ b/d0/d65/namespacedouble__hashing.html @@ -0,0 +1,677 @@ + + + + + + + +Algorithms_in_C++: double_hashing Namespace Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+Classes | +Typedefs | +Functions | +Variables
+
+
double_hashing Namespace Reference
Open Addressing
+
+
+ +

An implementation of hash table using double hashing algorithm. +More...

+ + + + +

+Classes

struct  Entry
 
+ + + +

+Typedefs

+using Entry = struct Entry
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

bool putProber (const Entry &entry, int key)
 
bool searchingProber (const Entry &entry, int key)
 
void add (int key)
 
size_t hashFxn (int key)
 Hash a key. Uses the STL library's std::hash() function. More...
 
size_t otherHashFxn (int key)
 Used for second hash function. More...
 
int doubleHash (int key, bool searching)
 Performs double hashing to resolve collisions. More...
 
void display ()
 
void rehash ()
 
void remove (int key)
 
void addInfo (int key)
 
void removalInfo (int key)
 
+ + + + + + + + + + + + + +

+Variables

+int notPresent
 
+std::vector< Entry > table
 
+int totalSize
 
+int tomb = -1
 
+int size
 
+bool rehashing
 
+

Detailed Description

+

An implementation of hash table using double hashing algorithm.

+

Function Documentation

+ +

◆ add()

+ +
+
+ + + + + + + + +
void double_hashing::add (int key)
+
+

Checks for load factor here

Parameters
+ + +
keykey value to add to the table
+
+
+
185  {
+
186  // auto* entry = new Entry();
+
187  // entry->key = key;
+
188  int index = doubleHash(key, false);
+
189  table[index].key = key;
+
190  // Load factor greater than 0.5 causes resizing
+
191  if (++size / static_cast<double>(totalSize) >= 0.5) {
+
192  rehash();
+
193  }
+
194 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ addInfo()

+ +
+
+ + + + + + + + +
void double_hashing::addInfo (int key)
+
+

Information about the adding process

Parameters
+ + +
keykey value to add to table
+
+
+
212  {
+
213  std::cout << "Initial table: ";
+
214  display();
+
215  std::cout << std::endl;
+
216  std::cout << "hash of " << key << " is " << hashFxn(key) << " % "
+
217  << totalSize << " == " << hashFxn(key) % totalSize;
+
218  std::cout << std::endl;
+
219  add(key);
+
220  std::cout << "New table: ";
+
221  display();
+
222 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ display()

+ +
+
+ + + + + + + +
void double_hashing::display ()
+
+

Displays the table

Returns
None
+
143  {
+
144  for (int i = 0; i < totalSize; i++) {
+
145  if (table[i].key == notPresent) {
+
146  std::cout << " Empty ";
+
147  } else if (table[i].key == tomb) {
+
148  std::cout << " Tomb ";
+
149  } else {
+
150  std::cout << " ";
+
151  std::cout << table[i].key;
+
152  std::cout << " ";
+
153  }
+
154  }
+
155  std::cout << std::endl;
+
156 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ doubleHash()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int double_hashing::doubleHash (int key,
bool searching 
)
+
+ +

Performs double hashing to resolve collisions.

+
Parameters
+ + + +
keykey value to apply double-hash on
searchingtrue to check for conflicts
+
+
+
Returns
Index of key when found
+
+new hash if no conflicts present
+
71  {
+
72  int hash = static_cast<int>(hashFxn(key));
+
73  int i = 0;
+
74  Entry entry;
+
75  do {
+
76  int index =
+
77  static_cast<int>(hash + (i * otherHashFxn(key))) % totalSize;
+
78  entry = table[index];
+
79  if (searching) {
+
80  if (entry.key == notPresent) {
+
81  return notPresent;
+
82  }
+
83  if (searchingProber(entry, key)) {
+
84  std::cout << "Found key!" << std::endl;
+
85  return index;
+
86  }
+
87  std::cout << "Found tombstone or equal hash, checking next"
+
88  << std::endl;
+
89  i++;
+
90  } else {
+
91  if (putProber(entry, key)) {
+
92  if (!rehashing) {
+
93  std::cout << "Spot found!" << std::endl;
+
94  }
+
95  return index;
+
96  }
+
97  if (!rehashing) {
+
98  std::cout << "Spot taken, looking at next (next index:"
+
99  << " "
+
100  << static_cast<int>(hash + (i * otherHashFxn(key))) %
+
101  totalSize
+
102  << ")" << std::endl;
+
103  }
+
104  i++;
+
105  }
+
106  if (i == totalSize * 100) {
+
107  std::cout << "DoubleHash probe failed" << std::endl;
+
108  return notPresent;
+
109  }
+
110  } while (entry.key != notPresent);
+
111  return notPresent;
+
112 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ hashFxn()

+ +
+
+ + + + + + + + +
size_t double_hashing::hashFxn (int key)
+
+ +

Hash a key. Uses the STL library's std::hash() function.

+
Parameters
+ + +
keyvalue to hash
+
+
+
Returns
hash value of the key
+
47  {
+
48  std::hash<int> hash;
+
49  return hash(key);
+
50 }
+
+
+
+ +

◆ otherHashFxn()

+ +
+
+ + + + + + + + +
size_t double_hashing::otherHashFxn (int key)
+
+ +

Used for second hash function.

+
Parameters
+ + +
keykey value to hash
+
+
+
Returns
hash value of the key
+
58  {
+
59  std::hash<int> hash;
+
60  return 1 + (7 - (hash(key) % 7));
+
61 }
+
+
+
+ +

◆ putProber()

+ +
+
+ + + + + + + + + + + + + + + + + + +
bool double_hashing::putProber (const Entry & entry,
int key 
)
+
+

Finds empty spot in a vector

Parameters
+ + + +
entryvector to search in
keykey to search for
+
+
+
Returns
true if key is not present or is a toumb
+
+false is already occupied
+
120  {
+
121  if (entry.key == notPresent || entry.key == tomb) {
+
122  return true;
+
123  }
+
124  return false;
+
125 }
+
+
+
+ +

◆ rehash()

+ +
+
+ + + + + + + +
void double_hashing::rehash ()
+
+

Rehashes the table into a bigger table

Returns
None
+
161  {
+
162  // Necessary so wall of add info isn't printed all at once
+
163  rehashing = true;
+
164  int oldSize = totalSize;
+
165  std::vector<Entry> oldTable(table);
+
166  // Really this should use the next prime number greater than totalSize * 2
+
167  table = std::vector<Entry>(totalSize * 2);
+
168  totalSize *= 2;
+
169  for (int i = 0; i < oldSize; i++) {
+
170  if (oldTable[i].key != -1 && oldTable[i].key != notPresent) {
+
171  size--; // Size stays the same (add increments size)
+
172  add(oldTable[i].key);
+
173  }
+
174  }
+
175  // delete[] oldTable;
+
176  // oldTable.reset();
+
177 
+
178  rehashing = false;
+
179  std::cout << "Table was rehashed, new size is: " << totalSize << std::endl;
+
180 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ removalInfo()

+ +
+
+ + + + + + + + +
void double_hashing::removalInfo (int key)
+
+

Information about removal process

Parameters
+ + +
keykey value to remove from table
+
+
+
227  {
+
228  std::cout << "Initial table: ";
+
229  display();
+
230  std::cout << std::endl;
+
231  std::cout << "hash of " << key << " is " << hashFxn(key) << " % "
+
232  << totalSize << " == " << hashFxn(key) % totalSize;
+
233  std::cout << std::endl;
+
234  remove(key);
+
235  std::cout << "New table: ";
+
236  display();
+
237 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ remove()

+ +
+
+ + + + + + + + +
void double_hashing::remove (int key)
+
+

Removes key. Leaves tombstone upon removal.

Parameters
+ + +
keykey value to remove
+
+
+
199  {
+
200  int index = doubleHash(key, true);
+
201  if (index == notPresent) {
+
202  std::cout << "key not found" << std::endl;
+
203  }
+
204  table[index].key = tomb;
+
205  std::cout << "Removal successful, leaving tombstone" << std::endl;
+
206  size--;
+
207 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ searchingProber()

+ +
+
+ + + + + + + + + + + + + + + + + + +
bool double_hashing::searchingProber (const Entry & entry,
int key 
)
+
+

Looks for a matching key

Parameters
+ + + +
entryvector to search in
keykey value to search
+
+
+
Returns
true if found
+
+false if not found
+
133  {
+
134  if (entry.key == key) {
+
135  return true;
+
136  }
+
137  return false;
+
138 }
+
+
+
+
+
+
double_hashing::Entry
Definition: double_hash_hash_table.cpp:36
+
double_hashing::otherHashFxn
size_t otherHashFxn(int key)
Used for second hash function.
Definition: double_hash_hash_table.cpp:58
+
std::vector
STL class.
+
double_hashing::putProber
bool putProber(const Entry &entry, int key)
Definition: double_hash_hash_table.cpp:120
+
std::cout
+
double_hashing::hashFxn
size_t hashFxn(int key)
Hash a key. Uses the STL library's std::hash() function.
Definition: double_hash_hash_table.cpp:47
+
double_hashing::rehash
void rehash()
Definition: double_hash_hash_table.cpp:161
+
double_hashing::display
void display()
Definition: double_hash_hash_table.cpp:143
+
double_hashing::remove
void remove(int key)
Definition: double_hash_hash_table.cpp:199
+
std::endl
T endl(T... args)
+
double_hashing::searchingProber
bool searchingProber(const Entry &entry, int key)
Definition: double_hash_hash_table.cpp:133
+
double_hashing::doubleHash
int doubleHash(int key, bool searching)
Performs double hashing to resolve collisions.
Definition: double_hash_hash_table.cpp:71
+
add
std::string add(std::string a, std::string b)
Definition: string_fibonacci.cpp:24
+
double_hashing::Entry::key
int key
key value
Definition: double_hash_hash_table.cpp:38
+
std::hash
+ + + + diff --git a/d0/d65/namespacedouble__hashing.js b/d0/d65/namespacedouble__hashing.js new file mode 100644 index 000000000..82b3dfa46 --- /dev/null +++ b/d0/d65/namespacedouble__hashing.js @@ -0,0 +1,4 @@ +var namespacedouble__hashing = +[ + [ "Entry", "d9/dde/structdouble__hashing_1_1_entry.html", "d9/dde/structdouble__hashing_1_1_entry" ] +]; \ No newline at end of file diff --git a/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.map b/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.map new file mode 100644 index 000000000..4a9d52daf --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.md5 b/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.md5 new file mode 100644 index 000000000..d15a285ce --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.md5 @@ -0,0 +1 @@ +cab5710760fa96f48aaf390ee8bbad1a \ No newline at end of file diff --git a/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.svg b/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.svg new file mode 100644 index 000000000..e6fa6a203 --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +double_hashing::display + + + +Node1 + + +double_hashing::display + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + diff --git a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.map b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.map new file mode 100644 index 000000000..3d1d22d7e --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.md5 b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.md5 new file mode 100644 index 000000000..7fd1a1f1f --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.md5 @@ -0,0 +1 @@ +fb4767eea81b3f03911226bb3a2fe9b7 \ No newline at end of file diff --git a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.svg b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.svg new file mode 100644 index 000000000..83a70bd7f --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.svg @@ -0,0 +1,119 @@ + + + + + + +double_hashing::remove + + + +Node1 + + +double_hashing::remove + + + + + +Node2 + + +double_hashing::doubleHash + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + +Node2->Node3 + + + + + +Node4 + + +double_hashing::hashFxn + + + + + +Node2->Node4 + + + + + +Node5 + + +double_hashing::otherHashFxn + + + + + +Node2->Node5 + + + + + +Node6 + + +double_hashing::putProber + + + + + +Node2->Node6 + + + + + +Node7 + + +double_hashing::searching +Prober + + + + + +Node2->Node7 + + + + + diff --git a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.map b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.map new file mode 100644 index 000000000..e56fc0b33 --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.md5 b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.md5 new file mode 100644 index 000000000..a47fc94ea --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.md5 @@ -0,0 +1 @@ +5b93a99a76a47e8857f488e4cb867c34 \ No newline at end of file diff --git a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.svg b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.svg new file mode 100644 index 000000000..1945c4062 --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.svg @@ -0,0 +1,255 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +double_hashing::removalInfo + + + +Node1 + + +double_hashing::removalInfo + + + + + +Node2 + + +double_hashing::display + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + +Node4 + + +double_hashing::hashFxn + + + + + +Node1->Node4 + + + + + +Node5 + + +double_hashing::remove + + + + + +Node1->Node5 + + + + + +Node2->Node3 + + + + + +Node5->Node3 + + + + + +Node6 + + +double_hashing::doubleHash + + + + + +Node5->Node6 + + + + + +Node6->Node3 + + + + + +Node6->Node4 + + + + + +Node7 + + +double_hashing::otherHashFxn + + + + + +Node6->Node7 + + + + + +Node8 + + +double_hashing::putProber + + + + + +Node6->Node8 + + + + + +Node9 + + +double_hashing::searching +Prober + + + + + +Node6->Node9 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg new file mode 100644 index 000000000..1f8fa14fc --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg @@ -0,0 +1,167 @@ + + + + + + +double_hashing::removalInfo + + + +Node1 + + +double_hashing::removalInfo + + + + + +Node2 + + +double_hashing::display + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + +Node4 + + +double_hashing::hashFxn + + + + + +Node1->Node4 + + + + + +Node5 + + +double_hashing::remove + + + + + +Node1->Node5 + + + + + +Node2->Node3 + + + + + +Node5->Node3 + + + + + +Node6 + + +double_hashing::doubleHash + + + + + +Node5->Node6 + + + + + +Node6->Node3 + + + + + +Node6->Node4 + + + + + +Node7 + + +double_hashing::otherHashFxn + + + + + +Node6->Node7 + + + + + +Node8 + + +double_hashing::putProber + + + + + +Node6->Node8 + + + + + +Node9 + + +double_hashing::searching +Prober + + + + + +Node6->Node9 + + + + + diff --git a/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.map b/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.map new file mode 100644 index 000000000..22984b082 --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.md5 b/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.md5 new file mode 100644 index 000000000..7ebd16747 --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.md5 @@ -0,0 +1 @@ +638be0c4bc7fd581c6282a62557ad2fd \ No newline at end of file diff --git a/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.svg b/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.svg new file mode 100644 index 000000000..55d77d97b --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.svg @@ -0,0 +1,140 @@ + + + + + + +double_hashing::add + + + +Node1 + + +double_hashing::add + + + + + +Node2 + + +double_hashing::doubleHash + + + + + +Node1->Node2 + + + + + +Node8 + + +double_hashing::rehash + + + + + +Node1->Node8 + + + + + +Node3 + + +std::endl + + + + + +Node2->Node3 + + + + + +Node4 + + +double_hashing::hashFxn + + + + + +Node2->Node4 + + + + + +Node5 + + +double_hashing::otherHashFxn + + + + + +Node2->Node5 + + + + + +Node6 + + +double_hashing::putProber + + + + + +Node2->Node6 + + + + + +Node7 + + +double_hashing::searching +Prober + + + + + +Node2->Node7 + + + + + +Node8->Node1 + + + + + +Node8->Node3 + + + + + diff --git a/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.map b/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.map new file mode 100644 index 000000000..0107c2a17 --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.md5 b/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.md5 new file mode 100644 index 000000000..6261916cc --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.md5 @@ -0,0 +1 @@ +cb87d8c49ae963efe3412e3c1716dcce \ No newline at end of file diff --git a/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.svg b/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.svg new file mode 100644 index 000000000..9b97751a5 --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.svg @@ -0,0 +1,98 @@ + + + + + + +double_hashing::doubleHash + + + +Node1 + + +double_hashing::doubleHash + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +double_hashing::hashFxn + + + + + +Node1->Node3 + + + + + +Node4 + + +double_hashing::otherHashFxn + + + + + +Node1->Node4 + + + + + +Node5 + + +double_hashing::putProber + + + + + +Node1->Node5 + + + + + +Node6 + + +double_hashing::searching +Prober + + + + + +Node1->Node6 + + + + + diff --git a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.map b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.map new file mode 100644 index 000000000..c2a6e6c86 --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.map @@ -0,0 +1,12 @@ + + + + + + + + + + + + diff --git a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.md5 b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.md5 new file mode 100644 index 000000000..8282ab7aa --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.md5 @@ -0,0 +1 @@ +798a038178fb73904112459974d2516a \ No newline at end of file diff --git a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.svg b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.svg new file mode 100644 index 000000000..d9c7c8e57 --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.svg @@ -0,0 +1,276 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +double_hashing::addInfo + + + +Node1 + + +double_hashing::addInfo + + + + + +Node2 + + +double_hashing::add + + + + + +Node1->Node2 + + + + + +Node4 + + +std::endl + + + + + +Node1->Node4 + + + + + +Node5 + + +double_hashing::hashFxn + + + + + +Node1->Node5 + + + + + +Node10 + + +double_hashing::display + + + + + +Node1->Node10 + + + + + +Node3 + + +double_hashing::doubleHash + + + + + +Node2->Node3 + + + + + +Node9 + + +double_hashing::rehash + + + + + +Node2->Node9 + + + + + +Node3->Node4 + + + + + +Node3->Node5 + + + + + +Node6 + + +double_hashing::otherHashFxn + + + + + +Node3->Node6 + + + + + +Node7 + + +double_hashing::putProber + + + + + +Node3->Node7 + + + + + +Node8 + + +double_hashing::searching +Prober + + + + + +Node3->Node8 + + + + + +Node9->Node2 + + + + + +Node9->Node4 + + + + + +Node10->Node4 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg new file mode 100644 index 000000000..1718dd2bf --- /dev/null +++ b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg @@ -0,0 +1,188 @@ + + + + + + +double_hashing::addInfo + + + +Node1 + + +double_hashing::addInfo + + + + + +Node2 + + +double_hashing::add + + + + + +Node1->Node2 + + + + + +Node4 + + +std::endl + + + + + +Node1->Node4 + + + + + +Node5 + + +double_hashing::hashFxn + + + + + +Node1->Node5 + + + + + +Node10 + + +double_hashing::display + + + + + +Node1->Node10 + + + + + +Node3 + + +double_hashing::doubleHash + + + + + +Node2->Node3 + + + + + +Node9 + + +double_hashing::rehash + + + + + +Node2->Node9 + + + + + +Node3->Node4 + + + + + +Node3->Node5 + + + + + +Node6 + + +double_hashing::otherHashFxn + + + + + +Node3->Node6 + + + + + +Node7 + + +double_hashing::putProber + + + + + +Node3->Node7 + + + + + +Node8 + + +double_hashing::searching +Prober + + + + + +Node3->Node8 + + + + + +Node9->Node2 + + + + + +Node9->Node4 + + + + + +Node10->Node4 + + + + + diff --git a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.map b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.map new file mode 100644 index 000000000..90fcb3c73 --- /dev/null +++ b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.md5 b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.md5 new file mode 100644 index 000000000..47baed066 --- /dev/null +++ b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.md5 @@ -0,0 +1 @@ +1151e532cad9a0045c191c151c626864 \ No newline at end of file diff --git a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.svg b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.svg new file mode 100644 index 000000000..a4d2e1ad9 --- /dev/null +++ b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.svg @@ -0,0 +1,228 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +double_hashing::rehash + + + +Node1 + + +double_hashing::rehash + + + + + +Node2 + + +double_hashing::add + + + + + +Node1->Node2 + + + + + +Node4 + + +std::endl + + + + + +Node1->Node4 + + + + + +Node2->Node1 + + + + + +Node3 + + +double_hashing::doubleHash + + + + + +Node2->Node3 + + + + + +Node3->Node4 + + + + + +Node5 + + +double_hashing::hashFxn + + + + + +Node3->Node5 + + + + + +Node6 + + +double_hashing::otherHashFxn + + + + + +Node3->Node6 + + + + + +Node7 + + +double_hashing::putProber + + + + + +Node3->Node7 + + + + + +Node8 + + +double_hashing::searching +Prober + + + + + +Node3->Node8 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg new file mode 100644 index 000000000..9a4fc09f1 --- /dev/null +++ b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg @@ -0,0 +1,140 @@ + + + + + + +double_hashing::rehash + + + +Node1 + + +double_hashing::rehash + + + + + +Node2 + + +double_hashing::add + + + + + +Node1->Node2 + + + + + +Node4 + + +std::endl + + + + + +Node1->Node4 + + + + + +Node2->Node1 + + + + + +Node3 + + +double_hashing::doubleHash + + + + + +Node2->Node3 + + + + + +Node3->Node4 + + + + + +Node5 + + +double_hashing::hashFxn + + + + + +Node3->Node5 + + + + + +Node6 + + +double_hashing::otherHashFxn + + + + + +Node3->Node6 + + + + + +Node7 + + +double_hashing::putProber + + + + + +Node3->Node7 + + + + + +Node8 + + +double_hashing::searching +Prober + + + + + +Node3->Node8 + + + + + diff --git a/d1/d21/quick__sort_8cpp.html b/d1/d21/quick__sort_8cpp.html index b61dccb7f..900bcae07 100644 --- a/d1/d21/quick__sort_8cpp.html +++ b/d1/d21/quick__sort_8cpp.html @@ -173,13 +173,7 @@ void show (int arr[],
99  delete[] arr;
100  return 0;
101 }
-
-Here is the call graph for this function:
-
-
-
-
- + diff --git a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map deleted file mode 100644 index 78acb184f..000000000 --- a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 deleted file mode 100644 index 03bdee52d..000000000 --- a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -0d48b25f716ed2a5ec747a0c16da5be7 \ No newline at end of file diff --git a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg deleted file mode 100644 index 610c8e733..000000000 --- a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ /dev/null @@ -1,52 +0,0 @@ - - - - - - -main - - - -Node1 - - -main - - - - - -Node2 - - -sorting::quickSort - - - - - -Node1->Node2 - - - - - -Node3 - - -sorting::partition - - - - - -Node2->Node3 - - - - - diff --git a/d1/d46/classdata__structure_1_1_skip_list.html b/d1/d46/classdata__structure_1_1_skip_list.html index 5e030b68e..fb8ef4216 100644 --- a/d1/d46/classdata__structure_1_1_skip_list.html +++ b/d1/d46/classdata__structure_1_1_skip_list.html @@ -464,7 +464,7 @@ Here is the call graph for this function:
data_structure::PROBABILITY
constexpr float PROBABILITY
Current probability for "coin toss".
Definition: skip_list.cpp:28
-
std::shared_ptr
STL class.
+
std::shared_ptr< Node >
data_structure::SkipList::level
int level
Maximum level of the skiplist.
Definition: skip_list.cpp:56
node
Definition: avltree.cpp:13
Node
Definition: linkedlist_implentation_usingarray.cpp:14
diff --git a/d1/dc7/linear__probing__hash__table_8cpp.html b/d1/dc7/linear__probing__hash__table_8cpp.html new file mode 100644 index 000000000..074857acc --- /dev/null +++ b/d1/dc7/linear__probing__hash__table_8cpp.html @@ -0,0 +1,281 @@ + + + + + + + +Algorithms_in_C++: hashing/linear_probing_hash_table.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+Classes | +Namespaces | +Typedefs | +Functions | +Variables
+
+
linear_probing_hash_table.cpp File Reference
+
+
+ +

Storage mechanism using linear probing hash keys. +More...

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

+Classes

struct  linear_probing::Entry
 
+ + + + +

+Namespaces

 linear_probing
 An implementation of hash table using linear probing algorithm.
 
+ + + +

+Typedefs

+using linear_probing::Entry = struct Entry
 
+ + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

bool linear_probing::putProber (const Entry &entry, int key)
 
bool linear_probing::searchingProber (const Entry &entry, int key)
 
void linear_probing::add (int key)
 
size_t linear_probing::hashFxn (int key)
 Hash a key. Uses the STL library's std::hash() function. More...
 
int linear_probing::linearProbe (int key, bool searching)
 
void linear_probing::display ()
 
void linear_probing::rehash ()
 
void linear_probing::remove (int key)
 
void linear_probing::addInfo (int key)
 
void linear_probing::removalInfo (int key)
 
int main ()
 
+ + + + + + + + + + + + + +

+Variables

+int linear_probing::notPresent
 
+std::vector< Entry > linear_probing::table
 
+int linear_probing::totalSize
 
+int linear_probing::tomb = -1
 
+int linear_probing::size
 
+bool linear_probing::rehashing
 
+

Detailed Description

+

Storage mechanism using linear probing hash keys.

+
Author
achance6
+
+Krishna Vedala
+
Note
The implementation can be optimized by using OOP style.
+

Function Documentation

+ +

◆ main()

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

Main function

Returns
0 on success
+
224  {
+
225  int cmd = 0, hash = 0, key = 0;
+
226  std::cout << "Enter the initial size of Hash Table. = ";
+
227  std::cin >> totalSize;
+
228  table = std::vector<Entry>(totalSize);
+
229  bool loop = true;
+
230  while (loop) {
+
231  std::cout << std::endl;
+
232  std::cout << "PLEASE CHOOSE -" << std::endl;
+
233  std::cout << "1. Add key. (Numeric only)" << std::endl;
+
234  std::cout << "2. Remove key." << std::endl;
+
235  std::cout << "3. Find key." << std::endl;
+
236  std::cout << "4. Generate Hash. (Numeric only)" << std::endl;
+
237  std::cout << "5. Display Hash table." << std::endl;
+
238  std::cout << "6. Exit." << std::endl;
+
239  std::cin >> cmd;
+
240  switch (cmd) {
+
241  case 1:
+
242  std::cout << "Enter key to add = ";
+
243  std::cin >> key;
+
244  linear_probing::addInfo(key);
+
245  break;
+
246  case 2:
+
247  std::cout << "Enter key to remove = ";
+
248  std::cin >> key;
+
249  linear_probing::removalInfo(key);
+
250  break;
+
251  case 3: {
+
252  std::cout << "Enter key to search = ";
+
253  std::cin >> key;
+
254  Entry entry = table[linear_probing::linearProbe(key, true)];
+
255  if (entry.key == linear_probing::notPresent) {
+
256  std::cout << "Key not present";
+
257  }
+
258  break;
+
259  }
+
260  case 4:
+
261  std::cout << "Enter element to generate hash = ";
+
262  std::cin >> key;
+
263  std::cout << "Hash of " << key
+
264  << " is = " << linear_probing::hashFxn(key);
+
265  break;
+
266  case 5:
+
267  linear_probing::display();
+
268  break;
+
269  default:
+
270  loop = false;
+
271  break;
+
272  // delete[] table;
+
273  }
+
274  std::cout << std::endl;
+
275  }
+
276  return 0;
+
277 }
+
+
+
+
+
+
linear_probing::Entry::key
int key
key value
Definition: linear_probing_hash_table.cpp:37
+
linear_probing::Entry
Definition: linear_probing_hash_table.cpp:35
+
std::vector
STL class.
+
linear_probing::hashFxn
size_t hashFxn(int key)
Hash a key. Uses the STL library's std::hash() function.
Definition: linear_probing_hash_table.cpp:46
+
linear_probing::addInfo
void addInfo(int key)
Definition: linear_probing_hash_table.cpp:186
+
linear_probing::linearProbe
int linearProbe(int key, bool searching)
Definition: linear_probing_hash_table.cpp:55
+
std::cout
+
std::endl
T endl(T... args)
+
linear_probing::removalInfo
void removalInfo(int key)
Definition: linear_probing_hash_table.cpp:201
+
linear_probing::display
void display()
Definition: linear_probing_hash_table.cpp:120
+
std::cin
+ + + + diff --git a/d1/dc7/linear__probing__hash__table_8cpp.js b/d1/dc7/linear__probing__hash__table_8cpp.js new file mode 100644 index 000000000..ab88e2553 --- /dev/null +++ b/d1/dc7/linear__probing__hash__table_8cpp.js @@ -0,0 +1,22 @@ +var linear__probing__hash__table_8cpp = +[ + [ "Entry", "db/d19/structlinear__probing_1_1_entry.html", "db/d19/structlinear__probing_1_1_entry" ], + [ "Entry", "d1/dc7/linear__probing__hash__table_8cpp.html#a2de838f453df67b72411eefb7faf833c", null ], + [ "add", "d1/dc7/linear__probing__hash__table_8cpp.html#a16d34fd3511626a83ab00665d7bc34d1", null ], + [ "addInfo", "d1/dc7/linear__probing__hash__table_8cpp.html#a16680b8a37d442c2f208faa286e33908", null ], + [ "display", "d1/dc7/linear__probing__hash__table_8cpp.html#ad87b71d810901fab69c4ad9d4d0fa635", null ], + [ "hashFxn", "d1/dc7/linear__probing__hash__table_8cpp.html#a4bde7a47f98dd1ad24c84038e2608527", null ], + [ "linearProbe", "d1/dc7/linear__probing__hash__table_8cpp.html#a6322209aaa91b7bbf16f96e1cc52b746", null ], + [ "main", "d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "putProber", "d1/dc7/linear__probing__hash__table_8cpp.html#a75d779938df7ebc68581d922b60a2541", null ], + [ "rehash", "d1/dc7/linear__probing__hash__table_8cpp.html#a6a082dc1426a79f866cee6b370df37b0", null ], + [ "removalInfo", "d1/dc7/linear__probing__hash__table_8cpp.html#a75854f5aa216e61219154c62167ce8f0", null ], + [ "remove", "d1/dc7/linear__probing__hash__table_8cpp.html#abcf8d033f8115f39f3c93cfb6cee0b28", null ], + [ "searchingProber", "d1/dc7/linear__probing__hash__table_8cpp.html#a942fc8407b8001890ea26830cdcd9d77", null ], + [ "notPresent", "d1/dc7/linear__probing__hash__table_8cpp.html#addfce7597f6a42f796fa597ae40eecc9", null ], + [ "rehashing", "d1/dc7/linear__probing__hash__table_8cpp.html#a5ff22c1a04290e24ef3ba3d6a3a06386", null ], + [ "size", "d1/dc7/linear__probing__hash__table_8cpp.html#a8e81b17f2f8403c982368da3dac1ae87", null ], + [ "table", "d1/dc7/linear__probing__hash__table_8cpp.html#acb1dc3f09cf07c2633580a1c46c9f0a8", null ], + [ "tomb", "d1/dc7/linear__probing__hash__table_8cpp.html#a62fbd519adacd4e05706f34a7e551288", null ], + [ "totalSize", "d1/dc7/linear__probing__hash__table_8cpp.html#a4fdb68db9f02ae4156e1845563004f8e", null ] +]; \ No newline at end of file diff --git a/d2/d21/gnome__sort_8cpp.html b/d2/d21/gnome__sort_8cpp.html index 9c24530f5..9905de641 100644 --- a/d2/d21/gnome__sort_8cpp.html +++ b/d2/d21/gnome__sort_8cpp.html @@ -160,7 +160,7 @@ Functions
Here is the call graph for this function:
-
+
@@ -230,13 +230,7 @@ Here is the call graph for this function:
123  // for (int i = 0; i < size; i++) std::cout << double_arr[i] << ", ";
124  std::cout << std::endl;
125 }
-
-Here is the call graph for this function:
-
-
-
-
- + diff --git a/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map deleted file mode 100644 index d08f6e916..000000000 --- a/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - - - - - diff --git a/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 deleted file mode 100644 index f08136d38..000000000 --- a/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -903a73aabd9d686b0257a3769717c2b2 \ No newline at end of file diff --git a/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg deleted file mode 100644 index 4c6026b74..000000000 --- a/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ /dev/null @@ -1,127 +0,0 @@ - - - - - - -test - - - -Node1 - - -test - - - - - -Node2 - - -std::begin - - - - - -Node1->Node2 - - - - - -Node3 - - -std::end - - - - - -Node1->Node3 - - - - - -Node4 - - -std::endl - - - - - -Node1->Node4 - - - - - -Node5 - - -sorting::gnomeSort - - - - - -Node1->Node5 - - - - - -Node7 - - -std::is_sorted - - - - - -Node1->Node7 - - - - - -Node8 - - -std::rand - - - - - -Node1->Node8 - - - - - -Node6 - - -std::swap - - - - - -Node5->Node6 - - - - - diff --git a/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 80a1762aa..a6be7b326 100644 --- a/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,11 +1,4 @@ - - - - - - - - - + + diff --git a/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 4f44c894e..b58021ac5 100644 --- a/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -a947026541c741d9ca7deee819571cc1 \ No newline at end of file +a55c85c1e53b340092862645fc98c84e \ No newline at end of file diff --git a/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index a6dd64c65..3eca7bd03 100644 --- a/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,17 +4,17 @@ - - + + main - + Node1 - -main + +main @@ -22,121 +22,16 @@ Node2 - -test + +test Node1->Node2 - - - - - -Node3 - - -std::begin - - - - - -Node2->Node3 - - - - - -Node4 - - -std::end - - - - - -Node2->Node4 - - - - - -Node5 - - -std::endl - - - - - -Node2->Node5 - - - - - -Node6 - - -sorting::gnomeSort - - - - - -Node2->Node6 - - - - - -Node8 - - -std::is_sorted - - - - - -Node2->Node8 - - - - - -Node9 - - -std::rand - - - - - -Node2->Node9 - - - - - -Node7 - - -std::swap - - - - - -Node6->Node7 - - + + diff --git a/d4/d6d/struct_entry-members.html b/d2/de3/structlinear__probing_1_1_entry-members.html similarity index 73% rename from d4/d6d/struct_entry-members.html rename to d2/de3/structlinear__probing_1_1_entry-members.html index 22f8ec467..33a01278f 100644 --- a/d4/d6d/struct_entry-members.html +++ b/d2/de3/structlinear__probing_1_1_entry-members.html @@ -71,7 +71,7 @@ $(function() {
@@ -91,16 +91,14 @@ $(document).ready(function(){initNavTree('dd/d3b/struct_entry.html','../../'); i
-
Entry Member List
+
linear_probing::Entry Member List
-

This is the complete list of members for Entry, including all inherited members.

+

This is the complete list of members for linear_probing::Entry, including all inherited members.

- - - - + +
Entry(int key=notPresent) (defined in Entry)Entryinlineexplicit
Entry(int key=notPresent) (defined in Entry)Entryinlineexplicit
Entry(int key=notPresent) (defined in Entry)Entryinlineexplicit
key (defined in Entry)Entry
Entry(int key=notPresent)linear_probing::Entryinlineexplicit
keylinear_probing::Entry
diff --git a/d3/d4c/quick__sort__3_8cpp.html b/d3/d4c/quick__sort__3_8cpp.html index 96ece4cb0..e01625801 100644 --- a/d3/d4c/quick__sort__3_8cpp.html +++ b/d3/d4c/quick__sort__3_8cpp.html @@ -163,7 +163,7 @@ Functions
Here is the call graph for this function:
-
+
@@ -213,13 +213,7 @@ Here is the call graph for this function:
178  std::cout << "\t Passed\n";
179  }
180 }
-
-Here is the call graph for this function:
-
-
-
-
- + @@ -265,13 +259,7 @@ Here is the call graph for this function:
155  std::cout << "\t Passed\n";
156  }
157 }
-
-Here is the call graph for this function:
-
-
-
-
- + diff --git a/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.map b/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.map deleted file mode 100644 index 810c15a00..000000000 --- a/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.map +++ /dev/null @@ -1,8 +0,0 @@ - - - - - - - - diff --git a/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.md5 b/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.md5 deleted file mode 100644 index 4a866423b..000000000 --- a/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -4de133931f5c447c6aa3f5df279226a3 \ No newline at end of file diff --git a/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.svg b/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.svg deleted file mode 100644 index 08517eb85..000000000 --- a/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.svg +++ /dev/null @@ -1,97 +0,0 @@ - - - - - - -test_int - - - -Node1 - - -test_int - - - - - -Node2 - - -std::begin - - - - - -Node1->Node2 - - - - - -Node3 - - -std::end - - - - - -Node1->Node3 - - - - - -Node4 - - -std::is_sorted - - - - - -Node1->Node4 - - - - - -Node5 - - -sorting::quicksort - - - - - -Node1->Node5 - - - - - -Node6 - - -std::rand - - - - - -Node1->Node6 - - - - - diff --git a/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.map b/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.map deleted file mode 100644 index 301669cd2..000000000 --- a/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.map +++ /dev/null @@ -1,8 +0,0 @@ - - - - - - - - diff --git a/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.md5 b/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.md5 deleted file mode 100644 index abe66cb7e..000000000 --- a/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -0fcee00306e3065a9d7f71538de2afe4 \ No newline at end of file diff --git a/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.svg b/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.svg deleted file mode 100644 index 53879d28b..000000000 --- a/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.svg +++ /dev/null @@ -1,97 +0,0 @@ - - - - - - -test_double - - - -Node1 - - -test_double - - - - - -Node2 - - -std::begin - - - - - -Node1->Node2 - - - - - -Node3 - - -std::end - - - - - -Node1->Node3 - - - - - -Node4 - - -std::is_sorted - - - - - -Node1->Node4 - - - - - -Node5 - - -sorting::quicksort - - - - - -Node1->Node5 - - - - - -Node6 - - -std::rand - - - - - -Node1->Node6 - - - - - diff --git a/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index ad29e4e64..d52d2588d 100644 --- a/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,12 +1,7 @@ - - - - - - - - - - + + + + + diff --git a/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 3bd31ce54..06fb8e0b7 100644 --- a/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -d13500d3fa378b64163ad1f8952448e1 \ No newline at end of file +3b13e7bb66ce09acf86a5f515d392999 \ No newline at end of file diff --git a/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 2d97d6175..0adb514b3 100644 --- a/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,17 +4,17 @@ - - + + main - + Node1 - -main + +main @@ -22,166 +22,61 @@ Node2 - -std::srand + +std::srand Node1->Node2 - - + + Node3 - -test_double + +test_double Node1->Node3 - - - - - -Node9 - - -test_int - - - - - -Node1->Node9 - - - - - -Node10 - - -std::time - - - - - -Node1->Node10 - - + + Node4 - - -std::begin + + +test_int - + -Node3->Node4 - - +Node1->Node4 + + Node5 - - -std::end + + +std::time - + -Node3->Node5 - - - - - -Node6 - - -std::is_sorted - - - - - -Node3->Node6 - - - - - -Node7 - - -sorting::quicksort - - - - - -Node3->Node7 - - - - - -Node8 - - -std::rand - - - - - -Node3->Node8 - - - - - -Node9->Node4 - - - - - -Node9->Node5 - - - - - -Node9->Node6 - - - - - -Node9->Node7 - - - - - -Node9->Node8 - - +Node1->Node5 + + diff --git a/d3/d6f/structdata__structure_1_1_node.html b/d3/d6f/structdata__structure_1_1_node.html index abe0b5ee4..75c5e5e0b 100644 --- a/d3/d6f/structdata__structure_1_1_node.html +++ b/d3/d6f/structdata__structure_1_1_node.html @@ -177,10 +177,16 @@ void * 
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:
+
+
+
+
+
The documentation for this struct was generated from the following file: