- Sort Score
- Num 10 results
- Language All
Results 131 - 140 of 221 for distribution (0.1 seconds)
-
ci/official/containers/ml_build/builder.devtoolset/build_devtoolset.sh
ln -s "/usr/include/linux" "/${TARGET}/usr/include/linux" ln -s "/usr/include/asm-generic" "/${TARGET}/usr/include/asm-generic" ln -s "/usr/include/x86_64-linux-gnu/asm" "/${TARGET}/usr/include/asm" # Symlinks in the binary distribution are set up for installation in /usr, we # need to fix up all the links to stay within /${TARGET}. /fixlinks.sh "/${TARGET}" # Patch to allow non-glibc 2.12 compatible builds to work.Created: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Tue Sep 24 20:45:58 GMT 2024 - 8K bytes - Click Count (0) -
architecture/standards/0004-use-a-platform-architecture.md
- Has a private implementation. - Is owned by a single team. A team may own multiple architecture modules. The modules are arranged into several different "Gradle platforms". A Gradle platform is a logical distribution that provides support for a specific kind of automation. A typical platform builds on other platforms in order to add more capabilities, for example, to add support for a particular language.
Created: Wed Dec 31 11:36:14 GMT 2025 - Last Modified: Sun Feb 25 22:19:29 GMT 2024 - 4.5K bytes - Click Count (0) -
build-logic-commons/basics/src/main/kotlin/gradlebuild.minify.gradle.kts
* Artifacts matched by this map will be minified to only contain the specified * classes and the classes they depend on. The classes are not relocated, they all * remain in their original namespace. This reduces the final Gradle distribution * size and makes us more conscious of which parts of a library we really need. * * WARNING: if you decide to do the minification by hand, make sure that you cover all paths of loading classes:
Created: Wed Dec 31 11:36:14 GMT 2025 - Last Modified: Thu Dec 25 16:18:05 GMT 2025 - 5.6K bytes - Click Count (0) -
cmd/erasure-metadata.go
return true } dataBlocks := fi.Erasure.DataBlocks parityBlocks := fi.Erasure.ParityBlocks correctIndexes := (fi.Erasure.Index > 0 && fi.Erasure.Index <= dataBlocks+parityBlocks && len(fi.Erasure.Distribution) == (dataBlocks+parityBlocks)) return ((dataBlocks >= parityBlocks) && (dataBlocks > 0) && (parityBlocks >= 0) && correctIndexes) } // ToObjectInfo - Converts metadata to object info.
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 21.3K bytes - Click Count (0) -
cmd/erasure-healing-common_test.go
Checksums: map[string]string(nil), }, }, Erasure: ErasureInfo{ Algorithm: "ReedSolomon", DataBlocks: 6, ParityBlocks: 6, BlockSize: 1048576, Index: 1, Distribution: []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}, Checksums: []ChecksumInfo{{PartNumber: 1, Algorithm: 0x3, Hash: []uint8{}}}, }, NumVersions: 1, Idx: 0, } fi2 := FileInfo{
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 22.4K bytes - Click Count (0) -
compat/maven-model-builder/src/main/java/org/apache/maven/model/interpolation/StringVisitorModelInterpolator.java
org = license.getUrl(); val = interpolate(org); if (org != val) { license.setUrl(val); } // Distribution org = license.getDistribution(); val = interpolate(org); if (org != val) { license.setDistribution(val); }
Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Tue Feb 25 08:27:34 GMT 2025 - 43.1K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
* <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized) * constant time operations. Expected in the hashtable sense (depends on the hash function doing a * good job of distributing the elements to the buckets to a distribution not far from uniform), and * amortized since some operations can trigger a hash table resize. * * <p>This implementation consumes significantly less memory than {@code java.util.LinkedHashSet} orCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 9.4K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized) * constant time operations. Expected in the hashtable sense (depends on the hash function doing a * good job of distributing the elements to the buckets to a distribution not far from uniform), and * amortized since some operations can trigger a hash table resize. * * <p>This implementation consumes significantly less memory than {@code java.util.LinkedHashSet} orCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 9.6K bytes - Click Count (0) -
cmd/xl-storage-format-v2_test.go
Metadata: nil, Parts: nil, Erasure: ErasureInfo{ Algorithm: ReedSolomon.String(), DataBlocks: 4, ParityBlocks: 2, BlockSize: 10000, Index: 1, Distribution: []int{1, 2, 3, 4, 5, 6, 7, 8}, Checksums: []ChecksumInfo{{ PartNumber: 1, Algorithm: HighwayHash256S, Hash: nil, }}, }, MarkDeleted: false, Data: data,Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 37.8K bytes - Click Count (0) -
cmd/metrics-v2.go
Name: sizeDistribution, Help: "Distribution of object sizes across a cluster", Type: histogramMetric, } } func getClusterObjectVersionsMD() MetricDescription { return MetricDescription{ Namespace: clusterMetricNamespace, Subsystem: objectsSubsystem, Name: versionDistribution, Help: "Distribution of object versions across a cluster", Type: histogramMetric,
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 133.6K bytes - Click Count (0)