- Sort Score
- Result 10 results
- Languages All
Results 141 - 150 of 635 for booth (0.02 sec)
-
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
* @author Jens Nyman * @param <N> Node parameter type * @param <V> Value parameter type */ final class DirectedGraphConnections<N, V> implements GraphConnections<N, V> { /** * A wrapper class to indicate a node is both a predecessor and successor while still providing * the successor value. */ private static final class PredAndSucc { private final Object successorValue; PredAndSucc(Object successorValue) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Jan 18 02:54:30 UTC 2025 - 17.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/escape/EscapersTest.java
builder.addEscape(' ', "-"); builder.addEscape('!', "$"); Escaper second = builder.build(); // This should have no effect on existing escapers. builder.addEscape(' ', "*"); // Test both escapers after modifying the builder. assertThat(first.escape("The Quick Brown Fox!")).isEqualTo("Xhe_Xuick_Xrown_XoxX"); assertThat(second.escape("The Quick Brown Fox!")).isEqualTo("Xhe-Xuick-Xrown-Xox$"); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 4.1K bytes - Viewed (0) -
src/test/java/jcifs/smb/SmbAuthExceptionTest.java
assertNull(ex.getCause(), "cause must be null for int constructor"); assertNull(ex.getRootCause(), "rootCause must be null for int constructor"); } /** * Validate message-only constructor with both null and empty messages. */ @ParameterizedTest @MethodSource("messageProvider") @DisplayName("String ctor: preserves message; default unsuccessful status")
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 4.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/Interner.java
/** * Chooses and returns the representative instance for any of a collection of instances that are * equal to each other. If two {@linkplain Object#equals equal} inputs are given to this method, * both calls will return the same instance. That is, {@code intern(a).equals(a)} always holds, * and {@code intern(a) == intern(b)} if and only if {@code a.equals(b)}. Note that {@code
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 2K bytes - Viewed (0) -
okhttp/src/jvmMain/kotlin/okhttp3/internal/platform/BouncyCastlePlatform.kt
} } override fun getSelectedProtocol(sslSocket: SSLSocket): String? = if (sslSocket is BCSSLSocket) { when (val protocol = (sslSocket as BCSSLSocket).applicationProtocol) { // Handles both un-configured and none selected. null, "" -> null else -> protocol } } else { super.getSelectedProtocol(sslSocket) } companion object { val isSupported: Boolean =
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Fri Dec 27 13:39:56 UTC 2024 - 3.3K bytes - Viewed (0) -
src/buildall.bash
linux_targets() { selectedtargets | grep 'linux' | sort } non_linux_targets() { selectedtargets | grep -v 'linux' | sort } # Note words in $targets are separated by both newlines and spaces. targets="$(linux_targets) $(non_linux_targets)" failed=false for target in $targets do echo "" echo "### Building $target" export GOOS=$(echo $target | sed 's/-.*//')
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue Apr 23 17:45:23 UTC 2024 - 2.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
// will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it. if (graph.isDirected()) { // Note: works for both directed and undirected graphs, but we only use in the directed case. for (N node : graph.nodes()) { for (N reachableNode : reachableNodes(graph, node)) { transitiveClosure.putEdge(node, reachableNode);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 22.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
// will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it. if (graph.isDirected()) { // Note: works for both directed and undirected graphs, but we only use in the directed case. for (N node : graph.nodes()) { for (N reachableNode : reachableNodes(graph, node)) { transitiveClosure.putEdge(node, reachableNode);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/query/TermRangeQueryCommand.java
"Unknown q: " + query.getClass() + " => " + query); } /** * Converts a TermRangeQuery to a QueryBuilder with the given boost value. * Handles both search fields and default field queries with proper range semantics. * * @param context the query context * @param termRangeQuery the term range query to convert * @param boost the boost value to apply
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 4.9K bytes - Viewed (0) -
docs/contribute/concurrency.md
Blocking APIs may be inefficient because you hold a thread idle while waiting on the network. Threads are expensive because they have both a memory overhead and a context-switching overhead. #### Framed protocols
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Sun Feb 06 16:35:36 UTC 2022 - 7K bytes - Viewed (0)