| /dports/devel/etl/synfig-1.2.2/synfig-core/src/synfig/ |
| H A D | curveset.cpp | 77 struct ipoint struct
83 ipoint *next; argument
84 ipoint *prev; argument
85 ipoint *neighbor; argument
89 ipoint(): in ipoint() argument
100 bool operator<(const ipoint &rhs) const in operator <() argument
111 bool operator>(const ipoint &rhs) const in operator >() argument
116 void insert_after(ipoint *i) in insert_after() argument
131 void insert_before(ipoint *i) in insert_before() argument
146 void insert_sorted(ipoint *i) in insert_sorted() argument
|
| /dports/graphics/synfig/synfig-1.2.2/synfig-core/src/synfig/ |
| H A D | curveset.cpp | 77 struct ipoint struct
83 ipoint *next; argument
84 ipoint *prev; argument
85 ipoint *neighbor; argument
89 ipoint(): in ipoint() function
100 bool operator<(const ipoint &rhs) const in operator <() argument
111 bool operator>(const ipoint &rhs) const in operator >() argument
116 void insert_after(ipoint *i) in insert_after() argument
131 void insert_before(ipoint *i) in insert_before() argument
146 void insert_sorted(ipoint *i) in insert_sorted() argument
|
| /dports/graphics/synfigstudio/synfig-1.2.2/synfig-core/src/synfig/ |
| H A D | curveset.cpp | 77 struct ipoint struct
83 ipoint *next; argument
84 ipoint *prev; argument
85 ipoint *neighbor; argument
89 ipoint(): in ipoint() argument
100 bool operator<(const ipoint &rhs) const in operator <() argument
111 bool operator>(const ipoint &rhs) const in operator >() argument
116 void insert_after(ipoint *i) in insert_after() argument
131 void insert_before(ipoint *i) in insert_before() argument
146 void insert_sorted(ipoint *i) in insert_sorted() argument
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/ |
| H A D | Polychain_2.h | 458 if (const Point_2 *ipoint = CGAL::object_cast<Point_2>(&result)) { in line_first_intersection_point_with() local
477 if (const Point_2 *ipoint = CGAL::object_cast<Point_2>(&result)) { in line_first_intersection_point_with() local
583 if (const Point_2 *ipoint = CGAL::object_cast<Point_2>(&result)) { in first_intersection_point_with() local
597 if (const Point_2 *ipoint = CGAL::object_cast<Point_2>(&result)) { in first_intersection_point_with() local
609 if (const Point_2 *ipoint = CGAL::object_cast<Point_2>(&result)) { in first_intersection_point_with() local
629 if (const Point_2 *ipoint = CGAL::object_cast<Point_2>(&result)) { in first_intersection_point_with() local
643 if (const Point_2 *ipoint = CGAL::object_cast<Point_2>(&result)) in first_intersection_point_with() local
656 if (const Point_2 *ipoint = CGAL::object_cast<Point_2>(&result)) { in first_intersection_point_with() local
674 if (const Point_2 *ipoint = CGAL::object_cast<Point_2>(&result)) { in first_intersection_point_with() local
688 if (const Point_2 *ipoint = CGAL::object_cast<Point_2>(&result)) { in first_intersection_point_with() local
[all …]
|
| H A D | Simple_polygon_visibility_2.h | 402 const Point_2 * ipoint = object_cast<Point_2>(&result); in visibility_region_impl() local
485 const Point_2 * ipoint = object_cast<Point_2>(&result); in right() local
517 const Point_2 * ipoint = object_cast<Point_2>(&result); in right() local
536 const Point_2 * ipoint = object_cast<Point_2>(&result); in right() local
670 const Point_2 * ipoint = object_cast<Point_2>( &result ); in scan_edges() local
|
| /dports/math/py-iminuit/iminuit-2.8.4/extern/root/math/minuit2/src/ |
| H A D | MnPlot.cxx | 28 …for (std::vector<std::pair<double, double>>::const_iterator ipoint = points.begin(); ipoint != poi… in operator ()() local
54 …for (std::vector<std::pair<double, double>>::const_iterator ipoint = points.begin(); ipoint != poi… in operator ()() local
|
| /dports/audio/praat/praat-6.2.03/fon/ |
| H A D | Pitch_AnyTier_to_PitchTier.cpp | 36 for (integer ipoint = 1; ipoint <= tier -> points.size; ipoint ++) { in PitchTier_AnyTier_to_PitchTier() local
66 for (integer ipoint = 1; ipoint <= tier -> points.size; ipoint ++) { in Pitch_AnyTier_to_PitchTier() local
|
| H A D | RealTierArea.cpp | 96 for (integer ipoint = imin; ipoint <= imax; ipoint ++) { in RealTierArea_draw() local
112 for (integer ipoint = imin; ipoint <= imax; ipoint ++) { in RealTierArea_draw() local
129 for (integer ipoint = my firstSelected; ipoint <= my lastSelected; ipoint ++) { in RealTierArea_drawWhileDragging() local
|
| /dports/science/plumed/plumed2-2.7.2/src/gridtools/ |
| H A D | AverageOnGrid.cpp | 43 void AverageOnGrid::accumulate( const unsigned& ipoint, const double& weight, const double& dens, c… in accumulate() argument
51 double AverageOnGrid::getGridElement( const unsigned& ipoint, const unsigned& jelement ) const { in getGridElement() argument
|
| H A D | GridVessel.cpp | 269 void GridVessel::getGridPointCoordinates( const unsigned& ipoint, std::vector<double>& x ) const { in getGridPointCoordinates() argument
273 void GridVessel::getGridPointCoordinates( const unsigned& ipoint, std::vector<unsigned>& tindices, … in getGridPointCoordinates() argument
284 void GridVessel::getFlatGridCoordinates( const unsigned& ipoint, std::vector<unsigned>& tindices, s… in getFlatGridCoordinates() argument
289 void GridVessel::getFibonacciCoordinates( const unsigned& ipoint, std::vector<double>& x ) const { in getFibonacciCoordinates() argument
321 double GridVessel::getGridElement( const unsigned& ipoint, const unsigned& jelement ) const { in getGridElement() argument
326 void GridVessel::setGridElement( const unsigned& ipoint, const unsigned& jelement, const double& va… in setGridElement()
331 void GridVessel::setValueAndDerivatives( const unsigned& ipoint, const unsigned& jelement, const do… in setValueAndDerivatives()
336 void GridVessel::addToGridElement( const unsigned& ipoint, const unsigned& jelement, const double& … in addToGridElement()
467 for(unsigned int ipoint=0; ipoint<n_neigh; ++ipoint) { in getValueAndDerivatives() local
|
| H A D | AverageOnGrid.h | 35 …void accumulateForce( const unsigned& ipoint, const double& weight, const std::vector<double>& der… in accumulateForce()
|
| H A D | HistogramOnGrid.cpp | 178 void HistogramOnGrid::accumulate( const unsigned& ipoint, const double& weight, const double& dens,… in accumulate() argument
183 void HistogramOnGrid::accumulateForce( const unsigned& ipoint, const double& weight, const std::vec… in accumulateForce() argument
197 for(unsigned ipoint=0; ipoint<getNumberOfPoints(); ++ipoint) { in getFinalForces() local
|
| H A D | ActionWithInputGrid.h | 51 double ActionWithInputGrid::getFunctionValue( const unsigned& ipoint ) const { in getFunctionValue()
|
| /dports/audio/praat/praat-6.2.03/gram/ |
| H A D | NoulliGrid.cpp | 69 for (integer ipoint = 1; ipoint <= tier -> points.size; ipoint ++) { in NoulliGrid_average() local
106 for (integer ipoint = 1; ipoint < tier -> points.size; ipoint ++) { in NoulliGrid_paintInside() local
123 for (integer ipoint = 1; ipoint <= tier -> points.size; ipoint ++) { in NoulliGrid_paintInside() local
|
| /dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/gcc/ada/ |
| H A D | g-pehage.adb | 58 -- This algorithm defines two possible constructions of f1 and
377 procedure Set_Rand_Tab (T : Integer; X, Y : Natural; Item : Natural);
|
| /dports/math/sisl/SISL-SISL-4.6.0-44-g9114631/src/ |
| H A D | s6drawseq.c | 63 s6drawseq(double epoint[],int ipoint) in s6drawseq()
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/ |
| H A D | VPSApproximation.cpp | 187 for (size_t ipoint = 0; ipoint < _num_inserted_points; ipoint++) in VPS_execute() local
206 for (size_t ipoint = 0; ipoint < _num_inserted_points; ipoint++) in VPS_execute() local
336 for (size_t ipoint = 0; ipoint < _num_inserted_points; ipoint++) in VPS_create_containers() local
419 for (size_t ipoint = 0; ipoint < _num_inserted_points; ipoint++) in VPS_create_containers() local
489 for (size_t ipoint = 0; ipoint < _num_inserted_points; ipoint++) in VPS_create_containers() local
503 for (size_t ipoint = 0; ipoint < _num_inserted_points; ipoint++) in VPS_create_containers() local
584 for (size_t ipoint = 0; ipoint < _num_inserted_points; ipoint++) in VPS_create_containers() local
793 for (size_t ipoint = 0; ipoint < _num_inserted_points; ipoint++) in VPS_adjust_extend_neighbors_of_all_points() local
806 void VPSApproximation::VPS_extend_neighbors(size_t ipoint) in VPS_extend_neighbors()
933 for (size_t ipoint = 0; ipoint < _num_inserted_points; ipoint++) in VPS_destroy_global_containers() local
[all …]
|
| /dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/ |
| H A D | negf_integr_cc.F | 121 INTEGER :: handle, icol, ipoint, irow, ncols, & local
202 INTEGER :: handle, ipoint local
245 INTEGER :: handle, ipoint, nnodes_exist, & local
329 INTEGER :: handle, ipoint, nnodes_exist, & local
424 INTEGER :: handle, icol, ipoint, irow, ncols_local, nintervals, nintervals_half, & local
|
| /dports/science/cp2k-data/cp2k-7.1.0/src/ |
| H A D | negf_integr_cc.F | 121 INTEGER :: handle, icol, ipoint, irow, ncols, & local
202 INTEGER :: handle, ipoint local
245 INTEGER :: handle, ipoint, nnodes_exist, & local
329 INTEGER :: handle, ipoint, nnodes_exist, & local
424 INTEGER :: handle, icol, ipoint, irow, ncols_local, nintervals, nintervals_half, & local
|
| /dports/science/pcmsolver/pcmsolver-1.3.0/tests/Fortran_host/ |
| H A D | Fortran_host-modules.f90 | 77 integer(c_int) :: ipoint local
133 integer(c_int) :: ipoint local
|
| /dports/graphics/wings/libigl-2.1.0/include/igl/copyleft/cgal/ |
| H A D | insert_into_cdt.cpp | 37 }else if(const Point_3 *ipoint = CGAL::object_cast<Point_3 >(&obj)) in insert_into_cdt() local
|
| /dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libigl/igl/copyleft/cgal/ |
| H A D | insert_into_cdt.cpp | 37 }else if(const Point_3 *ipoint = CGAL::object_cast<Point_3 >(&obj)) in insert_into_cdt() local
|
| /dports/science/dalton/dalton-66052b3af5ea7225e31178bf9a8b031913c72190/DALTON/pcm/ |
| H A D | pcm_write.F90 | 78 integer(4) :: ipoint local
127 integer(4) :: ipoint local
|
| /dports/science/afni/afni-AFNI_21.3.16/src/coxplot/ |
| H A D | zzchar.c | 58 static integer nu, nv, ipoint; in zzchar_() local
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFDebugFrame.cpp | 41 OS << "reg" << RegNum;
|