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
|
// Copyright (c) 2011 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/common/extensions/url_pattern_set.h"
#include <algorithm>
#include <iterator>
#include "chrome/common/extensions/url_pattern.h"
#include "googleurl/src/gurl.h"
// static
void URLPatternSet::CreateDifference(const URLPatternSet& set1,
const URLPatternSet& set2,
URLPatternSet* out) {
out->ClearPatterns();
std::set_difference(set1.patterns_.begin(), set1.patterns_.end(),
set2.patterns_.begin(), set2.patterns_.end(),
std::inserter<std::set<URLPattern> >(
out->patterns_, out->patterns_.begin()));
}
// static
void URLPatternSet::CreateIntersection(const URLPatternSet& set1,
const URLPatternSet& set2,
URLPatternSet* out) {
out->ClearPatterns();
std::set_intersection(set1.patterns_.begin(), set1.patterns_.end(),
set2.patterns_.begin(), set2.patterns_.end(),
std::inserter<std::set<URLPattern> >(
out->patterns_, out->patterns_.begin()));
}
// static
void URLPatternSet::CreateUnion(const URLPatternSet& set1,
const URLPatternSet& set2,
URLPatternSet* out) {
out->ClearPatterns();
std::set_union(set1.patterns_.begin(), set1.patterns_.end(),
set2.patterns_.begin(), set2.patterns_.end(),
std::inserter<std::set<URLPattern> >(
out->patterns_, out->patterns_.begin()));
}
URLPatternSet::URLPatternSet() {}
URLPatternSet::URLPatternSet(const URLPatternSet& rhs)
: patterns_(rhs.patterns_) {}
URLPatternSet::URLPatternSet(const std::set<URLPattern>& patterns)
: patterns_(patterns) {}
URLPatternSet::~URLPatternSet() {}
URLPatternSet& URLPatternSet::operator=(const URLPatternSet& rhs) {
patterns_ = rhs.patterns_;
return *this;
}
bool URLPatternSet::operator==(const URLPatternSet& other) const {
return patterns_ == other.patterns_;
}
bool URLPatternSet::is_empty() const {
return patterns_.empty();
}
void URLPatternSet::AddPattern(const URLPattern& pattern) {
patterns_.insert(pattern);
}
void URLPatternSet::ClearPatterns() {
patterns_.clear();
}
bool URLPatternSet::Contains(const URLPatternSet& set) const {
return std::includes(patterns_.begin(), patterns_.end(),
set.patterns_.begin(), set.patterns_.end());
}
bool URLPatternSet::MatchesURL(const GURL& url) const {
for (URLPatternSet::const_iterator pattern = patterns_.begin();
pattern != patterns_.end(); ++pattern) {
if (pattern->MatchesURL(url))
return true;
}
return false;
}
bool URLPatternSet::MatchesSecurityOrigin(const GURL& origin) const {
for (URLPatternSet::const_iterator pattern = patterns_.begin();
pattern != patterns_.end(); ++pattern) {
if (pattern->MatchesSecurityOrigin(origin))
return true;
}
return false;
}
bool URLPatternSet::OverlapsWith(const URLPatternSet& other) const {
// Two extension extents overlap if there is any one URL that would match at
// least one pattern in each of the extents.
for (URLPatternSet::const_iterator i = patterns_.begin();
i != patterns_.end(); ++i) {
for (URLPatternSet::const_iterator j = other.patterns().begin();
j != other.patterns().end(); ++j) {
if (i->OverlapsWith(*j))
return true;
}
}
return false;
}
|
