blob: 688b7561ce8b1e5bf947edde9b6c84709ce7c49d (
plain)
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
|
module html
const (
null_element = int(0x80000000)
)
struct Stack {
mut:
elements []int
size int
}
[inline]
fn is_null(data int) bool {
return data == html.null_element
}
[inline]
fn (stack Stack) is_empty() bool {
return stack.size <= 0
}
fn (stack Stack) peek() int {
return if !stack.is_empty() { stack.elements[stack.size - 1] } else { html.null_element }
}
fn (mut stack Stack) pop() int {
mut to_return := html.null_element
if !stack.is_empty() {
to_return = stack.elements[stack.size - 1]
stack.size--
}
return to_return
}
fn (mut stack Stack) push(item int) {
if stack.elements.len > stack.size {
stack.elements[stack.size] = item
} else {
stack.elements << item
}
stack.size++
}
struct BTree {
mut:
all_tags []Tag
node_pointer int
childrens [][]int
parents []int
}
fn (mut btree BTree) add_children(tag Tag) int {
btree.all_tags << tag
if btree.all_tags.len > 1 {
for btree.childrens.len <= btree.node_pointer {
mut temp_array := btree.childrens
temp_array << []int{}
btree.childrens = temp_array
}
btree.childrens[btree.node_pointer] << btree.all_tags.len - 1
for btree.parents.len < btree.all_tags.len {
mut temp_array := btree.parents
temp_array << 0
btree.parents = temp_array
}
btree.parents[btree.all_tags.len - 1] = btree.node_pointer
}
return btree.all_tags.len - 1
}
[inline]
fn (btree BTree) get_children() []int {
return btree.childrens[btree.node_pointer]
}
[inline]
fn (btree BTree) get_parent() int {
return btree.parents[btree.node_pointer]
}
[inline]
fn (btree BTree) get_stored() Tag {
return btree.all_tags[btree.node_pointer]
}
fn (mut btree BTree) move_pointer(to int) {
if to < btree.all_tags.len {
btree.node_pointer = to
}
}
|
