mcobj/sideCache.go at master · danielrh/mcobj · GitHub

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
package main

import (
	"nbt"
)

type SideCache struct {
	chunks map[uint64]*ChunkSides
}

func (s *SideCache) Clear() {
	s.chunks = nil
}

func (s *SideCache) AddChunk(chunk *nbt.Chunk) {
	if s.HasSide(chunk.XPos, chunk.ZPos) {
		return
	}

	if s.chunks == nil {
		s.chunks = make(map[uint64]*ChunkSides)
	}

	s.chunks[s.key(chunk.XPos, chunk.ZPos)] = calculateSides(chunk.Blocks)
}

func (s *SideCache) HasSide(x, z int) bool {
	if s.chunks == nil {
		return false
	}
	var _, present = s.chunks[s.key(x, z)]
	return present
}

func (s *SideCache) EncloseChunk(chunk *nbt.Chunk) *EnclosedChunk {
	return &EnclosedChunk{
		chunk.XPos,
		chunk.ZPos,
		chunk.Blocks,
		EnclosingSides{
			s.getSide(chunk.XPos-1, chunk.ZPos, 1),
			s.getSide(chunk.XPos+1, chunk.ZPos, 0),
			s.getSide(chunk.XPos, chunk.ZPos-1, 3),
			s.getSide(chunk.XPos, chunk.ZPos+1, 2),
		},
	}
}

func calculateSides(blocks Blocks) *ChunkSides {
	var sides = &ChunkSides{&ChunkSide{}, &ChunkSide{}, &ChunkSide{}, &ChunkSide{}}
	for i := 0; i < 16; i++ {
		copy(sides[0].Column(i), blocks.Column(0, i))
		copy(sides[1].Column(i), blocks.Column(15, i))
		copy(sides[2].Column(i), blocks.Column(i, 0))
		copy(sides[3].Column(i), blocks.Column(i, 15))
	}

	return sides
}

func (s *SideCache) getSide(x, z int, side int) *ChunkSide {
	if s.chunks == nil {
		return defaultSide
	}
	var chunk, present = s.chunks[s.key(x, z)]
	if !present {
		return defaultSide
	}

	var chunkSide = chunk[side]

	chunk[side] = nil

	if chunk[0] == nil && chunk[1] == nil && chunk[2] == nil && chunk[3] == nil {
		s.chunks[s.key(x, z)] = nil, false
	}

	return chunkSide
}

func (s *SideCache) key(x, z int) uint64 {
	return (uint64(x) << 32) + uint64(z)
}