- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 407 for nope (0.02 sec)
-
android/guava-tests/test/com/google/common/collect/ListsTest.java
// The result of Arrays.asList() is mutable otherWay.set(0, "FOO"); assertEquals("FOO", otherWay.get(0)); // But it can't grow assertThrows(UnsupportedOperationException.class, () -> otherWay.add("nope")); // And it can't shrink assertThrows(UnsupportedOperationException.class, () -> otherWay.remove(2)); } @J2ktIncompatible @GwtIncompatible // SerializableTester
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 35.4K bytes - Viewed (0) -
.github/PULL_REQUEST_TEMPLATE.md
<!-- If no, just write "NONE" in the release-note block below. If yes, a release note is required: Enter your extended release note in the block below. If the PR requires additional action from users switching to the new release, include the string "action required". For more information on release notes see: https://git.k8s.io/community/contributors/guide/release-notes.md --> ```release-note ```
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Fri Jun 06 14:40:00 UTC 2025 - 3.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
transitiveClosure.putEdge(node, reachableNode); } } } else { // An optimization for the undirected case: for every node B reachable from node A, // node A and node B have the same reachability set. Set<N> visitedNodes = new HashSet<>(); for (N node : graph.nodes()) { if (!visitedNodes.contains(node)) { Set<N> reachableNodes = reachableNodes(graph, node);
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
transitiveClosure.putEdge(node, reachableNode); } } } else { // An optimization for the undirected case: for every node B reachable from node A, // node A and node B have the same reachability set. Set<N> visitedNodes = new HashSet<>(); for (N node : graph.nodes()) { if (!visitedNodes.contains(node)) { Set<N> reachableNodes = reachableNodes(graph, node);
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/crawler/transformer/FessXpathTransformer.java
* Processes Google on/off comment directives in the node. * * @param node the node to process * @param flag the flag indicating whether content should be included * @return the processed node */ protected Node processGoogleOffOn(final Node node, final ValueHolder<Boolean> flag) { final NodeList nodeList = node.getChildNodes(); List<Node> removedNodeList = null;
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Aug 07 03:06:29 UTC 2025 - 54.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multiset.java
* {@link UnsupportedOperationException} when they are not implemented. Most implementations should * support either all add operations or none of them, all removal operations or none of them, and if * and only if all of these are supported, the {@code setCount} methods as well. * * <p>A multiset uses {@link Object#equals} to determine whether two instances should be considered
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 19.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
*/ private @Nullable ExampleStackTrace findPathTo(LockGraphNode node, Set<LockGraphNode> seen) { if (!seen.add(this)) { return null; // Already traversed this node. } ExampleStackTrace found = allowedPriorLocks.get(node); if (found != null) { return found; // Found a path ending at the node! } // Recurse the edges.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Jul 18 15:05:43 UTC 2025 - 35.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/Multiset.java
* {@link UnsupportedOperationException} when they are not implemented. Most implementations should * support either all add operations or none of them, all removal operations or none of them, and if * and only if all of these are supported, the {@code setCount} methods as well. * * <p>A multiset uses {@link Object#equals} to determine whether two instances should be considered
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 20.9K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.29.md
### Node Binaries filename | sha512 hash -------- | ----------- [kubernetes-node-linux-amd64.tar.gz](https://dl.k8s.io/v1.29.15/kubernetes-node-linux-amd64.tar.gz) | b6f19bd510a5417b7c3e0c6c88733c034b5bd8b1f51c659ba6f58be0914c648bba7f9181f50fadcc6f04ea71c4b2e8b9e4f6c13acb517ecdeb338e561cefe794
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Mar 12 00:36:01 UTC 2025 - 429.6K bytes - Viewed (1) -
CHANGELOG/CHANGELOG-1.31.md
### Node Binaries filename | sha512 hash -------- | ----------- [kubernetes-node-linux-amd64.tar.gz](https://dl.k8s.io/v1.31.12/kubernetes-node-linux-amd64.tar.gz) | 17e6290eb983b623fb61e7707cfde4ad57d181372e10a400001bacceb07c35739c5e7d51d521f5bf5776d4fe15786b09ad0a7d37b26197fdaf4cea293f20b88f
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Aug 13 19:49:57 UTC 2025 - 429.6K bytes - Viewed (0)