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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
|
// © 2018 and later: Unicode, Inc. and others.
// License & terms of use: http://www.unicode.org/copyright.html
#ifndef __FILTERRB_H__
#define __FILTERRB_H__
#include <list>
#include <map>
#include <memory>
#include <ostream>
#include <string>
#include "unicode/utypes.h"
/**
* Represents an absolute path into a resource bundle.
* For example: "/units/length/meter"
*/
class ResKeyPath {
public:
/** Constructs an empty path (top of tree) */
ResKeyPath();
/** Constructs from a string path */
ResKeyPath(const std::string& path, UErrorCode& status);
void push(const std::string& key);
void pop();
const std::list<std::string>& pieces() const;
private:
std::list<std::string> fPath;
};
std::ostream& operator<<(std::ostream& out, const ResKeyPath& value);
/**
* Interface used to determine whether to include or reject pieces of a
* resource bundle based on their absolute path.
*/
class PathFilter {
public:
enum EInclusion {
INCLUDE,
PARTIAL,
EXCLUDE
};
static const char* kEInclusionNames[];
virtual ~PathFilter();
/**
* Returns an EInclusion on whether or not the given path should be included.
*
* INCLUDE = include the whole subtree
* PARTIAL = recurse into the subtree
* EXCLUDE = reject the whole subtree
*/
virtual EInclusion match(const ResKeyPath& path) const = 0;
};
/**
* Implementation of PathFilter for a list of inclusion/exclusion rules.
*
* The wildcard pattern "*" means that the subsequent filters are applied to
* every other tree sharing the same parent.
*
* For example, given this list of filter rules:
*/
// -/alabama
// +/alabama/alaska/arizona
// -/fornia/hawaii
// -/mississippi
// +/mississippi/michigan
// +/mississippi/*/maine
// -/mississippi/*/iowa
// +/mississippi/louisiana/iowa
/*
* You get the following structure:
*
* SimpleRuleBasedPathFilter {
* included: PARTIAL
* alabama: {
* included: EXCLUDE
* alaska: {
* included: PARTIAL
* arizona: {
* included: INCLUDE
* }
* }
* }
* fornia: {
* included: PARTIAL
* hawaii: {
* included: EXCLUDE
* }
* }
* mississippi: {
* included: EXCLUDE
* louisiana: {
* included: PARTIAL
* iowa: {
* included: INCLUDE
* }
* maine: {
* included: INCLUDE
* }
* }
* michigan: {
* included: INCLUDE
* iowa: {
* included: EXCLUDE
* }
* maine: {
* included: INCLUDE
* }
* }
* * {
* included: PARTIAL
* iowa: {
* included: EXCLUDE
* }
* maine: {
* included: INCLUDE
* }
* }
* }
* }
*/
class SimpleRuleBasedPathFilter : public PathFilter {
public:
void addRule(const std::string& ruleLine, UErrorCode& status);
void addRule(const ResKeyPath& path, bool inclusionRule, UErrorCode& status);
EInclusion match(const ResKeyPath& path) const override;
void print(std::ostream& out) const;
private:
struct Tree {
Tree() = default;
/** Copy constructor */
Tree(const Tree& other);
/**
* Information on the USER-SPECIFIED inclusion/exclusion.
*
* INCLUDE = this path exactly matches a "+" rule
* PARTIAL = this path does not match any rule, but subpaths exist
* EXCLUDE = this path exactly matches a "-" rule
*/
EInclusion fIncluded = PARTIAL;
std::map<std::string, Tree> fChildren;
std::unique_ptr<Tree> fWildcard;
void applyRule(
const ResKeyPath& path,
std::list<std::string>::const_iterator it,
bool inclusionRule,
UErrorCode& status);
bool isLeaf() const;
void print(std::ostream& out, int32_t indent) const;
};
Tree fRoot;
};
std::ostream& operator<<(std::ostream& out, const SimpleRuleBasedPathFilter& value);
#endif //__FILTERRB_H__
|
