Lines Matching refs:WHERE
4934 # 3. Decompose X as X = N(Pi/2) + r where |r| <= Pi/4. Let #
4941 # Return sgn*cos(r) where cos(r) is approximated by an #
4947 # where sin(r) is approximated by an odd polynomial in r #
4962 # 2. Decompose X as X = N(Pi/2) + r where |r| <= Pi/4. Let #
4970 # SIN(X) = sgn1 * cos(r) and COS(X) = sgn2*sin(r) where #
4975 # SIN(X) = sgn1 * sin(r) and COS(X) = sgn1*cos(r) where #
5085 #--R' + R'*S*(A1 + S(A2 + S(A3 + S(A4 + ... + SA7)))), WHERE
5088 #--WHERE T=S*S.
5138 #--SGN + S'*(B1 + S(B2 + S(B3 + S(B4 + ... + SB8)))), WHERE
5141 #--WHERE T=S*S.
5592 #--Now we need to normalize (A,a) to "new (R,r)" where R+r = A+a but
5636 # 2. Decompose X as X = N(Pi/2) + r where |r| <= Pi/4. Let #
5642 # rational function U/V where #
5648 # a rational function U/V where #
6023 #--Now we need to normalize (A,a) to "new (R,r)" where R+r = A+a but
6270 #--A TABLE, ALL WE NEED IS TO APPROXIMATE ATAN(U) WHERE
6363 #--WHERE Y = X*X, AND Z = Y*Y.
6739 # number of cases where |X| is less than, but close to, #
6755 # where #
6768 # where L1 := single-precision(-log2/64). #
6806 # where S = R*R. #
6810 # where T and t are the stored values for 2^(J/64). #
6811 # Notes: 2^(J/64) is stored as T and t where T+t approximates #
6832 # When that is the case, AdjScale = 2^(M1) where M1 is #
6850 # this code where the separate entry for denormalized #
6853 # Step 8. Handle exp(X) where |X| >= 16380log2. #
6914 # where L1 := single-precision(-log2/64). #
6934 # where S = R*R. #
6938 # where T and t are the stored values for 2^(J/64). #
6939 # Notes: 2^(J/64) is stored as T and t where T+t approximates #
6991 # X + ( S*B1 + Q ) where S = X*X and #
7991 # polynomial in u, where u = 2(X-1)/(X+1). Otherwise, #
7994 # Step 2. X = 2**k * Y where 1 <= Y < 2. Define F to be the first #
7996 # F = 1.xxxxxx1 in base 2 where the six "x" match those #
8009 # polynomial in u where u = 2X/(2+X). Otherwise, move on #
8012 # Step 2: Let 1+X = 2**k * Y, where 1 <= Y < 2. Define F as done #
8014 # log(1+X) as k*log(2) + log(F) + poly where poly #
8487 #--WHERE U = 2Z/(2+Z) = 2Z/(1+X).
8844 # 3. Decompose X as X = N/64 + r where |r| <= 1/128. Furthermore #
8863 # where L1, L2 are the leading and trailing parts of #
8876 # 3. Calculate P where 1 + P approximates exp(r): #
9032 #--D0 IS M WHERE N = 64(M+M') + J. NOTE THAT |M| <= 16140 BY DESIGN.
9129 #--D0 IS M WHERE N = 64(M+M') + J. NOTE THAT |M| <= 16140 BY DESIGN.
Indexes created Wed Oct 29 20:09:47 GMT 2025