Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 162 for small2 (0.07 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. src/archive/tar/reader_test.go

    	}{{
    		file: "testdata/gnu.tar",
    		headers: []*Header{{
    			Name:     "small.txt",
    			Mode:     0640,
    			Uid:      73025,
    			Gid:      5000,
    			Size:     5,
    			ModTime:  time.Unix(1244428340, 0),
    			Typeflag: '0',
    			Uname:    "dsymonds",
    			Gname:    "eng",
    			Format:   FormatGNU,
    		}, {
    			Name:     "small2.txt",
    			Mode:     0640,
    			Uid:      73025,
    			Gid:      5000,
    			Size:     11,
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Dec 30 15:28:53 GMT 2025
    - 47.5K bytes
    - Click Count (0)
  2. src/archive/tar/writer_test.go

    	}{{
    		// The writer test file was produced with this command:
    		// tar (GNU tar) 1.26
    		//   ln -s small.txt link.txt
    		//   tar -b 1 --format=ustar -c -f writer.tar small.txt small2.txt link.txt
    		file: "testdata/writer.tar",
    		tests: []testFnc{
    			testHeader{Header{
    				Typeflag: TypeReg,
    				Name:     "small.txt",
    				Size:     5,
    				Mode:     0640,
    				Uid:      73025,
    				Gid:      5000,
    				Uname:    "dsymonds",
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Mon Dec 15 16:34:13 GMT 2025
    - 40.2K bytes
    - Click Count (0)
  3. guava-tests/test/com/google/common/math/QuantilesAlgorithm.java

          Collection<Integer> indexes, int scale, double[] dataset);
    
      static double getMinValue(double[] array, int from) {
        // This is basically a copy of com.google.math.Rank#getMinValue, with a small change in the
        // method signature: we always search to the end of the array.
        int min = from;
        for (int i = from + 1; i < array.length; i++) {
          if (array[min] > array[i]) {
            min = i;
          }
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 05:21:26 GMT 2026
    - 7.3K bytes
    - Click Count (0)
  4. android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java

          Collection<Integer> indexes, int scale, double[] dataset);
    
      static double getMinValue(double[] array, int from) {
        // This is basically a copy of com.google.math.Rank#getMinValue, with a small change in the
        // method signature: we always search to the end of the array.
        int min = from;
        for (int i = from + 1; i < array.length; i++) {
          if (array[min] > array[i]) {
            min = i;
          }
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 05:21:26 GMT 2026
    - 7.3K bytes
    - Click Count (0)
  5. src/test/java/org/codelibs/core/io/FileUtilTest.java

         *
         * @throws Exception
         */
        @Test
        public void testReadBytes_CustomMaxSize_WithinLimit() throws Exception {
            final File file = tempFolder.newFile("small.txt");
            final String content = "Small content";
            final FileOutputStream out = new FileOutputStream(file);
            try {
                out.write(content.getBytes("UTF-8"));
            } finally {
                out.close();
    Created: Fri Apr 03 20:58:12 GMT 2026
    - Last Modified: Sat Nov 22 11:21:59 GMT 2025
    - 10.3K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/collect/CompactHashing.java

      /** Default size of a compact hash-based collection. */
      static final int DEFAULT_SIZE = 3;
    
      /**
       * Minimum size of the hash table of a compact hash-based collection. Because small hash tables
       * use a byte[], any smaller size uses the same amount of memory due to object padding.
       */
      private static final int MIN_HASH_TABLE_SIZE = 4;
    
      private static final int BYTE_MAX_SIZE = 1 << Byte.SIZE; // 2^8 = 256
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 26 20:08:09 GMT 2025
    - 7.1K bytes
    - Click Count (0)
  7. docs/uk/docs/index.md

    ---
    
    "_We adopted the **FastAPI** library to spawn a **REST** server that can be queried to obtain **predictions**. [for Ludwig]_"
    
    <div style="text-align: right; margin-right: 10%;">Piero Molino, Yaroslav Dudin, and Sai Sumanth Miryala - <strong>Uber</strong> <a href="https://eng.uber.com/ludwig-v0-2/"><small>(ref)</small></a></div>
    
    ---
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:27:41 GMT 2026
    - 29.1K bytes
    - Click Count (0)
  8. docs/zh/docs/index.md

    ---
    
    「_我们采用 **FastAPI** 来构建可查询以获取**预测结果**的 **REST** 服务器。[用于 Ludwig]_」
    
    <div style="text-align: right; margin-right: 10%;">Piero Molino,Yaroslav Dudin,Sai Sumanth Miryala - <strong>Uber</strong> <a href="https://eng.uber.com/ludwig-v0-2/"><small>(ref)</small></a></div>
    
    ---
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 17:06:37 GMT 2026
    - 20.7K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/primitives/Ints.java

        //     imagine a line separating the first block from the second, we can proceed by exchanging
        //     the smaller of these blocks with the far end of the other one. That leaves us with a
        //     smaller version of the same problem.
        //     Say we are rotating abcdefgh by 5. We start with abcde|fgh. The smaller block is [fgh]:
        //     [abc]de|[fgh] -> [fgh]de|[abc]. Now [fgh] is in the right place, but we need to swap [de]
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 17 16:45:58 GMT 2026
    - 31.3K bytes
    - Click Count (0)
  10. docs/de/docs/index.md

    ---
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 17:58:09 GMT 2026
    - 23.6K bytes
    - Click Count (1)
Back to Top