From a707d710b58e5921d7f7131932f48f7e7860e7bd Mon Sep 17 00:00:00 2001
From: enqidu <dachikurcxalia@gmail.com>
Date: Sun, 12 Jul 2020 19:24:46 +0400
Subject: [PATCH] update

---
 data_structures/skip_list.cpp | 15 +++++----------
 1 file changed, 5 insertions(+), 10 deletions(-)

diff --git a/data_structures/skip_list.cpp b/data_structures/skip_list.cpp
index 6159506a0..f0a17815a 100644
--- a/data_structures/skip_list.cpp
+++ b/data_structures/skip_list.cpp
@@ -26,12 +26,9 @@ using std::endl;
  *  Node structure [Key][Node*, Node*...]
 */
 struct Node { 
-    int key;
-    // pointer of value 
-    void* value;
-    // Forward Array points to the neighbour (right)
-    // nodes of the given one in all levels
-    vector<Node*> forward;
+    int key; ///< key integer
+    void* value;  ///< pointer of value 
+    vector<Node*> forward;  ///< nodes of the given one in all levels
     // Constructor of the node
     Node(int key, int level, void* value); 
 };
@@ -54,10 +51,8 @@ Node::Node(int key, int level, void* value) {
  * SkipList class implementation with basic methods
 */
 class SkipList { 
-    // Maximum level of the skiplist
-    int level; 
-    // Pointer to the header node
-    Node *header; 
+    int level;  ///< Maximum level of the skiplist
+    Node *header; ///< Pointer to the header node
 public: 
     SkipList(); 
     int randomLevel();