|
virtual CoordinateSequence * | clone () const =0 |
| Returns a deep copy of this collection.
|
|
virtual const Coordinate & | getAt (std::size_t i) const =0 |
| Returns a read-only reference to Coordinate at position i. More...
|
|
const Coordinate & | back () const |
| Return last Coordinate in the sequence.
|
|
const Coordinate & | front () const |
| Return first Coordinate in the sequence.
|
|
const Coordinate & | operator[] (std::size_t i) const |
|
virtual void | getAt (std::size_t i, Coordinate &c) const =0 |
| Write Coordinate at position i to given Coordinate.
|
|
virtual std::size_t | getSize () const =0 |
| Returns the number of Coordinates (actual or otherwise, as this implementation may not store its data in Coordinate objects).
|
|
size_t | size () const |
|
virtual const std::vector
< Coordinate > * | toVector () const =0 |
| Returns a read-only vector with the Coordinates in this collection. More...
|
|
virtual void | toVector (std::vector< Coordinate > &coords) const =0 |
| Pushes all Coordinates of this sequence onto the provided vector. More...
|
|
void | add (const std::vector< Coordinate > *vc, bool allowRepeated) |
| Add an array of coordinates. More...
|
|
void | add (const CoordinateSequence *cl, bool allowRepeated, bool direction) |
| Add an array of coordinates. More...
|
|
virtual void | add (const Coordinate &c, bool allowRepeated) |
| Add a coordinate. More...
|
|
virtual void | add (std::size_t i, const Coordinate &coord, bool allowRepeated)=0 |
| Inserts the specified coordinate at the specified position in this list. More...
|
|
virtual bool | isEmpty () const =0 |
| Returns true it list contains no coordinates.
|
|
virtual void | add (const Coordinate &c)=0 |
| Add a Coordinate to the list.
|
|
virtual void | setAt (const Coordinate &c, std::size_t pos)=0 |
| Get a reference to Coordinate at position pos. More...
|
|
virtual void | deleteAt (std::size_t pos)=0 |
| Delete Coordinate at position pos (list will shrink).
|
|
virtual std::string | toString () const =0 |
| Get a string rapresentation of CoordinateSequence.
|
|
virtual void | setPoints (const std::vector< Coordinate > &v)=0 |
| Substitute Coordinate list with a copy of the given vector.
|
|
bool | hasRepeatedPoints () const |
| Returns true if contains any two consecutive points.
|
|
const Coordinate * | minCoordinate () const |
| Returns lower-left Coordinate in list.
|
|
virtual CoordinateSequence & | removeRepeatedPoints ()=0 |
| Remove consecutive equal Coordinates from the sequence. More...
|
|
virtual std::size_t | getDimension () const =0 |
|
virtual double | getOrdinate (std::size_t index, std::size_t ordinateIndex) const =0 |
|
virtual double | getX (std::size_t index) const |
|
virtual double | getY (std::size_t index) const |
|
virtual void | setOrdinate (std::size_t index, std::size_t ordinateIndex, double value)=0 |
|
virtual void | expandEnvelope (Envelope &env) const |
|
virtual void | apply_rw (const CoordinateFilter *filter)=0 |
|
virtual void | apply_ro (CoordinateFilter *filter) const =0 |
|
template<class T > |
void | applyCoordinateFilter (T &f) |
| Apply a fiter to each Coordinate of this sequence. The filter is expected to provide a .filter(Coordinate&) method. More...
|
|
The internal representation of a list of coordinates inside a Geometry.
There are some cases in which you might want Geometries to store their points using something other than the GEOS Coordinate class. For example, you may want to experiment with another implementation, such as an array of Xs and an array of Ys. or you might want to use your own coordinate class, one that supports extra attributes like M-values.
You can do this by implementing the CoordinateSequence and CoordinateSequenceFactory interfaces. You would then create a GeometryFactory parameterized by your CoordinateSequenceFactory, and use this GeometryFactory to create new Geometries. All of these new Geometries will use your CoordinateSequence implementation.
static int geos::geom::CoordinateSequence::increasingDirection |
( |
const CoordinateSequence & |
pts | ) |
|
|
static |
Determines which orientation of the Coordinate array is (overall) increasing.
In other words, determines which end of the array is "smaller" (using the standard ordering on Coordinate). Returns an integer indicating the increasing direction. If the sequence is a palindrome, it is defined to be oriented in a positive direction.
- Parameters
-
pts | the array of Coordinates to test |
- Returns
1
if the array is smaller at the start or is a palindrome, -1
if smaller at the end
NOTE: this method is found in CoordinateArrays class for JTS
virtual const std::vector<Coordinate>* geos::geom::CoordinateSequence::toVector |
( |
| ) |
const |
|
pure virtual |
Returns a read-only vector with the Coordinates in this collection.
Whether or not the Coordinates returned are the actual underlying Coordinates or merely copies depends on the implementation. Note that if this implementation does not store its data as an array of Coordinates, this method will incur a performance penalty because the array needs to be built from scratch.
This method is a port of the toCoordinateArray() method of JTS. It is not much used as memory management requires us to know wheter we should or not delete the returned object in a consistent way. Our options are: use shared_ptr<Coordinate> or always keep ownerhips of an eventual newly created vector. We opted for the second, so the returned object is a const, to also ensure that returning an internal pointer doesn't make the object mutable.
- Deprecated:
- use toVector(std::vector<Coordinate>&) instead
Implemented in geos::geom::CoordinateArraySequence.