15#ifndef SEAMS_TOPO_BULK_H_
16#define SEAMS_TOPO_BULK_H_
53 std::string path,
const std::vector<std::vector<int>> &rings,
54 const std::vector<std::vector<int>> &nList,
63[[nodiscard]]
int topoBulkAnalysis(std::string path,
const std::vector<std::vector<int>> &rings,
64 const std::vector<std::vector<int>> &nList,
66 int firstFrame,
bool onlyTetrahedral =
true);
102 bool withRows =
true);
106 const std::vector<std::vector<int>> &rings,
112[[nodiscard]] std::vector<int>
120 const std::vector<std::vector<int>> &rings,
125 std::vector<std::vector<int>> &&rings,
134 const std::vector<std::vector<int>> &rings,
140std::vector<int>
findDDC(
const std::vector<std::vector<int>> &rings,
141 std::vector<strucType> &ringType,
142 const std::vector<int> &listHC,
143 std::vector<cage::Cage> &cageList);
178 [[nodiscard]]
int idAt(
int k)
const {
182 void put(
int k,
int value) {
196[[nodiscard]] std::vector<int>
202std::vector<int>
findDDC(
const std::vector<std::vector<int>> &rings,
203 std::vector<strucType> &ringType,
204 const std::vector<int> &listHC,
205 std::vector<cage::Cage> &cageList,
213 std::vector<strucType> &ringType,
214 std::vector<int> &listDDC,
215 std::vector<int> &listHC);
219std::vector<int>
findHC(
const std::vector<std::vector<int>> &rings,
220 std::vector<strucType> &ringType,
221 const std::vector<std::vector<int>> &nList,
222 std::vector<cage::Cage> &cageList);
225std::vector<int>
findHC(
const std::vector<std::vector<int>> &rings,
226 std::vector<strucType> &ringType,
227 const std::vector<std::vector<int>> &nList,
228 std::vector<cage::Cage> &cageList,
234 std::vector<int> &peripheralRings,
int iring);
238 std::vector<int> &peripheralRings,
int iring,
251 std::vector<int> *peripheralUnion,
252 std::vector<int> *chosen =
nullptr,
253 const std::vector<int> *rank =
nullptr,
259 void build(
const std::vector<std::vector<int>> &nList);
262 void row(
int i,
const int *&begin,
const int *&end)
const {
263 if (
static_cast<unsigned>(i) >=
static_cast<unsigned>(n_) || off_.empty()) {
268 begin = cols_.data() + off_[
static_cast<std::size_t
>(i)];
269 end = cols_.data() + off_[
static_cast<std::size_t
>(i + 1)];
273 const int *begin =
nullptr;
274 const int *end =
nullptr;
276 if (begin ==
nullptr) {
279 return std::binary_search(begin, end, j);
285 std::vector<int> off_;
286 std::vector<int> cols_;
294 const std::vector<int> &basal1,
295 const std::vector<int> &basal2);
299 const std::vector<int> &basal2);
304 std::vector<int> &triplet,
int atomOne,
int atomTwo);
309 std::vector<int> &triplet,
310 const std::vector<int> &
ring);
313[[nodiscard]]
int findPrismatic(
const std::vector<std::vector<int>> &rings, std::vector<int> &listHC,
314 std::vector<strucType> &ringType,
int iring,
int jring,
315 std::vector<int> &prismaticRings);
319 std::vector<int> &listHC,
320 std::vector<strucType> &ringType,
int iring,
321 int jring, std::vector<int> &prismaticRings,
327 const std::vector<ring::strucType> &ringType,
328 std::vector<cage::iceType> &atomTypes);
332 const std::vector<cage::Cage> &cageList,
int &numHC,
int &numDDC,
333 int &mixedRings,
int &prismaticRings,
int &basalRings);
373 std::vector<ring::strucType> &ringType,
374 const std::vector<std::vector<int>> &nList,
376 std::vector<double> &rmsdPerAtom,
double heightCutoff = 8);
381 std::vector<int> &basal1, std::vector<int> &basal2);
386 std::vector<int> &basal1, std::vector<int> &basal2);
391 const std::vector<int> &basal1,
const std::vector<int> &basal2,
double heightCutoff = 8);
File for cage types for topological network criteria.
Membership of the neighbour rows after the leading self entry.
void row(int i, const int *&begin, const int *&end) const
void build(const std::vector< std::vector< int > > &nList)
bool operator()(int i, int j) const
The main molecular system handler.
int findBulkPrisms(const std::vector< std::vector< int > > &rings, std::vector< ring::strucType > &ringType, const std::vector< std::vector< int > > &nList, molSys::PointCloud< molSys::Point< double >, double > &yCloud, std::vector< double > &rmsdPerAtom, double heightCutoff=8)
Find out which rings are prisms.
bool basalPrismConditions(const std::vector< std::vector< int > > &nList, std::vector< int > &basal1, std::vector< int > &basal2)
bool relaxedPrismConditions(const std::vector< std::vector< int > > &nList, std::vector< int > &basal1, std::vector< int > &basal2)
bool basalRingsSeparation(molSys::PointCloud< molSys::Point< double >, double > &yCloud, const std::vector< int > &basal1, const std::vector< int > &basal2, double heightCutoff=8)
Check to see that candidate basal prisms are not really far from each other.
Topological network criteria functions.
bool equatorialConditions(const std::vector< std::vector< int > > &rings, int iring, const RingSearchIndex &index, std::vector< int > *peripheralUnion, std::vector< int > *chosen=nullptr, const std::vector< int > *rank=nullptr, EquatorChoice *raw=nullptr)
bool basalConditions(const std::vector< std::vector< int > > &nList, const std::vector< int > &basal1, const std::vector< int > &basal2)
std::vector< std::vector< int > > contractibleRings(const std::vector< std::vector< int > > &rings, const molSys::PointCloud< molSys::Point< double >, double > &yCloud)
bool basalNeighbours(const std::vector< std::vector< int > > &nList, std::vector< int > &triplet, int atomOne, int atomTwo)
int getAtomTypesTopoBulk(const std::vector< std::vector< int > > &rings, const std::vector< ring::strucType > &ringType, std::vector< cage::iceType > &atomTypes)
int bulkPolygonRingAnalysis(std::string path, const std::vector< std::vector< int > > &rings, const std::vector< std::vector< int > > &nList, molSys::PointCloud< molSys::Point< double >, double > &yCloud, int maxDepth, int firstFrame)
std::vector< int > findDDC(const std::vector< std::vector< int > > &rings, std::vector< strucType > &ringType, const std::vector< int > &listHC, std::vector< cage::Cage > &cageList)
std::vector< int > positionRank(const molSys::PointCloud< molSys::Point< double >, double > &yCloud)
int findPrismatic(const std::vector< std::vector< int > > &rings, std::vector< int > &listHC, std::vector< strucType > &ringType, int iring, int jring, std::vector< int > &prismaticRings)
Finds the prismatic rings from basal rings iring and jring.
void releaseEquatorOverflow()
bool notNeighboursOfRing(const std::vector< std::vector< int > > &nList, std::vector< int > &triplet, const std::vector< int > &ring)
std::vector< int > findMixedRings(const std::vector< std::vector< int > > &rings, std::vector< strucType > &ringType, std::vector< int > &listDDC, std::vector< int > &listHC)
DdcSplit lastDdcSplit()
Order, equatorial test and packing from the last findDDC call.
bool conditionOneDDC(const std::vector< std::vector< int > > &rings, std::vector< int > &peripheralRings, int iring)
int equatorChoiceOverflow(const struct EquatorChoice *self, int at)
void equatorChoiceOverflowPut(struct EquatorChoice *self, int at, int value)
std::vector< std::vector< int > > cageRings(const std::vector< std::vector< int > > &rings, const molSys::PointCloud< molSys::Point< double >, double > &yCloud, double cutoff)
int getStrucNumbers(const std::vector< ring::strucType > &ringType, const std::vector< cage::Cage > &cageList, int &numHC, int &numDDC, int &mixedRings, int &prismaticRings, int &basalRings)
Determines the number of HCs, DDCs, Mixed rings, prismatic and basal rings.
RingSearchIndex buildRingSearchIndex(const std::vector< std::vector< int > > &rings, int numAtoms, bool withRows=true)
PackParts lastPackParts()
Conflict build, clique ids, matching and branch-and-bound from the last pack.
int topoBulkAnalysis(std::string path, const std::vector< std::vector< int > > &rings, const std::vector< std::vector< int > > &nList, molSys::PointCloud< molSys::Point< double >, double > &yCloud, int firstFrame, bool onlyTetrahedral=true)
std::vector< int > maximumEquators(const std::vector< EquatorChoice > &periph, const std::vector< int > &order, PackingCertificate *certificate)
std::vector< int > findHC(const std::vector< std::vector< int > > &rings, std::vector< strucType > &ringType, const std::vector< std::vector< int > > &nList, std::vector< cage::Cage > &cageList)
File containing common functions used by bulk and confined topological network critera.
This contains a collection of points; contains information for a particular frame.
This contains per-particle information.
void put(int k, int value)
Proof that the reported number of equatorial rings is maximum.
Inverted index from an atom to the rings that contain it.
std::vector< int > ringOff
int atomCount() const
Atoms the packed rows cover.
std::vector< std::array< int, 3 > > ringShift
Integer minimum-image winding of each ring. Empty if no box was supplied.
std::vector< int > atomRank
std::vector< std::vector< int > > ringsContainingAtom
std::vector< int > ringCol