blob: afec855ac94eb53c7cc42eef0486bb2e5cfe9d26 (
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
|
/* Copyright 2016 Software Freedom Conservancy Inc.
*
* This software is licensed under the GNU LGPL (version 2.1 or later).
* See the COPYING file in this distribution.
*/
public class HierarchicalTagIndex {
private Gee.Map<string, Gee.Collection<string>> tag_table;
private Gee.SortedSet<string> known_paths;
public HierarchicalTagIndex( ) {
this.tag_table = new Gee.HashMap<string, Gee.ArrayList<string>>();
this.known_paths = new Gee.TreeSet<string>();
}
public static HierarchicalTagIndex from_paths(Gee.Collection<string> client_paths) {
Gee.Collection<string> paths = client_paths.read_only_view;
HierarchicalTagIndex result = new HierarchicalTagIndex();
foreach (string path in paths) {
if (path.has_prefix(Tag.PATH_SEPARATOR_STRING)) {
Gee.Collection<string> components =
HierarchicalTagUtilities.enumerate_path_components(path);
foreach (string component in components)
result.add_path(component, path);
} else {
result.add_path(path, path);
}
}
return result;
}
public static HierarchicalTagIndex get_global_index() {
return HierarchicalTagIndex.from_paths(Tag.global.get_all_names());
}
public void add_path(string tag, string path) {
if (!tag_table.has_key(tag)) {
tag_table.set(tag, new Gee.ArrayList<string>());
}
tag_table.get(tag).add(path);
known_paths.add(path);
}
public Gee.Collection<string> get_all_paths() {
return known_paths.read_only_view;
}
public bool is_tag_in_index(string tag) {
return tag_table.has_key(tag);
}
public Gee.Collection<string> get_all_tags() {
return tag_table.keys;
}
public bool is_path_known(string path) {
return known_paths.contains(path);
}
public string get_path_for_name(string name) {
if (!is_tag_in_index(name))
return name;
Gee.Collection<string> paths = tag_table.get(name);
foreach (string path in paths) {
Gee.List<string> components = HierarchicalTagUtilities.enumerate_path_components(path);
if (components.get(components.size - 1) == name) {
return path;
}
}
assert_not_reached();
}
public string[] get_paths_for_names_array(string[] names) {
string[] result = new string[0];
foreach (string name in names)
result += get_path_for_name(name);
return result;
}
}
|
