OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:SBAddPrefixLess
(Results
1 - 6
of
6
) sorted by null
/external/chromium_org/chrome/browser/safe_browsing/
safe_browsing_store.cc
16
// should be compatibly ordered (either by
SBAddPrefixLess
or
83
if (
SBAddPrefixLess
(*hash_iter, *remove_iter)) {
89
} else if (
SBAddPrefixLess
(*remove_iter, *hash_iter)) {
97
!
SBAddPrefixLess
(*remove_iter, *hash_iter));
138
SBAddPrefixLess
<SBAddPrefix,SBAddPrefix>);
140
SBAddPrefixLess
<SBSubPrefix,SBSubPrefix>);
149
SBAddPrefixLess
<SBAddPrefix,SBSubPrefix>,
150
SBAddPrefixLess
<SBSubPrefix,SBAddPrefix>,
safe_browsing_store_unittest.cc
12
TEST(SafeBrowsingStoreTest,
SBAddPrefixLess
) {
14
EXPECT_TRUE(
SBAddPrefixLess
(SBAddPrefix(10, 1), SBAddPrefix(11, 1)));
15
EXPECT_FALSE(
SBAddPrefixLess
(SBAddPrefix(11, 1), SBAddPrefix(10, 1)));
16
EXPECT_TRUE(
SBAddPrefixLess
(SBAddPrefix(10, 1), SBAddPrefix(10, 2)));
17
EXPECT_FALSE(
SBAddPrefixLess
(SBAddPrefix(10, 2), SBAddPrefix(10, 1)));
20
EXPECT_FALSE(
SBAddPrefixLess
(SBAddPrefix(10, 1), SBAddPrefix(10, 1)));
65
EXPECT_TRUE(
SBAddPrefixLess
(SBSubPrefix(12, 10, 2), SBSubPrefix(9, 11, 1)));
66
EXPECT_FALSE(
SBAddPrefixLess
(SBSubPrefix(12, 11, 2), SBSubPrefix(9, 10, 1)));
69
EXPECT_TRUE(
SBAddPrefixLess
(SBSubPrefix(12, 10, 1), SBSubPrefix(9, 10, 2)));
70
EXPECT_FALSE(
SBAddPrefixLess
(SBSubPrefix(12, 10, 2), SBSubPrefix(9, 10, 1)))
[
all
...]
safe_browsing_store.h
42
//
SBAddPrefixLess
() and SBAddPrefixHashLess().
109
bool
SBAddPrefixLess
(const T& a, const U& b) {
121
if (
SBAddPrefixLess
(a, b))
124
if (
SBAddPrefixLess
(b, a))
/external/chromium/chrome/browser/safe_browsing/
safe_browsing_store_unittest.cc
12
TEST(SafeBrowsingStoreTest,
SBAddPrefixLess
) {
14
EXPECT_TRUE(
SBAddPrefixLess
(SBAddPrefix(10, 1), SBAddPrefix(11, 1)));
15
EXPECT_FALSE(
SBAddPrefixLess
(SBAddPrefix(11, 1), SBAddPrefix(10, 1)));
16
EXPECT_TRUE(
SBAddPrefixLess
(SBAddPrefix(10, 1), SBAddPrefix(10, 2)));
17
EXPECT_FALSE(
SBAddPrefixLess
(SBAddPrefix(10, 2), SBAddPrefix(10, 1)));
20
EXPECT_FALSE(
SBAddPrefixLess
(SBAddPrefix(10, 1), SBAddPrefix(10, 1)));
65
EXPECT_TRUE(
SBAddPrefixLess
(SBSubPrefix(12, 10, 2), SBSubPrefix(9, 11, 1)));
66
EXPECT_FALSE(
SBAddPrefixLess
(SBSubPrefix(12, 11, 2), SBSubPrefix(9, 10, 1)));
69
EXPECT_TRUE(
SBAddPrefixLess
(SBSubPrefix(12, 10, 1), SBSubPrefix(9, 10, 2)));
70
EXPECT_FALSE(
SBAddPrefixLess
(SBSubPrefix(12, 10, 2), SBSubPrefix(9, 10, 1)))
[
all
...]
safe_browsing_store.cc
16
// should be compatibly ordered (either by
SBAddPrefixLess
or
84
if (
SBAddPrefixLess
(*hash_iter, *remove_iter)) {
90
} else if (
SBAddPrefixLess
(*remove_iter, *hash_iter)) {
98
!
SBAddPrefixLess
(*remove_iter, *hash_iter));
180
SBAddPrefixLess
<SBAddPrefix,SBAddPrefix>);
182
SBAddPrefixLess
<SBSubPrefix,SBSubPrefix>);
191
SBAddPrefixLess
<SBAddPrefix,SBSubPrefix>,
192
SBAddPrefixLess
<SBSubPrefix,SBAddPrefix>,
safe_browsing_store.h
42
//
SBAddPrefixLess
() and SBAddPrefixHashLess().
105
bool
SBAddPrefixLess
(const T& a, const U& b) {
117
if (
SBAddPrefixLess
(a, b))
120
if (
SBAddPrefixLess
(b, a))
Completed in 76 milliseconds