- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 111 for coefficient (0.06 sec)
-
android/guava/src/com/google/common/util/concurrent/ListenableFuture.java
* the return type. For this case, we provide a more expensive workaround in {@code * JdkFutureAdapters}. However, when possible, it is more efficient and reliable to create a {@code * ListenableFuture} directly. * * @author Sven Mawson * @author Nishant Thakkar * @since 1.0 */ /*Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 8K bytes - Viewed (0) -
guava/src/com/google/common/collect/Queues.java
*/ long deadline = System.nanoTime() + unit.toNanos(timeout); int added = 0; while (added < numElements) { // we could rely solely on #poll, but #drainTo might be more efficient when there are multiple // elements already available (e.g. LinkedBlockingQueue#drainTo locks only once) added += q.drainTo(buffer, numElements - added);Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Nov 04 17:24:58 UTC 2025 - 18K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Shorts.java
reverse(array, fromIndex, toIndex); } /** * Reverses the elements of {@code array}. This is equivalent to {@code * Collections.reverse(Shorts.asList(array))}, but is likely to be more efficient. * * @since 23.1 */ public static void reverse(short[] array) { checkNotNull(array); reverse(array, 0, array.length); } /**
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Oct 22 18:14:49 UTC 2025 - 25.7K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Chars.java
reverse(array, fromIndex, toIndex); } /** * Reverses the elements of {@code array}. This is equivalent to {@code * Collections.reverse(Chars.asList(array))}, but is likely to be more efficient. * * @since 23.1 */ public static void reverse(char[] array) { checkNotNull(array); reverse(array, 0, array.length); } /**
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 24.2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Shorts.java
reverse(array, fromIndex, toIndex); } /** * Reverses the elements of {@code array}. This is equivalent to {@code * Collections.reverse(Shorts.asList(array))}, but is likely to be more efficient. * * @since 23.1 */ public static void reverse(short[] array) { checkNotNull(array); reverse(array, 0, array.length); } /**
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Oct 22 18:14:49 UTC 2025 - 25.7K bytes - Viewed (0) -
src/main/java/jcifs/smb/SmbCopyUtil.java
import jcifs.internal.smb2.ioctl.SrvCopychunkCopy; import jcifs.internal.smb2.ioctl.SrvRequestResumeKeyResponse; /** * Utility class for SMB file copy operations. * Provides methods for efficient server-side copying using SMB2 IOCTL operations. * * @author mbechler * */ public final class SmbCopyUtil { private static final Logger log = LoggerFactory.getLogger(SmbCopyUtil.class); /**Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 16.6K bytes - Viewed (0) -
futures/listenablefuture1/src/com/google/common/util/concurrent/ListenableFuture.java
* the return type. For this case, we provide a more expensive workaround in {@code * JdkFutureAdapters}. However, when possible, it is more efficient and reliable to create a {@code * ListenableFuture} directly. * * @author Sven Mawson * @author Nishant Thakkar * @since 1.0 */ /*Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 8K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/ListenableFuture.java
* the return type. For this case, we provide a more expensive workaround in {@code * JdkFutureAdapters}. However, when possible, it is more efficient and reliable to create a {@code * ListenableFuture} directly. * * @author Sven Mawson * @author Nishant Thakkar * @since 1.0 */ /*Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 8K bytes - Viewed (0) -
src/main/java/jcifs/SidResolver.java
* name associated with SIDs will be required, the SID_FLAG_RESOLVE_SIDS * flag should be used which causes all group member SIDs to be resolved * together in a single more efficient operation. * @return a map of group SID to member SIDs * @throws CIFSException if there is an error retrieving local groups */Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 5.2K bytes - Viewed (0) -
docs/contribute/concurrency.md
Blocking APIs may be inefficient because you hold a thread idle while waiting on the network. Threads are expensive because they have both a memory overhead and a context-switching overhead. #### Framed protocols
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Sun Feb 06 16:35:36 UTC 2022 - 7K bytes - Viewed (0)