OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:knot
(Results
1 - 25
of
119
) sorted by null
1
2
3
4
5
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/
PolynomialSplineFunction.java
32
* <i>
knot
points</i>, determining the intervals over which the spline function
34
* have been computed to match the values of another function at the
knot
37
* the polynomials and
knot
points passed to the constructor.</p>
40
* centered on the
knot
points to compute the spline function values.
44
* <code>[smallest
knot
, largest
knot
]</code>. Attempts to evaluate the
51
* <li>The
knot
array is searched to find the segment to which <code>x</code>
52
* belongs. If <code>x</code> is less than the smallest
knot
point or greater
55
* <li> Let <code>j</code> be the index of the largest
knot
point that is less
57
* <code>polynomials[j](x -
knot
[j])</code></li></ol></p
[
all
...]
/external/clang/test/SemaTemplate/
instantiate-using-decl.cpp
42
class
Knot
: public JoinVisitor<
Knot
> {
46
Knot
().Visit((struct Object1*) 0);
47
Knot
().Visit((struct Object2*) 0);
48
Knot
().Visit((struct Object3*) 0); // expected-error {{no matching member function for call}}
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/
SplineInterpolator.java
31
* x[0] < x[i] ... < x[n]. The x values are referred to as "
knot
points."</p>
34
*
knot
point and strictly less than the largest
knot
point is computed by finding the subinterval to which
42
* <li>Adjacent polynomials are equal through two derivatives at the
knot
points (i.e., adjacent polynomials
43
* "match up" at the
knot
points, as do their first and second derivatives).</li>
82
// Differences between
knot
points
SmoothingPolynomialBicubicSplineInterpolator.java
109
// For every
knot
(xval[i], yval[j]) of the grid, calculate corrected
131
// For every
knot
(xval[i], yval[j]) of the grid, calculate corrected
SmoothingBicubicSplineInterpolator.java
91
// For every
knot
(xval[i], yval[j]) of the grid, calculate corrected
108
// For every
knot
(xval[i], yval[j]) of the grid, calculate corrected
/external/eigen/unsupported/test/
splines.cpp
209
KnotVectorType chord_lengths; //
knot
parameters
212
// interpolation without
knot
parameters
224
// interpolation with given
knot
parameters
/external/eigen/unsupported/Eigen/src/Splines/
SplineFitting.h
26
* \brief Computes
knot
averages.
40
* \param[out] knots The output
knot
vector.
57
* \brief Computes
knot
averages when derivative constraints are present.
70
* \param[out] knots The calculated
knot
vector. These will be returned as a
234
* \param knot_parameters The
knot
parameters for the interpolation.
324
KnotVectorType chord_lengths; //
knot
parameters
Spline.h
22
* The class represents B-splines with non-uniform
knot
vectors. Each control
45
/** \brief The data type used to store
knot
vectors. */
76
* \brief Creates a spline from a
knot
vector and control points.
77
* \param knots The spline's
knot
vector.
188
* \brief Returns the span within the
knot
vector in which u is falling.
194
* \brief Computes the spang within the provided
knot
vector in which u is falling.
208
* \param knots The underlying spline's
knot
vector.
215
* \param knots The underlying spline's
knot
vector.
221
KnotVectorType m_knots; /*!<
Knot
vector. */
SplineFwd.h
49
/** \brief The data type used to store
knot
vectors. */
/external/skia/src/gpu/
GrSurfaceProxy.cpp
118
SkASSERT(GrSurfaceProxy::LazyState::
kNot
== this->lazyInstantiationState());
187
SkASSERT(LazyState::
kNot
== this->lazyInstantiationState());
384
SkASSERT(GrSurfaceProxy::LazyState::
kNot
!= fProxy->lazyInstantiationState());
GrOnFlushResourceProvider.cpp
86
if (GrSurfaceProxy::LazyState::
kNot
!= proxy->lazyInstantiationState()) {
GrRenderTargetProxy.cpp
66
if (LazyState::
kNot
!= this->lazyInstantiationState()) {
GrTextureProxy.cpp
62
if (LazyState::
kNot
!= this->lazyInstantiationState()) {
GrTextureRenderTargetProxy.cpp
75
if (LazyState::
kNot
!= this->lazyInstantiationState()) {
GrResourceAllocator.cpp
82
if (GrSurfaceProxy::LazyState::
kNot
!= proxy->lazyInstantiationState()) {
252
if (GrSurfaceProxy::LazyState::
kNot
!= cur->proxy()->lazyInstantiationState()) {
/external/skqp/src/gpu/
GrSurfaceProxy.cpp
118
SkASSERT(GrSurfaceProxy::LazyState::
kNot
== this->lazyInstantiationState());
166
SkASSERT(LazyState::
kNot
== this->lazyInstantiationState());
350
SkASSERT(GrSurfaceProxy::LazyState::
kNot
!= fProxy->lazyInstantiationState());
GrRenderTargetProxy.cpp
64
if (LazyState::
kNot
!= this->lazyInstantiationState()) {
GrTextureProxy.cpp
64
if (LazyState::
kNot
!= this->lazyInstantiationState()) {
GrTextureRenderTargetProxy.cpp
68
if (LazyState::
kNot
!= this->lazyInstantiationState()) {
GrResourceAllocator.cpp
84
if (GrSurfaceProxy::LazyState::
kNot
!= proxy->lazyInstantiationState()) {
242
if (GrSurfaceProxy::LazyState::
kNot
!= cur->proxy()->lazyInstantiationState()) {
/external/skqp/include/private/
GrTextureProxy.h
92
SkASSERT(LazyState::
kNot
== this->lazyInstantiationState());
GrSurfaceProxy.h
186
kNot
, // The proxy is instantiated or does not have a lazy callback
193
return LazyState::
kNot
;
/external/skia/include/private/
GrSurfaceProxy.h
202
kNot
, // The proxy is instantiated or does not have a lazy callback
209
return LazyState::
kNot
;
/external/tensorflow/tensorflow/compiler/xla/service/
hlo_opcode.h
90
V(
kNot
, "not") \
/external/skia/tests/
GrMipMappedTest.cpp
162
if (GrSurfaceProxy::LazyState::
kNot
!= genProxy->lazyInstantiationState()) {
Completed in 1036 milliseconds
1
2
3
4
5