- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 118 for traverse (0.07 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
guava/src/com/google/common/collect/FluentIterable.java
*/ public final FluentIterable<E> cycle() { return from(Iterables.cycle(getDelegate())); } /** * Returns a fluent iterable whose iterators traverse first the elements of this fluent iterable, * followed by those of {@code other}. The iterators are not polled until necessary. *
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Sep 22 18:35:44 GMT 2025 - 34.7K bytes - Click Count (0) -
src/main/java/jcifs/smb/NtStatus.java
int NT_STATUS_ACCOUNT_LOCKED_OUT = 0xC0000234; /** The remote system refused the network connection */ int NT_STATUS_CONNECTION_REFUSED = 0xC0000236; /** The pathname does not traverse a DFS junction */ int NT_STATUS_PATH_NOT_COVERED = 0xC0000257; /** The IO operation on the reparse point failed */ int NT_STATUS_IO_REPARSE_TAG_NOT_HANDLED = 0xC0000279;Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Sun Aug 31 08:00:57 GMT 2025 - 14.9K bytes - Click Count (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 }
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 99.7K bytes - Click Count (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.) *
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Sep 22 18:35:44 GMT 2025 - 89.9K bytes - Click Count (0) -
guava/src/com/google/common/cache/LocalCache.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.) *
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Sep 11 19:35:11 GMT 2025 - 148.9K bytes - Click Count (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
assertEqualCharNodes(traverser.breadthFirst(charactersOf("acdb")), "acdb"); assertEqualCharNodes(traverser.breadthFirst(charactersOf("db")), "db"); } @Test public void forGraph_breadthFirst_multiGraph() { Traverser<Character> traverser = Traverser.forGraph(MULTI_GRAPH); assertEqualCharNodes(traverser.breadthFirst('a'), "abcd");
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Sep 30 17:09:51 GMT 2025 - 47.4K bytes - Click Count (2) -
guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* locks---to each of the acquired locks, an edge from the soon-to-be-acquired lock is either * verified or created. * <li>If a new edge needs to be created, the outgoing edges of the acquired locks are traversed * to check for a cycle that reaches the lock to be acquired. If no cycle is detected, a new * "safe" edge is created. * <li>If a cycle is detected, an "unsafe" (cyclic) edge is created to represent a potential
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Sep 11 17:06:34 GMT 2025 - 35.9K bytes - Click Count (0) -
guava-tests/test/com/google/common/collect/TreeTraverserTest.java
import org.jspecify.annotations.NullMarked; /** * Tests for {@code TreeTraverser}. * * @deprecated Use {@link com.google.common.graph.Traverser} instead. * @author Louis Wasserman */ @GwtCompatible @NullMarked @Deprecated // Use com.google.common.graph.Traverser instead. public class TreeTraverserTest extends TestCase { private static class Node { final char value; Node(char value) {Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Sep 23 18:39:06 GMT 2025 - 3.7K bytes - Click Count (0) -
src/main/java/jcifs/util/PathValidator.java
throw new SmbException("Path contains control characters"); } // Check for traversal sequences if (containsTraversal(path)) { log.warn("Path contains directory traversal: {}", sanitizeForLog(path)); throw new SmbException("Path contains directory traversal sequences"); } // Normalize the path String normalized = normalizePath(path);
Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Sat Aug 30 05:58:03 GMT 2025 - 14.5K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* locks---to each of the acquired locks, an edge from the soon-to-be-acquired lock is either * verified or created. * <li>If a new edge needs to be created, the outgoing edges of the acquired locks are traversed * to check for a cycle that reaches the lock to be acquired. If no cycle is detected, a new * "safe" edge is created. * <li>If a cycle is detected, an "unsafe" (cyclic) edge is created to represent a potential
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Sep 11 17:06:34 GMT 2025 - 35.9K bytes - Click Count (0)