- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 194 for toves (0.04 sec)
-
src/sort/zsortinterface.go
} else { wasBalanced = rightLen >= balanceThreshold pdqsort(data, mid+1, b, limit) b = mid } } } // partition does one quicksort partition. // Let p = data[pivot] // Moves elements in data[a:b] around, so that data[i]<p and data[j]>=p for i<newpivot and j>newpivot. // On return, data[newpivot] = p func partition(data Interface, a, b, pivot int) (newpivot int, alreadyPartitioned bool) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 13 20:16:24 UTC 2022 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountHashMap.java
} while (next != UNSET); return 0; } @CanIgnoreReturnValue int removeEntry(int entryIndex) { return remove(keys[entryIndex], getHash(entries[entryIndex])); } /** * Moves the last entry in the entry array into {@code dstIndex}, and nulls out its old position. */ void moveLastEntry(int dstIndex) { int srcIndex = size() - 1; if (dstIndex < srcIndex) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 01 22:07:10 UTC 2021 - 15K bytes - Viewed (0) -
cmd/kubeadm/app/componentconfigs/fakeconfig_test.go
// This, often times, requires that the PR that introduces such new fields to touch kubeadm test code. // Doing so, requires more work on the part of developers and reviewers. When kubeadm moves out of k/k // this would allow for more sporadic breaks in kubeadm tests as PRs that merge in k/k and introduce // new fields won't be able to fix the tests in kubeadm.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Apr 04 15:36:00 UTC 2024 - 16.3K bytes - Viewed (0) -
src/unsafe/unsafe.go
// Converting a Pointer to a uintptr creates an integer value // with no pointer semantics. // Even if a uintptr holds the address of some object, // the garbage collector will not update that uintptr's value // if the object moves, nor will that uintptr keep the object // from being reclaimed. // // The remaining patterns enumerate the only valid conversions // from uintptr to Pointer. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 21 19:45:20 UTC 2024 - 12.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/stablehlo/passes/replace_stablehlo_ops_in_main_function_with_xla_call_module_ops.cc
class LiveOuts { public: LiveOuts() = default; explicit LiveOuts(OperandRange range) : liveouts_(range.begin(), range.end()), prev_liveouts_(liveouts_) {} // Delete the current op from liveouts and moves on to the parent ops. void update(Operation& op) { for (Value result_value : op.getResults()) { liveouts_.remove(result_value); } for (Value operand : op.getOperands()) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 21K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/executor_island_coarsening.cc
} // Create YieldOp for the new island. OpBuilder builder(&new_island.GetBody(), new_island.GetBody().end()); return builder.create<YieldOp>(new_island.getLoc(), yield_operands); } // Moves inner ops (excluding last op/YieldOp) from islands being merged into // the new merged island. void MoveInnerOpsToNewIsland(const MergedIsland& merged_island, Operation* new_yield_op) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 19.7K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
public void set(E e) { throwIfInvalid(IteratorFeature.SUPPORTS_SET); stackWithLastReturnedElementAtTop.pop(); stackWithLastReturnedElementAtTop.push(e); } /** * Moves the given element from its current position in {@link #nextElements} to the top of the * stack so that it is returned by the next call to {@link Iterator#next()}. If the element is
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 11 16:13:05 UTC 2024 - 20.7K bytes - Viewed (0) -
src/slices/zsortanyfunc.go
wasBalanced = rightLen >= balanceThreshold pdqsortCmpFunc(data, mid+1, b, limit, cmp) b = mid } } } // partitionCmpFunc does one quicksort partition. // Let p = data[pivot] // Moves elements in data[a:b] around, so that data[i]<p and data[j]>=p for i<newpivot and j>newpivot. // On return, data[newpivot] = p
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 23 23:33:29 UTC 2023 - 12.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/layout_optimization.cc
void runOnOperation() final; }; #define GEN_PASS_DEF_MOVETRANSPOSESPASS #include "tensorflow/compiler/mlir/tensorflow/transforms/tf_passes.h.inc" // MoveTransposesPass moves all Transpose ops to the beginning or to the end of // the basic block where they are defined. This will allow canonicalzer to // delete redundant transposes. class MoveTransposesPass
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 19.3K bytes - Viewed (0) -
src/slices/zsortordered.go
} else { wasBalanced = rightLen >= balanceThreshold pdqsortOrdered(data, mid+1, b, limit) b = mid } } } // partitionOrdered does one quicksort partition. // Let p = data[pivot] // Moves elements in data[a:b] around, so that data[i]<p and data[j]>=p for i<newpivot and j>newpivot. // On return, data[newpivot] = p func partitionOrdered[E cmp.Ordered](data []E, a, b, pivot int) (newpivot int, alreadyPartitioned bool) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 23 23:33:29 UTC 2023 - 12.4K bytes - Viewed (0)