- Sort Score
- Result 10 results
- Languages All
Results 821 - 830 of 1,377 for Tout (0.02 sec)
-
docs/uk/docs/index.md
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 20 19:20:23 UTC 2024 - 24.2K bytes - Viewed (0) -
CONTRIBUTING.md
### Follow the Code of Conduct Contributors must follow the Code of Conduct outlined at [https://gradle.org/conduct/](https://gradle.org/conduct/). ### Additional help If you run into any trouble, please reach out to us on the issue you are working on. There is a `#contributing` channel on the community Slack which you can use to ask any questions. ## Setting up your development environment
Registered: Wed Nov 06 11:36:14 UTC 2024 - Last Modified: Tue Nov 05 15:15:33 UTC 2024 - 15.6K bytes - Viewed (0) -
cmd/erasure-metadata-utils.go
func (c counterMap[T]) GetValueWithQuorum(quorum int) (T, bool) { var zero T for x, count := range c { if count >= quorum { return x, true } } return zero, false } // figure out the most commonVersions across disk that satisfies // the 'writeQuorum' this function returns "" if quorum cannot // be achieved and disks have too many inconsistent versions.
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 11.7K bytes - Viewed (0) -
compat/maven-compat/src/main/java/org/apache/maven/artifact/repository/metadata/DefaultRepositoryMetadataManager.java
} } if (changed) { getLogger().debug("Repairing metadata in " + metadataFile); try (OutputStream out = Files.newOutputStream(metadataFile.toPath())) { new MetadataStaxWriter().write(out, metadata.getDelegate()); } catch (IOException | XMLStreamException e) {
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 18.9K bytes - Viewed (0) -
docs/site-replication/run-multi-site-ldap.sh
sleep 30 ./mc ls -r --versions minio1/newbucket >/tmp/minio1.txt ./mc ls -r --versions minio2/newbucket >/tmp/minio2.txt out=$(diff -qpruN /tmp/minio1.txt /tmp/minio2.txt) ret=$? if [ $ret -ne 0 ]; then echo "BUG: expected no missing entries after replication resync: $out" exit 1 fi
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Sep 24 08:03:58 UTC 2024 - 10.1K bytes - Viewed (0) -
compat/maven-compat/src/test/java/org/apache/maven/project/AbstractMavenProjectTestCase.java
for (ModelProblem problem : ((ModelBuildingException) cause).getProblems()) { message += problem + "\n"; } System.out.println(message); fail(message); } throw e; } } protected MavenProject getProject(File pom) throws Exception {
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 6.9K bytes - Viewed (0) -
compat/maven-compat/src/main/java/org/apache/maven/project/path/DefaultPathTranslator.java
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 7.2K bytes - Viewed (0) -
docs/en/docs/advanced/dataclasses.md
8. Notice that this *path operation function* uses regular `def` instead of `async def`. As always, in FastAPI you can combine `def` and `async def` as needed. If you need a refresher about when to use which, check out the section _"In a hurry?"_ in the docs about [`async` and `await`](../async.md#in-a-hurry){.internal-link target=_blank}.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Mon Oct 28 10:35:06 UTC 2024 - 4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/base/AsciiTest.java
assertFalse(Ascii.equalsIgnoreCase("x", "")); assertTrue(Ascii.equalsIgnoreCase(LOWER, UPPER)); assertTrue(Ascii.equalsIgnoreCase(UPPER, LOWER)); // Create new strings here to avoid early-out logic. assertTrue(Ascii.equalsIgnoreCase(new String(IGNORED), new String(IGNORED))); // Compare to: "\u00c1".equalsIgnoreCase("\u00e1") == true assertFalse(Ascii.equalsIgnoreCase("\u00c1", "\u00e1"));
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Sep 17 18:14:12 UTC 2024 - 5.4K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleUtils.java
return x.signum() * POSITIVE_INFINITY; } /* * We need the top SIGNIFICAND_BITS + 1 bits, including the "implicit" one bit. To make rounding * easier, we pick out the top SIGNIFICAND_BITS + 2 bits, so we have one to help us round up or * down. twiceSignifFloor will contain the top SIGNIFICAND_BITS + 2 bits, and signifFloor the * top SIGNIFICAND_BITS + 1. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 5.1K bytes - Viewed (0)