- Sort Score
- Result 10 results
- Languages All
Results 211 - 220 of 670 for succ (0.01 sec)
-
android/guava/src/com/google/common/primitives/Chars.java
return -1; } /** * Returns the start position of the first occurrence of the specified {@code target} within * {@code array}, or {@code -1} if there is no such occurrence. * * <p>More formally, returns the lowest index {@code i} such that {@code Arrays.copyOfRange(array, * i, i + target.length)} contains exactly the same elements as {@code target}. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 24.2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Shorts.java
return -1; } /** * Returns the start position of the first occurrence of the specified {@code target} within * {@code array}, or {@code -1} if there is no such occurrence. * * <p>More formally, returns the lowest index {@code i} such that {@code Arrays.copyOfRange(array, * i, i + target.length)} contains exactly the same elements as {@code target}. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 25.8K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Shorts.java
return -1; } /** * Returns the start position of the first occurrence of the specified {@code target} within * {@code array}, or {@code -1} if there is no such occurrence. * * <p>More formally, returns the lowest index {@code i} such that {@code Arrays.copyOfRange(array, * i, i + target.length)} contains exactly the same elements as {@code target}. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 25.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/Network.java
*/ Set<E> edgesConnecting(EndpointPair<N> endpoints); /** * Returns the single edge that directly connects {@code nodeU} to {@code nodeV}, if one is * present, or {@code Optional.empty()} if no such edge exists. * * <p>In an undirected network, this is equal to {@code edgeConnecting(nodeV, nodeU)}. * * @throws IllegalArgumentException if there are multiple parallel edges connecting {@code nodeU}
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 22:03:02 UTC 2025 - 22.5K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AtomicDouble.java
* variables. An {@code AtomicDouble} is used in applications such as atomic accumulation, and * cannot be used as a replacement for a {@link Double}. However, this class does extend {@code * Number} to allow uniform access by tools and utilities that deal with numerically-based classes. * * <p><a id="bitEquals"></a>This class compares primitive {@code double} values in methods such as
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 9.5K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/ACE.java
package jcifs.smb1.smb1; import jcifs.smb1.util.Hexdump; /** * An Access Control Entry (ACE) is an element in a security descriptor * such as those associated with files and directories. The Windows OS * determines which users have the necessary permissions to access objects * based on these entries. * <p> * To fully understand the information exposed by this class a description
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 8.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphBuilder.java
* Returns a {@link GraphBuilder} initialized with all properties queryable from {@code graph}. * * <p>The "queryable" properties are those that are exposed through the {@link Graph} interface, * such as {@link Graph#isDirected()}. Other properties, such as {@link #expectedNodeCount(int)}, * are not set in the new builder. */ public static <N> GraphBuilder<N> from(Graph<N> graph) { return new GraphBuilder<N>(graph.isDirected())
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 7.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConnections.java
*/ Iterator<EndpointPair<N>> incidentEdgeIterator(N thisNode); /** * Returns the value associated with the edge connecting the origin node to {@code node}, or null * if there is no such edge. */ @Nullable V value(N node); /** Remove {@code node} from the set of predecessors. */ void removePredecessor(N node); /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 2.4K bytes - Viewed (0) -
gradlew
# # Important for running: # # (1) You need a POSIX-compliant shell to run this script. If your /bin/sh is # noncompliant, but you have some other compliant shell such as ksh or # bash, then to run this script, type that shell name before the whole # command line, like: # # ksh Gradle # # Busybox and similar reduced shells will NOT work, because this script
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Fri Aug 01 08:06:31 UTC 2025 - 8.5K bytes - Viewed (0) -
apache-maven/src/main/appended-resources/licenses/BSD-2-Clause.txt
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
Registered: Sun Sep 07 03:35:12 UTC 2025 - Last Modified: Fri May 17 19:14:22 UTC 2024 - 1.2K bytes - Viewed (0)