Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 18 for accident (0.09 seconds)

  1. android/guava-tests/test/com/google/common/util/concurrent/FuturesGetCheckedTest.java

       * doing so would be to derive a separate test library by using remove_from_jar to strip out
       * ClassValueValidator.
       *
       * Fortunately, we get pretty good coverage "by accident": We run all these tests against the
       * *backport*, where ClassValueValidator is not present.
       */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 12 17:47:10 GMT 2026
    - 16.5K bytes
    - Click Count (0)
  2. guava-tests/test/com/google/common/util/concurrent/FuturesGetCheckedTest.java

       * doing so would be to derive a separate test library by using remove_from_jar to strip out
       * ClassValueValidator.
       *
       * Fortunately, we get pretty good coverage "by accident": We run all these tests against the
       * *backport*, where ClassValueValidator is not present.
       */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 12 17:47:10 GMT 2026
    - 16.5K bytes
    - Click Count (0)
  3. configure.py

        )
        # Check whether all capabilities from the input is valid
        all_valid = True
        # Remove all whitespace characters before splitting the string
        # that users may insert by accident, as this will result in error
        hermetic_cuda_compute_capabilities = ''.join(
            hermetic_cuda_compute_capabilities.split()
        )
        for compute_capability in hermetic_cuda_compute_capabilities.split(','):
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Fri Dec 19 16:32:04 GMT 2025
    - 48.3K bytes
    - Click Count (0)
  4. compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java

        /**
         * the entry point we started building the graph from
         */
        MetadataGraphVertex entry;
    
        // graph vertices
        TreeSet<MetadataGraphVertex> vertices;
    
        /**
         * incident and excident edges per node
         */
        Map<MetadataGraphVertex, List<MetadataGraphEdge>> incidentEdges;
    
        Map<MetadataGraphVertex, List<MetadataGraphEdge>> excidentEdges;
    
        /**
         *  null in dirty graph, actual
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Wed Jul 23 17:27:08 GMT 2025
    - 13K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/graph/AbstractBaseGraph.java

                  }
                };
            return nodeInvalidatableSet(incident, node);
          }
    
          @Override
          public Set<EndpointPair<N>> outEdges(N node) {
            checkNotNull(node);
            checkArgument(nodes().contains(node));
            IncidentEdgeSet<N> incident =
                new IncidentEdgeSet<N>(this, node, IncidentEdgeSet.EdgeType.OUTGOING) {
                  @Override
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Oct 07 15:57:03 GMT 2025
    - 11.5K bytes
    - Click Count (0)
  6. guava-tests/test/com/google/common/graph/GraphsTest.java

        directedGraph.putEdge(N1, N2);
        directedGraph.putEdge(N2, N1);
        directedGraph.putEdge(N1, N3); // only incident to one node in nodeSubset
        directedGraph.putEdge(N4, N4);
        directedGraph.putEdge(5, 6); // not incident to any node in nodeSubset
    
        MutableGraph<Integer> expectedSubgraph = GraphBuilder.directed().allowsSelfLoops(true).build();
        expectedSubgraph.putEdge(N1, N2);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Jan 09 23:46:06 GMT 2026
    - 30.1K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/graph/Network.java

       * self-loops twice (equivalently, the number of times an edge touches {@code node}).
       *
       * <p>For directed networks, this is equal to {@code inDegree(node) + outDegree(node)}.
       *
       * <p>For undirected networks, this is equal to {@code incidentEdges(node).size()} + (number of
       * self-loops incident to {@code node}).
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 17.6K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/graph/Graphs.java

       *
       * <p>The strategies differ based on how they define "cycle incident to a node".
       *
       * @since NEXT
       */
      public enum TransitiveClosureSelfLoopStrategy {
        /**
         * Add a self-loop to each node in the original graph; this is based on a definition of "cycle
         * incident to a node" that includes zero-length cycles. This matches the behavior of the
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 24.4K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/graph/Graph.java

      /**
       * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently,
       * the number of times an edge touches {@code node}).
       *
       * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}.
       *
       * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
       * self-loops incident to {@code node}).
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 13.6K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/graph/ValueGraph.java

      /**
       * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently,
       * the number of times an edge touches {@code node}).
       *
       * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}.
       *
       * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
       * self-loops incident to {@code node}).
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 15K bytes
    - Click Count (0)
Back to Top