- Sort Score
- Num 10 results
- Language All
Results 1241 - 1250 of 1,763 for single (0.09 seconds)
-
android/guava/src/com/google/common/graph/EndpointPair.java
return false; } EndpointPair<?> other = (EndpointPair<?>) obj; if (isOrdered() != other.isOrdered()) { return false; } // Equivalent to the following simple implementation: // boolean condition1 = nodeU().equals(other.nodeU()) && nodeV().equals(other.nodeV()); // boolean condition2 = nodeU().equals(other.nodeV()) && nodeV().equals(other.nodeU());Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 8K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb1/trans2/Trans2FindFirst2Test.java
assertEquals(0, SMBUtil.readInt2(buffer, 2)); // max items } // Helper method to read string from buffer private String readStringFromBuffer(byte[] buffer, int offset, int length) { // Simple ASCII string reading for test purposes StringBuilder sb = new StringBuilder(); for (int i = offset; i < offset + length && buffer[i] != 0; i++) { if (buffer[i] != 0) {
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 10.8K bytes - Click Count (0) -
src/test/java/jcifs/pac/PacDataInputStreamTest.java
assertNotNull(sidString); assertEquals("S-1-5-305419896", sidString); } @Test public void testReadSid() throws IOException, PACDecodingException { // A simple SID: S-1-1-0 byte[] data = new byte[] { 0x01, 0x00, 0x00, 0x00, // sidSize = 1 0x01, // revision 0x01, // sub-authority count
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 07:14:38 GMT 2025 - 9.2K bytes - Click Count (0) -
impl/maven-cli/src/test/java/org/apache/maven/cling/invoker/mvnup/goals/TestUtils.java
*/ public static UpgradeOptions createOptionsWithInfer(boolean infer) { return createOptions(null, infer, null, null, null); } /** * Creates a simple POM XML string for testing. * * @param groupId the group ID * @param artifactId the artifact ID * @param version the version * @return POM XML string */Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Tue Nov 18 18:03:26 GMT 2025 - 8.9K bytes - Click Count (0) -
docs/ko/docs/tutorial/first-steps.md
 ### 대안 API 문서 { #alternative-api-docs } 그리고 이제, [http://127.0.0.1:8000/redoc](http://127.0.0.1:8000/redoc)로 가봅니다. 대안 자동 문서를 볼 수 있습니다 ([ReDoc](https://github.com/Rebilly/ReDoc) 제공):  ### OpenAPI { #openapi }Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Mar 20 14:06:26 GMT 2026 - 15K bytes - Click Count (0) -
docs/es/docs/tutorial/response-model.md
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 18:15:55 GMT 2026 - 17.1K bytes - Click Count (0) -
src/test/java/jcifs/internal/dtyp/SecurityDescriptorTest.java
currentOffset += 20; // Simple SID size } else { SMBUtil.writeInt4(0, buffer, offset + 4); } // Group SID offset if (includeGroup) { SMBUtil.writeInt4(currentOffset, buffer, offset + 8); prepareSimpleSid(buffer, offset + currentOffset); currentOffset += 20; // Simple SID size } else {Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 18.6K bytes - Click Count (0) -
docs/fr/docs/index.md
### Documentation API alternative { #alternative-api-docs } Et maintenant, rendez-vous sur [http://127.0.0.1:8000/redoc](http://127.0.0.1:8000/redoc). Vous verrez la documentation alternative automatique (fournie par [ReDoc](https://github.com/Rebilly/ReDoc)) : Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 18:37:13 GMT 2026 - 23.8K bytes - Click Count (0) -
docs/pt/docs/translation-banner.md
Você pode melhorar esta tradução [ajudando-nos a orientar melhor o LLM de IA](https://fastapi.tiangolo.com/pt/contributing/#translations). [Versão em inglês](ENGLISH_VERSION_URL)
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Feb 13 13:48:53 GMT 2026 - 399 bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/AggregateFutureState.java
this.remainingField = remainingFutures; } final Set<Throwable> getOrInitSeenExceptions() { /* * The initialization of seenExceptionsField has to be more complicated than we'd like. The * simple approach would be for each caller CAS it from null to a Set populated with its * exception. But there's another race: If the first thread fails with an exception and a second * thread immediately fails with the same exception:
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 8.5K bytes - Click Count (0)