You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

fastmath.h 2.2 kB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
  1. // Copyright 2017 The Abseil Authors.
  2. //
  3. // Licensed under the Apache License, Version 2.0 (the "License");
  4. // you may not use this file except in compliance with the License.
  5. // You may obtain a copy of the License at
  6. //
  7. // https://www.apache.org/licenses/LICENSE-2.0
  8. //
  9. // Unless required by applicable law or agreed to in writing, software
  10. // distributed under the License is distributed on an "AS IS" BASIS,
  11. // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. // See the License for the specific language governing permissions and
  13. // limitations under the License.
  14. #ifndef ABSL_RANDOM_INTERNAL_FASTMATH_H_
  15. #define ABSL_RANDOM_INTERNAL_FASTMATH_H_
  16. // This file contains fast math functions (bitwise ops as well as some others)
  17. // which are implementation details of various absl random number distributions.
  18. #include <cassert>
  19. #include <cmath>
  20. #include <cstdint>
  21. #include "absl/numeric/bits.h"
  22. namespace absl
  23. {
  24. ABSL_NAMESPACE_BEGIN
  25. namespace random_internal
  26. {
  27. // Compute log2(n) using integer operations.
  28. // While std::log2 is more accurate than std::log(n) / std::log(2), for
  29. // very large numbers--those close to std::numeric_limits<uint64_t>::max() - 2,
  30. // for instance--std::log2 rounds up rather than down, which introduces
  31. // definite skew in the results.
  32. inline int IntLog2Floor(uint64_t n)
  33. {
  34. return (n <= 1) ? 0 : (63 - countl_zero(n));
  35. }
  36. inline int IntLog2Ceil(uint64_t n)
  37. {
  38. return (n <= 1) ? 0 : (64 - countl_zero(n - 1));
  39. }
  40. inline double StirlingLogFactorial(double n)
  41. {
  42. assert(n >= 1);
  43. // Using Stirling's approximation.
  44. constexpr double kLog2PI = 1.83787706640934548356;
  45. const double logn = std::log(n);
  46. const double ninv = 1.0 / static_cast<double>(n);
  47. return n * logn - n + 0.5 * (kLog2PI + logn) + (1.0 / 12.0) * ninv -
  48. (1.0 / 360.0) * ninv * ninv * ninv;
  49. }
  50. } // namespace random_internal
  51. ABSL_NAMESPACE_END
  52. } // namespace absl
  53. #endif // ABSL_RANDOM_INTERNAL_FASTMATH_H_