OLD | NEW |
1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "chrome/renderer/safe_browsing/scorer.h" | 5 #include "chrome/renderer/safe_browsing/scorer.h" |
6 | 6 |
| 7 #include <stdint.h> |
| 8 |
7 #include "base/containers/hash_tables.h" | 9 #include "base/containers/hash_tables.h" |
8 #include "base/files/file_path.h" | 10 #include "base/files/file_path.h" |
9 #include "base/files/scoped_temp_dir.h" | 11 #include "base/files/scoped_temp_dir.h" |
10 #include "base/format_macros.h" | 12 #include "base/format_macros.h" |
11 #include "base/memory/scoped_ptr.h" | 13 #include "base/memory/scoped_ptr.h" |
12 #include "base/message_loop/message_loop.h" | 14 #include "base/message_loop/message_loop.h" |
13 #include "base/threading/thread.h" | 15 #include "base/threading/thread.h" |
14 #include "chrome/common/safe_browsing/client_model.pb.h" | 16 #include "chrome/common/safe_browsing/client_model.pb.h" |
15 #include "chrome/renderer/safe_browsing/features.h" | 17 #include "chrome/renderer/safe_browsing/features.h" |
16 #include "testing/gmock/include/gmock/gmock.h" | 18 #include "testing/gmock/include/gmock/gmock.h" |
(...skipping 75 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
92 base::hash_set<std::string> page_terms = scorer->page_terms(); | 94 base::hash_set<std::string> page_terms = scorer->page_terms(); |
93 std::vector<std::string> page_terms_v(page_terms.begin(), page_terms.end()); | 95 std::vector<std::string> page_terms_v(page_terms.begin(), page_terms.end()); |
94 std::sort(page_terms_v.begin(), page_terms_v.end()); | 96 std::sort(page_terms_v.begin(), page_terms_v.end()); |
95 | 97 |
96 EXPECT_THAT(page_terms_v, ::testing::ContainerEq(expected_page_terms)); | 98 EXPECT_THAT(page_terms_v, ::testing::ContainerEq(expected_page_terms)); |
97 } | 99 } |
98 | 100 |
99 TEST_F(PhishingScorerTest, PageWords) { | 101 TEST_F(PhishingScorerTest, PageWords) { |
100 scoped_ptr<Scorer> scorer(Scorer::Create(model_.SerializeAsString())); | 102 scoped_ptr<Scorer> scorer(Scorer::Create(model_.SerializeAsString())); |
101 ASSERT_TRUE(scorer.get()); | 103 ASSERT_TRUE(scorer.get()); |
102 std::vector<uint32> expected_page_words; | 104 std::vector<uint32_t> expected_page_words; |
103 expected_page_words.push_back(1000U); | 105 expected_page_words.push_back(1000U); |
104 expected_page_words.push_back(2000U); | 106 expected_page_words.push_back(2000U); |
105 expected_page_words.push_back(3000U); | 107 expected_page_words.push_back(3000U); |
106 std::sort(expected_page_words.begin(), expected_page_words.end()); | 108 std::sort(expected_page_words.begin(), expected_page_words.end()); |
107 | 109 |
108 base::hash_set<uint32> page_words = scorer->page_words(); | 110 base::hash_set<uint32_t> page_words = scorer->page_words(); |
109 std::vector<uint32> page_words_v(page_words.begin(), page_words.end()); | 111 std::vector<uint32_t> page_words_v(page_words.begin(), page_words.end()); |
110 std::sort(page_words_v.begin(), page_words_v.end()); | 112 std::sort(page_words_v.begin(), page_words_v.end()); |
111 | 113 |
112 EXPECT_THAT(page_words_v, ::testing::ContainerEq(expected_page_words)); | 114 EXPECT_THAT(page_words_v, ::testing::ContainerEq(expected_page_words)); |
113 | 115 |
114 EXPECT_EQ(2U, scorer->max_words_per_term()); | 116 EXPECT_EQ(2U, scorer->max_words_per_term()); |
115 EXPECT_EQ(12345U, scorer->murmurhash3_seed()); | 117 EXPECT_EQ(12345U, scorer->murmurhash3_seed()); |
116 EXPECT_EQ(10U, scorer->max_shingles_per_page()); | 118 EXPECT_EQ(10U, scorer->max_shingles_per_page()); |
117 EXPECT_EQ(3U, scorer->shingle_size()); | 119 EXPECT_EQ(3U, scorer->shingle_size()); |
118 } | 120 } |
119 | 121 |
(...skipping 17 matching lines...) Expand all Loading... |
137 EXPECT_DOUBLE_EQ(0.6899744811276125, scorer->ComputeScore(features)); | 139 EXPECT_DOUBLE_EQ(0.6899744811276125, scorer->ComputeScore(features)); |
138 | 140 |
139 // Now, both feature 1 and feature 2 match. Expected logodds: | 141 // Now, both feature 1 and feature 2 match. Expected logodds: |
140 // 0.5 (empty rule) + 2.0 (rule weight) * 0.15 (feature weight) + | 142 // 0.5 (empty rule) + 2.0 (rule weight) * 0.15 (feature weight) + |
141 // 3.0 (rule weight) * 0.15 (feature1 weight) * 1.0 (feature2) weight = 9.8 | 143 // 3.0 (rule weight) * 0.15 (feature1 weight) * 1.0 (feature2) weight = 9.8 |
142 // => p = 0.99999627336071584 | 144 // => p = 0.99999627336071584 |
143 EXPECT_TRUE(features.AddBooleanFeature("feature2")); | 145 EXPECT_TRUE(features.AddBooleanFeature("feature2")); |
144 EXPECT_DOUBLE_EQ(0.77729986117469119, scorer->ComputeScore(features)); | 146 EXPECT_DOUBLE_EQ(0.77729986117469119, scorer->ComputeScore(features)); |
145 } | 147 } |
146 } // namespace safe_browsing | 148 } // namespace safe_browsing |
OLD | NEW |