package concurrent

Import Path
	internal/concurrent (on go.dev)

Dependency Relation
	imports 6 packages, and imported by one package

Involved Source Files

	    hashtriemap.go
Package-Level Type Names (only one)

	/* sort by: alphabet | popularity */
	 type HashTrieMap[K, V] (struct)

		Type Parameters:
			K: comparable
			V: comparable

		HashTrieMap is an implementation of a concurrent hash-trie. The implementation
		is designed around frequent loads, but offers decent performance for stores
		and deletes as well, especially if the map is larger. It's primary use-case is
		the unique package, but can be used elsewhere as well.

		Methods (total 4)
			(*HashTrieMap[K, V]) All() func(yield func(K, V) bool)
				All returns an iter.Seq2 that produces all key-value pairs in the map.
				The enumeration does not represent any consistent snapshot of the map,
				but is guaranteed to visit each unique key-value pair only once. It is
				safe to operate on the tree during iteration. No particular enumeration
				order is guaranteed.

			(*HashTrieMap[K, V]) CompareAndDelete(key K, old V) (deleted bool)
				CompareAndDelete deletes the entry for key if its value is equal to old.
				
				If there is no current value for key in the map, CompareAndDelete returns false
				(even if the old value is the nil interface value).

			(*HashTrieMap[K, V]) Load(key K) (value V, ok bool)
				Load returns the value stored in the map for a key, or nil if no
				value is present.
				The ok result indicates whether value was found in the map.

			(*HashTrieMap[K, V]) LoadOrStore(key K, value V) (result V, loaded bool)
				LoadOrStore returns the existing value for the key if present.
				Otherwise, it stores and returns the given value.
				The loaded result is true if the value was loaded, false if stored.

		As Outputs Of (at least one exported)
			func NewHashTrieMap[K, V]() *HashTrieMap[K, V]


Package-Level Functions (only one)

	 func NewHashTrieMap[K, V]() *HashTrieMap[K, V]

		Type Parameters:
			K: comparable
			V: comparable

		NewHashTrieMap creates a new HashTrieMap for the provided key and value.

The pages are generated with Golds v0.7.0-preview. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @zigo_101 (reachable from the left QR code) to get the latest news of Golds.