Lines Matching refs:Thus
2991 # modes and thus can have several different total instruction lengths.
5797 #--TERM IN SGL. NOTE THAT PI IS 64-BIT LONG, THUS N*PI/2 IS AT
6843 # form. Thus taking the branch to Step 2 guarantees #
6882 # cancellation. Thus, R is practically X+N(L1+L2) to full #
6893 # Now |X| <= 16446 log2, thus #
6939 # approximately M. Thus 6.2 will never cause #
6981 # with an inexact result. Thus, 9.5 always raises the #
7711 # overflow. Thus, we calculate sinh(X) as follows: #
7825 # Thus, we calculate sinh(X) as follows: #
7948 # 6. (|X| >= 50 log2) Tanh(X) = +-1 (round to nearest). Thus, we #
8124 # Note 1. There are 64 different possible values for F, thus 64 #
8354 #--X = 2^(K) * Y, 1 <= Y < 2. THUS, Y = 1.XXXXXXXX....XX IN BINARY.
8358 THUS APPROXIMATING
8980 # Thus Fact1 + Fact2 = 2**(M) * 2**(j/64). #
9762 # Step 9. At this point, R = 2^(-j)*X - Q Y = Y. Thus, #
9905 #..expo(X) < expo(Y). Thus X = mod(X,Y)
10085 #..R = 2^(-j)X - Q Y = Y, thus R = 0 and quotient = 2^j (Q+1)
Indexes created Sun Oct 26 13:09:57 GMT 2025