// File: IntPolyh_ArrayOfPoints.cxx // Created: Mon Mar 8 09:32:00 1999 // Author: Fabrice SERVANT // #include #include IntPolyh_ArrayOfPoints::IntPolyh_ArrayOfPoints() : n(0),fintp(0),ptr(0) { } IntPolyh_ArrayOfPoints::IntPolyh_ArrayOfPoints(const Standard_Integer N): fintp(0){ Init(N); } void IntPolyh_ArrayOfPoints::Init(const Standard_Integer N) { Destroy(); ptr = (void*) (new IntPolyh_Point [N]); n = N; } Standard_Integer IntPolyh_ArrayOfPoints::GetN() const { return(n); } Standard_Integer IntPolyh_ArrayOfPoints::NbPoints() const { return(fintp); } void IntPolyh_ArrayOfPoints::IncNbPoints() { fintp++; } void IntPolyh_ArrayOfPoints::SetNbPoints(const Standard_Integer endaop) { fintp = endaop; } # ifdef DEB #define BORNES 1 # endif const IntPolyh_Point& IntPolyh_ArrayOfPoints::Value(const Standard_Integer Index) const { IntPolyh_Point *ptrpoint = (IntPolyh_Point *)ptr; #if BORNES if(Index<0 || Index>=n) { cerr<<" Erreur1 "<=n) { cerr<<" Erreur1 "< %d\n",fintp-1); printf("size %d, room left%d", n, n-fintp); for(Standard_Integer i=0;i