253 lines
4.9 KiB
Go
253 lines
4.9 KiB
Go
package level
|
|
|
|
import (
|
|
"io"
|
|
"math/bits"
|
|
"strconv"
|
|
|
|
pk "github.com/Tnze/go-mc/net/packet"
|
|
)
|
|
|
|
type state = int
|
|
|
|
type PaletteContainer struct {
|
|
bits int
|
|
config func(bits int) palette
|
|
palette palette
|
|
data *BitStorage
|
|
}
|
|
|
|
func NewStatesPaletteContainer(length int, defaultValue state) *PaletteContainer {
|
|
return &PaletteContainer{
|
|
bits: 0,
|
|
config: createStatesPalette,
|
|
palette: &singleValuePalette{v: defaultValue},
|
|
data: NewBitStorage(0, length, nil),
|
|
}
|
|
}
|
|
|
|
func NewStatesPaletteContainerWithData(length int, data []uint64, palette []int) *PaletteContainer {
|
|
n := bits.Len(uint(len(palette)))
|
|
return &PaletteContainer{
|
|
bits: n,
|
|
config: createStatesPalette,
|
|
palette: &linearPalette{
|
|
values: palette,
|
|
bits: n,
|
|
},
|
|
data: NewBitStorage(n, length, data),
|
|
}
|
|
}
|
|
|
|
func NewBiomesPaletteContainer(length int, defaultValue state) *PaletteContainer {
|
|
return &PaletteContainer{
|
|
bits: 0,
|
|
config: createBiomesPalette,
|
|
palette: &singleValuePalette{v: defaultValue},
|
|
data: NewBitStorage(0, length, nil),
|
|
}
|
|
}
|
|
|
|
func (p *PaletteContainer) Get(i int) state {
|
|
return p.palette.value(p.data.Get(i))
|
|
}
|
|
|
|
func (p *PaletteContainer) Set(i int, v state) {
|
|
if vv, ok := p.palette.id(v); ok {
|
|
p.data.Set(i, vv)
|
|
} else {
|
|
// resize
|
|
oldLen := p.data.Len()
|
|
newPalette := PaletteContainer{
|
|
bits: vv,
|
|
config: p.config,
|
|
palette: p.config(vv),
|
|
data: NewBitStorage(vv, oldLen+1, nil),
|
|
}
|
|
// copy
|
|
for i := 0; i < oldLen; i++ {
|
|
raw := p.data.Get(i)
|
|
if vv, ok := newPalette.palette.id(raw); !ok {
|
|
panic("not reachable")
|
|
} else {
|
|
newPalette.data.Set(i, vv)
|
|
}
|
|
}
|
|
|
|
if vv, ok := newPalette.palette.id(v); !ok {
|
|
panic("not reachable")
|
|
} else {
|
|
newPalette.data.Set(oldLen, vv)
|
|
}
|
|
*p = newPalette
|
|
}
|
|
}
|
|
|
|
func (p *PaletteContainer) ReadFrom(r io.Reader) (n int64, err error) {
|
|
var bits pk.UnsignedByte
|
|
n, err = bits.ReadFrom(r)
|
|
if err != nil {
|
|
return
|
|
}
|
|
p.palette = p.config(int(bits))
|
|
|
|
nn, err := p.palette.ReadFrom(r)
|
|
n += nn
|
|
if err != nil {
|
|
return n, err
|
|
}
|
|
|
|
nn, err = p.data.ReadFrom(r)
|
|
n += nn
|
|
if err != nil {
|
|
return n, err
|
|
}
|
|
return n, nil
|
|
}
|
|
|
|
func createStatesPalette(bits int) palette {
|
|
switch bits {
|
|
case 0:
|
|
return &singleValuePalette{v: -1}
|
|
case 1, 2, 3, 4:
|
|
return &linearPalette{bits: 4, values: make([]state, 0, 1<<4)}
|
|
case 5, 6, 7, 8:
|
|
// TODO: HashMapPalette
|
|
return &linearPalette{bits: bits, values: make([]state, 0, 1<<bits)}
|
|
default:
|
|
return &globalPalette{}
|
|
}
|
|
}
|
|
|
|
func createBiomesPalette(bits int) palette {
|
|
switch bits {
|
|
case 0:
|
|
return &singleValuePalette{v: -1}
|
|
case 1, 2, 3:
|
|
return &linearPalette{bits: bits, values: make([]state, 0, 1<<bits)}
|
|
default:
|
|
return &globalPalette{}
|
|
}
|
|
}
|
|
|
|
func (p *PaletteContainer) WriteTo(w io.Writer) (n int64, err error) {
|
|
return pk.Tuple{
|
|
pk.UnsignedByte(p.bits),
|
|
p.palette,
|
|
p.data,
|
|
}.WriteTo(w)
|
|
}
|
|
|
|
type palette interface {
|
|
pk.FieldEncoder
|
|
pk.FieldDecoder
|
|
id(v state) (int, bool)
|
|
value(i int) state
|
|
}
|
|
|
|
type singleValuePalette struct {
|
|
v state
|
|
}
|
|
|
|
func (s *singleValuePalette) id(v state) (int, bool) {
|
|
if s.v == v {
|
|
return 0, true
|
|
}
|
|
// We have 2 values now. At least 1 bit is required.
|
|
return 1, false
|
|
}
|
|
|
|
func (s *singleValuePalette) value(i int) state {
|
|
if i == 0 {
|
|
return s.v
|
|
}
|
|
panic("singleValuePalette: " + strconv.Itoa(i) + " out of bounds")
|
|
}
|
|
|
|
func (s *singleValuePalette) ReadFrom(r io.Reader) (n int64, err error) {
|
|
var i pk.VarInt
|
|
n, err = i.ReadFrom(r)
|
|
if err != nil {
|
|
return
|
|
}
|
|
s.v = state(i)
|
|
return
|
|
}
|
|
|
|
func (s *singleValuePalette) WriteTo(w io.Writer) (n int64, err error) {
|
|
return pk.VarInt(s.v).WriteTo(w)
|
|
}
|
|
|
|
type linearPalette struct {
|
|
values []state
|
|
bits int
|
|
}
|
|
|
|
func (l *linearPalette) id(v state) (int, bool) {
|
|
for i, t := range l.values {
|
|
if t == v {
|
|
return i, true
|
|
}
|
|
}
|
|
if cap(l.values)-len(l.values) > 0 {
|
|
l.values = append(l.values, v)
|
|
return len(l.values) - 1, true
|
|
}
|
|
return l.bits + 1, false
|
|
}
|
|
|
|
func (l *linearPalette) value(i int) state {
|
|
if i >= 0 && i < len(l.values) {
|
|
return l.values[i]
|
|
}
|
|
panic("linearPalette: " + strconv.Itoa(i) + " out of bounds")
|
|
}
|
|
|
|
func (l *linearPalette) ReadFrom(r io.Reader) (n int64, err error) {
|
|
var size, value pk.VarInt
|
|
if n, err = size.ReadFrom(r); err != nil {
|
|
return
|
|
}
|
|
for i := 0; i < int(size); i++ {
|
|
if nn, err := value.ReadFrom(r); err != nil {
|
|
return n + nn, err
|
|
} else {
|
|
n += nn
|
|
}
|
|
l.values[i] = state(value)
|
|
}
|
|
return
|
|
}
|
|
|
|
func (l *linearPalette) WriteTo(w io.Writer) (n int64, err error) {
|
|
if n, err = pk.VarInt(len(l.values)).WriteTo(w); err != nil {
|
|
return
|
|
}
|
|
for _, v := range l.values {
|
|
if nn, err := pk.VarInt(v).WriteTo(w); err != nil {
|
|
return n + nn, err
|
|
} else {
|
|
n += nn
|
|
}
|
|
}
|
|
return
|
|
}
|
|
|
|
type globalPalette struct{}
|
|
|
|
func (g *globalPalette) id(v state) (int, bool) {
|
|
return v, true
|
|
}
|
|
|
|
func (g *globalPalette) value(i int) state {
|
|
return g.value(i)
|
|
}
|
|
|
|
func (g *globalPalette) ReadFrom(_ io.Reader) (int64, error) {
|
|
return 0, nil
|
|
}
|
|
|
|
func (g *globalPalette) WriteTo(_ io.Writer) (int64, error) {
|
|
return 0, nil
|
|
}
|