- Sort Score
- Num 10 results
- Language All
Results 531 - 540 of 756 for eleven (0.07 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
android/guava/src/com/google/common/collect/TopKSelector.java
> 0) { threshold = buffer[i]; } } } /** * Partitions the contents of buffer in the range [left, right] around the pivot element * previously stored in buffer[pivotValue]. Returns the new index of the pivot element, * pivotNewIndex, so that everything in [left, pivotNewIndex] is ≤ pivotValue and everything in * (pivotNewIndex, right] is greater than pivotValue. */Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Aug 31 13:15:26 GMT 2025 - 11.3K bytes - Click Count (0) -
docs/de/docs/advanced/using-request-directly.md
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 17:58:09 GMT 2026 - 2.6K bytes - Click Count (0) -
docs/uk/docs/advanced/sub-applications.md
«Монтування» означає додавання повністю «незалежного» застосунку на конкретний шлях, який далі обробляє все під цим шляхом за допомогою _операцій шляху_, оголошених у цьому підзастосунку. ### Застосунок верхнього рівня { #top-level-application } Спочатку створіть головний, верхньорівневий застосунок **FastAPI** та його _операції шляху_: {* ../../docs_src/sub_applications/tutorial001_py310.py hl[3, 6:8] *} ### Підзастосунок { #sub-application }Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 18:27:41 GMT 2026 - 4.5K bytes - Click Count (0) -
android/guava/src/com/google/common/primitives/ImmutableDoubleArray.java
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Dec 12 14:49:24 GMT 2025 - 22.7K bytes - Click Count (0) -
android/guava/src/com/google/common/primitives/ImmutableIntArray.java
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Dec 12 14:49:24 GMT 2025 - 21.9K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/crawler/serializer/DataSerializer.java
/** * Safely registers a class with Kryo, logging any registration failures at WARN level. * <p> * This method catches exceptions for individual class registrations to ensure * that a failure to register one class doesn't prevent other classes from being registered. * Registration failures are logged at WARN level since they may cause serialization errors later. * </p> *Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Jan 10 01:54:09 GMT 2026 - 10.5K bytes - Click Count (3) -
src/main/java/jcifs/smb1/smb1/SmbFileInputStream.java
} // ensure file is open file.open(openFlags, access, SmbFile.ATTR_NORMAL, 0); /* * Read AndX Request / Response */ if (LogStream.level >= 4) { SmbFile.log.println("read: fid=" + file.fid + ",off=" + off + ",len=" + len); } final SmbComReadAndXResponse response = new SmbComReadAndXResponse(b, off);Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 9.4K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb1/trans2/Trans2FindNext2Test.java
void testInformationLevelConstant() { // Verify the information level is set correctly trans2FindNext2 = new Trans2FindNext2(config, TEST_SID, TEST_RESUME_KEY, TEST_FILENAME, TEST_BATCH_COUNT, TEST_BATCH_SIZE); byte[] buffer = new byte[256]; trans2FindNext2.writeParametersWireFormat(buffer, 0); // Information level should be SMB_FILE_BOTH_DIRECTORY_INFO (0x104)
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 12.2K bytes - Click Count (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/SetGenerators.java
private static <E extends Comparable<? super E>> SortedSet<E> nullCheckedTreeSet(E[] elements) { SortedSet<E> set = newTreeSet(); for (E element : elements) { // Explicit null check because TreeSet wrongly accepts add(null) when empty. set.add(checkNotNull(element)); } return set; } public static class ContiguousSetGenerator extends AbstractContiguousSetGenerator { @Override
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Sep 08 18:35:13 GMT 2025 - 15.9K bytes - Click Count (0) -
guava-tests/test/com/google/common/primitives/UnsignedBytesTest.java
* correct order—in order words, that it doesn't mix up big-endian and little-endian. The first * array has a smaller element at one index, and then the second array has a smaller element at * the next. */ byte[] a0 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 99, 15, 16, 17}; byte[] b0 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 99, 14, 15, 16, 17};
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Mar 08 01:43:32 GMT 2026 - 14K bytes - Click Count (0)