- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 298 for exacto (0.13 sec)
-
android/guava/src/com/google/common/math/LongMath.java
} long commonDivisor = gcd(x, denominator); x /= commonDivisor; denominator /= commonDivisor; // We know gcd(x, denominator) = 1, and x * numerator / denominator is exact, // so denominator must be a divisor of numerator. return x * (numerator / denominator); } /* * binomial(biggestBinomials[k], k) fits in a long, but not binomial(biggestBinomials[k] + 1, k).
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 09 16:39:37 UTC 2024 - 45.2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableIntArray.java
* * <p><b>Performance note:</b> When feasible, {@code initialCapacity} should be the exact number * of values that will be added, if that knowledge is readily available. It is better to guess a * value slightly too high than slightly too low. If the value is not exact, the {@link * ImmutableIntArray} that is built will very likely occupy more memory than strictly necessary;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 25 18:05:56 UTC 2024 - 22.2K bytes - Viewed (0) -
docs/pt/docs/advanced/security/http-basic-auth.md
Então o código Python em sua aplicação seria equivalente a algo como: ```Python if "johndoe" == "stanleyjobson" and "love123" == "swordfish": ... ```
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 6.2K bytes - Viewed (0) -
tensorflow/api_template_v1.__init__.py
for _name in ["purelib", "platlib"]: _site_packages_dirs += [sysconfig.get_path(_name, _scheme)] _site_packages_dirs = list(set(_site_packages_dirs)) # Find the location of this exact file. _current_file_location = _inspect.getfile(_inspect.currentframe()) def _running_from_pip_package(): return any( _current_file_location.startswith(dir_) for dir_ in _site_packages_dirs)
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Wed Oct 02 22:16:02 UTC 2024 - 7.5K bytes - Viewed (0) -
impl/maven-core/src/main/java/org/apache/maven/bridge/MavenRepositorySystem.java
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 32.6K bytes - Viewed (0) -
docs/pt/docs/tutorial/query-params-str-validations.md
``` Essa expressão regular específica verifica se o valor recebido no parâmetro: * `^`: Inicia com os seguintes caracteres, ou seja, não contém caracteres anteriores. * `fixedquery`: contém o valor exato `fixedquery`. * `$`: termina aqui, não contém nenhum caractere após `fixedquery`.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 9.3K bytes - Viewed (0) -
docs/en/docs/tutorial/index.md
It is also built to work as a future reference so you can come back and see exactly what you need. ## Run the code All the code blocks can be copied and used directly (they are actually tested Python files). To run any of the examples, copy the code to a file `main.py`, and start `fastapi dev` with:
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sat Aug 24 21:52:09 UTC 2024 - 6K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/publicsuffix/PublicSuffixDatabase.kt
// Break apart the domain into UTF-8 labels, i.e. foo.bar.com turns into [foo, bar, com]. val domainLabelsUtf8Bytes = Array(domainLabels.size) { i -> domainLabels[i].toByteArray() } // Start by looking for exact matches. We start at the leftmost label. For example, foo.bar.com // will look like: [foo, bar, com], [bar, com], [com]. The longest matching rule wins. var exactMatch: String? = null
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 11.7K bytes - Viewed (0) -
docs/fr/docs/tutorial/query-params-str-validations.md
Cette expression régulière vérifie que la valeur passée comme paramètre : * `^` : commence avec les caractères qui suivent, avec aucun caractère avant ceux-là. * `fixedquery` : a pour valeur exacte `fixedquery`. * `$` : se termine directement ensuite, n'a pas d'autres caractères après `fixedquery`.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 27 17:14:38 UTC 2024 - 9.5K bytes - Viewed (0) -
docs/pt/docs/async.md
Isso é chamado de "assíncrono" porquê o computador / programa não tem que ser "sincronizado" com a tarefa lenta, esperando pelo exato momento que a tarefa finalize, enquanto não faz nada, para ser capaz de pegar o resultado da tarefa e dar continuidade ao trabalho.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Tue Aug 06 04:48:30 UTC 2024 - 22.2K bytes - Viewed (0)