Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 311 - 320 of 523 for largeop (0.04 seconds)

  1. src/main/java/org/codelibs/core/collection/SLinkedList.java

            return result;
        }
    
        /**
         * Converts the list to an array.
         *
         * @param array the array to store the elements. A new array of the same runtime type is allocated if the array is not large enough.
         * @return the array
         */
        @SuppressWarnings("unchecked")
        public E[] toArray(E[] array) {
            if (array.length < size) {
    Created: Fri Apr 03 20:58:12 GMT 2026
    - Last Modified: Thu Jun 19 09:12:22 GMT 2025
    - 10.5K bytes
    - Click Count (0)
  2. src/test/java/jcifs/smb1/smb1/SmbComTransactionResponseTest.java

         * copied in a single call.
         */
        @Test
        public void readBytesWireFormat_succeedsWithSingleRead() {
            DummyResponse d = new DummyResponse();
            // Allocate a transaction buffer large enough for the copy
            byte[] tx = new byte[100];
            d.txn_buf = tx;
    
            // Set up a scenario where the full transaction is read in one call
            d.bufParameterStart = 0;
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 12K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/collect/DiscreteDomain.java

       * <p>Note that this function is necessarily well-defined for any discrete type.
       *
       * @return the distance as described above, or {@link Long#MIN_VALUE} or {@link Long#MAX_VALUE} if
       *     the distance is too small or too large, respectively.
       */
      public abstract long distance(C start, C end);
    
      /**
       * Returns the minimum value of type {@code C}, if it has one. The minimum value is the unique
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Feb 13 17:34:21 GMT 2025
    - 10.4K bytes
    - Click Count (0)
  4. docs/site-replication/run-multi-site-oidc.sh

    if [ $? -eq 0 ]; then
    	echo "svc account found after delete, exiting.."
    	exit_1
    fi
    
    # create a bucket bucket2 on minio1.
    ./mc mb minio1/bucket2
    
    ./mc mb minio1/newbucket
    
    # copy large upload to newbucket on minio1
    truncate -s 17M lrgfile
    expected_checksum=$(cat ./lrgfile | md5sum)
    
    ./mc cp ./lrgfile minio1/newbucket
    sleep 5
    ./mc stat --no-list minio2/newbucket
    if [ $? -ne 0 ]; then
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Sep 24 08:03:58 GMT 2024
    - 8.5K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/collect/MapMaker.java

       * is {@code 60}, and the concurrency level is {@code 8}, then eight segments are created, each
       * having a hash table of size eight. Providing a large enough estimate at construction time
       * avoids the need for expensive resizing operations later, but setting this value unnecessarily
       * high wastes memory.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 12.8K bytes
    - Click Count (0)
  6. docs/en/docs/advanced/custom-response.md

    Since this small example does not need any `await` statements, we add an `await anyio.sleep(0)` to give the event loop a chance to handle cancellation.
    
    This would be even more important with large or infinite streams.
    
    ///
    
    /// tip
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 11K bytes
    - Click Count (0)
  7. src/test/java/org/codelibs/fess/mylasta/direction/sponsor/FessTimeResourceProviderTest.java

                assertNull(exceptions[i], "Thread " + i + " threw exception");
                assertNotNull(providers[i], "Thread " + i + " failed to create provider");
            }
        }
    
        // Test with very large time adjustment values
        @Test
        public void test_largeTimeAdjustmentValues() {
            // Test with milliseconds in a year
            long yearInMillis = 365L * 24L * 60L * 60L * 1000L;
    
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Mar 13 23:01:26 GMT 2026
    - 17.8K bytes
    - Click Count (0)
  8. src/test/java/jcifs/internal/smb1/trans/TransPeekNamedPipeResponseTest.java

            response2.readParametersWireFormat(buffer, 0, 6);
            assertEquals(0xFFFF, response2.getAvailable());
        }
    
        @Test
        @DisplayName("Test large buffer handling")
        void testLargeBufferHandling() {
            // Arrange
            byte[] largeBuffer = new byte[65536]; // 64KB buffer
    
            // Act & Assert
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 15.8K bytes
    - Click Count (0)
  9. src/test/java/jcifs/internal/fscc/FsctlPipeWaitRequestTest.java

            byte[] nameBytes = pipeName.getBytes(StandardCharsets.UTF_16LE);
    
            // Verify size
            assertEquals(14 + nameBytes.length, request.size());
    
            // Test encoding with large buffer
            byte[] buffer = new byte[14 + nameBytes.length + 100];
            int bytesEncoded = request.encode(buffer, 0);
    
            // Verify
            assertEquals(14 + nameBytes.length, bytesEncoded);
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 13.1K bytes
    - Click Count (0)
  10. docs/uk/docs/_llm-test.md

    # Тестовий файл LLM { #llm-test-file }
    
    Цей документ перевіряє, чи розуміє <abbr title="Large Language Model - Велика мовна модель">LLM</abbr>, який перекладає документацію, `general_prompt` у `scripts/translate.py` та мовно-специфічну підсказку в `docs/{language code}/llm-prompt.md`. Мовно-специфічна підсказка додається до `general_prompt`.
    
    Тести, додані тут, побачать усі автори мовно-специфічних підсказок.
    
    Використовуйте так:
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:27:41 GMT 2026
    - 17K bytes
    - Click Count (0)
Back to Top