Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 78 for bitLen (1.11 sec)

  1. 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 Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Feb 17 20:31:46 UTC 2023
    - 13K bytes
    - Viewed (0)
  2. 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)
  3. 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
    
    Sie können mir helfen, Pull Requests von anderen zu überprüfen (Review).
    
    Noch einmal, bitte versuchen Sie Ihr Bestes, freundlich zu sein. 🤗
    
    ---
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 16K bytes
    - Viewed (0)
  4. docs/de/README.md

        $ unzip fess-14.17.x.zip
        $ cd fess-14.17.x
        $ ./bin/fess
    
    Weitere Informationen finden Sie im [Installationshandbuch](https://fess.codelibs.org/14.17/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: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 12 07:19:47 UTC 2024
    - 7.6K bytes
    - Viewed (0)
  5. 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 Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:56:21 UTC 2025
    - 21.8K bytes
    - Viewed (0)
  6. android/guava-tests/test/com/google/common/base/CharMatcherTest.java

        assertSame(CharMatcher.any(), CharMatcher.any().precomputed());
      }
    
      @GwtIncompatible // java.util.BitSet
      private static BitSet bitSet(String chars) {
        return bitSet(chars.toCharArray());
      }
    
      @GwtIncompatible // java.util.BitSet
      private static BitSet bitSet(char[] chars) {
        BitSet tmp = new BitSet();
        for (char c : chars) {
          tmp.set(c);
        }
        return tmp;
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 30.3K bytes
    - Viewed (0)
  7. docs/de/docs/python-types.md

    Durch das Deklarieren von Typen für Ihre Variablen können Editoren und Tools bessere Unterstützung bieten.
    
    Dies ist lediglich eine **schnelle Anleitung / Auffrischung** über Pythons Typhinweise. Sie deckt nur das Minimum ab, das nötig ist, um diese mit **FastAPI** zu verwenden ... was tatsächlich sehr wenig ist.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sat Nov 09 16:39:20 UTC 2024
    - 18.9K bytes
    - Viewed (1)
  8. 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 empty
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 20.5K bytes
    - Viewed (0)
  9. 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 empty
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 20.5K bytes
    - Viewed (0)
  10. 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 Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 3.9K bytes
    - Viewed (0)
Back to top