-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathchunk_hashmap.h
112 lines (95 loc) · 1.53 KB
/
chunk_hashmap.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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
#pragma once
#include "chunk.h"
struct ChunkHashMap
{
Chunk *chunks[441];
int numChunks;
ChunkHashMap()
{
numChunks = 0;
memset(chunks,0,sizeof(chunks));
}
inline int mod(int x, int m)
{
int r = x%m;
return r<0 ? r+m : r;
}
int hash(int x, int z)
{
return mod(x,21) + mod(z,21) * 21;
}
Chunk *getChunk(int x, int z)
{
Chunk *chunk = chunks[hash(x,z)];
if(chunk == NULL)
return NULL;
do
{
if(chunk->x == x && chunk->z == z)
return chunk;
chunk = chunk->next;
} while(chunk != NULL);
return NULL;
}
void _delete(int x, int z)
{
int _hash = hash(x,z);
Chunk *chunk = chunks[_hash];
if(chunk == NULL)
return;
if(chunk->x == x && chunk->z == z)
{
chunks[_hash] = chunk->next;
delete chunk;
}
else
{
Chunk *prev = chunk;
chunk = chunk->next;
while(chunk != NULL)
{
if(chunk->x == x && chunk->z == z)
break;
prev = chunk;
chunk = chunk->next;
}
if(chunk != NULL)
{
prev->next = chunk->next;
delete chunk;
}
}
}
void insert(Chunk *_chunk, int x, int z)
{
numChunks++;
int _hash = hash(x,z);
if(chunks[_hash] == NULL)
{
chunks[_hash] = _chunk;
return;
}
else
{
Chunk *chunk = chunks[_hash];
while(chunk->next != NULL)
chunk = chunk->next;
chunk->next = _chunk;
}
}
void clear()
{
for(int i=0;i<441;i++)
{
Chunk *chunk = chunks[i];
while(chunk != NULL)
{
Chunk *temp = chunk->next;
delete chunk;
chunk = temp;
}
chunks[i] = NULL;
}
numChunks = 0;
}
};