- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 138 for Reachable (0.15 sec)
-
src/cmd/link/internal/ld/deadcode.go
// // There are three ways a method of a reachable type can be invoked: // // 1. direct call // 2. through a reachable interface type // 3. reflect.Value.Method (or MethodByName), or reflect.Type.Method // (or MethodByName) // // The first case is handled by the flood fill, a directly called method // is marked as reachable. // // The second case is handled by decomposing all reachable interface
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 14:52:41 UTC 2024 - 19K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
} /** * Creates a new traverser for the given general {@code graph}. * * <p>Traversers created using this method are guaranteed to visit each node reachable from the * start node(s) at most once. * * <p>If you know that no node in {@code graph} is reachable by more than one path from the start * node(s), consider using {@link #forTree(SuccessorsFunction)} instead. * * <p><b>Performance notes</b> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 30 20:12:45 UTC 2023 - 19.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/Traverser.java
} /** * Creates a new traverser for the given general {@code graph}. * * <p>Traversers created using this method are guaranteed to visit each node reachable from the * start node(s) at most once. * * <p>If you know that no node in {@code graph} is reachable by more than one path from the start * node(s), consider using {@link #forTree(SuccessorsFunction)} instead. * * <p><b>Performance notes</b> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 30 20:12:45 UTC 2023 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
} return transitiveClosure.build(); } /** * Returns the set of nodes that are reachable from {@code node}. Node B is defined as reachable * from node A if there exists a path (a sequence of adjacent outgoing edges) starting at node A * and ending at node B. Note that a node is always reachable from itself via a zero-length path. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.2K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
} return transitiveClosure.build(); } /** * Returns the set of nodes that are reachable from {@code node}. Node B is defined as reachable * from node A if there exists a path (a sequence of adjacent outgoing edges) starting at node A * and ending at node B. Note that a node is always reachable from itself via a zero-length path. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.7K bytes - Viewed (0) -
security/pkg/k8s/chiron/utils_test.go
t.Fatalf("error to get the server 2 port: %v", err) } // Server 1 should be reachable, since it is not closed. if !isTCPReachable(host, port1) { t.Fatal("server 1 is unreachable") } // After closing server 2, server 2 should not be reachable server2.httpServer.Close() if isTCPReachable(host, port2) { t.Fatal("server 2 is reachable") } } func TestSubmitCSR(t *testing.T) {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed May 15 03:58:11 UTC 2024 - 13K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/phi.go
fwdrefs []*ssa.Value // list of FwdRefs to be processed defvars []map[ir.Node]*ssa.Value // defined variables at end of each block reachable []bool // which blocks are reachable } func (s *simplePhiState) insertPhis() { s.reachable = ssa.ReachableBlocks(s.f) // Find FwdRef ops. for _, b := range s.f.Blocks { for _, v := range b.Values { if v.Op != ssa.OpFwdRef {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 15.2K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/execution/plan/FinalizerGroup.java
import java.util.Collections; import java.util.HashSet; import java.util.LinkedHashSet; import java.util.List; import java.util.Set; import java.util.function.Consumer; /** * The set of nodes reachable from a particular finalizer node. */ public class FinalizerGroup extends HasFinalizers { private static final MemberSuccessors DO_NOT_BLOCK = new DoNotBlock(); private final TaskNode node;
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Sat Jul 01 16:25:48 UTC 2023 - 14.3K bytes - Viewed (0) -
src/runtime/mfinal.go
// the object is reachable until it is no longer required. // Objects stored in global variables, or that can be found by tracing // pointers from a global variable, are reachable. A function argument or // receiver may become unreachable at the last point where the function // mentions it. To make an unreachable object reachable, pass the object
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 01:56:56 UTC 2024 - 19K bytes - Viewed (0) -
pilot/pkg/xds/eds_sh_test.go
"159.122.219.2": 4, // 3 endpoints on network 3, weights split across 2 gateways. "159.122.219.3": 3, "179.114.119.3": 3, // no gateway defined for network 4 - treat as directly reachable. "10.4.0.1": 2, "10.4.0.2": 2, "10.4.0.3": 2, "10.4.0.4": 2, }, }, }, { // Verify that EDS from network2 will return 2 local endpoints with local VIPs + 2 remote
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri Jan 12 18:20:36 UTC 2024 - 10.8K bytes - Viewed (0)