Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 132 for traverse (0.05 seconds)

  1. src/main/java/jcifs/smb1/smb1/NtStatus.java

        /** The object was not found */
        int NT_STATUS_NOT_FOUND = 0xC0000225;
        /** The referenced account is currently locked out */
        int NT_STATUS_ACCOUNT_LOCKED_OUT = 0xC0000234;
        /** 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
    - 13.2K bytes
    - Click Count (0)
  2. 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)
  3. 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)
  4. cmd/admin-heal-ops.go

    		h.mutex.Lock()
    		h.endTime = UTCNow()
    		h.currentStatus.Summary = healFinishedStatus
    		h.mutex.Unlock()
    
    		// drain traverse channel so the traversal
    		// go-routine does not leak.
    		go func() {
    			// Eventually the traversal go-routine closes
    			// the channel and returns, so this go-routine
    			// itself will not leak.
    			<-h.traverseAndHealDoneCh
    		}()
    	}
    }
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 25.4K bytes
    - Click Count (0)
  5. 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)
  6. 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)
  7. 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)
  8. 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...
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Wed Nov 12 11:33:21 GMT 2025
    - 451.9K bytes
    - Click Count (0)
  9. 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)
  10. 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)
Back to Top