shared

package

v1.0.4 Latest Latest Go to latest Published: Apr 3, 2022 License: Unlicense Imports: 2 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

Repository

github.com/industry-netsecurity-solution/ins-security-channel

Links

Open Source Insights

Documentation ¶

Index ¶

type ConcurrentList
- func NewConcurrentList() *ConcurrentList
type ConcurrentMap
- func NewConcurrentMap() *ConcurrentMap
type Pair

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

This section is empty.

Types ¶

type ConcurrentList ¶

type ConcurrentList struct {
	sync.RWMutex
	// contains filtered or unexported fields
}

func NewConcurrentList ¶

func NewConcurrentList() *ConcurrentList

func (*ConcurrentList) Back ¶

func (v *ConcurrentList) Back() *list.Element

func (*ConcurrentList) Front ¶

func (v *ConcurrentList) Front() *list.Element

func (*ConcurrentList) Init ¶

func (v *ConcurrentList) Init()

func (*ConcurrentList) InsertAfter ¶

func (v *ConcurrentList) InsertAfter(e interface{}, mark *list.Element) *list.Element

func (*ConcurrentList) InsertBefore ¶

func (v *ConcurrentList) InsertBefore(e interface{}, mark *list.Element) *list.Element

func (*ConcurrentList) Iterate ¶

func (v *ConcurrentList) Iterate(cb func(element *list.Element) bool)

func (*ConcurrentList) Len ¶

func (v *ConcurrentList) Len() int

func (*ConcurrentList) MoveAfter ¶

func (v *ConcurrentList) MoveAfter(e, mark *list.Element)

func (*ConcurrentList) MoveBefore ¶

func (v *ConcurrentList) MoveBefore(e, mark *list.Element)

func (*ConcurrentList) MoveToBack ¶

func (v *ConcurrentList) MoveToBack(e *list.Element)

func (*ConcurrentList) MoveToFront ¶

func (v *ConcurrentList) MoveToFront(e *list.Element)

func (*ConcurrentList) PushBack ¶

func (v *ConcurrentList) PushBack(e interface{}) *list.Element

func (*ConcurrentList) PushBackList ¶

func (v *ConcurrentList) PushBackList(other *list.List)

func (*ConcurrentList) PushFront ¶

func (v *ConcurrentList) PushFront(e interface{}) *list.Element

func (*ConcurrentList) PushFrontList ¶

func (v *ConcurrentList) PushFrontList(other *list.List)

func (*ConcurrentList) Remove ¶

func (v *ConcurrentList) Remove(e *list.Element) interface{}

type ConcurrentMap ¶

type ConcurrentMap struct {
	sync.RWMutex
	// contains filtered or unexported fields
}

func NewConcurrentMap ¶

func NewConcurrentMap() *ConcurrentMap

func (*ConcurrentMap) Get ¶

func (m *ConcurrentMap) Get(key interface{}) (interface{}, bool)

func (*ConcurrentMap) GetPair ¶

func (m *ConcurrentMap) GetPair(key interface{}) (Pair, bool)

func (*ConcurrentMap) Has ¶

func (m *ConcurrentMap) Has(key interface{}) bool

func (*ConcurrentMap) Len ¶

func (m *ConcurrentMap) Len() int

func (*ConcurrentMap) Range ¶

func (m *ConcurrentMap) Range(cb func(interface{}, interface{}) bool)

func (*ConcurrentMap) Remove ¶

func (m *ConcurrentMap) Remove(key interface{}) (interface{}, bool)

func (*ConcurrentMap) RemoveAll ¶

func (m *ConcurrentMap) RemoveAll()

func (*ConcurrentMap) Set ¶

func (m *ConcurrentMap) Set(key interface{}, value interface{}) (interface{}, bool)

func (*ConcurrentMap) SetPair ¶

func (m *ConcurrentMap) SetPair(pair *Pair) (interface{}, bool)

func (*ConcurrentMap) ToArray ¶

func (m *ConcurrentMap) ToArray() []Pair

type Pair ¶

type Pair struct {
	Key   interface{}
	Value interface{}
}

Source Files ¶

View all Source files

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