- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 45 for Newton (0.2 sec)
-
android/guava/src/com/google/common/math/BigIntegerMath.java
* Using DoubleUtils.bigToDouble, getting a double approximation of x is extremely fast, and * then we can get a double approximation of the square root. Then, we iteratively improve this * guess with an application of Newton's method, which sets guess := (guess + (x / guess)) / 2. * This iteration has the following two properties: * * a) every iteration (except potentially the first) has guess >= floor(sqrt(x)). This is
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/UndirectedNetworkConnections.java
import java.util.Collections; import java.util.Map; import java.util.Set; /** * An implementation of {@link NetworkConnections} for undirected networks. * * @author James Sexton * @param <N> Node parameter type * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault final class UndirectedNetworkConnections<N, E> extends AbstractUndirectedNetworkConnections<N, E> {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 1.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/UndirectedGraphConnections.java
import java.util.LinkedHashMap; import java.util.Map; import java.util.Set; import javax.annotation.CheckForNull; /** * An implementation of {@link GraphConnections} for undirected graphs. * * @author James Sexton * @param <N> Node parameter type * @param <V> Value parameter type */ @ElementTypesAreNonnullByDefault final class UndirectedGraphConnections<N, V> implements GraphConnections<N, V> {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 3.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
* * <p>Time complexities for mutation methods are all O(1) except for {@code removeNode(N node)}, * which is in O(d_node) where d_node is the degree of {@code node}. * * @author James Sexton * @author Joshua O'Madadhain * @author Omar Darwish * @param <N> Node parameter type * @param <V> Value parameter type */ @ElementTypesAreNonnullByDefault
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Oct 21 01:50:30 GMT 2023 - 6.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/NetworkBuilder.java
* .<String, Integer>immutable() * .addEdge("LAX", "ATL", 3025) * .addEdge("LAX", "ATL", 1598) * .addEdge("ATL", "LAX", 2450) * .build(); * }</pre> * * @author James Sexton * @author Joshua O'Madadhain * @param <N> The most general node type this builder will support. This is normally {@code Object} * unless it is constrained by using a method like {@link #nodeOrder}, or the builder is
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MultiEdgesConnecting.java
* * <p>The {@link #outEdgeToNode} map allows this class to work on networks with parallel edges. See * {@link EdgesConnecting} for a class that is more efficient but forbids parallel edges. * * @author James Sexton * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault abstract class MultiEdgesConnecting<E> extends AbstractSet<E> { private final Map<E, ?> outEdgeToNode; private final Object targetNode;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 2.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedNetworkConnections.java
import java.util.Collections; import java.util.Map; import java.util.Set; /** * An implementation of {@link NetworkConnections} for directed networks. * * @author James Sexton * @param <N> Node parameter type * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault final class DirectedNetworkConnections<N, E> extends AbstractDirectedNetworkConnections<N, E> {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 2.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingGraph.java
import java.util.Set; /** * A class to allow {@link Graph} implementations to be backed by a {@link BaseGraph}. This is not * currently planned to be released as a general-purpose forwarding class. * * @author James Sexton */ @ElementTypesAreNonnullByDefault abstract class ForwardingGraph<N> extends AbstractGraph<N> { abstract BaseGraph<N> delegate(); @Override public Set<N> nodes() { return delegate().nodes();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConnections.java
import java.util.Set; import javax.annotation.CheckForNull; /** * An interface for representing and manipulating an origin node's adjacent nodes and edge values in * a {@link Graph}. * * @author James Sexton * @param <N> Node parameter type * @param <V> Value parameter type */ @ElementTypesAreNonnullByDefault interface GraphConnections<N, V> { Set<N> adjacentNodes(); Set<N> predecessors();
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)