[−][src]Crate break_infinity
Structs
| Decimal |
Constants
| EXP_LIMIT | |
| MAX_SAFE_INTEGER | |
| MAX_SIGNIFICANT_DIGITS | Highest value you can safely put here is MAX_SAFE_INTEGER |
| NUMBER_EXP_MAX | The smallest exponent that can appear in a Number, though not all mantissas are valid here. |
| NUMBER_EXP_MIN | The largest exponent that can appear in a Number, though not all mantissas are valid here. |
| ROUND_TOLERANCE | Tolerance which is used for Number conversion to compensate floating-point error. |
Functions
| abs | |
| abs_log10 | |
| acosh | |
| add | |
| afford_arithmetic_series | If you're willing to spend 'resourcesAvailable' and want to buy something with additively increasing cost each purchase (start at priceStart, add by priceAdd, already own currentOwned), how much of it can you buy? |
| afford_geometric_series | If you're willing to spend 'resourcesAvailable' and want to buy something with exponentially increasing cost each purchase (start at priceStart, multiply by priceRatio, already own currentOwned), how much of it can you buy? Adapted from Trimps source code. |
| asinh | |
| atanh | |
| cbrt | |
| ceil | |
| clamp | |
| clamp_max | |
| clamp_min | |
| cmp | |
| cmp_tolerance | |
| compare | |
| compare_tolerance | |
| cosh | |
| cube | |
| decimal_places | |
| div | |
| divide | |
| dp | |
| efficiency_of_purchase | When comparing two purchases that cost (resource) and increase your resource/sec by (deltaRpS), the lowest efficiency score is the better one to purchase. From Frozen Cookies: http://cookieclicker.wikia.com/wiki/Frozen_Cookies_(JavaScript_Add-on)#Efficiency.3F_What.27s_that.3F |
| eq | |
| eq_tolerance | |
| equals | |
| equals_tolerance | |
| exp | |
| factorial | |
| floor | |
| from_decimal | |
| from_mantissa_exponent | |
| from_mantissa_exponent_no_normalize | |
| from_string | |
| gt | |
| gt_tolerance | |
| gte | |
| gte_tolerance | |
| ln | |
| log | |
| log2 | |
| log10 | |
| logarithm | |
| lt | |
| lt_tolerance | |
| lte | |
| lte_tolerance | |
| max | |
| min | |
| minus | |
| mul | |
| multiply | |
| neg | |
| negate | |
| negated | |
| neq | |
| neq_tolerance | |
| new | |
| normalize | |
| not_equals | |
| not_equals_tolerance | |
| p_log10 | |
| plus | |
| pow | |
| pow10 | |
| random_decimal_for_testing | |
| recip | |
| reciprocal | |
| reciprocate | |
| round | |
| sgn | |
| sign | |
| sinh | |
| sqr | |
| sqrt | |
| sub | |
| subtract | |
| sum_arithmetic_series | How much resource would it cost to buy (numItems) items if you already have currentOwned, the initial price is priceStart and it adds priceAdd each purchase? Adapted from http://www.mathwords.com/a/arithmetic_series.htm |
| sum_geometric_series | How much resource would it cost to buy (numItems) items if you already have currentOwned, the initial price is priceStart and it multiplies by priceRatio each purchase? |
| tanh | |
| times | |
| trunc |