Search Options

Results per page
Sort
Preferred Languages
Advance

Results 91 - 100 of 218 for idea (0.36 sec)

  1. docs/es/docs/index.md

        * Sistemas de generación automática de código de cliente para muchos lenguajes.
    * Proveer directamente 2 interfaces de documentación web interactivas.
    
    ---
    
    Hasta ahora, escasamente vimos lo básico pero ya tienes una idea de cómo funciona.
    
    Intenta cambiando la línea a:
    
    ```Python
        return {"item_name": item.name, "item_id": item_id}
    ```
    
    ...de:
    
    ```Python
            ... "item_name": item.name ...
    ```
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Mon Apr 29 05:18:04 UTC 2024
    - 19K bytes
    - Viewed (0)
  2. guava/src/com/google/common/math/IntMath.java

        }
      }
    
      private static int log10Floor(int x) {
        /*
         * Based on Hacker's Delight Fig. 11-5, the two-table-lookup, branch-free implementation.
         *
         * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))), we
         * can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x)) is 6,
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Wed Feb 07 17:50:39 UTC 2024
    - 23.5K bytes
    - Viewed (0)
  3. src/debug/gosym/pclntab.go

    	// For ver116, it maps the name to the offset in filetab.
    	fileMap map[string]uint32
    }
    
    // NOTE(rsc): This is wrong for GOARCH=arm, which uses a quantum of 4,
    // but we have no idea whether we're using arm or not. This only
    // matters in the old (pre-Go 1.2) symbol table format, so it's not worth
    // fixing.
    const oldQuantum = 1
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Jan 25 19:43:24 UTC 2024
    - 18.8K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/math/IntMath.java

        }
      }
    
      private static int log10Floor(int x) {
        /*
         * Based on Hacker's Delight Fig. 11-5, the two-table-lookup, branch-free implementation.
         *
         * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))), we
         * can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x)) is 6,
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Wed Feb 07 17:50:39 UTC 2024
    - 23.5K bytes
    - Viewed (0)
  5. testing/internal-integ-testing/src/main/groovy/org/gradle/integtests/fixtures/executer/InProcessGradleExecuter.java

            String prefix = Jvm.current().getJavaHome().getPath() + File.separator;
            for (File file : files) {
                if (file.getPath().startsWith(prefix)) {
                    // IDEA adds the JDK's bootstrap classpath to the classpath it uses to run test - remove this
                    continue;
                }
                result.add(file);
            }
            return result;
        }
    
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Tue Jun 11 09:51:15 UTC 2024
    - 37.1K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/util/concurrent/AbstractScheduledService.java

              // because the service does not monitor the state of the future so if the exception is not
              // caught and forwarded to the service the task would stop executing but the service would
              // have no idea.
              // TODO(lukes): consider building everything in terms of ListenableScheduledFuture then
              // the AbstractService could monitor the future directly. Rescheduling is still hard...
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Wed Dec 13 19:45:20 UTC 2023
    - 25.8K bytes
    - Viewed (0)
  7. docs/en/docs/index.md

        * Automatic client code generation systems, for many languages.
    * Provide 2 interactive documentation web interfaces directly.
    
    ---
    
    We just scratched the surface, but you already get the idea of how it all works.
    
    Try changing the line with:
    
    ```Python
        return {"item_name": item.name, "item_id": item_id}
    ```
    
    ...from:
    
    ```Python
            ... "item_name": item.name ...
    ```
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Thu May 02 22:37:31 UTC 2024
    - 19.8K bytes
    - Viewed (0)
  8. src/cmd/compile/internal/inline/inlheur/scoring.go

    // and return value flows unmodified into an indirect call)
    //
    // For categories 2 and 3 above, each adjustment can have either a
    // "must" version and a "may" version (but not both). Here the idea is
    // that in the "must" version the value flow is unconditional: if the
    // callsite executes, then the condition we're interested in (ex:
    // param feeding call) is guaranteed to happen. For the "may" version,
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Mar 27 20:42:52 UTC 2024
    - 24.2K bytes
    - Viewed (0)
  9. src/crypto/tls/handshake_client_tls13.go

    func (hs *clientHandshakeStateTLS13) processHelloRetryRequest() error {
    	c := hs.c
    
    	// The first ClientHello gets double-hashed into the transcript upon a
    	// HelloRetryRequest. (The idea is that the server might offload transcript
    	// storage to the client in the cookie.) See RFC 8446, Section 4.4.1.
    	chHash := hs.transcript.Sum(nil)
    	hs.transcript.Reset()
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 03:10:12 UTC 2024
    - 27.9K bytes
    - Viewed (0)
  10. platforms/documentation/docs/src/docs/userguide/dep-man/01-core-dependency-management/dependency_resolution.adoc

    $GRADLE_HOME
       |-- caches
             |-- modules-2 : the container specific dependency cache, should be writable
             |-- ...
       |-- ...
    ----
    
    In a CI environment, it's a good idea to have one build which "seeds" a Gradle dependency cache, which is then _copied_ to a different directory.
    This directory can then be used as the read-only cache for other builds.
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Thu Dec 07 01:37:51 UTC 2023
    - 22.1K bytes
    - Viewed (0)
Back to top