MCPcopy Create free account
hub / github.com/dabing1022/Blog / splitReciprocal

Method splitReciprocal

Processing/game2dai/maths/FastMath.java:1104–1132  ·  view source on GitHub ↗

Compute the reciprocal of in. Use the following algorithm. in = c + d. want to find x + y such that x+y = 1/(c+d) and x is much larger than y and x has several zero bits on the right. Set b = 1/(2^22), a = 1 - b. Thus (a+b) = 1. Use following identity to compute (a+b)/(c+d) (a+b)/(c+d) =

(final double in[], final double result[])

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 6

FastMathClass · 0.95
slowexpMethod · 0.95
slowLogMethod · 0.95
slowSinMethod · 0.95
slowCosMethod · 0.95
buildSinCosTablesMethod · 0.95

Calls 1

resplitMethod · 0.95

Tested by

no test coverage detected