- Sort Score
- Num 10 results
- Language All
Results 471 - 480 of 589 for createJdk (0.06 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
src/main/java/jcifs/smb/SID.java
/** * Manually resolve this SID. Normally SIDs are automatically * resolved. However, if a SID is constructed explicitly using a SID * constructor, JCIFS will have no knowledge of the server that created the * SID and therefore cannot possibly resolve it automatically. In this case, * this method will be necessary. * * @param authorityServerNameCreated: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 16K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb2/notify/Smb2ChangeNotifyResponseTest.java
// Then assertTrue(bytesRead > 0); List<FileNotifyInformation> notifications = response.getNotifyInformation(); assertEquals(1, notifications.size()); // One empty notification is created } @Test @DisplayName("Should handle notification with long filename") void testLongFilename() throws Exception { // Given byte[] buffer = new byte[2048];Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sun Aug 31 08:00:57 GMT 2025 - 18.8K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/app/web/admin/user/AdminUserAction.java
verifyPassword(form, this::asEditHtml); verifyToken(this::asEditHtml); getUser(form).ifPresent(entity -> { try { userService.store(entity); logger.info("Created user: {}", entity.getName()); saveInfo(messages -> messages.addSuccessCrudCreateCrudTable(GLOBAL)); } catch (final Exception e) { logger.warn("Failed to create user: {}", form.name, e);
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Fri Jan 02 06:18:24 GMT 2026 - 21K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/entity/SearchRenderDataTest.java
public void test_setAndGetFacetResponse() { // Test with null searchRenderData.setFacetResponse(null); assertNull(searchRenderData.getFacetResponse()); // Test with FacetResponse object created from empty Aggregations List<Aggregation> aggregationList = new ArrayList<>(); Aggregations aggregations = new Aggregations(aggregationList); FacetResponse facetResponse = new FacetResponse(aggregations);
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Fri Mar 13 23:01:26 GMT 2026 - 23.6K bytes - Click Count (0) -
src/main/java/jcifs/smb1/Config.java
if (b != null) { def = b.toLowerCase().equals("true"); } return def; } /** * Retrieve an array of <code>InetAddress</code> created from a property * value containting a <code>delim</code> separated list of hostnames and/or * ipaddresses. * * @param key the property key to look up
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 14.5K bytes - Click Count (0) -
guava/src/com/google/common/collect/ImmutableSortedSet.java
* .add(42) * .build(); * } * * <p>Builder instances can be reused; it is safe to call {@link #build} multiple times to build * multiple sets in series. Each set is a superset of the set created before it. * * @since 2.0 */ public static final class Builder<E> extends ImmutableSet.Builder<E> { private final Comparator<? super E> comparator; private E[] elements; private int n;
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 23 17:50:58 GMT 2025 - 39.1K bytes - Click Count (0) -
guava/src/com/google/common/collect/Lists.java
* list of size {@code m x n x p}, its actual memory consumption is much smaller. When the * cartesian product is constructed, the input lists are merely copied. Only as the resulting list * is iterated are the individual lists created, and these are not retained after iteration. * * @param lists the lists to choose elements from, in the order that the elements chosen from * those lists should appear in the resulting listsCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 16:38:09 GMT 2026 - 42.5K bytes - Click Count (0) -
guava/src/com/google/common/collect/MinMaxPriorityQueue.java
} return crossOverUp(index, x); } /** * Fills the hole at {@code index} by moving in the least of its grandchildren to this position, * then recursively filling the new hole created. * * @return the position of the new hole (where the lowest grandchild moved from, that had no * grandchild to replace it) */ int fillHoleAt(int index) { int minGrandchildIndex;Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 13:11:08 GMT 2026 - 34K bytes - Click Count (0) -
okhttp-tls/src/main/kotlin/okhttp3/tls/HeldCertificate.kt
* in the format of [System.currentTimeMillis]. Specify -1L for both values to use the default * interval, 24 hours starting when the certificate is created. */ fun validityInterval( notBefore: Long, notAfter: Long, ) = apply { require(notBefore <= notAfter && notBefore == -1L == (notAfter == -1L)) {
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Jan 27 09:00:39 GMT 2026 - 21.6K bytes - Click Count (0) -
apache-maven/src/main/appended-resources/licenses/EPL-2.0.txt
under this Agreement are reserved. Nothing in this Agreement is intended to be enforceable by any entity that is not a Contributor or Recipient. No third-party beneficiary rights are created under this Agreement. Exhibit A - Form of Secondary Licenses Notice "This Source Code may also be made available under the following Secondary Licenses when the conditions for such availability set forth
Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Tue Jun 04 06:45:16 GMT 2024 - 13.9K bytes - Click Count (0)