Container of points. More...
#include <rpoints.h>
Public Member Functions | |
RPoints (void) | |
RPoints (const size_t max) | |
RPoints (const RPoints &points) | |
RPoint | FindLeft (const RPoint &pt, const RPolygons &polys) const |
RPoint | FindRight (const RPoint &pt, const RPolygons &polys) const |
RPoint | FindBottom (const RPoint &pt, const RPolygons &polys) const |
RPoint | FindUp (const RPoint &pt, const RPolygons &polys) const |
RPoint | FindBottomLeft (void) const |
bool | DuplicatePoints (void) const |
RPoints & | operator= (const RPoints &points) |
Public Member Functions inherited from RContainer< RPoint, true, false > | |
RContainer (size_t m, size_t i=0) | |
RContainer (const RContainer< RPoint, true, bOrder > &src) | |
RContainer (const RContainer< RPoint, false, bOrder > &src) | |
int | Compare (const RContainer< RPoint, bAlloc, bOrder > &) const |
size_t | GetNb (void) const |
size_t | GetMaxPos (void) const |
size_t | GetMaxNb (void) const |
size_t | GetIncNb (void) const |
bool | VerifyIndex (size_t idx) const |
void | VerifyTab (size_t max=0) |
void | Clear (size_t m=0, size_t i=0, bool force=false) |
void | ReOrder (int sortOrder(const void *, const void *), size_t min, size_t max) |
void | ReOrder (int sortOrder(const void *, const void *)) |
void | ReOrder (void) |
void | Exchange (size_t pos1, size_t pos2) |
void | Shift (size_t idx, bool reverse) |
void | Transfer (RContainer< RPoint, a, o > &src) |
RContainer & | operator= (const RContainer< RPoint, true, bOrder > &src) |
RContainer & | operator= (const RContainer< RPoint, false, bOrder > &src) |
void | Copy (const RContainer< RPoint, a, bOrder > &src) |
RContainer & | operator+= (const RContainer< RPoint, a, o > &src) |
size_t | GetIndex (const TUse &tag, bool &find, size_t min=0, size_t max=0) const |
bool | IsIn (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const |
bool | IsIn (const TUse &tag, size_t min=0, size_t max=0) const |
const RPoint * | operator[] (size_t idx) const |
RPoint * | operator[] (size_t idx) |
const RPoint * | GetPtrAt (size_t idx) const |
RPoint * | GetPtrAt (size_t idx) |
RPoint * | GetPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const |
RPoint * | GetPtr (const TUse &tag, size_t min=0, size_t max=0) const |
RPoint * | GetInsertPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) |
RPoint * | GetInsertPtr (const TUse &tag, size_t min=0, size_t max=0) |
RPoint * | GetInsertPtrAt (const TUse &tag, size_t pos) |
RContainer< RPoint, false, bOrder > * | GetPtrs (const TUse &tag, size_t min=0, size_t max=0) const |
size_t | GetTab (const void **tab, size_t min=0, size_t max=0) const |
size_t | GetTab (void **tab, size_t min=0, size_t max=0) |
size_t | GetTab (const RPoint **tab, size_t min=0, size_t max=0) const |
size_t | GetTab (RPoint **tab, size_t min=0, size_t max=0) |
void | InsertPtrAt (RPoint *ins, size_t pos, bool del) |
void | InsertPtrAt (RPoint *ins, size_t pos) |
void | InsertPtr (RPoint *ins, bool del=false, size_t min=0, size_t max=0) |
void | DeletePtrAt (size_t pos, bool shift, bool del) |
void | DeletePtrAt (size_t pos, bool shift) |
void | DeletePtrAt (size_t pos) |
void | DeletePtr (const TUse &tag, bool sortkey, bool del, size_t min=0, size_t max=0) |
void | DeletePtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) |
void | DeletePtr (const TUse &tag, size_t min=0, size_t max=0) |
void | Inter (const iRContainer< RPoint > &src1, const iRContainer< RPoint > &src2) |
void | Union (const iRContainer< RPoint > &src1, const iRContainer< RPoint > &src2) |
virtual | ~RContainer (void) |
Public Member Functions inherited from iRContainer< RPoint > | |
size_t | GetNb (void) const |
size_t | GetMaxPos (void) const |
size_t | GetMaxNb (void) const |
size_t | GetIncNb (void) const |
bool | VerifyIndex (size_t idx) const |
void | VerifyTab (size_t max=0) |
void | Clear (size_t m=0, size_t i=0, bool force=false) |
void | ReOrder (int sortOrder(const void *, const void *), size_t min, size_t max) |
void | ReOrder (int sortOrder(const void *, const void *)) |
void | ReOrder (void) |
void | Exchange (size_t pos1, size_t pos2) |
void | Shift (size_t idx, bool reverse) |
void | Transfer (iRContainer< RPoint > &src) |
iRContainer & | operator= (const iRContainer< RPoint > &src) |
void | Copy (const iRContainer< RPoint > &src) |
iRContainer & | operator+= (const iRContainer< RPoint > &src) |
size_t | GetIndex (bool order, const TUse &tag, bool &find, size_t min=0, size_t max=0) const |
size_t | GetIndex (const TUse &tag, bool &find, size_t min=0, size_t max=0) const |
bool | IsIn (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const |
bool | IsIn (const TUse &tag, size_t min=0, size_t max=0) const |
const RPoint * | operator[] (size_t idx) const |
RPoint * | operator[] (size_t idx) |
const RPoint * | GetPtrAt (size_t idx) const |
RPoint * | GetPtrAt (size_t idx) |
RPoint * | GetPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const |
RPoint * | GetPtr (const TUse &tag, size_t min=0, size_t max=0) const |
RPoint * | GetInsertPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) |
RPoint * | GetInsertPtr (const TUse &tag, size_t min=0, size_t max=0) |
RPoint * | GetInsertPtrAt (const TUse &tag, size_t pos) |
size_t | GetTab (const void **tab, size_t min=0, size_t max=0) const |
size_t | GetTab (void **tab, size_t min=0, size_t max=0) |
size_t | GetTab (const RPoint **tab, size_t min=0, size_t max=0) const |
size_t | GetTab (RPoint **tab, size_t min=0, size_t max=0) |
void | InsertPtrAt (RPoint *ins, size_t pos, bool del) |
void | InsertPtrAt (RPoint *ins, size_t pos) |
void | InsertPtr (RPoint *ins, bool del=false, size_t min=0, size_t max=0) |
void | DeletePtrAt (size_t pos, bool shift, bool del) |
void | DeletePtrAt (size_t pos, bool shift) |
void | DeletePtrAt (size_t pos) |
void | DeletePtr (const TUse &tag, bool sortkey, bool del, size_t min=0, size_t max=0) |
void | DeletePtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) |
void | DeletePtr (const TUse &tag, size_t min=0, size_t max=0) |
void | Inter (const iRContainer< RPoint > &src1, const iRContainer< RPoint > &src2) |
void | Union (const iRContainer< RPoint > &src1, const iRContainer< RPoint > &src2) |
virtual | ~iRContainer (void) |
Additional Inherited Members | |
Static Public Member Functions inherited from RContainer< RPoint, true, false > | |
static int | SortOrder (const void *a, const void *b) |
Static Public Member Functions inherited from iRContainer< RPoint > | |
static int | SortOrder (const void *a, const void *b) |
Protected Member Functions inherited from iRContainer< RPoint > | |
void | Create (const iRContainer< RPoint > &src) |
iRContainer & | NormalCopy (const iRContainer< RPoint > &src) |
void | DeepCopy (const iRContainer< RPoint > &src) |
iRContainer & | Add (const iRContainer< RPoint > &src) |
Protected Attributes inherited from iRContainer< RPoint > | |
RPoint ** | Tab |
size_t | NbPtr |
size_t | MaxPtr |
size_t | LastPtr |
size_t | IncPtr |
Detailed Description
Container of points.
This class represents a set of points regrouped in a container.
Constructor & Destructor Documentation
RPoints | ( | void | ) |
Construct a container of points.
RPoints | ( | const size_t | max | ) |
Construct a container of points with an initial maximal size.
- Parameters
-
max Initial maximal size of the container.
Construct a container of points from another one.
- Parameters
-
points The container used as reference.
Member Function Documentation
Find the next point to the left and that is on a vertex of a polygon from a given set. This function is used to calculated the union of polygons.
- Parameters
-
pt Point used as reference. polys The polygons used as reference.
Find the next point to the right and that is on a vertex of a polygon from a given set. This function is used to calculated the union of polygons.
- Parameters
-
pt Point used as reference. polys The polygons used as reference.
Find the next point to the bottom and that is on a vertex of a polygon from a given set. This function is used to calculated the union of polygons.
- Parameters
-
pt Point used as reference. polys The polygons used as reference.
Find the next point to the up and that is on a vertex of a polygon from a given set. This function is used to calculated the union of polygons.
- Parameters
-
pt Point used as reference. polys The polygons used as reference.
RPoint FindBottomLeft | ( | void | ) | const |
Find the most bottom-left point of the container.
bool DuplicatePoints | ( | void | ) | const |
This function returns true when there are duplicate points.