- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 939 for oidDer (0.07 sec)
-
src/test/java/jcifs/smb/MIENameTest.java
buf[i++] = (byte) ((oidLen >>> 8) & 0xFF); buf[i++] = (byte) (oidLen & 0xFF); // MECH_OID System.arraycopy(oidDer, 0, buf, i, oidLen); i += oidLen; // NAME_LEN (4 bytes big-endian) buf[i++] = (byte) ((nameLen >>> 24) & 0xFF); buf[i++] = (byte) ((nameLen >>> 16) & 0xFF); buf[i++] = (byte) ((nameLen >>> 8) & 0xFF);
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 8.6K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/AbstractContainerTester.java
* TestContainerGenerator#order(List)}. Tests should use this method only if they declare * requirement {@link com.google.common.collect.testing.features.CollectionFeature#KNOWN_ORDER}. */ protected List<E> getOrderedElements() { List<E> list = new ArrayList<>(); for (E e : getSubjectGenerator().order(new ArrayList<E>(getSampleElements()))) { list.add(e); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 8.9K bytes - Viewed (0) -
docs/en/docs/tutorial/path-params-numeric-validations.md
A path parameter is always required as it has to be part of the path. Even if you declared it with `None` or set a default value, it would not affect anything, it would still be always required. /// ## Order the parameters as you need { #order-the-parameters-as-you-need } /// tip This is probably not as important or necessary if you use `Annotated`. /// Let's say that you want to declare the query parameter `q` as a required `str`.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 6.2K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/AbstractContainerTester.java
* TestContainerGenerator#order(List)}. Tests should use this method only if they declare * requirement {@link com.google.common.collect.testing.features.CollectionFeature#KNOWN_ORDER}. */ protected List<E> getOrderedElements() { List<E> list = new ArrayList<>(); for (E e : getSubjectGenerator().order(new ArrayList<E>(getSampleElements()))) { list.add(e); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 8.9K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/service/SearchLogService.java
*/ public SearchLogService() { // Default constructor } /** * Deletes search logs older than the specified number of days. * * @param days Number of days to keep (logs older than this will be deleted) */ public void deleteBefore(final int days) { searchLogBhv.queryDelete(cb -> {
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 32.7K bytes - Viewed (0) -
docs/ftp/README.md
it supports the server-sig-algs extension. Order is irrelevant. Valid values ``` ssh-ed25519 ******@****.*** ******@****.*** ecdsa-sha2-nistp256 ecdsa-sha2-nistp384 ecdsa-sha2-nistp521 rsa-sha2-256 rsa-sha2-512 ssh-rsa ssh-dss ``` `--sftp=kex-algos=...` specifies the supported key-exchange algorithms in preference order. Valid values: ```
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue May 07 06:41:25 UTC 2024 - 7.8K bytes - Viewed (0) -
src/test/java/org/codelibs/fess/entity/FacetInfoTest.java
BucketOrder order = facetInfo.getBucketOrder(); assertNotNull(order); assertEquals(BucketOrder.key(true), order); } // Test getBucketOrder with only key type (no order) public void test_getBucketOrder_onlyKeyType() { facetInfo.sort = "key"; BucketOrder order = facetInfo.getBucketOrder(); assertNotNull(order); assertEquals(BucketOrder.key(true), order); }
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Tue Aug 19 14:09:36 UTC 2025 - 13K bytes - Viewed (0) -
docs/distributed/DECOMMISSION.md
# Decommissioning Decommissiong is a mechanism in MinIO to drain older pools (usually with old hardware) and migrate the content from such pools to a newer pools (usually better hardware). Decommissioning spreads the data across all pools - for example, if you decommission `pool1`, all the data from `pool1` spreads across `pool2` and `pool3`. ## Features
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Mon Jul 11 14:59:49 UTC 2022 - 8.3K bytes - Viewed (0) -
src/main/webapp/css/admin/bootstrap.min.css.map
91.666667%;\n}\n\n.col-12 {\n flex: 0 0 100%;\n max-width: 100%;\n}\n\n.order-first {\n order: -1;\n}\n\n.order-last {\n order: 13;\n}\n\n.order-0 {\n order: 0;\n}\n\n.order-1 {\n order: 1;\n}\n\n.order-2 {\n order: 2;\n}\n\n.order-3 {\n order: 3;\n}\n\n.order-4 {\n order: 4;\n}\n\n.order-5 {\n order: 5;\n}\n\n.order-6 {\n order: 6;\n}\n\n.order-7 {\n order: 7;\n}\n\n.order-8 {\n order: 8;\n}\n\n.order-9 {\n order: 9;\n}\n\n.order-10 {\n order: 10;\n}\n\n.order-11 {\n order: 11;\n}\n\n.order-12 {\n...
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 639.3K bytes - Viewed (1) -
src/test/java/jcifs/internal/dfs/DfsReferralResponseBufferTest.java
void testDecodeNoReferrals() { // Prepare test data: pathConsumed=0, numReferrals=0, tflags=0 byte[] testBuffer = new byte[8]; ByteBuffer bb = ByteBuffer.wrap(testBuffer).order(ByteOrder.LITTLE_ENDIAN); bb.putShort((short) 0); // pathConsumed (will be divided by 2) bb.putShort((short) 0); // numReferrals bb.putShort((short) 0); // tflags
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 15.4K bytes - Viewed (0)