Index: base/lookup_string_in_fixed_set.h |
diff --git a/net/base/lookup_string_in_fixed_set.h b/base/lookup_string_in_fixed_set.h |
similarity index 95% |
rename from net/base/lookup_string_in_fixed_set.h |
rename to base/lookup_string_in_fixed_set.h |
index 3da3856951933dfddbe172426bbcb94cc563d2e5..bffb69cd3ee1f098550f0ec5048d706b6edf9f64 100644 |
--- a/net/base/lookup_string_in_fixed_set.h |
+++ b/base/lookup_string_in_fixed_set.h |
@@ -2,14 +2,14 @@ |
// Use of this source code is governed by a BSD-style license that can be |
// found in the LICENSE file. |
-#ifndef NET_BASE_LOOKUP_STRING_IN_FIXED_SET_H_ |
-#define NET_BASE_LOOKUP_STRING_IN_FIXED_SET_H_ |
+#ifndef BASE_LOOKUP_STRING_IN_FIXED_SET_H_ |
+#define BASE_LOOKUP_STRING_IN_FIXED_SET_H_ |
#include <stddef.h> |
-#include "net/base/net_export.h" |
+#include "base/base_export.h" |
-namespace net { |
+namespace base { |
enum { |
kDafsaNotFound = -1, // key is not in set |
@@ -32,7 +32,7 @@ enum { |
// kDafsaWildcardRule and kDafsaPrivateRule ORed together. |
// |
// TODO(nick): Replace this with FixedSetIncrementalLookup everywhere. |
-NET_EXPORT int LookupStringInFixedSet(const unsigned char* graph, |
+BASE_EXPORT int LookupStringInFixedSet(const unsigned char* graph, |
size_t length, |
const char* key, |
size_t key_length); |
@@ -76,7 +76,7 @@ NET_EXPORT int LookupStringInFixedSet(const unsigned char* graph, |
// } |
// return input.substr(0, longest_match_end); |
// |
-class NET_EXPORT FixedSetIncrementalLookup { |
+class BASE_EXPORT FixedSetIncrementalLookup { |
public: |
// Begin a lookup against the provided fixed set. |graph| and |length| |
// describe a byte buffer generated by the make_dafsa.py script, as described |
@@ -142,6 +142,6 @@ class NET_EXPORT FixedSetIncrementalLookup { |
bool pos_is_label_character_; |
}; |
-} // namespace net |
+} // namespace base |
-#endif // NET_BASE_LOOKUP_STRING_IN_FIXED_SET_H_ |
+#endif // BASE_LOOKUP_STRING_IN_FIXED_SET_H_ |