- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for bitLen (0.33 sec)
-
lib/fips140/v1.0.0.zip
checks in the loop. size := len(x.limbs) xLimbs := x.limbs[:size] for i := size - 1; i >= 0; i-- { if xLimbs[i] != 0 { return i*_W + bitLen(xLimbs[i]) } } return 0 } // bitLen is a version of bits.Len that only leaks the bit length of n, but not // its value. bits.Len and bits.LeadingZeros use a lookup table for the // low-order bits on some architectures. func bitLen(n uint) int { len := 0 // We assume, here and elsewhere, that comparison to zero is constant time // with respect to different non-zero...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0) -
fess-crawler/src/test/resources/extractor/eml/sample4.eml
einen verbindlich eintragen. Die Kosten dafür und das Mittagessen sind in den Fahrtkosten enthalten. www.museumsdorf-glashuette.de Bitte auch 2. Seite lesen ! Programmablauf: Die Eigenbeteiligung für die Exkursion incl. eines Essens beträgt 11,00 €,. Eine verbindliche Anmeldung ist ab
Registered: Sun Sep 21 03:50:09 UTC 2025 - Last Modified: Sun Jan 07 09:15:11 UTC 2018 - 681K bytes - Viewed (0) -
okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt
2F9E ; mapped ; 8ECA # 3.0 KANGXI RADICAL CART 2F9F ; mapped ; 8F9B # 3.0 KANGXI RADICAL BITTER 2FA0 ; mapped ; 8FB0 # 3.0 KANGXI RADICAL MORNING 2FA1 ; mapped ; 8FB5 # 3.0 KANGXI RADICAL WALK
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Sat Feb 10 11:25:47 UTC 2024 - 854.1K bytes - Viewed (0)