type internal/sync.HashTrieMap
20 uses
internal/sync (current package)
hashtriemap.go#L21: type HashTrieMap[K comparable, V any] struct {
hashtriemap.go#L30: func (ht *HashTrieMap[K, V]) init() {
hashtriemap.go#L37: func (ht *HashTrieMap[K, V]) initSlow() {
hashtriemap.go#L64: func (ht *HashTrieMap[K, V]) Load(key K) (value V, ok bool) {
hashtriemap.go#L88: func (ht *HashTrieMap[K, V]) LoadOrStore(key K, value V) (result V, loaded bool) {
hashtriemap.go#L167: func (ht *HashTrieMap[K, V]) expand(oldEntry, newEntry *entry[K, V], newHash uintptr, hashShift uint, parent *indirect[K, V]) *node[K, V] {
hashtriemap.go#L199: func (ht *HashTrieMap[K, V]) Store(key K, old V) {
hashtriemap.go#L205: func (ht *HashTrieMap[K, V]) Swap(key K, new V) (previous V, loaded bool) {
hashtriemap.go#L280: func (ht *HashTrieMap[K, V]) CompareAndSwap(key K, old, new V) (swapped bool) {
hashtriemap.go#L309: func (ht *HashTrieMap[K, V]) LoadAndDelete(key K) (value V, loaded bool) {
hashtriemap.go#L359: func (ht *HashTrieMap[K, V]) Delete(key K) {
hashtriemap.go#L368: func (ht *HashTrieMap[K, V]) CompareAndDelete(key K, old V) (deleted bool) {
hashtriemap.go#L426: func (ht *HashTrieMap[K, V]) find(key K, hash uintptr, valEqual equalFunc, value V) (i *indirect[K, V], hashShift uint, slot *atomic.Pointer[node[K, V]], n *node[K, V]) {
hashtriemap.go#L481: func (ht *HashTrieMap[K, V]) All() func(yield func(K, V) bool) {
hashtriemap.go#L493: func (ht *HashTrieMap[K, V]) Range(yield func(K, V) bool) {
hashtriemap.go#L498: func (ht *HashTrieMap[K, V]) iter(i *indirect[K, V], yield func(key K, value V) bool) bool {
hashtriemap.go#L522: func (ht *HashTrieMap[K, V]) Clear() {
sync
hashtriemap.go#L43: m isync.HashTrieMap[any, any]
unique
handle.go#L101: uniqueMaps isync.HashTrieMap[*abi.Type, any] // any is always a *uniqueMap[T].
handle.go#L117: isync.HashTrieMap[T, weak.Pointer[T]]