type internal/concurrent.HashTrieMap

10 uses

	internal/concurrent (current package)
		hashtriemap.go#L20: type HashTrieMap[K, V comparable] struct {
		hashtriemap.go#L29: func NewHashTrieMap[K, V comparable]() *HashTrieMap[K, V] {
		hashtriemap.go#L32: 	ht := &HashTrieMap[K, V]{
		hashtriemap.go#L48: func (ht *HashTrieMap[K, V]) Load(key K) (value V, ok bool) {
		hashtriemap.go#L71: func (ht *HashTrieMap[K, V]) LoadOrStore(key K, value V) (result V, loaded bool) {
		hashtriemap.go#L149: func (ht *HashTrieMap[K, V]) expand(oldEntry, newEntry *entry[K, V], newHash uintptr, hashShift uint, parent *indirect[K, V]) *node[K, V] {
		hashtriemap.go#L184: func (ht *HashTrieMap[K, V]) CompareAndDelete(key K, old V) (deleted bool) {
		hashtriemap.go#L278: func (ht *HashTrieMap[K, V]) All() func(yield func(K, V) bool) {
		hashtriemap.go#L284: func (ht *HashTrieMap[K, V]) iter(i *indirect[K, V], yield func(key K, value V) bool) bool {

	unique
		handle.go#L110: 	*concurrent.HashTrieMap[T, weak.Pointer[T]]