- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 122 for Height (0.1 sec)
-
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
* known-non-null type? But that particular problem might not arise here, since we're not * actually reading from the fields in any case in which they might be null (as proven by the * requireNonNull checks below). Plus, we're *already* lying here, since newHeader passes a null * key and value, which we pass to the superconstructor, even though the key and value type for
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 23.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/LinkedHashMultimap.java
* known-non-null type? But that particular problem might not arise here, since we're not * actually reading from the fields in any case in which they might be null (as proven by the * requireNonNull checks below). Plus, we're *already* lying here, since newHeader passes a null * key and value, which we pass to the superconstructor, even though the key and value type for
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 24.3K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Optional.java
* * <p>A non-null {@code Optional<T>} reference can be used as a replacement for a nullable {@code T} * reference. It allows you to represent "a {@code T} that must be present" and a "a {@code T} that * might be absent" as two distinct types in your program, which can aid clarity. * * <p>Some uses of this class include * * <ul> * <li>As a method return type, as an alternative to returning {@code null} to indicate that no
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 13K bytes - Viewed (0) -
guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* * <p>A min-max priority queue can be configured with a maximum size. If so, each time the size of * the queue exceeds that value, the queue automatically removes its greatest element according to * its comparator (which might be the element that was just added). This is different from * conventional bounded queues, which either block or reject new elements when full. * * <p>This implementation is based on the <a
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 34K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/JSR166TestCase.java
public static final Integer four = 4; public static final Integer five = 5; public static final Integer six = 6; public static final Integer seven = 7; public static final Integer eight = 8; public static final Integer nine = 9; public static final Integer m1 = -1; public static final Integer m2 = -2; public static final Integer m3 = -3; public static final Integer m4 = -4;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jun 10 19:21:11 UTC 2024 - 37.7K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AbstractCatchingFuture.java
input.addListener(future, rejectionPropagatingExecutor(executor, future)); return future; } /* * In certain circumstances, this field might theoretically not be visible to an afterDone() call * triggered by cancel(). For details, see the comments on the fields of TimeoutFuture. */ @CheckForNull @LazyInit ListenableFuture<? extends V> inputFuture;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 01 21:46:34 UTC 2024 - 8.7K bytes - Viewed (0) -
android/guava/src/com/google/common/io/AppendableWriter.java
@Override public void write(char[] cbuf, int off, int len) throws IOException { checkNotClosed(); // It turns out that creating a new String is usually as fast, or faster // than wrapping cbuf in a light-weight CharSequence. target.append(new String(cbuf, off, len)); } /* * Override a few functions for performance reasons to avoid creating unnecessary strings. */ @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 28 20:13:02 UTC 2023 - 3.4K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/ForwardingWrapperTester.java
boolean isPossibleChainingCall = interfaceType.isAssignableFrom(method.getReturnType()); try { Object actualReturnValue = method.invoke(wrapper, passedArgs); // If we think this might be a 'chaining' call then we allow the return value to either // be the wrapper or the returnValue. if (!isPossibleChainingCall || wrapper != actualReturnValue) { assertEquals(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 08 17:31:55 UTC 2024 - 9.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
private final transient int size; /* * We have some considerable complexity in these create methods because of * Builder.buildKeepingLast(). The same Builder might be called with buildKeepingLast() and then * buildOrThrow(), or vice versa. So in particular, if we modify alternatingKeysAndValues to * eliminate duplicate keys (for buildKeepingLast()) then we have to ensure that a later call to
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 15 22:32:14 UTC 2024 - 22.7K bytes - Viewed (0) -
src/main/java/jcifs/smb1/netbios/NameServicePacket.java
end = srcIndex + rDataLength; /* Apparently readRDataWireFormat can return 0 if resultCode != 0 in which case this will look indefinitely. Putting this else clause around the loop might fix that. But I would need to see a capture to confirm. if (resultCode != 0) { srcIndex += rDataLength; } else { */ for( addrIndex = 0; srcIndex < end; addrIndex++ ) {
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Fri Mar 22 20:39:42 UTC 2019 - 12.4K bytes - Viewed (0)