- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 795 for Traverse (0.27 sec)
-
src/main/java/org/codelibs/core/io/Traverser.java
* governing permissions and limitations under the License. */ package org.codelibs.core.io; /** * クラスやリソースの集まりを表すオブジェクトです。 * * @author koichik * @see TraversalUtil */ public interface Traverser { /** * 指定されたクラス名に対応するクラスファイルがこのインスタンスが扱うリソースの中に存在すれば<code>true</code>を返します。 * <p> * インスタンス構築時にルートパッケージが指定されている場合、 指定されたクラス名はルートパッケージからの相対名として解釈されます。 * </p> * * @param className
Registered: Wed Jun 12 12:50:12 UTC 2024 - Last Modified: Thu Mar 07 01:59:08 UTC 2024 - 2.6K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis.cc
// // // MAPPING NODES TO PREDICATES, MODULO CYCLES // ------------------------------------------ // // If we ignore cycles for a moment, computing predicates is fairly // straightforward. We traverse the graph in a topological order, mapping each // node to a predicate based on the predicates its inputs are mapped to. For // instance a Merge(X, Y) node will be mapped to OR(PredicateFor(X),
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0) -
src/path/filepath/path_test.go
// successfully unless the last pathname component before the trailing <slash> // characters names an existing directory [...].” // // Since Walk does not traverse symlinks itself, its behavior should depend on // whether the path passed to Walk ends in a slash: if it does not end in a slash, // Walk should report the symlink itself (since it is the last pathname component);
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 22 16:38:19 UTC 2024 - 47.1K bytes - Viewed (0) -
pkg/scheduler/internal/cache/cache_test.go
st.MakeContainer().Name("container").Image("pause").Resources(req).ContainerPort(ports).Obj(), }) return podWrapper.Obj() } // checkImageStateSummary collect ImageStateSummary of image traverse nodes, // the collected ImageStateSummary should be equal func checkImageStateSummary(nodes map[string]*framework.NodeInfo, imageNames ...string) bool { for _, imageName := range imageNames {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 17 01:38:03 UTC 2023 - 63.8K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.31.md
- Users can traverse all the pods that are in the scheduler and waiting in the permit stage through method `IterateOverWaitingPods`. In other words, all waitingPods in scheduler can be obtained from any profiles. Before this commit, each profile could only obtain waitingPods...
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 20:34:14 UTC 2024 - 60.3K bytes - Viewed (0) -
pkg/workloadapi/workload.pb.go
Waypoint *GatewayAddress `protobuf:"bytes,8,opt,name=waypoint,proto3" json:"waypoint,omitempty"` // If present, East West network gateway this workload can be reached through. // Requests from remote networks should traverse this gateway. NetworkGateway *GatewayAddress `protobuf:"bytes,19,opt,name=network_gateway,json=networkGateway,proto3" json:"network_gateway,omitempty"` // Name of the node the workload runs on
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Jun 12 18:02:35 UTC 2024 - 65.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/MapMakerInternalMap.java
* be read without locking. Next fields of nodes are immutable (final). All list additions are * performed at the front of each bin. This makes it easy to check changes, and also fast to * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This * works well for hash tables since the bin lists tend to be short. (The average length is less * than two.) *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 90.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
* be read without locking. Next fields of nodes are immutable (final). All list additions are * performed at the front of each bin. This makes it easy to check changes, and also fast to * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This * works well for hash tables since the bin lists tend to be short. (The average length is less * than two.) *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 90.8K bytes - Viewed (0) -
cmd/admin-handlers.go
file := r.Form.Get("file") if len(file) == 0 { writeErrorResponseJSON(ctx, w, errorCodes.ToAPIErr(ErrInvalidRequest), r.URL) return } file = filepath.ToSlash(file) // Reject attempts to traverse parent or absolute paths. if hasBadPathComponent(volume) || hasBadPathComponent(file) { writeErrorResponse(r.Context(), w, errorCodes.ToAPIErr(ErrInvalidResourceName), r.URL) return }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 98K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/authoring-builds/gradle-properties/working_with_files.adoc
* filter them (using link:{javadocPath}/org/gradle/api/file/FileTree.html#matching-org.gradle.api.Action-[FileTree.matching(org.gradle.api.Action)] and Ant-style patterns) * merge them You can also traverse file trees using the link:{javadocPath}/org/gradle/api/file/FileTree.html#visit-org.gradle.api.Action-[FileTree.visit(org.gradle.api.Action)] method. All of these techniques are demonstrated in the following example: ====
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Apr 24 04:19:09 UTC 2024 - 70.5K bytes - Viewed (0)