mirror of
https://github.com/v2rayA/v2rayA.git
synced 2026-11-20 23:02:25 +03:00
Which.LocateServerRaw read and parsed every stored node for each lookup, so a loop over n whiches cost n reads: the latency test, the config generation for a group, the touch and the subscription update each scaled with the square of the node count. A Locator reads each list on first use and resolves every which of the loop against it; the single lookups keep LocateServerRaw. Resolving 1000 subscription nodes drops from 1.1 s to 1.6 ms (BenchmarkLocateAll vs BenchmarkLocatorAll).