- Sort Score
- Num 10 results
- Language All
Results 551 - 560 of 909 for needed (0.03 seconds)
-
internal/ioutil/ioutil.go
} if !fi1.ModTime().Equal(fi2.ModTime()) { return false } if fi1.Mode() != fi2.Mode() { return false } return fi1.Size() == fi2.Size() } // DirectioAlignSize - DirectIO alignment needs to be 4K. Defined here as // directio.AlignSize is defined as 0 in MacOS causing divide by 0 error. const DirectioAlignSize = 4096 // CopyAligned - copies from reader to writer using the aligned input
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Tue Feb 18 16:25:55 GMT 2025 - 11.1K bytes - Click Count (0) -
.teamcity/README.md
## Develop and verify After you make a change, you can run `mvn clean teamcity-configs:generate` to generate and verify the generated TeamCity configuration XMLs. You also need to run `mvn clean verify` with Java 8 before committing changes. If you have ktlint errors, you can automatically fix them by running `mvn com.github.gantsign.maven:ktlint-maven-plugin:1.1.1:format`.
Created: Wed Dec 31 11:36:14 GMT 2025 - Last Modified: Wed Mar 06 23:02:25 GMT 2024 - 4K bytes - Click Count (0) -
guava/src/com/google/common/collect/UnmodifiableSortedMultiset.java
} @LazyInit private transient @Nullable UnmodifiableSortedMultiset<E> descendingMultiset; // TODO(b/418181860): This method creates retain cycles in J2ObjC. In order to break the cycle, // there needs to be separate classes for primary and descending multiset, where the primary one // would hold {@code @LazyInit @RetainedWith @Nullable} reference to its descending multiset, and // the other {@code final} reference. @Override
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 4K bytes - Click Count (0) -
cmd/erasure-multipart.go
userDefined[minIOErasureUpgraded] = strconv.Itoa(parityOrig) + "->" + strconv.Itoa(parityDrives) } } dataDrives := len(onlineDisks) - parityDrives // we now know the number of blocks this object needs for data and parity. // establish the writeQuorum using this data writeQuorum := dataDrives if dataDrives == parityDrives { writeQuorum++ } // Initialize parts metadata
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Oct 24 04:05:31 GMT 2025 - 47.1K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/base/FinalizableReferenceQueueTest.java
assertThat(getClass().getResource("internal/Finalizer.class")).isNotNull(); } @Test public void testFinalizeClassHasNoNestedClasses() throws Exception { // Ensure that the Finalizer class has no nested classes. // See https://github.com/google/guava/issues/1505 assertThat(Finalizer.class.getDeclaredClasses()).isEmpty(); } static class MyServerExampleWithFrq implements Closeable {
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Dec 11 20:07:52 GMT 2025 - 8.7K bytes - Click Count (0) -
docs/features/r8_proguard.md
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Sat Jul 19 07:07:23 GMT 2025 - 570 bytes - Click Count (0) -
api/maven-api-annotations/src/main/java/org/apache/maven/api/annotations/Config.java
* System properties are initialized before the build starts and are available throughout the entire Maven * execution. They are used for core Maven functionality that needs to be established at startup. */ SYSTEM_PROPERTIES, /** * Maven user properties. These are properties that users configure through various means such asCreated: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Thu Jul 03 14:18:26 GMT 2025 - 4.3K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
* href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data. * * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as * topological sort) that only need a way of accessing the predecessors of a node in a graph. * * <h3>Usage</h3> * * Given an algorithm, for example: * * {@snippet :
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 4K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data. * * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as * breadth first traversal) that only need a way of accessing the successors of a node in a graph. * * <h3>Usage</h3> * * Given an algorithm, for example: * * {@snippet :
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 4.2K bytes - Click Count (0) -
build-logic/kotlin-dsl-shared-runtime/src/main/kotlin/org/gradle/kotlin/dsl/internal/sharedruntime/codegen/ApiTypeProvider.kt
* Once closed, type graph navigation from [ApiType] and [ApiFunction] instances * will throw [IllegalStateException]. * * Limitations: * - supports Java byte code only, not Kotlin * - does not support nested Java arrays as method parameters * - does not support generics with multiple bounds */ class ApiTypeProvider internal constructor( private val asmLevel: Int, private val incubatingAnnotationTypeDescriptor: String,
Created: Wed Dec 31 11:36:14 GMT 2025 - Last Modified: Wed Mar 12 15:56:18 GMT 2025 - 20.2K bytes - Click Count (0)