spottedcat 0.3.8

Rusty SpottedCat simple game engine
Documentation 
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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151

package packing

import (
	"errors"
	"image"
)

//ErrTooSmall packer is too small error
var ErrTooSmall = errors.New("packer is too small")

//Packer pack rectangle
//        B
//   ------------
//   |rect1|    |             A
//   ------------ A          / \
//   |          |           B   .
//   |          |          / \
//   ------------       rect1  .
//
//          B
//  -------------
//  |       |    |           A
//  |    1  |    |          /  \
//  |------------|A       B     C
//  |  2 |       |      /  \   /  \
//  |    |       |    rect1 . D    .
//d |----|       |           / \
//  |    |       |        rect2 .
//  --------------
//       c
//
type Packer struct {
	root *node
}

//New return a new packer with width and height
func New(w, h int) *Packer {

	root := &node{x: 0, y: 0, w: w, h: h, left: new(node), right: new(node)}

	return &Packer{root: root}
}

// Size return packer's size with and height
func (p *Packer) Size() (int, int) {
	return p.root.w, p.root.h
}

//Insert return Rectangle width final postion
func (p *Packer) Insert(rc image.Rectangle) (image.Rectangle, error) {

	w, h := rc.Dx(), rc.Dy()
	nd := p.root.insert(&node{w: w, h: h}, true)

	if nd == nil {
		return image.Rectangle{}, ErrTooSmall
	}

	rect := image.Rect(nd.x, nd.y, nd.x+nd.w, nd.y+nd.h)

	return rect, nil

}

//Grow packer
//           A
//         /   \
//        B     .
//       /  \
// old root  .
//
func (p *Packer) Grow(width, height int) {
	nd := p.root
	w, h := p.root.w, p.root.h
	p.root = &node{x: 0, y: 0, w: w + width, h: h + height}

	p.root.insert(nd, false)

}

type node struct {
	left, right *node
	x, y, w, h  int
	split       bool
	isEnd       bool
}

func (nd *node) insert(rect *node, isEnd bool) *node {

	if nd.split {
		n := nd.left.insert(rect, isEnd)

		if n != nil {
			return n
		}

		return nd.right.insert(rect, isEnd)

	}

	if nd.isEnd {
		return nil
	}

	if nd.w < rect.w || nd.h < rect.h {
		return nil
	}

	nd.split = true

	if nd.w == rect.w && nd.h == rect.h {

		rect.x = nd.x
		rect.y = nd.y
		nd.isEnd = true
		nd.left = rect
		nd.right = &node{w: 0, h: 0}

		return rect
	}

	dw := nd.w - rect.w
	dh := nd.h - rect.h

	// insert node is down's sibling, they are left's left and right
	var left, right, down *node

	if dw > dh {
		left = &node{x: nd.x, y: nd.y, w: nd.w, h: nd.h - rect.h, split: true}

		down = &node{x: nd.x, y: nd.y + rect.h, w: nd.w - rect.w, h: nd.h - rect.h}
		right = &node{x: nd.x + rect.w, y: nd.y, w: nd.w - rect.w, h: nd.h}

	} else {
		left = &node{x: nd.x, y: nd.y, w: rect.w, h: nd.h, split: true}

		down = &node{x: nd.x, y: nd.y + rect.h, w: nd.w, h: nd.h - rect.h}
		right = &node{x: nd.x + rect.w, y: nd.y, w: nd.w - rect.w, h: rect.h}

	}
	rect.x = right.x - rect.w
	rect.y = down.y - rect.h
	rect.isEnd = isEnd

	left.left = rect
	left.right = down
	nd.left = left
	nd.right = right
	return rect

}