Index: chrome/browser/autocomplete/autocomplete_match_unittest.cc |
diff --git a/chrome/browser/autocomplete/autocomplete_match_unittest.cc b/chrome/browser/autocomplete/autocomplete_match_unittest.cc |
new file mode 100644 |
index 0000000000000000000000000000000000000000..b8fe4ed61b35c9f25026e51c2e8a72168ed706e8 |
--- /dev/null |
+++ b/chrome/browser/autocomplete/autocomplete_match_unittest.cc |
@@ -0,0 +1,33 @@ |
+// Copyright (c) 2012 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/browser/autocomplete/autocomplete_match.h" |
+ |
+#include "base/basictypes.h" |
+#include "testing/gtest/include/gtest/gtest.h" |
+ |
+TEST(AutocompleteMatchTest, MoreRelevant) { |
+ struct RelevantCases { |
+ int r1; |
+ int r2; |
+ bool expected_result; |
+ } cases[] = { |
+ { 10, 0, true }, |
+ { 10, -5, true }, |
+ { -5, 10, false }, |
+ { 0, 10, false }, |
+ { -10, -5, false }, |
+ { -5, -10, true }, |
+ }; |
+ |
+ AutocompleteMatch m1(NULL, 0, false, AutocompleteMatch::URL_WHAT_YOU_TYPED); |
+ AutocompleteMatch m2(NULL, 0, false, AutocompleteMatch::URL_WHAT_YOU_TYPED); |
+ |
+ for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) { |
+ m1.relevance = cases[i].r1; |
+ m2.relevance = cases[i].r2; |
+ EXPECT_EQ(cases[i].expected_result, |
+ AutocompleteMatch::MoreRelevant(m1, m2)); |
+ } |
+} |