edge Member List

This is the complete list of members for edge, including all inherited members.

centre(const UList< point > &pts) constedgeinline
clear()edgeinline
collapse()edgeinline
commonVertex(const edge &other) constedgeinline
compare(const edge &a, const edge &b)edgeinlinestatic
Pair< label >::compare(const Pair< label > &a, const Pair< label > &b)Pair< label >inlinestatic
connects(const edge &other) constedgeinline
count() constedgeinline
edge()edgeinline
edge(const label from, const label to)edgeinline
edge(const labelPair &pair)edgeinline
edge(const FixedList< label, 2 > &list)edgeinline
edge(const label from, const label to, const bool doSort)edgeinline
edge(const FixedList< label, 2 > &list, const bool doSort)edgeinline
edge(const UList< label > &list, const FixedList< label, 2 > &indices)edgeinline
edge(Istream &is)edgeinline
empty() constedgeinline
end() constedgeinline
end()edgeinline
erase(const label index)edgeinline
erase(InputIterator begIter, InputIterator endIter)edgeinline
erase(std::initializer_list< label > list)edgeinline
erase(const FixedList< label, N > &list)edgeinline
erase(const labelUList &list)edgeinline
erase(InputIterator begIter, InputIterator endIter)edgeinline
erase(const FixedList< label, N > &list)edgeinline
flip()Pair< label >inline
found(const label pointLabel) constedgeinline
hash_code(unsigned seed=0) constedgeinline
insert(const label index)edgeinline
insert(InputIterator begIter, InputIterator endIter)edgeinline
insert(std::initializer_list< label > list)edgeinline
insert(const FixedList< label, N > &list)edgeinline
insert(const labelUList &list)edgeinline
insert(InputIterator begIter, InputIterator endIter)edgeinline
insert(const FixedList< label, N > &list)edgeinline
line(const UList< point > &pts) constedgeinline
mag(const UList< point > &pts) constedgeinline
maxVertex() constedgeinline
minVertex() constedgeinline
operator[](const label i)edgeinline
operator[](const label i) constedgeinline
other(const label &a) constPair< label >inline
otherVertex(const label pointLabel) constedgeinline
Pair()=defaultPair< 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() constedgeinline
second() const noexceptPair< label >inline
second() noexceptPair< label >inline
sort()Pair< label >inline
sorted() constPair< label >inline
start() constedgeinline
start()edgeinline
typeNameedgestatic
unitVec(const UList< point > &pts) constedgeinline
valid() constedgeinline
vec(const UList< point > &pts) constedgeinline
which(const label pointLabel) constedgeinline