VERSION.txt: this is v1.78.0v1.78.0

Signed-off-by: Nick Khyl <nickk@tailscale.com>

2 files changed, 84 insertions, 84 deletions

diff --git a/util/set/handle.go b/util/set/handle.go
index 471ceeba2..61b4eb93d 100644
--- a/util/set/handle.go
+++ b/util/set/handle.go
@@ -1,28 +1,28 @@
-// Copyright (c) Tailscale Inc & AUTHORS
-// SPDX-License-Identifier: BSD-3-Clause
-
-package set
-
-// HandleSet is a set of T.
-//
-// It is not safe for concurrent use.
-type HandleSet[T any] map[Handle]T
-
-// Handle is an opaque comparable value that's used as the map key in a
-// HandleSet. The only way to get one is to call HandleSet.Add.
-type Handle struct {
-	v *byte
-}
-
-// Add adds the element (map value) e to the set.
-//
-// It returns the handle (map key) with which e can be removed, using a map
-// delete.
-func (s *HandleSet[T]) Add(e T) Handle {
-	h := Handle{new(byte)}
-	if *s == nil {
-		*s = make(HandleSet[T])
-	}
-	(*s)[h] = e
-	return h
-}
+// Copyright (c) Tailscale Inc & AUTHORS

+// SPDX-License-Identifier: BSD-3-Clause

+

+package set

+

+// HandleSet is a set of T.

+//

+// It is not safe for concurrent use.

+type HandleSet[T any] map[Handle]T

+

+// Handle is an opaque comparable value that's used as the map key in a

+// HandleSet. The only way to get one is to call HandleSet.Add.

+type Handle struct {

+	v *byte

+}

+

+// Add adds the element (map value) e to the set.

+//

+// It returns the handle (map key) with which e can be removed, using a map

+// delete.

+func (s *HandleSet[T]) Add(e T) Handle {

+	h := Handle{new(byte)}

+	if *s == nil {

+		*s = make(HandleSet[T])

+	}

+	(*s)[h] = e

+	return h

+}

diff --git a/util/set/slice_test.go b/util/set/slice_test.go
index 9134c2962..ca57e52e8 100644
--- a/util/set/slice_test.go
+++ b/util/set/slice_test.go
@@ -1,56 +1,56 @@
-// Copyright (c) Tailscale Inc & AUTHORS
-// SPDX-License-Identifier: BSD-3-Clause
-
-package set
-
-import (
-	"testing"
-
-	qt "github.com/frankban/quicktest"
-)
-
-func TestSliceSet(t *testing.T) {
-	c := qt.New(t)
-
-	var ss Slice[int]
-	c.Check(len(ss.slice), qt.Equals, 0)
-	ss.Add(1)
-	c.Check(len(ss.slice), qt.Equals, 1)
-	c.Check(len(ss.set), qt.Equals, 0)
-	c.Check(ss.Contains(1), qt.Equals, true)
-	c.Check(ss.Contains(2), qt.Equals, false)
-
-	ss.Add(1)
-	c.Check(len(ss.slice), qt.Equals, 1)
-	c.Check(len(ss.set), qt.Equals, 0)
-
-	ss.Add(2)
-	ss.Add(3)
-	ss.Add(4)
-	ss.Add(5)
-	ss.Add(6)
-	ss.Add(7)
-	ss.Add(8)
-	c.Check(len(ss.slice), qt.Equals, 8)
-	c.Check(len(ss.set), qt.Equals, 0)
-
-	ss.Add(9)
-	c.Check(len(ss.slice), qt.Equals, 9)
-	c.Check(len(ss.set), qt.Equals, 9)
-
-	ss.Remove(4)
-	c.Check(len(ss.slice), qt.Equals, 8)
-	c.Check(len(ss.set), qt.Equals, 8)
-	c.Assert(ss.Contains(4), qt.IsFalse)
-
-	// Ensure that the order of insertion is maintained
-	c.Assert(ss.Slice().AsSlice(), qt.DeepEquals, []int{1, 2, 3, 5, 6, 7, 8, 9})
-	ss.Add(4)
-	c.Check(len(ss.slice), qt.Equals, 9)
-	c.Check(len(ss.set), qt.Equals, 9)
-	c.Assert(ss.Contains(4), qt.IsTrue)
-	c.Assert(ss.Slice().AsSlice(), qt.DeepEquals, []int{1, 2, 3, 5, 6, 7, 8, 9, 4})
-
-	ss.Add(1, 234, 556)
-	c.Assert(ss.Slice().AsSlice(), qt.DeepEquals, []int{1, 2, 3, 5, 6, 7, 8, 9, 4, 234, 556})
-}
+// Copyright (c) Tailscale Inc & AUTHORS

+// SPDX-License-Identifier: BSD-3-Clause

+

+package set

+

+import (

+	"testing"

+

+	qt "github.com/frankban/quicktest"

+)

+

+func TestSliceSet(t *testing.T) {

+	c := qt.New(t)

+

+	var ss Slice[int]

+	c.Check(len(ss.slice), qt.Equals, 0)

+	ss.Add(1)

+	c.Check(len(ss.slice), qt.Equals, 1)

+	c.Check(len(ss.set), qt.Equals, 0)

+	c.Check(ss.Contains(1), qt.Equals, true)

+	c.Check(ss.Contains(2), qt.Equals, false)

+

+	ss.Add(1)

+	c.Check(len(ss.slice), qt.Equals, 1)

+	c.Check(len(ss.set), qt.Equals, 0)

+

+	ss.Add(2)

+	ss.Add(3)

+	ss.Add(4)

+	ss.Add(5)

+	ss.Add(6)

+	ss.Add(7)

+	ss.Add(8)

+	c.Check(len(ss.slice), qt.Equals, 8)

+	c.Check(len(ss.set), qt.Equals, 0)

+

+	ss.Add(9)

+	c.Check(len(ss.slice), qt.Equals, 9)

+	c.Check(len(ss.set), qt.Equals, 9)

+

+	ss.Remove(4)

+	c.Check(len(ss.slice), qt.Equals, 8)

+	c.Check(len(ss.set), qt.Equals, 8)

+	c.Assert(ss.Contains(4), qt.IsFalse)

+

+	// Ensure that the order of insertion is maintained

+	c.Assert(ss.Slice().AsSlice(), qt.DeepEquals, []int{1, 2, 3, 5, 6, 7, 8, 9})

+	ss.Add(4)

+	c.Check(len(ss.slice), qt.Equals, 9)

+	c.Check(len(ss.set), qt.Equals, 9)

+	c.Assert(ss.Contains(4), qt.IsTrue)

+	c.Assert(ss.Slice().AsSlice(), qt.DeepEquals, []int{1, 2, 3, 5, 6, 7, 8, 9, 4})

+

+	ss.Add(1, 234, 556)

+	c.Assert(ss.Slice().AsSlice(), qt.DeepEquals, []int{1, 2, 3, 5, 6, 7, 8, 9, 4, 234, 556})

+}