- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 85 for bitLen (0.08 sec)
-
api/go1.18.txt
pkg net/netip, method (Addr) AppendTo([]uint8) []uint8 pkg net/netip, method (Addr) As16() [16]uint8 pkg net/netip, method (Addr) As4() [4]uint8 pkg net/netip, method (Addr) AsSlice() []uint8 pkg net/netip, method (Addr) BitLen() int pkg net/netip, method (Addr) Compare(Addr) int pkg net/netip, method (Addr) Is4() bool pkg net/netip, method (Addr) Is4In6() bool pkg net/netip, method (Addr) Is6() bool
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Fri Feb 17 20:31:46 UTC 2023 - 13K bytes - Viewed (0) -
api/go1.5.txt
pkg go/constant, const String Kind pkg go/constant, const Unknown = 0 pkg go/constant, const Unknown Kind pkg go/constant, func BinaryOp(Value, token.Token, Value) Value pkg go/constant, func BitLen(Value) int pkg go/constant, func BoolVal(Value) bool pkg go/constant, func Bytes(Value) []uint8 pkg go/constant, func Compare(Value, token.Token, Value) bool pkg go/constant, func Denom(Value) Value
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Jul 30 21:14:09 UTC 2015 - 46.6K bytes - Viewed (0) -
lib/fips140/v1.1.0-rc1.zip
bitUnpackSlow(v []byte, a, b int) (ringElement, error) { bitlen := bits.Len(uint(a + b)) if bitlen <= 0 || bitlen > 16 { panic("mldsa: internal error: invalid bitlen") } if len(v) != n*bitlen/8 { return ringElement{}, errors.New("mldsa: invalid input length for bitUnpackSlow") } mask := uint32((1 << bitlen) - 1) maxValue := uint32(a + b) var r ringElement var acc uint32 var accBits uint vIdx := 0 for i := range r { for accBits < uint(bitlen) { if vIdx < len(v) { acc |= uint32(v[vIdx]) << accBits vIdx++...Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Dec 11 16:27:41 UTC 2025 - 663K bytes - Viewed (0) -
lib/fips140/v1.0.0-c2097c7c.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 Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Sep 25 19:53:19 UTC 2025 - 642.7K bytes - Viewed (0) -
docs/de/docs/help-fastapi.md
* Stellen Sie eine **Frage** oder bitten Sie um Hilfe mit einem **Problem**. * Schlagen Sie eine neue **Funktionalität** vor. **Hinweis**: Wenn Sie das tun, bitte ich Sie, auch anderen zu helfen. 😉 ## Pull Requests prüfen { #review-pull-requests } Sie können mir helfen, Pull Requests von anderen zu überprüfen. Noch einmal, bitte versuchen Sie Ihr Bestes, freundlich zu sein. 🤗 ---Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Sep 20 15:10:09 UTC 2025 - 16.2K bytes - Viewed (0) -
docs/de/README.md
$ unzip fess-15.3.x.zip $ cd fess-15.3.x $ ./bin/fess Weitere Informationen finden Sie im [Installationshandbuch](https://fess.codelibs.org/15.3/install/index.html). ### Docker Wir bieten Docker-Images auf [ghcr.io](https://github.com/orgs/codelibs/packages) an. Wir stellen auch eine Docker Compose (YAML)-Datei in [diesem Repository](https://github.com/codelibs/docker-fess/tree/master/compose) bereit.Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Tue Nov 11 22:42:32 UTC 2025 - 7.8K bytes - Viewed (0) -
docs/tr/docs/async.md
Yani Aşkınızın😍 hikayeyi bitirmesini bekliyorsunuz (çalışmayı bitir ⏯ / görev işleniyor.. 🤓), nazikçe gülümseyin ve hamburger yemeye gittiğinizi söyleyin ⏸. Ardından tezgaha 🔀, şimdi biten ilk göreve ⏯ gidin, Hamburgerleri 🍔 alın, teşekkür edin ve masaya götürün. sayacın bu adımı tamamlanır ⏹. Bu da yeni bir görev olan "hamburgerleri ye" 🔀 ⏯ görevini başlatırken "hamburgerleri al" ⏹ görevini bitirir.
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sun Aug 31 09:56:21 UTC 2025 - 21.8K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/base/WhitespaceMatcherBenchmark.java
@BeforeExperiment protected void setUp() { BitSet bitSet = new BitSet(); for (int i = 0; i < OLD_WHITESPACE_TABLE.length(); i++) { bitSet.set(OLD_WHITESPACE_TABLE.charAt(i)); } bitSet.clear(0); bitSet.clear(1); matcher = useNew ? CharMatcher.whitespace() : OLD_WHITESPACE; teststring = newTestString(new Random(1), bitSet, percentMatching); } @Benchmark
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 3.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Booleans.java
* * <p><b>Note:</b> consider representing the array as a {@link java.util.BitSet} instead, * replacing {@code Booleans.contains(array, true)} with {@code !bitSet.isEmpty()} and {@code * Booleans.contains(array, false)} with {@code bitSet.nextClearBit(0) == sizeOfBitSet}. * * @param array an array of {@code boolean} values, possibly emptyRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Sep 25 15:01:23 UTC 2025 - 20.6K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Booleans.java
* * <p><b>Note:</b> consider representing the array as a {@link java.util.BitSet} instead, * replacing {@code Booleans.contains(array, true)} with {@code !bitSet.isEmpty()} and {@code * Booleans.contains(array, false)} with {@code bitSet.nextClearBit(0) == sizeOfBitSet}. * * @param array an array of {@code boolean} values, possibly emptyRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Sep 25 15:01:23 UTC 2025 - 20.6K bytes - Viewed (0)