- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 382 for partition64 (0.18 sec)
-
src/slices/zsortanyfunc.go
const maxInsertion = 12 var ( wasBalanced = true // whether the last partitioning was reasonably balanced wasPartitioned = true // whether the slice was already partitioned ) for { length := b - a if length <= maxInsertion { insertionSortCmpFunc(data, a, b, cmp) return } // Fall back to heapsort if too many bad choices were made. if limit == 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 23 23:33:29 UTC 2023 - 12.8K bytes - Viewed (0) -
src/slices/zsortordered.go
const maxInsertion = 12 var ( wasBalanced = true // whether the last partitioning was reasonably balanced wasPartitioned = true // whether the slice was already partitioned ) for { length := b - a if length <= maxInsertion { insertionSortOrdered(data, a, b) return } // Fall back to heapsort if too many bad choices were made. if limit == 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 23 23:33:29 UTC 2023 - 12.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/cse.go
} } if len(splitPoints) == 1 { continue // no splits, leave equivalence class alone. } // Move another equivalence class down in place of e. partition[i] = partition[len(partition)-1] partition = partition[:len(partition)-1] i-- // Add new equivalence classes for the parts of e we found. splitPoints = append(splitPoints, len(e)) for j := 0; j < len(splitPoints)-1; j++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 9.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/IteratorsTest.java
assertFalse(partitions.hasNext()); } public void testPaddedPartition_singleton2() { Iterator<Integer> source = Iterators.singletonIterator(1); Iterator<List<Integer>> partitions = Iterators.paddedPartition(source, 2); assertTrue(partitions.hasNext()); assertTrue(partitions.hasNext()); assertEquals(Arrays.<@Nullable Integer>asList(1, null), partitions.next());
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 03 13:01:51 UTC 2024 - 55.7K bytes - Viewed (0) -
src/cmd/compile/internal/test/mergelocals_test.go
}, { // missing element 2 vars: []*ir.Name{v1, v2, v3}, partition: map[*ir.Name][]int{ v1: []int{0, 1}, v2: []int{0, 1}, v3: []int{0, 1}, }, experr: true, }, { // partitions disagree for v1 vs v2 vars: []*ir.Name{v1, v2, v3}, partition: map[*ir.Name][]int{ v1: []int{0, 1, 2}, v2: []int{1, 0, 2}, v3: []int{0, 1, 2}, }, experr: true, }, }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 18 15:43:53 UTC 2024 - 4.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/Iterables.java
* <p><b>Note:</b> if {@code iterable} is a {@link List}, use {@link Lists#partition(List, int)} * instead. * * @param iterable the iterable to return a partitioned view of * @param size the desired size of each partition (the last may be smaller) * @return an iterable of unmodifiable lists containing the elements of {@code iterable} divided * into partitions * @throws IllegalArgumentException if {@code size} is nonpositive
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 24 19:38:27 UTC 2024 - 42.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
* <p><b>Note:</b> if {@code iterable} is a {@link List}, use {@link Lists#partition(List, int)} * instead. * * @param iterable the iterable to return a partitioned view of * @param size the desired size of each partition (the last may be smaller) * @return an iterable of unmodifiable lists containing the elements of {@code iterable} divided * into partitions * @throws IllegalArgumentException if {@code size} is nonpositive
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 24 19:38:27 UTC 2024 - 42.8K bytes - Viewed (0) -
cmd/xl-storage-format-utils.go
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri Jun 07 22:18:44 UTC 2024 - 5.5K bytes - Viewed (0) -
tensorflow/cc/gradients/data_flow_grad.cc
// [g1, g2, g4, g5, g3] auto data = op.input(0); auto partitions = op.input(1); int32_t num_partitions; TF_RETURN_IF_ERROR( GetNodeAttr(op.node()->attrs(), "num_partitions", &num_partitions)); // Note: the shape of the partitions is a prefix of the data shape. // shape(partitions) = [5] auto partitions_shape = Shape(scope, partitions); // We now create a partitions-shaped tensor with integers from
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Jul 24 13:40:35 UTC 2021 - 5.8K bytes - Viewed (0) -
doc/next/6-stdlib/99-minor/net/http/62490.md
The new [Cookie.Partitioned] field identifies cookies with the Partitioned attribute....
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 18:33:05 UTC 2024 - 85 bytes - Viewed (0)