- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 1,136 for codes (0.03 sec)
-
guava/src/com/google/common/graph/ValueGraphBuilder.java
* unless it is constrained by using a method like {@link #nodeOrder}, or the builder is * constructed based on an existing {@code ValueGraph} using {@link #from(ValueGraph)}. * @param <V> The most general value type this builder will support. This is normally {@code Object} * unless the builder is constructed based on an existing {@code Graph} using {@link * #from(ValueGraph)}.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 7.9K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.2.md
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Fri Dec 04 06:36:19 UTC 2020 - 41.4K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.7.md
* Fix a bug in GCE multizonal clusters where PersistentVolumes were sometimes created in zones without nodes. ([#52322](https://github.com/kubernetes/kubernetes/pull/52322), [@davidz627](https://github.com/davidz627))
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Thu May 05 13:44:43 UTC 2022 - 308.7K bytes - Viewed (1) -
android/guava-tests/test/com/google/common/graph/DefaultNetworkImplementationsTest.java
this.network = network; } static <N, E> NetworkForTest<N, E> from(Network<N, E> network) { return new NetworkForTest<>(network); } @Override public Set<N> nodes() { return network.nodes(); } @Override public Set<E> edges() { return network.edges(); } @Override public boolean isDirected() { return network.isDirected();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 7.4K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.33.md
- [Downloads for v1.33.4](#downloads-for-v1334) - [Source Code](#source-code) - [Client Binaries](#client-binaries) - [Server Binaries](#server-binaries) - [Node Binaries](#node-binaries) - [Container Images](#container-images) - [Changelog since v1.33.3](#changelog-since-v1333) - [Important Security Information](#important-security-information)
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Aug 13 19:46:23 UTC 2025 - 294.3K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
/** * Checks the acquisition-ordering between {@code this}, which is about to be acquired, and the * specified {@code acquiredLock}. * * <p>When this method returns, the {@code acquiredLock} should be in either the {@code * preAcquireLocks} map, for the case in which it is safe to acquire {@code this} after the * {@code acquiredLock}, or in the {@code disallowedPriorLocks} map, in which case it is not * safe.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Jul 18 15:05:43 UTC 2025 - 35.9K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/web/CrudMode.java
* either express or implied. See the License for the specific language * governing permissions and limitations under the License. */ package org.codelibs.fess.app.web; /** * Constants for CRUD operation modes. */ public class CrudMode { /** * Mode for listing records. */ public static final int LIST = 0; /** * Mode for creating a new record. */
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 1.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/EndpointPairTest.java
assertThat(edges).doesNotContain(EndpointPair.ordered(N1, N2)); assertThat(edges).doesNotContain(EndpointPair.unordered(N2, N2)); // edge not present assertThat(edges).doesNotContain(EndpointPair.unordered(N3, N4)); // nodes not in graph } @Test public void endpointPair_directed_contains() { MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(true).build(); directedGraph.putEdge(N1, N1);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 9.5K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.21.md
## Changes by Kind ### Deprecation
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Fri Oct 14 07:03:14 UTC 2022 - 367.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/NetworkConnections.java
* * <p>In the undirected case, returns {@code null} if {@code isSelfLoop} is true. */ @CanIgnoreReturnValue @Nullable N removeInEdge(E edge, boolean isSelfLoop); /** Remove {@code edge} from the set of outgoing edges. Returns the former successor node. */ @CanIgnoreReturnValue N removeOutEdge(E edge); /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 2.3K bytes - Viewed (0)