react-native-windows 0.81.34 → 0.81.35

package/external/folly/folly/container/Reserve.h

@@ -0,0 +1,109 @@
+/*
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * 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.
+ */
+
+#pragma once
+
+#include <stdexcept>
+
+#include <folly/Likely.h>
+#include <folly/Traits.h>
+#include <folly/Utility.h>
+#include <folly/lang/Exception.h>
+
+namespace folly {
+
+namespace detail {
+
+template <typename C>
+using detect_capacity = decltype(FOLLY_DECLVAL(C).capacity());
+
+template <typename C>
+using detect_bucket_count = decltype(FOLLY_DECLVAL(C).bucket_count());
+
+template <typename C>
+using detect_max_load_factor = decltype(FOLLY_DECLVAL(C).max_load_factor());
+
+template <typename C, typename... A>
+using detect_reserve = decltype(FOLLY_DECLVAL(C).reserve(FOLLY_DECLVAL(A)...));
+
+template <typename C>
+using container_detect_reserve =
+    detect_reserve<C, typename remove_cvref_t<C>::size_type>;
+
+} // namespace detail
+
+/**
+ * Avoids quadratic behavior that could arise from c.reserve(c.size() + N).
+ *
+ * May reserve more than N in order to effect geometric growth.  Useful when
+ * c.size() is unknown, but more elements must be added by discrete operations.
+ * For example: N emplace calls in a loop, or a series of range inserts, the sum
+ * of their sizes being N.  Behaves like reserve() if the container is empty.
+ */
+struct grow_capacity_by_fn {
+  template <typename C>
+  constexpr void operator()(C& c, typename C::size_type const n) const {
+    const size_t sz = c.size();
+
+    if (FOLLY_UNLIKELY(c.max_size() - sz < n)) {
+      folly::throw_exception<std::length_error>("max_size exceeded");
+    }
+
+    if constexpr (folly::is_detected_v<detail::detect_capacity, C&>) {
+      if (sz + n <= c.capacity()) {
+        return;
+      }
+    } else if constexpr (
+        folly::is_detected_v<detail::detect_bucket_count, C&> &&
+        folly::is_detected_v<detail::detect_max_load_factor, C&>) {
+      if (sz + n <= c.bucket_count() * c.max_load_factor()) {
+        return;
+      }
+    } else {
+      static_assert(folly::always_false<C>, "unexpected container type");
+    }
+
+    auto const ra = sz * 2;
+    auto const rb = sz + n;
+    c.reserve(rb < ra ? ra : rb);
+  }
+};
+
+inline constexpr grow_capacity_by_fn grow_capacity_by{};
+
+/**
+ * Useful when writing generic code that handles containers.
+ *
+ * Examples:
+ *  - std::unordered_map provides reserve(), but std::map does not
+ *  - std::vector provides reserve(), but std::deque and std::list do not
+ */
+struct reserve_if_available_fn {
+  template <typename C>
+  constexpr auto operator()(C& c, typename C::size_type const n) const
+      noexcept(!folly::is_detected_v<detail::container_detect_reserve, C&>) {
+    constexpr auto match =
+        folly::is_detected_v<detail::container_detect_reserve, C&>;
+    if constexpr (match) {
+      c.reserve(n);
+    }
+    return std::bool_constant<match>{};
+  }
+};
+
+inline constexpr reserve_if_available_fn reserve_if_available{};
+
+} // namespace folly

package/external/folly/folly/container/SparseByteSet.h

