Home
last modified time | relevance | path

Searched refs:NearestNeighbour1D (Results 1 – 14 of 14) sorted by relevance

/dports/math/openturns/openturns-1.18/lib/src/Base/Algo/
H A DNearestNeighbour1D.cxx30 CLASSNAMEINIT(NearestNeighbour1D)
41 NearestNeighbour1D::NearestNeighbour1D() in NearestNeighbour1D() function in NearestNeighbour1D
51 NearestNeighbour1D::NearestNeighbour1D(const Sample & vertices) in NearestNeighbour1D() function in NearestNeighbour1D
62 NearestNeighbour1D * NearestNeighbour1D::clone() const in clone()
64 return new NearestNeighbour1D( *this ); in clone()
68 NearestNeighbour1D * NearestNeighbour1D::emptyClone() const in emptyClone()
70 return new NearestNeighbour1D(); in emptyClone()
97 Sample NearestNeighbour1D::getSample() const in getSample()
103 String NearestNeighbour1D::__repr__() const in __repr__()
242 void NearestNeighbour1D::save(Advocate & adv) const in save()
[all …]
H A DNearestNeighbourAlgorithm.cxx50 p_implementation_ = new NearestNeighbour1D(sample); in NearestNeighbourAlgorithm()
/dports/math/openturns/openturns-1.18/python/src/
H A DNearestNeighbour1D.i9 %include openturns/NearestNeighbour1D.hxx
10 …amespace OT { %extend NearestNeighbour1D { NearestNeighbour1D(const NearestNeighbour1D & other) { … in NearestNeighbour1D() function
H A DNearestNeighbour1D_doc.i.in1 %feature("docstring") OT::NearestNeighbour1D
20 >>> tree = ot.NearestNeighbour1D([[x] for x in myRegularGrid.getValues()])
26 %feature("docstring") OT::NearestNeighbour1D::queryScalar
51 %feature("docstring") OT::NearestNeighbour1D::queryScalarK
H A DNearestNeighbourAlgorithmImplementation_doc.i.in29 * :class:`~openturns.NearestNeighbour1D` looks for nearest neighbour by
38 * If input dimension is 1, :class:`~openturns.NearestNeighbour1D` is selected.
43 KDTree, NearestNeighbour1D, RegularGridNearestNeighbour, NaiveNearestNeighbour
H A Dalgo_module.i48 %include NearestNeighbour1D.i
/dports/math/openturns/openturns-1.18/lib/src/Base/Algo/openturns/
H A DNearestNeighbour1D.hxx36 class OT_API NearestNeighbour1D class
46 NearestNeighbour1D();
49 explicit NearestNeighbour1D(const Sample & sample);
52 NearestNeighbour1D * clone() const override;
56 NearestNeighbour1D * emptyClone() const override;
/dports/math/openturns/openturns-1.18/python/test/
H A Dt_NearestNeighbour1D_std.expout1 tree= class=NearestNeighbour1D points= [ X0 ]
H A Dt_NearestNeighbour1D_std.py12 tree = ot.NearestNeighbour1D(sample)
/dports/math/openturns/openturns-1.18/python/doc/user_manual/
H A Dbase_objects.rst150 NearestNeighbour1D
/dports/math/openturns/openturns-1.18/lib/test/
H A Dt_NearestNeighbour1D_std.cxx52 const NearestNeighbour1D tree(sample); in main()
H A Dt_NearestNeighbour1D_std.expout1 tree=class=NearestNeighbour1D points=class=Sample name=Normal implementation=class=SampleImplementa…
/dports/math/openturns/openturns-1.18/lib/src/Uncertainty/StatTests/
H A DFittingTest.cxx657 const NearestNeighbour1D proximityAlgorithm(support); in ChiSquared()
/dports/math/openturns/openturns-1.18/
H A DChangeLog622 * NearestNeighbourAlgorithm, RegularGridNearestNeighbour, NaiveNearestNeighbour, NearestNeighbour1D