42 if (
id[0] >= other.
id[0])
return true;
43 if (
id[0] == other.
id[0] &&
id[1] >= other.
id[1])
return true;
49 if (
id[0] > other.
id[0])
return true;
50 if (
id[0] == other.
id[0] &&
id[1] > other.
id[1])
return true;
56 if (
id[0] <= other.
id[0])
return true;
57 if (
id[0] == other.
id[0] &&
id[1] <= other.
id[1])
return true;
63 if (
id[0] < other.
id[0])
return true;
64 if (
id[0] == other.
id[0] &&
id[1] < other.
id[1])
return true;
70 return id[0] == other.
id[0] &&
id[1] == other.
id[1];
74 return id[0] != other.
id[0] ||
id[1] != other.
id[1];
85 v0 = v0 < v1 ? v0 : v1;
86 v1 = vt < v1 ? v1 : vt;
92 template<
typename TDataType>
96 typedef typename TDataType::Real
Real;
97 typedef typename TDataType::Coord
Coord;
DYN_FUNC bool operator!=(const EKey &other) const
DYN_FUNC bool isValid() const
DYN_FUNC EKey(PointType v0, PointType v1)
DYN_FUNC bool operator>(const EKey &other) const
DYN_FUNC bool operator<(const EKey &other) const
DYN_FUNC bool operator<=(const EKey &other) const
DYN_FUNC bool operator>=(const EKey &other) const
DYN_FUNC PointType operator[](unsigned int i)
DYN_FUNC void swap(PointType &v0, PointType &v1)
DYN_FUNC bool operator==(const EKey &other) const
DArrayList< int > & vertex2Edge()
Get the Ver2 Edge object.
void setEdges(DArray< Edge > &edges)
DArray< Edge > & getEdges()
Get all edges with each one containing the indices of two edge ends.
void copyFrom(EdgeSet< TDataType > &edgeSet)
virtual void updateEdges()
void loadSmeshFile(std::string filename)
DArrayList< int > mVer2Edge
void updateTopology() override
void requestPointNeighbors(DArrayList< int > &lists)
Request the neighboring ids of each point according to the mesh topology Be sure update() is called a...
void setEdges(std::vector< Edge > &edges)
TopologyModule::Edge Edge
VectorND< PointType, 2 > Edge
This is an implementation of AdditiveCCD based on peridyno.
Array< T, DeviceType::GPU > DArray
ArrayList< ElementType, DeviceType::GPU > DArrayList