Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 51 - 60 of 211 for gratis (0.07 seconds)

  1. docs/LICENSE

         limitation to copyright. More considerations for licensors:
    	wiki.creativecommons.org/Considerations_for_licensors
    
         Considerations for the public: By using one of our public
         licenses, a licensor grants the public permission to use the
         licensed material under specified terms and conditions. If
         the licensor's permission is not necessary for any reason--for
         example, because of any applicable exception or limitation to
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Mon May 10 16:50:06 GMT 2021
    - 18.2K bytes
    - Click Count (0)
  2. guava-tests/test/com/google/common/graph/GraphsTest.java

    package com.google.common.graph;
    
    import static com.google.common.graph.Graphs.TransitiveClosureSelfLoopStrategy.ADD_SELF_LOOPS_ALWAYS;
    import static com.google.common.graph.Graphs.TransitiveClosureSelfLoopStrategy.ADD_SELF_LOOPS_FOR_CYCLES;
    import static com.google.common.graph.Graphs.copyOf;
    import static com.google.common.graph.Graphs.inducedSubgraph;
    import static com.google.common.graph.Graphs.transitiveClosure;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Jan 09 23:46:06 GMT 2026
    - 30.1K 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. 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)
  7. 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)
  8. update-credits.sh

          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 19:28:12 GMT 2026
    - Last Modified: Fri Aug 11 05:08:38 GMT 2023
    - 11.4K bytes
    - Click Count (0)
  9. 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)
  10. 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)
Back to Top