- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 23 for arpack (0.17 sec)
-
android/guava/src/com/google/common/collect/CompactHashSet.java
@VisibleForTesting @CheckForNull transient @Nullable Object[] elements; /** * Keeps track of metadata like the number of hash table bits and modifications of this data * structure (to make it possible to throw ConcurrentModificationException in the iterator). Note * that we choose not to make this volatile, so we do less of a "best effort" to track such * errors, for better performance. */ private transient int metadata;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/mylasta/direction/sponsor/FessMultipartRequestHandler.java
br.addItem("Advice"); br.addElement("Against for JVN14876762."); br.addElement("Boundary size is limited by Framework."); br.addElement("Too long boundary is treated as 404 because it's thought of as attack."); br.addElement(""); br.addElement("While, you can override the boundary limit size"); br.addElement(" in " + FessMultipartRequestHandler.class.getSimpleName() + ".");
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 16.4K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/internal/aether/ReverseTreeRepositoryListener.java
} trace = trace.getParent(); } Path trackingDir; boolean missing = event.getFile() == null; if (missing) { // missing artifact - let's track the path anyway File dir = event.getSession().getLocalRepository().getBasedir(); dir = new File(
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Apr 12 11:08:37 GMT 2023 - 9.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AggregateFuture.java
// NOTE: If we ever want to use a custom executor here, have a look at CombinedFuture as we'll // need to handle RejectedExecutionException if (allMustSucceed) { // We need fail fast, so we have to keep track of which future failed so we can propagate // the exception immediately // Register a listener on each Future in the list to update the state of this future.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 15.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* href="https://github.com/google/guava/wiki/GraphsExplained#non-recursiveness">recursively</a>. * This is because the {@code forTree()}-based implementations don't keep track of visited nodes, * and therefore don't need to call `equals()` or `hashCode()` on the node objects; this saves * both time and space versus traversing the same graph using {@code forGraph()}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* passing in unsanitized user data then a malicious user could force it. A light shuffle of the * data using an unpredictable seed should normally be enough to thwart this attack. * * <p>The time taken to compute multiple quantiles on the same dataset using {@link Scale#indexes * indexes} is generally less than the total time taken to compute each of them separately, and
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
* * <p>This class is accessible but not supported in GWT as it references {@link * PermittedMetaException}. */ protected final class MultiExceptionListIterator implements ListIterator<E> { // TODO: track seen elements when order isn't guaranteed // TODO: verify contents afterward // TODO: something shiny and new instead of Stack // TODO: test whether null is supported (create a Feature) /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
Set<V> createCollection() { return Platform.newLinkedHashSetWithExpectedSize(valueSetCapacity); } /** * {@inheritDoc} * * <p>Creates a decorated insertion-ordered set that also keeps track of the order in which * key-value pairs are added to the multimap. * * @param key key to associate with values in the collection * @return a new decorated set containing a collection of values for one key
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedListMultimap.java
private transient int size; /* * Tracks modifications to keyToKeyList so that addition or removal of keys invalidates * preexisting iterators. This does *not* track simple additions and removals of values * that are not the first to be added or last to be removed for their key. */ private transient int modCount;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 27.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
/** @return {@code true} if the current thread has acquired this lock. */ boolean isAcquiredByCurrentThread(); } /** * A {@code LockGraphNode} associated with each lock instance keeps track of the directed edges in * the lock acquisition graph. */ private static class LockGraphNode { /** * The map tracking the locks that are known to be acquired before this lock, each associated
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0)