29 { offsetsPtr_ = &offsets; }
32 { nextCellPtr_ = &nextCell; }
56 while (atom < begin_ + nAtom_) {
61 for (
int i = -1; i <= 1; i++)
62 for (
int j = -1; j <= 1; j++)
63 for (
int k = -1; k <= 1; k++) {
66 if (!(i == 0 && j == 0 && k == 0)) {
67 offset += ((i == 0) ? 0 : ((i > 0) ? (*offsetsPtr_)[0].first : (*offsetsPtr_)[0].second));
68 offset += ((j == 0) ? 0 : ((j > 0) ? (*offsetsPtr_)[1].first : (*offsetsPtr_)[1].second));
69 offset += ((k == 0) ? 0 : ((k > 0) ? (*offsetsPtr_)[2].first : (*offsetsPtr_)[2].second));
71 if ((
this +offset)->id_ >= id_) {
72 atom = (
this + offset)->begin_;
73 while (atom < (
this + offset)->begin_ + (
this + offset)->nAtom_) {
void clear()
Set logical size to zero.
void append(const Data &data)
Append data to the end of the array.
A fixed capacity (static) contiguous array with a variable logical size.
Utility classes for scientific computation.