gotools/go/callgraph/vta/internal/trie/trie.go

type Map

func (m Map) Scope() Scope {}

func (m Map) Size() int {}

func (m Map) Lookup(k uint64) (interface{}

// Converts the map into a {<key>: <value>[, ...]} string. This uses the default
// %s string conversion for <value>.
func (m Map) String() string {}

// Range over the leaf (key, value) pairs in the map in order and
// applies cb(key, value) to each. Stops early if cb returns false.
// Returns true if all elements were visited without stopping early.
func (m Map) Range(cb func(uint64, interface{}

// DeepEqual returns true if m and other contain the same (k, v) mappings
// [regardless of Scope].
//
// Equivalently m.DeepEqual(other) <=> reflect.DeepEqual(Elems(m), Elems(other))
func (m Map) DeepEqual(other Map) bool {}

// Elems are the (k,v) elements in the Map as a map[uint64]interface{}
func Elems(m Map) map[uint64]interface{}

type node

type empty

type leaf

type branch

var _

var _

var _

func (*empty) nodeImpl()  {}

func (*leaf) nodeImpl()   {}

func (*branch) nodeImpl() {}

func (*empty) find(k key) *leaf {}

func (l *leaf) find(k key) *leaf {}

func (br *branch) find(k key) *leaf {}

func (*empty) size() int     {}

func (*leaf) size() int      {}

func (br *branch) size() int {}

func (*empty) deepEqual(m node) bool {}

func (l *leaf) deepEqual(m node) bool {}

func (br *branch) deepEqual(m node) bool {}

func (*empty) visit(cb func(uint64, interface{}

func (l *leaf) visit(cb func(uint64, interface{}

func (br *branch) visit(cb func(uint64, interface{}