[fix] delete

src/broker/modules/subscription.go

 	"errors"
 )
 
+// Structure for managing subscriptions
 type sub_manager struct {
-	list topicList
-
-	/* Manage sub# */
-	count_sub  int                  // Subscription #
-	emptylist  []int                // To administrate sub #
-	ip2sub     map[string][]int     // ip2sub[ip] = sub# ...
-	sub2ip     map[int]string       // sub2ip[sub#] = ip
-	sub2node   map[int][]nodeInfo // sub2node[sub#] = node_addr ...
-	israngesub map[int]bool         // To manage when deleted
+	list 	   	topicList			// Data Structure for Manage TopicNode
+	count_sub  	int                 // Subscription#
+	emptylist  	[]int               // For administrate Subscription#(Deleted)
+	ip2sub     	map[string][]int    // For mapping {ip : Sub#s List}
+	sub2ip     	map[int]string      // For mapping {Sub# : ip}
+	sub2node   	map[int][]nodeInfo 	// For mapping {Sub# : NodeInfo List}
+	israngesub 	map[int]bool        // To manage when deleted
 }
 
 type nodeInfo struct{
 		}
 		addValNodeList = append(addValNodeList, valptr)
 		manager.sub2node[subnumber] = append(manager.sub2node[subnumber], nodeInfo{addValNodeList, topic})
+		manager.israngesub[subnumber] = false
 		valptr.insertSub(operator[0], subnumber, true)
 		return nil // AddSubscription ok
 	} else {
 
 		} else {
 			// if they are enclosed in '||' -> Insert Value to single_operator_list
+			manager.israngesub[subnumber] = false
 			valptr1.insertSub(operator[0], subnumber, true)
 			valptr2.insertSub(operator[2], subnumber, true)
 		}
 		for j := 0; j < len(manager.sub2node[sub]); j++ {
 			nodeinfo := manager.sub2node[sub][j]
 			node := nodeinfo.valNodeList
+
 			if manager.israngesub[sub] {
 				for k := 0; k < len(node); k++ {
 					pos := findSub(node[k].range2sub_s, sub)
 						node[k].range2sub_eb = remove(node[k].range2sub_eb, pos)
 						manager.emptylist = append(manager.emptylist, sub)
 					}
-
-					isempty := node[k].isEmpty()
-
-					// Delete if Value Node is empty
-					if isempty && node[k] != nil {
-						prev_node := node[k].prev
-						next_node := node[k].next
-
-						prev_node.next = node[k].next
-						next_node.prev = node[k].prev
-					}
 				}
 			} else {
 				for k := 0; k < len(node); k++ {
 						manager.emptylist = append(manager.emptylist, sub)
 					}
 
-					isempty := node[k].isEmpty()
-
-					// Delete if Value Node is empty
-					if isempty && node[k] != nil {
-						prevNode := node[k].prev
-						nextNode := node[k].next
-
-						prevNode.next = node[k].next
-						nextNode.prev = node[k].prev
-					}
 				}
 			}
 		}