utils

package
v0.1.12 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Mar 27, 2024 License: Apache-2.0 Imports: 5 Imported by: 0

Documentation

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

func MakeUserAgent added in v0.1.9

func MakeUserAgent(suffix string, version string) string

Types

type Cache

type Cache struct {
	sync.Mutex
	// contains filtered or unexported fields
}

Cache implements simple cache optimized for concurrent reads. Items are evicted in the order of their creation.

func NewCache

func NewCache(maxSize int) *Cache

NewCache creates new Cache

func (*Cache) Add

func (c *Cache) Add(key interface{}, value interface{}) bool

Add adds a key/value mapping to the cache if it doesn't already exist. Returns true if the mapping was added and false otherwise.

func (*Cache) Get

func (c *Cache) Get(key interface{}) (interface{}, bool)

Get gets the value by key, returns (nil, false) if the value is not found. It also updates Hit/Miss counts

func (*Cache) GetStats added in v0.1.11

func (c *Cache) GetStats() (int, int, uint64, uint64)

GetHitMiss returns Hit/Miss counts

func (*Cache) UpdateSize added in v0.1.11

func (c *Cache) UpdateSize(newMaxSize int) bool

UpdateSize updates the cache size. This function takes care of fragmentation in keys after the update is done. Returns true if the cache size is updated otherwise it returns false.

type Map

type Map struct {
	// contains filtered or unexported fields
}

Map is like a Go map[interface{}]interface{} but is safe for concurrent use by multiple goroutines without additional locking or coordination. Loads, stores, and deletes run in amortized constant time.

The Map type is specialized. Most code should use a plain Go map instead, with separate locking or coordination, for better type safety and to make it easier to maintain other invariants along with the map content.

The Map type is optimized for two common use cases: (1) when the entry for a given key is only ever written once but read many times, as in caches that only grow, or (2) when multiple goroutines read, write, and overwrite entries for disjoint sets of keys. In these two cases, use of a Map may significantly reduce lock contention compared to a Go map paired with a separate Mutex or RWMutex.

The zero Map is empty and ready for use. A Map must not be copied after first use.

func (*Map) Delete

func (m *Map) Delete(key interface{})

Delete deletes the value for a key.

func (*Map) Load

func (m *Map) Load(key interface{}) (value interface{}, 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.

func (*Map) LoadOrStore

func (m *Map) LoadOrStore(key, value interface{}) (actual interface{}, 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.

func (*Map) Range

func (m *Map) Range(f func(key, value interface{}) bool)

Range calls f sequentially for each key and value present in the map. If f returns false, range stops the iteration.

Range does not necessarily correspond to any consistent snapshot of the Map's contents: no key will be visited more than once, but if the value for any key is stored or deleted concurrently, Range may reflect any mapping for that key from any point during the Range call.

Range may be O(N) with the number of elements in the map even if f returns false after a constant number of calls.

func (*Map) Store

func (m *Map) Store(key, value interface{})

Store sets the value for a key.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL