TheAlgorithms/C++ 1.0.0
All the algorithms implemented in C++
|
Public Member Functions | |
Node (int key, int level, void *value=nullptr) | |
Public Attributes | |
int | key |
key integer | |
void * | value |
pointer of value | |
std::vector< std::shared_ptr< Node > > | forward |
nodes of the given one in all levels | |
Node structure [Key][Node*, Node*...]
Definition at line 33 of file skip_list.cpp.
|
inline |
Creates node with provided key, level and value
key | is number that is used for comparision |
level | is the maximum level node's going to added |
Definition at line 44 of file skip_list.cpp.
std::vector<std::shared_ptr<Node> > data_structures::Node::forward |
nodes of the given one in all levels
Definition at line 37 of file skip_list.cpp.
int data_structures::Node::key |
key integer
Definition at line 34 of file skip_list.cpp.
void* data_structures::Node::value |
pointer of value
Definition at line 35 of file skip_list.cpp.