|
MDList
|
An implementation of "An Efficient Lock-free Logarithmic Search Data Structure Based on Multi-dimensional List". More...
#include <vector>#include <mutex>#include <cmath>#include <exception>#include <iostream>Go to the source code of this file.
Classes | |
| class | Node< T > |
| Node class. More... | |
| class | MDList< T > |
| MDList class MDList is a dictionary based datastruture which stores (key, value) pairs. More... | |
Macros | |
| #define | ULL unsigned long long |
Functions | |
| long | nthRoot (ULL X, int n) |
| Finds nth root of given number. More... | |
| vector< int > | keyToCoordinates (ULL key, int D, ULL N) |
| Converts key to node coordinates. More... | |
| template<class T > | |
| void | printMDList (MDList< T > mdList) |
| Prints MDList. More... | |
| template<class T > | |
| void | findAndPrint (MDList< T > mdlist, ULL key) |
| Finds and prints node for given key. More... | |
An implementation of "An Efficient Lock-free Logarithmic Search Data Structure Based on Multi-dimensional List".
From 2016 IEEE 36th International Conference on Distributed Computing Systems.
| #define ULL unsigned long long |
Finds and prints node for given key.
Only for debug purposes.
| mdlist | The mdlist. |
| key | The key. |
Converts key to node coordinates.
| key | The key. |
| D | D value of MDList. |
| N | The key space. |
| long nthRoot | ( | ULL | X, |
| int | n | ||
| ) |
Finds nth root of given number.
| X | The number. |
| n | The root. |
1.8.14