type github.com/lann/ps.tree

25 uses

	github.com/lann/ps (current package)
		map.go#L58: type tree struct {
		map.go#L63: 	children [childCount]*tree
		map.go#L66: var nilMap = &tree{}
		map.go#L85: func (self *tree) IsNil() bool {
		map.go#L90: func (self *tree) clone() *tree {
		map.go#L91: 	var m tree
		map.go#L115: func (self *tree) Set(key string, value Any) Map {
		map.go#L120: func setLowLevel(self *tree, partialHash, hash uint64, key string, value Any) *tree {
		map.go#L146: func recalculateCount(m *tree) {
		map.go#L154: func (m *tree) Delete(key string) Map {
		map.go#L160: func deleteLowLevel(self *tree, partialHash, hash uint64) (*tree, bool) {
		map.go#L219: func (m *tree) deleteLeftmost() (*tree, *tree) {
		map.go#L237: func (m *tree) isLeaf() bool {
		map.go#L242: func (m *tree) subtreeCount() int {
		map.go#L252: func (m *tree) Lookup(key string) (Any, bool) {
		map.go#L257: func lookupLowLevel(self *tree, partialHash, hash uint64) (Any, bool) {
		map.go#L271: func (m *tree) Size() int {
		map.go#L275: func (m *tree) ForEach(f func(key string, val Any)) {
		map.go#L291: func (m *tree) Keys() []string {
		map.go#L302: func (m *tree) String() string {