Search Options

Results per page
Sort
Preferred Languages
Advance

Results 331 - 340 of 598 for padded (0.06 sec)

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

     * package, whether it is a subtype of {@code ImmutableCollection} or not.
     *
     * <h4>Guarantees</h4>
     *
     * <p>Each makes the following guarantees:
     *
     * <ul>
     *   <li><b>Shallow immutability.</b> Elements can never be added, removed or replaced in this
     *       collection. This is a stronger guarantee than that of {@link
     *       Collections#unmodifiableCollection}, whose contents change whenever the wrapped collection
     *       is modified.
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 21.4K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/util/concurrent/TestThread.java

     * method equivalent to {@link
     * java.util.concurrent.locks.ReentrantLock#hasWaiters(java.util.concurrent.locks.Condition)},
     * except that the method parameter must accept whatever condition-like object is passed into {@code
     * callAndAssertWaits} by the test.
     *
     * @param <L> the type of the lock-like object to be used
     * @author Justin T. Sampson
     */
    @NullUnmarked
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 10.8K bytes
    - Viewed (0)
  3. docs/distributed/README.md

    If one or more drives are offline at the start of a PutObject or NewMultipartUpload operation the object will have additional data protection bits added automatically to provide additional safety for these objects.
    
    ### High availability
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 8.9K bytes
    - Viewed (0)
  4. guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java

                EndpointPair.unordered(1, 3))
            .inOrder();
      }
    
      /**
       * Populates the graph with nodes and edges in a star shape with node `1` in the middle.
       *
       * <p>Note that the edges are added in a shuffled order to properly test the effect of the
       * insertion order.
       */
      private void populateTShapedGraph() {
        putEdge(2, 1);
        putEdge(1, 4);
        putEdge(1, 3);
        putEdge(1, 2); // Duplicate
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  5. docs/en/docs/advanced/events.md

    Here, the `shutdown` event handler function will write a text line `"Application shutdown"` to a file `log.txt`.
    
    /// info
    
    In the `open()` function, the `mode="a"` means "append", so, the line will be added after whatever is on that file, without overwriting the previous contents.
    
    ///
    
    /// tip
    
    Notice that in this case we are using a standard Python `open()` function that interacts with a file.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 7.9K bytes
    - Viewed (0)
  6. src/main/java/jcifs/pac/PacSignature.java

        /**
         * Constructs a PacSignature by parsing the provided data.
         *
         * @param data the raw signature data to parse
         * @throws PACDecodingException if the data is malformed or cannot be parsed
         */
        public PacSignature(final byte[] data) throws PACDecodingException {
            try {
                final PacDataInputStream bufferStream = new PacDataInputStream(new DataInputStream(new ByteArrayInputStream(data)));
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 3.4K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/eventbus/Dispatcher.java

        //    [a1, a2, a3, b1, b2], [a1, b2, a2, a3, b2], [a1, b2, b3, a2, a3], etc.)
        // 2. It's possible for subscribers to actually be dispatched to in a different order than they
        //    were added to the queue. It's easily possible for one thread to take the head of the
        //    queue, immediately followed by another thread taking the next element in the queue. That
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 17:27:14 UTC 2025
    - 7.4K bytes
    - Viewed (0)
  8. src/test/java/jcifs/internal/smb2/lease/DirectoryCacheEntryTest.java

                threads[i].start();
            }
    
            // Wait for all threads to complete
            for (Thread thread : threads) {
                thread.join();
            }
    
            // Verify all entries were added
            assertEquals(1000, entry.getChildren().size());
        }
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 23 01:47:47 UTC 2025
    - 8.4K bytes
    - Viewed (0)
  9. src/test/java/org/codelibs/fess/util/ParameterUtilTest.java

            String originalParams = "config.timeout=30\npassword=secret\nclient.host=localhost";
    
            // First parse
            Map<String, String> parsed = ParameterUtil.parse(originalParams);
            assertEquals(3, parsed.size());
            assertEquals("secret", parsed.get("password"));
    
            // Then encrypt
            String encrypted = ParameterUtil.encrypt(originalParams);
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Jul 12 07:34:10 UTC 2025
    - 22.6K bytes
    - Viewed (0)
  10. tensorflow/c/c_api.cc

          GraphDef graph_def;
          *graph_def.mutable_versions() = graph.versions();
          // Fill graph_def with nodes with ids in the range
          // [session->last_num_graph_nodes, num_nodes), that is the nodes
          // added since the last TF_SessionRun() call.
          for (auto id = session->last_num_graph_nodes; id < num_nodes; ++id) {
            Node* const node = graph.FindNodeId(id);
            if (node != nullptr && node->IsOp()) {
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Tue May 13 06:30:43 UTC 2025
    - 102.3K bytes
    - Viewed (0)
Back to top