- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for inserting (1.77 sec)
-
cmd/test-utils_test.go
} // return URL for inserting bucket notification. func getPutNotificationURL(endPoint, bucketName string) string { queryValue := url.Values{} queryValue.Set("notification", "") return makeTestTargetURL(endPoint, bucketName, "", queryValue) } // return URL for inserting bucket policy. func getPutPolicyURL(endPoint, bucketName string) string {
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 77K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/ldap/LdapManager.java
protected void insert(final String entryDN, final Attributes entry, final Supplier<Hashtable<String, String>> envSupplier) { try (DirContextHolder holder = getDirContext(envSupplier)) { logger.debug("Inserting LDAP entry: dn={}", entryDN); holder.get().createSubcontext(entryDN, entry); } catch (final NamingException e) { throw new LdapOperationException("Failed to add " + entryDN, e); }
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Fri Nov 28 16:29:12 UTC 2025 - 86.3K bytes - Viewed (0) -
cmd/object-api-multipart_test.go
} } // Passes as expected, but asserting the results. if actualErr == nil && testCase.shouldPass { expectedResult := testCase.expectedResult // Asserting the MaxUploads. if actualResult.MaxUploads != expectedResult.MaxUploads {
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 89.4K bytes - Viewed (0) -
cmd/object-api-listobjects_test.go
}, }, // ListObjectsResult-5. // Used for Asserting prefixes. // Used for test case with prefix "new", (testCase 27-29). 5: { IsTruncated: false, Objects: []ObjectInfo{ {Name: "newPrefix0"}, {Name: "newPrefix1"}, {Name: "newzen/zen/recurse/again/again/again/pics"}, }, }, // ListObjectsResult-6. // Used for Asserting prefixes.
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Oct 10 18:57:03 UTC 2025 - 76.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/Iterators.java
// to be sorted based on the top of each iterator, with insertion order as tiebreaker Comparator<IndexedIterator<T>> heapComparator = (o1, o2) -> ComparisonChain.start() .compare(o1.iterator.peek(), o2.iterator.peek(), itemComparator) // When elements are equal, use insertion order to maintain stability .compare(o1.index, o2.index)Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Sep 16 12:42:11 UTC 2025 - 51.4K bytes - Viewed (0)