2023-09-29 14:31:02 -07:00
|
|
|
// 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
|
2025-10-02 18:29:54 -07:00
|
|
|
// HandleSet.
|
2023-09-29 14:31:02 -07:00
|
|
|
type Handle struct {
|
|
|
|
|
v *byte
|
|
|
|
|
}
|
|
|
|
|
|
2025-10-02 18:29:54 -07:00
|
|
|
// NewHandle returns a new handle value.
|
|
|
|
|
func NewHandle() Handle {
|
|
|
|
|
return Handle{new(byte)}
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-29 14:31:02 -07:00
|
|
|
// Add adds the element (map value) e to the set.
|
|
|
|
|
//
|
2025-10-02 18:29:54 -07:00
|
|
|
// It returns a new handle (map key) with which e can be removed, using a map
|
|
|
|
|
// delete or the [HandleSet.Delete] method.
|
2023-09-29 14:31:02 -07:00
|
|
|
func (s *HandleSet[T]) Add(e T) Handle {
|
2025-10-02 18:29:54 -07:00
|
|
|
h := NewHandle()
|
2023-09-29 14:31:02 -07:00
|
|
|
if *s == nil {
|
|
|
|
|
*s = make(HandleSet[T])
|
|
|
|
|
}
|
|
|
|
|
(*s)[h] = e
|
|
|
|
|
return h
|
|
|
|
|
}
|
2025-10-02 18:29:54 -07:00
|
|
|
|
|
|
|
|
// Delete removes the element with handle h from the set.
|
|
|
|
|
func (s HandleSet[T]) Delete(h Handle) { delete(s, h) }
|