|
Lanelets | findUsages (const RegulatoryElementConstPtr ®Elem) |
|
ConstLanelets | findUsages (const RegulatoryElementConstPtr ®Elem) const |
|
std::vector< PrimitiveT > | findUsages (const traits::ConstPrimitiveType< traits::OwnedT< PrimitiveT >> &primitive) |
| finds usages of an owned type within this layer More...
|
|
std::vector< ConstPrimitiveT > | findUsages (const traits::ConstPrimitiveType< traits::OwnedT< PrimitiveT >> &primitive) const |
| finds usages of an owned type within this layer More...
|
|
| LaneletLayer ()=default |
|
| LaneletLayer (const LaneletLayer &)=delete |
|
LaneletLayer | operator= (LaneletLayer &)=delete |
|
| ~LaneletLayer ()=default |
|
iterator | begin () |
| iterator to beginning More...
|
|
const_iterator | begin () const |
| iterator to beginning of the elements (not ordered by id!) More...
|
|
bool | empty () const |
| returns whether this layer contains something More...
|
|
iterator | end () |
| iterator to end More...
|
|
const_iterator | end () const |
| iterator to end of the elements More...
|
|
bool | exists (Id id) const |
| checks whether an element exists in this layer More...
|
|
iterator | find (Id id) |
| non-const version of finding an element More...
|
|
const_iterator | find (Id id) const |
| find returns an iterator to an element if it exists More...
|
|
std::vector< PrimitiveT > | findUsages (const traits::ConstPrimitiveType< traits::OwnedT< PrimitiveT >> &primitive) |
| finds usages of an owned type within this layer More...
|
|
std::vector< ConstPrimitiveT > | findUsages (const traits::ConstPrimitiveType< traits::OwnedT< PrimitiveT >> &primitive) const |
| finds usages of an owned type within this layer More...
|
|
PrimitiveT | get (Id id) |
| returns an element for this id if it exists More...
|
|
ConstPrimitiveT | get (Id id) const |
| returns an element for this id if it exists More...
|
|
PrimitiveVec | nearest (const BasicPoint2d &point, unsigned n) |
|
ConstPrimitiveVec | nearest (const BasicPoint2d &point, unsigned n) const |
| search for the n nearest elements to a point More...
|
|
PrimitiveVec | nearest (const Point2d &point, unsigned n) |
|
ConstPrimitiveVec | nearest (const Point2d &point, unsigned n) const |
|
OptConstPrimitiveT | nearestUntil (const BasicPoint2d &point, const ConstSearchFunction &func) const |
| repeatedly calls a user-defined predicate until it returns true. More...
|
|
OptPrimitiveT | nearestUntil (const BasicPoint2d &point, const SearchFunction &func) |
|
OptConstPrimitiveT | nearestUntil (const ConstPoint2d &point, const ConstSearchFunction &func) const |
|
OptPrimitiveT | nearestUntil (const Point2d &point, const SearchFunction &func) |
|
PrimitiveLayer & | operator= (const PrimitiveLayer &rhs)=delete |
|
| PrimitiveLayer (const PrimitiveLayer &rhs)=delete |
|
| PrimitiveLayer (const PrimitiveLayer::Map &primitives) |
|
| PrimitiveLayer (const PrimitiveLayer::Map &primitives) |
|
PrimitiveVec | search (const BoundingBox2d &area) |
|
ConstPrimitiveVec | search (const BoundingBox2d &area) const |
| searches for elements within a search area More...
|
|
OptConstPrimitiveT | searchUntil (const BoundingBox2d &area, const ConstSearchFunction &func) const |
| searches within search area until a search function returns true. More...
|
|
OptPrimitiveT | searchUntil (const BoundingBox2d &area, const SearchFunction &func) |
|
size_t | size () const |
| returns number of elements in this layer More...
|
|
Id | uniqueId () const |
| returns a unique id. it is guaranteed that the id is not used within this layer More...
|
|
Specialized map layer for Lanelet.
Definition at line 286 of file LaneletMap.h.