Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for ending2 (0.16 sec)

  1. android/guava/src/com/google/common/base/Preconditions.java

       * size}, inclusive.
       *
       * @param start a user-supplied index identifying a starting position in an array, list or string
       * @param end a user-supplied index identifying an ending position in an array, list or string
       * @param size the size of that array, list or string
       * @throws IndexOutOfBoundsException if either index is negative or is greater than {@code size},
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Thu Apr 11 11:52:14 GMT 2024
    - 52.9K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/util/concurrent/MoreExecutors.java

       * tasks. Second, the returned list will always be empty, as any submitted task is considered to
       * have started execution. This applies also to tasks given to {@code invokeAll} or {@code
       * invokeAny} which are pending serial execution, even the subset of the tasks that have not yet
       * started execution. It is unclear from the {@code ExecutorService} specification if these should
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Wed Apr 17 16:33:44 GMT 2024
    - 41.8K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/collect/MapMakerInternalMap.java

       * the segment.
       */
      final transient int segmentMask;
    
      /**
       * Shift value for indexing within segments. Helps prevent entries that end up in the same segment
       * from also ending up in the same bucket.
       */
      final transient int segmentShift;
    
      /** The segments, each of which is a specialized hash table. */
      final transient Segment<K, V, E, S>[] segments;
    
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Mon Apr 01 16:15:01 GMT 2024
    - 91.9K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/util/concurrent/AbstractFuture.java

       * implementation. Using a reconstruction of the default Object.toString() prevents OOMs and stack
       * overflows, and helps avoid sensitive data inadvertently ending up in exception messages.
       */
      private void appendResultObject(StringBuilder builder, @CheckForNull Object o) {
        if (o == null) {
          builder.append("null");
        } else if (o == this) {
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Mon Apr 22 21:17:24 GMT 2024
    - 63K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/util/concurrent/Futures.java

          InCompletionOrderState<T> localState = state;
          if (super.cancel(interruptIfRunning)) {
            /*
             * requireNonNull is generally safe: If cancel succeeded, then this Future was still
             * pending, so its `state` field hasn't been nulled out yet.
             *
             * OK, it's technically possible for this to fail in the presence of unsafe publishing, as
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Mon Apr 01 16:15:01 GMT 2024
    - 59.6K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/util/concurrent/ClosingFuture.java

     * successfully cancelled step will immediately start closing all objects captured for later closing
     * by it and by its input steps.
     *
     * <h3>Ending a pipeline</h3>
     *
     * Each {@code ClosingFuture} pipeline must be ended. To end a pipeline, decide whether you want to
     * close the captured objects automatically or manually.
     *
     * <h4>Automatically closing</h4>
     *
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Mon Apr 01 16:15:01 GMT 2024
    - 98.5K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/graph/Graphs.java

        NodeVisitState state = visitedNodes.get(node);
        if (state == NodeVisitState.COMPLETE) {
          return false;
        }
        if (state == NodeVisitState.PENDING) {
          return true;
        }
    
        visitedNodes.put(node, NodeVisitState.PENDING);
        for (N nextNode : graph.successors(node)) {
          if (canTraverseWithoutReusingEdge(graph, nextNode, previousNode)
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Mon Apr 01 16:15:01 GMT 2024
    - 21.2K bytes
    - Viewed (0)
Back to top