diff --git a/docs/html/avl__tree_8h_source.html b/docs/html/avl__tree_8h_source.html index f55815d5..37ba4b73 100644 --- a/docs/html/avl__tree_8h_source.html +++ b/docs/html/avl__tree_8h_source.html @@ -203,266 +203,308 @@
160
-
165 void visualize() {
-
166 std::string __generated = generate_visualization();
-
167 tree_visualization::visualize(__generated);
-
168 }
+
165 std::vector<std::vector<T>> level_order() {
+
166 std::vector<std::vector<T>> path;
+
167 std::queue<std::shared_ptr<node>> q;
+
168 q.push(root);
+
169 while (!q.empty()) {
+
170 size_t size = q.size();
+
171 std::vector<T> level;
+
172 for (size_t i = 0; i < size; i++) {
+
173 std::shared_ptr<node> current = q.front();
+
174 q.pop();
+
175 level.push_back(current->info);
+
176 if (current->left) {
+
177 q.push(current->left);
+
178 }
+
179 if (current->right) {
+
180 q.push(current->right);
+
181 }
+
182 }
+
183 path.push_back(level);
+
184 }
+
185 return path;
+
186 }
-
169
-
170private:
-
178 typedef struct node {
-
179 T info;
-
180 int64_t height;
-
181 std::shared_ptr<node> left;
-
182 std::shared_ptr<node> right;
-
183 node(T key) : info(key), left(nullptr), right(nullptr), height(0) {}
-
184 } node;
-
185
-
186 std::shared_ptr<node> root;
-
187 size_t __size;
-
188
-
189 int64_t height(std::shared_ptr<node> root) {
-
190 if (root == nullptr)
-
191 return 0;
-
192 return 1 + std::max(height(root->left), height(root->right));
-
193 }
-
194
-
195 std::shared_ptr<node> createNode(T info) {
-
196 std::shared_ptr<node> nn = std::make_shared<node>(info);
-
197 return nn;
-
198 }
-
199
-
200 int64_t getBalance(std::shared_ptr<node> root) {
-
201 return height(root->left) - height(root->right);
-
202 }
-
203
-
204 std::shared_ptr<node> rightRotate(std::shared_ptr<node> root) {
-
205 std::shared_ptr<node> t = root->left;
-
206 std::shared_ptr<node> u = t->right;
-
207 t->right = root;
-
208 root->left = u;
-
209 return t;
-
210 }
-
211
-
212 std::shared_ptr<node> leftRotate(std::shared_ptr<node> root) {
-
213 std::shared_ptr<node> t = root->right;
-
214 std::shared_ptr<node> u = t->left;
-
215 t->left = root;
-
216 root->right = u;
-
217 return t;
-
218 }
-
219
-
220 std::shared_ptr<node> minValue(std::shared_ptr<node> root) {
-
221 if (root->left == nullptr)
-
222 return root;
-
223 return minValue(root->left);
-
224 }
-
225
-
226 std::shared_ptr<node> __insert(std::shared_ptr<node> root, T item) {
-
227 std::shared_ptr<node> nn = createNode(item);
-
228 if (root == nullptr)
-
229 return nn;
-
230 if (item < root->info)
-
231 root->left = __insert(root->left, item);
-
232 else
-
233 root->right = __insert(root->right, item);
-
234 int b = getBalance(root);
-
235 if (b > 1) {
-
236 if (getBalance(root->left) < 0)
-
237 root->left = leftRotate(root->left);
-
238 return rightRotate(root);
-
239 } else if (b < -1) {
-
240 if (getBalance(root->right) > 0)
-
241 root->right = rightRotate(root->right);
-
242 return leftRotate(root);
-
243 }
-
244 return root;
-
245 }
-
246
-
247 std::shared_ptr<node> __remove(std::shared_ptr<node> root, T key) {
-
248 if (root == nullptr)
-
249 return root;
-
250 if (key < root->info)
-
251 root->left = __remove(root->left, key);
-
252 else if (key > root->info)
-
253 root->right = __remove(root->right, key);
-
254
-
255 else {
-
256 if (!root->right) {
-
257 std::shared_ptr<node> temp = root->left;
-
258 root = nullptr;
-
259 return temp;
-
260 } else if (!root->left) {
-
261 std::shared_ptr<node> temp = root->right;
-
262 root = nullptr;
-
263 return temp;
-
264 }
-
265 std::shared_ptr<node> temp = minValue(root->right);
-
266 root->info = temp->info;
-
267 root->right = __remove(root->right, temp->info);
-
268 }
-
269 return root;
-
270 }
-
271
-
272 bool __search(std::shared_ptr<node> root, T key) {
-
273 while (root) {
-
274 if (root->info < key) {
-
275 root = root->right;
-
276 } else if (root->info > key) {
-
277 root = root->left;
-
278 } else {
-
279 return true;
-
280 }
-
281 }
-
282 return false;
-
283 }
-
284
-
285 void __inorder(std::function<void(std::shared_ptr<node>)> callback,
-
286 std::shared_ptr<node> root) {
-
287 if (root) {
-
288 __inorder(callback, root->left);
-
289 callback(root);
-
290 __inorder(callback, root->right);
-
291 }
-
292 }
-
293
-
294 void __postorder(std::function<void(std::shared_ptr<node>)> callback,
-
295 std::shared_ptr<node> root) {
-
296 if (root) {
-
297 __inorder(callback, root->left);
-
298 __inorder(callback, root->right);
-
299 callback(root);
-
300 }
-
301 }
-
302
-
303 void __preorder(std::function<void(std::shared_ptr<node>)> callback,
-
304 std::shared_ptr<node> root) {
-
305 if (root) {
-
306 callback(root);
-
307 __inorder(callback, root->left);
-
308 __inorder(callback, root->right);
-
309 }
-
310 }
-
311
-
312 std::string generate_visualization() {
-
313 std::string __generate = __inorder_gen(root);
-
314 return __generate;
+
187
+
+
192 void visualize() {
+
193 std::string __generated = generate_visualization();
+
194 tree_visualization::visualize(__generated);
+
195 }
+
+
196
+
+
200 friend ostream & operator << (ostream &out, avl_tree<T> &t){
+
201 std::vector<std::vector<T> > order = t.level_order();
+
202 for(std::vector<T> & x : order){
+
203 for(size_t i = 0; i < x.size(); i++){
+
204 if(i != x.size() - 1){
+
205 out << x[i] << ", ";
+
206 }
+
207 else{
+
208 out << x[i] << '\n';
+
209 }
+
210 }
+
211 }
+
212 return out;
+
213 }
+
+
214
+
215private:
+
223 typedef struct node {
+
224 T info;
+
225 int64_t height;
+
226 std::shared_ptr<node> left;
+
227 std::shared_ptr<node> right;
+
228 node(T key) : info(key), left(nullptr), right(nullptr), height(0) {}
+
229 } node;
+
230
+
231 std::shared_ptr<node> root;
+
232 size_t __size;
+
233
+
234 int64_t height(std::shared_ptr<node> root) {
+
235 if (root == nullptr)
+
236 return 0;
+
237 return 1 + std::max(height(root->left), height(root->right));
+
238 }
+
239
+
240 std::shared_ptr<node> createNode(T info) {
+
241 std::shared_ptr<node> nn = std::make_shared<node>(info);
+
242 return nn;
+
243 }
+
244
+
245 int64_t getBalance(std::shared_ptr<node> root) {
+
246 return height(root->left) - height(root->right);
+
247 }
+
248
+
249 std::shared_ptr<node> rightRotate(std::shared_ptr<node> root) {
+
250 std::shared_ptr<node> t = root->left;
+
251 std::shared_ptr<node> u = t->right;
+
252 t->right = root;
+
253 root->left = u;
+
254 return t;
+
255 }
+
256
+
257 std::shared_ptr<node> leftRotate(std::shared_ptr<node> root) {
+
258 std::shared_ptr<node> t = root->right;
+
259 std::shared_ptr<node> u = t->left;
+
260 t->left = root;
+
261 root->right = u;
+
262 return t;
+
263 }
+
264
+
265 std::shared_ptr<node> minValue(std::shared_ptr<node> root) {
+
266 if (root->left == nullptr)
+
267 return root;
+
268 return minValue(root->left);
+
269 }
+
270
+
271 std::shared_ptr<node> __insert(std::shared_ptr<node> root, T item) {
+
272 std::shared_ptr<node> nn = createNode(item);
+
273 if (root == nullptr)
+
274 return nn;
+
275 if (item < root->info)
+
276 root->left = __insert(root->left, item);
+
277 else
+
278 root->right = __insert(root->right, item);
+
279 int b = getBalance(root);
+
280 if (b > 1) {
+
281 if (getBalance(root->left) < 0)
+
282 root->left = leftRotate(root->left);
+
283 return rightRotate(root);
+
284 } else if (b < -1) {
+
285 if (getBalance(root->right) > 0)
+
286 root->right = rightRotate(root->right);
+
287 return leftRotate(root);
+
288 }
+
289 return root;
+
290 }
+
291
+
292 std::shared_ptr<node> __remove(std::shared_ptr<node> root, T key) {
+
293 if (root == nullptr)
+
294 return root;
+
295 if (key < root->info)
+
296 root->left = __remove(root->left, key);
+
297 else if (key > root->info)
+
298 root->right = __remove(root->right, key);
+
299
+
300 else {
+
301 if (!root->right) {
+
302 std::shared_ptr<node> temp = root->left;
+
303 root = nullptr;
+
304 return temp;
+
305 } else if (!root->left) {
+
306 std::shared_ptr<node> temp = root->right;
+
307 root = nullptr;
+
308 return temp;
+
309 }
+
310 std::shared_ptr<node> temp = minValue(root->right);
+
311 root->info = temp->info;
+
312 root->right = __remove(root->right, temp->info);
+
313 }
+
314 return root;
315 }
316
-
317 std::string __inorder_gen(std::shared_ptr<node> root) {
-
318 std::string __s;
-
319 if (std::is_same_v<T, char> || std::is_same_v<T, std::string>) {
-
320 if (root->left) {
-
321 __s += root->info;
-
322 __s += "->";
-
323 __s += root->left->info;
-
324 __s += "\n";
-
325 __s += __inorder_gen(root->left);
-
326 }
-
327 if (root->right) {
-
328 __s += root->info;
-
329 __s += "->";
-
330 __s += root->right->info;
-
331 __s += "\n";
-
332 __s += __inorder_gen(root->right);
-
333 }
-
334 } else {
-
335 if (root->left) {
-
336 __s += std::to_string(root->info) + "->" +
-
337 std::to_string(root->left->info) + "\n" +
-
338 __inorder_gen(root->left);
-
339 }
-
340 if (root->right) {
-
341 __s += std::to_string(root->info) + "->" +
-
342 std::to_string(root->right->info) + "\n" +
-
343 __inorder_gen(root->right);
-
344 }
+
317 bool __search(std::shared_ptr<node> root, T key) {
+
318 while (root) {
+
319 if (root->info < key) {
+
320 root = root->right;
+
321 } else if (root->info > key) {
+
322 root = root->left;
+
323 } else {
+
324 return true;
+
325 }
+
326 }
+
327 return false;
+
328 }
+
329
+
330 void __inorder(std::function<void(std::shared_ptr<node>)> callback,
+
331 std::shared_ptr<node> root) {
+
332 if (root) {
+
333 __inorder(callback, root->left);
+
334 callback(root);
+
335 __inorder(callback, root->right);
+
336 }
+
337 }
+
338
+
339 void __postorder(std::function<void(std::shared_ptr<node>)> callback,
+
340 std::shared_ptr<node> root) {
+
341 if (root) {
+
342 __inorder(callback, root->left);
+
343 __inorder(callback, root->right);
+
344 callback(root);
345 }
-
346 return __s;
-
347 }
-
348};
+
346 }
+
347
+
348 void __preorder(std::function<void(std::shared_ptr<node>)> callback,
+
349 std::shared_ptr<node> root) {
+
350 if (root) {
+
351 callback(root);
+
352 __inorder(callback, root->left);
+
353 __inorder(callback, root->right);
+
354 }
+
355 }
+
356
+
357 std::string generate_visualization() {
+
358 std::string __generate = __inorder_gen(root);
+
359 return __generate;
+
360 }
+
361
+
362 std::string __inorder_gen(std::shared_ptr<node> root) {
+
363 std::string __s;
+
364 if (std::is_same_v<T, char> || std::is_same_v<T, std::string>) {
+
365 if (root->left) {
+
366 __s += root->info;
+
367 __s += "->";
+
368 __s += root->left->info;
+
369 __s += "\n";
+
370 __s += __inorder_gen(root->left);
+
371 }
+
372 if (root->right) {
+
373 __s += root->info;
+
374 __s += "->";
+
375 __s += root->right->info;
+
376 __s += "\n";
+
377 __s += __inorder_gen(root->right);
+
378 }
+
379 } else {
+
380 if (root->left) {
+
381 __s += std::to_string(root->info) + "->" +
+
382 std::to_string(root->left->info) + "\n" +
+
383 __inorder_gen(root->left);
+
384 }
+
385 if (root->right) {
+
386 __s += std::to_string(root->info) + "->" +
+
387 std::to_string(root->right->info) + "\n" +
+
388 __inorder_gen(root->right);
+
389 }
+
390 }
+
391 return __s;
+
392 }
+
393};
-
349
-
-
353template <typename T> class avl_tree<T>::Iterator {
-
354private:
-
355 std::vector<T> elements;
-
356 int64_t index;
-
357
-
358public:
-
-
364 explicit Iterator(const int64_t &index, std::vector<T> &els) noexcept
-
365 : index(index), elements(els) {}
+
394
+
+
398template <typename T> class avl_tree<T>::Iterator {
+
399private:
+
400 std::vector<T> elements;
+
401 int64_t index;
+
402
+
403public:
+
+
409 explicit Iterator(const int64_t &index, std::vector<T> &els) noexcept
+
410 : index(index), elements(els) {}
-
366
-
-
373 Iterator &operator=(int64_t index) {
-
374 this->index = index;
-
375 return *(this);
-
376 }
+
411
+
+
418 Iterator &operator=(int64_t index) {
+
419 this->index = index;
+
420 return *(this);
+
421 }
-
377
-
- -
384 if (this->index < elements.size()) {
-
385 this->index++;
-
386 }
-
387 return *(this);
-
388 }
+
422
+
+ +
429 if (this->index < elements.size()) {
+
430 this->index++;
+
431 }
+
432 return *(this);
+
433 }
-
389
-
- -
396 Iterator it = *this;
-
397 ++*(this);
-
398 return it;
-
399 }
+
434
+
+ +
441 Iterator it = *this;
+
442 ++*(this);
+
443 return it;
+
444 }
-
400
-
- -
407 if (this->index > 0) {
-
408 this->index--;
-
409 }
-
410 return *(this);
-
411 }
+
445
+
+ +
452 if (this->index > 0) {
+
453 this->index--;
+
454 }
+
455 return *(this);
+
456 }
-
412
-
- -
419 Iterator it = *this;
-
420 --*(this);
-
421 return it;
-
422 }
+
457
+
+ +
464 Iterator it = *this;
+
465 --*(this);
+
466 return it;
+
467 }
-
423
-
-
432 bool operator!=(const Iterator &it) {
-
433 return index != it.index && elements[index] != it.elements[it.index];
-
434 }
+
468
+
+
477 bool operator!=(const Iterator &it) {
+
478 return index != it.index && elements[index] != it.elements[it.index];
+
479 }
-
435
-
441 T operator*() { return elements[index]; }
-
442};
+
480
+
486 T operator*() { return elements[index]; }
+
487};
-
443
-
444#endif
-
Iterator class.
Definition avl_tree.h:353
-
Iterator(const int64_t &index, std::vector< T > &els) noexcept
Construct a new Iterator object.
Definition avl_tree.h:364
-
bool operator!=(const Iterator &it)
operator != for type Iterator
Definition avl_tree.h:432
-
Iterator & operator--()
operator – for type Iterator
Definition avl_tree.h:406
-
Iterator & operator++()
operator ++ for type Iterator
Definition avl_tree.h:383
-
T operator*()
operator * for type Iterator
Definition avl_tree.h:441
-
Iterator operator++(int)
operator ++ for type Iterator
Definition avl_tree.h:395
-
Iterator & operator=(int64_t index)
= operator for Iterator type
Definition avl_tree.h:373
-
Iterator operator--(int)
operator – for type Iterator
Definition avl_tree.h:418
+
488
+
489#endif
+
Iterator class.
Definition avl_tree.h:398
+
Iterator(const int64_t &index, std::vector< T > &els) noexcept
Construct a new Iterator object.
Definition avl_tree.h:409
+
bool operator!=(const Iterator &it)
operator != for type Iterator
Definition avl_tree.h:477
+
Iterator & operator--()
operator – for type Iterator
Definition avl_tree.h:451
+
Iterator & operator++()
operator ++ for type Iterator
Definition avl_tree.h:428
+
T operator*()
operator * for type Iterator
Definition avl_tree.h:486
+
Iterator operator++(int)
operator ++ for type Iterator
Definition avl_tree.h:440
+
Iterator & operator=(int64_t index)
= operator for Iterator type
Definition avl_tree.h:418
+
Iterator operator--(int)
operator – for type Iterator
Definition avl_tree.h:463
Class for AVL tree.
Definition avl_tree.h:17
Iterator end()
pointer that points to end
Definition avl_tree.h:101
avl_tree(std::vector< T > __elements={}) noexcept
Contructor for AVL tree class.
Definition avl_tree.h:24
Iterator begin()
pointer that points to begin
Definition avl_tree.h:91
void clear()
clear function Erase all the nodes from the tree.
Definition avl_tree.h:71
avl_tree(const avl_tree &a)
Copy constructor for avl tree class.
Definition avl_tree.h:36
-
void visualize()
visualize function
Definition avl_tree.h:165
+
void visualize()
visualize function
Definition avl_tree.h:192
bool search(T key)
search function.
Definition avl_tree.h:82
avl_tree & operator=(const avl_tree &a)
operator = for avl tree class
Definition avl_tree.h:46
void remove(T key)
remove function.
Definition avl_tree.h:116
@@ -470,6 +512,8 @@
std::vector< T > postorder()
postorder function.
Definition avl_tree.h:151
std::vector< T > preorder()
preorder function.
Definition avl_tree.h:138
size_t size()
size function
Definition avl_tree.h:111
+
std::vector< std::vector< T > > level_order()
level order function.
Definition avl_tree.h:165
+
friend ostream & operator<<(ostream &out, avl_tree< T > &t)
operator << for avl_tree class
Definition avl_tree.h:200
void insert(T key)
insert function.
Definition avl_tree.h:62
std::vector< T > inorder()
inorder function.
Definition avl_tree.h:125
diff --git a/docs/html/bst_8h_source.html b/docs/html/bst_8h_source.html index e02560a8..4be53464 100644 --- a/docs/html/bst_8h_source.html +++ b/docs/html/bst_8h_source.html @@ -206,221 +206,265 @@
158
-
163 void visualize() {
-
164 std::string __generated = generate_visualization();
-
165 tree_visualization::visualize(__generated);
-
166 }
+
163 std::vector<std::vector<T>> level_order() {
+
164 std::vector<std::vector<T>> path;
+
165 std::queue<std::shared_ptr<node>> q;
+
166 q.push(root);
+
167 while (!q.empty()) {
+
168 size_t size = q.size();
+
169 std::vector<T> level;
+
170 for (size_t i = 0; i < size; i++) {
+
171 std::shared_ptr<node> current = q.front();
+
172 q.pop();
+
173 level.push_back(current->info);
+
174 if (current->left) {
+
175 q.push(current->left);
+
176 }
+
177 if (current->right) {
+
178 q.push(current->right);
+
179 }
+
180 }
+
181 path.push_back(level);
+
182 }
+
183 return path;
+
184 }
-
167
-
168private:
-
175 typedef struct node {
-
176 T info;
-
177 std::shared_ptr<node> right;
-
178 std::shared_ptr<node> left;
-
179 node(T key) : info(key), right(nullptr), left(nullptr) {}
-
180 } node;
-
181
-
182 std::shared_ptr<node> root;
-
183 size_t __size;
-
184
-
185 std::shared_ptr<node> new_node(T &key) {
-
186 std::shared_ptr<node> p = std::make_shared<node>(key);
-
187 return p;
-
188 }
-
189
-
190 std::shared_ptr<node> __insert(std::shared_ptr<node> root, T &key) {
-
191 if (!root) {
-
192 return new_node(key);
-
193 } else {
-
194 if (root->info < key) {
-
195 root->right = __insert(root->right, key);
-
196 } else {
-
197 root->left = __insert(root->left, key);
-
198 }
-
199 }
-
200 return root;
-
201 }
-
202
-
203 bool __search(std::shared_ptr<node> root, T &key) {
-
204 while (root) {
-
205 if (root->info < key) {
-
206 root = root->right;
-
207 } else if (root->info > key) {
-
208 root = root->left;
-
209 } else {
-
210 return true;
-
211 }
-
212 }
-
213 return false;
-
214 }
-
215
-
216 std::shared_ptr<node> __remove(std::shared_ptr<node> root, T &key) {
-
217 if (!root) {
-
218 return root;
-
219 }
-
220
-
221 if (root->info < key) {
-
222 root->right = __remove(root->right, key);
-
223 } else if (root->info > key) {
-
224 root->left = __remove(root->left, key);
-
225 } else {
-
226 if (!root->left && !root->right) {
-
227 root = nullptr;
-
228 } else if (!root->left) {
-
229 std::shared_ptr<node> temp = root->right;
-
230 return temp;
-
231 } else if (!root->right) {
-
232 std::shared_ptr<node> temp = root->left;
-
233 return temp;
-
234 } else {
-
235 std::shared_ptr<node> temp = root->right;
-
236 while (temp->left) {
-
237 temp = temp->left;
-
238 }
-
239 root->info = temp->info;
-
240 root->right = __remove(root->right, temp->info);
-
241 }
-
242 }
-
243 return root;
-
244 }
-
245
-
246 void __inorder(std::function<void(std::shared_ptr<node>)> callback,
-
247 std::shared_ptr<node> root) {
-
248 if (root) {
-
249 __inorder(callback, root->left);
-
250 callback(root);
-
251 __inorder(callback, root->right);
-
252 }
-
253 }
-
254
-
255 void __postorder(std::function<void(std::shared_ptr<node>)> callback,
-
256 std::shared_ptr<node> root) {
-
257 if (root) {
-
258 __postorder(callback, root->left);
-
259 __postorder(callback, root->right);
-
260 callback(root);
-
261 }
-
262 }
-
263
-
264 void __preorder(std::function<void(std::shared_ptr<node>)> callback,
-
265 std::shared_ptr<node> root) {
-
266 if (root) {
-
267 callback(root);
-
268 __preorder(callback, root->left);
-
269 __preorder(callback, root->right);
-
270 }
-
271 }
-
272
-
273 std::string generate_visualization() {
-
274 std::string __generate = __inorder_gen(root);
-
275 return __generate;
-
276 }
-
277
-
278 std::string __inorder_gen(std::shared_ptr<node> root) {
-
279 std::string __s;
-
280 if (std::is_same_v<T, char> || std::is_same_v<T, std::string>) {
-
281 if (root->left) {
-
282 __s += root->info;
-
283 __s += "->";
-
284 __s += root->left->info;
-
285 __s += "\n";
-
286 __s += __inorder_gen(root->left);
+
185
+
+
190 void visualize() {
+
191 std::string __generated = generate_visualization();
+
192 tree_visualization::visualize(__generated);
+
193 }
+
+
194
+
195
+
+
199 friend ostream & operator << (ostream &out, bst<T> &t){
+
200 std::vector<std::vector<T> > order = t.level_order();
+
201 for(std::vector<T> & x : order){
+
202 for(size_t i = 0; i < x.size(); i++){
+
203 if(i != x.size() - 1){
+
204 out << x[i] << ", ";
+
205 }
+
206 else{
+
207 out << x[i] << '\n';
+
208 }
+
209 }
+
210 }
+
211 return out;
+
212 }
+
+
213
+
214private:
+
221 typedef struct node {
+
222 T info;
+
223 std::shared_ptr<node> right;
+
224 std::shared_ptr<node> left;
+
225 node(T key) : info(key), right(nullptr), left(nullptr) {}
+
226 } node;
+
227
+
228 std::shared_ptr<node> root;
+
229 size_t __size;
+
230
+
231 std::shared_ptr<node> new_node(T &key) {
+
232 std::shared_ptr<node> p = std::make_shared<node>(key);
+
233 return p;
+
234 }
+
235
+
236 std::shared_ptr<node> __insert(std::shared_ptr<node> root, T &key) {
+
237 if (!root) {
+
238 return new_node(key);
+
239 } else {
+
240 if (root->info < key) {
+
241 root->right = __insert(root->right, key);
+
242 } else {
+
243 root->left = __insert(root->left, key);
+
244 }
+
245 }
+
246 return root;
+
247 }
+
248
+
249 bool __search(std::shared_ptr<node> root, T &key) {
+
250 while (root) {
+
251 if (root->info < key) {
+
252 root = root->right;
+
253 } else if (root->info > key) {
+
254 root = root->left;
+
255 } else {
+
256 return true;
+
257 }
+
258 }
+
259 return false;
+
260 }
+
261
+
262 std::shared_ptr<node> __remove(std::shared_ptr<node> root, T &key) {
+
263 if (!root) {
+
264 return root;
+
265 }
+
266
+
267 if (root->info < key) {
+
268 root->right = __remove(root->right, key);
+
269 } else if (root->info > key) {
+
270 root->left = __remove(root->left, key);
+
271 } else {
+
272 if (!root->left && !root->right) {
+
273 root = nullptr;
+
274 } else if (!root->left) {
+
275 std::shared_ptr<node> temp = root->right;
+
276 return temp;
+
277 } else if (!root->right) {
+
278 std::shared_ptr<node> temp = root->left;
+
279 return temp;
+
280 } else {
+
281 std::shared_ptr<node> temp = root->right;
+
282 while (temp->left) {
+
283 temp = temp->left;
+
284 }
+
285 root->info = temp->info;
+
286 root->right = __remove(root->right, temp->info);
287 }
-
288 if (root->right) {
-
289 __s += root->info;
-
290 __s += "->";
-
291 __s += root->right->info;
-
292 __s += "\n";
-
293 __s += __inorder_gen(root->right);
-
294 }
-
295 } else {
-
296 if (root->left) {
-
297 __s += std::to_string(root->info) + "->" +
-
298 std::to_string(root->left->info) + "\n" +
-
299 __inorder_gen(root->left);
-
300 }
-
301 if (root->right) {
-
302 __s += std::to_string(root->info) + "->" +
-
303 std::to_string(root->right->info) + "\n" +
-
304 __inorder_gen(root->right);
-
305 }
-
306 }
-
307 return __s;
+
288 }
+
289 return root;
+
290 }
+
291
+
292 void __inorder(std::function<void(std::shared_ptr<node>)> callback,
+
293 std::shared_ptr<node> root) {
+
294 if (root) {
+
295 __inorder(callback, root->left);
+
296 callback(root);
+
297 __inorder(callback, root->right);
+
298 }
+
299 }
+
300
+
301 void __postorder(std::function<void(std::shared_ptr<node>)> callback,
+
302 std::shared_ptr<node> root) {
+
303 if (root) {
+
304 __postorder(callback, root->left);
+
305 __postorder(callback, root->right);
+
306 callback(root);
+
307 }
308 }
-
309};
-
-
310
-
-
314template <typename T> class bst<T>::Iterator {
-
315private:
-
316 std::vector<T> elements;
-
317 int64_t index;
+
309
+
310 void __preorder(std::function<void(std::shared_ptr<node>)> callback,
+
311 std::shared_ptr<node> root) {
+
312 if (root) {
+
313 callback(root);
+
314 __preorder(callback, root->left);
+
315 __preorder(callback, root->right);
+
316 }
+
317 }
318
-
319public:
-
-
325 explicit Iterator(const int64_t &index, std::vector<T> &els) noexcept
-
326 : index(index), elements(els) {}
-
-
327
-
-
334 Iterator &operator=(int64_t index) {
-
335 this->index = index;
-
336 return *(this);
-
337 }
-
-
338
-
- -
345 if (this->index < elements.size()) {
-
346 this->index++;
-
347 }
-
348 return *(this);
-
349 }
+
319 std::string generate_visualization() {
+
320 std::string __generate = __inorder_gen(root);
+
321 return __generate;
+
322 }
+
323
+
324 std::string __inorder_gen(std::shared_ptr<node> root) {
+
325 std::string __s;
+
326 if (std::is_same_v<T, char> || std::is_same_v<T, std::string>) {
+
327 if (root->left) {
+
328 __s += root->info;
+
329 __s += "->";
+
330 __s += root->left->info;
+
331 __s += "\n";
+
332 __s += __inorder_gen(root->left);
+
333 }
+
334 if (root->right) {
+
335 __s += root->info;
+
336 __s += "->";
+
337 __s += root->right->info;
+
338 __s += "\n";
+
339 __s += __inorder_gen(root->right);
+
340 }
+
341 } else {
+
342 if (root->left) {
+
343 __s += std::to_string(root->info) + "->" +
+
344 std::to_string(root->left->info) + "\n" +
+
345 __inorder_gen(root->left);
+
346 }
+
347 if (root->right) {
+
348 __s += std::to_string(root->info) + "->" +
+
349 std::to_string(root->right->info) + "\n" +
+
350 __inorder_gen(root->right);
+
351 }
+
352 }
+
353 return __s;
+
354 }
+
355};
-
350
-
- -
357 Iterator it = *this;
-
358 ++*(this);
-
359 return it;
-
360 }
-
-
361
-
- -
368 if (this->index > 0) {
-
369 this->index--;
-
370 }
-
371 return *(this);
-
372 }
+
356
+
+
360template <typename T> class bst<T>::Iterator {
+
361private:
+
362 std::vector<T> elements;
+
363 int64_t index;
+
364
+
365public:
+
+
371 explicit Iterator(const int64_t &index, std::vector<T> &els) noexcept
+
372 : index(index), elements(els) {}
373
-
- -
380 Iterator it = *this;
-
381 --*(this);
-
382 return it;
+
+
380 Iterator &operator=(int64_t index) {
+
381 this->index = index;
+
382 return *(this);
383 }
384
-
392 bool operator!=(const Iterator &it) { return index != it.index; }
-
393
-
399 T operator*() { return elements[index]; }
-
400};
+
+ +
391 if (this->index < elements.size()) {
+
392 this->index++;
+
393 }
+
394 return *(this);
+
395 }
+
+
396
+
+ +
403 Iterator it = *this;
+
404 ++*(this);
+
405 return it;
+
406 }
+
+
407
+
+ +
414 if (this->index > 0) {
+
415 this->index--;
+
416 }
+
417 return *(this);
+
418 }
+
+
419
+
+ +
426 Iterator it = *this;
+
427 --*(this);
+
428 return it;
+
429 }
+
+
430
+
438 bool operator!=(const Iterator &it) { return index != it.index; }
+
439
+
445 T operator*() { return elements[index]; }
+
446};
-
401
-
402#endif
-
Iterator class.
Definition bst.h:314
-
Iterator & operator++()
operator ++ for type Iterator
Definition bst.h:344
-
bool operator!=(const Iterator &it)
operator != for type Iterator
Definition bst.h:392
-
Iterator & operator--()
operator – for type Iterator
Definition bst.h:367
-
Iterator operator--(int)
operator – for type Iterator
Definition bst.h:379
-
Iterator & operator=(int64_t index)
= operator for Iterator type
Definition bst.h:334
-
Iterator(const int64_t &index, std::vector< T > &els) noexcept
Construct a new Iterator object.
Definition bst.h:325
-
T operator*()
operator * for type Iterator
Definition bst.h:399
-
Iterator operator++(int)
operator ++ for type Iterator
Definition bst.h:356
+
447
+
448#endif
+
Iterator class.
Definition bst.h:360
+
Iterator & operator++()
operator ++ for type Iterator
Definition bst.h:390
+
bool operator!=(const Iterator &it)
operator != for type Iterator
Definition bst.h:438
+
Iterator & operator--()
operator – for type Iterator
Definition bst.h:413
+
Iterator operator--(int)
operator – for type Iterator
Definition bst.h:425
+
Iterator & operator=(int64_t index)
= operator for Iterator type
Definition bst.h:380
+
Iterator(const int64_t &index, std::vector< T > &els) noexcept
Construct a new Iterator object.
Definition bst.h:371
+
T operator*()
operator * for type Iterator
Definition bst.h:445
+
Iterator operator++(int)
operator ++ for type Iterator
Definition bst.h:402
Class for BST tree.
Definition bst.h:18
-
void visualize()
visualize function
Definition bst.h:163
+
void visualize()
visualize function
Definition bst.h:190
+
friend ostream & operator<<(ostream &out, bst< T > &t)
operator << for bst class
Definition bst.h:199
void clear()
clear function
Definition bst.h:58
void remove(T key)
remove function.
Definition bst.h:83
std::vector< T > preorder()
preorder function.
Definition bst.h:135
@@ -431,6 +475,7 @@
size_t size()
size function
Definition bst.h:115
bst & operator=(const bst &b)
operator = for bst class
Definition bst.h:47
Iterator end()
pointer that points to end
Definition bst.h:105
+
std::vector< std::vector< T > > level_order()
level order function
Definition bst.h:163
std::vector< T > inorder()
inorder function.
Definition bst.h:121
bool search(T key)
search function.
Definition bst.h:77
void insert(T key)
insert function.
Definition bst.h:67
diff --git a/docs/html/classavl__tree-members.html b/docs/html/classavl__tree-members.html index 501fbadd..189ca45e 100644 --- a/docs/html/classavl__tree-members.html +++ b/docs/html/classavl__tree-members.html @@ -85,6 +85,8 @@ end()avl_tree< T >inline inorder()avl_tree< T >inline insert(T key)avl_tree< T >inline + level_order()avl_tree< T >inline + operator<<avl_tree< T >friend operator=(const avl_tree &a)avl_tree< T >inline postorder()avl_tree< T >inline preorder()avl_tree< T >inline diff --git a/docs/html/classavl__tree.html b/docs/html/classavl__tree.html index 2003ec12..fe16ee17 100644 --- a/docs/html/classavl__tree.html +++ b/docs/html/classavl__tree.html @@ -75,6 +75,7 @@
avl_tree< T > Class Template Reference
@@ -137,9 +138,19 @@ std::vector< T > postorder ()  postorder function.
  +std::vector< std::vector< T > > level_order () + level order function.
+  void visualize ()  visualize function
  + + + + +

+Friends

+ostream & operator<< (ostream &out, avl_tree< T > &t)
 operator << for avl_tree class
 

Detailed Description

template<typename T>
@@ -339,6 +350,36 @@

+

◆ level_order()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
std::vector< std::vector< T > > avl_tree< T >::level_order ()
+
+inline
+
+ +

level order function.

+
Returns
vector<T>, the level order traversal of the tree
+
diff --git a/docs/html/classbst-members.html b/docs/html/classbst-members.html index c5d0b8a1..c95a30ff 100644 --- a/docs/html/classbst-members.html +++ b/docs/html/classbst-members.html @@ -85,6 +85,8 @@ end()bst< T >inline inorder()bst< T >inline insert(T key)bst< T >inline + level_order()bst< T >inline + operator<<bst< T >friend operator=(const bst &b)bst< T >inline postorder()bst< T >inline preorder()bst< T >inline diff --git a/docs/html/classbst.html b/docs/html/classbst.html index 4688fbb4..5ad87e0d 100644 --- a/docs/html/classbst.html +++ b/docs/html/classbst.html @@ -75,6 +75,7 @@
bst< T > Class Template Reference

@@ -133,9 +134,19 @@ std::vector< T > postorder ()  postorder function.
  +std::vector< std::vector< T > > level_order () + level order function
+  void visualize ()  visualize function
  + + + + +

+Friends

+ostream & operator<< (ostream &out, bst< T > &t)
 operator << for bst class
 

Detailed Description

template<typename T>
@@ -335,6 +346,36 @@

+

◆ level_order()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
std::vector< std::vector< T > > bst< T >::level_order ()
+
+inline
+
+ +

level order function

+
Returns
vector<vector<T>>, the level order traversal of the tree
+
diff --git a/docs/html/classinterval__tree-members.html b/docs/html/classinterval__tree-members.html index c268f0e4..2d0daa00 100644 --- a/docs/html/classinterval__tree-members.html +++ b/docs/html/classinterval__tree-members.html @@ -85,16 +85,17 @@ insert(std::pair< T, T > p)interval_tree< T >inline interval_tree(std::vector< std::pair< T, T > > v={})interval_tree< T >inline interval_tree(const interval_tree &i)interval_tree< T >inlineexplicit - operator<<interval_tree< T >friend - operator=(const interval_tree &i)interval_tree< T >inline - overlap(std::pair< T, T > p1, std::pair< T, T > p2)interval_tree< T >inline - postorder()interval_tree< T >inline - preorder()interval_tree< T >inline - remove(std::pair< T, T > p)interval_tree< T >inline - search(std::pair< T, T > p)interval_tree< T >inline - size()interval_tree< T >inline - visualize() (defined in interval_tree< T >)interval_tree< T >inline - ~interval_tree() (defined in interval_tree< T >)interval_tree< T >inline + level_order()interval_tree< T >inline + operator<<interval_tree< T >friend + operator=(const interval_tree &i)interval_tree< T >inline + overlap(std::pair< T, T > p1, std::pair< T, T > p2)interval_tree< T >inline + postorder()interval_tree< T >inline + preorder()interval_tree< T >inline + remove(std::pair< T, T > p)interval_tree< T >inline + search(std::pair< T, T > p)interval_tree< T >inline + size()interval_tree< T >inline + visualize() (defined in interval_tree< T >)interval_tree< T >inline + ~interval_tree() (defined in interval_tree< T >)interval_tree< T >inline

diff --git a/docs/html/interval__tree_8h_source.html b/docs/html/interval__tree_8h_source.html index 5e3aa4e3..98662a91 100644 --- a/docs/html/interval__tree_8h_source.html +++ b/docs/html/interval__tree_8h_source.html @@ -93,433 +93,461 @@
7#include <functional>
8#include <iostream>
9#include <memory>
-
10#include <vector>
-
11#endif
-
12
-
-
16template <typename T> class interval_tree {
-
17public:
-
-
23 interval_tree(std::vector<std::pair<T, T>> v = {}) {
-
24 if (!v.empty()) {
-
25 for (auto &x : v) {
-
26 this->insert({x.first, x.second});
-
27 }
-
28 }
-
29 }
+
10#include <queue>
+
11#include <vector>
+
12#endif
+
13
+
+
17template <typename T> class interval_tree {
+
18public:
+
+
24 interval_tree(std::vector<std::pair<T, T>> v = {}) {
+
25 if (!v.empty()) {
+
26 for (auto &x : v) {
+
27 this->insert({x.first, x.second});
+
28 }
+
29 }
+
30 }
-
30
-
-
36 explicit interval_tree(const interval_tree &i) {
-
37 root = i.root;
-
38 __size = i.__size;
-
39 }
+
31
+
+
37 explicit interval_tree(const interval_tree &i) {
+
38 root = i.root;
+
39 __size = i.__size;
+
40 }
-
40
-
- -
47 root = i.root;
-
48 __size = i.__size;
-
49 return *this;
-
50 }
+
41
+
+ +
48 root = i.root;
+
49 __size = i.__size;
+
50 return *this;
+
51 }
-
51
-
52 ~interval_tree() { root = nullptr; }
-
53
-
-
57 void clear() {
-
58 root = nullptr;
-
59 __size = 0;
-
60 }
+
52
+
53 ~interval_tree() { root = nullptr; }
+
54
+
+
58 void clear() {
+
59 root = nullptr;
+
60 __size = 0;
+
61 }
-
61
-
-
66 void insert(std::pair<T, T> p) {
-
67 interval i = interval(p);
-
68 root = __insert(root, i);
-
69 __size++;
-
70 }
+
62
+
+
67 void insert(std::pair<T, T> p) {
+
68 interval i = interval(p);
+
69 root = __insert(root, i);
+
70 __size++;
+
71 }
-
71
-
-
76 bool search(std::pair<T, T> p) {
-
77 if (!root) {
-
78 return false;
-
79 }
-
80 interval i = interval(p);
-
81 if (this->overlap({root->i->low, root->i->high}, p)) {
-
82 return true;
-
83 }
-
84 return __search(root, i);
-
85 }
+
72
+
+
77 bool search(std::pair<T, T> p) {
+
78 if (!root) {
+
79 return false;
+
80 }
+
81 interval i = interval(p);
+
82 if (this->overlap({root->i->low, root->i->high}, p)) {
+
83 return true;
+
84 }
+
85 return __search(root, i);
+
86 }
-
86
-
-
91 void remove(std::pair<T, T> p) {
-
92 interval i = interval(p);
-
93 root = __remove(root, i);
-
94 __size--;
-
95 }
+
87
+
+
92 void remove(std::pair<T, T> p) {
+
93 interval i = interval(p);
+
94 root = __remove(root, i);
+
95 __size--;
+
96 }
-
96
-
-
103 bool overlap(std::pair<T, T> p1, std::pair<T, T> p2) {
-
104 interval i1 = interval(p1), i2 = interval(p2);
-
105 return i1.high >= i2.low && i1.low <= i2.high;
-
106 }
+
97
+
+
104 bool overlap(std::pair<T, T> p1, std::pair<T, T> p2) {
+
105 interval i1 = interval(p1), i2 = interval(p2);
+
106 return i1.high >= i2.low && i1.low <= i2.high;
+
107 }
-
107
-
108 class Iterator;
-
109
-
- -
116 std::vector<std::pair<T, T>> ino = this->inorder();
-
117 return Iterator(0, ino);
-
118 }
+
108
+
109 class Iterator;
+
110
+
+ +
117 std::vector<std::pair<T, T>> ino = this->inorder();
+
118 return Iterator(0, ino);
+
119 }
-
119
-
- -
126 std::vector<std::pair<T, T>> ino = this->inorder();
-
127 return Iterator(ino.size(), ino);
-
128 }
+
120
+
+ +
127 std::vector<std::pair<T, T>> ino = this->inorder();
+
128 return Iterator(ino.size(), ino);
+
129 }
-
129
-
135 size_t size() { return __size; }
-
136
-
-
141 std::vector<std::pair<T, T>> inorder() {
-
142 std::vector<std::pair<T, T>> path;
-
143 __inorder(
-
144 [&](std::shared_ptr<node> callbacked) {
-
145 path.push_back({callbacked->i->low, callbacked->i->high});
-
146 },
-
147 root);
-
148 return path;
-
149 }
+
130
+
136 size_t size() { return __size; }
+
137
+
+
142 std::vector<std::pair<T, T>> inorder() {
+
143 std::vector<std::pair<T, T>> path;
+
144 __inorder(
+
145 [&](std::shared_ptr<node> callbacked) {
+
146 path.push_back({callbacked->i->low, callbacked->i->high});
+
147 },
+
148 root);
+
149 return path;
+
150 }
-
150
-
-
155 std::vector<std::pair<T, T>> preorder() {
-
156 std::vector<std::pair<T, T>> path;
-
157 __preorder(
-
158 [&](std::shared_ptr<node> callbacked) {
-
159 path.push_back({callbacked->i->low, callbacked->i->high});
-
160 },
-
161 root);
-
162 return path;
-
163 }
+
151
+
+
156 std::vector<std::pair<T, T>> preorder() {
+
157 std::vector<std::pair<T, T>> path;
+
158 __preorder(
+
159 [&](std::shared_ptr<node> callbacked) {
+
160 path.push_back({callbacked->i->low, callbacked->i->high});
+
161 },
+
162 root);
+
163 return path;
+
164 }
-
164
-
-
169 std::vector<std::pair<T, T>> postorder() {
-
170 std::vector<std::pair<T, T>> path;
-
171 __postorder(
-
172 [&](std::shared_ptr<node> callbacked) {
-
173 path.push_back({callbacked->i->low, callbacked->i->high});
-
174 },
-
175 root);
-
176 return path;
-
177 }
+
165
+
+
170 std::vector<std::pair<T, T>> postorder() {
+
171 std::vector<std::pair<T, T>> path;
+
172 __postorder(
+
173 [&](std::shared_ptr<node> callbacked) {
+
174 path.push_back({callbacked->i->low, callbacked->i->high});
+
175 },
+
176 root);
+
177 return path;
+
178 }
-
178
-
179 void visualize() {
-
180 std::string __generated = generate_visualization();
-
181 tree_visualization::visualize(__generated);
-
182 }
-
183
-
-
187 friend std::ostream &operator<<(std::ostream &out, interval_tree<T> &t) {
-
188 if (!t.root) {
-
189 out << "";
-
190 return out;
-
191 }
-
192 out << '"';
-
193 std::vector<std::pair<T, T>> __inorder = t.inorder();
-
194 for (auto &x : __inorder) {
-
195 out << '"' << x.first << ' ' << x.second << '"' << " ";
-
196 }
-
197 out << '"';
-
198 return out;
-
199 }
+
179
+
+
184 std::vector<std::vector<std::pair<T, T>>> level_order() {
+
185 std::vector<std::vector<std::pair<T, T>>> path;
+
186 std::queue<std::shared_ptr<node>> q;
+
187 q.push(root);
+
188 while (!q.empty()) {
+
189 size_t size = q.size();
+
190 std::vector<std::pair<T, T>> level;
+
191 for (size_t i = 0; i < size; i++) {
+
192 std::shared_ptr<node> current = q.front();
+
193 q.pop();
+
194 level.push_back({current->i->low, current->i->high});
+
195 if (current->left) {
+
196 q.push(current->left);
+
197 }
+
198 if (current->right) {
+
199 q.push(current->right);
+
200 }
+
201 }
+
202 path.push_back(level);
+
203 }
+
204 return path;
+
205 }
-
200
-
201private:
-
207 struct interval {
-
208 T low;
-
209 T high;
-
210 interval(std::pair<T, T> p)
-
211 : low(std::min(p.first, p.second)), high(std::max(p.first, p.second)) {}
-
212 };
-
213
-
222 struct node {
-
223 interval *i;
-
224 int max;
-
225 std::shared_ptr<node> right;
-
226 std::shared_ptr<node> left;
-
227 node(interval n)
-
228 : i(new interval(n)), max(n.high), right(nullptr), left(nullptr) {}
-
229 };
-
230
-
231 std::shared_ptr<node> root;
-
232 size_t __size;
-
233
-
234 std::shared_ptr<node> new_node(interval i) {
-
235 std::shared_ptr<node> p = std::make_shared<node>(i);
-
236 return p;
-
237 }
-
238
-
242 std::shared_ptr<node> __insert(std::shared_ptr<node> root, interval i) {
-
243 if (!root) {
-
244 return new_node(i);
-
245 }
-
246 T l = root->i->low;
-
247 if (i.low < l) {
-
248 root->left = __insert(root->left, i);
-
249 } else {
-
250 root->right = __insert(root->right, i);
-
251 }
-
252 if (root->max < i.high) {
-
253 root->max = i.high;
-
254 }
-
255 return root;
-
256 }
-
257
-
261 bool __search(std::shared_ptr<node> root, interval i) {
-
262 if (!root) {
-
263 return false;
-
264 }
-
265 if (root->left && root->left->max >= i.low) {
-
266 return __search(root->left, i);
-
267 }
-
268 return __search(root->right, i);
-
269 }
-
270
-
274 std::shared_ptr<node> __remove(std::shared_ptr<node> root, interval i) {
-
275 if (!root) {
-
276 return nullptr;
-
277 }
-
278 std::shared_ptr<node> p = root;
-
279 while (p) {
-
280 if (p->i->low > i.low) {
-
281 p = p->left;
-
282 } else if (p->i->low < i.low) {
-
283 p = p->right;
-
284 } else {
-
285 if (!p->right && !p->left) {
-
286 return nullptr;
-
287 } else if (p->right && !p->left) {
-
288 std::shared_ptr<node> temp = root->right;
-
289 return temp;
-
290 } else if (p->left && !p->right) {
-
291 std::shared_ptr<node> temp = p->left;
-
292 return temp;
-
293 } else {
-
294 std::shared_ptr<node> temp = root;
-
295 while (temp && temp->left) {
-
296 temp = temp->left;
-
297 }
-
298 p->i = temp->i;
-
299 p->max = temp->max;
-
300 p->right = __remove(p->right, *temp->i);
-
301 }
-
302 }
-
303 }
-
304 return root;
-
305 }
-
306
-
307 void __inorder(std::function<void(std::shared_ptr<node>)> callback,
-
308 std::shared_ptr<node> root) {
-
309 if (root) {
-
310 __inorder(callback, root->left);
-
311 callback(root);
-
312 __inorder(callback, root->right);
-
313 }
-
314 }
-
315
-
316 void __postorder(std::function<void(std::shared_ptr<node>)> callback,
-
317 std::shared_ptr<node> root) {
-
318 if (root) {
-
319 __postorder(callback, root->left);
-
320 __postorder(callback, root->right);
-
321 callback(root);
-
322 }
-
323 }
-
324
-
325 void __preorder(std::function<void(std::shared_ptr<node>)> callback,
-
326 std::shared_ptr<node> root) {
-
327 if (root) {
-
328 callback(root);
-
329 __preorder(callback, root->left);
-
330 __preorder(callback, root->right);
-
331 }
-
332 }
-
333
-
334 std::string generate_visualization() {
-
335 std::string __generate = __inorder_gen(root);
-
336 return __generate;
-
337 }
-
338
-
339 std::string __inorder_gen(std::shared_ptr<node> root) {
-
340 std::string __s;
-
341 if (std::is_same_v<T, char> || std::is_same_v<T, std::string>) {
-
342 if (root->left) {
-
343 __s += '"';
-
344 __s += root->i->low;
-
345 __s += ',';
-
346 __s += root->i->high;
-
347 __s += '"';
-
348 __s += "->";
-
349 __s += '"';
-
350 __s += root->left->i->low;
-
351 __s += ',';
-
352 __s += root->left->i->high;
-
353 __s += '"';
-
354 __s += "\n";
-
355 __s += __inorder_gen(root->left);
-
356 }
-
357 if (root->right) {
-
358 __s += '"';
-
359 __s += root->i->low;
-
360 __s += ',';
-
361 __s += root->i->high;
-
362 __s += '"';
-
363 __s += "->";
-
364 __s += '"';
-
365 __s += root->right->i->low;
-
366 __s += ',';
-
367 __s += root->right->i->high;
-
368 __s += '"';
-
369 __s += "\n";
-
370 __s += __inorder_gen(root->right);
-
371 }
-
372 } else {
-
373 if (root->left) {
-
374 __s += '"';
-
375 __s += std::to_string(root->i->low);
-
376 __s += ',';
-
377 __s += std::to_string(root->i->high);
+
206
+
207 void visualize() {
+
208 std::string __generated = generate_visualization();
+
209 tree_visualization::visualize(__generated);
+
210 }
+
211
+
+
215 friend ostream & operator << (ostream &out, interval_tree<T> &t){
+
216 std::vector<std::vector<std::pair<T, T> > > order = t.level_order();
+
217 for(std::vector<std::pair<T, T> > & x : order){
+
218 for(size_t i = 0; i < x.size(); i++){
+
219 if(i != x.size() - 1){
+
220 out << '[' << x[i].first << "," << x[i].second << ']' << ", ";
+
221 }
+
222 else{
+
223 out << '[' << x[i].first << "," << x[i].second << ']' << '\n';
+
224 }
+
225 }
+
226 }
+
227 return out;
+
228 }
+
+
229
+
230private:
+
236 struct interval {
+
237 T low;
+
238 T high;
+
239 interval(std::pair<T, T> p)
+
240 : low(std::min(p.first, p.second)), high(std::max(p.first, p.second)) {}
+
241 };
+
242
+
251 struct node {
+
252 interval *i;
+
253 int max;
+
254 std::shared_ptr<node> right;
+
255 std::shared_ptr<node> left;
+
256 node(interval n)
+
257 : i(new interval(n)), max(n.high), right(nullptr), left(nullptr) {}
+
258 };
+
259
+
260 std::shared_ptr<node> root;
+
261 size_t __size;
+
262
+
263 std::shared_ptr<node> new_node(interval i) {
+
264 std::shared_ptr<node> p = std::make_shared<node>(i);
+
265 return p;
+
266 }
+
267
+
271 std::shared_ptr<node> __insert(std::shared_ptr<node> root, interval i) {
+
272 if (!root) {
+
273 return new_node(i);
+
274 }
+
275 T l = root->i->low;
+
276 if (i.low < l) {
+
277 root->left = __insert(root->left, i);
+
278 } else {
+
279 root->right = __insert(root->right, i);
+
280 }
+
281 if (root->max < i.high) {
+
282 root->max = i.high;
+
283 }
+
284 return root;
+
285 }
+
286
+
290 bool __search(std::shared_ptr<node> root, interval i) {
+
291 if (!root) {
+
292 return false;
+
293 }
+
294 if (root->left && root->left->max >= i.low) {
+
295 return __search(root->left, i);
+
296 }
+
297 return __search(root->right, i);
+
298 }
+
299
+
303 std::shared_ptr<node> __remove(std::shared_ptr<node> root, interval i) {
+
304 if (!root) {
+
305 return nullptr;
+
306 }
+
307 std::shared_ptr<node> p = root;
+
308 while (p) {
+
309 if (p->i->low > i.low) {
+
310 p = p->left;
+
311 } else if (p->i->low < i.low) {
+
312 p = p->right;
+
313 } else {
+
314 if (!p->right && !p->left) {
+
315 return nullptr;
+
316 } else if (p->right && !p->left) {
+
317 std::shared_ptr<node> temp = root->right;
+
318 return temp;
+
319 } else if (p->left && !p->right) {
+
320 std::shared_ptr<node> temp = p->left;
+
321 return temp;
+
322 } else {
+
323 std::shared_ptr<node> temp = root;
+
324 while (temp && temp->left) {
+
325 temp = temp->left;
+
326 }
+
327 p->i = temp->i;
+
328 p->max = temp->max;
+
329 p->right = __remove(p->right, *temp->i);
+
330 }
+
331 }
+
332 }
+
333 return root;
+
334 }
+
335
+
336 void __inorder(std::function<void(std::shared_ptr<node>)> callback,
+
337 std::shared_ptr<node> root) {
+
338 if (root) {
+
339 __inorder(callback, root->left);
+
340 callback(root);
+
341 __inorder(callback, root->right);
+
342 }
+
343 }
+
344
+
345 void __postorder(std::function<void(std::shared_ptr<node>)> callback,
+
346 std::shared_ptr<node> root) {
+
347 if (root) {
+
348 __postorder(callback, root->left);
+
349 __postorder(callback, root->right);
+
350 callback(root);
+
351 }
+
352 }
+
353
+
354 void __preorder(std::function<void(std::shared_ptr<node>)> callback,
+
355 std::shared_ptr<node> root) {
+
356 if (root) {
+
357 callback(root);
+
358 __preorder(callback, root->left);
+
359 __preorder(callback, root->right);
+
360 }
+
361 }
+
362
+
363 std::string generate_visualization() {
+
364 std::string __generate = __inorder_gen(root);
+
365 return __generate;
+
366 }
+
367
+
368 std::string __inorder_gen(std::shared_ptr<node> root) {
+
369 std::string __s;
+
370 if (std::is_same_v<T, char> || std::is_same_v<T, std::string>) {
+
371 if (root->left) {
+
372 __s += '"';
+
373 __s += root->i->low;
+
374 __s += ',';
+
375 __s += root->i->high;
+
376 __s += '"';
+
377 __s += "->";
378 __s += '"';
-
379 __s += "->";
-
380 __s += '"';
-
381 __s += std::to_string(root->left->i->low);
-
382 __s += ',';
-
383 __s += std::to_string(root->left->i->high);
-
384 __s += '"';
-
385 __s += "\n";
-
386 __s += __inorder_gen(root->left);
-
387 }
-
388 if (root->right) {
-
389 __s += '"';
-
390 __s += std::to_string(root->i->low);
-
391 __s += ',';
-
392 __s += std::to_string(root->i->high);
+
379 __s += root->left->i->low;
+
380 __s += ',';
+
381 __s += root->left->i->high;
+
382 __s += '"';
+
383 __s += "\n";
+
384 __s += __inorder_gen(root->left);
+
385 }
+
386 if (root->right) {
+
387 __s += '"';
+
388 __s += root->i->low;
+
389 __s += ',';
+
390 __s += root->i->high;
+
391 __s += '"';
+
392 __s += "->";
393 __s += '"';
-
394 __s += "->";
-
395 __s += '"';
-
396 __s += std::to_string(root->right->i->low);
-
397 __s += ',';
-
398 __s += std::to_string(root->right->i->high);
-
399 __s += '"';
-
400 __s += "\n";
-
401 __s += __inorder_gen(root->right);
-
402 }
-
403 }
-
404 return __s;
-
405 }
-
406};
-
-
407
-
-
411template <typename T> class interval_tree<T>::Iterator {
-
412private:
-
413 std::vector<std::pair<T, T>> elements;
-
414 int64_t index;
-
415
-
416public:
-
-
422 explicit Iterator(const int64_t &index,
-
423 std::vector<std::pair<T, T>> &els) noexcept
-
424 : index(index), elements(els) {}
-
-
425
-
-
432 Iterator &operator=(int64_t index) {
-
433 this->index = index;
-
434 return *(this);
-
435 }
+
394 __s += root->right->i->low;
+
395 __s += ',';
+
396 __s += root->right->i->high;
+
397 __s += '"';
+
398 __s += "\n";
+
399 __s += __inorder_gen(root->right);
+
400 }
+
401 } else {
+
402 if (root->left) {
+
403 __s += '"';
+
404 __s += std::to_string(root->i->low);
+
405 __s += ',';
+
406 __s += std::to_string(root->i->high);
+
407 __s += '"';
+
408 __s += "->";
+
409 __s += '"';
+
410 __s += std::to_string(root->left->i->low);
+
411 __s += ',';
+
412 __s += std::to_string(root->left->i->high);
+
413 __s += '"';
+
414 __s += "\n";
+
415 __s += __inorder_gen(root->left);
+
416 }
+
417 if (root->right) {
+
418 __s += '"';
+
419 __s += std::to_string(root->i->low);
+
420 __s += ',';
+
421 __s += std::to_string(root->i->high);
+
422 __s += '"';
+
423 __s += "->";
+
424 __s += '"';
+
425 __s += std::to_string(root->right->i->low);
+
426 __s += ',';
+
427 __s += std::to_string(root->right->i->high);
+
428 __s += '"';
+
429 __s += "\n";
+
430 __s += __inorder_gen(root->right);
+
431 }
+
432 }
+
433 return __s;
+
434 }
+
435};
436
-
- -
443 if (this->index < elements.size()) {
-
444 this->index++;
-
445 }
-
446 return *(this);
-
447 }
+
+
440template <typename T> class interval_tree<T>::Iterator {
+
441private:
+
442 std::vector<std::pair<T, T>> elements;
+
443 int64_t index;
+
444
+
445public:
+
+
451 explicit Iterator(const int64_t &index,
+
452 std::vector<std::pair<T, T>> &els) noexcept
+
453 : index(index), elements(els) {}
-
448
-
- -
455 Iterator it = *this;
-
456 ++*(this);
-
457 return it;
-
458 }
+
454
+
+
461 Iterator &operator=(int64_t index) {
+
462 this->index = index;
+
463 return *(this);
+
464 }
-
459
-
- -
466 if (this->index > 0) {
-
467 this->index--;
-
468 }
-
469 return *(this);
-
470 }
+
465
+
+ +
472 if (this->index < elements.size()) {
+
473 this->index++;
+
474 }
+
475 return *(this);
+
476 }
-
471
-
- -
478 Iterator it = *this;
-
479 --*(this);
-
480 return it;
-
481 }
+
477
+
+ +
484 Iterator it = *this;
+
485 ++*(this);
+
486 return it;
+
487 }
-
482
-
490 bool operator!=(const Iterator &it) { return index != it.index; }
-
491
-
-
497 std::pair<T, T> operator*() {
-
498 return {elements[index].first, elements[index].second};
+
488
+
+ +
495 if (this->index > 0) {
+
496 this->index--;
+
497 }
+
498 return *(this);
499 }
-
500};
+
500
+
+ +
507 Iterator it = *this;
+
508 --*(this);
+
509 return it;
+
510 }
+
+
511
+
519 bool operator!=(const Iterator &it) { return index != it.index; }
+
520
+
+
526 std::pair<T, T> operator*() {
+
527 return {elements[index].first, elements[index].second};
+
528 }
+
+
529};
-
501
-
502#endif
-
Iterator class.
Definition interval_tree.h:411
-
bool operator!=(const Iterator &it)
operator != for type Iterator
Definition interval_tree.h:490
-
Iterator operator--(int)
operator – for type Iterator
Definition interval_tree.h:477
-
std::pair< T, T > operator*()
operator * for type Iterator
Definition interval_tree.h:497
-
Iterator(const int64_t &index, std::vector< std::pair< T, T > > &els) noexcept
Construct a new Iterator object.
Definition interval_tree.h:422
-
Iterator & operator=(int64_t index)
= operator for Iterator type
Definition interval_tree.h:432
-
Iterator operator++(int)
operator ++ for type Iterator
Definition interval_tree.h:454
-
Iterator & operator++()
operator ++ for type Iterator
Definition interval_tree.h:442
-
Iterator & operator--()
operator – for type Iterator
Definition interval_tree.h:465
-
interval tree class
Definition interval_tree.h:16
-
Iterator end()
pointer that points to end
Definition interval_tree.h:125
-
interval_tree(std::vector< std::pair< T, T > > v={})
Construct a new interval tree object.
Definition interval_tree.h:23
-
bool overlap(std::pair< T, T > p1, std::pair< T, T > p2)
overlap function.
Definition interval_tree.h:103
-
void clear()
clear function
Definition interval_tree.h:57
-
bool search(std::pair< T, T > p)
search function.
Definition interval_tree.h:76
-
std::vector< std::pair< T, T > > inorder()
inorder function.
Definition interval_tree.h:141
-
void remove(std::pair< T, T > p)
remove function.
Definition interval_tree.h:91
-
friend std::ostream & operator<<(std::ostream &out, interval_tree< T > &t)
<< operator for interval_tree class.
Definition interval_tree.h:187
-
void insert(std::pair< T, T > p)
insert function.
Definition interval_tree.h:66
-
Iterator begin()
pointer that points to begin
Definition interval_tree.h:115
-
interval_tree & operator=(const interval_tree &i)
operator = for interval tree class
Definition interval_tree.h:46
-
std::vector< std::pair< T, T > > preorder()
preorder function.
Definition interval_tree.h:155
-
size_t size()
size function
Definition interval_tree.h:135
-
std::vector< std::pair< T, T > > postorder()
postorder function.
Definition interval_tree.h:169
-
interval_tree(const interval_tree &i)
Copy constructor for interval tree class.
Definition interval_tree.h:36
+
530
+
531#endif
+
Iterator class.
Definition interval_tree.h:440
+
bool operator!=(const Iterator &it)
operator != for type Iterator
Definition interval_tree.h:519
+
Iterator operator--(int)
operator – for type Iterator
Definition interval_tree.h:506
+
std::pair< T, T > operator*()
operator * for type Iterator
Definition interval_tree.h:526
+
Iterator(const int64_t &index, std::vector< std::pair< T, T > > &els) noexcept
Construct a new Iterator object.
Definition interval_tree.h:451
+
Iterator & operator=(int64_t index)
= operator for Iterator type
Definition interval_tree.h:461
+
Iterator operator++(int)
operator ++ for type Iterator
Definition interval_tree.h:483
+
Iterator & operator++()
operator ++ for type Iterator
Definition interval_tree.h:471
+
Iterator & operator--()
operator – for type Iterator
Definition interval_tree.h:494
+
interval tree class
Definition interval_tree.h:17
+
Iterator end()
pointer that points to end
Definition interval_tree.h:126
+
std::vector< std::vector< std::pair< T, T > > > level_order()
level order function.
Definition interval_tree.h:184
+
interval_tree(std::vector< std::pair< T, T > > v={})
Construct a new interval tree object.
Definition interval_tree.h:24
+
bool overlap(std::pair< T, T > p1, std::pair< T, T > p2)
overlap function.
Definition interval_tree.h:104
+
void clear()
clear function
Definition interval_tree.h:58
+
bool search(std::pair< T, T > p)
search function.
Definition interval_tree.h:77
+
friend ostream & operator<<(ostream &out, interval_tree< T > &t)
operator << for interval tree class
Definition interval_tree.h:215
+
std::vector< std::pair< T, T > > inorder()
inorder function.
Definition interval_tree.h:142
+
void remove(std::pair< T, T > p)
remove function.
Definition interval_tree.h:92
+
void insert(std::pair< T, T > p)
insert function.
Definition interval_tree.h:67
+
Iterator begin()
pointer that points to begin
Definition interval_tree.h:116
+
interval_tree & operator=(const interval_tree &i)
operator = for interval tree class
Definition interval_tree.h:47
+
std::vector< std::pair< T, T > > preorder()
preorder function.
Definition interval_tree.h:156
+
size_t size()
size function
Definition interval_tree.h:136
+
std::vector< std::pair< T, T > > postorder()
postorder function.
Definition interval_tree.h:170
+
interval_tree(const interval_tree &i)
Copy constructor for interval tree class.
Definition interval_tree.h:37
-

Writting unit tests is the most important part of contributing. Fortunately or not, this is a project about algorithms and a lot of edge cases exist, so we must make sure everything works as it should.

+

Writting unit tests is the most important part of contributing. Fortunately or not, this is a project about algorithms and a lot of edge cases exist, so we must make sure everything works as it should.

#include "../catch2/catch.hpp"
TEST_CASE("testing this and that..."){
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html index 784135c9..614a0336 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html @@ -75,8 +75,8 @@
Mini tutorial for DBSCAN class
-

DBSCAN -- creates a dbscan object
-

+

DBSCAN -- creates a dbscan object
+

Create an instance of DBSCAN::

#include <machine_learning/clustering/DBSCAN/dbscan.h>
@@ -89,7 +89,7 @@
...
}
DBSCAN clustering algorithm class.
Definition dbscan.h:18
-

+

Get assignments with DBSCAN clustering::

#include <machine_learning/clustering/DBSCAN/dbscan.h>
@@ -98,7 +98,7 @@
// get assignments for each point with DBSCAN algorithm
std::map<std::pair<double, double>, int64_t> assignments = d.get_clusters();
}
-

+

Get noise with DBSCAN clustering::

#include <machine_learning/clustering/DBSCAN/dbscan.h>
@@ -107,7 +107,7 @@
// get noise with DBSCAN clustering
std::vector<std::pair<double, double> > noise = d.get_noise();
}
-

+

optionally for visualization purposes you can write to a json file and then use the python's matplotlib function::

#include "../../../../src/machine_learning/clustering/DBSCAN/dbscan.h"
#include <fstream>
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html index 0093dbbd..9d789350 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html @@ -75,8 +75,8 @@
Mini tutorial for kmeans class
-

kmeans -- creates a kmeans object
-

+

kmeans -- creates a kmeans object
+

Create an instance of kmeans::

#include <machine_learning/clustering/kmeans/kmeans.h>
@@ -87,7 +87,7 @@
...
}
Definition kmeans.h:19
-

+

Get assignments and cluster centers::

#include <machine_learning/clustering/kmeans/kmeans.h>
@@ -96,7 +96,7 @@
// returns the cluster centers and assignemnts of the kmeans clustering
std::pair<std::vector<std::vector<double> >, std::map<std::vector<double>, int64_t> > ans = a.fit();
}
-

+

optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib::

#include <iostream>
#include <machine_learning/clustering/kmeans/kmeans.h>
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html index 2950fe5c..b9979385 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html @@ -75,7 +75,7 @@
Mini Tutorial for the Graph class
-

1. graph<T> -- unweighted graph
+

1. graph<T> -- unweighted graph
 2. weighted_graph<T> -- weighted graph
 

graph class algorithms:

  • dfs
  • @@ -102,7 +102,7 @@
  • visualize

There are also some functions for both classes like has_edge(u, v) that checks if an edge exists from node u to node v, size() that returns the number of elements in the graph, empty() that checks if a graph is empty and empty() that empties the graph.You can see more about graph algorithms here.

-

+

DFS:

#include <graph.h>
graph<int> g("directed");
@@ -114,7 +114,7 @@

//returns the path of the dfs.
std::vector<T> dfs = g.dfs();
Class for Unweighted Graph.
Definition graph.h:26
-

+

BFS:

#include <graph.h>
graph<int> g("directed");
@@ -125,7 +125,7 @@

//returns the path of the bfs.
std::vector<T> bfs = g.bfs();
-

+

connected_components:

#include <graph.h>
graph<char> g("undirected");
@@ -134,7 +134,7 @@

g.add_edge('g','h');
//returns the number of connected components(islands)
std::cout << g.connected_components() << '\n';
-

+

cycle:

#include <graph.h>
#include <string>
@@ -146,7 +146,7 @@

if(g.cycle()){
std::cout << "cycle detected" << '\n'
}
-

+

topological_sort:

#include <graph.h>
graph<int> g("undirected");
@@ -157,7 +157,7 @@

//returns the topological order of the elements.
std::vector<int> topo = g.topological_sort();
-

+

bipartite:

#include <graph.h>
graph<int> g("undirected");
@@ -170,7 +170,7 @@

if(g.bipartite()){
std::cout << "graph is bipartite" << '\n'
}
-

+

bridge:

#include <graph.h>
graph<int> g("undirected");
@@ -181,7 +181,7 @@

//returns the bridges of the graph(works with weighted graph as well).
std::vector<std::vector<int>> bridges = g.bridge(1);
-

+

visualize:

#include <graph.h>
graph<int> g("undirected");
@@ -194,7 +194,7 @@

// using graphviz plugins on vscode(or locally with
// command lines).
g.visualize();
-

+

shortest_path:

#include <weighted_graph.h>
weighted_graph<int> g("undirected");
@@ -206,7 +206,7 @@

// returns the shortest path from 1 to 2.
std::cout << g.shortest_path(1, 2) << '\n';
class for weighted graph
Definition graph.h:554
-

+

prim:

#include <weighted_graph.h>
@@ -219,7 +219,7 @@

// returns the minimum spanning tree starting
// from the node Athens.
std::cout << g.prim("Athens") << '\n';
-

+

connected:

#include <graph.h>
graph<std::string> g("undirected");
@@ -231,7 +231,7 @@

if(g.connected()){
std::cout << "graph is connected" << '\n';
}
-

+

topological_sort:

#include <weighted_graph.h>
weighted_graph<int> g("undirected");
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html index 21ca405f..e9936b6b 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html @@ -75,8 +75,8 @@
Mini tutorial for edge detection namespace
-

--- We use sobel operator to perform edge detection. Sobel() function will return a 2d array with the resulted image
-

+

--- We use sobel operator to perform edge detection. Sobel() function will return a 2d array with the resulted image
+

Perform edge detection with Sobel() function:

int main(){
// data.json is the file that contains the 2d array of the image at "img" instance
@@ -93,7 +93,7 @@
std::ofstream file("results.json");
file << j;
}
-

+

Visualize your results:

import matplotlib.pyplot as plt
import json
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html index 2f9339b9..07da5306 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html @@ -75,8 +75,8 @@
Mini tutorial for huffman coding class
-

-- huffman h(vector<string> v, MAX_DEPTH) creates a huffman object with the input text v and MAX_DEPTH(default = 10)
-

+

-- huffman h(vector<string> v, MAX_DEPTH) creates a huffman object with the input text v and MAX_DEPTH(default = 10)
+

create_tree:

#include <machine_learning/image/huffman_encoding.h>
@@ -88,7 +88,7 @@
h.create_tree();
}
class for huffman coding
Definition huffman_encoding.h:19
-

+

decode:

#include <machine_learning/image/huffman_encoding.h>
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html index 000e9be9..fa6a7f17 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html @@ -75,8 +75,8 @@
Mini tutorial for median filter namespace
-

--- apply_median_filter() function applies a 3x3 mask to the passed image
-

+

--- apply_median_filter() function applies a 3x3 mask to the passed image
+

How to perform the masking using apply_median_filter() function:

int main() {
// let's assume we have the data of the image in data.json file
@@ -94,7 +94,7 @@
file << j;
}
Definition image.h:11
-

+

Visualize your results:

import matplotlib.pyplot as plt
import json
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html new file mode 100644 index 00000000..d6779fa3 --- /dev/null +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html @@ -0,0 +1,120 @@ + + + + + + + +AlgoPlus: Mini tutorial for sharpening filter namespace + + + + + + + + + + + +
+
+ + + + + + + +
+
AlgoPlus v0.1.0 +
+
+
+ + + + + + + + +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+
+
Mini tutorial for sharpening filter namespace
+
+
+

--- apply_sharpening_filter() function applies a 3x3 laplacian mask to the passed image
+

+How to perform the masking using apply_sharpening_filter() function:

+
int main() {
+
// let's assume we have the data of the image in data.json file
+
std::ifstream ifs("data.json");
+
json jf = json::parse(ifs);
+
// now 2d vector data has the data of the image
+
std::vector<std::vector<int32_t>> data = jf["img"];
+
Image img(data);
+
// this applies the median filter to the image:img and saves the results to the res 2d array
+
std::vector<std::vector<int32_t>> res = apply_sharpening_filter(img);
+
json j;
+
j["data"] = res;
+
// we optionally write the results to a file
+
std::ofstream file("results.json");
+
file << j;
+
}
+
Definition image.h:11
+

+Visualize your results:

+
import matplotlib.pyplot as plt
+
import json
+
import os
+
+
# Visualization can easily be achieved using matplotlib
+
# We just open the file that we saved our results and plot the image
+
if __name__ == "__main__":
+
os.system("c++ -std=c++17 main.cc")
+
os.system("./a.out")
+
filename = open("results.json")
+
file = json.load(filename)
+
data = file['data']
+
plt.imshow(data, cmap='gray')
+
plt.show()
+
+
+ + + + diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html index 4a642608..f5de27bb 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html @@ -75,8 +75,8 @@
Mini tutorial for circular linked list class
-

circular_linked_list<T> -- creates a circular linked list with elements of type T
-

+

circular_linked_list<T> -- creates a circular linked list with elements of type T
+

push_back:

#include <circular_linked_list.h>
@@ -87,7 +87,7 @@
//creates a circular linked list with elements {1,2,3}
circular linked list class
Definition circular_linked_list.h:16
void push_back(T key)
push_back function
Definition circular_linked_list.h:162
-

+

push_front:

#include <circular_linked_list.h>
@@ -97,7 +97,7 @@
//creates a circular linked list with elements {3,2,1}
void push_front(T key)
push_front function
Definition circular_linked_list.h:175
-

+

erase:

#include <circular_linked_list.h>
@@ -109,7 +109,7 @@
assert(l.search(2) == false);
bool search(T key)
search function
Definition circular_linked_list.h:218
void erase(T key)
erase function
Definition circular_linked_list.h:188
-

+

search:

#include <circular_linked_list.h>
@@ -120,7 +120,7 @@
if(l.search(3) == true){
std::cout << "element 3 found in the list" << '\n';
}
-

+

reverse:

#include <circular_linked_list.h>
@@ -130,7 +130,7 @@
l.reverse();
//now the linked list became {1,2,3}
-

+

elements:

#include <circular_linked_list.h>
@@ -142,7 +142,7 @@
//returns the elements of the circular linked list in a vector<T>
std::vector<int> els = l.elements();
std::vector< T > elements()
elements function
Definition circular_linked_list.h:239
-

+

iterators:

#include <circular_linked_list.h>
@@ -157,7 +157,7 @@
}
Iterator begin()
pointer that points to begin
Definition circular_linked_list.h:76
Iterator end()
pointer that points to end
Definition circular_linked_list.h:83
-

+

visualize:

#include <circular_linked_list.h>
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html index e1c54238..b2571235 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html @@ -75,8 +75,8 @@
Mini tutorial for doubly linked list class
-

doubly_linked_list<T> -- creates a doubly linked list with elements of type T
-

+

doubly_linked_list<T> -- creates a doubly linked list with elements of type T
+

push_back:

#include <doubly_linked_list.h>
@@ -87,7 +87,7 @@
//creates a doubly linked list with elements {1,2,3}
doubly linked list class
Definition doubly_linked_list.h:17
void push_back(T key)
push_back function.
Definition doubly_linked_list.h:176
-

+

push_front:

#include <doubly_linked_list.h>
@@ -97,7 +97,7 @@
//creates a doubly linked list with elements {3,2,1}
void push_front(T key)
push_front function.
Definition doubly_linked_list.h:190
-

+

erase:

#include <doubly_linked_list.h>
@@ -109,7 +109,7 @@
assert(l.search(2) == false);
bool search(T key)
search function.
Definition doubly_linked_list.h:160
void erase(T key)
erase function.
Definition doubly_linked_list.h:201
-

+

search:

#include <doubly_linked_list.h>
@@ -120,7 +120,7 @@
if(l.search(3) == true){
std::cout << "element 3 found in the list" << '\n';
}
-

+

reverse:

#include <doubly_linked_list.h>
@@ -131,7 +131,7 @@
l.reverse();
//now the linked list became {1,2,3}
void reverse()
reverse function. reverses the linked list.
Definition doubly_linked_list.h:236
-

+

elements:

#include <doubly_linked_list.h>
@@ -143,7 +143,7 @@
//returns the elements of the doubly linked list in a vector<T>
std::vector<int> els = l.elements();
std::vector< T > elements()
elements function.
Definition doubly_linked_list.h:223
-

+

iterators:

#include <doubly_linked_list.h>
@@ -157,7 +157,7 @@
}
Iterator end()
pointer that points to end
Definition doubly_linked_list.h:81
Iterator begin()
pointer that points to begin
Definition doubly_linked_list.h:74
-

+

visualize:

#include <doubly_linked_list.h>
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html index c049adce..a1cb5805 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html @@ -75,9 +75,9 @@
Mini Tutorial for the frequency_list class
-

1. frequency_list<T> flist; creates an empty frequency list with T type elements.
+

1. frequency_list<T> flist; creates an empty frequency list with T type elements.
 2. frequency_list<T> flist({1, 2, 3, 4}); creates a frequency list and initializes it with the given values.
-

+

push_back:

#include "frequency_list.h"
@@ -87,7 +87,7 @@
flist.push_back(13); // Inserts 13 to the list.
Self-learning Frequency List that maintains a list of elements in descending order of their frequency...
Definition frequency_list.h:28
void push_back(T data)
Adds an element to the back of the frequency list.
Definition frequency_list.h:383
-

+

push_front:

#include "frequency_list.h"
@@ -95,7 +95,7 @@
flist.push_front(7); // Inserts 7 to the front of the list.
flist.push_front(2); // Inserts 2 to the front of the list.
void push_front(T data)
Adds an element to the front of the frequency list.
Definition frequency_list.h:293
-

+

search:

#include "frequency_list.h"
@@ -109,7 +109,7 @@
std::cout << "Element 5 found in the list" << '\n';
}
bool search(T key)
Searches for a given key in the frequency list.
Definition frequency_list.h:366
-

+

get_frequency:

#include "frequency_list.h"
@@ -119,7 +119,7 @@
auto freq = flist.get_frequency(10); // Returns the frequency of 10
int64_t get_frequency(T key)
Gets the frequency of a key in the frequency list.
Definition frequency_list.h:351
-

+

erase:

#include "frequency_list.h"
@@ -130,7 +130,7 @@
flist.erase(13); // Removes 13 from the list.
void erase(T key)
Removes the first occurrence of a given key in the frequency list.
Definition frequency_list.h:320
-

+

empty

#include "frequency_list.h"
@@ -140,7 +140,7 @@
std::cout << "The list is empty." << '\n';
}
bool empty()
Checks if the frequency list is empty.
Definition frequency_list.h:139
-

+

Iterator

#include "frequency_list.h"
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html index 3a615176..bb59323d 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html @@ -75,8 +75,8 @@
Mini tutorial for single linked list class
-

linked_list<T> -- creates a linked list with elements of type T
-

+

linked_list<T> -- creates a linked list with elements of type T
+

push_back:

#include <linked_list.h>
@@ -87,7 +87,7 @@
//creates a linked list with elements {1,2,3}
single linked list class
Definition linked_list.h:18
void push_back(T key)
push_back function.
Definition linked_list.h:158
-

+

push_front:

#include <linked_list.h>
@@ -97,7 +97,7 @@
//creates a linked list with elements {3,2,1}
void push_front(T key)
push_front function.
Definition linked_list.h:169
-

+

erase:

#include <linked_list.h>
@@ -109,7 +109,7 @@
assert(l.search(2) == false);
bool search(T key)
search function.
Definition linked_list.h:200
void erase(T key)
erase function.
Definition linked_list.h:176
-

+

search:

#include <linked_list.h>
@@ -120,7 +120,7 @@
if(l.search(3) == true){
std::cout << "element 3 found in the list" << '\n';
}
-

+

reverse:

#include <linked_list.h>
@@ -131,7 +131,7 @@
l.reverse();
//now the linked list became {1,2,3}
void reverse()
reverse function.
Definition linked_list.h:234
-

+

elements:

#include <linked_list.h>
@@ -143,7 +143,7 @@
//returns the elements of the linked list in a vector<T>
std::vector<int> els = l.elements();
std::vector< T > elements()
elements function.
Definition linked_list.h:220
-

+

iterators:

#include <linked_list.h>
@@ -157,7 +157,7 @@
}
Iterator begin()
pointer that points to begin
Definition linked_list.h:75
Iterator end()
pointer that points to end
Definition linked_list.h:82
-

+

visualize:

#include <linked_list.h>
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html index 209e64e5..16b03b0e 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html @@ -75,8 +75,8 @@
Mini Tutorial for the Skip List class
-

1. skip_list<T> -- creates a skip list with T type elements.
-

+

1. skip_list<T> -- creates a skip list with T type elements.
+

insert:

#include <skip_list.h>
@@ -85,7 +85,7 @@
s.insert(5); // inserts 5 to the list.
s.insert(13); // inserts 13 to the list.
skip_list class.
Definition skip_list.h:16
-

+

remove:

#include <skip_list.h>
@@ -95,7 +95,7 @@
s.insert(13); // inserts 13 to the list.
s.remove(13); // removes 13 from the list.
-

+

search:

#include <skip_list.h>
@@ -108,7 +108,7 @@
if(s.search(13)){
std::cout << "element 13 found in the list" << '\n';
}
-

+

iterator:

#include <skip_list.h>
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html index 87689a90..47b82635 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html @@ -75,7 +75,7 @@
Mini Tutorial for the Stack class
-

dequeue_list<T> -- creates a dequeue implemented with a list.
+

dequeue_list<T> -- creates a dequeue implemented with a list.
 

splay tree contains:

  • push_back
  • push_front
  • @@ -86,7 +86,7 @@
  • clear
  • size
-

+

push_back:

#include <dequeue_list.h>
@@ -98,7 +98,7 @@

// now the dequeue contains {10,5,4,13}
dequeue list class
Definition dequeue_list.h:14
void push_back(T key)
push_back function
Definition dequeue_list.h:92
-

+

push_front:

#include <dequeue_list.h>
@@ -110,7 +110,7 @@

// now the dequeue contains {13,4,5,10}
void push_front(T key)
push_front function
Definition dequeue_list.h:112
-

+

front:

#include <dequeue_list.h>
@@ -123,7 +123,7 @@

// this should return 13
std::cout << q.front() << '\n';
T front()
top function
Definition dequeue_list.h:132
-

+

back:

#include <dequeue_list.h>
@@ -136,7 +136,7 @@

// this should return 10
std::cout << q.back() << '\n';
T back()
back function
Definition dequeue_list.h:139
-

+

pop_front:

#include <dequeue_list.h>
@@ -152,7 +152,7 @@

// this should return 4
std::cout << q.front() << '\n';
void pop_front()
pop_front function removes the front from the dequeue
Definition dequeue_list.h:145
-

+

pop_back:

#include <dequeue_list.h>
@@ -168,7 +168,7 @@

// this should return 5
std::cout << q.back() << '\n';
void pop_back()
pop_back function removes the back from the queue
Definition dequeue_list.h:155
-

+

iterator:

#include <dequeue_list.h>
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html index f1fd296c..b4f6fd8c 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html @@ -75,15 +75,15 @@
Mini Tutorial for the hash_table class
-

hash_table -- creates a hash table(dictionary).
-

+

hash_table -- creates a hash table(dictionary).
+

Create an instance of the hash_table::

#include <hash_table.h>
// creates a hash table with keys of type std::string and values of type int
A simple implementation of a hash table.
Definition hash_table.h:33
-

+

insert:

#include <hash_table.h>
@@ -93,7 +93,7 @@
ht.insert("carrot", 3);
// inserts key-value pairs {"apple", 1}, {"banana", 2}, {"carrot", 3} into the hash table
void insert(const KeyType &key, const ValueType &value)
Inserts a key-value pair into the hash table.
Definition hash_table.h:87
-

+

retrieve:

#include <hash_table.h>
@@ -110,7 +110,7 @@
std::cout << "Element not found" << '\n';
}
std::optional< ValueType > retrieve(const KeyType &key)
Retrieves the value associated with the given key.
Definition hash_table.h:104
-

+

remove:

#include <hash_table.h>
@@ -123,7 +123,7 @@
ht.remove("carrot");
assert(!ht.retrieve("carrot"));
void remove(const KeyType &key)
Removes the key-value pair associated with the given key from the hash table.
Definition hash_table.h:122
-

+

iterator:

#include <hash_table.h>
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html index 7ef15ba1..812d2698 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html @@ -75,7 +75,7 @@
Mini Tutorial for the Stack class
-

stack_list<T> -- creates a stack implemented with a list.
+

stack_list<T> -- creates a stack implemented with a list.
 

splay tree contains:

  • push
  • top
  • @@ -83,7 +83,7 @@
  • clear
  • size
-

+

push:

#include <stack_list.h>
@@ -95,7 +95,7 @@

// now the stack contains {10,5,4,13}
stack_list class
Definition stack_list.h:14
void push(T key)
push function
Definition stack_list.h:87
-

+

top:

#include <stack_list.h>
@@ -108,7 +108,7 @@

// this should return 13
std::cout << s.top() << '\n';
T top()
top function
Definition stack_list.h:106
-

+

pop:

#include <stack_list.h>
@@ -124,7 +124,7 @@

//this should return 4
std::cout << s.top() << '\n';
void pop()
pop function removes the top of the stack
Definition stack_list.h:112
-

+

iterator:

#include <stack_list.h>
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html index 512176bf..0d687299 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html @@ -75,8 +75,8 @@
Mini tutorial for linear regression class
-

-- linear_regression : creates a linear regression object
-

+

-- linear_regression : creates a linear regression object
+

Get results from linear regression(i.e. get a and b of y):

#include <machine_learning/regression/linear_regression/linear_regression.h>
@@ -88,7 +88,7 @@
...
}
Class for linear regression algorithm.
Definition lin_reg.h:15
-

+

Optionally you can use python's matplotlib for visualization purposes:

#include <iostream>
#include "lin_reg.h"
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html index b047e2cc..9c248aa8 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html @@ -75,15 +75,15 @@
Mini tutorial for polynomial regression class
-

-- polynomial_regression p(X, Y, n) creates a polynomial_regression class where (X, Y) the points of the data and n: the degree of the polynomial
-

+

-- polynomial_regression p(X, Y, n) creates a polynomial_regression class where (X, Y) the points of the data and n: the degree of the polynomial
+

Get coefficients

int64_t n = 3; //we can select the degree of the polynomial
// this line of code will return all the coefficients of the polynomial(see next bullet to learn how to visualize results!)
std::vector<double> b_coeffs = a.get_coeffs();
Definition poly_reg.h:11
-

+

Optionally you can use python's matplotlib for visualization purposes:

int main() {
srand((unsigned)time(NULL));
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html index 8b1f0c22..90b00a7a 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html @@ -75,7 +75,7 @@
Mini Tutorial for the AVL tree class
-

avl_tree<T> -- creates an avl tree.
+

avl_tree<T> -- creates an avl tree.
 

avl tree contains:

  • insert
  • remove
  • @@ -85,7 +85,7 @@
  • postorder
  • visualize
-

+

insert:

#include <avl.h>
@@ -96,7 +96,7 @@

a.insert(13);
//creates a tree with elements {4,5,10,13};
Class for AVL tree.
Definition avl_tree.h:17
-

+

remove:

#include <avl.h>
@@ -107,7 +107,7 @@

a.insert(13);
a.remove(4);
//removes the element 4 from the tree.
-

+

search:

#include <avl.h>
@@ -122,7 +122,7 @@

if(a.search(4)){
std::cout<< "element 4 found in the tree" << '\n';
}
-

+

inorder:

#include <avl.h>
@@ -135,7 +135,7 @@

//returns the elements in inorder fashion.
std::vector<int> in = a.inorder();
-

+

preorder:

#include <avl.h>
@@ -148,7 +148,7 @@

//returns the elements in preorder fashion.
std::vector<int> pre = a.preorder();
-

+

postorder:

#include <avl.h>
@@ -161,7 +161,7 @@

//returns the elements in postorder fashion.
std::vector<int> in = a.postorder();
-

+

visualize:

#include <avl.h>
@@ -175,7 +175,7 @@

//returns a .dot file that can easily be previewed using
//vscode plugin for graphviz or local command line tools.
a.visualize();
-

+

iterator:

#include <avl.h>
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html index bfb7492c..5508438b 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html @@ -75,7 +75,7 @@
Mini Tutorial for the BST class
-

bst<T> -- creates an avl tree.
+

bst<T> -- creates an avl tree.
 

avl tree contains:

  • insert
  • remove
  • @@ -86,7 +86,7 @@
  • postorder
  • visualize
-

+

insert:

#include <bst.h>
@@ -97,7 +97,7 @@

b.insert(13);
//creates a tree with elements {4,5,10,13};
Class for BST tree.
Definition bst.h:18
-

+

remove:

#include <bst.h>
@@ -108,7 +108,7 @@

b.insert(13);
b.remove(4);
//removes the element 4 from the tree.
-

+

search:

#include <bst.h>
@@ -123,7 +123,7 @@

if(b.search(4)){
std::cout<< "element 4 found in the tree" << '\n';
}
-

+

inorder:

#include <bst.h>
@@ -136,7 +136,7 @@

//returns the elements in inorder fashion.
std::vector<int> in = b.inorder();
-

+

preorder:

#include <bst.h>
@@ -149,7 +149,7 @@

//returns the elements in preorder fashion.
std::vector<int> pre = b.preorder();
-

+

postorder:

#include <bst.h>
@@ -162,7 +162,7 @@

//returns the elements in postorder fashion.
std::vector<int> in = a.postorder();
-

+

iterator:

#include <bst.h>
@@ -179,7 +179,7 @@

//note that begin starts from the leftmost value
std::cout << *(it) << ' ';
}
-

+

visualize:

#include <bst.h>
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html index ae7097b8..99808c81 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html @@ -75,8 +75,8 @@
Mini Tutorial for the Interval Tree class
-

1. interval_tree<T> -- creates an interval tree with pairs of <T,T>
-

+

1. interval_tree<T> -- creates an interval tree with pairs of <T,T>
+

insert:

#include <interval_tree.h>
@@ -86,8 +86,8 @@
i.insert({29, 99});
i.insert({0, 1});
i.insert({10, 15});
-
interval tree class
Definition interval_tree.h:16
-

+
interval tree class
Definition interval_tree.h:17
+

search:

#include <interval_tree.h>
@@ -101,7 +101,7 @@
if(i.search({10,15})){
std::cout << "interval {10,15} found in the tree" << '\n';
}
-

+

remove:

#include <interval_tree.h>
@@ -115,7 +115,7 @@
//removes an interval from the tree
i.remove({0,1});
assert(i.search({0,1}) == false)
-

+

overlap:

#include <interval_tree.h>
@@ -129,7 +129,7 @@
if(i.overlap({0,5}, {1,6})){
std::cout << "Overlap between {0,5} and {1,6} exist!" << '\n';
}
-

+

inorder:

#include <interval_tree.h>
@@ -142,7 +142,7 @@
// returns the elements of the tree in inorder fashion
std::vector<int> inorder = i.inorder();
-

+

preorder:

#include <interval_tree.h>
@@ -155,7 +155,7 @@
// returns the elements of the tree in preorder fashion
std::vector<int> preorder = i.preorder();
-

+

postorder:

#include <interval_tree.h>
@@ -168,7 +168,7 @@
// returns the elements of the tree in preorder fashion
std::vector<int> postorder = i.postorder();
-

+

visualize:

#include <interval_tree.h>
@@ -182,7 +182,7 @@
// using graphviz plugins on vscode(or locally with
// command lines).
i.visualize();
-

+

iterator:

#include <interval_tree.h>
diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html index 8b0b8b1d..b346d2d4 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html @@ -75,7 +75,7 @@
Mini Tutorial for the Splay Tree class
-

splay_tree<T> -- creates a splay tree.
+

splay_tree<T> -- creates a splay tree.
 

splay tree contains:

  • insert
  • remove
  • @@ -87,7 +87,7 @@
  • postorder
  • visualize
-

+

insert:

#include <splay_tree.h>
@@ -97,9 +97,9 @@

s.insert(4);
s.insert(13);
//creates a tree with elements {4,5,10,13};
-
splay tree class
Definition splay_tree.h:16
-
void insert(T key)
insert function
Definition splay_tree.h:83
-

+
splay tree class
Definition splay_tree.h:17
+
void insert(T key)
insert function
Definition splay_tree.h:84
+

remove:

#include <splay_tree.h>
@@ -110,8 +110,8 @@

s.insert(13);
s.remove(4);
//removes the element 4 from the tree.
-
void remove(T key)
remove function
Definition splay_tree.h:93
-

+
void remove(T key)
remove function
Definition splay_tree.h:94
+

search:

#include <splay_tree.h>
@@ -126,8 +126,8 @@

if(s.search(4)){
std::cout<< "element 4 found in the tree" << '\n';
}
-
bool search(T key)
search function
Definition splay_tree.h:105
-

+
bool search(T key)
search function
Definition splay_tree.h:106
+

inorder:

#include <splay_tree.h>
@@ -140,8 +140,8 @@

//returns the elements in inorder fashion.
std::vector<int> in = s.inorder();
-
std::vector< T > inorder()
inorder function.
Definition splay_tree.h:133
-

+
std::vector< T > inorder()
inorder function.
Definition splay_tree.h:134
+

preorder:

#include <splay_tree.h>
@@ -154,8 +154,8 @@

//returns the elements in preorder fashion.
std::vector<int> pre = s.preorder();
-
std::vector< T > preorder()
preorder function.
Definition splay_tree.h:147
-

+
std::vector< T > preorder()
preorder function.
Definition splay_tree.h:148
+

postorder:

#include <splay_tree.h>
@@ -168,7 +168,7 @@

//returns the elements in postorder fashion.
std::vector<int> in = a.postorder();
-

+

iterator:

#include <splay_tree.h>
@@ -184,7 +184,7 @@

//note that begin starts from the leftmost value
std::cout << *(it) << ' ';
}
-

+

visualize:

#include <splay_tree.h>
@@ -198,7 +198,7 @@

//returns a .dot file that can easily be previewed using
//vscode plugin for graphviz or local command line tools.
-
void visualize()
visualize function
Definition splay_tree.h:175
+
void visualize()
visualize function
Definition splay_tree.h:203

diff --git a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html index 65019b8f..085a6f3d 100644 --- a/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html +++ b/docs/html/md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html @@ -75,8 +75,8 @@
Mini Tutorial for the Trie class
-

trie -- creates an trie tree(or prefix tree).
-

+

trie -- creates an trie tree(or prefix tree).
+

insert:

#include <trie.h>
@@ -87,7 +87,7 @@
// creates a tree with elements {"hello", "world", "universe"}
trie class
Definition trie.h:14
void insert(std::string key)
insert function.
Definition trie.h:131
-

+

search:

#include <trie.h>
@@ -101,7 +101,7 @@
std::cout << "world exists in the tree" << '\n';
}
bool search(std::string key)
search function.
Definition trie.h:149
-

+

remove:

#include <trie.h>
diff --git a/docs/html/namespacemembers.html b/docs/html/namespacemembers.html index 30e54cab..9b66f513 100644 --- a/docs/html/namespacemembers.html +++ b/docs/html/namespacemembers.html @@ -75,6 +75,7 @@
Here is a list of all documented namespace members with links to the namespaces they belong to:
  • append_exponent() : detail::dtoa_impl
  • apply_median_filter() : median_filter
  • +
  • apply_sharpening_filter() : sharpening_filter
  • cbor_tag_handler_t : detail
  • compute_boundaries() : detail::dtoa_impl
  • error_handler_t : detail
  • diff --git a/docs/html/namespacemembers_func.html b/docs/html/namespacemembers_func.html index c60da1fe..67f66cc5 100644 --- a/docs/html/namespacemembers_func.html +++ b/docs/html/namespacemembers_func.html @@ -75,6 +75,7 @@
    Here is a list of all documented namespace functions with links to the namespaces they belong to:
diff --git a/docs/html/namespacesharpening__filter.html b/docs/html/namespacesharpening__filter.html new file mode 100644 index 00000000..56a9f2b1 --- /dev/null +++ b/docs/html/namespacesharpening__filter.html @@ -0,0 +1,125 @@ + + + + + + + +AlgoPlus: sharpening_filter Namespace Reference + + + + + + + + + + + +
+
+ + + + + + + +
+
AlgoPlus v0.1.0 +
+
+
+ + + + + + + + +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+
+ +
sharpening_filter Namespace Reference
+
+
+ +

sharpening_filter namespace +More...

+ + + + + +

+Functions

std::vector< std::vector< int32_t > > apply_sharpening_filter (Image img)
 apply_sharpening_filter function: applies a 3x3 laplacian filter to image img
 
+

Detailed Description

+

sharpening_filter namespace

+

Function Documentation

+ +

◆ apply_sharpening_filter()

+ +
+
+ + + + + + + +
std::vector< std::vector< int32_t > > sharpening_filter::apply_sharpening_filter (Image img)
+
+ +

apply_sharpening_filter function: applies a 3x3 laplacian filter to image img

+
Parameters
+ + +
img(ClassImage): the input image
+
+
+
Returns
vector<vector<int32_t> > : the resulted image after applying the laplacian filter
+ +
+
+
+ + + + diff --git a/docs/html/pages.html b/docs/html/pages.html index 938b7ef7..e6f2bb00 100644 --- a/docs/html/pages.html +++ b/docs/html/pages.html @@ -86,23 +86,24 @@  Mini tutorial for edge detection namespace  Mini tutorial for huffman coding class  Mini tutorial for median filter namespace - Mini tutorial for circular linked list class - Mini tutorial for doubly linked list class - Mini Tutorial for the frequency_list class - Mini tutorial for single linked list class - Mini Tutorial for the Skip List class - Mini Tutorial for the Stack class - Mini Tutorial for the hash_table class - Mini Tutorial for the Stack class - Mini tutorial for linear regression class - Mini tutorial for polynomial regression class - Mini Tutorial for the AVL tree class - Mini Tutorial for the BST class - Mini Tutorial for the Interval Tree class - Mini Tutorial for the Splay Tree class - Mini Tutorial for the Trie class - How do i write unit tests? - Deprecated List + Mini tutorial for sharpening filter namespace + Mini tutorial for circular linked list class + Mini tutorial for doubly linked list class + Mini Tutorial for the frequency_list class + Mini tutorial for single linked list class + Mini Tutorial for the Skip List class + Mini Tutorial for the Stack class + Mini Tutorial for the hash_table class + Mini Tutorial for the Stack class + Mini tutorial for linear regression class + Mini tutorial for polynomial regression class + Mini Tutorial for the AVL tree class + Mini Tutorial for the BST class + Mini Tutorial for the Interval Tree class + Mini Tutorial for the Splay Tree class + Mini Tutorial for the Trie class + How do i write unit tests? + Deprecated List diff --git a/docs/html/search/all_10.js b/docs/html/search/all_10.js index 37e28e20..f4aad7cc 100644 --- a/docs/html/search/all_10.js +++ b/docs/html/search/all_10.js @@ -4,5 +4,5 @@ var searchData= ['key_1',['key',['../classdetail_1_1iteration__proxy__value.html#ad12633bc0d3ac7a651381b174a7914ee',1,'detail::iteration_proxy_value::key()'],['../structjson__sax.html#a3355ecd7e3e9806dcb80b2f8842b82ce',1,'json_sax::key()'],['../classdetail_1_1iter__impl.html#a4064b295014b32f3cabd86f94264fc74',1,'detail::iter_impl::key()'],['../classdetail_1_1json__reverse__iterator.html#a68d4f0c3e978afdc7509ee88e2f7b996',1,'detail::json_reverse_iterator::key()'],['../namespacedetail.html#a47b1bb0bbd3596589ed9187059c312efa3c6e0b8a9c15224a8228b9a98ca1531d',1,'detail::key']]], ['kmeans_2',['kmeans',['../classkmeans.html',1,'kmeans'],['../classkmeans.html#af696ff45df389c26254937064944e0c5',1,'kmeans::kmeans()']]], ['kmeans_20class_3',['Mini tutorial for kmeans class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html',1,'']]], - ['kmeans_3a_20strong_20_3a_4',['<strong>Create an instance of kmeans:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md30',1,'']]] + ['kmeans_3a_20strong_20_3a_4',['<strong>Create an instance of kmeans:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md31',1,'']]] ]; diff --git a/docs/html/search/all_11.js b/docs/html/search/all_11.js index 438621c2..7df059c8 100644 --- a/docs/html/search/all_11.js +++ b/docs/html/search/all_11.js @@ -2,20 +2,21 @@ var searchData= [ ['lazyexpression_0',['LazyExpression',['../class_catch_1_1_lazy_expression.html',1,'Catch']]], ['less_3c_20_3a_3anlohmann_3a_3adetail_3a_3avalue_5ft_20_3e_1',['less< ::nlohmann::detail::value_t >',['../structstd_1_1less_3_01_1_1nlohmann_1_1detail_1_1value__t_01_4.html',1,'std']]], - ['lexer_2',['lexer',['../classdetail_1_1lexer.html',1,'detail']]], - ['lexer_5fbase_3',['lexer_base',['../classdetail_1_1lexer__base.html',1,'detail']]], - ['linear_20regression_20class_4',['Mini tutorial for linear regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html',1,'']]], - ['linear_20regression_20i_20e_20get_20a_20and_20b_20of_20y_20_3a_20strong_5',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md115',1,'']]], - ['linear_5fregression_6',['linear_regression',['../classlinear__regression.html',1,'linear_regression'],['../classlinear__regression.html#a8c56cd49e738a840b3482779924e9b53',1,'linear_regression::linear_regression()']]], - ['lines_5fread_7',['lines_read',['../structdetail_1_1position__t.html#a9ec1ac6600d1364f4d1c9f67de6a670b',1,'detail::position_t']]], - ['linked_20list_20class_8',['linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html',1,'Mini tutorial for circular linked list class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html',1,'Mini tutorial for doubly linked list class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'Mini tutorial for single linked list class']]], - ['linked_5flist_9',['linked_list',['../classlinked__list.html',1,'linked_list< T >'],['../classlinked__list.html#a0ce3db6fd04bd1d38e689e90e160772a',1,'linked_list::linked_list(std::vector< T > __elements={}) noexcept'],['../classlinked__list.html#a0eaec813e8a1356d1762a00661bdab80',1,'linked_list::linked_list(const linked_list &l)']]], - ['list_10',['Deprecated List',['../deprecated.html',1,'']]], - ['list_20class_11',['list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html',1,'Mini tutorial for circular linked list class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html',1,'Mini tutorial for doubly linked list class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'Mini tutorial for single linked list class']]], - ['list_20class_12',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], - ['literal_5ffalse_13',['literal_false',['../classdetail_1_1lexer__base.html#add65fa7a85aa15052963809fbcc04540afab1694b1b3937a079f4625fe0b6108b',1,'detail::lexer_base']]], - ['literal_5fnull_14',['literal_null',['../classdetail_1_1lexer__base.html#add65fa7a85aa15052963809fbcc04540ab7ae4c0e46d86f884677768160b26e9e',1,'detail::lexer_base']]], - ['literal_5for_5fvalue_15',['literal_or_value',['../classdetail_1_1lexer__base.html#add65fa7a85aa15052963809fbcc04540ad2a8e6f6721cccec0b466301dd9495a5',1,'detail::lexer_base']]], - ['literal_5ftrue_16',['literal_true',['../classdetail_1_1lexer__base.html#add65fa7a85aa15052963809fbcc04540a85cc1a37b0aaa52de40e72f0ed4e0c0d',1,'detail::lexer_base']]], - ['loc_17',['loc',['../classdetail_1_1serializer.html#a80ca90565eec446d377ab65a023297ab',1,'detail::serializer']]] + ['level_5forder_2',['level_order',['../classavl__tree.html#ab139b35985a741d7834ef1e356c5f18f',1,'avl_tree::level_order()'],['../classbst.html#ab9768cfd3f234e31558ccc1a283a1ed4',1,'bst::level_order()'],['../classinterval__tree.html#a11316641338b91307a0d777b55964a24',1,'interval_tree::level_order()'],['../classsplay__tree.html#a1563389efc44838d96fcbf1302e7bf10',1,'splay_tree::level_order()'],['../classtree.html#a5d18c70b1377d47b133104cd178a48e9',1,'tree::level_order()']]], + ['lexer_3',['lexer',['../classdetail_1_1lexer.html',1,'detail']]], + ['lexer_5fbase_4',['lexer_base',['../classdetail_1_1lexer__base.html',1,'detail']]], + ['linear_20regression_20class_5',['Mini tutorial for linear regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html',1,'']]], + ['linear_20regression_20i_20e_20get_20a_20and_20b_20of_20y_20_3a_20strong_6',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md119',1,'']]], + ['linear_5fregression_7',['linear_regression',['../classlinear__regression.html',1,'linear_regression'],['../classlinear__regression.html#a8c56cd49e738a840b3482779924e9b53',1,'linear_regression::linear_regression()']]], + ['lines_5fread_8',['lines_read',['../structdetail_1_1position__t.html#a9ec1ac6600d1364f4d1c9f67de6a670b',1,'detail::position_t']]], + ['linked_20list_20class_9',['linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html',1,'Mini tutorial for circular linked list class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html',1,'Mini tutorial for doubly linked list class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'Mini tutorial for single linked list class']]], + ['linked_5flist_10',['linked_list',['../classlinked__list.html',1,'linked_list< T >'],['../classlinked__list.html#a0ce3db6fd04bd1d38e689e90e160772a',1,'linked_list::linked_list(std::vector< T > __elements={}) noexcept'],['../classlinked__list.html#a0eaec813e8a1356d1762a00661bdab80',1,'linked_list::linked_list(const linked_list &l)']]], + ['list_11',['Deprecated List',['../deprecated.html',1,'']]], + ['list_20class_12',['list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html',1,'Mini tutorial for circular linked list class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html',1,'Mini tutorial for doubly linked list class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'Mini tutorial for single linked list class']]], + ['list_20class_13',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], + ['literal_5ffalse_14',['literal_false',['../classdetail_1_1lexer__base.html#add65fa7a85aa15052963809fbcc04540afab1694b1b3937a079f4625fe0b6108b',1,'detail::lexer_base']]], + ['literal_5fnull_15',['literal_null',['../classdetail_1_1lexer__base.html#add65fa7a85aa15052963809fbcc04540ab7ae4c0e46d86f884677768160b26e9e',1,'detail::lexer_base']]], + ['literal_5for_5fvalue_16',['literal_or_value',['../classdetail_1_1lexer__base.html#add65fa7a85aa15052963809fbcc04540ad2a8e6f6721cccec0b466301dd9495a5',1,'detail::lexer_base']]], + ['literal_5ftrue_17',['literal_true',['../classdetail_1_1lexer__base.html#add65fa7a85aa15052963809fbcc04540a85cc1a37b0aaa52de40e72f0ed4e0c0d',1,'detail::lexer_base']]], + ['loc_18',['loc',['../classdetail_1_1serializer.html#a80ca90565eec446d377ab65a023297ab',1,'detail::serializer']]] ]; diff --git a/docs/html/search/all_12.js b/docs/html/search/all_12.js index 9c36971d..80354810 100644 --- a/docs/html/search/all_12.js +++ b/docs/html/search/all_12.js @@ -5,61 +5,63 @@ var searchData= ['m_5fvalue_2',['m_value',['../classbasic__json.html#acd0f167153f047a246b51858d7c921b8',1,'basic_json']]], ['make_5fvoid_3',['make_void',['../structdetail_1_1make__void.html',1,'detail']]], ['mapgenerator_4',['MapGenerator',['../class_catch_1_1_generators_1_1_map_generator.html',1,'Catch::Generators']]], - ['masking_20using_20apply_5fmedian_5ffilter_20function_20strong_20_3a_5',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md53',1,'']]], - ['mat1d_6',['Mat1d',['../class_mat1d.html',1,'Mat1d< T, SIZE >'],['../class_mat1d.html#a190fdc829a106ccdaf13c8809f09fb86',1,'Mat1d::Mat1d(std::vector< T > v={})'],['../class_mat1d.html#aae86aa599b8e6e90eec1118c4180c060',1,'Mat1d::Mat1d(const T val) noexcept'],['../class_mat1d.html#a87b738c5e712fcaf88b64199246c6b88',1,'Mat1d::Mat1d(Mat1d &mat)']]], - ['mat1d_3c_20t_2c_20cols_20_3e_7',['Mat1d< T, COLS >',['../class_mat1d.html',1,'']]], - ['mat2d_8',['Mat2d',['../class_mat2d.html',1,'Mat2d< T, ROWS, COLS >'],['../class_mat2d.html#a812093c17b462919340dcd77079ad304',1,'Mat2d::Mat2d(std::vector< std::vector< T > > v={})'],['../class_mat2d.html#a4680fb6d236e63379d2d9c8366d04c7e',1,'Mat2d::Mat2d(const T val) noexcept'],['../class_mat2d.html#af91bb089306c912c7ddc0f9be10ad0d0',1,'Mat2d::Mat2d(const Mat2d &mat)']]], - ['matchallof_9',['MatchAllOf',['../struct_catch_1_1_matchers_1_1_impl_1_1_match_all_of.html',1,'Catch::Matchers::Impl']]], - ['matchanyof_10',['MatchAnyOf',['../struct_catch_1_1_matchers_1_1_impl_1_1_match_any_of.html',1,'Catch::Matchers::Impl']]], - ['matcherbase_11',['MatcherBase',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_base.html',1,'Catch::Matchers::Impl']]], - ['matcherbase_3c_20argt_20_3e_12',['MatcherBase< ArgT >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_base.html',1,'Catch::Matchers::Impl']]], - ['matcherbase_3c_20double_20_3e_13',['MatcherBase< double >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_base.html',1,'Catch::Matchers::Impl']]], - ['matcherbase_3c_20std_3a_3aexception_20_3e_14',['MatcherBase< std::exception >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_base.html',1,'Catch::Matchers::Impl']]], - ['matcherbase_3c_20std_3a_3astring_20_3e_15',['MatcherBase< std::string >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_base.html',1,'Catch::Matchers::Impl']]], - ['matcherbase_3c_20std_3a_3avector_3c_20t_2c_20alloc_20_3e_20_3e_16',['MatcherBase< std::vector< T, Alloc > >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_base.html',1,'Catch::Matchers::Impl']]], - ['matcherbase_3c_20std_3a_3avector_3c_20t_2c_20allocmatch_20_3e_20_3e_17',['MatcherBase< std::vector< T, AllocMatch > >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_base.html',1,'Catch::Matchers::Impl']]], - ['matchermethod_18',['MatcherMethod',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_method.html',1,'Catch::Matchers::Impl']]], - ['matchermethod_3c_20argt_20_3e_19',['MatcherMethod< ArgT >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_method.html',1,'Catch::Matchers::Impl']]], - ['matchermethod_3c_20double_20_3e_20',['MatcherMethod< double >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_method.html',1,'Catch::Matchers::Impl']]], - ['matchermethod_3c_20std_3a_3aexception_20_3e_21',['MatcherMethod< std::exception >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_method.html',1,'Catch::Matchers::Impl']]], - ['matchermethod_3c_20std_3a_3astring_20_3e_22',['MatcherMethod< std::string >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_method.html',1,'Catch::Matchers::Impl']]], - ['matchermethod_3c_20t_20_3e_23',['MatcherMethod< T >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_method.html',1,'Catch::Matchers::Impl']]], - ['matcheruntypedbase_24',['MatcherUntypedBase',['../class_catch_1_1_matchers_1_1_impl_1_1_matcher_untyped_base.html',1,'Catch::Matchers::Impl']]], - ['matchexpr_25',['MatchExpr',['../class_catch_1_1_match_expr.html',1,'Catch']]], - ['matchnotof_26',['MatchNotOf',['../struct_catch_1_1_matchers_1_1_impl_1_1_match_not_of.html',1,'Catch::Matchers::Impl']]], - ['matplotlib_20for_20visualization_20purposes_3a_20strong_27',['Matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md116',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md119',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], - ['matplotlib_20function_3a_20strong_20_3a_28',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['matplotlib_3a_20strong_20_3a_29',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], - ['max_5fsize_30',['max_size',['../classbasic__json.html#a380f98b02e7d50cf28af056a6ad8ffe6',1,'basic_json']]], - ['median_20filter_20namespace_31',['Mini tutorial for median filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'']]], - ['median_5ffilter_32',['median_filter',['../namespacemedian__filter.html',1,'']]], - ['merge_5fpatch_33',['merge_patch',['../classbasic__json.html#a8676ac2433fe299b8d420f00a0741395',1,'basic_json']]], - ['messagebuilder_34',['MessageBuilder',['../struct_catch_1_1_message_builder.html',1,'Catch']]], - ['messageinfo_35',['MessageInfo',['../struct_catch_1_1_message_info.html',1,'Catch']]], - ['messagestream_36',['MessageStream',['../struct_catch_1_1_message_stream.html',1,'Catch']]], - ['meta_37',['meta',['../classbasic__json.html#a7b435c2ed2db99cb1daa78ae3c6c4580',1,'basic_json']]], - ['min_38',['min',['../classmin__heap.html#a1f4229dc4a3f4e5888293b7de530163a',1,'min_heap']]], - ['min_5fheap_39',['min_heap',['../classmin__heap.html',1,'min_heap< T >'],['../classmin__heap.html#a2db8fee3af814966c7299e10e3b7592a',1,'min_heap::min_heap()']]], - ['mini_20tutorial_20for_20circular_20linked_20list_20class_40',['Mini tutorial for circular linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html',1,'']]], - ['mini_20tutorial_20for_20dbscan_20class_41',['Mini tutorial for DBSCAN class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html',1,'']]], - ['mini_20tutorial_20for_20doubly_20linked_20list_20class_42',['Mini tutorial for doubly linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html',1,'']]], - ['mini_20tutorial_20for_20edge_20detection_20namespace_43',['Mini tutorial for edge detection namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html',1,'']]], - ['mini_20tutorial_20for_20huffman_20coding_20class_44',['Mini tutorial for huffman coding class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html',1,'']]], - ['mini_20tutorial_20for_20kmeans_20class_45',['Mini tutorial for kmeans class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html',1,'']]], - ['mini_20tutorial_20for_20linear_20regression_20class_46',['Mini tutorial for linear regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html',1,'']]], - ['mini_20tutorial_20for_20median_20filter_20namespace_47',['Mini tutorial for median filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'']]], - ['mini_20tutorial_20for_20polynomial_20regression_20class_48',['Mini tutorial for polynomial regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html',1,'']]], - ['mini_20tutorial_20for_20single_20linked_20list_20class_49',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], - ['mini_20tutorial_20for_20the_20avl_20tree_20class_50',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], - ['mini_20tutorial_20for_20the_20bst_20class_51',['Mini Tutorial for the BST class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html',1,'']]], - ['mini_20tutorial_20for_20the_20frequency_5flist_20class_52',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]], - ['mini_20tutorial_20for_20the_20graph_20class_53',['Mini Tutorial for the Graph class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html',1,'']]], - ['mini_20tutorial_20for_20the_20hash_5ftable_20class_54',['Mini Tutorial for the hash_table class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html',1,'']]], - ['mini_20tutorial_20for_20the_20interval_20tree_20class_55',['Mini Tutorial for the Interval Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html',1,'']]], - ['mini_20tutorial_20for_20the_20skip_20list_20class_56',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], - ['mini_20tutorial_20for_20the_20splay_20tree_20class_57',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], - ['mini_20tutorial_20for_20the_20stack_20class_58',['Mini Tutorial for the Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], - ['mini_20tutorial_20for_20the_20trie_20class_59',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]], - ['mul_60',['mul',['../class_image.html#a7ceea7a73b614f189cd5c9e9bf3f7863',1,'Image::mul(std::vector< std::vector< int32_t > > &img2) const'],['../class_image.html#a1af53349d893161a56a03e1b89eed0f9',1,'Image::mul(Image img2) const'],['../structdetail_1_1dtoa__impl_1_1diyfp.html#a046c61f2c13411677eedfb5b9b7a8226',1,'detail::dtoa_impl::diyfp::mul()']]], - ['my_20code_61',['How should i comment my code?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_m_m_e_n_t_s.html',1,'']]] + ['masking_20using_20apply_5fmedian_5ffilter_20function_20strong_20_3a_5',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md54',1,'']]], + ['masking_20using_20apply_5fsharpening_5ffilter_20function_20strong_20_3a_6',['<strong>How to perform the masking using apply_sharpening_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html#autotoc_md57',1,'']]], + ['mat1d_7',['Mat1d',['../class_mat1d.html',1,'Mat1d< T, SIZE >'],['../class_mat1d.html#a190fdc829a106ccdaf13c8809f09fb86',1,'Mat1d::Mat1d(std::vector< T > v={})'],['../class_mat1d.html#aae86aa599b8e6e90eec1118c4180c060',1,'Mat1d::Mat1d(const T val) noexcept'],['../class_mat1d.html#a87b738c5e712fcaf88b64199246c6b88',1,'Mat1d::Mat1d(Mat1d &mat)']]], + ['mat1d_3c_20t_2c_20cols_20_3e_8',['Mat1d< T, COLS >',['../class_mat1d.html',1,'']]], + ['mat2d_9',['Mat2d',['../class_mat2d.html',1,'Mat2d< T, ROWS, COLS >'],['../class_mat2d.html#a812093c17b462919340dcd77079ad304',1,'Mat2d::Mat2d(std::vector< std::vector< T > > v={})'],['../class_mat2d.html#a4680fb6d236e63379d2d9c8366d04c7e',1,'Mat2d::Mat2d(const T val) noexcept'],['../class_mat2d.html#af91bb089306c912c7ddc0f9be10ad0d0',1,'Mat2d::Mat2d(const Mat2d &mat)']]], + ['matchallof_10',['MatchAllOf',['../struct_catch_1_1_matchers_1_1_impl_1_1_match_all_of.html',1,'Catch::Matchers::Impl']]], + ['matchanyof_11',['MatchAnyOf',['../struct_catch_1_1_matchers_1_1_impl_1_1_match_any_of.html',1,'Catch::Matchers::Impl']]], + ['matcherbase_12',['MatcherBase',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_base.html',1,'Catch::Matchers::Impl']]], + ['matcherbase_3c_20argt_20_3e_13',['MatcherBase< ArgT >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_base.html',1,'Catch::Matchers::Impl']]], + ['matcherbase_3c_20double_20_3e_14',['MatcherBase< double >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_base.html',1,'Catch::Matchers::Impl']]], + ['matcherbase_3c_20std_3a_3aexception_20_3e_15',['MatcherBase< std::exception >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_base.html',1,'Catch::Matchers::Impl']]], + ['matcherbase_3c_20std_3a_3astring_20_3e_16',['MatcherBase< std::string >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_base.html',1,'Catch::Matchers::Impl']]], + ['matcherbase_3c_20std_3a_3avector_3c_20t_2c_20alloc_20_3e_20_3e_17',['MatcherBase< std::vector< T, Alloc > >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_base.html',1,'Catch::Matchers::Impl']]], + ['matcherbase_3c_20std_3a_3avector_3c_20t_2c_20allocmatch_20_3e_20_3e_18',['MatcherBase< std::vector< T, AllocMatch > >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_base.html',1,'Catch::Matchers::Impl']]], + ['matchermethod_19',['MatcherMethod',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_method.html',1,'Catch::Matchers::Impl']]], + ['matchermethod_3c_20argt_20_3e_20',['MatcherMethod< ArgT >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_method.html',1,'Catch::Matchers::Impl']]], + ['matchermethod_3c_20double_20_3e_21',['MatcherMethod< double >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_method.html',1,'Catch::Matchers::Impl']]], + ['matchermethod_3c_20std_3a_3aexception_20_3e_22',['MatcherMethod< std::exception >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_method.html',1,'Catch::Matchers::Impl']]], + ['matchermethod_3c_20std_3a_3astring_20_3e_23',['MatcherMethod< std::string >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_method.html',1,'Catch::Matchers::Impl']]], + ['matchermethod_3c_20t_20_3e_24',['MatcherMethod< T >',['../struct_catch_1_1_matchers_1_1_impl_1_1_matcher_method.html',1,'Catch::Matchers::Impl']]], + ['matcheruntypedbase_25',['MatcherUntypedBase',['../class_catch_1_1_matchers_1_1_impl_1_1_matcher_untyped_base.html',1,'Catch::Matchers::Impl']]], + ['matchexpr_26',['MatchExpr',['../class_catch_1_1_match_expr.html',1,'Catch']]], + ['matchnotof_27',['MatchNotOf',['../struct_catch_1_1_matchers_1_1_impl_1_1_match_not_of.html',1,'Catch::Matchers::Impl']]], + ['matplotlib_20for_20visualization_20purposes_3a_20strong_28',['Matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md120',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md123',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], + ['matplotlib_20function_3a_20strong_20_3a_29',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['matplotlib_3a_20strong_20_3a_30',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], + ['max_5fsize_31',['max_size',['../classbasic__json.html#a380f98b02e7d50cf28af056a6ad8ffe6',1,'basic_json']]], + ['median_20filter_20namespace_32',['Mini tutorial for median filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'']]], + ['median_5ffilter_33',['median_filter',['../namespacemedian__filter.html',1,'']]], + ['merge_5fpatch_34',['merge_patch',['../classbasic__json.html#a8676ac2433fe299b8d420f00a0741395',1,'basic_json']]], + ['messagebuilder_35',['MessageBuilder',['../struct_catch_1_1_message_builder.html',1,'Catch']]], + ['messageinfo_36',['MessageInfo',['../struct_catch_1_1_message_info.html',1,'Catch']]], + ['messagestream_37',['MessageStream',['../struct_catch_1_1_message_stream.html',1,'Catch']]], + ['meta_38',['meta',['../classbasic__json.html#a7b435c2ed2db99cb1daa78ae3c6c4580',1,'basic_json']]], + ['min_39',['min',['../classmin__heap.html#a1f4229dc4a3f4e5888293b7de530163a',1,'min_heap']]], + ['min_5fheap_40',['min_heap',['../classmin__heap.html',1,'min_heap< T >'],['../classmin__heap.html#a2db8fee3af814966c7299e10e3b7592a',1,'min_heap::min_heap()']]], + ['mini_20tutorial_20for_20circular_20linked_20list_20class_41',['Mini tutorial for circular linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html',1,'']]], + ['mini_20tutorial_20for_20dbscan_20class_42',['Mini tutorial for DBSCAN class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html',1,'']]], + ['mini_20tutorial_20for_20doubly_20linked_20list_20class_43',['Mini tutorial for doubly linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html',1,'']]], + ['mini_20tutorial_20for_20edge_20detection_20namespace_44',['Mini tutorial for edge detection namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html',1,'']]], + ['mini_20tutorial_20for_20huffman_20coding_20class_45',['Mini tutorial for huffman coding class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html',1,'']]], + ['mini_20tutorial_20for_20kmeans_20class_46',['Mini tutorial for kmeans class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html',1,'']]], + ['mini_20tutorial_20for_20linear_20regression_20class_47',['Mini tutorial for linear regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html',1,'']]], + ['mini_20tutorial_20for_20median_20filter_20namespace_48',['Mini tutorial for median filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'']]], + ['mini_20tutorial_20for_20polynomial_20regression_20class_49',['Mini tutorial for polynomial regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html',1,'']]], + ['mini_20tutorial_20for_20sharpening_20filter_20namespace_50',['Mini tutorial for sharpening filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html',1,'']]], + ['mini_20tutorial_20for_20single_20linked_20list_20class_51',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], + ['mini_20tutorial_20for_20the_20avl_20tree_20class_52',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], + ['mini_20tutorial_20for_20the_20bst_20class_53',['Mini Tutorial for the BST class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html',1,'']]], + ['mini_20tutorial_20for_20the_20frequency_5flist_20class_54',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]], + ['mini_20tutorial_20for_20the_20graph_20class_55',['Mini Tutorial for the Graph class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html',1,'']]], + ['mini_20tutorial_20for_20the_20hash_5ftable_20class_56',['Mini Tutorial for the hash_table class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html',1,'']]], + ['mini_20tutorial_20for_20the_20interval_20tree_20class_57',['Mini Tutorial for the Interval Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html',1,'']]], + ['mini_20tutorial_20for_20the_20skip_20list_20class_58',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], + ['mini_20tutorial_20for_20the_20splay_20tree_20class_59',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], + ['mini_20tutorial_20for_20the_20stack_20class_60',['Mini Tutorial for the Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], + ['mini_20tutorial_20for_20the_20trie_20class_61',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]], + ['mul_62',['mul',['../class_image.html#a7ceea7a73b614f189cd5c9e9bf3f7863',1,'Image::mul(std::vector< std::vector< int32_t > > &img2) const'],['../class_image.html#a1af53349d893161a56a03e1b89eed0f9',1,'Image::mul(Image img2) const'],['../structdetail_1_1dtoa__impl_1_1diyfp.html#a046c61f2c13411677eedfb5b9b7a8226',1,'detail::dtoa_impl::diyfp::mul()']]], + ['my_20code_63',['How should i comment my code?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_m_m_e_n_t_s.html',1,'']]] ]; diff --git a/docs/html/search/all_13.js b/docs/html/search/all_13.js index 21c29e03..92d366ea 100644 --- a/docs/html/search/all_13.js +++ b/docs/html/search/all_13.js @@ -2,11 +2,11 @@ var searchData= [ ['name_5fseparator_0',['name_separator',['../classdetail_1_1lexer__base.html#add65fa7a85aa15052963809fbcc04540acc3c64f8ae08c00de1b33f19a4d2913a',1,'detail::lexer_base']]], ['nameandtags_1',['NameAndTags',['../struct_catch_1_1_name_and_tags.html',1,'Catch']]], - ['namespace_2',['namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html',1,'Mini tutorial for edge detection namespace'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'Mini tutorial for median filter namespace']]], + ['namespace_2',['namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html',1,'Mini tutorial for edge detection namespace'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'Mini tutorial for median filter namespace'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html',1,'Mini tutorial for sharpening filter namespace']]], ['negation_3',['negation',['../structdetail_1_1negation.html',1,'detail']]], ['new_20class_20strong_4',['<strong>Creating a new Class</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_n_t_r_i_b_u_t_e.html#autotoc_md14',1,'']]], ['nextid_5',['nextId',['../class_d_b_s_c_a_n.html#a905021a89af288a06f9fcb7dbe935c75',1,'DBSCAN']]], - ['noise_20with_20dbscan_20clustering_3a_20strong_20_3a_6',['<strong>Get noise with DBSCAN clustering:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md27',1,'']]], + ['noise_20with_20dbscan_20clustering_3a_20strong_20_3a_6',['<strong>Get noise with DBSCAN clustering:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], ['noncopyable_7',['NonCopyable',['../class_catch_1_1_non_copyable.html',1,'Catch']]], ['nonesuch_8',['nonesuch',['../structdetail_1_1nonesuch.html',1,'detail']]], ['normalize_9',['normalize',['../structdetail_1_1dtoa__impl_1_1diyfp.html#a5bad735c2cb50b194938a8a89b82f6ed',1,'detail::dtoa_impl::diyfp']]], diff --git a/docs/html/search/all_14.js b/docs/html/search/all_14.js index ae767d4c..5d08cbb9 100644 --- a/docs/html/search/all_14.js +++ b/docs/html/search/all_14.js @@ -7,10 +7,10 @@ var searchData= ['object_5fstart_4',['object_start',['../namespacedetail.html#a47b1bb0bbd3596589ed9187059c312efae73f17027cb0acbb537f29d0a6944b26',1,'detail']]], ['object_5ft_5',['object_t',['../classbasic__json.html#a67bb0d6dfaf1709d918b7107f5b94a3d',1,'basic_json']]], ['of_20conduct_6',['Contributor Covenant Code of Conduct',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], - ['of_20dbscan_3a_20strong_20_3a_7',['<strong>Create an instance of DBSCAN:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md25',1,'']]], - ['of_20kmeans_3a_20strong_20_3a_8',['<strong>Create an instance of kmeans:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md30',1,'']]], - ['of_20the_20hash_5ftable_3a_20strong_20_3a_9',['<strong>Create an instance of the hash_table:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md104',1,'']]], - ['of_20y_20_3a_20strong_10',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md115',1,'']]], + ['of_20dbscan_3a_20strong_20_3a_7',['<strong>Create an instance of DBSCAN:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md26',1,'']]], + ['of_20kmeans_3a_20strong_20_3a_8',['<strong>Create an instance of kmeans:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md31',1,'']]], + ['of_20the_20hash_5ftable_3a_20strong_20_3a_9',['<strong>Create an instance of the hash_table:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md108',1,'']]], + ['of_20y_20_3a_20strong_10',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md119',1,'']]], ['operator_20size_5ft_11',['operator size_t',['../structdetail_1_1position__t.html#a1299e15d15516235772d36e077ec9741',1,'detail::position_t']]], ['operator_20string_5ft_12',['operator string_t',['../classjson__pointer.html#a97364e516620b02f1049f847b2ad43c9',1,'json_pointer']]], ['operator_20value_5ft_13',['operator value_t',['../classbasic__json.html#a70e1c8fbdb62f3f8bc04e69eef9cc9cf',1,'basic_json']]], @@ -28,7 +28,7 @@ var searchData= ['operator_2f_25',['operator/',['../classjson__pointer.html#a90a11fe6c7f37b1746a3ff9cb24b0d53',1,'json_pointer::operator/'],['../classjson__pointer.html#a116956f4487af44732dd685e970679b0',1,'json_pointer::operator/'],['../classjson__pointer.html#a29f6d4b492e784b9d196b05a4048c289',1,'json_pointer::operator/']]], ['operator_2f_3d_26',['operator/=',['../classjson__pointer.html#a8bb8e43c6e01a6370cd49ba130171219',1,'json_pointer::operator/=(const json_pointer &ptr)'],['../classjson__pointer.html#aa810a9db8c1d6e67c4a3703dc66a18d4',1,'json_pointer::operator/=(string_t token)'],['../classjson__pointer.html#a6c2bffffbf08b77259e0b658c841703c',1,'json_pointer::operator/=(std::size_t array_idx)']]], ['operator_3c_27',['operator<',['../classdetail_1_1iter__impl.html#a339df296df7f5d014d5c7cedf40497da',1,'detail::iter_impl::operator<()'],['../classjson__pointer.html#af8c9bbaed20be0634a2e522f54265d96',1,'json_pointer::operator<'],['../namespacedetail.html#aac7ca91589afb0bad68baec5949daaa2',1,'detail::operator<()']]], - ['operator_3c_3c_28',['operator<<',['../classgraph.html#a192732806b0edc5242c55a045ca77421',1,'graph::operator<<'],['../classweighted__graph.html#afa0c1b6af0f7b36d24ce876abbc92107',1,'weighted_graph::operator<<'],['../classhash__table.html#a9699a70465c91ed86faf744d436af69a',1,'hash_table::operator<<'],['../classcircular__linked__list.html#ad28b4924b79de5736accc4576f40ac0a',1,'circular_linked_list::operator<<'],['../classdoubly__linked__list.html#ac1c1ed53b4f01df3ce575bf872778bb9',1,'doubly_linked_list::operator<<'],['../classfrequency__list.html#a594639f408a5cb2d280f32d751178621',1,'frequency_list::operator<<'],['../classlinked__list.html#a7299ebf8aba1c5c4d9c20ee6cf413d09',1,'linked_list::operator<<'],['../classskip__list.html#a8f64399c87d929894ff113f7a6ff8b54',1,'skip_list::operator<<'],['../classinterval__tree.html#a9ec9c06e600dc687b3ec921559634fb9',1,'interval_tree::operator<<'],['../class_mat1d.html#a6fcb5b1c831cc22a3ebe196004fe809e',1,'Mat1d::operator<<'],['../class_mat2d.html#a30384f3df9404e379fde20edf403ea04',1,'Mat2d::operator<<'],['../classjson__pointer.html#ad4140db2dd2f347f46f3abae0fc2156f',1,'json_pointer::operator<<'],['../classbasic__json.html#af9907af448f7ff794120033e132025f6',1,'basic_json::operator<<']]], + ['operator_3c_3c_28',['operator<<',['../classgraph.html#a192732806b0edc5242c55a045ca77421',1,'graph::operator<<'],['../classweighted__graph.html#afa0c1b6af0f7b36d24ce876abbc92107',1,'weighted_graph::operator<<'],['../classhash__table.html#a9699a70465c91ed86faf744d436af69a',1,'hash_table::operator<<'],['../classcircular__linked__list.html#ad28b4924b79de5736accc4576f40ac0a',1,'circular_linked_list::operator<<'],['../classdoubly__linked__list.html#ac1c1ed53b4f01df3ce575bf872778bb9',1,'doubly_linked_list::operator<<'],['../classfrequency__list.html#a594639f408a5cb2d280f32d751178621',1,'frequency_list::operator<<'],['../classlinked__list.html#a7299ebf8aba1c5c4d9c20ee6cf413d09',1,'linked_list::operator<<'],['../classskip__list.html#a8f64399c87d929894ff113f7a6ff8b54',1,'skip_list::operator<<'],['../classavl__tree.html#abe65b6fb7200651bba6f6bfe22f62b58',1,'avl_tree::operator<<'],['../classbst.html#a2366bf064084a61835ca523cd0b7ff4e',1,'bst::operator<<'],['../classinterval__tree.html#a59fbcb3841f451597a2157e49e211529',1,'interval_tree::operator<<'],['../classsplay__tree.html#a4aa8ac953ded6034d002a27f2f9b43ce',1,'splay_tree::operator<<'],['../classtree.html#a6f8da6eb21a892f7c7b2b93380e29da2',1,'tree::operator<<'],['../class_mat1d.html#a6fcb5b1c831cc22a3ebe196004fe809e',1,'Mat1d::operator<<'],['../class_mat2d.html#a30384f3df9404e379fde20edf403ea04',1,'Mat2d::operator<<'],['../classjson__pointer.html#ad4140db2dd2f347f46f3abae0fc2156f',1,'json_pointer::operator<<'],['../classbasic__json.html#af9907af448f7ff794120033e132025f6',1,'basic_json::operator<<']]], ['operator_3c_3d_29',['operator<=',['../classdetail_1_1iter__impl.html#a343806ffb02d7ce5266492128dfd5f9b',1,'detail::iter_impl']]], ['operator_3d_30',['operator=',['../classgraph.html#ae1111eaf01c6fb231e4d6f73bd3f17a1',1,'graph::operator=()'],['../classweighted__graph.html#af16cc99c33739bdbd6cee4c7f5b9ad1f',1,'weighted_graph::operator=()'],['../classhash__table.html#a0646b760956296ae948e8da9a8fb098e',1,'hash_table::operator=()'],['../classhash__table_1_1_iterator.html#a365c4beeb31ebaa1084ec74487c16630',1,'hash_table::Iterator::operator=()'],['../classcircular__linked__list.html#a9d79aae4fb8aa50458445316882f9a47',1,'circular_linked_list::operator=()'],['../classcircular__linked__list_1_1_iterator.html#a5791b47de8bba74a6b6f7bb4e45760e9',1,'circular_linked_list::Iterator::operator=()'],['../classdoubly__linked__list.html#a507a83da3b92fe52b02080400dc7dba2',1,'doubly_linked_list::operator=()'],['../classdoubly__linked__list_1_1_iterator.html#a4f837710fcc0e6e13c01c91ad8165221',1,'doubly_linked_list::Iterator::operator=()'],['../classfrequency__list_1_1_iterator.html#a1829c6005d1751f02a936e9144d70bfe',1,'frequency_list::Iterator::operator=()'],['../classlinked__list.html#aeba978254e8067143b7130c1da264c2a',1,'linked_list::operator=()'],['../classlinked__list_1_1_iterator.html#a6db11114d40299a99617944ba88062e5',1,'linked_list::Iterator::operator=()'],['../classskip__list.html#a64217373d3d42f50efee572ec320a455',1,'skip_list::operator=()'],['../classskip__list_1_1_iterator.html#a4b44660273caa258f213557bb2ca3d52',1,'skip_list::Iterator::operator=()'],['../classdequeue__list.html#a34497ca3d303b684b1011b5588a29613',1,'dequeue_list::operator=()'],['../classdequeue__list_1_1_iterator.html#ac74bbee7a5669d18d1ab69bfe7080659',1,'dequeue_list::Iterator::operator=()'],['../classstack__list.html#a54ef72bdebdbc8f49ea6c1969ea5d04a',1,'stack_list::operator=()'],['../classstack__list_1_1_iterator.html#a981ee13d3cc916a6dce5fb568cc23700',1,'stack_list::Iterator::operator=()'],['../classavl__tree.html#a7170cb4310ced0ab7d002efba16fc32f',1,'avl_tree::operator=()'],['../classavl__tree_1_1_iterator.html#af76d60d2edbddb06bc78ee386a624e6d',1,'avl_tree::Iterator::operator=()'],['../classbst.html#a8d1fb0829946f59b93a261ffdb8d044d',1,'bst::operator=()'],['../classbst_1_1_iterator.html#a6276eeecbb32a63b7b521c421aace359',1,'bst::Iterator::operator=()'],['../classinterval__tree.html#aaedefbcd20cca4389fb4e1bbd82fc15e',1,'interval_tree::operator=()'],['../classinterval__tree_1_1_iterator.html#a9992c3e16cb8d978f144209fb0cb3e86',1,'interval_tree::Iterator::operator=()'],['../classsplay__tree.html#ad3545f2f8b26bcef4f938decb1ac276e',1,'splay_tree::operator=()'],['../classsplay__tree_1_1_iterator.html#a380f4b06e38351d43dedcfda5d6a503e',1,'splay_tree::Iterator::operator=()'],['../classtree_1_1_iterator.html#a53210378f482844d45567cce524752f7',1,'tree::Iterator::operator=()'],['../classtrie.html#a55d98cca9c3d9a46f409db156fb36582',1,'trie::operator=()'],['../class_mat1d.html#a8a0eb5b018b01a0581f9fde70271f816',1,'Mat1d::operator=()'],['../class_mat1d_1_1_iterator.html#a0f1f815320addfe2d81e2a0ab676142f',1,'Mat1d::Iterator::operator=()'],['../class_mat2d.html#ae02c9c8f56d68bf9e59c0294636b311f',1,'Mat2d::operator=()'],['../class_mat2d_1_1_iterator.html#ab54274a8171afd31c4df5949c14bd739',1,'Mat2d::Iterator::operator=()'],['../classdetail_1_1iter__impl.html#ae347fdf39e75d13ce488335ef1529b27',1,'detail::iter_impl::operator=(const iter_impl< const BasicJsonType > &other) noexcept'],['../classdetail_1_1iter__impl.html#a228140be2554afd5dfe54d4194780b7c',1,'detail::iter_impl::operator=(const iter_impl< typename std::remove_const< BasicJsonType >::type > &other) noexcept'],['../classbasic__json.html#ab8154023fc24515222c9cf61d677871e',1,'basic_json::operator=()']]], ['operator_3d_3d_31',['operator==',['../classfrequency__list_1_1_iterator.html#a6ff52cb1cbee8d198e405429163bc680',1,'frequency_list::Iterator::operator==()'],['../class_mat1d.html#ac0a0616977dda8b1848b645cc982abf5',1,'Mat1d::operator==()'],['../classdetail_1_1iteration__proxy__value.html#a139d22be442a277268cfb78bb4eef95d',1,'detail::iteration_proxy_value::operator==()'],['../classdetail_1_1iter__impl.html#a57b4e1eee4a3cdb3c0683cf64979da8d',1,'detail::iter_impl::operator==()'],['../classjson__pointer.html#a613a4889154f7ab2ee4efbe0fe147cf2',1,'json_pointer::operator=='],['../classjson__pointer.html#af6bf727798ad49870a709094e5ff981c',1,'json_pointer::operator=='],['../classjson__pointer.html#ae7aabbb2a365ddaac5192ccea3226bfb',1,'json_pointer::operator==']]], @@ -37,9 +37,9 @@ var searchData= ['operator_3e_3e_34',['operator>>',['../classbasic__json.html#aea0de29387d532e0bc5f2475cb83995d',1,'basic_json']]], ['operator_5b_5d_35',['operator[]',['../class_mat1d.html#ab4efee5334e47d87ecd83e6465e0d4e5',1,'Mat1d::operator[]()'],['../classdetail_1_1iter__impl.html#a5e557e30103e2af36cd8173c88eb586c',1,'detail::iter_impl::operator[]()'],['../classdetail_1_1json__reverse__iterator.html#a50a57718a9d49039b7592bf34f5819a2',1,'detail::json_reverse_iterator::operator[]()'],['../classbasic__json.html#ab4f511db82b9d5eba85d5b2b8e1c6dbb',1,'basic_json::operator[](size_type idx)'],['../classbasic__json.html#ae369d1565482903c3af75bf99467776b',1,'basic_json::operator[](size_type idx) const'],['../classbasic__json.html#a9c5825034534bf9256a33d2dd995c25a',1,'basic_json::operator[](typename object_t::key_type key)'],['../classbasic__json.html#a3d3ea17617e94886f3e86ac921095a13',1,'basic_json::operator[](const typename object_t::key_type &key) const'],['../classbasic__json.html#a06fe1a1c7aa8c193c73aa40b17ee5f68',1,'basic_json::operator[](KeyType &&key)'],['../classbasic__json.html#a2e11a3f2a234cd296b515173b6a3b986',1,'basic_json::operator[](KeyType &&key) const'],['../classbasic__json.html#a274307158c76b820701077dd471cc75b',1,'basic_json::operator[](const json_pointer &ptr)'],['../classbasic__json.html#a6aedef6230f66b1271d71a6f77e7fed3',1,'basic_json::operator[](const json_pointer &ptr) const']]], ['option_36',['Option',['../class_catch_1_1_option.html',1,'Catch']]], - ['optionally_20for_20visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_37',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['optionally_20for_20visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_38',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], - ['optionally_20you_20can_20use_20python_20s_20matplotlib_20for_20visualization_20purposes_3a_20strong_39',['Optionally you can use python s matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md116',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md119',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], + ['optionally_20for_20visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_37',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['optionally_20for_20visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_38',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], + ['optionally_20you_20can_20use_20python_20s_20matplotlib_20for_20visualization_20purposes_3a_20strong_39',['Optionally you can use python s matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md120',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md123',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], ['ordered_5fmap_40',['ordered_map',['../structordered__map.html',1,'']]], ['other_5ferror_41',['other_error',['../classdetail_1_1other__error.html',1,'detail']]], ['our_20contributors_20strong_42',['<strong>Our contributors</strong>',['../index.html#autotoc_md22',1,'']]], @@ -54,5 +54,5 @@ var searchData= ['output_5fstring_5fadapter_51',['output_string_adapter',['../classdetail_1_1output__string__adapter.html',1,'detail']]], ['output_5fvector_5fadapter_52',['output_vector_adapter',['../classdetail_1_1output__vector__adapter.html',1,'detail']]], ['overlap_53',['overlap',['../classinterval__tree.html#a4f7fa294476721da36f1542b71a5e79f',1,'interval_tree']]], - ['overlap_20strong_20_3a_54',['<strong>overlap</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md142',1,'']]] + ['overlap_20strong_20_3a_54',['<strong>overlap</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md146',1,'']]] ]; diff --git a/docs/html/search/all_15.js b/docs/html/search/all_15.js index c269d616..6e5aff57 100644 --- a/docs/html/search/all_15.js +++ b/docs/html/search/all_15.js @@ -9,46 +9,47 @@ var searchData= ['parser_5fcallback_5ft_6',['parser_callback_t',['../classbasic__json.html#a50644d655c9283aaf0e2a0f3a5428867',1,'basic_json']]], ['patch_7',['patch',['../classbasic__json.html#a145a004c0a2fa5be84b260ecc98ab5d9',1,'basic_json']]], ['patch_5finplace_8',['patch_inplace',['../classbasic__json.html#a693812b31e106dec9166e93d8f6dd7d7',1,'basic_json']]], - ['perform_20edge_20detection_20with_20sobel_20function_20strong_20_3a_9',['<strong>Perform edge detection with Sobel() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md47',1,'']]], - ['perform_20the_20masking_20using_20apply_5fmedian_5ffilter_20function_20strong_20_3a_10',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md53',1,'']]], - ['permanent_20ban_11',['4. Permanent Ban',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'']]], - ['pledge_12',['Our Pledge',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md1',1,'']]], - ['plot_13',['Plot',['../classmatplotlibcpp_1_1_plot.html',1,'matplotlibcpp']]], - ['plot_5fimpl_14',['plot_impl',['../structmatplotlibcpp_1_1detail_1_1plot__impl.html',1,'matplotlibcpp::detail']]], - ['plot_5fimpl_3c_20std_3a_3afalse_5ftype_20_3e_15',['plot_impl< std::false_type >',['../structmatplotlibcpp_1_1detail_1_1plot__impl_3_01std_1_1false__type_01_4.html',1,'matplotlibcpp::detail']]], - ['plot_5fimpl_3c_20std_3a_3atrue_5ftype_20_3e_16',['plot_impl< std::true_type >',['../structmatplotlibcpp_1_1detail_1_1plot__impl_3_01std_1_1true__type_01_4.html',1,'matplotlibcpp::detail']]], - ['pluralise_17',['pluralise',['../struct_catch_1_1pluralise.html',1,'Catch']]], - ['pointer_18',['pointer',['../classdetail_1_1iter__impl.html#a5f32f4fdd48a9b92ecb156af6421b1b8',1,'detail::iter_impl::pointer'],['../classbasic__json.html#a84279673ab13fb6360cf17173a29a1f1',1,'basic_json::pointer']]], - ['polynomial_20regression_20class_19',['Mini tutorial for polynomial regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html',1,'']]], - ['polynomial_5fregression_20',['polynomial_regression',['../classpolynomial__regression.html',1,'']]], - ['pop_21',['pop',['../classstack__list.html#a1e95582086ed2d898a62c17d8a237e5d',1,'stack_list']]], - ['pop_20strong_20_3a_22',['<strong>pop</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md112',1,'']]], - ['pop_5fback_23',['pop_back',['../classdequeue__list.html#a06ae5994e52c6fa82995fced1555d7be',1,'dequeue_list::pop_back()'],['../classjson__pointer.html#a662118b470c87a1b564946c2602c49ce',1,'json_pointer::pop_back()']]], - ['pop_5fback_20strong_20_3a_24',['<strong>pop_back</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md101',1,'']]], - ['pop_5ffront_25',['pop_front',['../classdequeue__list.html#a30a8222a95d7ab43b78d590f1415fa41',1,'dequeue_list']]], - ['pop_5ffront_20strong_20_3a_26',['<strong>pop_front</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md100',1,'']]], - ['position_5ft_27',['position_t',['../structdetail_1_1position__t.html',1,'detail']]], - ['postorder_28',['postorder',['../classavl__tree.html#a82a19335d79d5f6928369635278c1c24',1,'avl_tree::postorder()'],['../classbst.html#a60575db4d925e7f08202549df73d0d9b',1,'bst::postorder()'],['../classinterval__tree.html#ad9fdedfea81952b61fb60b966849d911',1,'interval_tree::postorder()'],['../classsplay__tree.html#a0a344c13f06a9f9666d8225264897553',1,'splay_tree::postorder()'],['../classtree.html#a1f3f031770fcf1490f2a8a56d8573c72',1,'tree::postorder()']]], - ['postorder_20strong_20_3a_29',['Postorder strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md126',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md135',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md145',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md154',1,'<strong>postorder</strong>:']]], - ['predicatematcher_30',['PredicateMatcher',['../class_catch_1_1_matchers_1_1_generic_1_1_predicate_matcher.html',1,'Catch::Matchers::Generic']]], - ['preorder_31',['preorder',['../classavl__tree.html#a8b6368356a04a58f29b1f56f835b7548',1,'avl_tree::preorder()'],['../classbst.html#a4c3359b500e074fce8d1f3eae21dfdca',1,'bst::preorder()'],['../classinterval__tree.html#ab8c4a843dab72278f269ffe034f30f06',1,'interval_tree::preorder()'],['../classsplay__tree.html#a8c943a8d38b1e57f8e45686bf45c3e43',1,'splay_tree::preorder()'],['../classtree.html#a63caa8ece1a8503f591e60dd48bde102',1,'tree::preorder()']]], - ['preorder_20strong_20_3a_32',['Preorder strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md125',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md134',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md144',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md153',1,'<strong>preorder</strong>:']]], - ['prim_33',['prim',['../classweighted__graph.html#af6623f21c14c98732dc1c2595307fb7a',1,'weighted_graph']]], - ['prim_20strong_20_3a_34',['<strong>prim</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md43',1,'']]], - ['primitive_5fiterator_35',['primitive_iterator',['../structdetail_1_1internal__iterator.html#a8bb8034d2d35fb129e0dd742ce024e44',1,'detail::internal_iterator']]], - ['primitive_5fiterator_5ft_36',['primitive_iterator_t',['../classdetail_1_1primitive__iterator__t.html',1,'detail']]], - ['priority_5ftag_37',['priority_tag',['../structdetail_1_1priority__tag.html',1,'detail']]], - ['priority_5ftag_3c_200_20_3e_38',['priority_tag< 0 >',['../structdetail_1_1priority__tag_3_010_01_4.html',1,'detail']]], - ['purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_39',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_40',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], - ['purposes_3a_20strong_41',['Purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md116',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md119',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], - ['push_42',['push',['../classstack__list.html#a4ba916c3846e16b81bfd18194bab9808',1,'stack_list']]], - ['push_20strong_20_3a_43',['<strong>push</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md110',1,'']]], - ['push_5fback_44',['push_back',['../classcircular__linked__list.html#a3f7dae009cc9d2cbf634f9cad3eb3651',1,'circular_linked_list::push_back()'],['../classdoubly__linked__list.html#a0d7d611c1c937954e4fdbe866d542c23',1,'doubly_linked_list::push_back()'],['../classfrequency__list.html#aaa6570efed6d63daeeda8ca1743d0d68',1,'frequency_list::push_back()'],['../classlinked__list.html#a6ca7bbbcf82ba896aa89dde77ee48fde',1,'linked_list::push_back()'],['../classdequeue__list.html#a6bb8882f621456fea94b6023ced7c3bd',1,'dequeue_list::push_back()'],['../classjson__pointer.html#adbe97f9c00a221fb7be88d940b39a24f',1,'json_pointer::push_back(const string_t &token)'],['../classjson__pointer.html#a6fa4848eafc232ae1af91c3d2696897e',1,'json_pointer::push_back(string_t &&token)'],['../classbasic__json.html#a3d13acce4e49e0d5ee768643a7b89010',1,'basic_json::push_back(basic_json &&val)'],['../classbasic__json.html#aca01ca3a9bc310e5c5d067a39dca6933',1,'basic_json::push_back(const basic_json &val)'],['../classbasic__json.html#af17fe93acad9b0b991600225dabd42be',1,'basic_json::push_back(const typename object_t::value_type &val)'],['../classbasic__json.html#a4fcacc90f17b156f0b6c8e0430624853',1,'basic_json::push_back(initializer_list_t init)']]], - ['push_5fback_20strong_20_3a_45',['Push_back strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md56',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md65',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md74',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md82',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md96',1,'<strong>push_back</strong>:']]], - ['push_5ffront_46',['push_front',['../classcircular__linked__list.html#a5caccafa9f77dcfdfb1bad669877f609',1,'circular_linked_list::push_front()'],['../classdoubly__linked__list.html#a9132ebf985d2c3192cd93e91736c2bb6',1,'doubly_linked_list::push_front()'],['../classfrequency__list.html#a1eb001ee71276afe20e2b71bef50682e',1,'frequency_list::push_front()'],['../classlinked__list.html#a102388da0f9ed50e736eed9ada84a920',1,'linked_list::push_front()'],['../classdequeue__list.html#a87f40862616d3964c51aa84da8714e5e',1,'dequeue_list::push_front()']]], - ['push_5ffront_20strong_20_3a_47',['Push_front strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md57',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md66',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md75',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md83',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md97',1,'<strong>push_front</strong>:']]], - ['python_20s_20matplotlib_20for_20visualization_20purposes_3a_20strong_48',['Python s matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md116',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md119',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], - ['python_20s_20matplotlib_20function_3a_20strong_20_3a_49',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['python_20s_20matplotlib_3a_20strong_20_3a_50',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]] + ['perform_20edge_20detection_20with_20sobel_20function_20strong_20_3a_9',['<strong>Perform edge detection with Sobel() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md48',1,'']]], + ['perform_20the_20masking_20using_20apply_5fmedian_5ffilter_20function_20strong_20_3a_10',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md54',1,'']]], + ['perform_20the_20masking_20using_20apply_5fsharpening_5ffilter_20function_20strong_20_3a_11',['<strong>How to perform the masking using apply_sharpening_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html#autotoc_md57',1,'']]], + ['permanent_20ban_12',['4. Permanent Ban',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'']]], + ['pledge_13',['Our Pledge',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md1',1,'']]], + ['plot_14',['Plot',['../classmatplotlibcpp_1_1_plot.html',1,'matplotlibcpp']]], + ['plot_5fimpl_15',['plot_impl',['../structmatplotlibcpp_1_1detail_1_1plot__impl.html',1,'matplotlibcpp::detail']]], + ['plot_5fimpl_3c_20std_3a_3afalse_5ftype_20_3e_16',['plot_impl< std::false_type >',['../structmatplotlibcpp_1_1detail_1_1plot__impl_3_01std_1_1false__type_01_4.html',1,'matplotlibcpp::detail']]], + ['plot_5fimpl_3c_20std_3a_3atrue_5ftype_20_3e_17',['plot_impl< std::true_type >',['../structmatplotlibcpp_1_1detail_1_1plot__impl_3_01std_1_1true__type_01_4.html',1,'matplotlibcpp::detail']]], + ['pluralise_18',['pluralise',['../struct_catch_1_1pluralise.html',1,'Catch']]], + ['pointer_19',['pointer',['../classdetail_1_1iter__impl.html#a5f32f4fdd48a9b92ecb156af6421b1b8',1,'detail::iter_impl::pointer'],['../classbasic__json.html#a84279673ab13fb6360cf17173a29a1f1',1,'basic_json::pointer']]], + ['polynomial_20regression_20class_20',['Mini tutorial for polynomial regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html',1,'']]], + ['polynomial_5fregression_21',['polynomial_regression',['../classpolynomial__regression.html',1,'']]], + ['pop_22',['pop',['../classstack__list.html#a1e95582086ed2d898a62c17d8a237e5d',1,'stack_list']]], + ['pop_20strong_20_3a_23',['<strong>pop</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md116',1,'']]], + ['pop_5fback_24',['pop_back',['../classdequeue__list.html#a06ae5994e52c6fa82995fced1555d7be',1,'dequeue_list::pop_back()'],['../classjson__pointer.html#a662118b470c87a1b564946c2602c49ce',1,'json_pointer::pop_back()']]], + ['pop_5fback_20strong_20_3a_25',['<strong>pop_back</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md105',1,'']]], + ['pop_5ffront_26',['pop_front',['../classdequeue__list.html#a30a8222a95d7ab43b78d590f1415fa41',1,'dequeue_list']]], + ['pop_5ffront_20strong_20_3a_27',['<strong>pop_front</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md104',1,'']]], + ['position_5ft_28',['position_t',['../structdetail_1_1position__t.html',1,'detail']]], + ['postorder_29',['postorder',['../classavl__tree.html#a82a19335d79d5f6928369635278c1c24',1,'avl_tree::postorder()'],['../classbst.html#a60575db4d925e7f08202549df73d0d9b',1,'bst::postorder()'],['../classinterval__tree.html#ad9fdedfea81952b61fb60b966849d911',1,'interval_tree::postorder()'],['../classsplay__tree.html#a0a344c13f06a9f9666d8225264897553',1,'splay_tree::postorder()'],['../classtree.html#a1f3f031770fcf1490f2a8a56d8573c72',1,'tree::postorder()']]], + ['postorder_20strong_20_3a_30',['Postorder strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md130',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md139',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md149',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md158',1,'<strong>postorder</strong>:']]], + ['predicatematcher_31',['PredicateMatcher',['../class_catch_1_1_matchers_1_1_generic_1_1_predicate_matcher.html',1,'Catch::Matchers::Generic']]], + ['preorder_32',['preorder',['../classavl__tree.html#a8b6368356a04a58f29b1f56f835b7548',1,'avl_tree::preorder()'],['../classbst.html#a4c3359b500e074fce8d1f3eae21dfdca',1,'bst::preorder()'],['../classinterval__tree.html#ab8c4a843dab72278f269ffe034f30f06',1,'interval_tree::preorder()'],['../classsplay__tree.html#a8c943a8d38b1e57f8e45686bf45c3e43',1,'splay_tree::preorder()'],['../classtree.html#a63caa8ece1a8503f591e60dd48bde102',1,'tree::preorder()']]], + ['preorder_20strong_20_3a_33',['Preorder strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md129',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md138',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md148',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md157',1,'<strong>preorder</strong>:']]], + ['prim_34',['prim',['../classweighted__graph.html#af6623f21c14c98732dc1c2595307fb7a',1,'weighted_graph']]], + ['prim_20strong_20_3a_35',['<strong>prim</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md44',1,'']]], + ['primitive_5fiterator_36',['primitive_iterator',['../structdetail_1_1internal__iterator.html#a8bb8034d2d35fb129e0dd742ce024e44',1,'detail::internal_iterator']]], + ['primitive_5fiterator_5ft_37',['primitive_iterator_t',['../classdetail_1_1primitive__iterator__t.html',1,'detail']]], + ['priority_5ftag_38',['priority_tag',['../structdetail_1_1priority__tag.html',1,'detail']]], + ['priority_5ftag_3c_200_20_3e_39',['priority_tag< 0 >',['../structdetail_1_1priority__tag_3_010_01_4.html',1,'detail']]], + ['purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_40',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_41',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], + ['purposes_3a_20strong_42',['Purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md120',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md123',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], + ['push_43',['push',['../classstack__list.html#a4ba916c3846e16b81bfd18194bab9808',1,'stack_list']]], + ['push_20strong_20_3a_44',['<strong>push</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md114',1,'']]], + ['push_5fback_45',['push_back',['../classcircular__linked__list.html#a3f7dae009cc9d2cbf634f9cad3eb3651',1,'circular_linked_list::push_back()'],['../classdoubly__linked__list.html#a0d7d611c1c937954e4fdbe866d542c23',1,'doubly_linked_list::push_back()'],['../classfrequency__list.html#aaa6570efed6d63daeeda8ca1743d0d68',1,'frequency_list::push_back()'],['../classlinked__list.html#a6ca7bbbcf82ba896aa89dde77ee48fde',1,'linked_list::push_back()'],['../classdequeue__list.html#a6bb8882f621456fea94b6023ced7c3bd',1,'dequeue_list::push_back()'],['../classjson__pointer.html#adbe97f9c00a221fb7be88d940b39a24f',1,'json_pointer::push_back(const string_t &token)'],['../classjson__pointer.html#a6fa4848eafc232ae1af91c3d2696897e',1,'json_pointer::push_back(string_t &&token)'],['../classbasic__json.html#a3d13acce4e49e0d5ee768643a7b89010',1,'basic_json::push_back(basic_json &&val)'],['../classbasic__json.html#aca01ca3a9bc310e5c5d067a39dca6933',1,'basic_json::push_back(const basic_json &val)'],['../classbasic__json.html#af17fe93acad9b0b991600225dabd42be',1,'basic_json::push_back(const typename object_t::value_type &val)'],['../classbasic__json.html#a4fcacc90f17b156f0b6c8e0430624853',1,'basic_json::push_back(initializer_list_t init)']]], + ['push_5fback_20strong_20_3a_46',['Push_back strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md60',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md69',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md78',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md86',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md100',1,'<strong>push_back</strong>:']]], + ['push_5ffront_47',['push_front',['../classcircular__linked__list.html#a5caccafa9f77dcfdfb1bad669877f609',1,'circular_linked_list::push_front()'],['../classdoubly__linked__list.html#a9132ebf985d2c3192cd93e91736c2bb6',1,'doubly_linked_list::push_front()'],['../classfrequency__list.html#a1eb001ee71276afe20e2b71bef50682e',1,'frequency_list::push_front()'],['../classlinked__list.html#a102388da0f9ed50e736eed9ada84a920',1,'linked_list::push_front()'],['../classdequeue__list.html#a87f40862616d3964c51aa84da8714e5e',1,'dequeue_list::push_front()']]], + ['push_5ffront_20strong_20_3a_48',['Push_front strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md61',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md70',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md79',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md87',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md101',1,'<strong>push_front</strong>:']]], + ['python_20s_20matplotlib_20for_20visualization_20purposes_3a_20strong_49',['Python s matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md120',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md123',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], + ['python_20s_20matplotlib_20function_3a_20strong_20_3a_50',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['python_20s_20matplotlib_3a_20strong_20_3a_51',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]] ]; diff --git a/docs/html/search/all_16.js b/docs/html/search/all_16.js index 90909e91..4ba981cf 100644 --- a/docs/html/search/all_16.js +++ b/docs/html/search/all_16.js @@ -8,9 +8,9 @@ var searchData= ['regexmatcher_5',['RegexMatcher',['../struct_catch_1_1_matchers_1_1_std_string_1_1_regex_matcher.html',1,'Catch::Matchers::StdString']]], ['registrarfortagaliases_6',['RegistrarForTagAliases',['../struct_catch_1_1_registrar_for_tag_aliases.html',1,'Catch']]], ['regression_20class_7',['regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html',1,'Mini tutorial for linear regression class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html',1,'Mini tutorial for polynomial regression class']]], - ['regression_20i_20e_20get_20a_20and_20b_20of_20y_20_3a_20strong_8',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md115',1,'']]], + ['regression_20i_20e_20get_20a_20and_20b_20of_20y_20_3a_20strong_8',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md119',1,'']]], ['remove_9',['remove',['../classhash__table.html#ac9a4f3f321ddf37bcc445ea2c56d44ed',1,'hash_table::remove()'],['../classmin__heap.html#ad5364af3e61a8e296e524968f1925de2',1,'min_heap::remove()'],['../classskip__list.html#a5f586433aeedb6b248625e6cccee4eff',1,'skip_list::remove()'],['../classavl__tree.html#a76c9c53a32680f00a0071f1e236aa42b',1,'avl_tree::remove()'],['../classbst.html#a46aaefd422947e3f209db2e24119643a',1,'bst::remove()'],['../classinterval__tree.html#a7ddb8375fc087cdbebc397a03f5092c9',1,'interval_tree::remove()'],['../classsplay__tree.html#ab022b141626c54e2e09ab870e7000f89',1,'splay_tree::remove()'],['../classtrie.html#a856e569e4c40b5d5ebdaef26d8ec2a27',1,'trie::remove()']]], - ['remove_20strong_20_3a_10',['Remove strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md92',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md107',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md122',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md131',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md141',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md150',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md160',1,'<strong>remove</strong>:']]], + ['remove_20strong_20_3a_10',['Remove strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md96',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md111',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md126',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md135',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md145',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md154',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md164',1,'<strong>remove</strong>:']]], ['rend_11',['rend',['../classbasic__json.html#a8d8855a8c04ee7986ae8bab283c4f0de',1,'basic_json::rend() noexcept'],['../classbasic__json.html#ae81c3b38089a63d988a1efefe3ebc4bf',1,'basic_json::rend() const noexcept']]], ['repeatgenerator_12',['RepeatGenerator',['../class_catch_1_1_generators_1_1_repeat_generator.html',1,'Catch::Generators']]], ['replace_13',['replace',['../namespacedetail.html#abe7cfa1fd8fa706ff4392bff9d1a8298a9dde360102c103867bd2f45872f1129c',1,'detail']]], @@ -18,14 +18,14 @@ var searchData= ['reset_5ffrequency_15',['reset_frequency',['../classfrequency__list.html#a70ad5b8f5abd9e02cc5e96090bf2ca50',1,'frequency_list']]], ['responsibilities_16',['Enforcement Responsibilities',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md3',1,'']]], ['resultdisposition_17',['ResultDisposition',['../struct_catch_1_1_result_disposition.html',1,'Catch']]], - ['results_20from_20linear_20regression_20i_20e_20get_20a_20and_20b_20of_20y_20_3a_20strong_18',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md115',1,'']]], - ['results_20strong_20_3a_19',['Results strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md48',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md54',1,'<strong>Visualize your results</strong>:']]], + ['results_20from_20linear_20regression_20i_20e_20get_20a_20and_20b_20of_20y_20_3a_20strong_18',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md119',1,'']]], + ['results_20strong_20_3a_19',['Results strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md49',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md55',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html#autotoc_md58',1,'<strong>Visualize your results</strong>:']]], ['resultwas_20',['ResultWas',['../struct_catch_1_1_result_was.html',1,'Catch']]], ['retrieve_21',['retrieve',['../classhash__table.html#a29bcecb383e67c1e322ffffda88706db',1,'hash_table']]], - ['retrieve_20strong_20_3a_22',['<strong>retrieve</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md106',1,'']]], + ['retrieve_20strong_20_3a_22',['<strong>retrieve</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md110',1,'']]], ['reusablestringstream_23',['ReusableStringStream',['../class_catch_1_1_reusable_string_stream.html',1,'Catch']]], ['reverse_24',['reverse',['../classdoubly__linked__list.html#aa610759539cd3fc651f7ad950a19adaf',1,'doubly_linked_list::reverse()'],['../classlinked__list.html#a15bc074e7cee3245e603ce2e136c65e1',1,'linked_list::reverse()']]], - ['reverse_20strong_20_3a_25',['Reverse strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md60',1,'<strong>reverse</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md69',1,'<strong>reverse</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md86',1,'<strong>reverse</strong>:']]], + ['reverse_20strong_20_3a_25',['Reverse strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md64',1,'<strong>reverse</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md73',1,'<strong>reverse</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md90',1,'<strong>reverse</strong>:']]], ['reverse_5fiterator_26',['reverse_iterator',['../classbasic__json.html#aedc059cdae078322bb0d434b2127d1cf',1,'basic_json']]], ['rows_27',['rows',['../class_mat2d.html#a1ccb776f2bbfdac2ac7d01b67068f7fe',1,'Mat2d']]], ['run_20test_20cases_20strong_28',['<strong>How to run test cases</strong>',['../index.html#autotoc_md21',1,'']]], diff --git a/docs/html/search/all_17.js b/docs/html/search/all_17.js index 19c9ff66..4b7cb4db 100644 --- a/docs/html/search/all_17.js +++ b/docs/html/search/all_17.js @@ -1,15 +1,15 @@ var searchData= [ - ['s_20matplotlib_20for_20visualization_20purposes_3a_20strong_0',['S matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md116',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md119',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], - ['s_20matplotlib_20function_3a_20strong_20_3a_1',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['s_20matplotlib_3a_20strong_20_3a_2',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], + ['s_20matplotlib_20for_20visualization_20purposes_3a_20strong_0',['S matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md120',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md123',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], + ['s_20matplotlib_20function_3a_20strong_20_3a_1',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['s_20matplotlib_3a_20strong_20_3a_2',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], ['same_3',['same',['../classdsu.html#a19200aa5382ec3527a5029f1134fc254',1,'dsu']]], ['sax_5fparse_4',['sax_parse',['../classdetail_1_1binary__reader.html#a8e1b5452ae426e1d7b48761859e7f52d',1,'detail::binary_reader::sax_parse()'],['../classbasic__json.html#a94cbf1844fef86e9301282ad8ca0f822',1,'basic_json::sax_parse(IteratorType first, IteratorType last, SAX *sax, input_format_t format=input_format_t::json, const bool strict=true, const bool ignore_comments=false)'],['../classbasic__json.html#ad018e709338c810c56eaad606186a77e',1,'basic_json::sax_parse(detail::span_input_adapter &&i, SAX *sax, input_format_t format=input_format_t::json, const bool strict=true, const bool ignore_comments=false)']]], ['scc_5',['scc',['../classgraph.html#a0172e168010c9ddc2e85da6aea42b23f',1,'graph::scc()'],['../classweighted__graph.html#a0a49aa40e429a2f9c13096e5d11a33e6',1,'weighted_graph::scc()']]], ['scope_6',['Scope',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md4',1,'']]], ['scopedmessage_7',['ScopedMessage',['../class_catch_1_1_scoped_message.html',1,'Catch']]], ['search_8',['search',['../classcircular__linked__list.html#a1c978c5b99bc577c81e8d6d654a40b29',1,'circular_linked_list::search()'],['../classdoubly__linked__list.html#aca40a97ffdf597eaaf90c6a37feddbaf',1,'doubly_linked_list::search()'],['../classfrequency__list.html#a64e768e3b3bd8fcb3b00ca6020dda07a',1,'frequency_list::search()'],['../classlinked__list.html#a17a10ae353d0dc8fc7ffe309f0e68c60',1,'linked_list::search()'],['../classskip__list.html#af53fbbb2e9761d71c6d53d3969aac1c9',1,'skip_list::search()'],['../classavl__tree.html#a599641fb0e256bfa25deb206a7bf1b29',1,'avl_tree::search()'],['../classbst.html#acd2ed132fc83a3a50a4085b4b7a90f47',1,'bst::search()'],['../classinterval__tree.html#a5757bdc67f3a8a46d786676691b2d461',1,'interval_tree::search()'],['../classsplay__tree.html#ae15a430689cfc7d6f75c35f8420e36b4',1,'splay_tree::search()'],['../classtree.html#ab864144c77c70196ab04721c6632c704',1,'tree::search()'],['../classtrie.html#a390f27fc19bac589b2565bdbca3c0843',1,'trie::search()'],['../classbest__first.html#ad26f8ac0e1c3b07108054faa049a1c58',1,'best_first::search()'],['../classhill__climbing.html#a8b8ea4aff33c127d7de29a27e43e9680',1,'hill_climbing::search()']]], - ['search_20strong_20_3a_9',['Search strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md59',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md68',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md76',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md85',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md93',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md123',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md132',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md140',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md151',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md159',1,'<strong>search</strong>:']]], + ['search_20strong_20_3a_9',['Search strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md63',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md72',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md80',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md89',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md97',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md127',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md136',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md144',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md155',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md163',1,'<strong>search</strong>:']]], ['section_10',['Section',['../class_catch_1_1_section.html',1,'Catch']]], ['sectionendinfo_11',['SectionEndInfo',['../struct_catch_1_1_section_end_info.html',1,'Catch']]], ['sectioninfo_12',['SectionInfo',['../struct_catch_1_1_section_info.html',1,'Catch']]], @@ -34,128 +34,132 @@ var searchData= ['set_5fpoint_31',['set_point',['../class_image.html#a75f51a29849d86680f6e7548efdc73aa',1,'Image']]], ['set_5fsubtype_32',['set_subtype',['../classbyte__container__with__subtype.html#aa211ecfe3f0a626e96c54ea7e160491b',1,'byte_container_with_subtype']]], ['set_5fvalues_33',['set_values',['../namespacemedian__filter.html#a782ca650f73271174ed759e535b4cfa6',1,'median_filter']]], - ['shortest_5fpath_34',['shortest_path',['../classweighted__graph.html#a45b5f6269cf710025139eac881c9d9cb',1,'weighted_graph::shortest_path()'],['../class_a_star.html#a9df141efce063eaea654040eeedac9ed',1,'AStar::shortest_path()']]], - ['shortest_5fpath_20strong_20_3a_35',['<strong>shortest_path</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md42',1,'']]], - ['should_20i_20comment_20my_20code_36',['How should i comment my code?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_m_m_e_n_t_s.html',1,'']]], - ['showdurations_37',['ShowDurations',['../struct_catch_1_1_show_durations.html',1,'Catch']]], - ['simplepcg32_38',['SimplePcg32',['../class_catch_1_1_simple_pcg32.html',1,'Catch']]], - ['single_20linked_20list_20class_39',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], - ['singlevaluegenerator_40',['SingleValueGenerator',['../class_catch_1_1_generators_1_1_single_value_generator.html',1,'Catch::Generators']]], - ['size_41',['size',['../classdsu.html#a104ab7f0c4d8ac6e3acd61d79647e04a',1,'dsu::size()'],['../classgraph.html#ad3abf678df30b6091870278e1ffadfe7',1,'graph::size()'],['../classweighted__graph.html#ad835cebb7cd2d06e05faaad1c61b0e50',1,'weighted_graph::size()'],['../classcircular__linked__list.html#ae0e6f2aa4f4b5433fe3829ee99aca74a',1,'circular_linked_list::size()'],['../classdoubly__linked__list.html#a8b82160daf391c5fdca95c2b3e6af353',1,'doubly_linked_list::size()'],['../classlinked__list.html#aa54b9549d40d9c23c8e22983198e0f73',1,'linked_list::size()'],['../classdequeue__list.html#a2dbc5348a3048ad420e11aa077bf77a5',1,'dequeue_list::size()'],['../classstack__list.html#a2d39d7c7cd615ad374b06c15d20fdb21',1,'stack_list::size()'],['../classavl__tree.html#aab0ba446f1ee02bd5c6be467e1645ab2',1,'avl_tree::size()'],['../classbst.html#a8a04b4ab8c11fe64c9a3f282aa6eb187',1,'bst::size()'],['../classinterval__tree.html#ab91c1aba599b826ab6dbfae678fadb10',1,'interval_tree::size()'],['../classsplay__tree.html#aea0b17cab8207f3162e02835259100c6',1,'splay_tree::size()'],['../classtrie.html#a23992f5354b529ac51761730b7d19cd6',1,'trie::size()'],['../class_mat1d.html#a8d25301a4c262e57cec4ad88ea381de9',1,'Mat1d::size()'],['../class_mat2d.html#aab97c9be6c1f663322342a62cd0d5cd2',1,'Mat2d::size()'],['../classbasic__json.html#a086cbfd1ad4ba83a8127c87467a92f47',1,'basic_json::size() const noexcept']]], - ['size_5ftype_42',['size_type',['../classbasic__json.html#a2c086af43cf06b1b7118f5351cab3ec9',1,'basic_json']]], - ['skip_20list_20class_43',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], - ['skip_5fbom_44',['skip_bom',['../classdetail_1_1lexer.html#a04ae0c7807a761f4162ff42290be5490',1,'detail::lexer']]], - ['skip_5flist_45',['skip_list',['../classskip__list.html',1,'skip_list< T >'],['../classskip__list.html#a9319489b15a937d372a0233e130bb513',1,'skip_list::skip_list(int __MAX_LEVEL, float __PROB)'],['../classskip__list.html#a7b67f580f2c6ef6a7bfa2aa4dbc31274',1,'skip_list::skip_list(const skip_list &s)']]], - ['sobel_46',['sobel',['../namespacesobel.html',1,'']]], - ['sobel_47',['Sobel',['../namespacesobel.html#aa2488f093457d0888ef32838e50d446a',1,'sobel']]], - ['sobel_20function_20strong_20_3a_48',['<strong>Perform edge detection with Sobel() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md47',1,'']]], - ['sourcelineinfo_49',['SourceLineInfo',['../struct_catch_1_1_source_line_info.html',1,'Catch']]], - ['span_5finput_5fadapter_50',['span_input_adapter',['../classdetail_1_1span__input__adapter.html',1,'detail']]], - ['splay_20tree_20class_51',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], - ['splay_5ftree_52',['splay_tree',['../classsplay__tree.html',1,'splay_tree< T >'],['../classsplay__tree.html#a42c17e85ad2c1bacd934ca0ccc51e398',1,'splay_tree::splay_tree(std::vector< T > v={}) noexcept'],['../classsplay__tree.html#aa9a135c3d10e1e8b919b8d817d53f98a',1,'splay_tree::splay_tree(const splay_tree &s)']]], - ['square_53',['square',['../namespacesobel.html#a9e7825227070061cd265749d9cd22b53',1,'sobel']]], - ['stack_20class_54',['Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], - ['stack_5flist_55',['stack_list',['../classstack__list.html',1,'stack_list< T >'],['../classstack__list.html#a2e5e4063aeedaf398ff182e124e5fa3f',1,'stack_list::stack_list(std::vector< T > v={}) noexcept'],['../classstack__list.html#aa2fac43e1e6e4188ea37331d7c7db90a',1,'stack_list::stack_list(const stack_list &s)']]], - ['standards_56',['Our Standards',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md2',1,'']]], - ['start_5farray_57',['start_array',['../structjson__sax.html#afc4d5c0d123f2e3c939060a778c4f22c',1,'json_sax']]], - ['start_5fobject_58',['start_object',['../structjson__sax.html#a54a0883df64f40664395e3dad674aaa5',1,'json_sax']]], - ['startswithmatcher_59',['StartsWithMatcher',['../struct_catch_1_1_matchers_1_1_std_string_1_1_starts_with_matcher.html',1,'Catch::Matchers::StdString']]], - ['static_5fconst_60',['static_const',['../structdetail_1_1static__const.html',1,'detail']]], - ['store_61',['store',['../namespacedetail.html#a7c070b2bf3d61e3d8b8013f6fb18d592a8cd892b7b97ef9489ae4479d3f4ef0fc',1,'detail']]], - ['streamendstop_62',['StreamEndStop',['../struct_catch_1_1_stream_end_stop.html',1,'Catch']]], - ['strict_63',['strict',['../namespacedetail.html#abe7cfa1fd8fa706ff4392bff9d1a8298a2133fd717402a7966ee88d06f9e0b792',1,'detail']]], - ['string_64',['string',['../structjson__sax.html#a3da9ee0c61f1a37e6c6a3d2dccb16765',1,'json_sax::string()'],['../namespacedetail.html#a917c3efabea8a20dc72d9ae2c673d632ab45cffe084dd3d20d928bee85e7b0f21',1,'detail::string']]], - ['string_5fbuffer_65',['string_buffer',['../classdetail_1_1serializer.html#a27a61728ed0fbc65de009286531a6e70',1,'detail::serializer']]], - ['string_5ft_66',['string_t',['../classbasic__json.html#ac8c9cde32146e6c343e1960aefc11fba',1,'basic_json']]], - ['stringmaker_67',['StringMaker',['../struct_catch_1_1_string_maker.html',1,'Catch']]], - ['stringmaker_3c_20bool_20_3e_68',['StringMaker< bool >',['../struct_catch_1_1_string_maker_3_01bool_01_4.html',1,'Catch']]], - ['stringmaker_3c_20catch_3a_3adetail_3a_3aapprox_20_3e_69',['StringMaker< Catch::Detail::Approx >',['../struct_catch_1_1_string_maker_3_01_catch_1_1_detail_1_1_approx_01_4.html',1,'Catch']]], - ['stringmaker_3c_20char_20_2a_20_3e_70',['StringMaker< char * >',['../struct_catch_1_1_string_maker_3_01char_01_5_01_4.html',1,'Catch']]], - ['stringmaker_3c_20char_20_3e_71',['StringMaker< char >',['../struct_catch_1_1_string_maker_3_01char_01_4.html',1,'Catch']]], - ['stringmaker_3c_20char_20const_20_2a_20_3e_72',['StringMaker< char const * >',['../struct_catch_1_1_string_maker_3_01char_01const_01_5_01_4.html',1,'Catch']]], - ['stringmaker_3c_20char_5bsz_5d_3e_73',['StringMaker< char[SZ]>',['../struct_catch_1_1_string_maker_3_01char_0f_s_z_0e_4.html',1,'Catch']]], - ['stringmaker_3c_20double_20_3e_74',['StringMaker< double >',['../struct_catch_1_1_string_maker_3_01double_01_4.html',1,'Catch']]], - ['stringmaker_3c_20float_20_3e_75',['StringMaker< float >',['../struct_catch_1_1_string_maker_3_01float_01_4.html',1,'Catch']]], - ['stringmaker_3c_20int_20_3e_76',['StringMaker< int >',['../struct_catch_1_1_string_maker_3_01int_01_4.html',1,'Catch']]], - ['stringmaker_3c_20long_20_3e_77',['StringMaker< long >',['../struct_catch_1_1_string_maker_3_01long_01_4.html',1,'Catch']]], - ['stringmaker_3c_20long_20long_20_3e_78',['StringMaker< long long >',['../struct_catch_1_1_string_maker_3_01long_01long_01_4.html',1,'Catch']]], - ['stringmaker_3c_20r_20c_3a_3a_2a_20_3e_79',['StringMaker< R C::* >',['../struct_catch_1_1_string_maker_3_01_r_01_c_1_1_5_01_4.html',1,'Catch']]], - ['stringmaker_3c_20r_2c_20typename_20std_3a_3aenable_5fif_3c_20is_5frange_3c_20r_20_3e_3a_3avalue_20_26_26_21_3a_3acatch_3a_3adetail_3a_3aisstreaminsertable_3c_20r_20_3e_3a_3avalue_20_3e_3a_3atype_20_3e_80',['StringMaker< R, typename std::enable_if< is_range< R >::value &&!::Catch::Detail::IsStreamInsertable< R >::value >::type >',['../struct_catch_1_1_string_maker_3_01_r_00_01typename_01std_1_1enable__if_3_01is__range_3_01_r_01_4536d8fedfff6d62432b3dc59b56e1380.html',1,'Catch']]], - ['stringmaker_3c_20signed_20char_20_3e_81',['StringMaker< signed char >',['../struct_catch_1_1_string_maker_3_01signed_01char_01_4.html',1,'Catch']]], - ['stringmaker_3c_20signed_20char_5bsz_5d_3e_82',['StringMaker< signed char[SZ]>',['../struct_catch_1_1_string_maker_3_01signed_01char_0f_s_z_0e_4.html',1,'Catch']]], - ['stringmaker_3c_20std_3a_3anullptr_5ft_20_3e_83',['StringMaker< std::nullptr_t >',['../struct_catch_1_1_string_maker_3_01std_1_1nullptr__t_01_4.html',1,'Catch']]], - ['stringmaker_3c_20std_3a_3astring_20_3e_84',['StringMaker< std::string >',['../struct_catch_1_1_string_maker_3_01std_1_1string_01_4.html',1,'Catch']]], - ['stringmaker_3c_20std_3a_3awstring_20_3e_85',['StringMaker< std::wstring >',['../struct_catch_1_1_string_maker_3_01std_1_1wstring_01_4.html',1,'Catch']]], - ['stringmaker_3c_20t_20_2a_20_3e_86',['StringMaker< T * >',['../struct_catch_1_1_string_maker_3_01_t_01_5_01_4.html',1,'Catch']]], - ['stringmaker_3c_20t_5bsz_5d_3e_87',['StringMaker< T[SZ]>',['../struct_catch_1_1_string_maker_3_01_t_0f_s_z_0e_4.html',1,'Catch']]], - ['stringmaker_3c_20unsigned_20char_20_3e_88',['StringMaker< unsigned char >',['../struct_catch_1_1_string_maker_3_01unsigned_01char_01_4.html',1,'Catch']]], - ['stringmaker_3c_20unsigned_20char_5bsz_5d_3e_89',['StringMaker< unsigned char[SZ]>',['../struct_catch_1_1_string_maker_3_01unsigned_01char_0f_s_z_0e_4.html',1,'Catch']]], - ['stringmaker_3c_20unsigned_20int_20_3e_90',['StringMaker< unsigned int >',['../struct_catch_1_1_string_maker_3_01unsigned_01int_01_4.html',1,'Catch']]], - ['stringmaker_3c_20unsigned_20long_20_3e_91',['StringMaker< unsigned long >',['../struct_catch_1_1_string_maker_3_01unsigned_01long_01_4.html',1,'Catch']]], - ['stringmaker_3c_20unsigned_20long_20long_20_3e_92',['StringMaker< unsigned long long >',['../struct_catch_1_1_string_maker_3_01unsigned_01long_01long_01_4.html',1,'Catch']]], - ['stringmaker_3c_20wchar_5ft_20_2a_20_3e_93',['StringMaker< wchar_t * >',['../struct_catch_1_1_string_maker_3_01wchar__t_01_5_01_4.html',1,'Catch']]], - ['stringmaker_3c_20wchar_5ft_20const_20_2a_20_3e_94',['StringMaker< wchar_t const * >',['../struct_catch_1_1_string_maker_3_01wchar__t_01const_01_5_01_4.html',1,'Catch']]], - ['stringmatcherbase_95',['StringMatcherBase',['../struct_catch_1_1_matchers_1_1_std_string_1_1_string_matcher_base.html',1,'Catch::Matchers::StdString']]], - ['stringref_96',['StringRef',['../class_catch_1_1_string_ref.html',1,'Catch']]], - ['strong_20a_20href_20https_3a_20discord_20gg_20m9nyv4mhz6_20join_20a_20our_20discord_20strong_97',['<strong><a href="https://discord.gg/M9nYv4MHz6" >Join</a> our Discord</strong>',['../index.html#autotoc_md18',1,'']]], - ['strong_20back_20strong_20_3a_98',['<strong>back</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md99',1,'']]], - ['strong_20bfs_20strong_20_3a_99',['<strong>BFS</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md35',1,'']]], - ['strong_20bipartite_20strong_20_3a_100',['<strong>bipartite</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md39',1,'']]], - ['strong_20bridge_20strong_20_3a_101',['<strong>bridge</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md40',1,'']]], - ['strong_20connected_20strong_20_3a_102',['<strong>connected</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md44',1,'']]], - ['strong_20connected_5fcomponents_20strong_20_3a_103',['<strong>connected_components</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md36',1,'']]], - ['strong_20create_20an_20instance_20of_20dbscan_3a_20strong_20_3a_104',['<strong>Create an instance of DBSCAN:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md25',1,'']]], - ['strong_20create_20an_20instance_20of_20kmeans_3a_20strong_20_3a_105',['<strong>Create an instance of kmeans:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md30',1,'']]], - ['strong_20create_20an_20instance_20of_20the_20hash_5ftable_3a_20strong_20_3a_106',['<strong>Create an instance of the hash_table:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md104',1,'']]], - ['strong_20create_5ftree_20strong_20_3a_107',['<strong>create_tree</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html#autotoc_md50',1,'']]], - ['strong_20creating_20a_20new_20class_20strong_108',['<strong>Creating a new Class</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_n_t_r_i_b_u_t_e.html#autotoc_md14',1,'']]], - ['strong_20cycle_20strong_20_3a_109',['<strong>cycle</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md37',1,'']]], - ['strong_20decode_20strong_20_3a_110',['<strong>decode</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html#autotoc_md51',1,'']]], - ['strong_20dfs_20strong_20_3a_111',['<strong>DFS</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md34',1,'']]], - ['strong_20elements_20strong_20_3a_112',['Strong elements strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md61',1,'<strong>elements</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md70',1,'<strong>elements</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md87',1,'<strong>elements</strong>:']]], - ['strong_20empty_20strong_113',['<strong>empty</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md79',1,'']]], - ['strong_20erase_20strong_20_3a_114',['Strong erase strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md58',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md67',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md78',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md84',1,'<strong>erase</strong>:']]], - ['strong_20fixing_20a_20bug_20strong_115',['<strong>Fixing a bug</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_n_t_r_i_b_u_t_e.html#autotoc_md15',1,'']]], - ['strong_20front_20strong_20_3a_116',['<strong>front</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md98',1,'']]], - ['strong_20get_20assignments_20and_20cluster_20centers_3a_20strong_20_3a_117',['<strong>Get assignments and cluster centers:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md31',1,'']]], - ['strong_20get_20assignments_20with_20dbscan_20clustering_3a_20strong_20_3a_118',['<strong>Get assignments with DBSCAN clustering:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md26',1,'']]], - ['strong_20get_20coefficients_20strong_119',['<strong>Get coefficients</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md118',1,'']]], - ['strong_20get_20noise_20with_20dbscan_20clustering_3a_20strong_20_3a_120',['<strong>Get noise with DBSCAN clustering:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md27',1,'']]], - ['strong_20get_20results_20from_20linear_20regression_20i_20e_20get_20a_20and_20b_20of_20y_20_3a_20strong_121',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md115',1,'']]], - ['strong_20get_5ffrequency_20strong_20_3a_122',['<strong>get_frequency</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md77',1,'']]], - ['strong_20how_20to_20perform_20the_20masking_20using_20apply_5fmedian_5ffilter_20function_20strong_20_3a_123',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md53',1,'']]], - ['strong_20how_20to_20run_20test_20cases_20strong_124',['<strong>How to run test cases</strong>',['../index.html#autotoc_md21',1,'']]], - ['strong_20inorder_20strong_20_3a_125',['Strong inorder strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md124',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md133',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md143',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md152',1,'<strong>inorder</strong>:']]], - ['strong_20insert_20strong_20_3a_126',['Strong insert strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md91',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md105',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md121',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md130',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md139',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md149',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md158',1,'<strong>insert</strong>:']]], - ['strong_20iterator_20strong_127',['<strong>Iterator</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md80',1,'']]], - ['strong_20iterator_20strong_20_3a_128',['Strong iterator strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md94',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md102',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md108',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md113',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md128',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md136',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md147',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md155',1,'<strong>iterator</strong>:']]], - ['strong_20iterators_20strong_20_3a_129',['Strong iterators strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md62',1,'<strong>iterators</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md71',1,'<strong>iterators</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md88',1,'<strong>iterators</strong>:']]], - ['strong_20optionally_20for_20visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_130',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['strong_20optionally_20for_20visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_131',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], - ['strong_20optionally_20you_20can_20use_20python_20s_20matplotlib_20for_20visualization_20purposes_3a_20strong_132',['Strong Optionally you can use python s matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md116',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md119',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], - ['strong_20our_20contributors_20strong_133',['<strong>Our contributors</strong>',['../index.html#autotoc_md22',1,'']]], - ['strong_20overlap_20strong_20_3a_134',['<strong>overlap</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md142',1,'']]], - ['strong_20perform_20edge_20detection_20with_20sobel_20function_20strong_20_3a_135',['<strong>Perform edge detection with Sobel() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md47',1,'']]], - ['strong_20pop_20strong_20_3a_136',['<strong>pop</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md112',1,'']]], - ['strong_20pop_5fback_20strong_20_3a_137',['<strong>pop_back</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md101',1,'']]], - ['strong_20pop_5ffront_20strong_20_3a_138',['<strong>pop_front</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md100',1,'']]], - ['strong_20postorder_20strong_20_3a_139',['Strong postorder strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md126',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md135',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md145',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md154',1,'<strong>postorder</strong>:']]], - ['strong_20preorder_20strong_20_3a_140',['Strong preorder strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md125',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md134',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md144',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md153',1,'<strong>preorder</strong>:']]], - ['strong_20prim_20strong_20_3a_141',['<strong>prim</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md43',1,'']]], - ['strong_20push_20strong_20_3a_142',['<strong>push</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md110',1,'']]], - ['strong_20push_5fback_20strong_20_3a_143',['Strong push_back strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md56',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md65',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md74',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md82',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md96',1,'<strong>push_back</strong>:']]], - ['strong_20push_5ffront_20strong_20_3a_144',['Strong push_front strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md57',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md66',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md75',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md83',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md97',1,'<strong>push_front</strong>:']]], - ['strong_20remove_20strong_20_3a_145',['Strong remove strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md92',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md107',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md122',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md131',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md141',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md150',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md160',1,'<strong>remove</strong>:']]], - ['strong_20retrieve_20strong_20_3a_146',['<strong>retrieve</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md106',1,'']]], - ['strong_20reverse_20strong_20_3a_147',['Strong reverse strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md60',1,'<strong>reverse</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md69',1,'<strong>reverse</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md86',1,'<strong>reverse</strong>:']]], - ['strong_20search_20strong_20_3a_148',['Strong search strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md59',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md68',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md76',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md85',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md93',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md123',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md132',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md140',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md151',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md159',1,'<strong>search</strong>:']]], - ['strong_20see_20the_20full_20documentation_20a_20href_20https_3a_20csrt_20ntua_20github_20io_20algoplus_20here_20a_20strong_149',['<strong>See the full documentation <a href="https://csrt-ntua.github.io/AlgoPlus/" >here</a></strong>',['../index.html#autotoc_md17',1,'']]], - ['strong_20shortest_5fpath_20strong_20_3a_150',['<strong>shortest_path</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md42',1,'']]], - ['strong_20top_20strong_20_3a_151',['<strong>top</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md111',1,'']]], - ['strong_20topological_5fsort_20strong_20_3a_152',['Strong topological_sort strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md38',1,'<strong>topological_sort</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md45',1,'<strong>topological_sort</strong>:']]], - ['strong_20visualize_20strong_20_3a_153',['Strong visualize strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md41',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md63',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md72',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md89',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md127',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md137',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md146',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md156',1,'<strong>visualize</strong>:']]], - ['strong_20visualize_20your_20results_20strong_20_3a_154',['Strong Visualize your results strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md48',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md54',1,'<strong>Visualize your results</strong>:']]], - ['sub_155',['sub',['../class_image.html#ae998c80337bc8941c914e5209df97bb3',1,'Image::sub(std::vector< std::vector< int32_t > > &img2) const'],['../class_image.html#a2f4635f1d0e7d8a11e7d4d10db18ed6c',1,'Image::sub(Image img2) const'],['../structdetail_1_1dtoa__impl_1_1diyfp.html#a75142bace0b78b1e1433b1d35a7ff252',1,'detail::dtoa_impl::diyfp::sub()']]], - ['subtype_156',['subtype',['../classbyte__container__with__subtype.html#a678460360dd494c33fbfde782e7c8201',1,'byte_container_with_subtype']]], - ['swap_157',['swap',['../classbasic__json.html#a1a94e5348ebb34852092d51a44e21d24',1,'basic_json::swap(reference other) noexcept(std::is_nothrow_move_constructible< value_t >::value &&std::is_nothrow_move_assignable< value_t >::value &&std::is_nothrow_move_constructible< json_value >::value &&//NOLINT(cppcoreguidelines-noexcept-swap, performance-noexcept-swap) std::is_nothrow_move_assignable< json_value >::value)'],['../classbasic__json.html#a44c98b48b8a0b5e53087776fbb63961f',1,'basic_json::swap'],['../classbasic__json.html#ac1e32c91d5e641c25c52486341f5a9db',1,'basic_json::swap(array_t &other)'],['../classbasic__json.html#abc9ea6dec87e254de172c2bfeaeef7df',1,'basic_json::swap(object_t &other)'],['../classbasic__json.html#aeac8816c033c659ef8b43a5f03d5f553',1,'basic_json::swap(string_t &other)'],['../classbasic__json.html#a3624e1bbc880bd196e3fa4a220554755',1,'basic_json::swap(binary_t &other)'],['../classbasic__json.html#aa987625005046c81e7748dca1e84a0e3',1,'basic_json::swap(typename binary_t::container_type &other)']]] + ['sharpening_20filter_20namespace_34',['Mini tutorial for sharpening filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html',1,'']]], + ['sharpening_5ffilter_35',['sharpening_filter',['../namespacesharpening__filter.html',1,'']]], + ['shortest_5fpath_36',['shortest_path',['../classweighted__graph.html#a45b5f6269cf710025139eac881c9d9cb',1,'weighted_graph::shortest_path()'],['../class_a_star.html#a9df141efce063eaea654040eeedac9ed',1,'AStar::shortest_path()']]], + ['shortest_5fpath_20strong_20_3a_37',['<strong>shortest_path</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md43',1,'']]], + ['should_20i_20comment_20my_20code_38',['How should i comment my code?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_m_m_e_n_t_s.html',1,'']]], + ['showdurations_39',['ShowDurations',['../struct_catch_1_1_show_durations.html',1,'Catch']]], + ['simplepcg32_40',['SimplePcg32',['../class_catch_1_1_simple_pcg32.html',1,'Catch']]], + ['single_20linked_20list_20class_41',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], + ['singlevaluegenerator_42',['SingleValueGenerator',['../class_catch_1_1_generators_1_1_single_value_generator.html',1,'Catch::Generators']]], + ['size_43',['size',['../classdsu.html#a104ab7f0c4d8ac6e3acd61d79647e04a',1,'dsu::size()'],['../classgraph.html#ad3abf678df30b6091870278e1ffadfe7',1,'graph::size()'],['../classweighted__graph.html#ad835cebb7cd2d06e05faaad1c61b0e50',1,'weighted_graph::size()'],['../classcircular__linked__list.html#ae0e6f2aa4f4b5433fe3829ee99aca74a',1,'circular_linked_list::size()'],['../classdoubly__linked__list.html#a8b82160daf391c5fdca95c2b3e6af353',1,'doubly_linked_list::size()'],['../classlinked__list.html#aa54b9549d40d9c23c8e22983198e0f73',1,'linked_list::size()'],['../classdequeue__list.html#a2dbc5348a3048ad420e11aa077bf77a5',1,'dequeue_list::size()'],['../classstack__list.html#a2d39d7c7cd615ad374b06c15d20fdb21',1,'stack_list::size()'],['../classavl__tree.html#aab0ba446f1ee02bd5c6be467e1645ab2',1,'avl_tree::size()'],['../classbst.html#a8a04b4ab8c11fe64c9a3f282aa6eb187',1,'bst::size()'],['../classinterval__tree.html#ab91c1aba599b826ab6dbfae678fadb10',1,'interval_tree::size()'],['../classsplay__tree.html#aea0b17cab8207f3162e02835259100c6',1,'splay_tree::size()'],['../classtrie.html#a23992f5354b529ac51761730b7d19cd6',1,'trie::size()'],['../class_mat1d.html#a8d25301a4c262e57cec4ad88ea381de9',1,'Mat1d::size()'],['../class_mat2d.html#aab97c9be6c1f663322342a62cd0d5cd2',1,'Mat2d::size()'],['../classbasic__json.html#a086cbfd1ad4ba83a8127c87467a92f47',1,'basic_json::size() const noexcept']]], + ['size_5ftype_44',['size_type',['../classbasic__json.html#a2c086af43cf06b1b7118f5351cab3ec9',1,'basic_json']]], + ['skip_20list_20class_45',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], + ['skip_5fbom_46',['skip_bom',['../classdetail_1_1lexer.html#a04ae0c7807a761f4162ff42290be5490',1,'detail::lexer']]], + ['skip_5flist_47',['skip_list',['../classskip__list.html',1,'skip_list< T >'],['../classskip__list.html#a9319489b15a937d372a0233e130bb513',1,'skip_list::skip_list(int __MAX_LEVEL, float __PROB)'],['../classskip__list.html#a7b67f580f2c6ef6a7bfa2aa4dbc31274',1,'skip_list::skip_list(const skip_list &s)']]], + ['sobel_48',['sobel',['../namespacesobel.html',1,'']]], + ['sobel_49',['Sobel',['../namespacesobel.html#aa2488f093457d0888ef32838e50d446a',1,'sobel']]], + ['sobel_20function_20strong_20_3a_50',['<strong>Perform edge detection with Sobel() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md48',1,'']]], + ['sourcelineinfo_51',['SourceLineInfo',['../struct_catch_1_1_source_line_info.html',1,'Catch']]], + ['span_5finput_5fadapter_52',['span_input_adapter',['../classdetail_1_1span__input__adapter.html',1,'detail']]], + ['splay_20tree_20class_53',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], + ['splay_5ftree_54',['splay_tree',['../classsplay__tree.html',1,'splay_tree< T >'],['../classsplay__tree.html#a42c17e85ad2c1bacd934ca0ccc51e398',1,'splay_tree::splay_tree(std::vector< T > v={}) noexcept'],['../classsplay__tree.html#aa9a135c3d10e1e8b919b8d817d53f98a',1,'splay_tree::splay_tree(const splay_tree &s)']]], + ['square_55',['square',['../namespacesobel.html#a9e7825227070061cd265749d9cd22b53',1,'sobel']]], + ['stack_20class_56',['Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], + ['stack_5flist_57',['stack_list',['../classstack__list.html',1,'stack_list< T >'],['../classstack__list.html#a2e5e4063aeedaf398ff182e124e5fa3f',1,'stack_list::stack_list(std::vector< T > v={}) noexcept'],['../classstack__list.html#aa2fac43e1e6e4188ea37331d7c7db90a',1,'stack_list::stack_list(const stack_list &s)']]], + ['standards_58',['Our Standards',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md2',1,'']]], + ['star_20history_59',['Star History',['../index.html#autotoc_md24',1,'']]], + ['start_5farray_60',['start_array',['../structjson__sax.html#afc4d5c0d123f2e3c939060a778c4f22c',1,'json_sax']]], + ['start_5fobject_61',['start_object',['../structjson__sax.html#a54a0883df64f40664395e3dad674aaa5',1,'json_sax']]], + ['startswithmatcher_62',['StartsWithMatcher',['../struct_catch_1_1_matchers_1_1_std_string_1_1_starts_with_matcher.html',1,'Catch::Matchers::StdString']]], + ['static_5fconst_63',['static_const',['../structdetail_1_1static__const.html',1,'detail']]], + ['store_64',['store',['../namespacedetail.html#a7c070b2bf3d61e3d8b8013f6fb18d592a8cd892b7b97ef9489ae4479d3f4ef0fc',1,'detail']]], + ['streamendstop_65',['StreamEndStop',['../struct_catch_1_1_stream_end_stop.html',1,'Catch']]], + ['strict_66',['strict',['../namespacedetail.html#abe7cfa1fd8fa706ff4392bff9d1a8298a2133fd717402a7966ee88d06f9e0b792',1,'detail']]], + ['string_67',['string',['../structjson__sax.html#a3da9ee0c61f1a37e6c6a3d2dccb16765',1,'json_sax::string()'],['../namespacedetail.html#a917c3efabea8a20dc72d9ae2c673d632ab45cffe084dd3d20d928bee85e7b0f21',1,'detail::string']]], + ['string_5fbuffer_68',['string_buffer',['../classdetail_1_1serializer.html#a27a61728ed0fbc65de009286531a6e70',1,'detail::serializer']]], + ['string_5ft_69',['string_t',['../classbasic__json.html#ac8c9cde32146e6c343e1960aefc11fba',1,'basic_json']]], + ['stringmaker_70',['StringMaker',['../struct_catch_1_1_string_maker.html',1,'Catch']]], + ['stringmaker_3c_20bool_20_3e_71',['StringMaker< bool >',['../struct_catch_1_1_string_maker_3_01bool_01_4.html',1,'Catch']]], + ['stringmaker_3c_20catch_3a_3adetail_3a_3aapprox_20_3e_72',['StringMaker< Catch::Detail::Approx >',['../struct_catch_1_1_string_maker_3_01_catch_1_1_detail_1_1_approx_01_4.html',1,'Catch']]], + ['stringmaker_3c_20char_20_2a_20_3e_73',['StringMaker< char * >',['../struct_catch_1_1_string_maker_3_01char_01_5_01_4.html',1,'Catch']]], + ['stringmaker_3c_20char_20_3e_74',['StringMaker< char >',['../struct_catch_1_1_string_maker_3_01char_01_4.html',1,'Catch']]], + ['stringmaker_3c_20char_20const_20_2a_20_3e_75',['StringMaker< char const * >',['../struct_catch_1_1_string_maker_3_01char_01const_01_5_01_4.html',1,'Catch']]], + ['stringmaker_3c_20char_5bsz_5d_3e_76',['StringMaker< char[SZ]>',['../struct_catch_1_1_string_maker_3_01char_0f_s_z_0e_4.html',1,'Catch']]], + ['stringmaker_3c_20double_20_3e_77',['StringMaker< double >',['../struct_catch_1_1_string_maker_3_01double_01_4.html',1,'Catch']]], + ['stringmaker_3c_20float_20_3e_78',['StringMaker< float >',['../struct_catch_1_1_string_maker_3_01float_01_4.html',1,'Catch']]], + ['stringmaker_3c_20int_20_3e_79',['StringMaker< int >',['../struct_catch_1_1_string_maker_3_01int_01_4.html',1,'Catch']]], + ['stringmaker_3c_20long_20_3e_80',['StringMaker< long >',['../struct_catch_1_1_string_maker_3_01long_01_4.html',1,'Catch']]], + ['stringmaker_3c_20long_20long_20_3e_81',['StringMaker< long long >',['../struct_catch_1_1_string_maker_3_01long_01long_01_4.html',1,'Catch']]], + ['stringmaker_3c_20r_20c_3a_3a_2a_20_3e_82',['StringMaker< R C::* >',['../struct_catch_1_1_string_maker_3_01_r_01_c_1_1_5_01_4.html',1,'Catch']]], + ['stringmaker_3c_20r_2c_20typename_20std_3a_3aenable_5fif_3c_20is_5frange_3c_20r_20_3e_3a_3avalue_20_26_26_21_3a_3acatch_3a_3adetail_3a_3aisstreaminsertable_3c_20r_20_3e_3a_3avalue_20_3e_3a_3atype_20_3e_83',['StringMaker< R, typename std::enable_if< is_range< R >::value &&!::Catch::Detail::IsStreamInsertable< R >::value >::type >',['../struct_catch_1_1_string_maker_3_01_r_00_01typename_01std_1_1enable__if_3_01is__range_3_01_r_01_4536d8fedfff6d62432b3dc59b56e1380.html',1,'Catch']]], + ['stringmaker_3c_20signed_20char_20_3e_84',['StringMaker< signed char >',['../struct_catch_1_1_string_maker_3_01signed_01char_01_4.html',1,'Catch']]], + ['stringmaker_3c_20signed_20char_5bsz_5d_3e_85',['StringMaker< signed char[SZ]>',['../struct_catch_1_1_string_maker_3_01signed_01char_0f_s_z_0e_4.html',1,'Catch']]], + ['stringmaker_3c_20std_3a_3anullptr_5ft_20_3e_86',['StringMaker< std::nullptr_t >',['../struct_catch_1_1_string_maker_3_01std_1_1nullptr__t_01_4.html',1,'Catch']]], + ['stringmaker_3c_20std_3a_3astring_20_3e_87',['StringMaker< std::string >',['../struct_catch_1_1_string_maker_3_01std_1_1string_01_4.html',1,'Catch']]], + ['stringmaker_3c_20std_3a_3awstring_20_3e_88',['StringMaker< std::wstring >',['../struct_catch_1_1_string_maker_3_01std_1_1wstring_01_4.html',1,'Catch']]], + ['stringmaker_3c_20t_20_2a_20_3e_89',['StringMaker< T * >',['../struct_catch_1_1_string_maker_3_01_t_01_5_01_4.html',1,'Catch']]], + ['stringmaker_3c_20t_5bsz_5d_3e_90',['StringMaker< T[SZ]>',['../struct_catch_1_1_string_maker_3_01_t_0f_s_z_0e_4.html',1,'Catch']]], + ['stringmaker_3c_20unsigned_20char_20_3e_91',['StringMaker< unsigned char >',['../struct_catch_1_1_string_maker_3_01unsigned_01char_01_4.html',1,'Catch']]], + ['stringmaker_3c_20unsigned_20char_5bsz_5d_3e_92',['StringMaker< unsigned char[SZ]>',['../struct_catch_1_1_string_maker_3_01unsigned_01char_0f_s_z_0e_4.html',1,'Catch']]], + ['stringmaker_3c_20unsigned_20int_20_3e_93',['StringMaker< unsigned int >',['../struct_catch_1_1_string_maker_3_01unsigned_01int_01_4.html',1,'Catch']]], + ['stringmaker_3c_20unsigned_20long_20_3e_94',['StringMaker< unsigned long >',['../struct_catch_1_1_string_maker_3_01unsigned_01long_01_4.html',1,'Catch']]], + ['stringmaker_3c_20unsigned_20long_20long_20_3e_95',['StringMaker< unsigned long long >',['../struct_catch_1_1_string_maker_3_01unsigned_01long_01long_01_4.html',1,'Catch']]], + ['stringmaker_3c_20wchar_5ft_20_2a_20_3e_96',['StringMaker< wchar_t * >',['../struct_catch_1_1_string_maker_3_01wchar__t_01_5_01_4.html',1,'Catch']]], + ['stringmaker_3c_20wchar_5ft_20const_20_2a_20_3e_97',['StringMaker< wchar_t const * >',['../struct_catch_1_1_string_maker_3_01wchar__t_01const_01_5_01_4.html',1,'Catch']]], + ['stringmatcherbase_98',['StringMatcherBase',['../struct_catch_1_1_matchers_1_1_std_string_1_1_string_matcher_base.html',1,'Catch::Matchers::StdString']]], + ['stringref_99',['StringRef',['../class_catch_1_1_string_ref.html',1,'Catch']]], + ['strong_20a_20href_20https_3a_20discord_20gg_20m9nyv4mhz6_20join_20a_20our_20discord_20strong_100',['<strong><a href="https://discord.gg/M9nYv4MHz6" >Join</a> our Discord</strong>',['../index.html#autotoc_md18',1,'']]], + ['strong_20back_20strong_20_3a_101',['<strong>back</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md103',1,'']]], + ['strong_20bfs_20strong_20_3a_102',['<strong>BFS</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md36',1,'']]], + ['strong_20bipartite_20strong_20_3a_103',['<strong>bipartite</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md40',1,'']]], + ['strong_20bridge_20strong_20_3a_104',['<strong>bridge</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md41',1,'']]], + ['strong_20connected_20strong_20_3a_105',['<strong>connected</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md45',1,'']]], + ['strong_20connected_5fcomponents_20strong_20_3a_106',['<strong>connected_components</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md37',1,'']]], + ['strong_20create_20an_20instance_20of_20dbscan_3a_20strong_20_3a_107',['<strong>Create an instance of DBSCAN:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md26',1,'']]], + ['strong_20create_20an_20instance_20of_20kmeans_3a_20strong_20_3a_108',['<strong>Create an instance of kmeans:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md31',1,'']]], + ['strong_20create_20an_20instance_20of_20the_20hash_5ftable_3a_20strong_20_3a_109',['<strong>Create an instance of the hash_table:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md108',1,'']]], + ['strong_20create_5ftree_20strong_20_3a_110',['<strong>create_tree</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html#autotoc_md51',1,'']]], + ['strong_20creating_20a_20new_20class_20strong_111',['<strong>Creating a new Class</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_n_t_r_i_b_u_t_e.html#autotoc_md14',1,'']]], + ['strong_20cycle_20strong_20_3a_112',['<strong>cycle</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md38',1,'']]], + ['strong_20decode_20strong_20_3a_113',['<strong>decode</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html#autotoc_md52',1,'']]], + ['strong_20dfs_20strong_20_3a_114',['<strong>DFS</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md35',1,'']]], + ['strong_20elements_20strong_20_3a_115',['Strong elements strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md65',1,'<strong>elements</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md74',1,'<strong>elements</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md91',1,'<strong>elements</strong>:']]], + ['strong_20empty_20strong_116',['<strong>empty</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md83',1,'']]], + ['strong_20erase_20strong_20_3a_117',['Strong erase strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md62',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md71',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md82',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md88',1,'<strong>erase</strong>:']]], + ['strong_20fixing_20a_20bug_20strong_118',['<strong>Fixing a bug</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_n_t_r_i_b_u_t_e.html#autotoc_md15',1,'']]], + ['strong_20front_20strong_20_3a_119',['<strong>front</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md102',1,'']]], + ['strong_20get_20assignments_20and_20cluster_20centers_3a_20strong_20_3a_120',['<strong>Get assignments and cluster centers:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], + ['strong_20get_20assignments_20with_20dbscan_20clustering_3a_20strong_20_3a_121',['<strong>Get assignments with DBSCAN clustering:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md27',1,'']]], + ['strong_20get_20coefficients_20strong_122',['<strong>Get coefficients</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md122',1,'']]], + ['strong_20get_20noise_20with_20dbscan_20clustering_3a_20strong_20_3a_123',['<strong>Get noise with DBSCAN clustering:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], + ['strong_20get_20results_20from_20linear_20regression_20i_20e_20get_20a_20and_20b_20of_20y_20_3a_20strong_124',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md119',1,'']]], + ['strong_20get_5ffrequency_20strong_20_3a_125',['<strong>get_frequency</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md81',1,'']]], + ['strong_20how_20to_20perform_20the_20masking_20using_20apply_5fmedian_5ffilter_20function_20strong_20_3a_126',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md54',1,'']]], + ['strong_20how_20to_20perform_20the_20masking_20using_20apply_5fsharpening_5ffilter_20function_20strong_20_3a_127',['<strong>How to perform the masking using apply_sharpening_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html#autotoc_md57',1,'']]], + ['strong_20how_20to_20run_20test_20cases_20strong_128',['<strong>How to run test cases</strong>',['../index.html#autotoc_md21',1,'']]], + ['strong_20inorder_20strong_20_3a_129',['Strong inorder strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md128',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md137',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md147',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md156',1,'<strong>inorder</strong>:']]], + ['strong_20insert_20strong_20_3a_130',['Strong insert strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md95',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md109',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md125',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md134',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md143',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md153',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md162',1,'<strong>insert</strong>:']]], + ['strong_20iterator_20strong_131',['<strong>Iterator</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md84',1,'']]], + ['strong_20iterator_20strong_20_3a_132',['Strong iterator strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md98',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md106',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md112',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md117',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md132',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md140',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md151',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md159',1,'<strong>iterator</strong>:']]], + ['strong_20iterators_20strong_20_3a_133',['Strong iterators strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md66',1,'<strong>iterators</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md75',1,'<strong>iterators</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md92',1,'<strong>iterators</strong>:']]], + ['strong_20optionally_20for_20visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_134',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['strong_20optionally_20for_20visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_135',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], + ['strong_20optionally_20you_20can_20use_20python_20s_20matplotlib_20for_20visualization_20purposes_3a_20strong_136',['Strong Optionally you can use python s matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md120',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md123',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], + ['strong_20our_20contributors_20strong_137',['<strong>Our contributors</strong>',['../index.html#autotoc_md22',1,'']]], + ['strong_20overlap_20strong_20_3a_138',['<strong>overlap</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md146',1,'']]], + ['strong_20perform_20edge_20detection_20with_20sobel_20function_20strong_20_3a_139',['<strong>Perform edge detection with Sobel() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md48',1,'']]], + ['strong_20pop_20strong_20_3a_140',['<strong>pop</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md116',1,'']]], + ['strong_20pop_5fback_20strong_20_3a_141',['<strong>pop_back</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md105',1,'']]], + ['strong_20pop_5ffront_20strong_20_3a_142',['<strong>pop_front</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md104',1,'']]], + ['strong_20postorder_20strong_20_3a_143',['Strong postorder strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md130',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md139',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md149',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md158',1,'<strong>postorder</strong>:']]], + ['strong_20preorder_20strong_20_3a_144',['Strong preorder strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md129',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md138',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md148',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md157',1,'<strong>preorder</strong>:']]], + ['strong_20prim_20strong_20_3a_145',['<strong>prim</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md44',1,'']]], + ['strong_20push_20strong_20_3a_146',['<strong>push</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md114',1,'']]], + ['strong_20push_5fback_20strong_20_3a_147',['Strong push_back strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md60',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md69',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md78',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md86',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md100',1,'<strong>push_back</strong>:']]], + ['strong_20push_5ffront_20strong_20_3a_148',['Strong push_front strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md61',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md70',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md79',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md87',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md101',1,'<strong>push_front</strong>:']]], + ['strong_20remove_20strong_20_3a_149',['Strong remove strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md96',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md111',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md126',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md135',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md145',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md154',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md164',1,'<strong>remove</strong>:']]], + ['strong_20retrieve_20strong_20_3a_150',['<strong>retrieve</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md110',1,'']]], + ['strong_20reverse_20strong_20_3a_151',['Strong reverse strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md64',1,'<strong>reverse</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md73',1,'<strong>reverse</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md90',1,'<strong>reverse</strong>:']]], + ['strong_20search_20strong_20_3a_152',['Strong search strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md63',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md72',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md80',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md89',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md97',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md127',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md136',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md144',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md155',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md163',1,'<strong>search</strong>:']]], + ['strong_20see_20the_20full_20documentation_20a_20href_20https_3a_20csrt_20ntua_20github_20io_20algoplus_20here_20a_20strong_153',['<strong>See the full documentation <a href="https://csrt-ntua.github.io/AlgoPlus/" >here</a></strong>',['../index.html#autotoc_md17',1,'']]], + ['strong_20shortest_5fpath_20strong_20_3a_154',['<strong>shortest_path</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md43',1,'']]], + ['strong_20top_20strong_20_3a_155',['<strong>top</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md115',1,'']]], + ['strong_20topological_5fsort_20strong_20_3a_156',['Strong topological_sort strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md39',1,'<strong>topological_sort</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md46',1,'<strong>topological_sort</strong>:']]], + ['strong_20visualize_20strong_20_3a_157',['Strong visualize strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md42',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md67',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md76',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md93',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md131',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md141',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md150',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md160',1,'<strong>visualize</strong>:']]], + ['strong_20visualize_20your_20results_20strong_20_3a_158',['Strong Visualize your results strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md49',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md55',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html#autotoc_md58',1,'<strong>Visualize your results</strong>:']]], + ['sub_159',['sub',['../class_image.html#ae998c80337bc8941c914e5209df97bb3',1,'Image::sub(std::vector< std::vector< int32_t > > &img2) const'],['../class_image.html#a2f4635f1d0e7d8a11e7d4d10db18ed6c',1,'Image::sub(Image img2) const'],['../structdetail_1_1dtoa__impl_1_1diyfp.html#a75142bace0b78b1e1433b1d35a7ff252',1,'detail::dtoa_impl::diyfp::sub()']]], + ['subtype_160',['subtype',['../classbyte__container__with__subtype.html#a678460360dd494c33fbfde782e7c8201',1,'byte_container_with_subtype']]], + ['swap_161',['swap',['../classbasic__json.html#a1a94e5348ebb34852092d51a44e21d24',1,'basic_json::swap(reference other) noexcept(std::is_nothrow_move_constructible< value_t >::value &&std::is_nothrow_move_assignable< value_t >::value &&std::is_nothrow_move_constructible< json_value >::value &&//NOLINT(cppcoreguidelines-noexcept-swap, performance-noexcept-swap) std::is_nothrow_move_assignable< json_value >::value)'],['../classbasic__json.html#a44c98b48b8a0b5e53087776fbb63961f',1,'basic_json::swap'],['../classbasic__json.html#ac1e32c91d5e641c25c52486341f5a9db',1,'basic_json::swap(array_t &other)'],['../classbasic__json.html#abc9ea6dec87e254de172c2bfeaeef7df',1,'basic_json::swap(object_t &other)'],['../classbasic__json.html#aeac8816c033c659ef8b43a5f03d5f553',1,'basic_json::swap(string_t &other)'],['../classbasic__json.html#a3624e1bbc880bd196e3fa4a220554755',1,'basic_json::swap(binary_t &other)'],['../classbasic__json.html#aa987625005046c81e7748dca1e84a0e3',1,'basic_json::swap(typename binary_t::container_type &other)']]] ]; diff --git a/docs/html/search/all_18.js b/docs/html/search/all_18.js index 6b225593..73d9b6df 100644 --- a/docs/html/search/all_18.js +++ b/docs/html/search/all_18.js @@ -14,70 +14,73 @@ var searchData= ['the_20full_20documentation_20a_20href_20https_3a_20csrt_20ntua_20github_20io_20algoplus_20here_20a_20strong_11',['<strong>See the full documentation <a href="https://csrt-ntua.github.io/AlgoPlus/" >here</a></strong>',['../index.html#autotoc_md17',1,'']]], ['the_20graph_20class_12',['Mini Tutorial for the Graph class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html',1,'']]], ['the_20hash_5ftable_20class_13',['Mini Tutorial for the hash_table class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html',1,'']]], - ['the_20hash_5ftable_3a_20strong_20_3a_14',['<strong>Create an instance of the hash_table:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md104',1,'']]], + ['the_20hash_5ftable_3a_20strong_20_3a_14',['<strong>Create an instance of the hash_table:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md108',1,'']]], ['the_20interval_20tree_20class_15',['Mini Tutorial for the Interval Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html',1,'']]], - ['the_20masking_20using_20apply_5fmedian_5ffilter_20function_20strong_20_3a_16',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md53',1,'']]], - ['the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_17',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['the_20skip_20list_20class_18',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], - ['the_20splay_20tree_20class_19',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], - ['the_20stack_20class_20',['the Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], - ['the_20trie_20class_21',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]], - ['then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_22',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_23',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], - ['thousands_5fsep_24',['thousands_sep',['../classdetail_1_1serializer.html#a5b75b99511362e4e5d011c8a961e96bb',1,'detail::serializer']]], - ['timer_25',['Timer',['../class_catch_1_1_timer.html',1,'Catch']]], - ['to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_26',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_27',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], - ['to_20contribute_28',['How to contribute',['../index.html#autotoc_md23',1,'']]], - ['to_20contribute_29',['How to contribute?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_n_t_r_i_b_u_t_e.html',1,'']]], - ['to_20perform_20the_20masking_20using_20apply_5fmedian_5ffilter_20function_20strong_20_3a_30',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md53',1,'']]], - ['to_20run_20test_20cases_20strong_31',['<strong>How to run test cases</strong>',['../index.html#autotoc_md21',1,'']]], - ['to_5fbjdata_32',['to_bjdata',['../classbasic__json.html#a0912e7738f47e604ac96fe8cdde1a96e',1,'basic_json::to_bjdata(const basic_json &j, const bool use_size=false, const bool use_type=false)'],['../classbasic__json.html#a2736658c256401394059599f97139ee9',1,'basic_json::to_bjdata(const basic_json &j, detail::output_adapter< std::uint8_t > o, const bool use_size=false, const bool use_type=false)'],['../classbasic__json.html#a1fa9828fcbe4e33c9a036834564f7dbd',1,'basic_json::to_bjdata(const basic_json &j, detail::output_adapter< char > o, const bool use_size=false, const bool use_type=false)']]], - ['to_5fbson_33',['to_bson',['../classbasic__json.html#a4ea6478022ab79b47216fda4b53ae1d4',1,'basic_json::to_bson(const basic_json &j)'],['../classbasic__json.html#afd718b745034da1f4eea4c69f45cebda',1,'basic_json::to_bson(const basic_json &j, detail::output_adapter< std::uint8_t > o)'],['../classbasic__json.html#a71794547dde3dd67e444aa45131ca861',1,'basic_json::to_bson(const basic_json &j, detail::output_adapter< char > o)']]], - ['to_5fcbor_34',['to_cbor',['../classbasic__json.html#a7c47280dbbb39288384058b771f8eec6',1,'basic_json::to_cbor(const basic_json &j)'],['../classbasic__json.html#a706ccab0e47bd75cd36911db84451cd1',1,'basic_json::to_cbor(const basic_json &j, detail::output_adapter< std::uint8_t > o)'],['../classbasic__json.html#af31f5ee23264fb21bd31e16bc27adab2',1,'basic_json::to_cbor(const basic_json &j, detail::output_adapter< char > o)']]], - ['to_5fchars_35',['to_chars',['../namespacedetail.html#a3f0588f1a546b169113e6e1e293168f4',1,'detail']]], - ['to_5fjson_36',['to_json',['../structadl__serializer.html#a0216149429fe899cf45cbf14e08e2166',1,'adl_serializer']]], - ['to_5fjson_5ffn_37',['to_json_fn',['../structdetail_1_1to__json__fn.html',1,'detail']]], - ['to_5fmsgpack_38',['to_msgpack',['../classbasic__json.html#aea0ea0404f7ea72f66b0d5d0032b1367',1,'basic_json::to_msgpack(const basic_json &j)'],['../classbasic__json.html#af46fdac62559d4c38e623d99ad7064e9',1,'basic_json::to_msgpack(const basic_json &j, detail::output_adapter< std::uint8_t > o)'],['../classbasic__json.html#a51da13ff4e850d4ad1cf23ce4f3b9e4a',1,'basic_json::to_msgpack(const basic_json &j, detail::output_adapter< char > o)']]], - ['to_5fstring_39',['to_string',['../classjson__pointer.html#a6b94e2003be4cd72c4f145bcea2578ec',1,'json_pointer']]], - ['to_5fubjson_40',['to_ubjson',['../classbasic__json.html#a906e81d488ebcac169960a1d48f6b065',1,'basic_json::to_ubjson(const basic_json &j, const bool use_size=false, const bool use_type=false)'],['../classbasic__json.html#ada3d71f1dcfea24465d364b815d11445',1,'basic_json::to_ubjson(const basic_json &j, detail::output_adapter< std::uint8_t > o, const bool use_size=false, const bool use_type=false)'],['../classbasic__json.html#ab8b6c6cc3ba1b49af628fe0ec8c73b77',1,'basic_json::to_ubjson(const basic_json &j, detail::output_adapter< char > o, const bool use_size=false, const bool use_type=false)']]], - ['token_5ftype_41',['token_type',['../classdetail_1_1lexer__base.html#add65fa7a85aa15052963809fbcc04540',1,'detail::lexer_base']]], - ['token_5ftype_5fname_42',['token_type_name',['../classdetail_1_1lexer__base.html#aadef66e89ad828e5f69479c85887fa6d',1,'detail::lexer_base']]], - ['top_43',['top',['../classstack__list.html#a02d7021eceefc2638fde93f38cdeb589',1,'stack_list']]], - ['top_20strong_20_3a_44',['<strong>top</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md111',1,'']]], - ['topological_5fsort_45',['topological_sort',['../classgraph.html#a5fa36c46613b6a5252f263dde594cf1f',1,'graph::topological_sort()'],['../classweighted__graph.html#a4b6919e5c07fa6b655169b6a30592771',1,'weighted_graph::topological_sort()']]], - ['topological_5fsort_20strong_20_3a_46',['Topological_sort strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md38',1,'<strong>topological_sort</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md45',1,'<strong>topological_sort</strong>:']]], - ['totals_47',['Totals',['../struct_catch_1_1_totals.html',1,'Catch']]], - ['tree_48',['tree',['../classtree.html',1,'tree< T >'],['../classtree.html#ad5539664cc1fbf47d1bfce73ccc7c8e9',1,'tree::tree()']]], - ['tree_20class_49',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], - ['tree_20class_50',['Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html',1,'Mini Tutorial for the Interval Tree class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'Mini Tutorial for the Splay Tree class']]], - ['trie_51',['trie',['../classtrie.html',1,'trie'],['../classtrie.html#a8d07730e7c6071a78b872f7f73613d14',1,'trie::trie(std::vector< std::string > v={}) noexcept'],['../classtrie.html#a6a3d9a7b2ad1393f5648e29d3963f3f5',1,'trie::trie(const trie &t)']]], - ['trie_20class_52',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]], - ['true_5fgiven_53',['true_given',['../struct_catch_1_1true__given.html',1,'Catch']]], - ['tuple_5felement_3c_20n_2c_20_3a_3anlohmann_3a_3adetail_3a_3aiteration_5fproxy_5fvalue_3c_20iteratortype_20_3e_20_3e_54',['tuple_element< N, ::nlohmann::detail::iteration_proxy_value< IteratorType > >',['../classstd_1_1tuple__element_3_01_n_00_01_1_1nlohmann_1_1detail_1_1iteration__proxy__value_3_01_iterator_type_01_4_01_4.html',1,'std']]], - ['tuple_5fsize_3c_3a_3anlohmann_3a_3adetail_3a_3aiteration_5fproxy_5fvalue_3c_20iteratortype_20_3e_20_3e_55',['tuple_size<::nlohmann::detail::iteration_proxy_value< IteratorType > >',['../classstd_1_1tuple__size_3_1_1nlohmann_1_1detail_1_1iteration__proxy__value_3_01_iterator_type_01_4_01_4.html',1,'std']]], - ['tutorial_20for_20circular_20linked_20list_20class_56',['Mini tutorial for circular linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html',1,'']]], - ['tutorial_20for_20dbscan_20class_57',['Mini tutorial for DBSCAN class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html',1,'']]], - ['tutorial_20for_20doubly_20linked_20list_20class_58',['Mini tutorial for doubly linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html',1,'']]], - ['tutorial_20for_20edge_20detection_20namespace_59',['Mini tutorial for edge detection namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html',1,'']]], - ['tutorial_20for_20huffman_20coding_20class_60',['Mini tutorial for huffman coding class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html',1,'']]], - ['tutorial_20for_20kmeans_20class_61',['Mini tutorial for kmeans class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html',1,'']]], - ['tutorial_20for_20linear_20regression_20class_62',['Mini tutorial for linear regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html',1,'']]], - ['tutorial_20for_20median_20filter_20namespace_63',['Mini tutorial for median filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'']]], - ['tutorial_20for_20polynomial_20regression_20class_64',['Mini tutorial for polynomial regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html',1,'']]], - ['tutorial_20for_20single_20linked_20list_20class_65',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], - ['tutorial_20for_20the_20avl_20tree_20class_66',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], - ['tutorial_20for_20the_20bst_20class_67',['Mini Tutorial for the BST class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html',1,'']]], - ['tutorial_20for_20the_20frequency_5flist_20class_68',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]], - ['tutorial_20for_20the_20graph_20class_69',['Mini Tutorial for the Graph class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html',1,'']]], - ['tutorial_20for_20the_20hash_5ftable_20class_70',['Mini Tutorial for the hash_table class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html',1,'']]], - ['tutorial_20for_20the_20interval_20tree_20class_71',['Mini Tutorial for the Interval Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html',1,'']]], - ['tutorial_20for_20the_20skip_20list_20class_72',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], - ['tutorial_20for_20the_20splay_20tree_20class_73',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], - ['tutorial_20for_20the_20stack_20class_74',['Tutorial for the Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], - ['tutorial_20for_20the_20trie_20class_75',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]], - ['two_76',['two',['../structdetail_1_1is__ordered__map_1_1two.html',1,'detail::is_ordered_map']]], - ['type_77',['type',['../classbasic__json.html#ac5e52dbb3cb4e9fcabd1b88c37985aef',1,'basic_json']]], - ['type_5ferror_78',['type_error',['../classdetail_1_1type__error.html',1,'detail']]], - ['type_5fname_79',['type_name',['../classbasic__json.html#a15b177614647598e238e15ab1cc889c7',1,'basic_json']]] + ['the_20masking_20using_20apply_5fmedian_5ffilter_20function_20strong_20_3a_16',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md54',1,'']]], + ['the_20masking_20using_20apply_5fsharpening_5ffilter_20function_20strong_20_3a_17',['<strong>How to perform the masking using apply_sharpening_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html#autotoc_md57',1,'']]], + ['the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_18',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['the_20skip_20list_20class_19',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], + ['the_20splay_20tree_20class_20',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], + ['the_20stack_20class_21',['the Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], + ['the_20trie_20class_22',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]], + ['then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_23',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_24',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], + ['thousands_5fsep_25',['thousands_sep',['../classdetail_1_1serializer.html#a5b75b99511362e4e5d011c8a961e96bb',1,'detail::serializer']]], + ['timer_26',['Timer',['../class_catch_1_1_timer.html',1,'Catch']]], + ['to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_27',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_28',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], + ['to_20contribute_29',['How to contribute',['../index.html#autotoc_md23',1,'']]], + ['to_20contribute_30',['How to contribute?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_n_t_r_i_b_u_t_e.html',1,'']]], + ['to_20perform_20the_20masking_20using_20apply_5fmedian_5ffilter_20function_20strong_20_3a_31',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md54',1,'']]], + ['to_20perform_20the_20masking_20using_20apply_5fsharpening_5ffilter_20function_20strong_20_3a_32',['<strong>How to perform the masking using apply_sharpening_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html#autotoc_md57',1,'']]], + ['to_20run_20test_20cases_20strong_33',['<strong>How to run test cases</strong>',['../index.html#autotoc_md21',1,'']]], + ['to_5fbjdata_34',['to_bjdata',['../classbasic__json.html#a0912e7738f47e604ac96fe8cdde1a96e',1,'basic_json::to_bjdata(const basic_json &j, const bool use_size=false, const bool use_type=false)'],['../classbasic__json.html#a2736658c256401394059599f97139ee9',1,'basic_json::to_bjdata(const basic_json &j, detail::output_adapter< std::uint8_t > o, const bool use_size=false, const bool use_type=false)'],['../classbasic__json.html#a1fa9828fcbe4e33c9a036834564f7dbd',1,'basic_json::to_bjdata(const basic_json &j, detail::output_adapter< char > o, const bool use_size=false, const bool use_type=false)']]], + ['to_5fbson_35',['to_bson',['../classbasic__json.html#a4ea6478022ab79b47216fda4b53ae1d4',1,'basic_json::to_bson(const basic_json &j)'],['../classbasic__json.html#afd718b745034da1f4eea4c69f45cebda',1,'basic_json::to_bson(const basic_json &j, detail::output_adapter< std::uint8_t > o)'],['../classbasic__json.html#a71794547dde3dd67e444aa45131ca861',1,'basic_json::to_bson(const basic_json &j, detail::output_adapter< char > o)']]], + ['to_5fcbor_36',['to_cbor',['../classbasic__json.html#a7c47280dbbb39288384058b771f8eec6',1,'basic_json::to_cbor(const basic_json &j)'],['../classbasic__json.html#a706ccab0e47bd75cd36911db84451cd1',1,'basic_json::to_cbor(const basic_json &j, detail::output_adapter< std::uint8_t > o)'],['../classbasic__json.html#af31f5ee23264fb21bd31e16bc27adab2',1,'basic_json::to_cbor(const basic_json &j, detail::output_adapter< char > o)']]], + ['to_5fchars_37',['to_chars',['../namespacedetail.html#a3f0588f1a546b169113e6e1e293168f4',1,'detail']]], + ['to_5fjson_38',['to_json',['../structadl__serializer.html#a0216149429fe899cf45cbf14e08e2166',1,'adl_serializer']]], + ['to_5fjson_5ffn_39',['to_json_fn',['../structdetail_1_1to__json__fn.html',1,'detail']]], + ['to_5fmsgpack_40',['to_msgpack',['../classbasic__json.html#aea0ea0404f7ea72f66b0d5d0032b1367',1,'basic_json::to_msgpack(const basic_json &j)'],['../classbasic__json.html#af46fdac62559d4c38e623d99ad7064e9',1,'basic_json::to_msgpack(const basic_json &j, detail::output_adapter< std::uint8_t > o)'],['../classbasic__json.html#a51da13ff4e850d4ad1cf23ce4f3b9e4a',1,'basic_json::to_msgpack(const basic_json &j, detail::output_adapter< char > o)']]], + ['to_5fstring_41',['to_string',['../classjson__pointer.html#a6b94e2003be4cd72c4f145bcea2578ec',1,'json_pointer']]], + ['to_5fubjson_42',['to_ubjson',['../classbasic__json.html#a906e81d488ebcac169960a1d48f6b065',1,'basic_json::to_ubjson(const basic_json &j, const bool use_size=false, const bool use_type=false)'],['../classbasic__json.html#ada3d71f1dcfea24465d364b815d11445',1,'basic_json::to_ubjson(const basic_json &j, detail::output_adapter< std::uint8_t > o, const bool use_size=false, const bool use_type=false)'],['../classbasic__json.html#ab8b6c6cc3ba1b49af628fe0ec8c73b77',1,'basic_json::to_ubjson(const basic_json &j, detail::output_adapter< char > o, const bool use_size=false, const bool use_type=false)']]], + ['token_5ftype_43',['token_type',['../classdetail_1_1lexer__base.html#add65fa7a85aa15052963809fbcc04540',1,'detail::lexer_base']]], + ['token_5ftype_5fname_44',['token_type_name',['../classdetail_1_1lexer__base.html#aadef66e89ad828e5f69479c85887fa6d',1,'detail::lexer_base']]], + ['top_45',['top',['../classstack__list.html#a02d7021eceefc2638fde93f38cdeb589',1,'stack_list']]], + ['top_20strong_20_3a_46',['<strong>top</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md115',1,'']]], + ['topological_5fsort_47',['topological_sort',['../classgraph.html#a5fa36c46613b6a5252f263dde594cf1f',1,'graph::topological_sort()'],['../classweighted__graph.html#a4b6919e5c07fa6b655169b6a30592771',1,'weighted_graph::topological_sort()']]], + ['topological_5fsort_20strong_20_3a_48',['Topological_sort strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md39',1,'<strong>topological_sort</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md46',1,'<strong>topological_sort</strong>:']]], + ['totals_49',['Totals',['../struct_catch_1_1_totals.html',1,'Catch']]], + ['tree_50',['tree',['../classtree.html',1,'tree< T >'],['../classtree.html#ad5539664cc1fbf47d1bfce73ccc7c8e9',1,'tree::tree()']]], + ['tree_20class_51',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], + ['tree_20class_52',['Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html',1,'Mini Tutorial for the Interval Tree class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'Mini Tutorial for the Splay Tree class']]], + ['trie_53',['trie',['../classtrie.html',1,'trie'],['../classtrie.html#a8d07730e7c6071a78b872f7f73613d14',1,'trie::trie(std::vector< std::string > v={}) noexcept'],['../classtrie.html#a6a3d9a7b2ad1393f5648e29d3963f3f5',1,'trie::trie(const trie &t)']]], + ['trie_20class_54',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]], + ['true_5fgiven_55',['true_given',['../struct_catch_1_1true__given.html',1,'Catch']]], + ['tuple_5felement_3c_20n_2c_20_3a_3anlohmann_3a_3adetail_3a_3aiteration_5fproxy_5fvalue_3c_20iteratortype_20_3e_20_3e_56',['tuple_element< N, ::nlohmann::detail::iteration_proxy_value< IteratorType > >',['../classstd_1_1tuple__element_3_01_n_00_01_1_1nlohmann_1_1detail_1_1iteration__proxy__value_3_01_iterator_type_01_4_01_4.html',1,'std']]], + ['tuple_5fsize_3c_3a_3anlohmann_3a_3adetail_3a_3aiteration_5fproxy_5fvalue_3c_20iteratortype_20_3e_20_3e_57',['tuple_size<::nlohmann::detail::iteration_proxy_value< IteratorType > >',['../classstd_1_1tuple__size_3_1_1nlohmann_1_1detail_1_1iteration__proxy__value_3_01_iterator_type_01_4_01_4.html',1,'std']]], + ['tutorial_20for_20circular_20linked_20list_20class_58',['Mini tutorial for circular linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html',1,'']]], + ['tutorial_20for_20dbscan_20class_59',['Mini tutorial for DBSCAN class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html',1,'']]], + ['tutorial_20for_20doubly_20linked_20list_20class_60',['Mini tutorial for doubly linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html',1,'']]], + ['tutorial_20for_20edge_20detection_20namespace_61',['Mini tutorial for edge detection namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html',1,'']]], + ['tutorial_20for_20huffman_20coding_20class_62',['Mini tutorial for huffman coding class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html',1,'']]], + ['tutorial_20for_20kmeans_20class_63',['Mini tutorial for kmeans class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html',1,'']]], + ['tutorial_20for_20linear_20regression_20class_64',['Mini tutorial for linear regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html',1,'']]], + ['tutorial_20for_20median_20filter_20namespace_65',['Mini tutorial for median filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'']]], + ['tutorial_20for_20polynomial_20regression_20class_66',['Mini tutorial for polynomial regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html',1,'']]], + ['tutorial_20for_20sharpening_20filter_20namespace_67',['Mini tutorial for sharpening filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html',1,'']]], + ['tutorial_20for_20single_20linked_20list_20class_68',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], + ['tutorial_20for_20the_20avl_20tree_20class_69',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], + ['tutorial_20for_20the_20bst_20class_70',['Mini Tutorial for the BST class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html',1,'']]], + ['tutorial_20for_20the_20frequency_5flist_20class_71',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]], + ['tutorial_20for_20the_20graph_20class_72',['Mini Tutorial for the Graph class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html',1,'']]], + ['tutorial_20for_20the_20hash_5ftable_20class_73',['Mini Tutorial for the hash_table class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html',1,'']]], + ['tutorial_20for_20the_20interval_20tree_20class_74',['Mini Tutorial for the Interval Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html',1,'']]], + ['tutorial_20for_20the_20skip_20list_20class_75',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], + ['tutorial_20for_20the_20splay_20tree_20class_76',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], + ['tutorial_20for_20the_20stack_20class_77',['Tutorial for the Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], + ['tutorial_20for_20the_20trie_20class_78',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]], + ['two_79',['two',['../structdetail_1_1is__ordered__map_1_1two.html',1,'detail::is_ordered_map']]], + ['type_80',['type',['../classbasic__json.html#ac5e52dbb3cb4e9fcabd1b88c37985aef',1,'basic_json']]], + ['type_5ferror_81',['type_error',['../classdetail_1_1type__error.html',1,'detail']]], + ['type_5fname_82',['type_name',['../classbasic__json.html#a15b177614647598e238e15ab1cc889c7',1,'basic_json']]] ]; diff --git a/docs/html/search/all_19.js b/docs/html/search/all_19.js index 7fdf6eac..b52e4b31 100644 --- a/docs/html/search/all_19.js +++ b/docs/html/search/all_19.js @@ -6,8 +6,9 @@ var searchData= ['unit_20tests_3',['How do i write unit tests?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_u_n_i_t___t_e_s_t_s.html',1,'']]], ['unorderedequalsmatcher_4',['UnorderedEqualsMatcher',['../struct_catch_1_1_matchers_1_1_vector_1_1_unordered_equals_matcher.html',1,'Catch::Matchers::Vector']]], ['update_5',['update',['../classbasic__json.html#a3819f393e82396782ccc22785575b01d',1,'basic_json::update(const_reference j, bool merge_objects=false)'],['../classbasic__json.html#a4ea2b8cef5e4aba5b92d14e6ebe25936',1,'basic_json::update(const_iterator first, const_iterator last, bool merge_objects=false)']]], - ['use_20python_20s_20matplotlib_20for_20visualization_20purposes_3a_20strong_6',['Use python s matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md116',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md119',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], - ['use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_7',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], + ['use_20python_20s_20matplotlib_20for_20visualization_20purposes_3a_20strong_6',['Use python s matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md120',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md123',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], + ['use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_7',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], ['usecolour_8',['UseColour',['../struct_catch_1_1_use_colour.html',1,'Catch']]], - ['using_20apply_5fmedian_5ffilter_20function_20strong_20_3a_9',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md53',1,'']]] + ['using_20apply_5fmedian_5ffilter_20function_20strong_20_3a_9',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md54',1,'']]], + ['using_20apply_5fsharpening_5ffilter_20function_20strong_20_3a_10',['<strong>How to perform the masking using apply_sharpening_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html#autotoc_md57',1,'']]] ]; diff --git a/docs/html/search/all_1a.js b/docs/html/search/all_1a.js index 4a2595f4..c68901c0 100644 --- a/docs/html/search/all_1a.js +++ b/docs/html/search/all_1a.js @@ -17,12 +17,12 @@ var searchData= ['value_5ftype_14',['value_type',['../classdetail_1_1iter__impl.html#ab6c453d3fea1df38fa45fd4f97ea42df',1,'detail::iter_impl::value_type'],['../classbasic__json.html#a0d9e6a7acee2992e310ea21a7b59c67a',1,'basic_json::value_type']]], ['value_5funsigned_15',['value_unsigned',['../classdetail_1_1lexer__base.html#add65fa7a85aa15052963809fbcc04540aaf1f040fcd2f674d2e5893d7a731078f',1,'detail::lexer_base']]], ['version_16',['Algoplus{BETA Version}',['../index.html',1,'']]], - ['visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_17',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_18',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], - ['visualization_20purposes_3a_20strong_19',['Visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md116',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md119',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], + ['visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_17',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_18',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], + ['visualization_20purposes_3a_20strong_19',['Visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md120',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md123',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], ['visualize_20',['visualize',['../classgraph.html#aa60f2cd22020a5126dbef4c7e735eecf',1,'graph::visualize()'],['../classweighted__graph.html#a9184c90aa32ad1c81cddedcd6940802e',1,'weighted_graph::visualize()'],['../classcircular__linked__list.html#ae3dd24a24767dd1af94830e95c6f9d2d',1,'circular_linked_list::visualize()'],['../classdoubly__linked__list.html#a97b3ed1ec99751fa67bf2e8e04c7886f',1,'doubly_linked_list::visualize()'],['../classfrequency__list.html#ac9a2d4c6112298db61e15df249f98365',1,'frequency_list::visualize()'],['../classlinked__list.html#a79ef780ab429a076af0369f6fdd3c6f9',1,'linked_list::visualize()'],['../classavl__tree.html#a517f38f7f770647b80322fc7cd1192af',1,'avl_tree::visualize()'],['../classbst.html#a0198118bc2eb3d58607ce6acadb770a6',1,'bst::visualize()'],['../classsplay__tree.html#adf366c059ecbece708bd23db98ce94c0',1,'splay_tree::visualize()']]], - ['visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_21',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], - ['visualize_20strong_20_3a_22',['Visualize strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md41',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md63',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md72',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md89',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md127',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md137',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md146',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md156',1,'<strong>visualize</strong>:']]], - ['visualize_20your_20results_20strong_20_3a_23',['Visualize your results strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md48',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md54',1,'<strong>Visualize your results</strong>:']]], + ['visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_21',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], + ['visualize_20strong_20_3a_22',['Visualize strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md42',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md67',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md76',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md93',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md131',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md141',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md150',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md160',1,'<strong>visualize</strong>:']]], + ['visualize_20your_20results_20strong_20_3a_23',['Visualize your results strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md49',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md55',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html#autotoc_md58',1,'<strong>Visualize your results</strong>:']]], ['void_5ftype_24',['void_type',['../struct_catch_1_1detail_1_1void__type.html',1,'Catch::detail']]] ]; diff --git a/docs/html/search/all_1b.js b/docs/html/search/all_1b.js index bb80932b..db6cacb0 100644 --- a/docs/html/search/all_1b.js +++ b/docs/html/search/all_1b.js @@ -9,14 +9,14 @@ var searchData= ['wide_5fstring_5finput_5fhelper_6',['wide_string_input_helper',['../structdetail_1_1wide__string__input__helper.html',1,'detail']]], ['wide_5fstring_5finput_5fhelper_3c_20baseinputadapter_2c_202_20_3e_7',['wide_string_input_helper< BaseInputAdapter, 2 >',['../structdetail_1_1wide__string__input__helper_3_01_base_input_adapter_00_012_01_4.html',1,'detail']]], ['wide_5fstring_5finput_5fhelper_3c_20baseinputadapter_2c_204_20_3e_8',['wide_string_input_helper< BaseInputAdapter, 4 >',['../structdetail_1_1wide__string__input__helper_3_01_base_input_adapter_00_014_01_4.html',1,'detail']]], - ['with_20dbscan_20clustering_3a_20strong_20_3a_9',['With DBSCAN clustering: strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md26',1,'<strong>Get assignments with DBSCAN clustering:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md27',1,'<strong>Get noise with DBSCAN clustering:</strong>:']]], - ['with_20python_20s_20matplotlib_3a_20strong_20_3a_10',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], - ['with_20sobel_20function_20strong_20_3a_11',['<strong>Perform edge detection with Sobel() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md47',1,'']]], + ['with_20dbscan_20clustering_3a_20strong_20_3a_9',['With DBSCAN clustering: strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md27',1,'<strong>Get assignments with DBSCAN clustering:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'<strong>Get noise with DBSCAN clustering:</strong>:']]], + ['with_20python_20s_20matplotlib_3a_20strong_20_3a_10',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], + ['with_20sobel_20function_20strong_20_3a_11',['<strong>Perform edge detection with Sobel() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md48',1,'']]], ['withinabsmatcher_12',['WithinAbsMatcher',['../struct_catch_1_1_matchers_1_1_floating_1_1_within_abs_matcher.html',1,'Catch::Matchers::Floating']]], ['withinrelmatcher_13',['WithinRelMatcher',['../struct_catch_1_1_matchers_1_1_floating_1_1_within_rel_matcher.html',1,'Catch::Matchers::Floating']]], ['withinulpsmatcher_14',['WithinUlpsMatcher',['../struct_catch_1_1_matchers_1_1_floating_1_1_within_ulps_matcher.html',1,'Catch::Matchers::Floating']]], - ['write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_15',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_16',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], + ['write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_15',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_16',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], ['write_20unit_20tests_17',['How do i write unit tests?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_u_n_i_t___t_e_s_t_s.html',1,'']]], ['write_5fbson_18',['write_bson',['../classdetail_1_1binary__writer.html#a1aae361b7492825979cbb80245b9c0d6',1,'detail::binary_writer']]], ['write_5fcbor_19',['write_cbor',['../classdetail_1_1binary__writer.html#ae6ab36b61e8ad346e75d9f9abc983d4c',1,'detail::binary_writer']]], diff --git a/docs/html/search/all_1c.js b/docs/html/search/all_1c.js index 57d792b2..e9d184d9 100644 --- a/docs/html/search/all_1c.js +++ b/docs/html/search/all_1c.js @@ -1,8 +1,8 @@ var searchData= [ - ['y_20_3a_20strong_0',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md115',1,'']]], - ['you_20can_20use_20python_20s_20matplotlib_20for_20visualization_20purposes_3a_20strong_1',['You can use python s matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md116',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md119',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], - ['you_20can_20write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_2',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['you_20can_20write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_3',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], - ['your_20results_20strong_20_3a_4',['Your results strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md48',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md54',1,'<strong>Visualize your results</strong>:']]] + ['y_20_3a_20strong_0',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md119',1,'']]], + ['you_20can_20use_20python_20s_20matplotlib_20for_20visualization_20purposes_3a_20strong_1',['You can use python s matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md120',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md123',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], + ['you_20can_20write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_2',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['you_20can_20write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_3',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], + ['your_20results_20strong_20_3a_4',['Your results strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md49',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md55',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html#autotoc_md58',1,'<strong>Visualize your results</strong>:']]] ]; diff --git a/docs/html/search/all_4.js b/docs/html/search/all_4.js index cd7ac176..524ade84 100644 --- a/docs/html/search/all_4.js +++ b/docs/html/search/all_4.js @@ -1,5 +1,5 @@ var searchData= [ - ['_3a_0',[':',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md99',1,'<strong>back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md35',1,'<strong>BFS</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md39',1,'<strong>bipartite</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md40',1,'<strong>bridge</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md44',1,'<strong>connected</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md36',1,'<strong>connected_components</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md25',1,'<strong>Create an instance of DBSCAN:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md30',1,'<strong>Create an instance of kmeans:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md104',1,'<strong>Create an instance of the hash_table:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html#autotoc_md50',1,'<strong>create_tree</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md37',1,'<strong>cycle</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html#autotoc_md51',1,'<strong>decode</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md34',1,'<strong>DFS</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md61',1,'<strong>elements</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md70',1,'<strong>elements</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md87',1,'<strong>elements</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md58',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md67',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md78',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md84',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md98',1,'<strong>front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md31',1,'<strong>Get assignments and cluster centers:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md26',1,'<strong>Get assignments with DBSCAN clustering:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md27',1,'<strong>Get noise with DBSCAN clustering:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md77',1,'<strong>get_frequency</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md53',1,'<strong>How to perform the masking using apply_median_filter() function</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md124',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md133',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md143',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md152',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md91',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md105',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md121',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md130',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md139',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md149',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md158',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md94',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md102',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md108',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md113',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md128',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md136',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md147',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md155',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md62',1,'<strong>iterators</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md71',1,'<strong>iterators</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md88',1,'<strong>iterators</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md142',1,'<strong>overlap</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md47',1,'<strong>Perform edge detection with Sobel() function</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md112',1,'<strong>pop</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md101',1,'<strong>pop_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md100',1,'<strong>pop_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md126',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md135',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md145',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md154',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md125',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md134',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md144',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md153',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md43',1,'<strong>prim</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md110',1,'<strong>push</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md56',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md65',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md74',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md82',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md96',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md57',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md66',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md75',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md83',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md97',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md92',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md107',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md122',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md131',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md141',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md150',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md160',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md106',1,'<strong>retrieve</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md60',1,'<strong>reverse</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md69',1,'<strong>reverse</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md86',1,'<strong>reverse</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md59',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md68',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md76',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md85',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md93',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md123',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md132',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md140',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md151',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md159',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md42',1,'<strong>shortest_path</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md111',1,'<strong>top</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md38',1,'<strong>topological_sort</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md45',1,'<strong>topological_sort</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md48',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md54',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md41',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md63',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md72',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md89',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md127',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md137',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md146',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md156',1,'<strong>visualize</strong>:']]], - ['_3a_20strong_1',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md115',1,'']]] + ['_3a_0',[':',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md103',1,'<strong>back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md36',1,'<strong>BFS</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md40',1,'<strong>bipartite</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md41',1,'<strong>bridge</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md45',1,'<strong>connected</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md37',1,'<strong>connected_components</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md26',1,'<strong>Create an instance of DBSCAN:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md31',1,'<strong>Create an instance of kmeans:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md108',1,'<strong>Create an instance of the hash_table:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html#autotoc_md51',1,'<strong>create_tree</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md38',1,'<strong>cycle</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html#autotoc_md52',1,'<strong>decode</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md35',1,'<strong>DFS</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md65',1,'<strong>elements</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md74',1,'<strong>elements</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md91',1,'<strong>elements</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md62',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md71',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md82',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md88',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md102',1,'<strong>front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'<strong>Get assignments and cluster centers:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md27',1,'<strong>Get assignments with DBSCAN clustering:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'<strong>Get noise with DBSCAN clustering:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md81',1,'<strong>get_frequency</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md54',1,'<strong>How to perform the masking using apply_median_filter() function</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html#autotoc_md57',1,'<strong>How to perform the masking using apply_sharpening_filter() function</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md128',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md137',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md147',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md156',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md95',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md109',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md125',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md134',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md143',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md153',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md162',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md98',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md106',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md112',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md117',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md132',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md140',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md151',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md159',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md66',1,'<strong>iterators</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md75',1,'<strong>iterators</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md92',1,'<strong>iterators</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md146',1,'<strong>overlap</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md48',1,'<strong>Perform edge detection with Sobel() function</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md116',1,'<strong>pop</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md105',1,'<strong>pop_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md104',1,'<strong>pop_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md130',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md139',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md149',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md158',1,'<strong>postorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md129',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md138',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md148',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md157',1,'<strong>preorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md44',1,'<strong>prim</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md114',1,'<strong>push</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md60',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md69',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md78',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md86',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md100',1,'<strong>push_back</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md61',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md70',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md79',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md87',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md101',1,'<strong>push_front</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md96',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md111',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md126',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md135',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md145',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md154',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md164',1,'<strong>remove</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md110',1,'<strong>retrieve</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md64',1,'<strong>reverse</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md73',1,'<strong>reverse</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md90',1,'<strong>reverse</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md63',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md72',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md80',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md89',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md97',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md127',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md136',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md144',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md155',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md163',1,'<strong>search</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md43',1,'<strong>shortest_path</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md115',1,'<strong>top</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md39',1,'<strong>topological_sort</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md46',1,'<strong>topological_sort</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md49',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md55',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html#autotoc_md58',1,'<strong>Visualize your results</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md42',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md67',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md76',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md93',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md131',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md141',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md150',1,'<strong>visualize</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md160',1,'<strong>visualize</strong>:']]], + ['_3a_20strong_1',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md119',1,'']]] ]; diff --git a/docs/html/search/all_6.js b/docs/html/search/all_6.js index 50632407..ca540202 100644 --- a/docs/html/search/all_6.js +++ b/docs/html/search/all_6.js @@ -1,11 +1,11 @@ var searchData= [ - ['a_20and_20b_20of_20y_20_3a_20strong_0',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md115',1,'']]], + ['a_20and_20b_20of_20y_20_3a_20strong_0',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md119',1,'']]], ['a_20bug_20strong_1',['<strong>Fixing a bug</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_n_t_r_i_b_u_t_e.html#autotoc_md15',1,'']]], ['a_20href_20https_3a_20csrt_20ntua_20github_20io_20algoplus_20here_20a_20strong_2',['<strong>See the full documentation <a href="https://csrt-ntua.github.io/AlgoPlus/" >here</a></strong>',['../index.html#autotoc_md17',1,'']]], ['a_20href_20https_3a_20discord_20gg_20m9nyv4mhz6_20join_20a_20our_20discord_20strong_3',['<strong><a href="https://discord.gg/M9nYv4MHz6" >Join</a> our Discord</strong>',['../index.html#autotoc_md18',1,'']]], - ['a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_4',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_5',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], + ['a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_4',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_5',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], ['a_20new_20class_20strong_6',['<strong>Creating a new Class</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_n_t_r_i_b_u_t_e.html#autotoc_md14',1,'']]], ['accept_7',['accept',['../classdetail_1_1parser.html#ac46da3262cbe66ade670c5b4782451e6',1,'detail::parser']]], ['actual_5fobject_5fcomparator_8',['actual_object_comparator',['../structdetail_1_1actual__object__comparator.html',1,'detail']]], @@ -17,35 +17,37 @@ var searchData= ['algoplus_20here_20a_20strong_14',['<strong>See the full documentation <a href="https://csrt-ntua.github.io/AlgoPlus/" >here</a></strong>',['../index.html#autotoc_md17',1,'']]], ['allocator_5ftype_15',['allocator_type',['../classbasic__json.html#a83f845db2d54cedad97279bad70aea52',1,'basic_json']]], ['always_5ffalse_16',['always_false',['../struct_catch_1_1always__false.html',1,'Catch']]], - ['an_20instance_20of_20dbscan_3a_20strong_20_3a_17',['<strong>Create an instance of DBSCAN:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md25',1,'']]], - ['an_20instance_20of_20kmeans_3a_20strong_20_3a_18',['<strong>Create an instance of kmeans:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md30',1,'']]], - ['an_20instance_20of_20the_20hash_5ftable_3a_20strong_20_3a_19',['<strong>Create an instance of the hash_table:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md104',1,'']]], - ['and_20b_20of_20y_20_3a_20strong_20',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md115',1,'']]], - ['and_20cluster_20centers_3a_20strong_20_3a_21',['<strong>Get assignments and cluster centers:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md31',1,'']]], - ['and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_22',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_23',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], + ['an_20instance_20of_20dbscan_3a_20strong_20_3a_17',['<strong>Create an instance of DBSCAN:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md26',1,'']]], + ['an_20instance_20of_20kmeans_3a_20strong_20_3a_18',['<strong>Create an instance of kmeans:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md31',1,'']]], + ['an_20instance_20of_20the_20hash_5ftable_3a_20strong_20_3a_19',['<strong>Create an instance of the hash_table:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md108',1,'']]], + ['and_20b_20of_20y_20_3a_20strong_20',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md119',1,'']]], + ['and_20cluster_20centers_3a_20strong_20_3a_21',['<strong>Get assignments and cluster centers:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], + ['and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_22',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_23',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], ['append_5fexponent_24',['append_exponent',['../namespacedetail_1_1dtoa__impl.html#aec9f6655c3b629aeb0e8c887aea5da87',1,'detail::dtoa_impl']]], ['apply_5ffilter2d_25',['apply_filter2d',['../class_image.html#a3a56602ae5335142e179e679c9e31aa6',1,'Image']]], ['apply_5fmedian_5ffilter_26',['apply_median_filter',['../namespacemedian__filter.html#a6f572af3819ffeb5135937fb5674b407',1,'median_filter']]], - ['apply_5fmedian_5ffilter_20function_20strong_20_3a_27',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md53',1,'']]], - ['approx_28',['Approx',['../class_catch_1_1_detail_1_1_approx.html',1,'Catch::Detail']]], - ['approxmatcher_29',['ApproxMatcher',['../struct_catch_1_1_matchers_1_1_vector_1_1_approx_matcher.html',1,'Catch::Matchers::Vector']]], - ['array_30',['array',['../classbasic__json.html#ac736994a792cb8460a30a3f4dd86fd78',1,'basic_json::array()'],['../namespacedetail.html#a917c3efabea8a20dc72d9ae2c673d632af1f713c9e000f5d3f280adbd124df4f5',1,'detail::array']]], - ['array_5fend_31',['array_end',['../namespacedetail.html#a47b1bb0bbd3596589ed9187059c312efa49642fb732aa2e112188fba1f9d3ef7f',1,'detail']]], - ['array_5fiterator_32',['array_iterator',['../structdetail_1_1internal__iterator.html#a2ad2dc9ea8bba2b50811e34f905350bd',1,'detail::internal_iterator']]], - ['array_5fstart_33',['array_start',['../namespacedetail.html#a47b1bb0bbd3596589ed9187059c312efaa4388a3d92419edbb1c6efd4d52461f3',1,'detail']]], - ['array_5ft_34',['array_t',['../classbasic__json.html#a60644b7dccc409e6b367361d37841333',1,'basic_json']]], - ['as_35',['as',['../struct_catch_1_1_generators_1_1as.html',1,'Catch::Generators']]], - ['assertionhandler_36',['AssertionHandler',['../class_catch_1_1_assertion_handler.html',1,'Catch']]], - ['assertioninfo_37',['AssertionInfo',['../struct_catch_1_1_assertion_info.html',1,'Catch']]], - ['assertionreaction_38',['AssertionReaction',['../struct_catch_1_1_assertion_reaction.html',1,'Catch']]], - ['assign_5fto_5fclosest_39',['assign_to_closest',['../classkmeans.html#afbea96aeec84f1fed57e8578235ef605',1,'kmeans']]], - ['assignments_20and_20cluster_20centers_3a_20strong_20_3a_40',['<strong>Get assignments and cluster centers:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md31',1,'']]], - ['assignments_20with_20dbscan_20clustering_3a_20strong_20_3a_41',['<strong>Get assignments with DBSCAN clustering:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md26',1,'']]], - ['astar_42',['AStar',['../class_a_star.html',1,'AStar< T >'],['../class_a_star.html#a23730b1890b3092f7b96efbacba2e662',1,'AStar::AStar()']]], - ['at_43',['at',['../classbasic__json.html#a899e4623fe377af5c9ad14c40c64280c',1,'basic_json::at(size_type idx)'],['../classbasic__json.html#af076d8a80f4263cf821da2033d5773b6',1,'basic_json::at(size_type idx) const'],['../classbasic__json.html#accafaaf23f60bb245ddb1fa0972b33a3',1,'basic_json::at(const typename object_t::key_type &key)'],['../classbasic__json.html#a4cd9ba2f2164d9cee83b07f76d40843f',1,'basic_json::at(KeyType &&key)'],['../classbasic__json.html#aba9a21714e81e98fc5786a2339ea1665',1,'basic_json::at(const typename object_t::key_type &key) const'],['../classbasic__json.html#a7ae6267ca4bd85e25f61dc5ba30204da',1,'basic_json::at(KeyType &&key) const'],['../classbasic__json.html#a91d1ad7e10a1c3aae885ddd992385612',1,'basic_json::at(const json_pointer &ptr)'],['../classbasic__json.html#a5a3a35d456e3250640a90c6f7a7fd555',1,'basic_json::at(const json_pointer &ptr) const']]], - ['attribution_44',['Attribution',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md11',1,'']]], - ['autoreg_45',['AutoReg',['../struct_catch_1_1_auto_reg.html',1,'Catch']]], - ['avl_20tree_20class_46',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], - ['avl_5ftree_47',['avl_tree',['../classavl__tree.html',1,'avl_tree< T >'],['../classavl__tree.html#a048c3bc01286503d3d540a8910551317',1,'avl_tree::avl_tree(std::vector< T > __elements={}) noexcept'],['../classavl__tree.html#a3cab4d4112e58e6f90f36d0c23cbe3f6',1,'avl_tree::avl_tree(const avl_tree &a)']]] + ['apply_5fmedian_5ffilter_20function_20strong_20_3a_27',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md54',1,'']]], + ['apply_5fsharpening_5ffilter_28',['apply_sharpening_filter',['../namespacesharpening__filter.html#a6cd67f915c4cf17ab46f72104a5cc9e6',1,'sharpening_filter']]], + ['apply_5fsharpening_5ffilter_20function_20strong_20_3a_29',['<strong>How to perform the masking using apply_sharpening_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html#autotoc_md57',1,'']]], + ['approx_30',['Approx',['../class_catch_1_1_detail_1_1_approx.html',1,'Catch::Detail']]], + ['approxmatcher_31',['ApproxMatcher',['../struct_catch_1_1_matchers_1_1_vector_1_1_approx_matcher.html',1,'Catch::Matchers::Vector']]], + ['array_32',['array',['../classbasic__json.html#ac736994a792cb8460a30a3f4dd86fd78',1,'basic_json::array()'],['../namespacedetail.html#a917c3efabea8a20dc72d9ae2c673d632af1f713c9e000f5d3f280adbd124df4f5',1,'detail::array']]], + ['array_5fend_33',['array_end',['../namespacedetail.html#a47b1bb0bbd3596589ed9187059c312efa49642fb732aa2e112188fba1f9d3ef7f',1,'detail']]], + ['array_5fiterator_34',['array_iterator',['../structdetail_1_1internal__iterator.html#a2ad2dc9ea8bba2b50811e34f905350bd',1,'detail::internal_iterator']]], + ['array_5fstart_35',['array_start',['../namespacedetail.html#a47b1bb0bbd3596589ed9187059c312efaa4388a3d92419edbb1c6efd4d52461f3',1,'detail']]], + ['array_5ft_36',['array_t',['../classbasic__json.html#a60644b7dccc409e6b367361d37841333',1,'basic_json']]], + ['as_37',['as',['../struct_catch_1_1_generators_1_1as.html',1,'Catch::Generators']]], + ['assertionhandler_38',['AssertionHandler',['../class_catch_1_1_assertion_handler.html',1,'Catch']]], + ['assertioninfo_39',['AssertionInfo',['../struct_catch_1_1_assertion_info.html',1,'Catch']]], + ['assertionreaction_40',['AssertionReaction',['../struct_catch_1_1_assertion_reaction.html',1,'Catch']]], + ['assign_5fto_5fclosest_41',['assign_to_closest',['../classkmeans.html#afbea96aeec84f1fed57e8578235ef605',1,'kmeans']]], + ['assignments_20and_20cluster_20centers_3a_20strong_20_3a_42',['<strong>Get assignments and cluster centers:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], + ['assignments_20with_20dbscan_20clustering_3a_20strong_20_3a_43',['<strong>Get assignments with DBSCAN clustering:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md27',1,'']]], + ['astar_44',['AStar',['../class_a_star.html',1,'AStar< T >'],['../class_a_star.html#a23730b1890b3092f7b96efbacba2e662',1,'AStar::AStar()']]], + ['at_45',['at',['../classbasic__json.html#a899e4623fe377af5c9ad14c40c64280c',1,'basic_json::at(size_type idx)'],['../classbasic__json.html#af076d8a80f4263cf821da2033d5773b6',1,'basic_json::at(size_type idx) const'],['../classbasic__json.html#accafaaf23f60bb245ddb1fa0972b33a3',1,'basic_json::at(const typename object_t::key_type &key)'],['../classbasic__json.html#a4cd9ba2f2164d9cee83b07f76d40843f',1,'basic_json::at(KeyType &&key)'],['../classbasic__json.html#aba9a21714e81e98fc5786a2339ea1665',1,'basic_json::at(const typename object_t::key_type &key) const'],['../classbasic__json.html#a7ae6267ca4bd85e25f61dc5ba30204da',1,'basic_json::at(KeyType &&key) const'],['../classbasic__json.html#a91d1ad7e10a1c3aae885ddd992385612',1,'basic_json::at(const json_pointer &ptr)'],['../classbasic__json.html#a5a3a35d456e3250640a90c6f7a7fd555',1,'basic_json::at(const json_pointer &ptr) const']]], + ['attribution_46',['Attribution',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md11',1,'']]], + ['autoreg_47',['AutoReg',['../struct_catch_1_1_auto_reg.html',1,'Catch']]], + ['avl_20tree_20class_48',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], + ['avl_5ftree_49',['avl_tree',['../classavl__tree.html',1,'avl_tree< T >'],['../classavl__tree.html#a048c3bc01286503d3d540a8910551317',1,'avl_tree::avl_tree(std::vector< T > __elements={}) noexcept'],['../classavl__tree.html#a3cab4d4112e58e6f90f36d0c23cbe3f6',1,'avl_tree::avl_tree(const avl_tree &a)']]] ]; diff --git a/docs/html/search/all_7.js b/docs/html/search/all_7.js index e7c155a8..be6e408a 100644 --- a/docs/html/search/all_7.js +++ b/docs/html/search/all_7.js @@ -1,8 +1,8 @@ var searchData= [ - ['b_20of_20y_20_3a_20strong_0',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md115',1,'']]], + ['b_20of_20y_20_3a_20strong_0',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md119',1,'']]], ['back_1',['back',['../classdequeue__list.html#a52390a91517e3419a6120d38cc30ca39',1,'dequeue_list::back()'],['../classjson__pointer.html#aba71e63e4032cfc46dd90aeb09e5cb0f',1,'json_pointer::back()'],['../classbasic__json.html#a0d93dc1dbdf67a6ee3a5cf1d2439ca77',1,'basic_json::back()'],['../classbasic__json.html#a41eee3066cd1ebfea746f9f07fd03f6f',1,'basic_json::back() const']]], - ['back_20strong_20_3a_2',['<strong>back</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md99',1,'']]], + ['back_20strong_20_3a_2',['<strong>back</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md103',1,'']]], ['ban_3',['Ban',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md9',1,'3. Temporary Ban'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'4. Permanent Ban']]], ['base_5fiterator_4',['base_iterator',['../classdetail_1_1json__reverse__iterator.html#ab306723c375c396a5ccd90e2d31ad651',1,'detail::json_reverse_iterator']]], ['basic_5fjson_5',['basic_json',['../classbasic__json.html',1,'basic_json< ObjectType, ArrayType, StringType, BooleanType, NumberIntegerType, NumberUnsignedType, NumberFloatType, AllocatorType, JSONSerializer, BinaryType, CustomBaseClass >'],['../classbasic__json.html#ae2d5bc42270881ed3e219e8b1456fec5',1,'basic_json::basic_json(const value_t v)'],['../classbasic__json.html#a5b1fab9ded0a2a182837bd66c0e5189e',1,'basic_json::basic_json(std::nullptr_t=nullptr) noexcept'],['../classbasic__json.html#a0f24e66b152203259eaf05c33ebaeed4',1,'basic_json::basic_json(CompatibleType &&val) noexcept(noexcept(//NOLINT(bugprone-forwarding-reference-overload, bugprone-exception-escape) JSONSerializer< U >::to_json(std::declval< basic_json_t & >(), std::forward< CompatibleType >(val))))'],['../classbasic__json.html#aeaf10402e79a1acce9a74f5a9654d403',1,'basic_json::basic_json(const BasicJsonType &val)'],['../classbasic__json.html#aa911d47d3c99184a301bf4fd304199b2',1,'basic_json::basic_json(initializer_list_t init, bool type_deduction=true, value_t manual_type=value_t::array)'],['../classbasic__json.html#a7b6f0605b09a002567fd18a289cef31b',1,'basic_json::basic_json(size_type cnt, const basic_json &val)'],['../classbasic__json.html#af97b4fcd01509076c8a7b32ec1a10aec',1,'basic_json::basic_json(InputIT first, InputIT last)'],['../classbasic__json.html#af15244e1249b6e7282127d460b5b2e3e',1,'basic_json::basic_json(const basic_json &other)'],['../classbasic__json.html#ae18629aae4bd76e6f7920cf4e7b4dd60',1,'basic_json::basic_json(basic_json &&other) noexcept']]], @@ -13,19 +13,19 @@ var searchData= ['best_5ffirst_10',['best_first',['../classbest__first.html',1,'best_first< T >'],['../classbest__first.html#a023c0fe7138ff505951941ac43826293',1,'best_first::best_first()']]], ['beta_20version_11',['Algoplus{BETA Version}',['../index.html',1,'']]], ['bfs_12',['bfs',['../classgraph.html#a3cc331d692642bfdee0f8bcf87071176',1,'graph::bfs()'],['../classweighted__graph.html#a5407df31013d7d9d1bd5cbfa63082404',1,'weighted_graph::bfs()']]], - ['bfs_20strong_20_3a_13',['<strong>BFS</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md35',1,'']]], + ['bfs_20strong_20_3a_13',['<strong>BFS</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md36',1,'']]], ['binary_14',['binary',['../structjson__sax.html#a15d6c5d0dcaceb906405f427faf9b34e',1,'json_sax::binary()'],['../classbasic__json.html#a743ac3bcbc4b0f7897244d4cea387eee',1,'basic_json::binary(const typename binary_t::container_type &init)'],['../classbasic__json.html#a45e65e73d9ecf780537d632372fa2c51',1,'basic_json::binary(const typename binary_t::container_type &init, typename binary_t::subtype_type subtype)'],['../classbasic__json.html#a5af2196a9acde33f742ef054e7c2109c',1,'basic_json::binary(typename binary_t::container_type &&init)'],['../classbasic__json.html#ac00a2a38929ce21eae65f9dd09b03ce3',1,'basic_json::binary(typename binary_t::container_type &&init, typename binary_t::subtype_type subtype)'],['../namespacedetail.html#a917c3efabea8a20dc72d9ae2c673d632a9d7183f16acce70658f686ae7f1a4d20',1,'detail::binary']]], ['binary_5freader_15',['binary_reader',['../classdetail_1_1binary__reader.html',1,'detail::binary_reader< BasicJsonType, InputAdapterType, SAX >'],['../classdetail_1_1binary__reader.html#a5dc3e9216177efe30686876d3faccf52',1,'detail::binary_reader::binary_reader()']]], ['binary_5ft_16',['binary_t',['../classbasic__json.html#a4c1b5ea434b48cf31097617bb1c1ca1e',1,'basic_json']]], ['binary_5fwriter_17',['binary_writer',['../classdetail_1_1binary__writer.html',1,'detail::binary_writer< BasicJsonType, CharType >'],['../classdetail_1_1binary__writer.html#a5b4f1bfcd0f3f7b57060c059e008c45b',1,'detail::binary_writer::binary_writer()']]], ['binaryexpr_18',['BinaryExpr',['../class_catch_1_1_binary_expr.html',1,'Catch']]], ['bipartite_19',['bipartite',['../classgraph.html#a24409517a5d6bd3689a11ce1ec18eaab',1,'graph::bipartite()'],['../classweighted__graph.html#a3400015dc6c8bd365042d4fbc48017ce',1,'weighted_graph::bipartite()']]], - ['bipartite_20strong_20_3a_20',['<strong>bipartite</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md39',1,'']]], + ['bipartite_20strong_20_3a_20',['<strong>bipartite</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md40',1,'']]], ['boolean_21',['boolean',['../structjson__sax.html#ab89f75382c0fd7fe81c95fc84cfa3150',1,'json_sax::boolean()'],['../namespacedetail.html#a917c3efabea8a20dc72d9ae2c673d632a84e2c64f38f78ba3ea5c905ab5a2da27',1,'detail::boolean']]], ['boolean_5ft_22',['boolean_t',['../classbasic__json.html#a9301890c48e9b957edc07f9eb767bd10',1,'basic_json']]], ['boundaries_23',['boundaries',['../structdetail_1_1dtoa__impl_1_1boundaries.html',1,'detail::dtoa_impl']]], ['bridge_24',['bridge',['../classgraph.html#a3db835fe4f1f0ef665e1ad1251493879',1,'graph::bridge()'],['../classweighted__graph.html#a3dd0f3f2729700069a1a6f8e28681b9e',1,'weighted_graph::bridge()']]], - ['bridge_20strong_20_3a_25',['<strong>bridge</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md40',1,'']]], + ['bridge_20strong_20_3a_25',['<strong>bridge</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md41',1,'']]], ['bst_26',['bst',['../classbst.html',1,'bst< T >'],['../classbst.html#a6f3db633f32d9c984357adaf2aa1ea14',1,'bst::bst(std::vector< T > __elements={}) noexcept'],['../classbst.html#a7461a2607495eab0f2621708b554e926',1,'bst::bst(const bst &b)']]], ['bst_20class_27',['Mini Tutorial for the BST class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html',1,'']]], ['bug_20strong_28',['<strong>Fixing a bug</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_n_t_r_i_b_u_t_e.html#autotoc_md15',1,'']]], diff --git a/docs/html/search/all_8.js b/docs/html/search/all_8.js index 7adc898f..59957319 100644 --- a/docs/html/search/all_8.js +++ b/docs/html/search/all_8.js @@ -1,9 +1,9 @@ var searchData= [ ['cached_5fpower_0',['cached_power',['../structdetail_1_1dtoa__impl_1_1cached__power.html',1,'detail::dtoa_impl']]], - ['can_20use_20python_20s_20matplotlib_20for_20visualization_20purposes_3a_20strong_1',['Can use python s matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md116',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md119',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], - ['can_20write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_2',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['can_20write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_3',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], + ['can_20use_20python_20s_20matplotlib_20for_20visualization_20purposes_3a_20strong_1',['Can use python s matplotlib for visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md120',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md123',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], + ['can_20write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_2',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['can_20write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_3',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], ['capturer_4',['Capturer',['../class_catch_1_1_capturer.html',1,'Catch']]], ['casedstring_5',['CasedString',['../struct_catch_1_1_matchers_1_1_std_string_1_1_cased_string.html',1,'Catch::Matchers::StdString']]], ['cases_20strong_6',['<strong>How to run test cases</strong>',['../index.html#autotoc_md21',1,'']]], @@ -12,7 +12,7 @@ var searchData= ['cbegin_9',['cbegin',['../classbasic__json.html#a9ab2ece6530b3b2be5b876f80c68dc78',1,'basic_json']]], ['cbor_5ftag_5fhandler_5ft_10',['cbor_tag_handler_t',['../classbasic__json.html#a067b4f0e63e55055272fec0a26b5b991',1,'basic_json::cbor_tag_handler_t'],['../namespacedetail.html#a7c070b2bf3d61e3d8b8013f6fb18d592',1,'detail::cbor_tag_handler_t']]], ['cend_11',['cend',['../classbasic__json.html#a57c63700f006c54624eb2433ec6526b0',1,'basic_json']]], - ['centers_3a_20strong_20_3a_12',['<strong>Get assignments and cluster centers:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md31',1,'']]], + ['centers_3a_20strong_20_3a_12',['<strong>Get assignments and cluster centers:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], ['char_5ftraits_13',['char_traits',['../structdetail_1_1char__traits.html',1,'detail']]], ['char_5ftraits_3c_20char_5ftype_20_3e_14',['char_traits< char_type >',['../structdetail_1_1char__traits.html',1,'detail']]], ['char_5ftraits_3c_20signed_20char_20_3e_15',['char_traits< signed char >',['../structdetail_1_1char__traits_3_01signed_01char_01_4.html',1,'detail']]], @@ -28,12 +28,12 @@ var searchData= ['classes_25',['Classes',['../index.html#autotoc_md20',1,'']]], ['clear_26',['clear',['../classgraph.html#ab00bf74c17ce8df8b93321229f562c73',1,'graph::clear()'],['../classweighted__graph.html#aee58213295bc0b7e7336b82446fd512d',1,'weighted_graph::clear()'],['../classdequeue__list.html#aca5f157a4c65e4c3ecddd8f412ac13ae',1,'dequeue_list::clear()'],['../classstack__list.html#ac4bbd668428be00fdeb47c6cfeec86a2',1,'stack_list::clear()'],['../classavl__tree.html#a35687925c37c49e535771da125388100',1,'avl_tree::clear()'],['../classbst.html#a24e453a8f1f0926bf1d1eaa557c97285',1,'bst::clear()'],['../classinterval__tree.html#a546f03111c95ed6f0cb68fcfce4e669f',1,'interval_tree::clear()'],['../classsplay__tree.html#a2da70f39990b6c677cf0022378fd4b17',1,'splay_tree::clear()'],['../classbasic__json.html#ad8cb21b66e4a4de652828345d51a8fc1',1,'basic_json::clear()']]], ['clear_5fsubtype_27',['clear_subtype',['../classbyte__container__with__subtype.html#ad18f6a7557a2bfce28f1ed8d4d10607c',1,'byte_container_with_subtype']]], - ['cluster_20centers_3a_20strong_20_3a_28',['<strong>Get assignments and cluster centers:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md31',1,'']]], - ['clustering_3a_20strong_20_3a_29',['Clustering: strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md26',1,'<strong>Get assignments with DBSCAN clustering:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md27',1,'<strong>Get noise with DBSCAN clustering:</strong>:']]], + ['cluster_20centers_3a_20strong_20_3a_28',['<strong>Get assignments and cluster centers:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], + ['clustering_3a_20strong_20_3a_29',['Clustering: strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md27',1,'<strong>Get assignments with DBSCAN clustering:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'<strong>Get noise with DBSCAN clustering:</strong>:']]], ['code_30',['How should i comment my code?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_m_m_e_n_t_s.html',1,'']]], ['code_20of_20conduct_31',['Contributor Covenant Code of Conduct',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], ['coding_20class_32',['Mini tutorial for huffman coding class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html',1,'']]], - ['coefficients_20strong_33',['<strong>Get coefficients</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md118',1,'']]], + ['coefficients_20strong_33',['<strong>Get coefficients</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md122',1,'']]], ['cols_34',['cols',['../class_mat2d.html#af7beca0a26147808d2335a39a1aed4d0',1,'Mat2d']]], ['comment_20my_20code_35',['How should i comment my code?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_m_m_e_n_t_s.html',1,'']]], ['compute_5fboundaries_36',['compute_boundaries',['../namespacedetail_1_1dtoa__impl.html#a6a5ccf11847aab7a0f42f587b33935df',1,'detail::dtoa_impl']]], @@ -45,9 +45,9 @@ var searchData= ['conjunction_3c_20is_5fdefault_5fconstructible_3c_20t1_20_3e_2c_20is_5fdefault_5fconstructible_3c_20t2_20_3e_20_3e_42',['conjunction< is_default_constructible< T1 >, is_default_constructible< T2 > >',['../structdetail_1_1conjunction.html',1,'detail']]], ['conjunction_3c_20is_5fdefault_5fconstructible_3c_20ts_20_3e_2e_2e_2e_20_3e_43',['conjunction< is_default_constructible< Ts >... >',['../structdetail_1_1conjunction.html',1,'detail']]], ['connected_44',['connected',['../classgraph.html#ac72a23cebe0d10617d971aca1256de2c',1,'graph::connected()'],['../classweighted__graph.html#a8cebbcf6366ce3fb31cb0b711ad8f600',1,'weighted_graph::connected()']]], - ['connected_20strong_20_3a_45',['<strong>connected</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md44',1,'']]], + ['connected_20strong_20_3a_45',['<strong>connected</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md45',1,'']]], ['connected_5fcomponents_46',['connected_components',['../classgraph.html#ad69569f1cfb90b440a5e66635eaa2622',1,'graph::connected_components()'],['../classweighted__graph.html#a2c9730ab4d207d10ab355570d5164cac',1,'weighted_graph::connected_components()']]], - ['connected_5fcomponents_20strong_20_3a_47',['<strong>connected_components</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md36',1,'']]], + ['connected_5fcomponents_20strong_20_3a_47',['<strong>connected_components</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md37',1,'']]], ['const_5fiterator_48',['const_iterator',['../classbasic__json.html#a1f5af3d9d06d43b91fefe1767794b1e8',1,'basic_json']]], ['const_5fpointer_49',['const_pointer',['../classbasic__json.html#a2862fa42527f5c14d9f737411e0facd4',1,'basic_json']]], ['const_5freference_50',['const_reference',['../classbasic__json.html#a31370bb451b78198d42c86dd31955deb',1,'basic_json']]], @@ -67,14 +67,14 @@ var searchData= ['covenant_20code_20of_20conduct_64',['Contributor Covenant Code of Conduct',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], ['crbegin_65',['crbegin',['../classbasic__json.html#acdde2a6628e43b3e3f7f27c6af6998f8',1,'basic_json']]], ['create_66',['create',['../classdetail_1_1parse__error.html#a07046ea9f33d28f120af188ed674d6df',1,'detail::parse_error']]], - ['create_20an_20instance_20of_20dbscan_3a_20strong_20_3a_67',['<strong>Create an instance of DBSCAN:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md25',1,'']]], - ['create_20an_20instance_20of_20kmeans_3a_20strong_20_3a_68',['<strong>Create an instance of kmeans:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md30',1,'']]], - ['create_20an_20instance_20of_20the_20hash_5ftable_3a_20strong_20_3a_69',['<strong>Create an instance of the hash_table:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md104',1,'']]], + ['create_20an_20instance_20of_20dbscan_3a_20strong_20_3a_67',['<strong>Create an instance of DBSCAN:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md26',1,'']]], + ['create_20an_20instance_20of_20kmeans_3a_20strong_20_3a_68',['<strong>Create an instance of kmeans:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md31',1,'']]], + ['create_20an_20instance_20of_20the_20hash_5ftable_3a_20strong_20_3a_69',['<strong>Create an instance of the hash_table:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md108',1,'']]], ['create_5ftree_70',['create_tree',['../classhuffman.html#a3185e73fc59752248afc7025a39d3079',1,'huffman']]], - ['create_5ftree_20strong_20_3a_71',['<strong>create_tree</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html#autotoc_md50',1,'']]], + ['create_5ftree_20strong_20_3a_71',['<strong>create_tree</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html#autotoc_md51',1,'']]], ['creating_20a_20new_20class_20strong_72',['<strong>Creating a new Class</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_n_t_r_i_b_u_t_e.html#autotoc_md14',1,'']]], ['crend_73',['crend',['../classbasic__json.html#aa52cc6cc0de1e81d9cc21f9c48feb588',1,'basic_json']]], ['csrt_20ntua_20github_20io_20algoplus_20here_20a_20strong_74',['<strong>See the full documentation <a href="https://csrt-ntua.github.io/AlgoPlus/" >here</a></strong>',['../index.html#autotoc_md17',1,'']]], ['cycle_75',['cycle',['../classgraph.html#a77cab44c928701b32e0d0610392ed5cc',1,'graph::cycle()'],['../classweighted__graph.html#a4aa2ada9ac5954730d10abadcc16b2e1',1,'weighted_graph::cycle()']]], - ['cycle_20strong_20_3a_76',['<strong>cycle</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md37',1,'']]] + ['cycle_20strong_20_3a_76',['<strong>cycle</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md38',1,'']]] ]; diff --git a/docs/html/search/all_9.js b/docs/html/search/all_9.js index 8c7f907b..bb47f895 100644 --- a/docs/html/search/all_9.js +++ b/docs/html/search/all_9.js @@ -2,11 +2,11 @@ var searchData= [ ['dbscan_0',['DBSCAN',['../class_d_b_s_c_a_n.html',1,'DBSCAN'],['../class_d_b_s_c_a_n.html#a052547e3cb21c270495f5fcf98e70b0a',1,'DBSCAN::DBSCAN()']]], ['dbscan_20class_1',['Mini tutorial for DBSCAN class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html',1,'']]], - ['dbscan_20clustering_3a_20strong_20_3a_2',['DBSCAN clustering: strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md26',1,'<strong>Get assignments with DBSCAN clustering:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md27',1,'<strong>Get noise with DBSCAN clustering:</strong>:']]], - ['dbscan_3a_20strong_20_3a_3',['<strong>Create an instance of DBSCAN:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md25',1,'']]], + ['dbscan_20clustering_3a_20strong_20_3a_2',['DBSCAN clustering: strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md27',1,'<strong>Get assignments with DBSCAN clustering:</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'<strong>Get noise with DBSCAN clustering:</strong>:']]], + ['dbscan_3a_20strong_20_3a_3',['<strong>Create an instance of DBSCAN:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md26',1,'']]], ['decimal_5fpoint_4',['decimal_point',['../classdetail_1_1serializer.html#a5f01fcbf64cb1e5f36d8853ebcd96412',1,'detail::serializer']]], ['decode_5',['decode',['../classhuffman.html#aa536c8708c473ce1bfce04f29e69f623',1,'huffman']]], - ['decode_20strong_20_3a_6',['<strong>decode</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html#autotoc_md51',1,'']]], + ['decode_20strong_20_3a_6',['<strong>decode</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html#autotoc_md52',1,'']]], ['decomposer_7',['Decomposer',['../struct_catch_1_1_decomposer.html',1,'Catch']]], ['default_5fobject_5fcomparator_5ft_8',['default_object_comparator_t',['../classbasic__json.html#a991d005e7f648cbf37bb36daf85183ca',1,'basic_json']]], ['deprecated_20list_9',['Deprecated List',['../deprecated.html',1,'']]], @@ -15,11 +15,11 @@ var searchData= ['detail_12',['detail',['../namespacedetail.html',1,'']]], ['detail_3a_3adtoa_5fimpl_13',['dtoa_impl',['../namespacedetail_1_1dtoa__impl.html',1,'detail']]], ['detection_20namespace_14',['Mini tutorial for edge detection namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html',1,'']]], - ['detection_20with_20sobel_20function_20strong_20_3a_15',['<strong>Perform edge detection with Sobel() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md47',1,'']]], + ['detection_20with_20sobel_20function_20strong_20_3a_15',['<strong>Perform edge detection with Sobel() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md48',1,'']]], ['detector_16',['detector',['../structdetail_1_1detector.html',1,'detail']]], ['detector_3c_20default_2c_20void_5ft_3c_20op_3c_20args_2e_2e_2e_20_3e_20_3e_2c_20op_2c_20args_2e_2e_2e_20_3e_17',['detector< Default, void_t< Op< Args... > >, Op, Args... >',['../structdetail_1_1detector_3_01_default_00_01void__t_3_01_op_3_01_args_8_8_8_01_4_01_4_00_01_op_00_01_args_8_8_8_01_4.html',1,'detail']]], ['dfs_18',['dfs',['../classgraph.html#a552cbdacd1d280bdaa5400e9edeb10a9',1,'graph::dfs()'],['../classweighted__graph.html#ad24e575e96678198f7750640a533cc12',1,'weighted_graph::dfs()']]], - ['dfs_20strong_20_3a_19',['<strong>DFS</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md34',1,'']]], + ['dfs_20strong_20_3a_19',['<strong>DFS</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html#autotoc_md35',1,'']]], ['diff_20',['diff',['../classbasic__json.html#a699ef418df577e75f28dfce6b04d6c2f',1,'basic_json']]], ['difference_5ftype_21',['difference_type',['../classdetail_1_1iter__impl.html#a6d51e1372282929d1c240223aa973c6e',1,'detail::iter_impl::difference_type'],['../classbasic__json.html#ae45e8f7ce7c3e62035cd097a39910399',1,'basic_json::difference_type']]], ['discarded_22',['discarded',['../namespacedetail.html#a917c3efabea8a20dc72d9ae2c673d632a94708897ec9db8647dfe695714c98e46',1,'detail']]], diff --git a/docs/html/search/all_a.js b/docs/html/search/all_a.js index 13e3a7c4..3e7a158d 100644 --- a/docs/html/search/all_a.js +++ b/docs/html/search/all_a.js @@ -1,14 +1,14 @@ var searchData= [ - ['e_20get_20a_20and_20b_20of_20y_20_3a_20strong_0',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md115',1,'']]], + ['e_20get_20a_20and_20b_20of_20y_20_3a_20strong_0',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md119',1,'']]], ['edge_20detection_20namespace_1',['Mini tutorial for edge detection namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html',1,'']]], - ['edge_20detection_20with_20sobel_20function_20strong_20_3a_2',['<strong>Perform edge detection with Sobel() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md47',1,'']]], + ['edge_20detection_20with_20sobel_20function_20strong_20_3a_2',['<strong>Perform edge detection with Sobel() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md48',1,'']]], ['elements_3',['elements',['../classcircular__linked__list.html#a539edebbf066da0d2aaf90a06a82d045',1,'circular_linked_list::elements()'],['../classdoubly__linked__list.html#af7ef1ea3c8d19ca5f42118600e5d92cd',1,'doubly_linked_list::elements()'],['../classfrequency__list.html#a653e897a061321234930d38331b8028f',1,'frequency_list::elements()'],['../classlinked__list.html#aea64a6c4db632c0569f66a753c3003af',1,'linked_list::elements()']]], - ['elements_20strong_20_3a_4',['Elements strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md61',1,'<strong>elements</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md70',1,'<strong>elements</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md87',1,'<strong>elements</strong>:']]], + ['elements_20strong_20_3a_4',['Elements strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md65',1,'<strong>elements</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md74',1,'<strong>elements</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md91',1,'<strong>elements</strong>:']]], ['emplace_5',['emplace',['../classbasic__json.html#af298488e59ff260d2ca950070cf19196',1,'basic_json']]], ['emplace_5fback_6',['emplace_back',['../classbasic__json.html#ac5f0a15957842b188826aea98a9cfd3d',1,'basic_json']]], ['empty_7',['empty',['../classgraph.html#ae1202555cd550bdc9654ed9b43584066',1,'graph::empty()'],['../classweighted__graph.html#a87a3e7e1b00794bcaf369e3802b63069',1,'weighted_graph::empty()'],['../classcircular__linked__list.html#afa30d61d17468c5b52b2c70cdd87228f',1,'circular_linked_list::empty()'],['../classdoubly__linked__list.html#a818f06a2233ae79b9de46179a008ae4a',1,'doubly_linked_list::empty()'],['../classfrequency__list.html#a19591103ff1fb820f19d5f7afe0959d5',1,'frequency_list::empty()'],['../classlinked__list.html#a940c4b88fc93e92e5518134b0001208c',1,'linked_list::empty()'],['../classtrie.html#ad581a02dd94fc7d214f5488bb02fe4ee',1,'trie::empty()'],['../classjson__pointer.html#a5c3d08bd0a0e99c3377db33600c68a64',1,'json_pointer::empty()'],['../classbasic__json.html#ac1e01c92bcf41fb7d857f72e5de7ca11',1,'basic_json::empty()']]], - ['empty_20strong_8',['<strong>empty</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md79',1,'']]], + ['empty_20strong_8',['<strong>empty</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md83',1,'']]], ['end_9',['end',['../classcircular__linked__list.html#ac44983a3c6787b338f41f99edcdfabf9',1,'circular_linked_list::end()'],['../classdoubly__linked__list.html#a0ce9b9113a172c246e556672921f8a0f',1,'doubly_linked_list::end()'],['../classfrequency__list.html#a93d3b2b7e804127efecb9005ae3b16a9',1,'frequency_list::end()'],['../classlinked__list.html#a77f0b9fe3aeef4ca425847cec358a796',1,'linked_list::end()'],['../classskip__list.html#a296bad7f6368effc2d9a546f004a5ab0',1,'skip_list::end()'],['../classdequeue__list.html#ab1968140a2b3e830f3f9229051d3fd2b',1,'dequeue_list::end()'],['../classstack__list.html#a53037d6540ac5dbe9582c68af99b3139',1,'stack_list::end()'],['../classavl__tree.html#a015ac0902d879a52fd7a8940ab36ab7a',1,'avl_tree::end()'],['../classbst.html#aa3db0ba407a005ce61feb9c605bbb187',1,'bst::end()'],['../classinterval__tree.html#a04dd9337397e8afe44810c1169ac64b7',1,'interval_tree::end()'],['../class_mat1d.html#afc8be35e7db23060bdf1709b32eb3079',1,'Mat1d::end()'],['../class_mat2d.html#a926a8c7a4f4ebe62debbdc1659454c8b',1,'Mat2d::end()'],['../classdetail_1_1iteration__proxy.html#a1037b697552341a5697fa15ee95250d1',1,'detail::iteration_proxy::end()'],['../classbasic__json.html#a4dbc83213b31a171aa8ba65ff00fa954',1,'basic_json::end() noexcept'],['../classbasic__json.html#a0c10232619bee4e73749dae621c01376',1,'basic_json::end() const noexcept']]], ['end_5farray_10',['end_array',['../structjson__sax.html#a81fbddbf7dc96eab21ef916625ad5f3b',1,'json_sax::end_array()'],['../classdetail_1_1lexer__base.html#add65fa7a85aa15052963809fbcc04540a2f3e68e7f111a1e5c7728742b3ca2b7f',1,'detail::lexer_base::end_array']]], ['end_5fobject_11',['end_object',['../structjson__sax.html#ac34854cab5e023c5d0e8b381a11aba5b',1,'json_sax::end_object()'],['../classdetail_1_1lexer__base.html#add65fa7a85aa15052963809fbcc04540a7d5b4427866814de4d8f132721d59c87',1,'detail::lexer_base::end_object']]], @@ -20,7 +20,7 @@ var searchData= ['enuminfo_17',['EnumInfo',['../struct_catch_1_1_detail_1_1_enum_info.html',1,'Catch::Detail']]], ['equalsmatcher_18',['EqualsMatcher',['../struct_catch_1_1_matchers_1_1_std_string_1_1_equals_matcher.html',1,'Catch::Matchers::StdString::EqualsMatcher'],['../struct_catch_1_1_matchers_1_1_vector_1_1_equals_matcher.html',1,'Catch::Matchers::Vector::EqualsMatcher< T, AllocComp, AllocMatch >']]], ['erase_19',['erase',['../classcircular__linked__list.html#a5b325ae99060b57f15ca46ec4d9d22de',1,'circular_linked_list::erase()'],['../classdoubly__linked__list.html#afdab563c67f317578ea7839150c0f5f7',1,'doubly_linked_list::erase()'],['../classfrequency__list.html#a28e06d771a5e94b17abff407ddb4bb82',1,'frequency_list::erase()'],['../classlinked__list.html#a51f423f30e8e01fdc8ee72d952b3ec3f',1,'linked_list::erase()'],['../classbasic__json.html#a7d0fef086b1b72372113db6ce7446189',1,'basic_json::erase(IteratorType pos)'],['../classbasic__json.html#a437b81c6e968a4192a22bc0de6c4df80',1,'basic_json::erase(IteratorType first, IteratorType last)'],['../classbasic__json.html#a05da3b93f2d4a7164589abffaa9acb33',1,'basic_json::erase(const typename object_t::key_type &key)'],['../classbasic__json.html#a5f763336e84232f38e2d80e142f9820e',1,'basic_json::erase(KeyType &&key)'],['../classbasic__json.html#ac2c58b5f34c2ff56e27630214f5a9df4',1,'basic_json::erase(const size_type idx)']]], - ['erase_20strong_20_3a_20',['Erase strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md58',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md67',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md78',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md84',1,'<strong>erase</strong>:']]], + ['erase_20strong_20_3a_20',['Erase strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md62',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md71',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md82',1,'<strong>erase</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md88',1,'<strong>erase</strong>:']]], ['error_21',['error',['../namespacedetail.html#a7c070b2bf3d61e3d8b8013f6fb18d592acb5e100e5a9a3e7f6d1fd97512215282',1,'detail']]], ['error_5fhandler_22',['error_handler',['../classdetail_1_1serializer.html#a79d25c7416dd71a0db8b10988ec360f7',1,'detail::serializer']]], ['error_5fhandler_5ft_23',['error_handler_t',['../classbasic__json.html#a2ebde9badb4f1b4cf6517f6b8e302d0d',1,'basic_json::error_handler_t'],['../namespacedetail.html#abe7cfa1fd8fa706ff4392bff9d1a8298',1,'detail::error_handler_t']]], diff --git a/docs/html/search/all_b.js b/docs/html/search/all_b.js index 3e36dce9..c57671e3 100644 --- a/docs/html/search/all_b.js +++ b/docs/html/search/all_b.js @@ -1,10 +1,10 @@ var searchData= [ ['fallback_0',['Fallback',['../structmatplotlibcpp_1_1detail_1_1is__callable__impl_3_01true_00_01_t_01_4_1_1_fallback.html',1,'matplotlibcpp::detail::is_callable_impl< true, T >']]], - ['file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_1',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_2',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], + ['file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_1',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_2',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], ['file_5finput_5fadapter_3',['file_input_adapter',['../classdetail_1_1file__input__adapter.html',1,'detail']]], - ['filter_20namespace_4',['Mini tutorial for median filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'']]], + ['filter_20namespace_4',['filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'Mini tutorial for median filter namespace'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html',1,'Mini tutorial for sharpening filter namespace']]], ['filtergenerator_5',['FilterGenerator',['../class_catch_1_1_generators_1_1_filter_generator.html',1,'Catch::Generators']]], ['find_6',['find',['../classdsu.html#acdd4a28e59cfa897185bc28b39d85e50',1,'dsu::find()'],['../classbasic__json.html#a727e3cfb5a874314d8deb12cb53a8105',1,'basic_json::find(const typename object_t::key_type &key)'],['../classbasic__json.html#a7bf93ae61eb63a9e543cafb3f723900c',1,'basic_json::find(const typename object_t::key_type &key) const'],['../classbasic__json.html#a89dd769ce700326266883ba96a98a8f2',1,'basic_json::find(KeyType &&key)'],['../classbasic__json.html#afe1bb257797042aef7142c91f35390d8',1,'basic_json::find(KeyType &&key) const']]], ['find_5flargest_5fpow10_7',['find_largest_pow10',['../namespacedetail_1_1dtoa__impl.html#a04eb234a28617519974fc962cd4da666',1,'detail::dtoa_impl']]], @@ -21,34 +21,35 @@ var searchData= ['for_20linear_20regression_20class_18',['Mini tutorial for linear regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html',1,'']]], ['for_20median_20filter_20namespace_19',['Mini tutorial for median filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'']]], ['for_20polynomial_20regression_20class_20',['Mini tutorial for polynomial regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html',1,'']]], - ['for_20single_20linked_20list_20class_21',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], - ['for_20the_20avl_20tree_20class_22',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], - ['for_20the_20bst_20class_23',['Mini Tutorial for the BST class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html',1,'']]], - ['for_20the_20frequency_5flist_20class_24',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]], - ['for_20the_20graph_20class_25',['Mini Tutorial for the Graph class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html',1,'']]], - ['for_20the_20hash_5ftable_20class_26',['Mini Tutorial for the hash_table class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html',1,'']]], - ['for_20the_20interval_20tree_20class_27',['Mini Tutorial for the Interval Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html',1,'']]], - ['for_20the_20skip_20list_20class_28',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], - ['for_20the_20splay_20tree_20class_29',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], - ['for_20the_20stack_20class_30',['for the Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], - ['for_20the_20trie_20class_31',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]], - ['for_20visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_32',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['for_20visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_33',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], - ['for_20visualization_20purposes_3a_20strong_34',['For visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md116',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md119',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], - ['format_5fbuffer_35',['format_buffer',['../namespacedetail_1_1dtoa__impl.html#afab91abfdd1cdf43cc2fcd5b9c4a7456',1,'detail::dtoa_impl']]], - ['frequency_5flist_36',['frequency_list',['../classfrequency__list.html',1,'frequency_list< T >'],['../classfrequency__list.html#af16fc0a50630362eb454b8d3694c6bb0',1,'frequency_list::frequency_list(std::vector< T > data={}) noexcept'],['../classfrequency__list.html#aa5aa5354547f92e9dd35ec45558a5ae1',1,'frequency_list::frequency_list(const frequency_list< T > &list)']]], - ['frequency_5flist_20class_37',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]], - ['from_20linear_20regression_20i_20e_20get_20a_20and_20b_20of_20y_20_3a_20strong_38',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md115',1,'']]], - ['from_5fbjdata_39',['from_bjdata',['../classbasic__json.html#a59327f708c0555e2928487bcddf71293',1,'basic_json::from_bjdata(InputType &&i, const bool strict=true, const bool allow_exceptions=true)'],['../classbasic__json.html#accf7ae6f9b2fee171484c5ef54f08d1e',1,'basic_json::from_bjdata(IteratorType first, IteratorType last, const bool strict=true, const bool allow_exceptions=true)']]], - ['from_5fbson_40',['from_bson',['../classbasic__json.html#a4b0dfca88b11ea59a2568707767622d8',1,'basic_json::from_bson(InputType &&i, const bool strict=true, const bool allow_exceptions=true)'],['../classbasic__json.html#a2513159e8df9a81bf03ed34e1147b42e',1,'basic_json::from_bson(IteratorType first, IteratorType last, const bool strict=true, const bool allow_exceptions=true)']]], - ['from_5fcbor_41',['from_cbor',['../classbasic__json.html#a5bc3c67eaf6e9b22c8b446f9695249e9',1,'basic_json::from_cbor(InputType &&i, const bool strict=true, const bool allow_exceptions=true, const cbor_tag_handler_t tag_handler=cbor_tag_handler_t::error)'],['../classbasic__json.html#a08ab03513b96f5a864bf623aeb70f122',1,'basic_json::from_cbor(IteratorType first, IteratorType last, const bool strict=true, const bool allow_exceptions=true, const cbor_tag_handler_t tag_handler=cbor_tag_handler_t::error)']]], - ['from_5fjson_42',['from_json',['../structadl__serializer.html#a5645c63fe43bd9b4ebc9917f9c99d0fd',1,'adl_serializer::from_json(BasicJsonType &&j, TargetType &val) noexcept(noexcept(::nlohmann::from_json(std::forward< BasicJsonType >(j), val))) -> decltype(::nlohmann::from_json(std::forward< BasicJsonType >(j), val), void())'],['../structadl__serializer.html#a1e06f0bcb63296fc306dbe4162a0f2a3',1,'adl_serializer::from_json(BasicJsonType &&j) noexcept(noexcept(::nlohmann::from_json(std::forward< BasicJsonType >(j), detail::identity_tag< TargetType > {}))) -> decltype(::nlohmann::from_json(std::forward< BasicJsonType >(j), detail::identity_tag< TargetType > {}))']]], - ['from_5fjson_5ffn_43',['from_json_fn',['../structdetail_1_1from__json__fn.html',1,'detail']]], - ['from_5fmsgpack_44',['from_msgpack',['../classbasic__json.html#ab0c025488572f913ca5529a2ef62d066',1,'basic_json::from_msgpack(InputType &&i, const bool strict=true, const bool allow_exceptions=true)'],['../classbasic__json.html#af7d84b161b2d93f9b2b3ac8d68afeb96',1,'basic_json::from_msgpack(IteratorType first, IteratorType last, const bool strict=true, const bool allow_exceptions=true)']]], - ['from_5fubjson_45',['from_ubjson',['../classbasic__json.html#a4588941095d03624ada4f0023d93944a',1,'basic_json::from_ubjson(InputType &&i, const bool strict=true, const bool allow_exceptions=true)'],['../classbasic__json.html#a5dd7470a3be83b27cf162c0261e6b63d',1,'basic_json::from_ubjson(IteratorType first, IteratorType last, const bool strict=true, const bool allow_exceptions=true)']]], - ['front_46',['front',['../classdequeue__list.html#a7a9f8326f96b1a42057ef0ec2a020a39',1,'dequeue_list::front()'],['../classbasic__json.html#ad4dd162b4990cfb69925193797415f7e',1,'basic_json::front()'],['../classbasic__json.html#a162089e94f24182ba3e4484be63c0c1a',1,'basic_json::front() const']]], - ['front_20strong_20_3a_47',['<strong>front</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md98',1,'']]], - ['full_20documentation_20a_20href_20https_3a_20csrt_20ntua_20github_20io_20algoplus_20here_20a_20strong_48',['<strong>See the full documentation <a href="https://csrt-ntua.github.io/AlgoPlus/" >here</a></strong>',['../index.html#autotoc_md17',1,'']]], - ['function_20strong_20_3a_49',['Function strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md53',1,'<strong>How to perform the masking using apply_median_filter() function</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md47',1,'<strong>Perform edge detection with Sobel() function</strong>:']]], - ['function_3a_20strong_20_3a_50',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]] + ['for_20sharpening_20filter_20namespace_21',['Mini tutorial for sharpening filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html',1,'']]], + ['for_20single_20linked_20list_20class_22',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], + ['for_20the_20avl_20tree_20class_23',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], + ['for_20the_20bst_20class_24',['Mini Tutorial for the BST class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html',1,'']]], + ['for_20the_20frequency_5flist_20class_25',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]], + ['for_20the_20graph_20class_26',['Mini Tutorial for the Graph class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html',1,'']]], + ['for_20the_20hash_5ftable_20class_27',['Mini Tutorial for the hash_table class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html',1,'']]], + ['for_20the_20interval_20tree_20class_28',['Mini Tutorial for the Interval Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html',1,'']]], + ['for_20the_20skip_20list_20class_29',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], + ['for_20the_20splay_20tree_20class_30',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], + ['for_20the_20stack_20class_31',['for the Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], + ['for_20the_20trie_20class_32',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]], + ['for_20visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_33',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['for_20visualization_20purposes_20you_20can_20write_20to_20a_20json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_34',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], + ['for_20visualization_20purposes_3a_20strong_35',['For visualization purposes: strong',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md120',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md123',1,'<strong>Optionally you can use python's matplotlib for visualization purposes:</strong>']]], + ['format_5fbuffer_36',['format_buffer',['../namespacedetail_1_1dtoa__impl.html#afab91abfdd1cdf43cc2fcd5b9c4a7456',1,'detail::dtoa_impl']]], + ['frequency_5flist_37',['frequency_list',['../classfrequency__list.html',1,'frequency_list< T >'],['../classfrequency__list.html#af16fc0a50630362eb454b8d3694c6bb0',1,'frequency_list::frequency_list(std::vector< T > data={}) noexcept'],['../classfrequency__list.html#aa5aa5354547f92e9dd35ec45558a5ae1',1,'frequency_list::frequency_list(const frequency_list< T > &list)']]], + ['frequency_5flist_20class_38',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]], + ['from_20linear_20regression_20i_20e_20get_20a_20and_20b_20of_20y_20_3a_20strong_39',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md119',1,'']]], + ['from_5fbjdata_40',['from_bjdata',['../classbasic__json.html#a59327f708c0555e2928487bcddf71293',1,'basic_json::from_bjdata(InputType &&i, const bool strict=true, const bool allow_exceptions=true)'],['../classbasic__json.html#accf7ae6f9b2fee171484c5ef54f08d1e',1,'basic_json::from_bjdata(IteratorType first, IteratorType last, const bool strict=true, const bool allow_exceptions=true)']]], + ['from_5fbson_41',['from_bson',['../classbasic__json.html#a4b0dfca88b11ea59a2568707767622d8',1,'basic_json::from_bson(InputType &&i, const bool strict=true, const bool allow_exceptions=true)'],['../classbasic__json.html#a2513159e8df9a81bf03ed34e1147b42e',1,'basic_json::from_bson(IteratorType first, IteratorType last, const bool strict=true, const bool allow_exceptions=true)']]], + ['from_5fcbor_42',['from_cbor',['../classbasic__json.html#a5bc3c67eaf6e9b22c8b446f9695249e9',1,'basic_json::from_cbor(InputType &&i, const bool strict=true, const bool allow_exceptions=true, const cbor_tag_handler_t tag_handler=cbor_tag_handler_t::error)'],['../classbasic__json.html#a08ab03513b96f5a864bf623aeb70f122',1,'basic_json::from_cbor(IteratorType first, IteratorType last, const bool strict=true, const bool allow_exceptions=true, const cbor_tag_handler_t tag_handler=cbor_tag_handler_t::error)']]], + ['from_5fjson_43',['from_json',['../structadl__serializer.html#a5645c63fe43bd9b4ebc9917f9c99d0fd',1,'adl_serializer::from_json(BasicJsonType &&j, TargetType &val) noexcept(noexcept(::nlohmann::from_json(std::forward< BasicJsonType >(j), val))) -> decltype(::nlohmann::from_json(std::forward< BasicJsonType >(j), val), void())'],['../structadl__serializer.html#a1e06f0bcb63296fc306dbe4162a0f2a3',1,'adl_serializer::from_json(BasicJsonType &&j) noexcept(noexcept(::nlohmann::from_json(std::forward< BasicJsonType >(j), detail::identity_tag< TargetType > {}))) -> decltype(::nlohmann::from_json(std::forward< BasicJsonType >(j), detail::identity_tag< TargetType > {}))']]], + ['from_5fjson_5ffn_44',['from_json_fn',['../structdetail_1_1from__json__fn.html',1,'detail']]], + ['from_5fmsgpack_45',['from_msgpack',['../classbasic__json.html#ab0c025488572f913ca5529a2ef62d066',1,'basic_json::from_msgpack(InputType &&i, const bool strict=true, const bool allow_exceptions=true)'],['../classbasic__json.html#af7d84b161b2d93f9b2b3ac8d68afeb96',1,'basic_json::from_msgpack(IteratorType first, IteratorType last, const bool strict=true, const bool allow_exceptions=true)']]], + ['from_5fubjson_46',['from_ubjson',['../classbasic__json.html#a4588941095d03624ada4f0023d93944a',1,'basic_json::from_ubjson(InputType &&i, const bool strict=true, const bool allow_exceptions=true)'],['../classbasic__json.html#a5dd7470a3be83b27cf162c0261e6b63d',1,'basic_json::from_ubjson(IteratorType first, IteratorType last, const bool strict=true, const bool allow_exceptions=true)']]], + ['front_47',['front',['../classdequeue__list.html#a7a9f8326f96b1a42057ef0ec2a020a39',1,'dequeue_list::front()'],['../classbasic__json.html#ad4dd162b4990cfb69925193797415f7e',1,'basic_json::front()'],['../classbasic__json.html#a162089e94f24182ba3e4484be63c0c1a',1,'basic_json::front() const']]], + ['front_20strong_20_3a_48',['<strong>front</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md102',1,'']]], + ['full_20documentation_20a_20href_20https_3a_20csrt_20ntua_20github_20io_20algoplus_20here_20a_20strong_49',['<strong>See the full documentation <a href="https://csrt-ntua.github.io/AlgoPlus/" >here</a></strong>',['../index.html#autotoc_md17',1,'']]], + ['function_20strong_20_3a_50',['Function strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md54',1,'<strong>How to perform the masking using apply_median_filter() function</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html#autotoc_md57',1,'<strong>How to perform the masking using apply_sharpening_filter() function</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html#autotoc_md48',1,'<strong>Perform edge detection with Sobel() function</strong>:']]], + ['function_3a_20strong_20_3a_51',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]] ]; diff --git a/docs/html/search/all_c.js b/docs/html/search/all_c.js index 3b4f9f4f..9b4f159e 100644 --- a/docs/html/search/all_c.js +++ b/docs/html/search/all_c.js @@ -8,12 +8,12 @@ var searchData= ['generatorwrapper_5',['GeneratorWrapper',['../class_catch_1_1_generators_1_1_generator_wrapper.html',1,'Catch::Generators']]], ['generatorwrapper_3c_20u_20_3e_6',['GeneratorWrapper< U >',['../class_catch_1_1_generators_1_1_generator_wrapper.html',1,'Catch::Generators']]], ['get_7',['get',['../classbasic__json.html#a0ab31c7fdbab38898070bca01637f886',1,'basic_json::get() const noexcept(noexcept(std::declval< const basic_json_t & >().template get_impl< ValueType >(detail::priority_tag< 4 > {}))) -> decltype(std::declval< const basic_json_t & >().template get_impl< ValueType >(detail::priority_tag< 4 > {}))'],['../classbasic__json.html#ab11f66d4edc50a209fab3f8c48664a53',1,'basic_json::get() noexcept -> decltype(std::declval< basic_json_t & >().template get_ptr< PointerType >())']]], - ['get_20a_20and_20b_20of_20y_20_3a_20strong_8',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md115',1,'']]], - ['get_20assignments_20and_20cluster_20centers_3a_20strong_20_3a_9',['<strong>Get assignments and cluster centers:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md31',1,'']]], - ['get_20assignments_20with_20dbscan_20clustering_3a_20strong_20_3a_10',['<strong>Get assignments with DBSCAN clustering:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md26',1,'']]], - ['get_20coefficients_20strong_11',['<strong>Get coefficients</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md118',1,'']]], - ['get_20noise_20with_20dbscan_20clustering_3a_20strong_20_3a_12',['<strong>Get noise with DBSCAN clustering:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md27',1,'']]], - ['get_20results_20from_20linear_20regression_20i_20e_20get_20a_20and_20b_20of_20y_20_3a_20strong_13',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md115',1,'']]], + ['get_20a_20and_20b_20of_20y_20_3a_20strong_8',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md119',1,'']]], + ['get_20assignments_20and_20cluster_20centers_3a_20strong_20_3a_9',['<strong>Get assignments and cluster centers:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], + ['get_20assignments_20with_20dbscan_20clustering_3a_20strong_20_3a_10',['<strong>Get assignments with DBSCAN clustering:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md27',1,'']]], + ['get_20coefficients_20strong_11',['<strong>Get coefficients</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html#autotoc_md122',1,'']]], + ['get_20noise_20with_20dbscan_20clustering_3a_20strong_20_3a_12',['<strong>Get noise with DBSCAN clustering:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], + ['get_20results_20from_20linear_20regression_20i_20e_20get_20a_20and_20b_20of_20y_20_3a_20strong_13',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md119',1,'']]], ['get_5f2d_5farray_14',['get_2d_array',['../class_image.html#ad70be146565fdfd89e6f061a80f6e348',1,'Image']]], ['get_5fallocator_15',['get_allocator',['../classbasic__json.html#a4bceecf563151eb58af179416d8e6299',1,'basic_json']]], ['get_5fbinary_16',['get_binary',['../classbasic__json.html#aaa2432a7c01833b02c6330709211ede7',1,'basic_json::get_binary()'],['../classbasic__json.html#a67d6da9fb8325a87d9513f960d88512a',1,'basic_json::get_binary() const']]], @@ -22,7 +22,7 @@ var searchData= ['get_5fclusters_19',['get_clusters',['../class_d_b_s_c_a_n.html#aad8e927fe18f379b2c0cf65e9008ab42',1,'DBSCAN']]], ['get_5ferror_5fmessage_20',['get_error_message',['../classdetail_1_1lexer.html#a412c108d8b931630d54e42fbbf764fc4',1,'detail::lexer']]], ['get_5ffrequency_21',['get_frequency',['../classfrequency__list.html#a2b6e523e09744bac89657803d9984d34',1,'frequency_list']]], - ['get_5ffrequency_20strong_20_3a_22',['<strong>get_frequency</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md77',1,'']]], + ['get_5ffrequency_20strong_20_3a_22',['<strong>get_frequency</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md81',1,'']]], ['get_5fmax_23',['get_max',['../classdsu.html#ac163ca40183c6c72422d95124344feb8',1,'dsu']]], ['get_5fmin_24',['get_min',['../classdsu.html#a64902f4fb5cc8d65bdbaa284bec8db11',1,'dsu']]], ['get_5fnoise_25',['get_noise',['../class_d_b_s_c_a_n.html#ac9cfb1bc65f74713a0e3e0ec5a42a0a4',1,'DBSCAN']]], diff --git a/docs/html/search/all_d.js b/docs/html/search/all_d.js index 1b960bdb..147376bd 100644 --- a/docs/html/search/all_d.js +++ b/docs/html/search/all_d.js @@ -13,19 +13,21 @@ var searchData= ['hash_3c_20nlohmann_3a_3anlohmann_5fbasic_5fjson_5ftpl_20_3e_10',['hash< nlohmann::NLOHMANN_BASIC_JSON_TPL >',['../structstd_1_1hash_3_01nlohmann_1_1_n_l_o_h_m_a_n_n___b_a_s_i_c___j_s_o_n___t_p_l_01_4.html',1,'std']]], ['hash_5ftable_11',['hash_table',['../classhash__table.html',1,'hash_table< KeyType, ValueType >'],['../classhash__table.html#adc831edf9651d7a2858e79624417749f',1,'hash_table::hash_table(std::vector< std::pair< KeyType, ValueType > > v={})'],['../classhash__table.html#a72b8facb5a3c01227e96ca3cda64fa14',1,'hash_table::hash_table(const hash_table &h)']]], ['hash_5ftable_20class_12',['Mini Tutorial for the hash_table class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html',1,'']]], - ['hash_5ftable_3a_20strong_20_3a_13',['<strong>Create an instance of the hash_table:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md104',1,'']]], + ['hash_5ftable_3a_20strong_20_3a_13',['<strong>Create an instance of the hash_table:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md108',1,'']]], ['heapify_14',['heapify',['../classmin__heap.html#a624dfa9812a698548226a6dbcfe2c6cc',1,'min_heap']]], ['here_20a_20strong_15',['<strong>See the full documentation <a href="https://csrt-ntua.github.io/AlgoPlus/" >here</a></strong>',['../index.html#autotoc_md17',1,'']]], ['hill_5fclimbing_16',['hill_climbing',['../classhill__climbing.html',1,'hill_climbing< T >'],['../classhill__climbing.html#a741bc35d951ed45a23a3969f6ab58c19',1,'hill_climbing::hill_climbing()']]], - ['how_20do_20i_20write_20unit_20tests_17',['How do i write unit tests?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_u_n_i_t___t_e_s_t_s.html',1,'']]], - ['how_20should_20i_20comment_20my_20code_18',['How should i comment my code?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_m_m_e_n_t_s.html',1,'']]], - ['how_20to_20contribute_19',['How to contribute',['../index.html#autotoc_md23',1,'How to contribute'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_n_t_r_i_b_u_t_e.html',1,'How to contribute?']]], - ['how_20to_20perform_20the_20masking_20using_20apply_5fmedian_5ffilter_20function_20strong_20_3a_20',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md53',1,'']]], - ['how_20to_20run_20test_20cases_20strong_21',['<strong>How to run test cases</strong>',['../index.html#autotoc_md21',1,'']]], - ['href_20https_3a_20csrt_20ntua_20github_20io_20algoplus_20here_20a_20strong_22',['<strong>See the full documentation <a href="https://csrt-ntua.github.io/AlgoPlus/" >here</a></strong>',['../index.html#autotoc_md17',1,'']]], - ['href_20https_3a_20discord_20gg_20m9nyv4mhz6_20join_20a_20our_20discord_20strong_23',['<strong><a href="https://discord.gg/M9nYv4MHz6" >Join</a> our Discord</strong>',['../index.html#autotoc_md18',1,'']]], - ['https_3a_20csrt_20ntua_20github_20io_20algoplus_20here_20a_20strong_24',['<strong>See the full documentation <a href="https://csrt-ntua.github.io/AlgoPlus/" >here</a></strong>',['../index.html#autotoc_md17',1,'']]], - ['https_3a_20discord_20gg_20m9nyv4mhz6_20join_20a_20our_20discord_20strong_25',['<strong><a href="https://discord.gg/M9nYv4MHz6" >Join</a> our Discord</strong>',['../index.html#autotoc_md18',1,'']]], - ['huffman_26',['huffman',['../classhuffman.html',1,'huffman'],['../classhuffman.html#a4176a6a290865292d5946440a1d9f39c',1,'huffman::huffman()']]], - ['huffman_20coding_20class_27',['Mini tutorial for huffman coding class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html',1,'']]] + ['history_17',['Star History',['../index.html#autotoc_md24',1,'']]], + ['how_20do_20i_20write_20unit_20tests_18',['How do i write unit tests?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_u_n_i_t___t_e_s_t_s.html',1,'']]], + ['how_20should_20i_20comment_20my_20code_19',['How should i comment my code?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_m_m_e_n_t_s.html',1,'']]], + ['how_20to_20contribute_20',['How to contribute',['../index.html#autotoc_md23',1,'How to contribute'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_n_t_r_i_b_u_t_e.html',1,'How to contribute?']]], + ['how_20to_20perform_20the_20masking_20using_20apply_5fmedian_5ffilter_20function_20strong_20_3a_21',['<strong>How to perform the masking using apply_median_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html#autotoc_md54',1,'']]], + ['how_20to_20perform_20the_20masking_20using_20apply_5fsharpening_5ffilter_20function_20strong_20_3a_22',['<strong>How to perform the masking using apply_sharpening_filter() function</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html#autotoc_md57',1,'']]], + ['how_20to_20run_20test_20cases_20strong_23',['<strong>How to run test cases</strong>',['../index.html#autotoc_md21',1,'']]], + ['href_20https_3a_20csrt_20ntua_20github_20io_20algoplus_20here_20a_20strong_24',['<strong>See the full documentation <a href="https://csrt-ntua.github.io/AlgoPlus/" >here</a></strong>',['../index.html#autotoc_md17',1,'']]], + ['href_20https_3a_20discord_20gg_20m9nyv4mhz6_20join_20a_20our_20discord_20strong_25',['<strong><a href="https://discord.gg/M9nYv4MHz6" >Join</a> our Discord</strong>',['../index.html#autotoc_md18',1,'']]], + ['https_3a_20csrt_20ntua_20github_20io_20algoplus_20here_20a_20strong_26',['<strong>See the full documentation <a href="https://csrt-ntua.github.io/AlgoPlus/" >here</a></strong>',['../index.html#autotoc_md17',1,'']]], + ['https_3a_20discord_20gg_20m9nyv4mhz6_20join_20a_20our_20discord_20strong_27',['<strong><a href="https://discord.gg/M9nYv4MHz6" >Join</a> our Discord</strong>',['../index.html#autotoc_md18',1,'']]], + ['huffman_28',['huffman',['../classhuffman.html',1,'huffman'],['../classhuffman.html#a4176a6a290865292d5946440a1d9f39c',1,'huffman::huffman()']]], + ['huffman_20coding_20class_29',['Mini tutorial for huffman coding class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2huffman__coding.html',1,'']]] ]; diff --git a/docs/html/search/all_e.js b/docs/html/search/all_e.js index 92fd807b..21398af5 100644 --- a/docs/html/search/all_e.js +++ b/docs/html/search/all_e.js @@ -1,7 +1,7 @@ var searchData= [ ['i_20comment_20my_20code_0',['How should i comment my code?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_m_m_e_n_t_s.html',1,'']]], - ['i_20e_20get_20a_20and_20b_20of_20y_20_3a_20strong_1',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md115',1,'']]], + ['i_20e_20get_20a_20and_20b_20of_20y_20_3a_20strong_1',['<strong>Get results from linear regression(i.e. get a and b of y):</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html#autotoc_md119',1,'']]], ['i_20write_20unit_20tests_2',['How do i write unit tests?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_u_n_i_t___t_e_s_t_s.html',1,'']]], ['iconfig_3',['IConfig',['../struct_catch_1_1_i_config.html',1,'Catch']]], ['icontext_4',['IContext',['../struct_catch_1_1_i_context.html',1,'Catch']]], @@ -23,16 +23,16 @@ var searchData= ['indent_5fstring_20',['indent_string',['../classdetail_1_1serializer.html#a7f6f1d36859514ab42984deb28d2521e',1,'detail::serializer']]], ['initializer_5flist_5ft_21',['initializer_list_t',['../classbasic__json.html#a6dc15c0f6c156e43c956ad6ca0c19de3',1,'basic_json']]], ['inorder_22',['inorder',['../classavl__tree.html#aef655e5753555d705e58d39bd094c55a',1,'avl_tree::inorder()'],['../classbst.html#ab9d984aab9247a36c78b115484ccb623',1,'bst::inorder()'],['../classinterval__tree.html#a6472215cc03add0b3704c3d5e3249259',1,'interval_tree::inorder()'],['../classsplay__tree.html#a3418b2394bd2f5295edeb0444292938a',1,'splay_tree::inorder()'],['../classtree.html#a615053f451255036e64d7021faff9387',1,'tree::inorder()']]], - ['inorder_20strong_20_3a_23',['Inorder strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md124',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md133',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md143',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md152',1,'<strong>inorder</strong>:']]], + ['inorder_20strong_20_3a_23',['Inorder strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md128',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md137',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md147',1,'<strong>inorder</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md156',1,'<strong>inorder</strong>:']]], ['input_5fformat_5ft_24',['input_format_t',['../namespacedetail.html#a0ab3b338d0eadc6890b72cccef0ea04f',1,'detail']]], ['input_5fstream_5fadapter_25',['input_stream_adapter',['../classdetail_1_1input__stream__adapter.html',1,'detail']]], ['insert_26',['insert',['../classhash__table.html#a075f7fb9d5f95b828e044dc49e6386ba',1,'hash_table::insert()'],['../classmin__heap.html#a65ea47fb7a47b6db35cfc02a0d1f95be',1,'min_heap::insert()'],['../classskip__list.html#ad7a2f526cda9ab87d50b9e745222ae98',1,'skip_list::insert()'],['../classavl__tree.html#acdeb1d0610c350618d64fdb69f50ab08',1,'avl_tree::insert()'],['../classbst.html#ad7def8a09da61a43c7033365ea226d06',1,'bst::insert()'],['../classinterval__tree.html#aa850e677df1d50f7fa3b4e2a5c8cd2b2',1,'interval_tree::insert()'],['../classsplay__tree.html#a28eea5f755129c69077896c03bb0406e',1,'splay_tree::insert()'],['../classtree.html#ae03c0ad3d846d28d79eb8ba7c232570c',1,'tree::insert()'],['../classtrie.html#adb61c311b6d076114a48194cbf7e4822',1,'trie::insert()'],['../classbasic__json.html#a7f3817060c2bec896a99cb2c236b9c27',1,'basic_json::insert(const_iterator pos, const basic_json &val)'],['../classbasic__json.html#ae5da62116a40a0f86e87f11fdd54e9f0',1,'basic_json::insert(const_iterator pos, basic_json &&val)'],['../classbasic__json.html#a47b623200562da188886a385c716d101',1,'basic_json::insert(const_iterator pos, size_type cnt, const basic_json &val)'],['../classbasic__json.html#a68e1707248a00a2608a304da5ae5c911',1,'basic_json::insert(const_iterator pos, const_iterator first, const_iterator last)'],['../classbasic__json.html#abdfee6a3db80431a24c68bfaf038c47d',1,'basic_json::insert(const_iterator pos, initializer_list_t ilist)'],['../classbasic__json.html#aaf55c485c75ddd7bd5f9791e59d3aec7',1,'basic_json::insert(const_iterator first, const_iterator last)']]], - ['insert_20strong_20_3a_27',['Insert strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md91',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md105',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md121',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md130',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md139',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md149',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md158',1,'<strong>insert</strong>:']]], + ['insert_20strong_20_3a_27',['Insert strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md95',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md109',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md125',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md134',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md143',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md153',1,'<strong>insert</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html#autotoc_md162',1,'<strong>insert</strong>:']]], ['insert_5fiterator_28',['insert_iterator',['../classbasic__json.html#af8c5ca19d22a32054452470669c43bb9',1,'basic_json']]], ['insert_5fnode_29',['insert_node',['../class_a_star.html#a232158ffb1edf7515775a4a80439782c',1,'AStar::insert_node()'],['../classbest__first.html#ac6a039d4c6f83eb9707c774a325a0573',1,'best_first::insert_node()'],['../classhill__climbing.html#ac30264fd6f3b64003211c7379935199e',1,'hill_climbing::insert_node()']]], - ['instance_20of_20dbscan_3a_20strong_20_3a_30',['<strong>Create an instance of DBSCAN:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md25',1,'']]], - ['instance_20of_20kmeans_3a_20strong_20_3a_31',['<strong>Create an instance of kmeans:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md30',1,'']]], - ['instance_20of_20the_20hash_5ftable_3a_20strong_20_3a_32',['<strong>Create an instance of the hash_table:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md104',1,'']]], + ['instance_20of_20dbscan_3a_20strong_20_3a_30',['<strong>Create an instance of DBSCAN:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md26',1,'']]], + ['instance_20of_20kmeans_3a_20strong_20_3a_31',['<strong>Create an instance of kmeans:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md31',1,'']]], + ['instance_20of_20the_20hash_5ftable_3a_20strong_20_3a_32',['<strong>Create an instance of the hash_table:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md108',1,'']]], ['integer_5fsequence_33',['integer_sequence',['../structdetail_1_1integer__sequence.html',1,'detail']]], ['internal_5fiterator_34',['internal_iterator',['../structdetail_1_1internal__iterator.html',1,'detail']]], ['internal_5fiterator_3c_20typename_20std_3a_3aremove_5fconst_3c_20basicjsontype_20_3e_3a_3atype_20_3e_35',['internal_iterator< typename std::remove_const< BasicJsonType >::type >',['../structdetail_1_1internal__iterator.html',1,'detail']]], @@ -126,7 +126,7 @@ var searchData= ['is_5ftransparent_123',['is_transparent',['../structdetail_1_1is__transparent.html',1,'detail']]], ['isstreaminsertable_124',['IsStreamInsertable',['../class_catch_1_1_detail_1_1_is_stream_insertable.html',1,'Catch::Detail']]], ['istream_125',['IStream',['../struct_catch_1_1_i_stream.html',1,'Catch']]], - ['it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_126',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], + ['it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_126',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], ['items_127',['items',['../classbasic__json.html#ac12884e86980aa85b6a9ffbb8b84de6a',1,'basic_json::items() noexcept'],['../classbasic__json.html#a3f2fdaf6048ea339c901b5208b93a64d',1,'basic_json::items() const noexcept']]], ['iter_5fimpl_128',['iter_impl',['../classdetail_1_1iter__impl.html',1,'detail::iter_impl< BasicJsonType >'],['../classdetail_1_1iter__impl.html#a21ce449bdce08e15eaf8333322a81039',1,'detail::iter_impl::iter_impl(pointer object) noexcept'],['../classdetail_1_1iter__impl.html#af8d8847a82d9dab28bd4650ed13a7c90',1,'detail::iter_impl::iter_impl(const iter_impl< const BasicJsonType > &other) noexcept'],['../classdetail_1_1iter__impl.html#a26079f33eb8a16683577cf3782558f26',1,'detail::iter_impl::iter_impl(const iter_impl< typename std::remove_const< BasicJsonType >::type > &other) noexcept']]], ['iteration_5fproxy_129',['iteration_proxy',['../classdetail_1_1iteration__proxy.html',1,'detail::iteration_proxy< IteratorType >'],['../classdetail_1_1iteration__proxy.html#abc711365efc12210a983fba0e39b5811',1,'detail::iteration_proxy::iteration_proxy()']]], @@ -134,8 +134,8 @@ var searchData= ['iterator_131',['Iterator',['../classavl__tree_1_1_iterator.html',1,'avl_tree< T >::Iterator'],['../classbst_1_1_iterator.html',1,'bst< T >::Iterator'],['../classcircular__linked__list_1_1_iterator.html',1,'circular_linked_list< T >::Iterator'],['../classdequeue__list_1_1_iterator.html',1,'dequeue_list< T >::Iterator'],['../classdoubly__linked__list_1_1_iterator.html',1,'doubly_linked_list< T >::Iterator'],['../classfrequency__list_1_1_iterator.html',1,'frequency_list< T >::Iterator'],['../classhash__table_1_1_iterator.html',1,'hash_table< KeyType, ValueType >::Iterator'],['../classinterval__tree_1_1_iterator.html',1,'interval_tree< T >::Iterator'],['../classlinked__list_1_1_iterator.html',1,'linked_list< T >::Iterator'],['../class_mat1d_1_1_iterator.html',1,'Mat1d< T, SIZE >::Iterator'],['../class_mat2d_1_1_iterator.html',1,'Mat2d< T, ROWS, COLS >::Iterator'],['../classskip__list_1_1_iterator.html',1,'skip_list< T >::Iterator'],['../classsplay__tree_1_1_iterator.html',1,'splay_tree< T >::Iterator'],['../classstack__list_1_1_iterator.html',1,'stack_list< T >::Iterator'],['../classtree_1_1_iterator.html',1,'tree< T >::Iterator']]], ['iterator_132',['iterator',['../classbasic__json.html#ae206a491161d043f8efaa1330f1ccf97',1,'basic_json']]], ['iterator_133',['Iterator',['../classhash__table_1_1_iterator.html#a7d12755d349253ad8d60547868a09573',1,'hash_table::Iterator::Iterator()'],['../classcircular__linked__list_1_1_iterator.html#a56a79c0ca0b2174983bcb4824ccd2282',1,'circular_linked_list::Iterator::Iterator()'],['../classdoubly__linked__list_1_1_iterator.html#a63e1bde682034183631fa7e47875bbd9',1,'doubly_linked_list::Iterator::Iterator()'],['../classfrequency__list_1_1_iterator.html#a55735e7fe8761650aa778d2c5dbf3c9c',1,'frequency_list::Iterator::Iterator()'],['../classlinked__list_1_1_iterator.html#a32a5cea122f0f7fa21ffdc4f391610af',1,'linked_list::Iterator::Iterator()'],['../classskip__list_1_1_iterator.html#a9f01da3830d0f8ce18a34b7460b08ca9',1,'skip_list::Iterator::Iterator()'],['../classdequeue__list_1_1_iterator.html#a89fdc9c2b5a9df25aa5e13b985a6fff2',1,'dequeue_list::Iterator::Iterator()'],['../classstack__list_1_1_iterator.html#a81854ce2874a2a5f5d4f3636d5b26cce',1,'stack_list::Iterator::Iterator()'],['../classavl__tree_1_1_iterator.html#a0ba2c42320c63a8379610c51c3c5a600',1,'avl_tree::Iterator::Iterator()'],['../classbst_1_1_iterator.html#a9b491f04f98b75964a67795982d14d74',1,'bst::Iterator::Iterator()'],['../classinterval__tree_1_1_iterator.html#a59f640ae5fcfdba2490972d4a2fbe241',1,'interval_tree::Iterator::Iterator()'],['../classsplay__tree_1_1_iterator.html#afc9327f8cb72ba7c6947aca4dbcb5d72',1,'splay_tree::Iterator::Iterator()'],['../classtree_1_1_iterator.html#a27c252136f90a013984f53a9966fd658',1,'tree::Iterator::Iterator()'],['../class_mat1d_1_1_iterator.html#a7f548b32a4b22c33e24ed33481067b2d',1,'Mat1d::Iterator::Iterator()'],['../class_mat2d_1_1_iterator.html#a4f9c6a6e209acbf79167c645e872ba16',1,'Mat2d::Iterator::Iterator()']]], - ['iterator_20strong_134',['<strong>Iterator</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md80',1,'']]], - ['iterator_20strong_20_3a_135',['Iterator strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md94',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md102',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md108',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md113',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md128',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md136',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md147',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md155',1,'<strong>iterator</strong>:']]], + ['iterator_20strong_134',['<strong>Iterator</strong>',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html#autotoc_md84',1,'']]], + ['iterator_20strong_20_3a_135',['Iterator strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html#autotoc_md98',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html#autotoc_md106',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html#autotoc_md112',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html#autotoc_md117',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html#autotoc_md132',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html#autotoc_md140',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html#autotoc_md151',1,'<strong>iterator</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html#autotoc_md159',1,'<strong>iterator</strong>:']]], ['iterator_5fcategory_136',['iterator_category',['../classdetail_1_1iter__impl.html#a8fa317aaddc3dc7c58264e52e295c43e',1,'detail::iter_impl']]], ['iterator_5finput_5fadapter_137',['iterator_input_adapter',['../classdetail_1_1iterator__input__adapter.html',1,'detail']]], ['iterator_5finput_5fadapter_5ffactory_138',['iterator_input_adapter_factory',['../structdetail_1_1iterator__input__adapter__factory.html',1,'detail']]], @@ -148,7 +148,7 @@ var searchData= ['iterator_5ftypes_3c_20t_20_3e_145',['iterator_types< T >',['../structdetail_1_1iterator__types.html',1,'detail']]], ['iterator_5fwrapper_146',['iterator_wrapper',['../classbasic__json.html#ab8b4e0acdea49e5f0a77abdf1ce465d2',1,'basic_json::iterator_wrapper(reference ref) noexcept'],['../classbasic__json.html#a7c0314258e5347eade0c6851017bf5a5',1,'basic_json::iterator_wrapper(const_reference ref) noexcept']]], ['iteratorgenerator_147',['IteratorGenerator',['../class_catch_1_1_generators_1_1_iterator_generator.html',1,'Catch::Generators']]], - ['iterators_20strong_20_3a_148',['Iterators strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md62',1,'<strong>iterators</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md71',1,'<strong>iterators</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md88',1,'<strong>iterators</strong>:']]], + ['iterators_20strong_20_3a_148',['Iterators strong :',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html#autotoc_md66',1,'<strong>iterators</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html#autotoc_md75',1,'<strong>iterators</strong>:'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html#autotoc_md92',1,'<strong>iterators</strong>:']]], ['itestcaseregistry_149',['ITestCaseRegistry',['../struct_catch_1_1_i_test_case_registry.html',1,'Catch']]], ['itestinvoker_150',['ITestInvoker',['../struct_catch_1_1_i_test_invoker.html',1,'Catch']]], ['itransientexpression_151',['ITransientExpression',['../struct_catch_1_1_i_transient_expression.html',1,'Catch']]] diff --git a/docs/html/search/all_f.js b/docs/html/search/all_f.js index fd804382..ec1c8045 100644 --- a/docs/html/search/all_f.js +++ b/docs/html/search/all_f.js @@ -2,8 +2,8 @@ var searchData= [ ['join_0',['join',['../classdsu.html#a02acccd340bf9e6818fb3a8e4415311d',1,'dsu']]], ['join_20a_20our_20discord_20strong_1',['<strong><a href="https://discord.gg/M9nYv4MHz6" >Join</a> our Discord</strong>',['../index.html#autotoc_md18',1,'']]], - ['json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_2',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md28',1,'']]], - ['json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_3',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md32',1,'']]], + ['json_20file_20and_20then_20use_20the_20python_20s_20matplotlib_20function_3a_20strong_20_3a_2',['<strong>optionally for visualization purposes you can write to a json file and then use the python's matplotlib function:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html#autotoc_md29',1,'']]], + ['json_20file_20and_20then_20visualize_20it_20with_20python_20s_20matplotlib_3a_20strong_20_3a_3',['<strong>optionally for visualization purposes you can write to a json file and then visualize it with python's matplotlib:</strong>:',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2kmeans.html#autotoc_md33',1,'']]], ['json_5fdefault_5fbase_4',['json_default_base',['../structdetail_1_1json__default__base.html',1,'detail']]], ['json_5fpointer_5',['json_pointer',['../classjson__pointer.html',1,'json_pointer< RefStringType >'],['../classbasic__json.html#afe66720a34c11920f359394a4430a16e',1,'basic_json::json_pointer'],['../classjson__pointer.html#a5288b8f5d6ff6faca37f664b98a16ecd',1,'json_pointer::json_pointer()']]], ['json_5fref_6',['json_ref',['../classdetail_1_1json__ref.html',1,'detail']]], diff --git a/docs/html/search/functions_1.js b/docs/html/search/functions_1.js index 892e4f0e..509edd07 100644 --- a/docs/html/search/functions_1.js +++ b/docs/html/search/functions_1.js @@ -7,9 +7,10 @@ var searchData= ['append_5fexponent_4',['append_exponent',['../namespacedetail_1_1dtoa__impl.html#aec9f6655c3b629aeb0e8c887aea5da87',1,'detail::dtoa_impl']]], ['apply_5ffilter2d_5',['apply_filter2d',['../class_image.html#a3a56602ae5335142e179e679c9e31aa6',1,'Image']]], ['apply_5fmedian_5ffilter_6',['apply_median_filter',['../namespacemedian__filter.html#a6f572af3819ffeb5135937fb5674b407',1,'median_filter']]], - ['array_7',['array',['../classbasic__json.html#ac736994a792cb8460a30a3f4dd86fd78',1,'basic_json']]], - ['assign_5fto_5fclosest_8',['assign_to_closest',['../classkmeans.html#afbea96aeec84f1fed57e8578235ef605',1,'kmeans']]], - ['astar_9',['AStar',['../class_a_star.html#a23730b1890b3092f7b96efbacba2e662',1,'AStar']]], - ['at_10',['at',['../classbasic__json.html#a899e4623fe377af5c9ad14c40c64280c',1,'basic_json::at(size_type idx)'],['../classbasic__json.html#af076d8a80f4263cf821da2033d5773b6',1,'basic_json::at(size_type idx) const'],['../classbasic__json.html#accafaaf23f60bb245ddb1fa0972b33a3',1,'basic_json::at(const typename object_t::key_type &key)'],['../classbasic__json.html#a4cd9ba2f2164d9cee83b07f76d40843f',1,'basic_json::at(KeyType &&key)'],['../classbasic__json.html#aba9a21714e81e98fc5786a2339ea1665',1,'basic_json::at(const typename object_t::key_type &key) const'],['../classbasic__json.html#a7ae6267ca4bd85e25f61dc5ba30204da',1,'basic_json::at(KeyType &&key) const'],['../classbasic__json.html#a91d1ad7e10a1c3aae885ddd992385612',1,'basic_json::at(const json_pointer &ptr)'],['../classbasic__json.html#a5a3a35d456e3250640a90c6f7a7fd555',1,'basic_json::at(const json_pointer &ptr) const']]], - ['avl_5ftree_11',['avl_tree',['../classavl__tree.html#a048c3bc01286503d3d540a8910551317',1,'avl_tree::avl_tree(std::vector< T > __elements={}) noexcept'],['../classavl__tree.html#a3cab4d4112e58e6f90f36d0c23cbe3f6',1,'avl_tree::avl_tree(const avl_tree &a)']]] + ['apply_5fsharpening_5ffilter_7',['apply_sharpening_filter',['../namespacesharpening__filter.html#a6cd67f915c4cf17ab46f72104a5cc9e6',1,'sharpening_filter']]], + ['array_8',['array',['../classbasic__json.html#ac736994a792cb8460a30a3f4dd86fd78',1,'basic_json']]], + ['assign_5fto_5fclosest_9',['assign_to_closest',['../classkmeans.html#afbea96aeec84f1fed57e8578235ef605',1,'kmeans']]], + ['astar_10',['AStar',['../class_a_star.html#a23730b1890b3092f7b96efbacba2e662',1,'AStar']]], + ['at_11',['at',['../classbasic__json.html#a899e4623fe377af5c9ad14c40c64280c',1,'basic_json::at(size_type idx)'],['../classbasic__json.html#af076d8a80f4263cf821da2033d5773b6',1,'basic_json::at(size_type idx) const'],['../classbasic__json.html#accafaaf23f60bb245ddb1fa0972b33a3',1,'basic_json::at(const typename object_t::key_type &key)'],['../classbasic__json.html#a4cd9ba2f2164d9cee83b07f76d40843f',1,'basic_json::at(KeyType &&key)'],['../classbasic__json.html#aba9a21714e81e98fc5786a2339ea1665',1,'basic_json::at(const typename object_t::key_type &key) const'],['../classbasic__json.html#a7ae6267ca4bd85e25f61dc5ba30204da',1,'basic_json::at(KeyType &&key) const'],['../classbasic__json.html#a91d1ad7e10a1c3aae885ddd992385612',1,'basic_json::at(const json_pointer &ptr)'],['../classbasic__json.html#a5a3a35d456e3250640a90c6f7a7fd555',1,'basic_json::at(const json_pointer &ptr) const']]], + ['avl_5ftree_12',['avl_tree',['../classavl__tree.html#a048c3bc01286503d3d540a8910551317',1,'avl_tree::avl_tree(std::vector< T > __elements={}) noexcept'],['../classavl__tree.html#a3cab4d4112e58e6f90f36d0c23cbe3f6',1,'avl_tree::avl_tree(const avl_tree &a)']]] ]; diff --git a/docs/html/search/functions_c.js b/docs/html/search/functions_c.js index 9ec032b8..a912ae58 100644 --- a/docs/html/search/functions_c.js +++ b/docs/html/search/functions_c.js @@ -1,5 +1,6 @@ var searchData= [ - ['linear_5fregression_0',['linear_regression',['../classlinear__regression.html#a8c56cd49e738a840b3482779924e9b53',1,'linear_regression']]], - ['linked_5flist_1',['linked_list',['../classlinked__list.html#a0ce3db6fd04bd1d38e689e90e160772a',1,'linked_list::linked_list(std::vector< T > __elements={}) noexcept'],['../classlinked__list.html#a0eaec813e8a1356d1762a00661bdab80',1,'linked_list::linked_list(const linked_list &l)']]] + ['level_5forder_0',['level_order',['../classavl__tree.html#ab139b35985a741d7834ef1e356c5f18f',1,'avl_tree::level_order()'],['../classbst.html#ab9768cfd3f234e31558ccc1a283a1ed4',1,'bst::level_order()'],['../classinterval__tree.html#a11316641338b91307a0d777b55964a24',1,'interval_tree::level_order()'],['../classsplay__tree.html#a1563389efc44838d96fcbf1302e7bf10',1,'splay_tree::level_order()'],['../classtree.html#a5d18c70b1377d47b133104cd178a48e9',1,'tree::level_order()']]], + ['linear_5fregression_1',['linear_regression',['../classlinear__regression.html#a8c56cd49e738a840b3482779924e9b53',1,'linear_regression']]], + ['linked_5flist_2',['linked_list',['../classlinked__list.html#a0ce3db6fd04bd1d38e689e90e160772a',1,'linked_list::linked_list(std::vector< T > __elements={}) noexcept'],['../classlinked__list.html#a0eaec813e8a1356d1762a00661bdab80',1,'linked_list::linked_list(const linked_list &l)']]] ]; diff --git a/docs/html/search/namespaces_2.js b/docs/html/search/namespaces_2.js index d2983564..76980a6e 100644 --- a/docs/html/search/namespaces_2.js +++ b/docs/html/search/namespaces_2.js @@ -1,4 +1,5 @@ var searchData= [ - ['sobel_0',['sobel',['../namespacesobel.html',1,'']]] + ['sharpening_5ffilter_0',['sharpening_filter',['../namespacesharpening__filter.html',1,'']]], + ['sobel_1',['sobel',['../namespacesobel.html',1,'']]] ]; diff --git a/docs/html/search/pages_10.js b/docs/html/search/pages_10.js index d5f9fbec..46451296 100644 --- a/docs/html/search/pages_10.js +++ b/docs/html/search/pages_10.js @@ -1,8 +1,9 @@ var searchData= [ - ['should_20i_20comment_20my_20code_0',['How should i comment my code?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_m_m_e_n_t_s.html',1,'']]], - ['single_20linked_20list_20class_1',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], - ['skip_20list_20class_2',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], - ['splay_20tree_20class_3',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], - ['stack_20class_4',['Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]] + ['sharpening_20filter_20namespace_0',['Mini tutorial for sharpening filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html',1,'']]], + ['should_20i_20comment_20my_20code_1',['How should i comment my code?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_m_m_e_n_t_s.html',1,'']]], + ['single_20linked_20list_20class_2',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], + ['skip_20list_20class_3',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], + ['splay_20tree_20class_4',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], + ['stack_20class_5',['Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]] ]; diff --git a/docs/html/search/pages_11.js b/docs/html/search/pages_11.js index 9a8fc2c0..fdf097fe 100644 --- a/docs/html/search/pages_11.js +++ b/docs/html/search/pages_11.js @@ -24,15 +24,16 @@ var searchData= ['tutorial_20for_20linear_20regression_20class_21',['Mini tutorial for linear regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html',1,'']]], ['tutorial_20for_20median_20filter_20namespace_22',['Mini tutorial for median filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'']]], ['tutorial_20for_20polynomial_20regression_20class_23',['Mini tutorial for polynomial regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html',1,'']]], - ['tutorial_20for_20single_20linked_20list_20class_24',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], - ['tutorial_20for_20the_20avl_20tree_20class_25',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], - ['tutorial_20for_20the_20bst_20class_26',['Mini Tutorial for the BST class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html',1,'']]], - ['tutorial_20for_20the_20frequency_5flist_20class_27',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]], - ['tutorial_20for_20the_20graph_20class_28',['Mini Tutorial for the Graph class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html',1,'']]], - ['tutorial_20for_20the_20hash_5ftable_20class_29',['Mini Tutorial for the hash_table class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html',1,'']]], - ['tutorial_20for_20the_20interval_20tree_20class_30',['Mini Tutorial for the Interval Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html',1,'']]], - ['tutorial_20for_20the_20skip_20list_20class_31',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], - ['tutorial_20for_20the_20splay_20tree_20class_32',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], - ['tutorial_20for_20the_20stack_20class_33',['Tutorial for the Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], - ['tutorial_20for_20the_20trie_20class_34',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]] + ['tutorial_20for_20sharpening_20filter_20namespace_24',['Mini tutorial for sharpening filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html',1,'']]], + ['tutorial_20for_20single_20linked_20list_20class_25',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], + ['tutorial_20for_20the_20avl_20tree_20class_26',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], + ['tutorial_20for_20the_20bst_20class_27',['Mini Tutorial for the BST class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html',1,'']]], + ['tutorial_20for_20the_20frequency_5flist_20class_28',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]], + ['tutorial_20for_20the_20graph_20class_29',['Mini Tutorial for the Graph class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html',1,'']]], + ['tutorial_20for_20the_20hash_5ftable_20class_30',['Mini Tutorial for the hash_table class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html',1,'']]], + ['tutorial_20for_20the_20interval_20tree_20class_31',['Mini Tutorial for the Interval Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html',1,'']]], + ['tutorial_20for_20the_20skip_20list_20class_32',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], + ['tutorial_20for_20the_20splay_20tree_20class_33',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], + ['tutorial_20for_20the_20stack_20class_34',['Tutorial for the Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], + ['tutorial_20for_20the_20trie_20class_35',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]] ]; diff --git a/docs/html/search/pages_5.js b/docs/html/search/pages_5.js index 1179319f..5a296a5a 100644 --- a/docs/html/search/pages_5.js +++ b/docs/html/search/pages_5.js @@ -1,6 +1,6 @@ var searchData= [ - ['filter_20namespace_0',['Mini tutorial for median filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'']]], + ['filter_20namespace_0',['filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'Mini tutorial for median filter namespace'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html',1,'Mini tutorial for sharpening filter namespace']]], ['for_20circular_20linked_20list_20class_1',['Mini tutorial for circular linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2circular__linked__list.html',1,'']]], ['for_20dbscan_20class_2',['Mini tutorial for DBSCAN class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2clustering_2_d_b_s_c_a_n.html',1,'']]], ['for_20doubly_20linked_20list_20class_3',['Mini tutorial for doubly linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2doubly__linked__list.html',1,'']]], @@ -10,16 +10,17 @@ var searchData= ['for_20linear_20regression_20class_7',['Mini tutorial for linear regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html',1,'']]], ['for_20median_20filter_20namespace_8',['Mini tutorial for median filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'']]], ['for_20polynomial_20regression_20class_9',['Mini tutorial for polynomial regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html',1,'']]], - ['for_20single_20linked_20list_20class_10',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], - ['for_20the_20avl_20tree_20class_11',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], - ['for_20the_20bst_20class_12',['Mini Tutorial for the BST class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html',1,'']]], - ['for_20the_20frequency_5flist_20class_13',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]], - ['for_20the_20graph_20class_14',['Mini Tutorial for the Graph class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html',1,'']]], - ['for_20the_20hash_5ftable_20class_15',['Mini Tutorial for the hash_table class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html',1,'']]], - ['for_20the_20interval_20tree_20class_16',['Mini Tutorial for the Interval Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html',1,'']]], - ['for_20the_20skip_20list_20class_17',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], - ['for_20the_20splay_20tree_20class_18',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], - ['for_20the_20stack_20class_19',['for the Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], - ['for_20the_20trie_20class_20',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]], - ['frequency_5flist_20class_21',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]] + ['for_20sharpening_20filter_20namespace_10',['Mini tutorial for sharpening filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html',1,'']]], + ['for_20single_20linked_20list_20class_11',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], + ['for_20the_20avl_20tree_20class_12',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], + ['for_20the_20bst_20class_13',['Mini Tutorial for the BST class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html',1,'']]], + ['for_20the_20frequency_5flist_20class_14',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]], + ['for_20the_20graph_20class_15',['Mini Tutorial for the Graph class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html',1,'']]], + ['for_20the_20hash_5ftable_20class_16',['Mini Tutorial for the hash_table class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html',1,'']]], + ['for_20the_20interval_20tree_20class_17',['Mini Tutorial for the Interval Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html',1,'']]], + ['for_20the_20skip_20list_20class_18',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], + ['for_20the_20splay_20tree_20class_19',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], + ['for_20the_20stack_20class_20',['for the Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], + ['for_20the_20trie_20class_21',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]], + ['frequency_5flist_20class_22',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]] ]; diff --git a/docs/html/search/pages_b.js b/docs/html/search/pages_b.js index 96ddb8ed..2067b5db 100644 --- a/docs/html/search/pages_b.js +++ b/docs/html/search/pages_b.js @@ -10,16 +10,17 @@ var searchData= ['mini_20tutorial_20for_20linear_20regression_20class_7',['Mini tutorial for linear regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2linear__regression.html',1,'']]], ['mini_20tutorial_20for_20median_20filter_20namespace_8',['Mini tutorial for median filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'']]], ['mini_20tutorial_20for_20polynomial_20regression_20class_9',['Mini tutorial for polynomial regression class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2regression_2polynomial__regression.html',1,'']]], - ['mini_20tutorial_20for_20single_20linked_20list_20class_10',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], - ['mini_20tutorial_20for_20the_20avl_20tree_20class_11',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], - ['mini_20tutorial_20for_20the_20bst_20class_12',['Mini Tutorial for the BST class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html',1,'']]], - ['mini_20tutorial_20for_20the_20frequency_5flist_20class_13',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]], - ['mini_20tutorial_20for_20the_20graph_20class_14',['Mini Tutorial for the Graph class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html',1,'']]], - ['mini_20tutorial_20for_20the_20hash_5ftable_20class_15',['Mini Tutorial for the hash_table class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html',1,'']]], - ['mini_20tutorial_20for_20the_20interval_20tree_20class_16',['Mini Tutorial for the Interval Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html',1,'']]], - ['mini_20tutorial_20for_20the_20skip_20list_20class_17',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], - ['mini_20tutorial_20for_20the_20splay_20tree_20class_18',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], - ['mini_20tutorial_20for_20the_20stack_20class_19',['Mini Tutorial for the Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], - ['mini_20tutorial_20for_20the_20trie_20class_20',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]], - ['my_20code_21',['How should i comment my code?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_m_m_e_n_t_s.html',1,'']]] + ['mini_20tutorial_20for_20sharpening_20filter_20namespace_10',['Mini tutorial for sharpening filter namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html',1,'']]], + ['mini_20tutorial_20for_20single_20linked_20list_20class_11',['Mini tutorial for single linked list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2linked__list.html',1,'']]], + ['mini_20tutorial_20for_20the_20avl_20tree_20class_12',['Mini Tutorial for the AVL tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2avl.html',1,'']]], + ['mini_20tutorial_20for_20the_20bst_20class_13',['Mini Tutorial for the BST class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2bst.html',1,'']]], + ['mini_20tutorial_20for_20the_20frequency_5flist_20class_14',['Mini Tutorial for the frequency_list class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2frequency__list.html',1,'']]], + ['mini_20tutorial_20for_20the_20graph_20class_15',['Mini Tutorial for the Graph class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2graph_2graph.html',1,'']]], + ['mini_20tutorial_20for_20the_20hash_5ftable_20class_16',['Mini Tutorial for the hash_table class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2hash__table.html',1,'']]], + ['mini_20tutorial_20for_20the_20interval_20tree_20class_17',['Mini Tutorial for the Interval Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2interval__tree.html',1,'']]], + ['mini_20tutorial_20for_20the_20skip_20list_20class_18',['Mini Tutorial for the Skip List class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2list_2skip__list.html',1,'']]], + ['mini_20tutorial_20for_20the_20splay_20tree_20class_19',['Mini Tutorial for the Splay Tree class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2splay__tree.html',1,'']]], + ['mini_20tutorial_20for_20the_20stack_20class_20',['Mini Tutorial for the Stack class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2dequeue.html',1,'Mini Tutorial for the Stack class'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2others_2stack.html',1,'Mini Tutorial for the Stack class']]], + ['mini_20tutorial_20for_20the_20trie_20class_21',['Mini Tutorial for the Trie class',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2tree_2trie.html',1,'']]], + ['my_20code_22',['How should i comment my code?',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2_c_o_m_m_e_n_t_s.html',1,'']]] ]; diff --git a/docs/html/search/pages_c.js b/docs/html/search/pages_c.js index d3778988..121291c5 100644 --- a/docs/html/search/pages_c.js +++ b/docs/html/search/pages_c.js @@ -1,4 +1,4 @@ var searchData= [ - ['namespace_0',['namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html',1,'Mini tutorial for edge detection namespace'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'Mini tutorial for median filter namespace']]] + ['namespace_0',['namespace',['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2edge__detection.html',1,'Mini tutorial for edge detection namespace'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2median__filter.html',1,'Mini tutorial for median filter namespace'],['../md__2_users_2spirosmag_2_documents_2_algo_plus_2tutorial_2image_2sharpening__filter.html',1,'Mini tutorial for sharpening filter namespace']]] ]; diff --git a/docs/html/search/related_0.js b/docs/html/search/related_0.js index dd111d4d..e612d5e8 100644 --- a/docs/html/search/related_0.js +++ b/docs/html/search/related_0.js @@ -4,7 +4,7 @@ var searchData= ['operator_2b_1',['operator+',['../classdetail_1_1iter__impl.html#a94108d1a7563e103534f23eb5c1ee175',1,'detail::iter_impl']]], ['operator_2f_2',['operator/',['../classjson__pointer.html#a90a11fe6c7f37b1746a3ff9cb24b0d53',1,'json_pointer::operator/'],['../classjson__pointer.html#a116956f4487af44732dd685e970679b0',1,'json_pointer::operator/'],['../classjson__pointer.html#a29f6d4b492e784b9d196b05a4048c289',1,'json_pointer::operator/']]], ['operator_3c_3',['operator<',['../classjson__pointer.html#af8c9bbaed20be0634a2e522f54265d96',1,'json_pointer']]], - ['operator_3c_3c_4',['operator<<',['../classgraph.html#a192732806b0edc5242c55a045ca77421',1,'graph::operator<<'],['../classweighted__graph.html#afa0c1b6af0f7b36d24ce876abbc92107',1,'weighted_graph::operator<<'],['../classhash__table.html#a9699a70465c91ed86faf744d436af69a',1,'hash_table::operator<<'],['../classcircular__linked__list.html#ad28b4924b79de5736accc4576f40ac0a',1,'circular_linked_list::operator<<'],['../classdoubly__linked__list.html#ac1c1ed53b4f01df3ce575bf872778bb9',1,'doubly_linked_list::operator<<'],['../classfrequency__list.html#a594639f408a5cb2d280f32d751178621',1,'frequency_list::operator<<'],['../classlinked__list.html#a7299ebf8aba1c5c4d9c20ee6cf413d09',1,'linked_list::operator<<'],['../classskip__list.html#a8f64399c87d929894ff113f7a6ff8b54',1,'skip_list::operator<<'],['../classinterval__tree.html#a9ec9c06e600dc687b3ec921559634fb9',1,'interval_tree::operator<<'],['../class_mat1d.html#a6fcb5b1c831cc22a3ebe196004fe809e',1,'Mat1d::operator<<'],['../class_mat2d.html#a30384f3df9404e379fde20edf403ea04',1,'Mat2d::operator<<'],['../classjson__pointer.html#ad4140db2dd2f347f46f3abae0fc2156f',1,'json_pointer::operator<<'],['../classbasic__json.html#af9907af448f7ff794120033e132025f6',1,'basic_json::operator<<']]], + ['operator_3c_3c_4',['operator<<',['../classgraph.html#a192732806b0edc5242c55a045ca77421',1,'graph::operator<<'],['../classweighted__graph.html#afa0c1b6af0f7b36d24ce876abbc92107',1,'weighted_graph::operator<<'],['../classhash__table.html#a9699a70465c91ed86faf744d436af69a',1,'hash_table::operator<<'],['../classcircular__linked__list.html#ad28b4924b79de5736accc4576f40ac0a',1,'circular_linked_list::operator<<'],['../classdoubly__linked__list.html#ac1c1ed53b4f01df3ce575bf872778bb9',1,'doubly_linked_list::operator<<'],['../classfrequency__list.html#a594639f408a5cb2d280f32d751178621',1,'frequency_list::operator<<'],['../classlinked__list.html#a7299ebf8aba1c5c4d9c20ee6cf413d09',1,'linked_list::operator<<'],['../classskip__list.html#a8f64399c87d929894ff113f7a6ff8b54',1,'skip_list::operator<<'],['../classavl__tree.html#abe65b6fb7200651bba6f6bfe22f62b58',1,'avl_tree::operator<<'],['../classbst.html#a2366bf064084a61835ca523cd0b7ff4e',1,'bst::operator<<'],['../classinterval__tree.html#a59fbcb3841f451597a2157e49e211529',1,'interval_tree::operator<<'],['../classsplay__tree.html#a4aa8ac953ded6034d002a27f2f9b43ce',1,'splay_tree::operator<<'],['../classtree.html#a6f8da6eb21a892f7c7b2b93380e29da2',1,'tree::operator<<'],['../class_mat1d.html#a6fcb5b1c831cc22a3ebe196004fe809e',1,'Mat1d::operator<<'],['../class_mat2d.html#a30384f3df9404e379fde20edf403ea04',1,'Mat2d::operator<<'],['../classjson__pointer.html#ad4140db2dd2f347f46f3abae0fc2156f',1,'json_pointer::operator<<'],['../classbasic__json.html#af9907af448f7ff794120033e132025f6',1,'basic_json::operator<<']]], ['operator_3d_3d_5',['operator==',['../classjson__pointer.html#a613a4889154f7ab2ee4efbe0fe147cf2',1,'json_pointer::operator=='],['../classjson__pointer.html#af6bf727798ad49870a709094e5ff981c',1,'json_pointer::operator=='],['../classjson__pointer.html#ae7aabbb2a365ddaac5192ccea3226bfb',1,'json_pointer::operator==']]], ['operator_3e_3e_6',['operator>>',['../classbasic__json.html#aea0de29387d532e0bc5f2475cb83995d',1,'basic_json']]] ]; diff --git a/docs/html/sharpening__filter_8h_source.html b/docs/html/sharpening__filter_8h_source.html new file mode 100644 index 00000000..5cc77950 --- /dev/null +++ b/docs/html/sharpening__filter_8h_source.html @@ -0,0 +1,125 @@ + + + + + + + +AlgoPlus: /Users/spirosmag/Documents/AlgoPlus/src/machine_learning/image/filters/sharpening_filter.h Source File + + + + + + + + + + + +
+
+ + + + + + + +
+
AlgoPlus v0.1.0 +
+
+
+ + + + + + + + + +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ + +
+
+
sharpening_filter.h
+
+
+
1#ifndef SHARPENING_FILTER_H
+
2#define SHARPENING_FILTER_H
+
3
+
4#ifdef __cplusplus
+
5#include <iostream>
+
6#include <vector>
+
7#include "../image.h"
+
8#endif
+
9
+
+ +
+
19 std::vector<std::vector<int32_t> > apply_sharpening_filter(Image img){
+
20 int height = img._height();
+
21 int width = img._width();
+
22 Image resulted_img(height, width);
+
23 std::vector<std::vector<int32_t> > kernel = {{0, 1, 0}, {1, -4, 1}, {0, 1, 0}};
+
24 return img.apply_filter2d(kernel).get_2d_array();
+
25 }
+
+
26}
+
+
27
+
28
+
29#endif
+
Definition image.h:11
+
Image apply_filter2d(std::vector< std::vector< int32_t > > &filter) const
apply_filter2d function
Definition image.h:221
+
int _width() const
width function
Definition image.h:54
+
std::vector< std::vector< int32_t > > get_2d_array() const
get_2d_array function
Definition image.h:60
+
int _height() const
_height function
Definition image.h:48
+
sharpening_filter namespace
Definition sharpening_filter.h:13
+
std::vector< std::vector< int32_t > > apply_sharpening_filter(Image img)
apply_sharpening_filter function: applies a 3x3 laplacian filter to image img
Definition sharpening_filter.h:19
+
+ + + + diff --git a/docs/html/splay__tree_8h_source.html b/docs/html/splay__tree_8h_source.html index 8d46b544..d01d8844 100644 --- a/docs/html/splay__tree_8h_source.html +++ b/docs/html/splay__tree_8h_source.html @@ -93,372 +93,417 @@
7#include <functional>
8#include <iostream>
9#include <memory>
-
10#include <vector>
-
11#endif
-
12
-
-
16template <typename T> class splay_tree {
-
17private:
-
24 struct node {
-
25 T info;
-
26 std::shared_ptr<node> right;
-
27 std::shared_ptr<node> left;
-
28 node(T key = 0) : info(key), right(nullptr), left(nullptr) {}
-
29 };
-
30 std::shared_ptr<node> root;
-
31 size_t __size;
-
32
-
33public:
-
-
39 explicit splay_tree(std::vector<T> v = {}) noexcept
-
40 : root(nullptr), __size(0) {
-
41 if (!v.empty()) {
-
42 for (T &x : v) {
-
43 this->insert(x);
-
44 }
-
45 }
-
46 }
+
10#include <queue>
+
11#include <vector>
+
12#endif
+
13
+
+
17template <typename T> class splay_tree {
+
18private:
+
25 struct node {
+
26 T info;
+
27 std::shared_ptr<node> right;
+
28 std::shared_ptr<node> left;
+
29 node(T key = 0) : info(key), right(nullptr), left(nullptr) {}
+
30 };
+
31 std::shared_ptr<node> root;
+
32 size_t __size;
+
33
+
34public:
+
+
40 explicit splay_tree(std::vector<T> v = {}) noexcept
+
41 : root(nullptr), __size(0) {
+
42 if (!v.empty()) {
+
43 for (T &x : v) {
+
44 this->insert(x);
+
45 }
+
46 }
+
47 }
-
47
-
-
52 explicit splay_tree(const splay_tree &s) {
-
53 root = s.root;
-
54 __size = s.__size;
-
55 }
+
48
+
+
53 explicit splay_tree(const splay_tree &s) {
+
54 root = s.root;
+
55 __size = s.__size;
+
56 }
-
56
-
- -
63 root = s.root;
-
64 __size = s.__size;
-
65 return *this;
-
66 }
+
57
+
+ +
64 root = s.root;
+
65 __size = s.__size;
+
66 return *this;
+
67 }
-
67
-
68 ~splay_tree() { root = nullptr; }
-
69
-
-
73 void clear() {
-
74 root = nullptr;
-
75 __size = 0;
-
76 }
+
68
+
69 ~splay_tree() { root = nullptr; }
+
70
+
+
74 void clear() {
+
75 root = nullptr;
+
76 __size = 0;
+
77 }
-
77
-
-
83 void insert(T key) {
-
84 root = __insert(root, key);
-
85 __size++;
-
86 }
+
78
+
+
84 void insert(T key) {
+
85 root = __insert(root, key);
+
86 __size++;
+
87 }
-
87
-
-
93 void remove(T key) {
-
94 root = __remove(root, key);
-
95 __size--;
-
96 }
+
88
+
+
94 void remove(T key) {
+
95 root = __remove(root, key);
+
96 __size--;
+
97 }
-
97
-
-
105 bool search(T key) {
-
106 std::shared_ptr<node> ans = splay(root, key);
-
107 return (ans && ans->info == key);
-
108 }
+
98
+
+
106 bool search(T key) {
+
107 std::shared_ptr<node> ans = splay(root, key);
+
108 return (ans && ans->info == key);
+
109 }
-
109
-
115 size_t size() { return __size; }
-
116
-
117 class Iterator;
-
118
-
119 Iterator begin() {
-
120 std::vector<T> ino = this->inorder();
-
121 return Iterator(0, ino);
-
122 }
-
123
-
124 Iterator end() {
-
125 std::vector<T> ino = this->inorder();
-
126 return Iterator(ino.size(), ino);
-
127 }
-
128
-
-
133 std::vector<T> inorder() {
-
134 std::vector<T> path;
-
135 __inorder(
-
136 [&](std::shared_ptr<node> callbacked) {
-
137 path.push_back(callbacked->info);
-
138 },
-
139 root);
-
140 return path;
-
141 }
+
110
+
116 size_t size() { return __size; }
+
117
+
118 class Iterator;
+
119
+
120 Iterator begin() {
+
121 std::vector<T> ino = this->inorder();
+
122 return Iterator(0, ino);
+
123 }
+
124
+
125 Iterator end() {
+
126 std::vector<T> ino = this->inorder();
+
127 return Iterator(ino.size(), ino);
+
128 }
+
129
+
+
134 std::vector<T> inorder() {
+
135 std::vector<T> path;
+
136 __inorder(
+
137 [&](std::shared_ptr<node> callbacked) {
+
138 path.push_back(callbacked->info);
+
139 },
+
140 root);
+
141 return path;
+
142 }
-
142
-
-
147 std::vector<T> preorder() {
-
148 std::vector<T> path;
-
149 __preorder(
-
150 [&](std::shared_ptr<node> callbacked) {
-
151 path.push_back(callbacked->info);
-
152 },
-
153 root);
-
154 return path;
-
155 }
+
143
+
+
148 std::vector<T> preorder() {
+
149 std::vector<T> path;
+
150 __preorder(
+
151 [&](std::shared_ptr<node> callbacked) {
+
152 path.push_back(callbacked->info);
+
153 },
+
154 root);
+
155 return path;
+
156 }
-
156
-
-
161 std::vector<T> postorder() {
-
162 std::vector<T> path;
-
163 __postorder(
-
164 [&](std::shared_ptr<node> callbacked) {
-
165 path.push_back(callbacked->info);
-
166 },
-
167 root);
-
168 return path;
-
169 }
+
157
+
+
162 std::vector<T> postorder() {
+
163 std::vector<T> path;
+
164 __postorder(
+
165 [&](std::shared_ptr<node> callbacked) {
+
166 path.push_back(callbacked->info);
+
167 },
+
168 root);
+
169 return path;
+
170 }
-
170
-
-
175 void visualize() {
-
176 std::string __generated = generate_visualization();
-
177 tree_visualization::visualize(__generated);
-
178 }
+
171
+
+
176 std::vector<std::vector<T>> level_order() {
+
177 std::vector<std::vector<T>> path;
+
178 std::queue<std::shared_ptr<node>> q;
+
179 q.push(root);
+
180 while (!q.empty()) {
+
181 size_t size = q.size();
+
182 std::vector<T> level;
+
183 for (size_t i = 0; i < size; i++) {
+
184 std::shared_ptr<node> current = q.front();
+
185 q.pop();
+
186 level.push_back(current->info);
+
187 if (current->left) {
+
188 q.push(current->left);
+
189 }
+
190 if (current->right) {
+
191 q.push(current->right);
+
192 }
+
193 }
+
194 path.push_back(level);
+
195 }
+
196 return path;
+
197 }
-
179
-
180private:
-
181 std::shared_ptr<node> rrotate(std::shared_ptr<node> _node) {
-
182 std::shared_ptr<node> y = _node->left;
-
183 _node->left = y->right;
-
184 y->right = _node;
-
185 return y;
-
186 }
-
187
-
188 std::shared_ptr<node> lrotate(std::shared_ptr<node> _node) {
-
189 std::shared_ptr<node> y = _node->right;
-
190 _node->right = y->left;
-
191 y->left = _node;
-
192 return y;
-
193 }
-
194
-
195 std::shared_ptr<node> splay(std::shared_ptr<node> _node, T key) {
-
196 if (!_node || _node->info == key) {
-
197 return _node;
-
198 }
-
199 if (_node->info > key) {
-
200 if (_node->left == NULL)
-
201 return _node;
-
202 if (_node->left->info > key) {
-
203 _node->left->left = splay(_node->left->left, key);
-
204 _node = rrotate(_node);
-
205 } else if (_node->left->info < key) {
-
206 _node->left->right = splay(_node->left->right, key);
-
207 if (_node->left->right != NULL)
-
208 _node->left = lrotate(_node->left);
-
209 }
-
210 return (_node->left == NULL) ? _node : rrotate(_node);
-
211 } else {
-
212 if (_node->right == NULL)
-
213 return _node;
-
214 if (_node->right->info > key) {
-
215 _node->right->left = splay(_node->right->left, key);
-
216 if (_node->right->left != NULL)
-
217 _node->right = rrotate(_node->right);
-
218 } else if (_node->right->info < key) {
-
219 _node->right->right = splay(_node->right->right, key);
-
220 _node = lrotate(_node);
+
198
+
+
203 void visualize() {
+
204 std::string __generated = generate_visualization();
+
205 tree_visualization::visualize(__generated);
+
206 }
+
+
207
+
+
211 friend ostream & operator << (ostream &out, splay_tree<T> &t){
+
212 std::vector<std::vector<T> > order = t.level_order();
+
213 for(std::vector<T> & x : order){
+
214 for(size_t i = 0; i < x.size(); i++){
+
215 if(i != x.size() - 1){
+
216 out << x[i] << ", ";
+
217 }
+
218 else{
+
219 out << x[i] << '\n';
+
220 }
221 }
-
222 return (_node->right == NULL) ? _node : lrotate(_node);
-
223 }
+
222 }
+
223 return out;
224 }
+
225
-
226 std::shared_ptr<node> __insert(std::shared_ptr<node> root, T key) {
-
227 if (!root) {
-
228 std::shared_ptr<node> nn = std::make_shared<node>(key);
-
229 return nn;
-
230 }
-
231 root = splay(root, key);
-
232 if (root->info == key) {
-
233 return root;
-
234 }
-
235
-
236 std::shared_ptr<node> nn = std::make_shared<node>(key);
-
237 if (root->info > key) {
-
238 nn->right = root;
-
239 nn->left = root->left;
-
240 root->left = nullptr;
-
241 } else {
-
242 nn->left = root;
-
243 nn->right = root->right;
-
244 root->right = nullptr;
-
245 }
-
246 return nn;
-
247 }
-
248
-
249 std::shared_ptr<node> __remove(std::shared_ptr<node> root, T key) {
-
250 if (!root) {
-
251 return nullptr;
-
252 }
-
253 root = splay(root, key);
-
254 if (key != root->info) {
-
255 return root;
-
256 }
-
257
-
258 std::shared_ptr<node> temp;
-
259 temp = root;
-
260 if (!root->left) {
-
261 root = root->right;
-
262 } else {
-
263 root = splay(root->left, key);
-
264 root->right = temp->right;
-
265 }
-
266 return root;
-
267 }
-
268
-
269 void __inorder(std::function<void(std::shared_ptr<node>)> callback,
-
270 std::shared_ptr<node> root) {
-
271 if (root) {
-
272 __inorder(callback, root->left);
-
273 callback(root);
-
274 __inorder(callback, root->right);
-
275 }
-
276 }
-
277
-
278 void __postorder(std::function<void(std::shared_ptr<node>)> callback,
-
279 std::shared_ptr<node> root) {
-
280 if (root) {
-
281 __postorder(callback, root->left);
-
282 __postorder(callback, root->right);
-
283 callback(root);
-
284 }
-
285 }
-
286
-
287 void __preorder(std::function<void(std::shared_ptr<node>)> callback,
-
288 std::shared_ptr<node> root) {
-
289 if (root) {
-
290 callback(root);
-
291 __preorder(callback, root->left);
-
292 __preorder(callback, root->right);
-
293 }
-
294 }
-
295
-
296 std::string generate_visualization() {
-
297 std::string __generate = __inorder_gen(root);
-
298 return __generate;
-
299 }
-
300
-
301 std::string __inorder_gen(std::shared_ptr<node> root) {
-
302 std::string __s;
-
303 if (std::is_same_v<T, char> || std::is_same_v<T, std::string>) {
-
304 if (root->left) {
-
305 __s += root->info;
-
306 __s += "->";
-
307 __s += root->left->info;
-
308 __s += "\n";
-
309 __s += __inorder_gen(root->left);
-
310 }
-
311 if (root->right) {
-
312 __s += root->info;
-
313 __s += "->";
-
314 __s += root->right->info;
-
315 __s += "\n";
-
316 __s += __inorder_gen(root->right);
-
317 }
-
318 } else {
-
319 if (root->left) {
-
320 __s += std::to_string(root->info) + "->" +
-
321 std::to_string(root->left->info) + "\n" +
-
322 __inorder_gen(root->left);
-
323 }
-
324 if (root->right) {
-
325 __s += std::to_string(root->info) + "->" +
-
326 std::to_string(root->right->info) + "\n" +
-
327 __inorder_gen(root->right);
-
328 }
-
329 }
-
330 return __s;
+
226private:
+
227 std::shared_ptr<node> rrotate(std::shared_ptr<node> _node) {
+
228 std::shared_ptr<node> y = _node->left;
+
229 _node->left = y->right;
+
230 y->right = _node;
+
231 return y;
+
232 }
+
233
+
234 std::shared_ptr<node> lrotate(std::shared_ptr<node> _node) {
+
235 std::shared_ptr<node> y = _node->right;
+
236 _node->right = y->left;
+
237 y->left = _node;
+
238 return y;
+
239 }
+
240
+
241 std::shared_ptr<node> splay(std::shared_ptr<node> _node, T key) {
+
242 if (!_node || _node->info == key) {
+
243 return _node;
+
244 }
+
245 if (_node->info > key) {
+
246 if (_node->left == NULL)
+
247 return _node;
+
248 if (_node->left->info > key) {
+
249 _node->left->left = splay(_node->left->left, key);
+
250 _node = rrotate(_node);
+
251 } else if (_node->left->info < key) {
+
252 _node->left->right = splay(_node->left->right, key);
+
253 if (_node->left->right != NULL)
+
254 _node->left = lrotate(_node->left);
+
255 }
+
256 return (_node->left == NULL) ? _node : rrotate(_node);
+
257 } else {
+
258 if (_node->right == NULL)
+
259 return _node;
+
260 if (_node->right->info > key) {
+
261 _node->right->left = splay(_node->right->left, key);
+
262 if (_node->right->left != NULL)
+
263 _node->right = rrotate(_node->right);
+
264 } else if (_node->right->info < key) {
+
265 _node->right->right = splay(_node->right->right, key);
+
266 _node = lrotate(_node);
+
267 }
+
268 return (_node->right == NULL) ? _node : lrotate(_node);
+
269 }
+
270 }
+
271
+
272 std::shared_ptr<node> __insert(std::shared_ptr<node> root, T key) {
+
273 if (!root) {
+
274 std::shared_ptr<node> nn = std::make_shared<node>(key);
+
275 return nn;
+
276 }
+
277 root = splay(root, key);
+
278 if (root->info == key) {
+
279 return root;
+
280 }
+
281
+
282 std::shared_ptr<node> nn = std::make_shared<node>(key);
+
283 if (root->info > key) {
+
284 nn->right = root;
+
285 nn->left = root->left;
+
286 root->left = nullptr;
+
287 } else {
+
288 nn->left = root;
+
289 nn->right = root->right;
+
290 root->right = nullptr;
+
291 }
+
292 return nn;
+
293 }
+
294
+
295 std::shared_ptr<node> __remove(std::shared_ptr<node> root, T key) {
+
296 if (!root) {
+
297 return nullptr;
+
298 }
+
299 root = splay(root, key);
+
300 if (key != root->info) {
+
301 return root;
+
302 }
+
303
+
304 std::shared_ptr<node> temp;
+
305 temp = root;
+
306 if (!root->left) {
+
307 root = root->right;
+
308 } else {
+
309 root = splay(root->left, key);
+
310 root->right = temp->right;
+
311 }
+
312 return root;
+
313 }
+
314
+
315 void __inorder(std::function<void(std::shared_ptr<node>)> callback,
+
316 std::shared_ptr<node> root) {
+
317 if (root) {
+
318 __inorder(callback, root->left);
+
319 callback(root);
+
320 __inorder(callback, root->right);
+
321 }
+
322 }
+
323
+
324 void __postorder(std::function<void(std::shared_ptr<node>)> callback,
+
325 std::shared_ptr<node> root) {
+
326 if (root) {
+
327 __postorder(callback, root->left);
+
328 __postorder(callback, root->right);
+
329 callback(root);
+
330 }
331 }
-
332};
-
-
333
-
-
337template <typename T> class splay_tree<T>::Iterator {
-
338private:
-
339 std::vector<T> elements;
-
340 int64_t index;
+
332
+
333 void __preorder(std::function<void(std::shared_ptr<node>)> callback,
+
334 std::shared_ptr<node> root) {
+
335 if (root) {
+
336 callback(root);
+
337 __preorder(callback, root->left);
+
338 __preorder(callback, root->right);
+
339 }
+
340 }
341
-
342public:
-
-
348 explicit Iterator(const int64_t &index, std::vector<T> &els) noexcept
-
349 : index(index), elements(els) {}
-
-
350
-
-
357 Iterator &operator=(int64_t index) {
-
358 this->index = index;
-
359 return *(this);
-
360 }
-
-
361
-
- -
368 if (this->index < elements.size()) {
-
369 this->index++;
-
370 }
-
371 return *(this);
-
372 }
+
342 std::string generate_visualization() {
+
343 std::string __generate = __inorder_gen(root);
+
344 return __generate;
+
345 }
+
346
+
347 std::string __inorder_gen(std::shared_ptr<node> root) {
+
348 std::string __s;
+
349 if (std::is_same_v<T, char> || std::is_same_v<T, std::string>) {
+
350 if (root->left) {
+
351 __s += root->info;
+
352 __s += "->";
+
353 __s += root->left->info;
+
354 __s += "\n";
+
355 __s += __inorder_gen(root->left);
+
356 }
+
357 if (root->right) {
+
358 __s += root->info;
+
359 __s += "->";
+
360 __s += root->right->info;
+
361 __s += "\n";
+
362 __s += __inorder_gen(root->right);
+
363 }
+
364 } else {
+
365 if (root->left) {
+
366 __s += std::to_string(root->info) + "->" +
+
367 std::to_string(root->left->info) + "\n" +
+
368 __inorder_gen(root->left);
+
369 }
+
370 if (root->right) {
+
371 __s += std::to_string(root->info) + "->" +
+
372 std::to_string(root->right->info) + "\n" +
+
373 __inorder_gen(root->right);
+
374 }
+
375 }
+
376 return __s;
+
377 }
+
378};
-
373
-
- -
380 Iterator it = *this;
-
381 ++*(this);
-
382 return it;
-
383 }
-
-
384
-
- -
391 if (this->index > 0) {
-
392 this->index--;
-
393 }
-
394 return *(this);
-
395 }
+
379
+
+
383template <typename T> class splay_tree<T>::Iterator {
+
384private:
+
385 std::vector<T> elements;
+
386 int64_t index;
+
387
+
388public:
+
+
394 explicit Iterator(const int64_t &index, std::vector<T> &els) noexcept
+
395 : index(index), elements(els) {}
396
-
- -
403 Iterator it = *this;
-
404 --*(this);
-
405 return it;
+
+
403 Iterator &operator=(int64_t index) {
+
404 this->index = index;
+
405 return *(this);
406 }
407
-
415 bool operator!=(const Iterator &it) { return index != it.index; }
-
416
-
422 T operator*() { return elements[index]; }
-
423};
+
+ +
414 if (this->index < elements.size()) {
+
415 this->index++;
+
416 }
+
417 return *(this);
+
418 }
+
+
419
+
+ +
426 Iterator it = *this;
+
427 ++*(this);
+
428 return it;
+
429 }
+
+
430
+
+ +
437 if (this->index > 0) {
+
438 this->index--;
+
439 }
+
440 return *(this);
+
441 }
+
+
442
+
+ +
449 Iterator it = *this;
+
450 --*(this);
+
451 return it;
+
452 }
+
+
453
+
461 bool operator!=(const Iterator &it) { return index != it.index; }
+
462
+
468 T operator*() { return elements[index]; }
+
469};
-
424
-
425#endif
-
Iterator class.
Definition splay_tree.h:337
-
Iterator & operator--()
operator – for type Iterator
Definition splay_tree.h:390
-
T operator*()
operator * for type Iterator
Definition splay_tree.h:422
-
Iterator & operator=(int64_t index)
= operator for Iterator type
Definition splay_tree.h:357
-
Iterator operator++(int)
operator ++ for type Iterator
Definition splay_tree.h:379
-
Iterator operator--(int)
operator – for type Iterator
Definition splay_tree.h:402
-
bool operator!=(const Iterator &it)
operator != for type Iterator
Definition splay_tree.h:415
-
Iterator(const int64_t &index, std::vector< T > &els) noexcept
Construct a new Iterator object.
Definition splay_tree.h:348
-
Iterator & operator++()
operator ++ for type Iterator
Definition splay_tree.h:367
-
splay tree class
Definition splay_tree.h:16
-
std::vector< T > postorder()
postorder function.
Definition splay_tree.h:161
-
void insert(T key)
insert function
Definition splay_tree.h:83
-
void clear()
clear function
Definition splay_tree.h:73
-
std::vector< T > inorder()
inorder function.
Definition splay_tree.h:133
-
splay_tree(std::vector< T > v={}) noexcept
Construct a new splay tree object.
Definition splay_tree.h:39
-
std::vector< T > preorder()
preorder function.
Definition splay_tree.h:147
-
splay_tree(const splay_tree &s)
Copy constructor for splay tree class.
Definition splay_tree.h:52
-
void remove(T key)
remove function
Definition splay_tree.h:93
-
splay_tree & operator=(const splay_tree &s)
operator = for splay tree class
Definition splay_tree.h:62
-
void visualize()
visualize function
Definition splay_tree.h:175
-
bool search(T key)
search function
Definition splay_tree.h:105
-
size_t size()
size function
Definition splay_tree.h:115
+
470
+
471#endif
+
Iterator class.
Definition splay_tree.h:383
+
Iterator & operator--()
operator – for type Iterator
Definition splay_tree.h:436
+
T operator*()
operator * for type Iterator
Definition splay_tree.h:468
+
Iterator & operator=(int64_t index)
= operator for Iterator type
Definition splay_tree.h:403
+
Iterator operator++(int)
operator ++ for type Iterator
Definition splay_tree.h:425
+
Iterator operator--(int)
operator – for type Iterator
Definition splay_tree.h:448
+
bool operator!=(const Iterator &it)
operator != for type Iterator
Definition splay_tree.h:461
+
Iterator(const int64_t &index, std::vector< T > &els) noexcept
Construct a new Iterator object.
Definition splay_tree.h:394
+
Iterator & operator++()
operator ++ for type Iterator
Definition splay_tree.h:413
+
splay tree class
Definition splay_tree.h:17
+
std::vector< T > postorder()
postorder function.
Definition splay_tree.h:162
+
std::vector< std::vector< T > > level_order()
level order function
Definition splay_tree.h:176
+
void insert(T key)
insert function
Definition splay_tree.h:84
+
void clear()
clear function
Definition splay_tree.h:74
+
std::vector< T > inorder()
inorder function.
Definition splay_tree.h:134
+
splay_tree(std::vector< T > v={}) noexcept
Construct a new splay tree object.
Definition splay_tree.h:40
+
friend ostream & operator<<(ostream &out, splay_tree< T > &t)
operator << for splay tree class
Definition splay_tree.h:211
+
std::vector< T > preorder()
preorder function.
Definition splay_tree.h:148
+
splay_tree(const splay_tree &s)
Copy constructor for splay tree class.
Definition splay_tree.h:53
+
void remove(T key)
remove function
Definition splay_tree.h:94
+
splay_tree & operator=(const splay_tree &s)
operator = for splay tree class
Definition splay_tree.h:63
+
void visualize()
visualize function
Definition splay_tree.h:203
+
bool search(T key)
search function
Definition splay_tree.h:106
+
size_t size()
size function
Definition splay_tree.h:116