-
Notifications
You must be signed in to change notification settings - Fork 30
/
HashTable.h
62 lines (49 loc) · 1.47 KB
/
HashTable.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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
/*
* This file is part of the BSGS distribution (https://github.com/JeanLucPons/BSGS).
* Copyright (c) 2020 Jean Luc PONS.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, version 3.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef HASHTABLEH
#define HASHTABLEH
#include <string>
#include <vector>
#include "SECPK1/Int.h"
#ifdef WIN64
#include <Windows.h>
#endif
#define HASH_SIZE_BIT 25
#define HASH_SIZE (1<<HASH_SIZE_BIT)
#define HASH_MASK (HASH_SIZE-1)
#define B0MASK 0xFFFFFFF0ULL
// 36bit for offset, MAX 2^36 point in HashTable
typedef struct {
uint32_t b0; // LSB key (28 bit) + HSB Offset (4 bit)
uint32_t p; // LSB Offset
} ENTRY;
class HashTable {
public:
HashTable();
void Add(Int *x, uint64_t p);
bool Get(Int *x, std::vector<uint64_t> &p);
uint64_t GetNbItem();
void Reset();
double GetSizeMB();
void PrintInfo();
void Sort(uint32_t h);
private:
ENTRY *E[HASH_SIZE];
uint16_t M[HASH_SIZE]; // Max
uint16_t C[HASH_SIZE]; // Count
};
#endif // HASHTABLEH