Search Options

Results per page
Sort
Preferred Languages
Advance

Results 51 - 60 of 115 for newest (0.04 sec)

  1. docs/fr/docs/tutorial/path-params-numeric-validations.md

    ///
    
    ## Ordonnez les paramètres comme vous le souhaitez
    
    /// tip
    
    Ce n'est probablement pas aussi important ou nécessaire si vous utilisez `Annotated`.
    
    ///
    
    Disons que vous voulez déclarer le paramètre de requête `q` comme un `str` requis.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sat Nov 09 16:39:20 UTC 2024
    - 6.9K bytes
    - Viewed (0)
  2. src/test/java/jcifs/smb1/dcerpc/ndr/NdrShortTest.java

            // 10 bytes is more than enough for the 2-byte short
            raw = new byte[10];
            buf = new NdrBuffer(raw, 0);
        }
    
        /**
         * Validate that the constructor masks the supplied value to its
         * lowest 8 bits (NdrShort incorrectly masks to 8 bits even though it's a short).
         */
        @ParameterizedTest
        @ValueSource(ints = { 0, 1, 255, -1, 256, 65535 })
        void constructorMasksValue(int input) {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 5.1K bytes
    - Viewed (0)
  3. guava/src/com/google/common/math/BigIntegerMath.java

       *
       * <p>For the case of {@link RoundingMode#HALF_EVEN}, this implementation uses the IEEE 754
       * default rounding mode: if the two nearest representable values are equally near, the one with
       * the least significant bit zero is chosen. (In such cases, both of the nearest representable
       * values are even integers; this method returns the one that is a multiple of a greater power of
       * two.)
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 18.8K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/collect/CompactHashMap.java

            int newTableIndex = hash & newMask;
            int newNext = CompactHashing.tableGet(newTable, newTableIndex);
            CompactHashing.tableSet(newTable, newTableIndex, oldNext);
            entries[entryIndex] = CompactHashing.maskCombine(hash, newNext, newMask);
    
            oldNext = CompactHashing.getNext(oldEntry, oldMask);
          }
        }
    
        this.table = newTable;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 35.7K bytes
    - Viewed (0)
  5. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Hpack.kt

          private val source: BufferedSource = source.buffer()
    
          // Visible for testing.
          @JvmField var dynamicTable = arrayOfNulls<Header>(8)
    
          // Array is populated back to front, so new entries always have lowest index.
          private var nextHeaderIndex = dynamicTable.size - 1
    
          @JvmField var headerCount = 0
    
          @JvmField var dynamicTableByteCount = 0
    
          fun getAndResetHeaderList(): List<Header> {
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Mon May 05 16:01:00 UTC 2025
    - 22.4K bytes
    - Viewed (0)
  6. src/test/java/jcifs/internal/smb2/info/Smb2QueryInfoRequestTest.java

            int size = request.size();
    
            // Expected size calculation: size8(SMB2_HEADER_LENGTH + 40)
            // size8 rounds up to nearest multiple of 8
            int expectedRawSize = Smb2Constants.SMB2_HEADER_LENGTH + 40;
            int expectedSize = (expectedRawSize + 7) & ~7; // Round up to nearest 8
            assertEquals(expectedSize, size);
        }
    
        @Test
        @DisplayName("Test size method with input buffer")
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 22.6K bytes
    - Viewed (0)
  7. docs/fr/docs/advanced/response-directly.md

    ///
    
    ## Renvoyer une `Response` personnalisée
    
    L'exemple ci-dessus montre toutes les parties dont vous avez besoin, mais il n'est pas encore très utile, car vous auriez pu retourner l'`item` directement, et **FastAPI** l'aurait mis dans une `JSONResponse` pour vous, en le convertissant en `dict`, etc. Tout cela par défaut.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sat Nov 09 16:39:20 UTC 2024
    - 3.6K bytes
    - Viewed (0)
  8. guava/src/com/google/common/primitives/Floats.java

      }
    
      /**
       * Returns the start position of the first occurrence of the specified {@code target} within
       * {@code array}, or {@code -1} if there is no such occurrence.
       *
       * <p>More formally, returns the lowest index {@code i} such that {@code Arrays.copyOfRange(array,
       * i, i + target.length)} contains exactly the same elements as {@code target}.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 25.7K bytes
    - Viewed (0)
  9. src/test/java/jcifs/netbios/LmhostsTest.java

            Thread.sleep(100);
            try (FileWriter writer = new FileWriter(lmhostsFile)) {
                writer.write("192.168.1.200 NEWHOST\n");
            }
    
            // Should reload file and find new host
            result = lmhosts.getByName("NEWHOST", mockContext);
            assertNotNull(result);
    
            // Old host should not be found
            result = lmhosts.getByName("TESTHOST", mockContext);
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 18.2K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/hash/Fingerprint2011.java

        weakHashLength32WithSeeds(bytes, offset + length - 32, length * K1, K0, w);
        z += shiftMix(v[1]) * K1;
        x = rotateRight(z + x, 39) * K1;
        y = rotateRight(y, 33) * K1;
    
        // Decrease length to the nearest multiple of 64, and operate on 64-byte chunks.
        length = (length - 1) & ~63;
        do {
          x = rotateRight(x + y + v[0] + load64(bytes, offset + 16), 37) * K1;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 6.5K bytes
    - Viewed (0)
Back to top