@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * 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.
+ */
+
+#pragma once
+
+#include <cassert>
+#include <cstdint>
+
+#include <folly/CPortability.h>
+
+namespace folly {
+
+/***
+ *  SparseByteSet
+ *
+ *  A special-purpose data structure representing a set of bytes.
+ *  May have better performance than std::bitset<256>, depending on workload.
+ *
+ *  Operations:
+ *  - add(byte)
+ *  - remove(byte)
+ *  - contains(byte)
+ *  - clear()
+ *
+ *  Performance:
+ *  - The entire capacity of the set is inline; the set never allocates.
+ *  - The constructor zeros only the first two bytes of the object.
+ *  - add and contains both run in constant time w.r.t. the size of the set.
+ *    Constant time - not amortized constant - and with small constant factor.
+ *
+ *  This data structure is ideal for on-stack use.
+ *
+ *  Aho, Hopcroft, and Ullman refer to this trick in "The Design and Analysis
+ *  of Computer Algorithms" (1974), but the best description is here:
+ *  http://research.swtch.com/sparse
+ *  http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.7319
+ */
+class SparseByteSet {
+ public:
+  //  There are this many possible values:
+  static constexpr uint16_t kCapacity = 256;
+
+  //  No init of byte-arrays required!
+  SparseByteSet() : size_(0) {}
+
+  /***
+   *  add(byte)
+   *
+   *  O(1), non-amortized.
+   */
+  inline bool add(uint8_t i) {
+    bool r = !contains(i);
+    if (r) {
+      assert(size_ < kCapacity);
+      dense_[size_] = i;
+      sparse_[i] = uint8_t(size_);
+      size_++;
+    }
+    return r;
+  }
+
+  /***
+   *  remove(byte)
+   *
+   *  O(1), non-amortized.
+   */
+  inline bool remove(uint8_t i) {
+    bool r = contains(i);
+    if (r) {
+      if (dense_[size_ - 1] != i) {
+        uint8_t last_element = dense_[size_ - 1];
+        dense_[sparse_[i]] = last_element;
+        sparse_[last_element] = sparse_[i];
+      }
+      --size_;
+    }
+    return r;
+  }
+
+  /***
+   *  contains(byte)
+   *
+   *  O(1), non-amortized.
+   */
+  inline bool contains(uint8_t i) const FOLLY_DISABLE_MEMORY_SANITIZER {
+    return sparse_[i] < size_ && dense_[sparse_[i]] == i;
+  }
+
+  /***
+   *  clear()
+   *
+   *  O(1), non-amortized.
+   */
+  inline void clear() { size_ = 0; }
+
+  /***
+   *  size()
+   *
+   *  O(1), non-amortized.
+   */
+  inline uint16_t size() { return size_; }
+
+ private:
+  uint16_t size_; // can't use uint8_t because it would overflow if all
+                  // possible values were inserted.
+  uint8_t sparse_[kCapacity];
+  uint8_t dense_[kCapacity];
+};
+
+} // namespace folly

package/external/folly/folly/container/View.h

@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * 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.
+ */
+
+#pragma once
+
+#include <folly/Portability.h>
+#include <folly/functional/Invoke.h>
+#include <folly/lang/CustomizationPoint.h>
+
+namespace folly {
+
+//  order_preserving_reinsertion_view_fn
+//  order_preserving_reinsertion_view
+//
+//  Extension point for containers to provide an order such that if entries are
+//  inserted into a new instance in that order, iteration order of the new
+//  instance matches the original's. This can be useful for containers that have
+//  defined but non-FIFO iteration order, such as F14Vector*.
+//
+//  Should return an iterable view (a type that provides begin() and end()).
+//
+//  Containers should provide overloads via tag-invoke.
+struct order_preserving_reinsertion_view_fn {
+ private:
+  using fn = order_preserving_reinsertion_view_fn;
+
+ public:
+  template <typename Container>
+  FOLLY_ERASE constexpr auto operator()(Container const& container) const
+      noexcept(is_nothrow_tag_invocable_v<fn, Container const&>)
+          -> tag_invoke_result_t<fn, Container const&> {
+    return tag_invoke(*this, container);
+  }
+};
+FOLLY_DEFINE_CPO(
+    order_preserving_reinsertion_view_fn, order_preserving_reinsertion_view)
+
+//  order_preserving_reinsertion_view_or_default_fn
+//  order_preserving_reinsertion_view_or_default
+//
+//  If a tag-invoke extension of order_preserving_reinsertion_view is available
+//  over the given argument, forwards to that. Otherwise, returns the argument.
+struct order_preserving_reinsertion_view_or_default_fn {
+ private:
+  using fn = order_preserving_reinsertion_view_fn;
+
+ public:
+  template <
+      typename Container,
+      std::enable_if_t<is_tag_invocable_v<fn, Container const&>, int> = 0>
+  FOLLY_ERASE constexpr auto operator()(Container const& container) const
+      noexcept(is_nothrow_tag_invocable_v<fn, Container const&>)
+          -> tag_invoke_result_t<fn, Container const&> {
+    return tag_invoke(fn{}, container);
+  }
+  template <
+      typename Container,
+      std::enable_if_t<!is_tag_invocable_v<fn, Container const&>, int> = 0>
+  FOLLY_ERASE constexpr Container const& operator()(
+      Container const& container) const noexcept {
+    return container;
+  }
+};
+FOLLY_DEFINE_CPO(
+    order_preserving_reinsertion_view_or_default_fn,
+    order_preserving_reinsertion_view_or_default)
+
+} // namespace folly