Run gofumpt -l -w .

Author: bep

hashstructure.go

@@ -72,29 +72,28 @@ const (
 //
 // Notes on the value:
 //
-//   * Unexported fields on structs are ignored and do not affect the
+//   - Unexported fields on structs are ignored and do not affect the
 //     hash value.
 //
-//   * Adding an exported field to a struct with the zero value will change
+//   - Adding an exported field to a struct with the zero value will change
 //     the hash value.
 //
 // For structs, the hashing can be controlled using tags. For example:
 //
-//    struct {
-//        Name string
-//        UUID string `hash:"ignore"`
-//    }
+//	struct {
+//	    Name string
+//	    UUID string `hash:"ignore"`
+//	}
 //
 // The available tag values are:
 //
-//   * "ignore" or "-" - The field will be ignored and not affect the hash code.
+//   - "ignore" or "-" - The field will be ignored and not affect the hash code.
 //
-//   * "set" - The field will be treated as a set, where ordering doesn't
-//             affect the hash code. This only works for slices.
-//
-//   * "string" - The field will be hashed as a string, only works when the
-//                field implements fmt.Stringer
+//   - "set" - The field will be treated as a set, where ordering doesn't
+//     affect the hash code. This only works for slices.
 //
+//   - "string" - The field will be hashed as a string, only works when the
+//     field implements fmt.Stringer
 func Hash(v interface{}, format Format, opts *HashOptions) (uint64, error) {
 	// Validate our format
 	if format <= formatInvalid || format >= formatMax {
@@ -422,7 +421,6 @@ func (w *walker) visit(v reflect.Value, opts *visitOpts) (uint64, error) {
 	default:
 		return 0, fmt.Errorf("unknown kind to hash: %s", k)
 	}
-
 }
 
 func hashUpdateOrdered(h hash.Hash64, a, b uint64) uint64 {
@@ -453,11 +451,11 @@ func hashUpdateUnordered(a, b uint64) uint64 {
 // hashUpdateUnordered can effectively cancel out a previous change to the hash
 // result if the same hash value appears later on. For example, consider:
 //
-//   hashUpdateUnordered(hashUpdateUnordered("A", "B"), hashUpdateUnordered("A", "C")) =
-//   H("A") ^ H("B")) ^ (H("A") ^ H("C")) =
-//   (H("A") ^ H("A")) ^ (H("B") ^ H(C)) =
-//   H(B) ^ H(C) =
-//   hashUpdateUnordered(hashUpdateUnordered("Z", "B"), hashUpdateUnordered("Z", "C"))
+//	hashUpdateUnordered(hashUpdateUnordered("A", "B"), hashUpdateUnordered("A", "C")) =
+//	H("A") ^ H("B")) ^ (H("A") ^ H("C")) =
+//	(H("A") ^ H("A")) ^ (H("B") ^ H(C)) =
+//	H(B) ^ H(C) =
+//	hashUpdateUnordered(hashUpdateUnordered("Z", "B"), hashUpdateUnordered("Z", "C"))
 //
 // hashFinishUnordered "hardens" the result, so that encountering partially
 // overlapping input data later on in a different context won't cancel out.

hashstructure_test.go

@@ -262,8 +262,9 @@ func TestHash_equalIgnore(t *testing.T) {
 		},
 		{
 			TestTime2{Name: "foo", Time: now},
-			TestTime2{Name: "foo", Time: time.Date(now.Year(), now.Month(), now.Day(), now.Hour(),
-				now.Minute(), now.Second(), now.Nanosecond(), now.Location()),
+			TestTime2{
+				Name: "foo", Time: time.Date(now.Year(), now.Month(), now.Day(), now.Hour(),
+					now.Minute(), now.Second(), now.Nanosecond(), now.Location()),
 			},
 			true,
 		},