- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for majuscule (0.14 sec)
-
docs/fr/docs/python-types.md
À un certain point vous auriez commencé la définition de la fonction, vous aviez les paramètres prêts. Mais vous aviez besoin de "cette méthode qui convertit la première lettre en majuscule". Était-ce `upper` ? `uppercase` ? `first_uppercase` ? `capitalize` ? Vous essayez donc d'utiliser le vieil ami du programmeur, l'auto-complétion de l'éditeur.
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Fri Mar 22 01:42:11 UTC 2024 - 10.3K bytes - Viewed (0) -
docs/fr/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 n'importe quelle autre variation de casse (tout en majuscules, uniquement la première lettre en majuscule, etc.), votre fonction considérera le paramètre `short` comme ayant une valeur booléenne à `True`. Sinon la valeur sera à `False`. ## Multiples paramètres de chemin et de requête
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Wed Sep 27 20:52:31 UTC 2023 - 5.8K bytes - Viewed (0) -
docs/pt/docs/python-types.md
Mas agora imagine que você estava escrevendo do zero. Em algum momento você teria iniciado a definição da função, já tinha os parâmetros prontos ... Mas então você deve chamar "esse método que converte a primeira letra em maiúscula". Era `upper`? Era `uppercase`? `first_uppercase`? `capitalize`? Em seguida, tente com o velho amigo do programador, o preenchimento automático do editor.
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Fri Mar 22 01:42:11 UTC 2024 - 9.6K bytes - Viewed (0) -
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) -
docs/es/docs/python-types.md
``` John Doe ``` La función hace lo siguiente: * Toma un `first_name` y un `last_name`. * Convierte la primera letra de cada uno en una letra mayúscula con `title()`. * Las <abbr title="las junta como si fuesen una. Con el contenido de una después de la otra. En inglés: concatenate.">concatena</abbr> con un espacio en la mitad. ```Python hl_lines="2"
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Fri Mar 22 01:42:11 UTC 2024 - 9.2K bytes - Viewed (0) -
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) -
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) -
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) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
for (int i = 0; i < keyBits; i++) { for (int j = 0; j < keyBits; j++) { if (j <= i) continue; int count = 0; int maxCount = 20; // the probability of error here is minuscule boolean diff = false; while (!diff) { int delta = (1 << i) | (1 << j); int key1 = rand.nextInt(); // apply delta int key2 = key1 ^ delta;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 25.3K bytes - Viewed (0) -
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)