- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 851 for notes (0.21 sec)
-
build-logic/documentation/src/main/groovy/gradlebuild/docs/DomBuilder.groovy
} else { current.appendChild(document.importNode(node, true)) } } def appendChildren(Iterable<? extends Node> nodes) { nodes.each { appendChild(it) } } def appendChildren(NodeList nodes) { nodes.each { appendChild(it) } } def text(String text) { current.appendChild(document.createTextNode(text)) }
Groovy - Registered: Wed May 01 11:36:15 GMT 2024 - Last Modified: Wed Dec 09 08:14:05 GMT 2020 - 2.7K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/entity/PingResponse.java
private static final String STATUS = "status"; private static final String TIMED_OUT = "timed_out"; private static final String NUMBER_OF_NODES = "number_of_nodes"; private static final String NUMBER_OF_DATA_NODES = "number_of_data_nodes"; private static final String NUMBER_OF_PENDING_TASKS = "number_of_pending_tasks"; private static final String NUMBER_OF_IN_FLIGHT_FETCH = "number_of_in_flight_fetch";
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 5.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractGraph.java
return true; } if (!(obj instanceof Graph)) { return false; } Graph<?> other = (Graph<?>) obj; return isDirected() == other.isDirected() && nodes().equals(other.nodes()) && edges().equals(other.edges()); } @Override public final int hashCode() { return edges().hashCode(); } /** Returns a string representation of this graph. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 1.8K bytes - Viewed (0) -
docs/bucket/replication/sio-error.sh
mkdir -p /tmp/xl/1/ /tmp/xl/2/ export MINIO_KMS_SECRET_KEY="my-minio-key:OSMM+vkKUTCvQs9YL/CVMIMt43HFhkUpqJxTmGl6rYw=" NODES=4 args1=() args2=() for i in $(seq 1 $NODES); do args1+=("http://localhost:$((9000 + i))/tmp/xl/1/$i ") args2+=("http://localhost:$((9100 + i))/tmp/xl/2/$i ") done for i in $(seq 1 $NODES); do ./minio server --address "127.0.0.1:$((9000 + i))" ${args1[@]} & # | tee /tmp/minio/node.$i &
Shell Script - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Mar 04 18:05:56 GMT 2024 - 1.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConnections.java
* the edge connecting the two nodes. */ @CanIgnoreReturnValue @CheckForNull V removeSuccessor(N node); /** * Add {@code node} as a predecessor to the origin node. In the case of an undirected graph, it * also becomes a successor. Associates {@code value} with the edge connecting the two nodes. */ void addPredecessor(N node, V value); /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractValueGraph.java
implements ValueGraph<N, V> { @Override public Graph<N> asGraph() { return new AbstractGraph<N>() { @Override public Set<N> nodes() { return AbstractValueGraph.this.nodes(); } @Override public Set<EndpointPair<N>> edges() { return AbstractValueGraph.this.edges(); } @Override public boolean isDirected() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 17 13:59:28 GMT 2023 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
*/ @ElementTypesAreNonnullByDefault interface BaseGraph<N> extends SuccessorsFunction<N>, PredecessorsFunction<N> { // // Graph-level accessors // /** Returns all nodes in this graph, in the order specified by {@link #nodeOrder()}. */ Set<N> nodes(); /** Returns all edges in this graph. */ Set<EndpointPair<N>> edges(); // // Graph properties // /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 8.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ElementOrderTest.java
assertThat(graph.nodes()).containsExactly(3, 1, 4).inOrder(); } // The default ordering is INSERTION unless otherwise specified. @Test public void nodeOrder_default() { MutableGraph<Integer> graph = GraphBuilder.directed().build(); addNodes(graph); assertThat(graph.nodeOrder()).isEqualTo(insertion()); assertThat(graph.nodes()).containsExactly(3, 1, 4).inOrder(); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ElementOrderTest.java
assertThat(graph.nodes()).containsExactly(3, 1, 4).inOrder(); } // The default ordering is INSERTION unless otherwise specified. @Test public void nodeOrder_default() { MutableGraph<Integer> graph = GraphBuilder.directed().build(); addNodes(graph); assertThat(graph.nodeOrder()).isEqualTo(insertion()); assertThat(graph.nodes()).containsExactly(3, 1, 4).inOrder(); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
common-protos/k8s.io/api/node/v1beta1/generated.proto
// +optional optional Overhead overhead = 3; // scheduling holds the scheduling constraints to ensure that pods running // with this RuntimeClass are scheduled to nodes that support it. // If scheduling is nil, this RuntimeClass is assumed to be supported by all // nodes. // +optional optional Scheduling scheduling = 4; } // RuntimeClassList is a list of RuntimeClass objects. message RuntimeClassList {
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 4.4K bytes - Viewed (0)