- Sort Score
- Result 10 results
- Languages All
Results 31 - 38 of 38 for Fortin (0.26 sec)
-
android/guava-tests/test/com/google/common/util/concurrent/ThreadFactoryBuilderTest.java
import java.util.concurrent.Executors; import java.util.concurrent.ThreadFactory; import junit.framework.TestCase; /** * Tests for ThreadFactoryBuilder. * * @author Kurt Alfred Kluever * @author Martin Buchholz */ public class ThreadFactoryBuilderTest extends TestCase { private final Runnable monitoredRunnable = new Runnable() { @Override public void run() { completed = true;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 7.5K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ImmutableList.java
if (elements instanceof ImmutableCollection) { /* * TODO: When given an ImmutableList that's a sublist, copy the referenced * portion of the array into a new array to save space? */ @SuppressWarnings("unchecked") // all supported methods are covariant ImmutableCollection<E> list = (ImmutableCollection<E>) elements;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 27 19:19:19 GMT 2024 - 11K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableList.java
? ImmutableList.<E>of() : ImmutableList.<E>construct(elements.clone()); } /** * Returns an immutable list containing the given elements, sorted according to their natural * order. The sorting algorithm used is stable, so elements that compare as equal will stay in the * order in which they appear in the input. * * <p>If your data has no duplicates, or you wish to deduplicate elements, use {@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 27.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/Iterators.java
} /** * An iterator that performs a lazy N-way merge, calculating the next value each time the iterator * is polled. This amortizes the sorting cost over the iteration and requires less memory than * sorting all elements at once. * * <p>Retrieving a single element takes approximately O(log(M)) time, where M is the number of
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jan 30 00:14:39 GMT 2024 - 50.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Maps.java
int i = 0; for (E e : list) { builder.put(e, i++); } return builder.buildOrThrow(); } /** * Returns a view of the portion of {@code map} whose keys are contained by {@code range}. * * <p>This method delegates to the appropriate methods of {@link NavigableMap} (namely {@link
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 159.6K bytes - Viewed (0) -
android/guava/src/com/google/thirdparty/publicsuffix/PublicSuffixPatterns.java
r?t??js?sp?t!e???d&em?mb?n&f?i??rt??e&dnarganipmac?ficer?ht?llivnioj?rdnaotnas??f&dj?ed?gg?n&e?i???g&e&l!.&a&b,m,p,?bp,c&a,s,?e&c,p,s,?fd,gm,ip,jr,la,ma,nr,o&g,r,t,?p&a,s,?r&p,r,?s&e,m,r,?tm,??s??l&s?z??n&c?e?o??ol!b?f?v??pp?ro??hvp?i&du?kiw?nana?oretin?r&c?eurab??sp?te?xat??l&at&an?rof??el?im?sq??m&a?da?e&gatnoc?leb??f?ic?oc!.&etiselpmis,topsgolb,???nce?o&ariebir?c&e?narboir?saso??d&o?ranreboas??e&g?t??i&b?dar?ecam?r??rp?t&a?erpoir???p&er?m!e?t??ooc?pa?se??qra?r&af?ga?o&davlas?j??tn?ut??s&a&ixa...
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Mar 21 21:04:43 GMT 2024 - 72.4K bytes - Viewed (1) -
android/guava/src/com/google/common/util/concurrent/AtomicDoubleArray.java
* long xBits = Double.doubleToRawLongBits(x); * long yBits = Double.doubleToRawLongBits(y); * return xBits == yBits; * } * }</pre> * * @author Doug Lea * @author Martin Buchholz * @since 11.0 */ @GwtIncompatible @J2ktIncompatible @ElementTypesAreNonnullByDefault public class AtomicDoubleArray implements java.io.Serializable { private static final long serialVersionUID = 0L;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterators.java
} /** * An iterator that performs a lazy N-way merge, calculating the next value each time the iterator * is polled. This amortizes the sorting cost over the iteration and requires less memory than * sorting all elements at once. * * <p>Retrieving a single element takes approximately O(log(M)) time, where M is the number of
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Apr 30 18:43:01 GMT 2024 - 51.1K bytes - Viewed (0)