1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103
|
/* Ergo, version 3.8, a program for linear scaling electronic structure
* calculations.
* Copyright (C) 2019 Elias Rudberg, Emanuel H. Rubensson, Pawel Salek,
* and Anastasia Kruchinina.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* Primary academic reference:
* Ergo: An open-source program for linear-scaling electronic structure
* calculations,
* Elias Rudberg, Emanuel H. Rubensson, Pawel Salek, and Anastasia
* Kruchinina,
* SoftwareX 7, 107 (2018),
* <http://dx.doi.org/10.1016/j.softx.2018.03.005>
*
* For further information about Ergo, see <http://www.ergoscf.org>.
*/
/** @file SizesAndBlocks.cc
\brief Class used to keep track of the block sizes used at
different levels in the hierarchical matrix data structure.
*/
#include "SizesAndBlocks.h"
namespace mat{
SizesAndBlocks::SizesAndBlocks(SizesAndBlocks const & other)
: blockSizes(other.blockSizes),
nBlocks(other.nBlocks),
nScalars(other.nScalars),
offset(other.offset),
nTotalScalars(other.nTotalScalars) {}
SizesAndBlocks& SizesAndBlocks::operator=
(SizesAndBlocks const & other) {
nBlocks = other.nBlocks;
nScalars = other.nScalars;
offset = other.offset;
nTotalScalars = other.nTotalScalars;
blockSizes = other.blockSizes;
return *this;
}
bool SizesAndBlocks::operator==(SizesAndBlocks const & other) const {
bool isEqual =
(blockSizes.size() == other.blockSizes.size()) &&
(nBlocks == other.nBlocks) &&
(nScalars == other.nScalars) &&
(offset == other.offset) &&
(nTotalScalars == other.nTotalScalars);
if (isEqual)
for (unsigned int i = 0; i < blockSizes.size(); i++)
isEqual = isEqual &&
(blockSizes[i] == other.blockSizes[i]);
return isEqual;
}
SizesAndBlocks SizesAndBlocks::
getSizesAndBlocksForLowerLevel(int const blockNumber) const {
assert(blockSizes.size() > 1);
int nScalLowLev;
if ((blockNumber+1) * blockSizes[0] > nScalars)
nScalLowLev = nScalars - blockNumber * blockSizes[0];
else
nScalLowLev = blockSizes[0];
std::vector<int> nextBlockSizes(blockSizes.begin() + 1, blockSizes.end());
assert(offset + blockNumber * blockSizes[0] + nScalLowLev <= nTotalScalars);
return SizesAndBlocks(nextBlockSizes,
nScalLowLev,
offset + blockNumber * blockSizes[0],
nTotalScalars);
}
void SizesAndBlocks::
getBlockSizeVector(std::vector<int> & blockSizesCopy) const {
blockSizesCopy = blockSizes;
}
void SizesAndBlocks::setup(std::vector<int> const & blockSizesInp) {
blockSizes = blockSizesInp;
assert(!blockSizes.empty());
assert(blockSizes[blockSizes.size()-1]);
for (unsigned int ind = 0; ind < blockSizes.size()-1; ind++)
assert(blockSizes[ind] >= blockSizes[ind+1]);
nBlocks = nScalars/blockSizes[0]; /* Integer division. */
if (nScalars%blockSizes[0])
++nBlocks;
}
} /* end namespace mat */
|