Search Options

Results per page
Sort
Preferred Languages
Advance

Results 61 - 70 of 173 for teacher (0.04 sec)

  1. guava/src/com/google/common/graph/SuccessorsFunction.java

    @Beta
    @DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges")
    public interface SuccessorsFunction<N> {
    
      /**
       * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing
       * {@code node}'s outgoing edges in the direction (if any) of the edge.
       *
       * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  2. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/tls/BasicCertificateChainCleaner.kt

            if (verifySignature(toVerify, signingCert, result.size - 1)) {
              i.remove()
              result.add(signingCert)
              continue@followIssuerChain
            }
          }
    
          // We've reached the end of the chain. If any cert in the chain is trusted, we're done.
          if (foundTrustedCertificate) {
            return result
          }
    
          // The last link isn't trusted. Fail.
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Wed Mar 19 19:25:20 UTC 2025
    - 4.8K bytes
    - Viewed (0)
  3. docs/features/calls.md

    ## Retrying Requests
    
    Sometimes connections fail: either a pooled connection was stale and disconnected, or the webserver itself couldn’t be reached. OkHttp will retry the request with a different route if one is available.
    
    ## [Calls](https://square.github.io/okhttp/4.x/okhttp/okhttp3/-call/)
    
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sun Feb 06 02:19:09 UTC 2022
    - 3.9K bytes
    - Viewed (0)
  4. android/guava-tests/benchmark/com/google/common/io/ByteSourceAsCharSourceReadBenchmark.java

                  bufIndex += nRead;
                  remaining -= nRead;
                }
                if (nRead == -1) {
                  // we reached EOF
                  return new String(buffer, 0, bufIndex);
                }
                // otherwise we got the size wrong.  This can happen if the size changes between when
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 5.2K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/graph/PredecessorsFunction.java

    @Beta
    @DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges")
    public interface PredecessorsFunction<N> {
    
      /**
       * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing
       * {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge.
       *
       * <p>Some algorithms that operate on a {@code PredecessorsFunction} may produce undesired results
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 4K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/graph/SuccessorsFunction.java

    @Beta
    @DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges")
    public interface SuccessorsFunction<N> {
    
      /**
       * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing
       * {@code node}'s outgoing edges in the direction (if any) of the edge.
       *
       * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/base/Strings.java

       *     which case the input string is always returned.
       * @param padChar the character to insert at the beginning of the result until the minimum length
       *     is reached
       * @return the padded string
       */
      public static String padStart(String string, int minLength, char padChar) {
        checkNotNull(string); // eager for GWT.
        if (string.length() >= minLength) {
          return string;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Aug 27 17:53:41 UTC 2025
    - 12.2K bytes
    - Viewed (0)
  8. src/main/resources/fess_label_fr.properties

    labels.file_auth_scheme_ftp=FTP
    labels.pagination_page_guide_msg={0}/{1} ({2} éléments)
    labels.list_could_not_find_crud_table=Non enregistré.
    labels.scheduledjob_configuration=Planificateur de tâches
    labels.scheduledjob_title_details=Tâche
    labels.scheduledjob_name=Nom
    labels.scheduledjob_target=Cible
    labels.scheduledjob_status=Statut
    labels.scheduledjob_cronExpression=Planification
    labels.scheduledjob_scriptType=Méthode d'exécution
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 10 04:56:21 UTC 2025
    - 45.6K bytes
    - Viewed (0)
  9. docs/de/docs/history-design-future.md

    ## Design
    
    Dann habe ich einige Zeit damit verbracht, die Entwickler-„API“ zu entwerfen, die ich als Benutzer haben wollte (als Entwickler, welcher FastAPI verwendet).
    
    Ich habe mehrere Ideen in den beliebtesten Python-Editoren getestet: PyCharm, VS Code, Jedi-basierte Editoren.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Jul 29 23:35:07 UTC 2024
    - 4.8K bytes
    - Viewed (0)
  10. src/test/java/jcifs/internal/smb2/multichannel/ChannelFailoverTest.java

            state.incrementRetry(); // Retry 2
            assertTrue(state.shouldRetry());
    
            state.incrementRetry(); // Retry 3
            assertFalse(state.shouldRetry()); // Max retries reached
        }
    
        @Test
        void testFailoverStateBackoff() {
            ChannelFailover.FailoverState state = new ChannelFailover.FailoverState("test-channel");
    
            long firstRetry = state.getNextRetryTime();
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 21 11:13:46 UTC 2025
    - 7.7K bytes
    - Viewed (0)
Back to top