# HG changeset patch
# User Mikael Berthe <mikael@lilotux.net>
# Date 1404049624 -7200
# Node ID 4e3a67dc70a077bcb86e11cfd31cabb590ad65b2
# Parent  ea4286b6c4b18bf136436dc08ba6ad93efcca7c5
Cosmetics (go fmt and comments...)

diff -r ea4286b6c4b1 -r 4e3a67dc70a0 goduf.go
--- a/goduf.go	Sun Jun 29 15:39:21 2014 +0200
+++ b/goduf.go	Sun Jun 29 15:47:04 2014 +0200
@@ -286,7 +286,6 @@
 	}
 }
 
-
 func (fileList FileObjList) scheduleChecksum(sType sumType) {
 	for _, fo := range fileList {
 		fo.needHash = sType
@@ -320,7 +319,6 @@
 			scheduleFull = append(scheduleFull, l)
 		} else { // full checksums -> we're done
 			dupeList = append(dupeList, l)
-			// TODO: sort by increasing size
 			myLog.Printf(5, "  . found %d new duplicates\n", len(l))
 		}
 	}
@@ -362,7 +360,6 @@
 		r := l.findDupesChecksums(fullChecksum)
 		dupeList = append(dupeList, r...)
 	}
-	// TODO: sort by increasing size
 	return dupeList
 }
 
@@ -406,13 +403,13 @@
 		// "Unique" of the fileObj to mark them to be discarded
 		// and remove them all at the end.
 		for {
-			type devinode struct { dev, ino uint64 }
+			type devinode struct{ dev, ino uint64 }
 			devinodes := make(map[devinode]bool)
 			var hardLinkIndex int
 
 			for i, fo := range *sgListP {
 				dev, ino := GetDevIno(fo)
-				di := devinode{ dev, ino}
+				di := devinode{dev, ino}
 				if _, hlink := devinodes[di]; hlink {
 					hardLinkIndex = i
 					hardLinkCount++
@@ -560,6 +557,7 @@
 	if len(result) > 0 && !summary {
 		myLog.Println(1, "* Dupes:")
 	}
+	// TODO: sort by increasing size
 	var dupeSize uint64
 	data.cmpt = 0
 	for i, l := range result {