auto ParentCost = Cache.lookup(Next.front());
for (auto Child : DownEdges.lookup(Next.front())) {
auto &ChildCost =
- Cache.try_emplace(Child, kUnreachable).first->getSecond();
+ Cache.try_emplace(Child, Unreachable).first->getSecond();
if (ParentCost + Opts.DownCost < ChildCost)
ChildCost = ParentCost + Opts.DownCost;
Next.push(Child);
unsigned FileDistance::distance(StringRef Path) {
auto Canonical = canonicalize(Path);
- unsigned Cost = kUnreachable;
+ unsigned Cost = Unreachable;
SmallVector<hash_code, 16> Ancestors;
// Walk up ancestors until we find a path we know the distance for.
for (StringRef Rest = Canonical; !Rest.empty();
// Now we know the costs for (known node, queried node].
// Fill these in, walking down the directory tree.
for (hash_code Hash : reverse(Ancestors)) {
- if (Cost != kUnreachable)
+ if (Cost != Unreachable)
Cost += Opts.DownCost;
Cache.try_emplace(Hash, Cost);
}
}
unsigned URIDistance::distance(llvm::StringRef URI) {
- auto R = Cache.try_emplace(llvm::hash_value(URI), FileDistance::kUnreachable);
+ auto R = Cache.try_emplace(llvm::hash_value(URI), FileDistance::Unreachable);
if (!R.second)
return R.first->getSecond();
if (auto U = clangd::URI::parse(URI)) {
// This object should be reused, it memoizes intermediate computations.
class FileDistance {
public:
- static constexpr unsigned kUnreachable = std::numeric_limits<unsigned>::max();
+ static constexpr unsigned Unreachable = std::numeric_limits<unsigned>::max();
FileDistance(llvm::StringMap<SourceParams> Sources,
const FileDistanceOptions &Opts = {});