Add func to manage node, sub ..

modules/list.go

@@ -13,7 +13,6 @@ type NameList struct {
 type NameNode struct {
 	name []int64 // Encrypt된 name
 	next *NameNode
-
 	list List
 }
 
@@ -43,6 +42,53 @@ type Node struct {
 
 // ### To delete slice Array
 func remove(s []int, i int) []int {
-	s[i] = s[len(s)-1]
-	return s[:len(s)-1]
+	return append(s[:i], s[i+1:]...)
+}
+
+// 노드의 operator리스트에 sub#을 in
+func (l *Node) insert_Sub(op string, sub int, issingle bool) {
+	if issingle == true {
+		switch op {
+		case "<":
+			l.single2sub_s = append(l.single2sub_s, sub)
+		case "<=":
+			l.single2sub_es = append(l.single2sub_es, sub)
+		case ">":
+			l.single2sub_b = append(l.single2sub_b, sub)
+		case ">=":
+			l.single2sub_eb = append(l.single2sub_eb, sub)
+		case "==":
+			l.single2sub_e = append(l.single2sub_e, sub)
+		}
+	} else {
+		switch op {
+		case "<":
+			l.range2sub_s = append(l.range2sub_s, sub)
+		case "<=":
+			l.range2sub_es = append(l.range2sub_es, sub)
+		case ">":
+			l.range2sub_b = append(l.range2sub_b, sub)
+		case ">=":
+			l.range2sub_eb = append(l.range2sub_eb, sub)
+		}
+	}
 }
+
+
+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)
+	l.tail.next = newValNode
+	l.tail = newValNode
+	l.size++
+}
+
+func (l * List)getPos(value []int64) *Node{
+	valptr := l.head
+	for valptr != nil{
+		if compare(valptr.val, value) == 1 { // value와 같은 val을 갖는 노드가 존재한다면
+			return valptr
+		} 
+	}
+	return nil
+}