159 	nodes        pathMap
467 type pathMap struct {  struct
472 	children map[string]*pathMap  argument
478 func newPathMap(path string) *pathMap {
479 	result := &pathMap{path: path, children: make(map[string]*pathMap, 4),
485 func (m *pathMap) GetNode(path string, createIfNotFound bool) *pathMap {  argument
520 func (m *pathMap) newChild(name string) (child *pathMap) {  argument
528 func (m *pathMap) UpdateNumDescendents() int {  argument
537 func (m *pathMap) UpdateNumDescendentsRecursive() {  argument
544 func (m *pathMap) MergeIn(other *pathMap) {  argument
559 func (m *pathMap) DumpAll() []dirFullInfo {  argument
565 func (m *pathMap) dumpInto(path string, results *[]dirFullInfo) {  argument
789 func (f *Finder) loadBytes(id int, data []byte) (m *pathMap, dirsToWalk []string, err error) {
854 	nodesToWalk := [][]*pathMap{}
898 		tree        *pathMap
974 			updatedNodes := make([]*pathMap, len(result.updatedDirs))
1250 func (f *Finder) statDirAsync(dir *pathMap) {
1361 func (f *Finder) listDirsAsync(nodes []*pathMap) {
1371 func (f *Finder) listDirAsync(node *pathMap) {
1379 func (f *Finder) listDirSync(dir *pathMap) {
1426 	relevantChildren := map[string]*pathMap{}
1453 func (f *Finder) listMatches(node *pathMap,
1454 	filter WalkFunc) (subDirs []*pathMap, filePaths []string) {
1465 	subDirs = []*pathMap{}
1470 	subDirs = make([]*pathMap, 0, len(dirNames))
1482 func (f *Finder) findInCacheMultithreaded(node *pathMap, filter WalkFunc,
1501 		childProcessor := func(child *pathMap) {
1523 func (f *Finder) findInCacheSinglethreaded(node *pathMap, filter WalkFunc) []string {
1528 	nodes := []*pathMap{node}