- Sort Score
- Num 10 results
- Language All
Results 221 - 230 of 1,355 for samp (0.02 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
docs/en/docs/tutorial/security/index.md
But Facebook login doesn't support OpenID Connect. It has its own flavor of OAuth2. ### OpenID (not "OpenID Connect") { #openid-not-openid-connect } There was also an "OpenID" specification. That tried to solve the same thing as **OpenID Connect**, but was not based on OAuth2. So, it was a complete additional system. It is not very popular or used nowadays. ## OpenAPI { #openapi }
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Sun Aug 31 10:49:48 GMT 2025 - 4.4K bytes - Click Count (0) -
src/test/java/jcifs/smb/SmbWatchHandleImplTest.java
assertTrue(reqCap.getValue() instanceof Smb2ChangeNotifyRequest); } // call() should delegate to watch() and return the same list @Test @DisplayName("call() delegates to watch() and returns same result") void call_delegatesToWatch() throws Exception { List<FileNotifyInformation> info = new ArrayList<>(); NotifyResponse resp = mock(NotifyResponse.class);
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 11.5K bytes - Click Count (0) -
docs/distributed/DESIGN.md
64 sets, which is *16* 64 = 1024* drives in total. - *If total number of nodes are of odd number then GCD algorithm provides affinity towards odd number erasure sets to provide for uniform distribution across nodes*. This is to ensure that same number of drives are pariticipating in any erasure set. For example if you have 2 nodes with 180 drives then GCD is 15 but this would lead to uneven distribution, one of the nodes would participate more drives. To avoid this the affinity is given towards...
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Wed Feb 26 09:25:50 GMT 2025 - 8K bytes - Click Count (2) -
cmd/xl-storage-format-utils_test.go
if fis[i].NumVersions != fis[i+1].NumVersions { return false } } return true } if !chkNumVersions(fivs.Versions) { t.Fatalf("Expected all versions to have the same NumVersions") } sort.Slice(versions, func(i, j int) bool { if versions[i].IsLatest { return true } if versions[j].IsLatest { return false }
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 7.1K bytes - Click Count (0) -
android/guava/src/com/google/common/math/StatsAccumulator.java
* * <p>This is guaranteed to return zero if the dataset contains only exactly one finite value. It * is not guaranteed to return zero when the dataset consists of the same value multiple times, * due to numerical errors. However, it is guaranteed never to return a negative result. * * <h3>Non-finite values</h3> *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Apr 14 16:36:11 GMT 2025 - 15.8K bytes - Click Count (0) -
guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
* * <p>This method is used when testing iterators without a known ordering. We poll the target * iterator's next element and pass it to the reference iterator through this method so it can * return the same element. This enables the assertion to pass and the reference iterator to * properly update its state. */ void promoteToNext(E e) { if (nextElements.remove(e)) { nextElements.push(e);Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 23 21:06:42 GMT 2026 - 21.4K bytes - Click Count (0) -
build-logic/build.gradle.kts
throw GradleException("gradle.properties and build-logic/gradle.properties have different org.gradle.jvmargs " + "which may cause two daemons to be spawned on CI and in IDEA. " + "Use the same org.gradle.jvmargs for both builds.") } } } fun readProperties(propertiesFile: File) = java.util.Properties().apply { propertiesFile.inputStream().use { fis -> load(fis) }
Created: Wed Apr 01 11:36:16 GMT 2026 - Last Modified: Mon Feb 09 03:14:32 GMT 2026 - 1.3K bytes - Click Count (0) -
cmd/metacache-entries.go
// In that case we will drop the directory entry. // This should however not be confused with an object with a trailing slash. dirMatches := best.isDir() == other.isDir() suffixMatches := strings.HasSuffix(best.name, slashSeparator) == strings.HasSuffix(other.name, slashSeparator) // Simple case. Both are same type with same suffix. if dirMatches && suffixMatches {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Thu Aug 08 15:29:58 GMT 2024 - 24.1K bytes - Click Count (0) -
doc/go_mem.html
} </style> <h2 id="introduction">Introduction</h2> <p> The Go memory model specifies the conditions under which reads of a variable in one goroutine can be guaranteed to observe values produced by writes to the same variable in a different goroutine. </p> <h3 id="advice">Advice</h3> <p> Programs that modify data being simultaneously accessed by multiple goroutines must serialize such access. </p> <p>
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Tue Aug 05 15:41:37 GMT 2025 - 26.6K bytes - Click Count (0) -
src/test/java/jcifs/dcerpc/msrpc/MsrpcEnumerateAliasesInDomainTest.java
assertEquals(acctFlags, request.acct_flags, "The account flags should be set correctly."); assertEquals(mockSamArray, request.sam, "The sam array should be set correctly."); // ptype and flags are protected fields in DcerpcMessage, cannot test directly }
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 1.5K bytes - Click Count (0)