- Sort Score
- Result 10 results
- Languages All
Results 321 - 330 of 464 for Totals (0.05 sec)
-
src/main/java/org/codelibs/fess/app/web/api/admin/fileauth/ApiAdminFileauthAction.java
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Aug 07 03:06:29 UTC 2025 - 9.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multiset.java
* elements. A multiset is also sometimes called a <i>bag</i>. * * <p>Elements of a multiset that are equal to one another are referred to as <i>occurrences</i> of * the same single element. The total number of occurrences of an element in a multiset is called * the <i>count</i> of that element (the terms "frequency" and "multiplicity" are equivalent, but
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 19.5K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb2/nego/Smb2NegotiateRequestTest.java
request = new Smb2NegotiateRequest(mockConfig, 0); byte[] buffer = new byte[1024]; // When int bytesWritten = request.writeBytesWireFormat(buffer, 0); // Then - Total bytes written should be 8-byte aligned assertEquals(0, bytesWritten % 8); } @ParameterizedTest @DisplayName("Should handle security mode combinations") @MethodSource("provideSecurityModes")
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 20.7K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb1/trans/nt/NtTransNotifyChangeTest.java
byte[] dst = new byte[100]; int dstIndex = 10; int bytesWritten = notifyChange.writeSetupWireFormat(dst, dstIndex); // Should write 8 bytes total assertEquals(8, bytesWritten); // Verify completion filter (4 bytes) assertEquals(completionFilter, SMBUtil.readInt4(dst, dstIndex)); // Verify FID (2 bytes)
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 18.4K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
* * @param arrays zero or more {@code int} arrays * @return a single array containing all the values from the source arrays, in order * @throws IllegalArgumentException if the total number of elements in {@code arrays} does not fit * in an {@code int} */ public static int[] concat(int[]... arrays) { long length = 0; for (int[] array : arrays) { length += array.length;Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 31.4K bytes - Viewed (0) -
src/test/java/jcifs/internal/fscc/FileSystemInformationTest.java
@Test @DisplayName("Should decode with actual free units skipped") void testDecodeSkipsActualFreeUnits() throws SMBProtocolDecodingException { byte[] buffer = new byte[32]; // total allocation units (8 bytes) buffer[4] = 0x01; // caller available allocation units (8 bytes) buffer[12] = 0x01; // actual free units (8 bytes) - should be skippedRegistered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 18.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/Multiset.java
* elements. A multiset is also sometimes called a <i>bag</i>. * * <p>Elements of a multiset that are equal to one another are referred to as <i>occurrences</i> of * the same single element. The total number of occurrences of an element in a multiset is called * the <i>count</i> of that element (the terms "frequency" and "multiplicity" are equivalent, but
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 20.9K bytes - Viewed (0) -
src/test/java/jcifs/util/SmbCircuitBreakerTest.java
assertTrue(successCount.get() > 0, "Some requests should succeed"); assertEquals(5, rejectedCount.get() + successCount.get(), "Total should be 5"); } finally { backpressureCircuitBreaker.close(); } } @Test public void testResponseTimeTracking() throws Exception {
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 30 05:58:03 UTC 2025 - 23.2K bytes - Viewed (0) -
cmd/global-heal.go
return nil } disks = disks[:len(disks)-healing] // healing drives are always at the end of the list if len(disks) < er.setDriveCount/2 { return fmt.Errorf("not enough drives (found=%d, healing=%d, total=%d) are available to heal `%s`", len(disks), healing, er.setDriveCount, tracker.disk.String()) } rand.Shuffle(len(disks), func(i, j int) { disks[i], disks[j] = disks[j], disks[i] })
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Apr 04 13:49:12 UTC 2025 - 16.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/FuturesGetChecked.java
List<Constructor<X>> constructors) { return WITH_STRING_PARAM_THEN_WITH_THROWABLE_PARAM.sortedCopy(constructors); } // TODO: b/296487962 - Consider defining a total order over constructors. private static final Ordering<List<Class<?>>> ORDERING_BY_CONSTRUCTOR_PARAMETER_LIST = Ordering.natural() .onResultOf((List<Class<?>> params) -> params.contains(String.class))
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 10.2K bytes - Viewed (0)