- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 27 for Swap (0.24 sec)
-
api/go1.19.txt
pkg sync/atomic, method (*Bool) Store(bool) #50860 pkg sync/atomic, method (*Bool) Swap(bool) bool #50860 pkg sync/atomic, method (*Int32) Add(int32) int32 #50860 pkg sync/atomic, method (*Int32) CompareAndSwap(int32, int32) bool #50860 pkg sync/atomic, method (*Int32) Load() int32 #50860 pkg sync/atomic, method (*Int32) Store(int32) #50860 pkg sync/atomic, method (*Int32) Swap(int32) int32 #50860 pkg sync/atomic, method (*Int64) Add(int64) int64 #50860
Plain Text - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Dec 02 16:29:41 GMT 2022 - 17.9K bytes - Viewed (1) -
android/guava/src/com/google/common/math/Quantiles.java
for (int i = to; i > from; i--) { if (array[i] > pivot) { swap(array, partitionPoint, i); partitionPoint--; } } // We now know that all elements with indexes in (from, partitionPoint] are less than or equal // to the pivot at from, and all elements with indexes in (partitionPoint, to] are greater than // it. We swap the pivot into partitionPoint and we know the array is partitioned around that.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/ExecutionListBenchmark.java
RunnableExecutorPair(Runnable runnable, Executor executor) { this.runnable = runnable; this.executor = executor; } } } // A version of the list that uses compare and swap to manage the stack without locks. private static final class ExecutionListCAS { static final Logger log = Logger.getLogger(ExecutionListCAS.class.getName()); private static final sun.misc.Unsafe UNSAFE;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Apr 17 15:19:38 GMT 2023 - 20.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
if (comparator.compare(uncheckedCastNullableTToT(buffer[i]), pivotValue) < 0) { swap(pivotNewIndex, i); pivotNewIndex++; } } buffer[right] = buffer[pivotNewIndex]; buffer[pivotNewIndex] = pivotValue; return pivotNewIndex; } private void swap(int i, int j) { T tmp = buffer[i]; buffer[i] = buffer[j]; buffer[j] = tmp; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
// [abc]de|[fgh] -> [fgh]de|[abc]. Now [fgh] is in the right place, but we need to swap [de] // with [abc]: fgh[de]|a[bc] -> fgh[bc]|a[de]. Now we need to swap [a] with [bc]: // fgh[b]c|[a]de -> fgh[a]c|[b]de. Finally we need to swap [c] with [b]: // fgha[c]|[b]de -> fgha[b]|[c]de. Because these two blocks are the same size, we are done.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0) -
cmd/xl-storage-disk-id-check.go
// alloc on every call, so we have a clean entry to swap in. t := time.Now().Unix() e.init.Do(func() { e.cached.Store(&AccElem{}) atomic.StoreInt64(&e.cachedSec, t) }) acc := e.cached.Load() if lastT := atomic.LoadInt64(&e.cachedSec); lastT != t { // Check if lastT was changed by someone else. if atomic.CompareAndSwapInt64(&e.cachedSec, lastT, t) { // Now we swap in a new. newAcc := &AccElem{}
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Sun Apr 28 17:53:50 GMT 2024 - 33K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/ExecutionListBenchmark.java
RunnableExecutorPair(Runnable runnable, Executor executor) { this.runnable = runnable; this.executor = executor; } } } // A version of the list that uses compare and swap to manage the stack without locks. private static final class ExecutionListCAS { static final Logger log = Logger.getLogger(ExecutionListCAS.class.getName()); private static final sun.misc.Unsafe UNSAFE;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 17 15:19:38 GMT 2023 - 20.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* requireNonNull is safe because we don't clear nextPermutation until we're done calling this * method. */ requireNonNull(nextPermutation); int l = findNextL(j); Collections.swap(nextPermutation, j, l); int n = nextPermutation.size(); Collections.reverse(nextPermutation.subList(j + 1, n)); } int findNextJ() { /*
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.8K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/cache2/Relay.kt
fun commit(upstreamSize: Long) { // Write metadata to the end of the file. writeMetadata(upstreamSize) file!!.channel.force(false) // Once everything else is in place we can swap the dirty header for a clean one. writeHeader(PREFIX_CLEAN, upstreamSize, metadata.size.toLong()) file!!.channel.force(false) // This file is complete. synchronized(this@Relay) {
Plain Text - Registered: Fri Apr 26 11:42:10 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 11.8K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
} }; /** * Models a lock-free array of bits. * * <p>We use this instead of java.util.BitSet because we need access to the array of longs and we * need compare-and-swap. */ static final class LockFreeBitArray { private static final int LONG_ADDRESSABLE_BITS = 6; final AtomicLongArray data; private final LongAddable bitCount; LockFreeBitArray(long bits) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 10.7K bytes - Viewed (0)