Search Options

Results per page
Sort
Preferred Languages
Advance

Results 431 - 440 of 505 for printer (0.12 sec)

  1. android/guava/src/com/google/common/collect/Multimaps.java

       *       return Integer.toString(in * in);
       *     }
       * };
       * Multimap<String, String> transformed =
       *     Multimaps.transformValues(multimap, square);
       *   System.out.println(transformed);
       * }
       *
       * ... prints {@code {a=[4, 16], b=[9, 9], c=[36]}}.
       *
       * <p>Changes in the underlying multimap are reflected in this view. Conversely, this view
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 86.6K bytes
    - Viewed (0)
  2. guava/src/com/google/common/collect/Multimaps.java

       *       return Integer.toString(in * in);
       *     }
       * };
       * Multimap<String, String> transformed =
       *     Multimaps.transformValues(multimap, square);
       *   System.out.println(transformed);
       * }
       *
       * ... prints {@code {a=[4, 16], b=[9, 9], c=[36]}}.
       *
       * <p>Changes in the underlying multimap are reflected in this view. Conversely, this view
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 86.9K bytes
    - Viewed (0)
  3. src/test/java/org/codelibs/fess/dict/mapping/CharMappingFileTest.java

        private void writeTestFile(String content) throws IOException {
            Writer writer = null;
            try {
                writer = new OutputStreamWriter(new FileOutputStream(testFile), Constants.UTF_8);
                writer.write(content);
                writer.flush();
            } finally {
                CloseableUtil.closeQuietly(writer);
            }
        }
    
        // Helper method to assert arrays are equal (handles sorting)
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 18.5K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/util/concurrent/ServiceManager.java

       * ServiceManager} constructor without having to close over the partially constructed {@link
       * ServiceManager} instance (i.e. avoid leaking a pointer to {@code this}).
       */
      private final ServiceManagerState state;
    
      private final ImmutableList<Service> services;
    
      /**
       * Constructs a new instance for managing the given services.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 17:27:14 UTC 2025
    - 33.2K bytes
    - Viewed (0)
  5. cmd/storage-rest-client.go

    		return errDiskNotFound
    	}
    	return err
    }
    
    // Abstracts a remote disk.
    type storageRESTClient struct {
    	endpoint   Endpoint
    	restClient *rest.Client
    	gridConn   *grid.Subroute
    	diskID     atomic.Pointer[string]
    
    	diskInfoCache *cachevalue.Cache[DiskInfo]
    }
    
    // Retrieve location indexes.
    func (client *storageRESTClient) GetDiskLoc() (poolIdx, setIdx, diskIdx int) {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 08 02:38:41 UTC 2025
    - 30.4K bytes
    - Viewed (0)
  6. src/test/java/jcifs/smb/SmbRandomAccessFileTest.java

            byte[] dst = new byte[4];
            assertDoesNotThrow(() -> raf.readFully(dst));
            assertEquals(2, calls.get());
        }
    
        @Test
        @DisplayName("skipBytes(): advances file pointer for positive values")
        void skipBytes_advancesFP() throws Exception {
            SmbRandomAccessFile raf = newInstance("r", false, false, false);
            assertEquals(0L, raf.getFilePointer());
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 18.1K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/collect/RegularImmutableMap.java

       * double the index of the entry in entrySet.asList.)
       *
       * The basic data structure is described in https://en.wikipedia.org/wiki/Open_addressing.
       * The pointer to a key is stored in hashTable[Hashing.smear(key.hashCode()) % table.length],
       * save that if that location is already full, we try the next index, and the next, until we
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 22.5K bytes
    - Viewed (0)
  8. tensorflow/c/c_api_experimental.cc

      if (input_tensors != nullptr) {
        // Note that we take the address of the elements in `all_input_tensors`
        // below. Allocate enough space so that no reallocation happens, which will
        // make the pointers invalid.
        all_input_tensors.reserve(num_inputs);
        for (int i = 0; i < num_inputs; ++i) {
          if (input_tensors[i] == nullptr) continue;
          all_input_tensors.emplace_back();
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Aug 18 03:53:25 UTC 2025
    - 29.5K bytes
    - Viewed (0)
  9. src/bytes/buffer.go

    		// Write method in io.Writer
    		if m != nBytes {
    			return n, io.ErrShortWrite
    		}
    	}
    	// Buffer is now empty; reset.
    	b.Reset()
    	return n, nil
    }
    
    // WriteByte appends the byte c to the buffer, growing the buffer as needed.
    // The returned error is always nil, but is included to match [bufio.Writer]'s
    // WriteByte. If the buffer becomes too large, WriteByte will panic with
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon May 19 17:38:56 UTC 2025
    - 16K bytes
    - Viewed (0)
  10. docs/ru/docs/features.md

    * Прекрасно сочетается с вашими **<abbr title="Интегрированное окружение для разработки, похожее на текстовый редактор">IDE</abbr>/<abbr title="программа проверяющая ошибки в коде">linter</abbr>/мозгом**:
        * Потому что структуры данных pydantic - это всего лишь экземпляры классов, определённых вами. Автодополнение, проверка кода, mypy и ваша интуиция - всё будет работать с вашими проверенными данными.
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sat Nov 09 16:39:20 UTC 2024
    - 16.2K bytes
    - Viewed (0)
Back to top