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
|
/*
* ========================
* ===== ===============
* ====== ================
* ====== ================
* ====== ==== ==== ==
* ====== === == = =
* ====== === = == =
* = === === = == ====
* = === === = == = =
* == ===== ==== ==
* ========================
*
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2023-2024, Joe
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* 3. Neither the name of the organization nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ''AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*
* hardflip: src/c_litems.go
* Wed Dec 27 18:55:37 2023
* Joe
*
* the dir and hosts linked list
*/
package main
type ItemsNode struct {
ID int
Dirs *DirsNode
Host *HostNode
prev *ItemsNode
next *ItemsNode
}
type ItemsList struct {
head *ItemsNode
last *ItemsNode
}
func (litems *ItemsList) is_dir(id int) bool {
curr := litems.head
if curr == nil {
return false
}
for curr.next != nil && curr.ID != id {
curr = curr.next
}
if curr.ID != id {
return false
}
if curr.Dirs != nil {
return true
}
return false
}
func (litems *ItemsList) add_back(node *ItemsNode) {
if litems.head == nil {
litems.head = node
litems.last = litems.head
return
}
last := litems.last
node.ID = last.ID + 1
node.prev = last
last.next = node
litems.last = last.next
}
func (item *ItemsNode) is_dir() bool {
if item.Dirs == nil {
return false
}
return true
}
func (item *ItemsNode) inc(jump int) *ItemsNode {
if jump == 0 {
return item
} else if jump == 1 {
return item.next
} else if jump == -1 {
return item.prev
}
new_item := item
if jump > 0 {
for i := 0; new_item != nil && i < jump; i++ {
new_item = new_item.next
}
return new_item
}
for i := 0; new_item != nil && i > jump; i-- {
new_item = new_item.prev
}
return new_item
}
|
