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/vector.h
+++ b/ios/include/utils/vector.h
@@ -1,60 +1,60 @@
-/*
- * Copyright (C) 2015 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.
- */
-
-#include <vector>
-
-#ifndef UTILS_VECTOR_H
-#define UTILS_VECTOR_H
-
-namespace utils {
-
-/**
- * Inserts the specified item in the vector at its sorted position.
- */
-template <typename T>
-static inline void insert_sorted(std::vector<T>& v, T item) {
-    auto pos = std::lower_bound(v.begin(), v.end(), item);
-    v.insert(pos, std::move(item));
-}
-
-/**
- * Inserts the specified item in the vector at its sorted position.
- * The item type must implement the < operator. If the specified
- * item is already present in the vector, this method returns without
- * inserting the item again.
- *
- * @return True if the item was inserted at is sorted position, false
- *         if the item already exists in the vector.
- */
-template <typename T>
-static inline bool insert_sorted_unique(std::vector<T>& v, T item) {
-    if (UTILS_LIKELY(v.size() == 0 || v.back() < item)) {
-        v.push_back(item);
-        return true;
-    }
-
-    auto pos = std::lower_bound(v.begin(), v.end(), item);
-    if (UTILS_LIKELY(pos == v.end() || item < *pos)) {
-        v.insert(pos, std::move(item));
-        return true;
-    }
-
-    return false;
-}
-
-} // end utils namespace
-
-#endif //UTILS_VECTOR_H
+/*
+ * Copyright (C) 2015 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_VECTOR_H
+#define TNT_UTILS_VECTOR_H
+
+#include <vector>
+
+namespace utils {
+
+/**
+ * Inserts the specified item in the vector at its sorted position.
+ */
+template <typename T>
+static inline void insert_sorted(std::vector<T>& v, T item) {
+    auto pos = std::lower_bound(v.begin(), v.end(), item);
+    v.insert(pos, std::move(item));
+}
+
+/**
+ * Inserts the specified item in the vector at its sorted position.
+ * The item type must implement the < operator. If the specified
+ * item is already present in the vector, this method returns without
+ * inserting the item again.
+ *
+ * @return True if the item was inserted at is sorted position, false
+ *         if the item already exists in the vector.
+ */
+template <typename T>
+static inline bool insert_sorted_unique(std::vector<T>& v, T item) {
+    if (UTILS_LIKELY(v.size() == 0 || v.back() < item)) {
+        v.push_back(item);
+        return true;
+    }
+
+    auto pos = std::lower_bound(v.begin(), v.end(), item);
+    if (UTILS_LIKELY(pos == v.end() || item < *pos)) {
+        v.insert(pos, std::move(item));
+        return true;
+    }
+
+    return false;
+}
+
+} // end utils namespace
+
+#endif // TNT_UTILS_VECTOR_H