Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 5 of 5 for majuscule (0.1 sec)

  1. docs/pt/docs/tutorial/query-params.md

    ```
    
    ou
    
    ```
    http://127.0.0.1:8000/items/foo?short=on
    ```
    
    ou
    
    ```
    http://127.0.0.1:8000/items/foo?short=yes
    ```
    
    ou qualquer outra variação (tudo em maiúscula, primeira letra em maiúscula, etc), a sua função vai ver o parâmetro `short` com um valor `bool` de `True`. Caso contrário `False`.
    
    ## Múltiplos parâmetros de rota e consulta
    
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Thu Apr 18 19:53:19 UTC 2024
    - 5.6K bytes
    - Viewed (0)
  2. docs/es/docs/tutorial/query-params.md

    ```
    
    o
    
    ```
    http://127.0.0.1:8000/items/foo?short=on
    ```
    
    o
    
    ```
    http://127.0.0.1:8000/items/foo?short=yes
    ```
    
    o cualquier otra variación (mayúsculas, primera letra en mayúscula, etc.) tu función verá el parámetro `short` con un valor `bool` de `True`. Si no, lo verá como `False`.
    
    ## Múltiples parámetros de path y query
    
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Thu Apr 18 19:53:19 UTC 2024
    - 5.1K bytes
    - Viewed (0)
  3. src/internal/concurrent/hashtriemap.go

    	}
    	return true
    }
    
    const (
    	// 16 children. This seems to be the sweet spot for
    	// load performance: any smaller and we lose out on
    	// 50% or more in CPU performance. Any larger and the
    	// returns are minuscule (~1% improvement for 32 children).
    	nChildrenLog2 = 4
    	nChildren     = 1 << nChildrenLog2
    	nChildrenMask = nChildren - 1
    )
    
    // indirect is an internal node in the hash-trie.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 16:01:55 UTC 2024
    - 11.8K bytes
    - Viewed (0)
  4. src/math/rand/v2/rand.go

    	// Not only will it take a very long time, but with 2³¹! possible permutations,
    	// there's no way that any PRNG can have a big enough internal state to
    	// generate even a minuscule percentage of the possible permutations.
    	// Nevertheless, the right API signature accepts an int n, so handle it as best we can.
    	for i := n - 1; i > 0; i-- {
    		j := int(r.uint64n(uint64(i + 1)))
    		swap(i, j)
    	}
    }
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 02:25:49 UTC 2024
    - 12.8K bytes
    - Viewed (0)
  5. src/math/rand/rand.go

    	// Not only will it take a very long time, but with 2³¹! possible permutations,
    	// there's no way that any PRNG can have a big enough internal state to
    	// generate even a minuscule percentage of the possible permutations.
    	// Nevertheless, the right API signature accepts an int n, so handle it as best we can.
    	i := n - 1
    	for ; i > 1<<31-1-1; i-- {
    		j := int(r.Int63n(int64(i + 1)))
    		swap(i, j)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 22:09:08 UTC 2024
    - 16.9K bytes
    - Viewed (0)
Back to top