Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 958 for seen (0.07 sec)

  1. cmd/metacache.go

    		m.status = update.status
    	}
    
    	if m.status == scanStateStarted && time.Since(m.lastHandout) > metacacheMaxClientWait {
    		// Drop if client hasn't been seen for 3 minutes.
    		m.status = scanStateError
    		m.error = "client not seen"
    	}
    
    	if m.error == "" && update.error != "" {
    		m.error = update.error
    		m.status = scanStateError
    		m.ended = now
    	}
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Jul 12 16:23:16 UTC 2024
    - 6K bytes
    - Viewed (0)
  2. docs/metrics/prometheus/list.md

    | `minio_node_replication_max_queued_count`               | Maximum number of objects queued for replication seen since server start                                 |
    | `minio_node_replication_recent_backlog_count`           | Total number of objects seen in replication backlog in the last 5 minutes                                |
    
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 43.4K bytes
    - Viewed (0)
  3. guava/src/com/google/common/escape/CharEscaperBuilder.java

          addEscape(c, r);
        }
        return this;
      }
    
      /**
       * Convert this builder into an array of char[]s where the maximum index is the value of the
       * highest character that has been seen. The array will be sparse in the sense that any unseen
       * index will default to null.
       *
       * @return a "sparse" array that holds the replacement mappings.
       */
      public char[] @Nullable [] toArray() {
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 3.9K bytes
    - Viewed (0)
  4. src/test/java/jcifs/smb/WinErrorTest.java

        void codes_are_non_negative_and_unique() {
            // Edge checks: ensure there are no negative or duplicate codes
            Set<Integer> seen = new HashSet<>();
            for (int c : WinError.WINERR_CODES) {
                assertTrue(c >= 0, "Code should be non-negative: " + c);
                assertTrue(seen.add(c), "Duplicate code detected: " + c);
            }
        }
    
        // Simple collaborator to demonstrate interaction verification with Mockito
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 8.4K bytes
    - Viewed (0)
  5. docs/en/docs/tutorial/path-params-numeric-validations.md

    * `ge`: `g`reater than or `e`qual
    * `lt`: `l`ess `t`han
    * `le`: `l`ess than or `e`qual
    
    /// info
    
    `Query`, `Path`, and other classes you will see later are subclasses of a common `Param` class.
    
    All of them share the same parameters for additional validation and metadata you have seen.
    
    ///
    
    /// note | Technical Details
    
    When you import `Query`, `Path` and others from `fastapi`, they are actually functions.
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Dec 17 20:41:43 UTC 2025
    - 6.1K bytes
    - Viewed (0)
  6. guava-testlib/src/com/google/common/collect/testing/google/MultisetTestSuiteBuilder.java

          for (Entry<E> entry : insertionOrder) {
            map.put(entry.getElement(), entry);
          }
    
          Set<E> seen = new HashSet<>();
          List<Entry<E>> order = new ArrayList<>();
          for (E e : gen.order(new ArrayList<E>(map.keySet()))) {
            if (seen.add(e)) {
              order.add(map.get(e));
            }
          }
          return order;
        }
      }
    
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 10.5K bytes
    - Viewed (0)
  7. cmd/bootstrap-peer-server.go

    		return fmt.Errorf("Expected MinIO binary checksum: %s, seen: %s", s1.Checksum, s2.Checksum)
    	}
    
    	ns1 := s1.NEndpoints
    	ns2 := s2.NEndpoints
    	if ns1 != ns2 {
    		return fmt.Errorf("Expected number of endpoints %d, seen %d", ns1, ns2)
    	}
    
    	for i, cmdLine := range s1.CmdLines {
    		if cmdLine != s2.CmdLines[i] {
    			return fmt.Errorf("Expected command line argument %s, seen %s", cmdLine,
    				s2.CmdLines[i])
    		}
    	}
    
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Tue Oct 01 22:13:18 UTC 2024
    - 8.4K bytes
    - Viewed (0)
  8. docs/en/docs/advanced/async-tests.md

    # Async Tests { #async-tests }
    
    You have already seen how to test your **FastAPI** applications using the provided `TestClient`. Up to now, you have only seen how to write synchronous tests, without using `async` functions.
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Dec 17 20:41:43 UTC 2025
    - 4K bytes
    - Viewed (0)
  9. docs/en/docs/tutorial/extra-data-types.md

    # Extra Data Types { #extra-data-types }
    
    Up to now, you have been using common data types, like:
    
    * `int`
    * `float`
    * `str`
    * `bool`
    
    But you can also use more complex data types.
    
    And you will still have the same features as seen up to now:
    
    * Great editor support.
    * Data conversion from incoming requests.
    * Data conversion for response data.
    * Data validation.
    * Automatic annotation and documentation.
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 2.7K bytes
    - Viewed (0)
  10. guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java

            return;
          }
          // Otherwise, it's the first time seeing this lock relationship. Look for
          // a path from the acquiredLock to this.
          Set<LockGraphNode> seen = Sets.newIdentityHashSet();
          ExampleStackTrace path = acquiredLock.findPathTo(this, seen);
    
          if (path == null) {
            // this can be safely acquired after the acquiredLock.
            //
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Sep 11 17:06:34 UTC 2025
    - 35.9K bytes
    - Viewed (0)
Back to top