1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
|
// Copyright (C) 2022-2023 Luke Shumaker <lukeshu@lukeshu.com>
//
// SPDX-License-Identifier: GPL-2.0-or-later
package containers
type orderedKV[K Ordered[K], V any] struct {
K K
V V
}
func (a orderedKV[K, V]) Compare(b orderedKV[K, V]) int {
return a.K.Compare(b.K)
}
type SortedMap[K Ordered[K], V any] struct {
inner RBTree[orderedKV[K, V]]
}
var _ SubrangeMap[NativeOrdered[int], string] = (*SortedMap[NativeOrdered[int], string])(nil)
func (m *SortedMap[K, V]) Delete(key K) {
m.inner.Delete(m.inner.Search(func(kv orderedKV[K, V]) int {
return key.Compare(kv.K)
}))
}
func (m *SortedMap[K, V]) Load(key K) (value V, ok bool) {
node := m.inner.Search(func(kv orderedKV[K, V]) int {
return key.Compare(kv.K)
})
if node == nil {
var zero V
return zero, false
}
return node.Value.V, true
}
func (m *SortedMap[K, V]) Has(key K) bool {
node := m.inner.Search(func(kv orderedKV[K, V]) int {
return key.Compare(kv.K)
})
return node != nil
}
func (m *SortedMap[K, V]) Store(key K, value V) {
m.inner.Insert(orderedKV[K, V]{
K: key,
V: value,
})
}
func (m *SortedMap[K, V]) Range(fn func(key K, value V) bool) {
m.inner.Range(func(node *RBNode[orderedKV[K, V]]) bool {
return fn(node.Value.K, node.Value.V)
})
}
func (m *SortedMap[K, V]) Subrange(rangeFn func(K, V) int, handleFn func(K, V) bool) {
m.inner.Subrange(
func(kv orderedKV[K, V]) int { return rangeFn(kv.K, kv.V) },
func(node *RBNode[orderedKV[K, V]]) bool { return handleFn(node.Value.K, node.Value.V) })
}
func (m *SortedMap[K, V]) Search(fn func(K, V) int) (K, V, bool) {
node := m.inner.Search(func(kv orderedKV[K, V]) int {
return fn(kv.K, kv.V)
})
if node == nil {
var zeroK K
var zeroV V
return zeroK, zeroV, false
}
return node.Value.K, node.Value.V, true
}
func (m *SortedMap[K, V]) Len() int {
return m.inner.Len()
}
|
