go fmt

weed/util/skiplist/name_list.go

@@ -21,42 +21,43 @@ Be reluctant to create new nodes. Try to fit into either previous node or next n
 Prefer to add to previous node.
 
 There are multiple cases after finding the name for greater or equal node
+
  1. found and node.Key == name
     The node contains a batch with leading key the same as the name
     nothing to do
+
  2. no such node found or node.Key > name
 
     if no such node found
-      prevNode = list.LargestNode
+    prevNode = list.LargestNode
 
-	// case 2.1
+    // case 2.1
     if previousNode contains name
-      nothing to do
+    nothing to do
 
     // prefer to add to previous node
     if prevNode != nil {
-		// case 2.2
-		if prevNode has capacity
-			prevNode.add name, and save
-			return
-		// case 2.3
-		split prevNode by name
+    // case 2.2
+    if prevNode has capacity
+    prevNode.add name, and save
+    return
+    // case 2.3
+    split prevNode by name
     }
 
-	// case 2.4
-	// merge into next node. Avoid too many nodes if adding data in reverse order.
-	if nextNode is not nil and nextNode has capacity
-	  delete nextNode.Key
-      nextNode.Key = name
-      nextNode.batch.add name
-      insert nodeNode.Key
-	  return
+    // case 2.4
+    // merge into next node. Avoid too many nodes if adding data in reverse order.
+    if nextNode is not nil and nextNode has capacity
+    delete nextNode.Key
+    nextNode.Key = name
+    nextNode.batch.add name
+    insert nodeNode.Key
+    return
 
-	// case 2.5
+    // case 2.5
     if prevNode is nil
-      insert new node with key = name, value = batch{name}
-      return
-
+    insert new node with key = name, value = batch{name}
+    return
 */
 func (nl *NameList) WriteName(name string) error {
 
@@ -160,36 +161,45 @@ func (nl *NameList) WriteName(name string) error {
 
 /*
 // case 1: exists in nextNode
-if nextNode != nil && nextNode.Key == name {
-	remove from nextNode, update nextNode
-	// TODO: merge with prevNode if possible?
-	return
-}
+
+	if nextNode != nil && nextNode.Key == name {
+		remove from nextNode, update nextNode
+		// TODO: merge with prevNode if possible?
+		return
+	}
+
 if nextNode is nil
+
 	prevNode = list.Largestnode
+
 if prevNode == nil and nextNode.Prev != nil
+
 	prevNode = load(nextNode.Prev)
 
 // case 2: does not exist
 // case 2.1
-if prevNode == nil {
-	return
-}
+
+	if prevNode == nil {
+		return
+	}
+
 // case 2.2
-if prevNameBatch does not contain name {
-	return
-}
+
+	if prevNameBatch does not contain name {
+		return
+	}
 
 // case 3
 delete from prevNameBatch
 if prevNameBatch + nextNode < capacityList
+
 	// case 3.1
 	merge
+
 else
+
 	// case 3.2
 	update prevNode
-
-
 */
 func (nl *NameList) DeleteName(name string) error {
 	lookupKey := []byte(name)