-
Notifications
You must be signed in to change notification settings - Fork 0
/
DummyRankBasedNode.h
38 lines (28 loc) · 1001 Bytes
/
DummyRankBasedNode.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#ifndef _DummyRankBasedNode_H_
#define _DummyRankBasedNode_H_
#include "RankBasedNode.h"
/*------------------------------------------------------------------------
* Class: DummyRankBasedNode.h
*
* Purpose: for rebuilding the skip list out of a proof vector
*
*
*------------------------------------------------------------------------
*/
class DummyRankBasedNode : public RankBasedNode {
public:
DummyRankBasedNode(Key k=0, int lvl=0)
: RankBasedNode(k, lvl){}
virtual void calculateHash(ZZ modulus, ZZ element) {
/*DO NOTHING*/
//As this node is dummy, it should just return the value provided in the begining since it is not meant to be changed
}
void calculateRank(int diff = 1){
/*DO NOTHING*/
//As this node is dummy, it should just return the value provided in the begining since it is not meant to be changed
}
private:
friend class RankBasedSkipList;
friend class AuthenticatedSkipList;
};
#endif /*_DummyRankBasedNode_H_*/