Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 371 - 380 of 896 for mover (0.02 seconds)

  1. src/test/java/jcifs/smb1/dcerpc/ndr/NdrShortTest.java

    import org.junit.jupiter.params.ParameterizedTest;
    import org.junit.jupiter.params.provider.ValueSource;
    import org.mockito.junit.jupiter.MockitoExtension;
    
    /**
     * Unit tests for {@link NdrShort}.  The tests cover construction,
     * encoding and decoding logic, masking behaviour, alignment handling and
     * interaction with {@link NdrBuffer}.  All public behaviour is exercised.
     */
    @ExtendWith(MockitoExtension.class)
    class NdrShortTest {
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 5.1K bytes
    - Click Count (0)
  2. guava/src/com/google/common/collect/ImmutableMap.java

       * convenient.
       *
       * <p>By default, a {@code Builder} will generate maps that iterate over entries in the order they
       * were inserted into the builder, equivalently to {@code LinkedHashMap}. For example, in the
       * above example, {@code WORD_TO_INT.entrySet()} is guaranteed to iterate over the entries in the
       * order {@code "one"=1, "two"=2, "three"=3}, and {@code keySet()} and {@code values()} respect
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Mar 08 16:16:42 GMT 2026
    - 44.7K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/graph/PredecessorsFunction.java

     * {@snippet :
     * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.mother(), node.father()));
     * }
     *
     * <p>Graph algorithms that need additional capabilities (accessing both predecessors and
     * successors, iterating over the edges, etc.) should declare their input to be of a type that
     * provides those capabilities, such as {@link Graph}, {@link ValueGraph}, or {@link Network}.
     *
     * <h3>Additional documentation</h3>
     *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 4K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/graph/SuccessorsFunction.java

     * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.leftChild(), node.rightChild()));
     * }
     *
     * <p>Graph algorithms that need additional capabilities (accessing both predecessors and
     * successors, iterating over the edges, etc.) should declare their input to be of a type that
     * provides those capabilities, such as {@link Graph}, {@link ValueGraph}, or {@link Network}.
     *
     * <h3>Additional documentation</h3>
     *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 4.2K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/collect/Platform.java

      /** Equivalent to Arrays.copyOfRange(source, from, to, arrayOfType.getClass()). */
      /*
       * Arrays are a mess from a nullness perspective, and Class instances for object-array types are
       * even worse. For now, we just suppress and move on with our lives.
       *
       * - https://github.com/jspecify/jspecify/issues/65
       *
       * - https://github.com/jspecify/jdk/commit/71d826792b8c7ef95d492c50a274deab938f2552
       */
      /*
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Jan 23 17:16:53 GMT 2026
    - 4.5K bytes
    - Click Count (0)
  6. guava/src/com/google/common/collect/Platform.java

      /** Equivalent to Arrays.copyOfRange(source, from, to, arrayOfType.getClass()). */
      /*
       * Arrays are a mess from a nullness perspective, and Class instances for object-array types are
       * even worse. For now, we just suppress and move on with our lives.
       *
       * - https://github.com/jspecify/jspecify/issues/65
       *
       * - https://github.com/jspecify/jdk/commit/71d826792b8c7ef95d492c50a274deab938f2552
       */
      /*
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Jan 23 17:16:53 GMT 2026
    - 4.7K bytes
    - Click Count (0)
  7. internal/bucket/lifecycle/evaluator.go

    		return true
    	}
    
    	return false
    }
    
    // IsObjectLocked checks if it is appropriate to remove an
    // object according to locking configuration when this is lifecycle/ bucket quota asking.
    // (copied over from enforceRetentionForDeletion)
    func (e *Evaluator) IsObjectLocked(obj ObjectOpts) bool {
    	if e.lockRetention == nil || !e.lockRetention.LockEnabled {
    		return false
    	}
    
    	if obj.DeleteMarker {
    		return false
    	}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Apr 08 15:41:24 GMT 2025
    - 4.6K bytes
    - Click Count (0)
  8. guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java

        assertEquals((Integer) 2, it.next());
        it.remove();
        // After this remove, 400 has moved up and 20 down past cursor
        assertTrue("Heap is not intact after remove", mmHeap.isIntact());
        assertEquals((Integer) 10, it.next());
        assertEquals((Integer) 3, it.next());
        it.remove();
        // After this remove, 400 moved down again and 500 up past the cursor
        assertTrue("Heap is not intact after remove", mmHeap.isIntact());
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 36.2K bytes
    - Click Count (0)
  9. docs/en/docs/tutorial/security/index.md

            * `clientCredentials`
            * `authorizationCode`
        * But there is one specific "flow" that can be perfectly used for handling authentication in the same application directly:
            * `password`: some next chapters will cover examples of this.
    * `openIdConnect`: has a way to define how to discover OAuth2 authentication data automatically.
        * This automatic discovery is what is defined in the OpenID Connect specification.
    
    
    /// tip
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sun Aug 31 10:49:48 GMT 2025
    - 4.4K bytes
    - Click Count (0)
  10. src/bufio/scan.go

    // large to fit in the [Scanner.Buffer]. When a scan stops, the reader may have
    // advanced arbitrarily far past the last token. Programs that need more
    // control over error handling or large tokens, or must run sequential scans
    // on a reader, should use [bufio.Reader] instead.
    type Scanner struct {
    	r            io.Reader // The reader provided by the client.
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Wed May 21 18:05:26 GMT 2025
    - 14.2K bytes
    - Click Count (0)
Back to Top