github.com/lann/ps.tree.children (field)

19 uses

	github.com/lann/ps (current package)
		map.go#L63: 	children [childCount]*tree
		map.go#L73: 	for i := range nilMap.children {
		map.go#L74: 		nilMap.children[i] = nilMap
		map.go#L133: 		m.children[i] = setLowLevel(self.children[i], partialHash>>shiftSize, hash, key, value)
		map.go#L148: 	for _, t := range m.children {
		map.go#L168: 		child, found := deleteLowLevel(self.children[i], partialHash>>shiftSize, hash)
		map.go#L173: 		newMap.children[i] = child
		map.go#L196: 	for j, t := range self.children {
		map.go#L204: 	replacement, child := self.children[i].deleteLeftmost()
		map.go#L206: 	for j := range self.children {
		map.go#L208: 			newMap.children[j] = child
		map.go#L210: 			newMap.children[j] = self.children[j]
		map.go#L224: 	for i, t := range m.children {
		map.go#L228: 			newMap.children[i] = child
		map.go#L244: 	for _, t := range m.children {
		map.go#L264: 		return lookupLowLevel(self.children[i], partialHash>>shiftSize, hash)
		map.go#L284: 	for _, t := range m.children {