| 67 | } |
| 68 | |
| 69 | bool TrianglesInfo::ListInfo::Add(int p0, int p1, int p2) |
| 70 | { |
| 71 | int const trg = static_cast<int>(m_triangles.size()); |
| 72 | if (!AddNeighbour(p0, p1, trg) || !AddNeighbour(p1, p2, trg) || !AddNeighbour(p2, p0, trg)) |
| 73 | { |
| 74 | LOG(LERROR, ("Duplicating triangle {", p0, p1, p2, "}")); |
| 75 | return false; |
| 76 | } |
| 77 | |
| 78 | m_triangles.emplace_back(p0, p1, p2); |
| 79 | return true; |
| 80 | } |
| 81 | |
| 82 | template <class IterT> |
| 83 | size_t GetBufferSize(IterT b, IterT e) |
no test coverage detected