blob: e414d416ee756b1a1b5a3fe340070c37cc14fbbd (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
|
// Copyright 2011 Google Inc. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include "stat_cache.h"
#include <stdio.h>
#include "edit_distance.h"
#include "graph.h"
Node* StatCache::GetFile(const std::string& path) {
Node* node = LookupFile(path);
if (node)
return node;
node = new Node(path);
paths_[node->path().c_str()] = node;
return node;
}
Node* StatCache::LookupFile(const std::string& path) {
Paths::iterator i = paths_.find(path.c_str());
if (i != paths_.end())
return i->second;
return NULL;
}
Node* StatCache::SpellcheckFile(const std::string& path) {
const bool kAllowReplacements = true;
const int kMaxValidEditDistance = 3;
int min_distance = kMaxValidEditDistance + 1;
Node* result = NULL;
for (Paths::iterator i = paths_.begin(); i != paths_.end(); ++i) {
int distance = EditDistance(
i->first, path, kAllowReplacements, kMaxValidEditDistance);
if (distance < min_distance && i->second) {
min_distance = distance;
result = i->second;
}
}
return result;
}
void StatCache::Dump() {
for (Paths::iterator i = paths_.begin(); i != paths_.end(); ++i) {
Node* node = i->second;
printf("%s %s\n",
node->path().c_str(),
node->status_known() ? (node->dirty() ? "dirty" : "clean")
: "unknown");
}
}
void StatCache::Invalidate() {
for (Paths::iterator i = paths_.begin(); i != paths_.end(); ++i)
i->second->ResetState();
}
|
