Method ColdDiscoverSubdirs

src/SharedDirWatcher.cpp:405–494

void CSharedDirWatcher::ColdDiscoverSubdirs()
{
	if (!m_watcher) {
		return;
	}

	thePrefs::PathList & shared = theApp->glob_prefs->shareddir_list;
	if (shared.empty()) {
		return;
	}

	// Walk only the user's recursive roots, not every shared dir.
	// Non-recursive (explicit) shares are strict: their pre-existing
	// subdirs do NOT get auto-included. Same policy as the HOT path
	// (RegisterNewSubdirectory) -- both auto-add behaviours gate on
	// IsRecursiveAncestor.
	const thePrefs::PathList & roots =
		theApp->glob_prefs->shareddir_recursive_list;
	if (roots.empty()) {
		return;
	}

	// Membership index over the current list: avoids O(N*M) string
	// comparisons when M (newly-discovered subdirs) is large. Keys are
	// raw path strings -- matches the comparison RegisterNewSubdirectory
	// uses for its own dedup check, just lifted into a set.
	// std::set rather than unordered_set: wxString has operator< but
	// no stdlib std::hash specialization, and N here is at most a
	// few thousand even on heavy users -- log-N membership is fine.
	std::set<wxString> known;
	for (size_t i = 0; i < shared.size(); ++i) {
		known.insert(shared[i].GetRaw());
	}

	// Discovered new subdirs go here; we add them in bulk after the
	// walk so a single SaveSharedFolders() flushes the whole batch
	// rather than rewriting shareddir.dat once per discovery.
	std::vector<CPath> discovered;

	// Walk each recursive root's subtree. CSharedFileList's Reload
	// already handled the root itself; this surfaces previously-
	// uncovered descendants only.
	for (size_t i = 0; i < roots.size(); ++i) {
		const CPath & root = roots[i];
		if (!root.IsOk() || !root.DirExists()) {
			continue;
		}
		WalkForUnknownSubdirs(root, known, discovered);
	}

	if (discovered.empty()) {
		return;
	}

	for (size_t i = 0; i < discovered.size(); ++i) {
		const CPath & sub = discovered[i];
		shared.push_back(sub);
#ifndef __WXOSX__