update external headers

2022-02-06 13:28:28 +08:00
parent 6d5a63d398
commit bd3d0d080b
150 changed files with 27445 additions and 14805 deletions
--- a/ios/include/utils/Hash.h
+++ b/ios/include/utils/Hash.h
@@ -1,74 +1,74 @@
-/*
- * Copyright (C) 2018 The Android Open Source Project
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *      http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-#ifndef TNT_UTILS_HASH_H
-#define TNT_UTILS_HASH_H
-
-#include <functional>   // for std::hash
-
-#include <stdint.h>
-#include <stddef.h>
-
-namespace utils {
-namespace hash {
-
-inline uint32_t murmur3(const uint32_t* key, size_t wordCount, uint32_t seed) noexcept {
-    uint32_t h = seed;
-    size_t i = wordCount;
-    do {
-        uint32_t k = *key++;
-        k *= 0xcc9e2d51u;
-        k = (k << 15u) | (k >> 17u);
-        k *= 0x1b873593u;
-        h ^= k;
-        h = (h << 13u) | (h >> 19u);
-        h = (h * 5u) + 0xe6546b64u;
-    } while (--i);
-    h ^= wordCount;
-    h ^= h >> 16u;
-    h *= 0x85ebca6bu;
-    h ^= h >> 13u;
-    h *= 0xc2b2ae35u;
-    h ^= h >> 16u;
-    return h;
-}
-
-template<typename T>
-struct MurmurHashFn {
-    uint32_t operator()(const T& key) const noexcept {
-        static_assert(0 == (sizeof(key) & 3u), "Hashing requires a size that is a multiple of 4.");
-        return murmur3((const uint32_t*) &key, sizeof(key) / 4, 0);
-    }
-};
-
-// combines two hashes together
-template<class T>
-inline void combine(size_t& seed, const T& v) noexcept {
-    std::hash<T> hasher;
-    seed ^= hasher(v) + 0x9e3779b9u + (seed << 6u) + (seed >> 2u);
-}
-
-// combines two hashes together, faster but less good
-template<class T>
-inline void combine_fast(size_t& seed, const T& v) noexcept {
-    std::hash<T> hasher;
-    seed ^= hasher(v) << 1u;
-}
-
-} // namespace hash
-} // namespace utils
-
-#endif // TNT_UTILS_HASH_H
+/*
+ * Copyright (C) 2018 The Android Open Source Project
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *      http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef TNT_UTILS_HASH_H
+#define TNT_UTILS_HASH_H
+
+#include <functional>   // for std::hash
+
+#include <stdint.h>
+#include <stddef.h>
+
+namespace utils {
+namespace hash {
+
+inline uint32_t murmur3(const uint32_t* key, size_t wordCount, uint32_t seed) noexcept {
+    uint32_t h = seed;
+    size_t i = wordCount;
+    do {
+        uint32_t k = *key++;
+        k *= 0xcc9e2d51u;
+        k = (k << 15u) | (k >> 17u);
+        k *= 0x1b873593u;
+        h ^= k;
+        h = (h << 13u) | (h >> 19u);
+        h = (h * 5u) + 0xe6546b64u;
+    } while (--i);
+    h ^= wordCount;
+    h ^= h >> 16u;
+    h *= 0x85ebca6bu;
+    h ^= h >> 13u;
+    h *= 0xc2b2ae35u;
+    h ^= h >> 16u;
+    return h;
+}
+
+template<typename T>
+struct MurmurHashFn {
+    uint32_t operator()(const T& key) const noexcept {
+        static_assert(0 == (sizeof(key) & 3u), "Hashing requires a size that is a multiple of 4.");
+        return murmur3((const uint32_t*) &key, sizeof(key) / 4, 0);
+    }
+};
+
+// combines two hashes together
+template<class T>
+inline void combine(size_t& seed, const T& v) noexcept {
+    std::hash<T> hasher;
+    seed ^= hasher(v) + 0x9e3779b9u + (seed << 6u) + (seed >> 2u);
+}
+
+// combines two hashes together, faster but less good
+template<class T>
+inline void combine_fast(size_t& seed, const T& v) noexcept {
+    std::hash<T> hasher;
+    seed ^= hasher(v) << 1u;
+}
+
+} // namespace hash
+} // namespace utils
+
+#endif // TNT_UTILS_HASH_H