temporarily completed list.go

modules/list.go

@@ -11,9 +11,10 @@ type NameList struct {
 }
 
 type NameNode struct {
-	name []int64 // Encrypt된 name
-	next *NameNode
-	list List
+	topic []int64 // Encrypt된 topic
+	next  *NameNode
+	prev  *NameNode
+	list  List
 }
 
 type List struct {
@@ -25,6 +26,7 @@ type List struct {
 type Node struct {
 	val  []int64 // Encrypt된 value
 	next *Node
+	prev *Node
 
 	// single //
 	single2sub_s  []int // (val < x) sub#
@@ -41,8 +43,49 @@ type Node struct {
 }
 
 // ### To delete slice Array
-func remove(s []int, i int) []int {
-	return append(s[:i], s[i+1:]...)
+func remove(ary []int, i int) []int {
+	return append(ary[:i], ary[i+1:]...)
+}
+
+func findSub(ary []int, sub int) int {
+	for i := 0; i < len(ary); i++ {
+		if ary[i] == sub {
+			return i
+		}
+	}
+	return -1
+}
+
+func (n *Node) isempty() bool {
+	empty := true
+	if len(n.single2sub_s) != 0 {
+		empty = false
+	}
+	if len(n.single2sub_es) != 0 {
+		empty = false
+	}
+	if len(n.single2sub_b) != 0 {
+		empty = false
+	}
+	if len(n.single2sub_eb) != 0 {
+		empty = false
+	}
+	if len(n.single2sub_e) != 0 {
+		empty = false
+	}
+	if len(n.range2sub_s) != 0 {
+		empty = false
+	}
+	if len(n.range2sub_es) != 0 {
+		empty = false
+	}
+	if len(n.range2sub_b) != 0 {
+		empty = false
+	}
+	if len(n.range2sub_eb) != 0 {
+		empty = false
+	}
+	return empty
 }
 
 // 노드의 operator리스트에 sub#을 in
@@ -74,21 +117,21 @@ func (l *Node) insert_Sub(op string, sub int, issingle bool) {
 	}
 }
 
-
-func (l *List) add_ValueNode(val string, op string, sub int, issingle bool) {
-	newValNode := &Node{conv(val), nil, nil, nil, nil, nil, nil, nil, nil, nil, nil}
-	newValNode.insert_Sub(op, sub, true)
+func (l *List) add_ValueNode(value []int64) {
+	newValNode := &Node{value, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil}
 	l.tail.next = newValNode
 	l.tail = newValNode
 	l.size++
 }
 
-func (l * List)getPos(value []int64) *Node{
+func (l *List) getPos(value []int64) *Node {
 	valptr := l.head
-	for valptr != nil{
-		if compare(valptr.val, value) == 1 { // value와 같은 val을 갖는 노드가 존재한다면
+	for valptr != nil {
+		// * compare 완성된다면 다시보기
+		if compare(valptr.val, value) == 0 { // value와 같은 val을 갖는 노드가 존재한다면
 			return valptr
-		} 
+		}
+		valptr = valptr.next
 	}
 	return nil
-}
+}