mirror of
https://github.com/encounter/dawn-cmake.git
synced 2025-08-15 16:39:07 +00:00
475941c295
Contains generic Map and Set types. Golang 1.18 added new support for generics, but has not yet added a standard library that provides generic containers. In future versions of Golang, there will almost certainly be similar implementations of these types. Until then, use these to simplify some code. 100% test coverage. Bug: dawn:1342 Change-Id: I2a5c7bfb26f15c2099037d3fa0f0576df641d9f6 Reviewed-on: https://dawn-review.googlesource.com/c/dawn/+/85220 Auto-Submit: Ben Clayton <bclayton@google.com> Reviewed-by: Ryan Harrison <rharrison@chromium.org> Commit-Queue: Ryan Harrison <rharrison@chromium.org>
63 lines
1.6 KiB
Go
63 lines
1.6 KiB
Go
// Copyright 2022 The Dawn Authors
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package container
|
|
|
|
import "sort"
|
|
|
|
// Map is a generic unordered map, which wrap's go's builtin 'map'.
|
|
// K is the map key, which must match the 'key' constraint.
|
|
// V is the map value, which can be any type.
|
|
type Map[K key, V any] map[K]V
|
|
|
|
// Returns a new empty map
|
|
func NewMap[K key, V any]() Map[K, V] {
|
|
return make(Map[K, V])
|
|
}
|
|
|
|
// Add adds an item to the map.
|
|
func (m Map[K, V]) Add(k K, v V) {
|
|
m[k] = v
|
|
}
|
|
|
|
// Remove removes an item from the map
|
|
func (m Map[K, V]) Remove(item K) {
|
|
delete(m, item)
|
|
}
|
|
|
|
// Contains returns true if the map contains the given item
|
|
func (m Map[K, V]) Contains(item K) bool {
|
|
_, found := m[item]
|
|
return found
|
|
}
|
|
|
|
// Keys returns the sorted keys of the map as a slice
|
|
func (m Map[K, V]) Keys() []K {
|
|
out := make([]K, 0, len(m))
|
|
for v := range m {
|
|
out = append(out, v)
|
|
}
|
|
sort.Slice(out, func(i, j int) bool { return out[i] < out[j] })
|
|
return out
|
|
}
|
|
|
|
// Values returns the values of the map sorted by key
|
|
func (m Map[K, V]) Values() []V {
|
|
out := make([]V, 0, len(m))
|
|
for _, k := range m.Keys() {
|
|
out = append(out, m[k])
|
|
}
|
|
return out
|
|
}
|