Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 111 - 120 of 153 for fastest (0.06 seconds)

  1. android/guava/src/com/google/common/util/concurrent/AggregateFuture.java

     *
     * @param <InputT> the type of the individual inputs
     * @param <OutputT> the type of the output (i.e. this) future
     */
    @GwtCompatible
    @SuppressWarnings(
        // Whenever both tests are cheap and functional, it's faster to use &, | instead of &&, ||
        "ShortCircuitBoolean")
    abstract class AggregateFuture<InputT extends @Nullable Object, OutputT extends @Nullable Object>
        extends AggregateFutureState<OutputT> {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 16K bytes
    - Click Count (0)
  2. docs/fr/docs/index.md

    </p>
    <p align="center">
        Framework FastAPI, haute performance, facile à apprendre, rapide à coder, prêt pour la production
    </p>
    <p align="center">
    <a href="https://github.com/fastapi/fastapi/actions?query=workflow%3ATest+event%3Apush+branch%3Amaster" target="_blank">
        <img src="https://github.com/fastapi/fastapi/actions/workflows/test.yml/badge.svg?event=push&branch=master" alt="Test">
    </a>
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sat Oct 11 17:48:49 GMT 2025
    - 22K bytes
    - Click Count (0)
  3. docs/es/docs/index.md

    Dependencias opcionales adicionales de Pydantic:
    
    * <a href="https://docs.pydantic.dev/latest/usage/pydantic_settings/" target="_blank"><code>pydantic-settings</code></a> - para la gestión de configuraciones.
    * <a href="https://docs.pydantic.dev/latest/usage/types/extra_types/extra_types/" target="_blank"><code>pydantic-extra-types</code></a> - para tipos extra para ser usados con Pydantic.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Tue Dec 16 16:33:45 GMT 2025
    - 24.3K bytes
    - Click Count (0)
  4. docs/zh-hant/docs/index.md

    - <a href="https://github.com/JoshData/python-email-validator" target="_blank"><code>email-validator</code></a> - 用於電子郵件驗證。
    - <a href="https://docs.pydantic.dev/latest/usage/pydantic_settings/" target="_blank"><code>pydantic-settings</code></a> - 用於設定管理。
    - <a href="https://docs.pydantic.dev/latest/usage/types/extra_types/extra_types/" target="_blank"><code>pydantic-extra-types</code></a> - 用於與 Pydantic 一起使用的額外型別。
    
    用於 Starlette:
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sat Oct 11 17:48:49 GMT 2025
    - 18.8K bytes
    - Click Count (0)
  5. docs/pt/docs/index.md

    Dependências opcionais adicionais do Pydantic:
    
    * <a href="https://docs.pydantic.dev/latest/usage/pydantic_settings/" target="_blank"><code>pydantic-settings</code></a> - para gerenciamento de configurações.
    * <a href="https://docs.pydantic.dev/latest/usage/types/extra_types/extra_types/" target="_blank"><code>pydantic-extra-types</code></a> - tipos extras para serem utilizados com o Pydantic.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Tue Dec 16 20:32:40 GMT 2025
    - 24.5K bytes
    - Click Count (0)
  6. api/go1.16.txt

    pkg testing/fstest, func TestFS(fs.FS, ...string) error
    pkg testing/fstest, method (MapFS) Glob(string) ([]string, error)
    pkg testing/fstest, method (MapFS) Open(string) (fs.File, error)
    pkg testing/fstest, method (MapFS) ReadDir(string) ([]fs.DirEntry, error)
    pkg testing/fstest, method (MapFS) ReadFile(string) ([]uint8, error)
    pkg testing/fstest, method (MapFS) Stat(string) (fs.FileInfo, error)
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Dec 02 16:30:41 GMT 2022
    - 479.2K bytes
    - Click Count (0)
  7. compat/maven-artifact/src/main/java/org/apache/maven/artifact/versioning/ComparableVersion.java

                    return String.valueOf(QUALIFIERS.indexOf(""));
                }
    
                int i = QUALIFIERS.indexOf(qualifier);
    
                // Just returning an Integer with the index here is faster, but requires a lot of if/then/else to check for
                // -1
                //  or QUALIFIERS.size and then resort to lexical ordering. Most comparisons are decided by the first
                // character,
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Wed Jul 23 17:27:08 GMT 2025
    - 26.4K bytes
    - Click Count (0)
  8. src/cmd/asm/internal/asm/testdata/arm64enc.s

    // and they are consistent with disassembler decoding.
    // TODO means they cannot be handled by current assembler.
    
    #include "../../../../../runtime/textflag.h"
    
    TEXT asmtest(SB),DUPOK|NOSPLIT,$-8
    
    	AND $(1<<63), R1                           // AND $-9223372036854775808, R1     // 21004192
    	ADCW ZR, R8, R10                           // 0a011f1a
    	ADC R0, R2, R12                            // 4c00009a
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Mon Jul 24 01:11:41 GMT 2023
    - 43.9K bytes
    - Click Count (0)
  9. src/cmd/asm/internal/asm/testdata/ppc64.s

    // In case of index mode instructions, usage of
    // (Rx)(R0) is equivalent to (Rx+R0)
    // In case of base+displacement mode instructions if
    // the offset is 0, usage of (Rx) is equivalent to 0(Rx)
    TEXT asmtest(SB),DUPOK|NOSPLIT,$0
    	// move constants
    	MOVD $1, R3                     // 38600001
    	MOVD $-1, R4                    // 3880ffff
    	MOVD $65535, R5                 // 6005ffff
    	MOVD $65536, R6                 // 3cc00001
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Nov 21 18:27:17 GMT 2024
    - 51.7K bytes
    - Click Count (0)
  10. src/bytes/bytes.go

    		if haveFastIndex {
    			if j := bytealg.Index(s[i-last:], b[:n]); j >= 0 {
    				return i + j - last
    			}
    		} else {
    			// If bytealg.Index is not available a brute force search is
    			// ~1.5-3x faster than Rabin-Karp since n is small.
    			c0 := b[last]
    			c1 := b[last-1] // There are at least 2 chars to match
    		loop:
    			for ; i < len(s); i++ {
    				if s[i] == c0 && s[i-1] == c1 {
    					for k := 2; k < n; k++ {
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Sep 16 16:42:15 GMT 2025
    - 35.5K bytes
    - Click Count (0)
Back to Top