- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 353 for rpartition (0.19 sec)
-
staging/src/k8s.io/client-go/applyconfigurations/core/v1/gcepersistentdiskvolumesource.go
// with apply. type GCEPersistentDiskVolumeSourceApplyConfiguration struct { PDName *string `json:"pdName,omitempty"` FSType *string `json:"fsType,omitempty"` Partition *int32 `json:"partition,omitempty"` ReadOnly *bool `json:"readOnly,omitempty"` } // GCEPersistentDiskVolumeSourceApplyConfiguration constructs an declarative configuration of the GCEPersistentDiskVolumeSource type for use with
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 04 18:31:34 UTC 2021 - 3K bytes - Viewed (0) -
src/sort/zsortfunc.go
if wasBalanced && wasPartitioned && hint == increasingHint { if partialInsertionSort_func(data, a, b) { return } } // Probably the slice contains many duplicate elements, partition the slice into // elements equal to and elements greater than the pivot. if a > 0 && !data.Less(a-1, pivot) { mid := partitionEqual_func(data, a, b, pivot) a = mid continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 13 20:16:24 UTC 2022 - 11.5K bytes - Viewed (0) -
internal/arn/arn.go
} return ARN{ Partition: arnPartitionMinio, Service: arnServiceIAM, Region: serverRegion, ResourceType: arnResourceTypeRole, ResourceID: resourceID, }, nil } // String - returns string representation of the ARN. func (arn ARN) String() string { return strings.Join( []string{ arnPrefixArn, arn.Partition, arn.Service, arn.Region,
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Apr 04 08:31:34 UTC 2024 - 3.5K bytes - Viewed (0) -
src/slices/zsortanyfunc.go
if wasBalanced && wasPartitioned && hint == increasingHint { if partialInsertionSortCmpFunc(data, a, b, cmp) { return } } // Probably the slice contains many duplicate elements, partition the slice into // elements equal to and elements greater than the pivot. if a > 0 && !(cmp(data[a-1], data[pivot]) < 0) { mid := partitionEqualCmpFunc(data, a, b, pivot, cmp) a = mid continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 23 23:33:29 UTC 2023 - 12.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/TopKSelector.java
} } } /** * Partitions the contents of buffer in the range [left, right] around the pivot element * previously stored in buffer[pivotValue]. Returns the new index of the pivot element, * pivotNewIndex, so that everything in [left, pivotNewIndex] is ≤ pivotValue and everything in * (pivotNewIndex, right] is greater than pivotValue. */ private int partition(int left, int right, int pivotIndex) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
pkg/apis/apps/v1beta2/defaults_test.go
UpdateStrategy: appsv1beta2.StatefulSetUpdateStrategy{ Type: appsv1beta2.RollingUpdateStatefulSetStrategyType, RollingUpdate: &appsv1beta2.RollingUpdateStatefulSetStrategy{ Partition: &defaultPartition, }, }, RevisionHistoryLimit: ptr.To[int32](10), }, }, }, { name: "Alternate update strategy", original: &appsv1beta2.StatefulSet{
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Apr 24 18:25:29 UTC 2024 - 23.4K bytes - Viewed (0) -
src/slices/zsortordered.go
if wasBalanced && wasPartitioned && hint == increasingHint { if partialInsertionSortOrdered(data, a, b) { return } } // Probably the slice contains many duplicate elements, partition the slice into // elements equal to and elements greater than the pivot. if a > 0 && !cmp.Less(data[a-1], data[pivot]) { mid := partitionEqualOrdered(data, a, b, pivot) a = mid continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 23 23:33:29 UTC 2023 - 12.4K 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) -
android/guava/src/com/google/common/collect/TopKSelector.java
} } } /** * Partitions the contents of buffer in the range [left, right] around the pivot element * previously stored in buffer[pivotValue]. Returns the new index of the pivot element, * pivotNewIndex, so that everything in [left, pivotNewIndex] is ≤ pivotValue and everything in * (pivotNewIndex, right] is greater than pivotValue. */ private int partition(int left, int right, int pivotIndex) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K 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)