- Sort Score
- Result 10 results
- Languages All
Results 1 - 8 of 8 for Accounting (0.09 sec)
-
src/test/java/jcifs/internal/smb1/com/SmbComQueryInformationResponseTest.java
assertEquals(20, bytesRead); assertEquals(fileAttributes, response.getAttributes()); assertEquals(fileSize, response.getSize()); // Verify time was read correctly (accounting for UTime conversion) long readTime = (Long) getFieldValue(response, "lastWriteTime"); // UTime is seconds since 1970, so we need to compare at second precision
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 11.9K bytes - Viewed (0) -
guava/src/com/google/common/net/InetAddresses.java
} return false; } /** * Coerces an IPv6 address into an IPv4 address. * * <p>HACK: As long as applications continue to use IPv4 addresses for indexing into tables, * accounting, et cetera, it may be necessary to <b>coerce</b> IPv6 addresses into IPv4 addresses. * This method does so by hashing 64 bits of the IPv6 address into {@code 224.0.0.0/3} (64 bits * into 29 bits): * * <ul>
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Feb 19 21:24:11 UTC 2025 - 47.4K bytes - Viewed (0) -
android/guava/src/com/google/common/net/InetAddresses.java
} return false; } /** * Coerces an IPv6 address into an IPv4 address. * * <p>HACK: As long as applications continue to use IPv4 addresses for indexing into tables, * accounting, et cetera, it may be necessary to <b>coerce</b> IPv6 addresses into IPv4 addresses. * This method does so by hashing 64 bits of the IPv6 address into {@code 224.0.0.0/3} (64 bits * into 29 bits): * * <ul>
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Feb 19 21:24:11 UTC 2025 - 47.4K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/helper/CrawlerStatsHelper.java
} return id; } } /** * Statistics data object that stores timestamped events and maintains reference counting. * Extends LinkedHashMap to store event names mapped to their timestamps. * Includes reference counting for multi-threaded access tracking. */ public static class StatsObject extends LinkedHashMap<String, Long> {
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Aug 07 03:06:29 UTC 2025 - 17.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/ExecutionSequencerTest.java
ArrayList<ListenableFuture<Integer>> lengthChecks = new ArrayList<>(); List<Integer> completeLengthChecks; int baseStackDepth; ExecutorService service = newFixedThreadPool(5); try { // Avoid counting frames from the executor itself, or the ExecutionSequencer baseStackDepth = serializer .submit( new Callable<Integer>() { @Override
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 20:58:01 UTC 2025 - 16.1K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/MultipartBody.kt
writeOrCountBytes(sink, false) } /** * Either writes this request to [sink] or measures its content length. We have one method do * double-duty to make sure the counting and content are consistent, particularly when it comes * to awkward operations like measuring the encoded length of header strings, or the * length-in-digits of an encoded integer. */ @Throws(IOException::class)
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Wed Mar 19 19:25:20 UTC 2025 - 10.9K bytes - Viewed (0) -
src/test/java/jcifs/smb/SmbTreeHandleImplTest.java
} @Test @DisplayName("close calls release and decrements usage; double release throws") void closeAndReleaseBehavior() { // Validates usage counting and that an extra release() throws RuntimeCIFSException // First close -> usage 1 -> 0, triggers treeConnection.release() handle.close(); verify(treeConnection, times(1)).release();
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 14.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/Network.java
* @throws IllegalArgumentException if {@code node} is not an element of this network */ Set<E> outEdges(N node); /** * Returns the count of {@code node}'s {@link #incidentEdges(Object) incident edges}, counting * self-loops twice (equivalently, the number of times an edge touches {@code node}). * * <p>For directed networks, this is equal to {@code inDegree(node) + outDegree(node)}. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 22:03:02 UTC 2025 - 22.5K bytes - Viewed (0)