- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 114 for bond (0.2 sec)
-
android/guava/src/com/google/common/cache/Striped64.java
* using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we * search for this mapping by randomly varying the hash codes of
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
maven-core/src/test/java/org/apache/maven/project/ProjectModelResolverTest.java
"Expected 'UnresolvableModelException' not thrown."); assertEquals("The requested parent version range '[1,)' does not specify an upper bound", e.getMessage()); } @Test void testResolveParentSuccessfullyResolvesExistingParentWithoutRange() throws Exception { final Parent parent = new Parent(); parent.setGroupId("org.apache");
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Wed Apr 03 17:49:40 GMT 2024 - 9.4K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/resolver/MavenSnapshotMetadata.java
.groupId(artifact.getGroupId()) .artifactId(artifact.getArtifactId()) .version(artifact.getBaseVersion()) .build(); } public void bind(Artifact artifact) { artifacts.add(artifact); } public Object getKey() { return getGroupId() + ':' + getArtifactId() + ':' + getVersion(); }
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 2.5K bytes - Viewed (0) -
maven-builder-support/src/main/java/org/apache/maven/building/ProblemCollector.java
* @param cause The cause of the problem, may be {@code null}. */ void add(Problem.Severity severity, String message, int line, int column, Exception cause); /** * The next messages will be bound to this source. When calling this method again, previous messages keep * their source, but the next messages will use the new source. * * @param source a source */ void setSource(String source);
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 08:39:32 GMT 2023 - 1.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ContiguousSet.java
* Range#contains contained} by the range. * * @throws IllegalArgumentException if neither range nor the domain has a lower bound, or if * neither has an upper bound * @since 13.0 */ public static <C extends Comparable> ContiguousSet<C> create( Range<C> range, DiscreteDomain<C> domain) { checkNotNull(range); checkNotNull(domain);
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 9.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
} /** * Creates and returns a new builder, configured to build {@code MinMaxPriorityQueue} instances * that are limited to {@code maximumSize} elements. Each time a queue grows beyond this bound, it * immediately removes its greatest element (according to its comparator), which might be the * element that was just added. */ @SuppressWarnings("rawtypes") // https://github.com/google/guava/issues/989
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Floats.java
* value} is greater than {@code max}, {@code max} is returned. * * @param value the {@code float} value to constrain * @param min the lower bound (inclusive) of the range to constrain {@code value} to * @param max the upper bound (inclusive) of the range to constrain {@code value} to * @throws IllegalArgumentException if {@code min > max} * @since 21.0 */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 25.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
// Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b). // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two. // We bend over backwards to avoid branching, adapting a technique from // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax int delta = a - b; // can't overflow, since a and b are nonnegative
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
* that entries are indexable using ints. */ static final int MAXIMUM_CAPACITY = Ints.MAX_POWER_OF_TWO; /** The maximum number of segments to allow; used to bound constructor arguments. */ static final int MAX_SEGMENTS = 1 << 16; // slightly conservative /** Number of (unsynchronized) retries in the containsValue method. */ static final int CONTAINS_VALUE_RETRIES = 3;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/TreeRangeMapTest.java
private static final ImmutableList<Range<Integer>> RANGES; private static final int MIN_BOUND = -1; private static final int MAX_BOUND = 1; static { ImmutableList.Builder<Range<Integer>> builder = ImmutableList.builder(); builder.add(Range.<Integer>all()); // Add one-ended ranges for (int i = MIN_BOUND; i <= MAX_BOUND; i++) { for (BoundType type : BoundType.values()) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 20:09:59 GMT 2024 - 28K bytes - Viewed (0)