Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 51 - 60 of 213 for gratis (0.33 seconds)

  1. android/guava/src/com/google/common/graph/StandardMutableGraph.java

     */
    
    package com.google.common.graph;
    
    import com.google.common.graph.GraphConstants.Presence;
    
    /**
     * Standard implementation of {@link MutableGraph} that supports both directed and undirected
     * graphs. Instances of this class should be constructed with {@link GraphBuilder}.
     *
     * <p>Time complexities for mutation methods are all O(1) except for {@code removeNode(N node)},
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Dec 21 03:10:51 GMT 2024
    - 2.3K bytes
    - Click Count (0)
  2. docs/pt/docs/how-to/general.md

    # Geral - Como Fazer - Receitas { #general-how-to-recipes }
    
    Aqui estão vários links para outros locais na documentação, para perguntas gerais ou frequentes.
    
    ## Filtro de dados- Segurança { #filter-data-security }
    
    Para assegurar que você não vai retornar mais dados do que deveria, leia a documentação de [Tutorial - Modelo de Resposta - Tipo de Retorno](../tutorial/response-model.md).
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:20:43 GMT 2026
    - 3.2K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/graph/EndpointPairIterator.java

    abstract class EndpointPairIterator<N> extends AbstractIterator<EndpointPair<N>> {
      private final BaseGraph<N> graph;
      private final Iterator<N> nodeIterator;
    
      @Nullable N node = null; // null is safe as an initial value because graphs don't allow null nodes
    
      Iterator<N> successorIterator = ImmutableSet.<N>of().iterator();
    
      static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 4.9K bytes
    - Click Count (0)
  4. docs/pt/docs/tutorial/dependencies/sub-dependencies.md

    Consiste apenas de funções que parecem idênticas a *funções de operação de rota*.
    
    Mas ainda assim, é bastante poderoso, e permite que você declare grafos (árvores) de dependências com uma profundidade arbitrária.
    
    /// tip | Dica
    
    Tudo isso pode não parecer muito útil com esses exemplos.
    
    Mas você verá o quão útil isso é nos capítulos sobre **segurança**.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Feb 13 13:48:53 GMT 2026
    - 4.1K bytes
    - Click Count (0)
  5. docs/sts/client_grants/__init__.py

    class ClientGrantsCredentialProvider(CredentialProvider):
        """
        ClientGrantsCredentialProvider implements CredentialProvider compatible
        implementation to be used with boto_session
        """
        METHOD = 'assume-role-client-grants'
        CANONICAL_NAME = 'AssumeRoleClientGrants'
    
        def __init__(self, cid, csec,
                     idp_ep='http://localhost:8080/auth/realms/minio/protocol/openid-connect/token',
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Apr 23 18:58:53 GMT 2021
    - 4.6K bytes
    - Click Count (0)
  6. LICENSES/third_party/forked/gotestsum/LICENSE

          subsequently incorporated within the Work.
    
       2. Grant of Copyright License. Subject to the terms and conditions of
          this License, each Contributor hereby grants to You a perpetual,
          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
          copyright license to reproduce, prepare Derivative Works of,
          publicly display, publicly perform, sublicense, and distribute the
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Fri Apr 01 18:49:15 GMT 2022
    - 11.1K bytes
    - Click Count (0)
  7. LICENSE

          subsequently incorporated within the Work.
    
       2. Grant of Copyright License. Subject to the terms and conditions of
          this License, each Contributor hereby grants to You a perpetual,
          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
          copyright license to reproduce, prepare Derivative Works of,
          publicly display, publicly perform, sublicense, and distribute the
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Wed Sep 11 20:39:30 GMT 2013
    - 11.1K bytes
    - Click Count (0)
  8. src/main/java/jcifs/internal/SmbNegotiationResponse.java

         */
        int getTransactionBufferSize();
    
        /**
         * Gets the number of initial credits granted by the server for SMB2.
         *
         * @return number of initial credits the server grants
         */
        int getInitialCredits();
    
        /**
         * Checks whether a connection can be reused for the given configuration.
         *
         * @param tc the CIFS context to check compatibility with
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 3.9K bytes
    - Click Count (0)
  9. LICENSE

          subsequently incorporated within the Work.
    
       2. Grant of Copyright License. Subject to the terms and conditions of
          this License, each Contributor hereby grants to You a perpetual,
          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
          copyright license to reproduce, prepare Derivative Works of,
          publicly display, publicly perform, sublicense, and distribute the
    Created: Wed Apr 01 00:11:11 GMT 2026
    - Last Modified: Thu Feb 20 19:53:57 GMT 2020
    - 11.1K bytes
    - Click Count (0)
  10. LICENSE.txt

          subsequently incorporated within the Work.
    
       2. Grant of Copyright License. Subject to the terms and conditions of
          this License, each Contributor hereby grants to You a perpetual,
          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
          copyright license to reproduce, prepare Derivative Works of,
          publicly display, publicly perform, sublicense, and distribute the
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Mon Jul 23 14:02:28 GMT 2012
    - 11.1K bytes
    - Click Count (0)
Back to Top