This is the complete list of members for edge, including all inherited members.
| centre(const UList< point > &pts) const | edge | inline |
| clear() | edge | inline |
| collapse() | edge | inline |
| commonVertex(const edge &other) const | edge | inline |
| compare(const edge &a, const edge &b) | edge | inlinestatic |
| Pair< label >::compare(const Pair< label > &a, const Pair< label > &b) | Pair< label > | inlinestatic |
| connects(const edge &other) const | edge | inline |
| count() const | edge | inline |
| edge() | edge | inline |
| edge(const label from, const label to) | edge | inline |
| edge(const labelPair &pair) | edge | inline |
| edge(const FixedList< label, 2 > &list) | edge | inline |
| edge(const label from, const label to, const bool doSort) | edge | inline |
| edge(const FixedList< label, 2 > &list, const bool doSort) | edge | inline |
| edge(const UList< label > &list, const FixedList< label, 2 > &indices) | edge | inline |
| edge(Istream &is) | edge | inline |
| empty() const | edge | inline |
| end() const | edge | inline |
| end() | edge | inline |
| erase(const label index) | edge | inline |
| erase(InputIterator begIter, InputIterator endIter) | edge | inline |
| erase(std::initializer_list< label > list) | edge | inline |
| erase(const FixedList< label, N > &list) | edge | inline |
| erase(const labelUList &list) | edge | inline |
| erase(InputIterator begIter, InputIterator endIter) | edge | inline |
| erase(const FixedList< label, N > &list) | edge | inline |
| flip() | Pair< label > | inline |
| found(const label pointLabel) const | edge | inline |
| hashval(unsigned seed=0) const | edge | inline |
| insert(const label index) | edge | inline |
| insert(InputIterator begIter, InputIterator endIter) | edge | inline |
| insert(std::initializer_list< label > list) | edge | inline |
| insert(const FixedList< label, N > &list) | edge | inline |
| insert(const labelUList &list) | edge | inline |
| insert(InputIterator begIter, InputIterator endIter) | edge | inline |
| insert(const FixedList< label, N > &list) | edge | inline |
| line(const UList< point > &pts) const | edge | inline |
| mag(const UList< point > &pts) const | edge | inline |
| maxVertex() const | edge | inline |
| minVertex() const | edge | inline |
| operator[](const label i) | edge | inline |
| operator[](const label i) const | edge | inline |
| other(const label &a) const | Pair< label > | inline |
| otherVertex(const label pointLabel) const | edge | inline |
| Pair()=default | Pair< label > | |
| Pair(const label &f, const label &s) | Pair< label > | inline |
| Pair(label &&f, label &&s) | Pair< label > | inline |
| Pair(const std::pair< label, label > &vals) | Pair< label > | inline |
| Pair(std::pair< label, label > &&vals) | Pair< label > | inline |
| Pair(const FixedList< label, 2 > &list) | Pair< label > | inline |
| Pair(const label &f, const label &s, const bool doSort) | Pair< label > | inline |
| Pair(const FixedList< label, 2 > &list, const bool doSort) | Pair< label > | inline |
| Pair(Istream &is) | Pair< label > | inlineexplicit |
| reverseEdge() const | edge | inline |
| second() const noexcept | Pair< label > | inline |
| second() noexcept | Pair< label > | inline |
| sort() | Pair< label > | inline |
| sorted() const | Pair< label > | inline |
| start() const | edge | inline |
| start() | edge | inline |
| typeName | edge | static |
| unitVec(const UList< point > &pts) const | edge | inline |
| valid() const | edge | inline |
| vec(const UList< point > &pts) const | edge | inline |
| which(const label pointLabel) const | edge | inline |