| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/ |
| smetric.py | 33 # Gmax = li_smax_graph(list(G.degree().values()))
36 return float(sum([G.degree(u)*G.degree(v) for (u,v) in G.edges_iter()]))
|
| isolate.py | 3 Functions for identifying isolate (degree zero) nodes.
17 """Determine of node n is an isolate (degree zero).
41 return G.degree(n)==0
46 Isolates are nodes with no neighbors (degree zero).
71 For digraphs isolates have zero in-degree and zero out_degre
|
| /external/eigen/unsupported/Eigen/src/Splines/ |
| SplineFitting.h | 31 * where \f$p\f$ is the degree and \f$m+1\f$ the number knots
35 * \param[in] degree The spline degree which is used during the interpolation.
41 void KnotAveraging(const KnotVectorType& parameters, DenseIndex degree, KnotVectorType& knots)
43 knots.resize(parameters.size()+degree+1);
45 for (DenseIndex j=1; j<parameters.size()-degree; ++j)
46 knots(j+degree) = parameters.segment(j,degree).mean();
48 knots.segment(0,degree+1) = KnotVectorType::Zero(degree+1)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/ |
| PolynomialsUtils.java | 92 * @param degree degree of the polynomial
93 * @return Chebyshev polynomial of specified degree
95 public static PolynomialFunction createChebyshevPolynomial(final int degree) {
96 return buildPolynomial(degree, CHEBYSHEV_COEFFICIENTS,
117 * @param degree degree of the polynomial
118 * @return Hermite polynomial of specified degree
120 public static PolynomialFunction createHermitePolynomial(final int degree) {
121 return buildPolynomial(degree, HERMITE_COEFFICIENTS
[all...] |
| /external/chromium-trace/trace-viewer/tracing/third_party/gl-matrix/src/gl-matrix/ |
| common.js | 41 var degree = Math.PI / 180; variable
44 * Convert Degree To Radian
49 return a * degree;
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/tests/ |
| test_swap.py | 7 degrees = sorted(graph.degree().values())
9 assert_equal(degrees, sorted(graph.degree().values()))
13 degrees = sorted(graph.degree().values())
16 assert_equal(degrees, sorted(graph.degree().values()))
39 degrees = sorted(G.degree().values())
41 assert_equal(degrees, sorted(G.degree().values()))
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/tests/ |
| test_relabel.py | 18 for opt in ["default", "sorted", "increasing degree",
19 "decreasing degree"]:
30 degH=H.degree().values()
31 degG=G.degree().values()
35 degH=H.degree().values()
36 degG=G.degree().values()
40 H=convert_node_labels_to_integers(G,ordering="increasing degree")
41 degH=H.degree().values()
42 degG=G.degree().values()
44 assert_equal(degree(H,0), 1
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/generators/tests/ |
| test_small.py | 45 assert_equal(sorted(G.degree().values()), [1, 1, 2, 3, 3])
52 assert_equal(list(G.degree().values()), 12 * [4])
59 assert_equal(list(G.degree().values()), 8*[3])
66 assert_equal(list(G.degree().values()), 20*[3])
70 assert_equal(sorted(G.degree().values()), [2, 2, 3, 3])
77 assert_equal(list(G.degree().values()), 20*[3])
84 assert_equal(list(G.degree().values()), 12*[3])
91 assert_equal(list(G.degree().values()), 14*[3])
98 assert_equal(sorted(G.degree().values()), [2, 2, 2, 3, 3])
105 assert_equal(sorted(G.degree().values()), [2, 3, 3, 4, 4]
[all...] |
| test_bipartite.py | 21 assert_equal(sorted(G.degree().values()),
27 assert_equal(sorted(G.degree().values()),
33 assert_equal(sorted(G.degree().values()),
54 assert_equal(sorted(G.degree().values()),
60 assert_equal(sorted(G.degree().values()),
80 assert_equal(sorted(G.degree().values()),
86 assert_equal(sorted(G.degree().values()),
92 assert_equal(sorted(G.degree().values()),
112 assert_equal(sorted(G.degree().values()),
118 assert_equal(sorted(G.degree().values())
[all...] |
| test_degree_seq.py | 9 # empty graph has empty degree sequence
12 assert_equal(G.degree(), {})
17 assert_equal(sorted(G.degree().values(),reverse=True),
19 assert_equal(sorted(G.degree(range(len(deg_seq))).values(),
54 # empty graph has empty degree sequence
57 assert_equal(G.degree(), {})
111 # Test range of valid directed degree sequences
158 assert_equal(d, list(G.degree().values()))
167 d = G.degree().values()
169 assert_equal(sorted(d), sorted(list(G.degree().values()))
[all...] |
| /packages/apps/Camera/src/com/android/camera/ui/ |
| RotateImageView.java | 65 public void setOrientation(int degree, boolean animation) {
68 degree = degree >= 0 ? degree % 360 : degree % 360 + 360;
69 if (degree == mTargetDegree) return;
71 mTargetDegree = degree;
108 int degree = mStartDegree + ANIMATION_SPEED local
110 degree = degree >= 0 ? degree % 360 : degree % 360 + 360
[all...] |
| /packages/apps/LegacyCamera/src/com/android/camera/ui/ |
| RotateImageView.java | 68 public void setOrientation(int degree) {
70 degree = degree >= 0 ? degree % 360 : degree % 360 + 360;
71 if (degree == mTargetDegree) return;
73 mTargetDegree = degree;
106 int degree = mStartDegree + ANIMATION_SPEED local
108 degree = degree >= 0 ? degree % 360 : degree % 360 + 360
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/ |
| PolynomialFitter.java | 38 /** Polynomial degree. */
39 private final int degree; field in class:PolynomialFitter
43 * ie. a n-degree polynomial has n+1 coefficients.</p>
44 * @param degree maximal degree of the polynomial
47 public PolynomialFitter(int degree, final DifferentiableMultivariateVectorialOptimizer optimizer) {
49 this.degree = degree;
76 return new PolynomialFunction(fitter.fit(new ParametricPolynomial(), new double[degree + 1]));
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixLogarithm.h | 57 void computePade(MatrixType& result, const MatrixType& T, int degree);
131 int degree; local
142 degree = getPadeDegree(normTminusI);
144 if ((degree - degree2 <= 1) || (numberOfExtraSquareRoots == 1))
153 computePade(result, T, degree);
157 /* \brief Get suitable degree for Pade approximation. (specialized for RealScalar = float) */
161 const float maxNormForPade[] = { 2.5111573934555054e-1 /* degree = 3 */ , 4.0535837411880493e-1,
163 int degree = 3; local
164 for (; degree <= maxPadeDegree; ++degree)
176 int degree = 3; local
207 int degree = 3; local
235 const int degree = 3; local
251 const int degree = 4; local
267 const int degree = 5; local
285 const int degree = 6; local
303 const int degree = 7; local
323 const int degree = 8; local
343 const int degree = 9; local
365 const int degree = 10; local
387 const int degree = 11; local
[all...] |
| MatrixPower.h | 57 void computePade(int degree, const MatrixType& IminusT, MatrixType& res) const;
95 void MatrixPowerAtomic<MatrixType>::computePade(int degree, const MatrixType& IminusT, MatrixType& res) const
97 int i = degree<<1;
98 res = (m_p-degree) / ((i-1)<<1) * IminusT;
138 int degree, degree2, numberOfSquareRoots = 0; local
161 degree = getPadeDegree(normIminusT);
163 if (degree - degree2 <= 1 || hasExtraSquareRoot)
171 computePade(degree, IminusT, res);
183 const float maxNormForPade[] = { 2.8064004e-1f /* degree = 3 */ , 4.3386528e-1f };
184 int degree = 3 local
196 int degree = 3; local
228 int degree = 3; local
[all...] |
| /external/ceres-solver/internal/ceres/ |
| polynomial.cc | 57 const int degree = companion_matrix.rows(); local
71 for (int i = 0; i < degree; ++i) {
107 const int degree = polynomial.size() - 1; local
109 companion_matrix.resize(degree, degree);
112 companion_matrix.col(degree - 1) = -polynomial.reverse().head(degree);
191 const int degree = polynomial.size() - 1; local
199 if (degree == 0) {
209 if (degree == 1)
254 const int degree = polynomial.rows() - 1; local
344 const int degree = num_constraints - 1; local
[all...] |
| /development/cmds/monkey/src/com/android/commands/monkey/ |
| MonkeyRotationEvent.java | 33 * @param degree Possible rotation degrees, see constants in
38 public MonkeyRotationEvent(int degree, boolean persist) {
40 mRotationDegree = degree;
47 System.out.println(":Sending rotation degree=" + mRotationDegree +
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/generators/ |
| stochastic.py | 43 degree = W.out_degree(weight=weight)
45 d[weight] = float(d.get(weight,1.0))/degree[u]
|
| /external/freetype/include/internal/services/ |
| svkern.h | 34 FT_Int degree,
|
| /external/pdfium/third_party/freetype/include/internal/services/ |
| svkern.h | 34 FT_Int degree,
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/isomorphism/ |
| isomorph.py | 31 Checks for matching degree, triangle, and number of cliques sequences.
38 d1=G1.degree()
44 d2=G2.degree()
70 Checks for matching degree and triangle sequences.
76 d1=G1.degree()
81 d2=G2.degree()
105 Checks for matching degree sequences.
111 d1=list(G1.degree().values())
113 d2=list(G2.degree().values())
|
| /external/pdfium/third_party/freetype/src/type1/ |
| t1afm.h | 46 FT_Int degree,
|
| /frameworks/base/core/java/android/view/ |
| VelocityTracker.java | 246 * Polynomial degree, or zero if only position information is available.
248 public int degree; field in class:VelocityTracker.Estimator
276 * @return The X coefficient, or 0 if the index is greater than the degree.
279 return index <= degree ? xCoeff[index] : 0;
285 * @return The Y coefficient, or 0 if the index is greater than the degree.
288 return index <= degree ? yCoeff[index] : 0;
294 for (int i = 0; i <= degree; i++) {
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/assortativity/ |
| neighbor_degree.py | 14 # average degree of neighbors
17 # normalize but not by zero degree
30 r"""Returns the average degree of the neighborhood of each node.
32 The average degree of a node `i` is
39 the degree of node `j` which belongs to `N(i)`. For weighted
46 where `s_i` is the weighted degree of node `i`, `w_{ij}`
57 Use "in"- or "out"-degree for source node.
61 Use "in"- or "out"-degree for target node.
64 Compute neighbor degree for specified nodes. The default is
75 A dictionary keyed by node with average neighbors degree value
[all...] |
| /frameworks/native/include/input/ |
| VelocityTracker.h | 46 // Polynomial degree (number of coefficients), or zero if no information is
48 uint32_t degree; member in struct:android::VelocityTracker::Estimator
55 degree = 0;
156 // Degree must be no greater than Estimator::MAX_DEGREE.
157 LeastSquaresVelocityTrackerStrategy(uint32_t degree, Weighting weighting = WEIGHTING_NONE);
199 // Degree must be 1 or 2.
200 IntegratingVelocityTrackerStrategy(uint32_t degree);
213 uint32_t degree; member in struct:android::IntegratingVelocityTrackerStrategy::State
|
