2
0

math_funcs.cpp 5.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220
  1. /*************************************************************************/
  2. /* math_funcs.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* http://www.godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2017 Juan Linietsky, Ariel Manzur. */
  9. /* */
  10. /* Permission is hereby granted, free of charge, to any person obtaining */
  11. /* a copy of this software and associated documentation files (the */
  12. /* "Software"), to deal in the Software without restriction, including */
  13. /* without limitation the rights to use, copy, modify, merge, publish, */
  14. /* distribute, sublicense, and/or sell copies of the Software, and to */
  15. /* permit persons to whom the Software is furnished to do so, subject to */
  16. /* the following conditions: */
  17. /* */
  18. /* The above copyright notice and this permission notice shall be */
  19. /* included in all copies or substantial portions of the Software. */
  20. /* */
  21. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  22. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  23. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
  24. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  25. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  26. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  27. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  28. /*************************************************************************/
  29. #include "math_funcs.h"
  30. #include "core/os/os.h"
  31. #include "float.h"
  32. #include "pcg.h"
  33. pcg32_random_t Math::default_pcg = {1, PCG_DEFAULT_INC_64};
  34. #define PHI 0x9e3779b9
  35. #if 0
  36. static uint32_t Q[4096];
  37. #endif
  38. // TODO: we should eventually expose pcg.inc too
  39. uint32_t Math::rand_from_seed(uint64_t *seed) {
  40. pcg32_random_t pcg = {*seed, PCG_DEFAULT_INC_64};
  41. uint32_t r = pcg32_random_r(&pcg);
  42. *seed = pcg.state;
  43. return r;
  44. }
  45. void Math::seed(uint64_t x) {
  46. default_pcg.state=x;
  47. }
  48. void Math::randomize() {
  49. OS::Time time = OS::get_singleton()->get_time();
  50. seed(OS::get_singleton()->get_ticks_usec()*(time.hour+1)*(time.min+1)*(time.sec+1)*rand()); // TODO: can be simplified.
  51. }
  52. uint32_t Math::rand() {
  53. return pcg32_random_r(&default_pcg);
  54. }
  55. double Math::randf() {
  56. return (double)rand() / (double)Math::RANDOM_MAX;
  57. }
  58. double Math::round(double p_val) {
  59. if (p_val>=0) {
  60. return ::floor(p_val+0.5);
  61. } else {
  62. p_val=-p_val;
  63. return -::floor(p_val+0.5);
  64. }
  65. }
  66. double Math::dectime(double p_value,double p_amount, double p_step) {
  67. float sgn = p_value < 0 ? -1.0 : 1.0;
  68. float val = absf(p_value);
  69. val-=p_amount*p_step;
  70. if (val<0.0)
  71. val=0.0;
  72. return val*sgn;
  73. }
  74. int Math::step_decimals(double p_step) {
  75. static const int maxn=9;
  76. static const double sd[maxn]={
  77. 0.9999, // somehow compensate for floating point error
  78. 0.09999,
  79. 0.009999,
  80. 0.0009999,
  81. 0.00009999,
  82. 0.000009999,
  83. 0.0000009999,
  84. 0.00000009999,
  85. 0.000000009999
  86. };
  87. double as=absf(p_step);
  88. for(int i=0;i<maxn;i++) {
  89. if (as>=sd[i]) {
  90. return i;
  91. }
  92. }
  93. return maxn;
  94. }
  95. double Math::ease(double p_x, double p_c) {
  96. if (p_x<0)
  97. p_x=0;
  98. else if (p_x>1.0)
  99. p_x=1.0;
  100. if (p_c>0) {
  101. if (p_c<1.0) {
  102. return 1.0-Math::pow(1.0-p_x,1.0/p_c);
  103. } else {
  104. return Math::pow(p_x,p_c);
  105. }
  106. } else if (p_c<0) {
  107. //inout ease
  108. if (p_x<0.5) {
  109. return Math::pow(p_x*2.0,-p_c)*0.5;
  110. } else {
  111. return (1.0-Math::pow(1.0-(p_x-0.5)*2.0,-p_c))*0.5+0.5;
  112. }
  113. } else
  114. return 0; // no ease (raw)
  115. }
  116. double Math::stepify(double p_value,double p_step) {
  117. if (p_step!=0) {
  118. p_value=floor( p_value / p_step + 0.5 ) * p_step;
  119. }
  120. return p_value;
  121. }
  122. uint32_t Math::larger_prime(uint32_t p_val) {
  123. static const uint32_t primes[] = {
  124. 5,
  125. 13,
  126. 23,
  127. 47,
  128. 97,
  129. 193,
  130. 389,
  131. 769,
  132. 1543,
  133. 3079,
  134. 6151,
  135. 12289,
  136. 24593,
  137. 49157,
  138. 98317,
  139. 196613,
  140. 393241,
  141. 786433,
  142. 1572869,
  143. 3145739,
  144. 6291469,
  145. 12582917,
  146. 25165843,
  147. 50331653,
  148. 100663319,
  149. 201326611,
  150. 402653189,
  151. 805306457,
  152. 1610612741,
  153. 0,
  154. };
  155. int idx=0;
  156. while (true) {
  157. ERR_FAIL_COND_V(primes[idx]==0,0);
  158. if (primes[idx]>p_val)
  159. return primes[idx];
  160. idx++;
  161. }
  162. return 0;
  163. }
  164. double Math::random(double from, double to) {
  165. unsigned int r = Math::rand();
  166. double ret = (double)r/(double)RANDOM_MAX;
  167. return (ret)*(to-from) + from;
  168. }
  169. double Math::pow(double x, double y) {
  170. return ::pow(x,y);
  171. }
  172. double Math::log(double x) {
  173. return ::log(x);
  174. }
  175. double Math::exp(double x) {
  176. return ::exp(x);
  177. }