Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 821 - 830 of 2,714 for data (0.03 seconds)

  1. src/main/java/jcifs/internal/smb2/io/Smb2ReadResponse.java

         *
         * @param config
         *            the configuration to use for this response
         * @param outputBuffer
         *            the buffer to receive the read data
         * @param outputBufferOffset
         *            the offset in the output buffer to start writing data
         */
        public Smb2ReadResponse(final Configuration config, final byte[] outputBuffer, final int outputBufferOffset) {
            super(config);
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 4.4K bytes
    - Click Count (0)
  2. guava/src/com/google/common/collect/Comparators.java

      /**
       * Returns the minimum of the two values. If the values compare as 0, the first is returned.
       *
       * <p>The recommended solution for finding the {@code minimum} of some values depends on the type
       * of your data and the number of elements you have. Read more in the Guava User Guide article on
       * <a href="https://github.com/google/guava/wiki/CollectionUtilitiesExplained#comparators">{@code
       * Comparators}</a>.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 10.9K bytes
    - Click Count (0)
  3. docs/extensions/s3zip/README.md

    e.g.:
    To download `2021/taxes.csv` archived in `financial.zip` and stored under a bucket named `company-data`, you can issue a GET request using the following path 'company-data/financial.zip/2021/taxes.csv`
    
    ## Contents properties
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Wed Apr 10 16:28:27 GMT 2024
    - 3K bytes
    - Click Count (0)
  4. cmd/xl-storage_test.go

    		t.Fatalf("Unable to create volume %s: %v", volume, err)
    	}
    	data := make([]byte, 8*1024)
    	if _, err = io.ReadFull(rand.Reader, data); err != nil {
    		t.Fatalf("Unable to create generate random data: %v", err)
    	}
    	if err = xlStorage.AppendFile(t.Context(), volume, object, data); err != nil {
    		t.Fatalf("Unable to create object: %v", err)
    	}
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 66K bytes
    - Click Count (0)
  5. docs/es/llm-prompt.md

    * list (as in Python list): list
    * context manager: context manager (do not translate to "gestor de contexto" or "administrador de contexto")
    * a little bit: un poquito
    * graph (data structure, as in "dependency graph"): grafo (do not translate to "gráfico")
    * form data: form data (do not translate to "datos de formulario" or "datos de form")
    * import (as in code import): import (do not translate to "importación")
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Tue Dec 16 16:33:45 GMT 2025
    - 5.4K bytes
    - Click Count (0)
  6. src/test/java/org/codelibs/fess/it/admin/BadWordTests.java

            String body = response.getBody().asString();
            assertTrue(body != null, "CSV response should not be null");
            // CSV should contain the test data
            assertTrue(body.contains(NAME_PREFIX) || body.isEmpty(), "CSV should contain test data or be empty");
        }
    
        @Test
        void testUploadCsv_ok() {
            // Create CSV content
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Dec 20 03:03:44 GMT 2025
    - 4.1K bytes
    - Click Count (0)
  7. cmd/metacache-entries_test.go

    func Test_metaCacheEntries_filterRecursiveRoot(t *testing.T) {
    	data := loadMetacacheSampleEntries(t)
    	data.filterRecursiveEntries("", slashSeparator)
    	got := data.entries().names()
    	want := []string{}
    	if !reflect.DeepEqual(want, got) {
    		t.Errorf("got unexpected result: %#v", got)
    	}
    }
    
    func Test_metaCacheEntries_filterRecursiveRootSep(t *testing.T) {
    	data := loadMetacacheSampleEntries(t)
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 31.6K bytes
    - Click Count (0)
  8. android/guava-tests/test/com/google/common/io/CharSinkTester.java

        Writer writer = sink.openStream();
        try {
          writer.write(data);
        } finally {
          writer.close();
        }
    
        assertContainsExpectedString();
      }
    
      public void testOpenBufferedStream() throws IOException {
        Writer writer = sink.openBufferedStream();
        try {
          writer.write(data);
        } finally {
          writer.close();
        }
    
        assertContainsExpectedString();
      }
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 12 17:47:10 GMT 2026
    - 4.5K bytes
    - Click Count (0)
  9. docs/orchestration/docker-compose/docker-compose.yaml

        <<: *minio-common
        hostname: minio1
        volumes:
          - data1-1:/data1
          - data1-2:/data2
    
      minio2:
        <<: *minio-common
        hostname: minio2
        volumes:
          - data2-1:/data1
          - data2-2:/data2
    
      minio3:
        <<: *minio-common
        hostname: minio3
        volumes:
          - data3-1:/data1
          - data3-2:/data2
    
      minio4:
        <<: *minio-common
        hostname: minio4
        volumes:
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 07 05:14:10 GMT 2025
    - 1.5K bytes
    - Click Count (0)
  10. internal/logger/logger.go

    	errorFmtFunc = f
    }
    
    // uniq swaps away duplicate elements in data, returning the size of the
    // unique set. data is expected to be pre-sorted, and the resulting set in
    // the range [0:size] will remain in sorted order. Uniq, following a
    // sort.Sort call, can be used to prepare arbitrary inputs for use as sets.
    func uniq(data sort.Interface) (size int) {
    	p, l := 0, data.Len()
    	if l <= 1 {
    		return l
    	}
    	for i := 1; i < l; i++ {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 12.4K bytes
    - Click Count (0)
Back to Top