ToolsSyncObj

Documentation

Index

• type SyncMap
  • func (m *SyncMap) Delete(key interface{}) (res bool)
  • func (m *SyncMap) Length() *int64
  • func (m *SyncMap) Load(key interface{}) (value interface{}, ok bool)
  • func (m *SyncMap) LoadOrStore(key, value interface{}) (actual interface{}, loaded bool)
  • func (m *SyncMap) Range(f func(key, value interface{}) bool)
  • func (m *SyncMap) Store(key, value interface{})
• type SyncQueue
  • func NewSyncQueue() *SyncQueue
  • func (q *SyncQueue) Close()
  • func (q *SyncQueue) Closed() bool
  • func (q *SyncQueue) Len() (l int)
  • func (q *SyncQueue) LoadFromFile(filename string)
  • func (q *SyncQueue) Pop() (v interface{})
  • func (q *SyncQueue) Push(v interface{})
  • func (q *SyncQueue) SaveToFile(filename string)
  • func (q *SyncQueue) TryPop() (v interface{})

Types

type SyncMap

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

SyncMap is a concurrent map with amortized-constant-time loads, stores, and deletes. It is safe for multiple goroutines to call a SyncMap's methods concurrently.

It is optimized for use in concurrent loops with keys that are stable over time, and either few steady-state stores, or stores localized to one goroutine per key.

For use cases that do not share these attributes, it will likely have comparable or worse performance and worse type safety than an ordinary map paired with a read-write mutex.

The zero SyncMap is valid and empty.

A SyncMap must not be copied after first use.

func (*SyncMap) Delete

func (m *SyncMap) Delete(key interface{}) (res bool)

Delete deletes the value for a key.

func (*SyncMap) Length

func (m *SyncMap) Length() *int64

func (*SyncMap) Load

func (m *SyncMap) 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 (*SyncMap) LoadOrStore

func (m *SyncMap) 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 (*SyncMap) Range

func (m *SyncMap) 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 SyncMap'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 (*SyncMap) Store

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

Store sets the value for a key.

type SyncQueue

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

Synchronous FIFO queue

func NewSyncQueue

func NewSyncQueue() *SyncQueue

Create a new SyncQueue

func (*SyncQueue) Close

func (q *SyncQueue) Close()

Close SyncQueue

After close, Pop will return nil without block, and TryPop will return v=nil, ok=True

func (*SyncQueue) Closed

func (q *SyncQueue) Closed() bool

func (*SyncQueue) Len

func (q *SyncQueue) Len() (l int)

Get the length of SyncQueue

func (*SyncQueue) LoadFromFile

func (q *SyncQueue) LoadFromFile(filename string)

func (*SyncQueue) Pop

func (q *SyncQueue) Pop() (v interface{})

Pop an item from SyncQueue, will block if SyncQueue is empty

func (*SyncQueue) Push

func (q *SyncQueue) Push(v interface{})

Push an item to SyncQueue. Always returns immediately without blocking

func (*SyncQueue) SaveToFile

func (q *SyncQueue) SaveToFile(filename string)

func (*SyncQueue) TryPop

func (q *SyncQueue) TryPop() (v interface{})