Search Options

Results per page
Sort
Preferred Languages
Advance

Results 2131 - 2140 of 2,424 for pong (0.02 sec)

  1. src/test/java/jcifs/smb1/util/HMACT64Test.java

        private static final byte[] TEST_DATA = "testdata".getBytes();
        private static final byte[] EMPTY_DATA = new byte[0];
    
        static {
            // Initialize long key with predictable data
            Arrays.fill(LONG_TEST_KEY, (byte) 0xAB);
        }
    
        @Test
        void testConstructorWithNormalKey() {
            // Test constructor with a normal length key
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 10.1K bytes
    - Viewed (0)
  2. docs/pt/docs/advanced/path-operation-advanced-configuration.md

    Se você abrir os documentos criados automaticamente para a API, sua extensão aparecerá no final da *operação de rota* específica.
    
    <img src="/img/tutorial/path-operation-advanced-configuration/image01.png">
    
    E se você olhar o esquema OpenAPI resultante (na rota `/openapi.json` da sua API), você verá que a sua extensão também faz parte da *operação de rota* específica:
    
    ```JSON hl_lines="22"
    {
        "openapi": "3.1.0",
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Nov 18 02:25:44 UTC 2024
    - 8.3K bytes
    - Viewed (0)
  3. docs/ru/docs/tutorial/body-nested-models.md

    ## Универсальная поддержка редактора
    
    И вы получаете поддержку редактора везде.
    
    Даже для элементов внутри списков:
    
    <img src="/img/tutorial/body-nested-models/image01.png">
    
    Вы не могли бы получить такую поддержку редактора, если бы работали напрямую с `dict`, а не с моделями Pydantic.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Nov 18 02:25:44 UTC 2024
    - 12.3K bytes
    - Viewed (0)
  4. guava-tests/test/com/google/common/hash/AbstractStreamingHasherTest.java

        assertThrows(IndexOutOfBoundsException.class, () -> sink.putBytes(new byte[8], 0, 16));
        assertThrows(IndexOutOfBoundsException.class, () -> sink.putBytes(new byte[8], 0, -1));
      }
    
      /**
       * This test creates a long random sequence of inputs, then a lot of differently configured sinks
       * process it; all should produce the same answer, the only difference should be the number of
       * process()/processRemaining() invocations, due to alignment.
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 17:27:14 UTC 2025
    - 8.5K bytes
    - Viewed (0)
  5. src/main/resources/fess_thumbnail.xml

    		<postConstruct name="addCondition">
    			<arg>"mimetype"</arg>
    			<arg>"image/gif"
    			</arg>
    		</postConstruct>
    		<postConstruct name="addCondition">
    			<arg>"mimetype"</arg>
    			<arg>"image/png"
    			</arg>
    		</postConstruct>
    		<postConstruct name="addCondition">
    			<arg>"mimetype"</arg>
    			<arg>"image/vnd.adobe.photoshop"
    			</arg>
    		</postConstruct>
    		<postConstruct name="addCondition">
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Fri Oct 11 21:34:52 UTC 2019
    - 5.4K bytes
    - Viewed (0)
  6. okhttp/src/jvmTest/kotlin/okhttp3/URLConnectionTest.kt

                  override fun contentType(): MediaType? = null
    
                  override fun contentLength(): Long = contentLength
    
                  override fun writeTo(sink: BufferedSink) {
                    val buffer = ByteArray(1024 * 1024)
                    var bytesWritten: Long = 0
                    while (bytesWritten < contentLength) {
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sat Jun 21 20:36:35 UTC 2025
    - 133.2K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/collect/MapMakerInternalMap.java

        // CONTAINS_VALUE_RETRIES increases, though without locking it is theoretically possible.
        Segment<K, V, E, S>[] segments = this.segments;
        long last = -1L;
        for (int i = 0; i < CONTAINS_VALUE_RETRIES; i++) {
          long sum = 0L;
          for (Segment<K, V, E, S> segment : segments) {
            // ensure visibility of most recent completed write
            int unused = segment.count; // read-volatile
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 90K bytes
    - Viewed (0)
  8. src/main/java/org/codelibs/fess/app/service/DataConfigService.java

                } else {
                    cb.query().setDescription_MatchPhrase(dataConfigPager.description);
                }
            }
            // TODO Long, Integer, String supported only.
    
            // setup condition
            cb.query().addOrderBy_SortOrder_Asc();
            cb.query().addOrderBy_Name_Asc();
    
            // search
    
        }
    
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 8K bytes
    - Viewed (0)
  9. src/main/java/org/codelibs/fess/entity/SearchRequestParams.java

            }
            final String minDocCountStr = request.getParameter("facet.minDocCount");
            if (StringUtil.isNotBlank(minDocCountStr)) {
                facetInfo.minDocCount = Long.parseLong(minDocCountStr);
            }
            final String sort = request.getParameter("facet.sort");
            if (StringUtil.isNotBlank(sort)) {
                facetInfo.sort = sort;
            }
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 8K bytes
    - Viewed (0)
  10. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Huffman.kt

          bitCount += CODE_BIT_COUNTS[byteIn].toLong()
        }
    
        return ((bitCount + 7) shr 3).toInt() // Round up to an even byte.
      }
    
      fun decode(
        source: BufferedSource,
        byteCount: Long,
        sink: BufferedSink,
      ) {
        var node = root
        var accumulator = 0
        var accumulatorBitCount = 0
        for (i in 0 until byteCount) {
          val byteIn = source.readByte() and 0xff
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Wed Mar 19 19:25:20 UTC 2025
    - 11K bytes
    - Viewed (0)
Back to top