Format using BORG conventions
dellaert
parent
b7cbc7a66f
commit
99947c7c6d
|
|
@ -22,209 +22,242 @@
|
||||||
|
|
||||||
namespace gtsam {
|
namespace gtsam {
|
||||||
|
|
||||||
// Forward declarations
|
// Forward declarations
|
||||||
class SymmetricBlockMatrix;
|
class SymmetricBlockMatrix;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* This class stores a dense matrix and allows it to be accessed as a collection of vertical
|
||||||
|
* blocks. The dimensions of the blocks are provided when constructing this class.
|
||||||
|
*
|
||||||
|
* This class also has three parameters that can be changed after construction that change the
|
||||||
|
* apparent view of the matrix without any reallocation or data copying. firstBlock() determines
|
||||||
|
* the block that has index 0 for all operations (except for re-setting firstBlock()). rowStart()
|
||||||
|
* determines the apparent first row of the matrix for all operations (except for setting
|
||||||
|
* rowStart() and rowEnd()). rowEnd() determines the apparent exclusive (one-past-the-last) last
|
||||||
|
* row for all operations. To include all rows, rowEnd() should be set to the number of rows in
|
||||||
|
* the matrix (i.e. one after the last true row index).
|
||||||
|
*
|
||||||
|
* @addtogroup base */
|
||||||
|
class GTSAM_EXPORT VerticalBlockMatrix {
|
||||||
|
public:
|
||||||
|
typedef VerticalBlockMatrix This;
|
||||||
|
typedef Eigen::Block<Matrix> Block;
|
||||||
|
typedef Eigen::Block<const Matrix> constBlock;
|
||||||
|
|
||||||
|
protected:
|
||||||
|
Matrix matrix_; ///< The full matrix
|
||||||
|
FastVector<DenseIndex> variableColOffsets_; ///< the starting columns of each block (0-based)
|
||||||
|
|
||||||
|
DenseIndex rowStart_; ///< Changes apparent matrix view, see main class comment.
|
||||||
|
DenseIndex rowEnd_; ///< Changes apparent matrix view, see main class comment.
|
||||||
|
DenseIndex blockStart_; ///< Changes apparent matrix view, see main class comment.
|
||||||
|
|
||||||
|
public:
|
||||||
|
|
||||||
|
/** Construct an empty VerticalBlockMatrix */
|
||||||
|
VerticalBlockMatrix() :
|
||||||
|
rowStart_(0), rowEnd_(0), blockStart_(0) {
|
||||||
|
variableColOffsets_.push_back(0);
|
||||||
|
assertInvariants();
|
||||||
|
}
|
||||||
|
|
||||||
|
/** Construct from a container of the sizes of each vertical block. */
|
||||||
|
template<typename CONTAINER>
|
||||||
|
VerticalBlockMatrix(const CONTAINER& dimensions, DenseIndex height) :
|
||||||
|
rowStart_(0), rowEnd_(height), blockStart_(0) {
|
||||||
|
fillOffsets(dimensions.begin(), dimensions.end());
|
||||||
|
matrix_.resize(height, variableColOffsets_.back());
|
||||||
|
assertInvariants();
|
||||||
|
}
|
||||||
|
|
||||||
|
/** Construct from a container of the sizes of each vertical block and a pre-prepared matrix. */
|
||||||
|
template<typename CONTAINER>
|
||||||
|
VerticalBlockMatrix(const CONTAINER& dimensions, const Matrix& matrix) :
|
||||||
|
matrix_(matrix), rowStart_(0), rowEnd_(matrix.rows()), blockStart_(0) {
|
||||||
|
fillOffsets(dimensions.begin(), dimensions.end());
|
||||||
|
if (variableColOffsets_.back() != matrix_.cols())
|
||||||
|
throw std::invalid_argument(
|
||||||
|
"Requested to create a VerticalBlockMatrix with dimensions that do not sum to the total columns of the provided matrix.");
|
||||||
|
assertInvariants();
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* This class stores a dense matrix and allows it to be accessed as a collection of vertical
|
* Construct from iterator over the sizes of each vertical block. */
|
||||||
* blocks. The dimensions of the blocks are provided when constructing this class.
|
template<typename ITERATOR>
|
||||||
*
|
VerticalBlockMatrix(ITERATOR firstBlockDim, ITERATOR lastBlockDim,
|
||||||
* This class also has three parameters that can be changed after construction that change the
|
DenseIndex height) :
|
||||||
* apparent view of the matrix without any reallocation or data copying. firstBlock() determines
|
rowStart_(0), rowEnd_(height), blockStart_(0) {
|
||||||
* the block that has index 0 for all operations (except for re-setting firstBlock()). rowStart()
|
fillOffsets(firstBlockDim, lastBlockDim);
|
||||||
* determines the apparent first row of the matrix for all operations (except for setting
|
matrix_.resize(height, variableColOffsets_.back());
|
||||||
* rowStart() and rowEnd()). rowEnd() determines the apparent exclusive (one-past-the-last) last
|
assertInvariants();
|
||||||
* row for all operations. To include all rows, rowEnd() should be set to the number of rows in
|
}
|
||||||
* the matrix (i.e. one after the last true row index).
|
|
||||||
*
|
|
||||||
* @addtogroup base */
|
|
||||||
class GTSAM_EXPORT VerticalBlockMatrix
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
typedef VerticalBlockMatrix This;
|
|
||||||
typedef Eigen::Block<Matrix> Block;
|
|
||||||
typedef Eigen::Block<const Matrix> constBlock;
|
|
||||||
|
|
||||||
protected:
|
/** Copy the block structure and resize the underlying matrix, but do not copy the matrix data.
|
||||||
Matrix matrix_; ///< The full matrix
|
* If blockStart(), rowStart(), and/or rowEnd() have been modified, this copies the structure of
|
||||||
FastVector<DenseIndex> variableColOffsets_; ///< the starting columns of each block (0-based)
|
* the corresponding matrix view. In the destination VerticalBlockView, blockStart() and
|
||||||
|
* rowStart() will thus be 0, rowEnd() will be cols() of the source VerticalBlockView, and the
|
||||||
|
* underlying matrix will be the size of the view of the source matrix. */
|
||||||
|
static VerticalBlockMatrix LikeActiveViewOf(const VerticalBlockMatrix& rhs);
|
||||||
|
|
||||||
DenseIndex rowStart_; ///< Changes apparent matrix view, see main class comment.
|
/** Copy the block structure, but do not copy the matrix data. If blockStart() has been
|
||||||
DenseIndex rowEnd_; ///< Changes apparent matrix view, see main class comment.
|
* modified, this copies the structure of the corresponding matrix view. In the destination
|
||||||
DenseIndex blockStart_; ///< Changes apparent matrix view, see main class comment.
|
* VerticalBlockMatrix, blockStart() will be 0. */
|
||||||
|
static VerticalBlockMatrix LikeActiveViewOf(const SymmetricBlockMatrix& rhs,
|
||||||
|
DenseIndex height);
|
||||||
|
|
||||||
public:
|
/// Row size
|
||||||
|
DenseIndex rows() const {
|
||||||
|
assertInvariants();
|
||||||
|
return rowEnd_ - rowStart_;
|
||||||
|
}
|
||||||
|
|
||||||
/** Construct an empty VerticalBlockMatrix */
|
/// Column size
|
||||||
VerticalBlockMatrix() :
|
DenseIndex cols() const {
|
||||||
rowStart_(0), rowEnd_(0), blockStart_(0)
|
assertInvariants();
|
||||||
{
|
return variableColOffsets_.back() - variableColOffsets_[blockStart_];
|
||||||
variableColOffsets_.push_back(0);
|
}
|
||||||
assertInvariants();
|
|
||||||
|
/// Block count
|
||||||
|
DenseIndex nBlocks() const {
|
||||||
|
assertInvariants();
|
||||||
|
return variableColOffsets_.size() - 1 - blockStart_;
|
||||||
|
}
|
||||||
|
|
||||||
|
/** Access a single block in the underlying matrix with read/write access */
|
||||||
|
Block operator()(DenseIndex block) {
|
||||||
|
return range(block, block + 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
/** Access a const block view */
|
||||||
|
const constBlock operator()(DenseIndex block) const {
|
||||||
|
return range(block, block + 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
/** access ranges of blocks at a time */
|
||||||
|
Block range(DenseIndex startBlock, DenseIndex endBlock) {
|
||||||
|
assertInvariants();
|
||||||
|
DenseIndex actualStartBlock = startBlock + blockStart_;
|
||||||
|
DenseIndex actualEndBlock = endBlock + blockStart_;
|
||||||
|
if (startBlock != 0 || endBlock != 0) {
|
||||||
|
checkBlock(actualStartBlock);
|
||||||
|
assert(actualEndBlock < (DenseIndex)variableColOffsets_.size());
|
||||||
}
|
}
|
||||||
|
const DenseIndex startCol = variableColOffsets_[actualStartBlock];
|
||||||
|
const DenseIndex rangeCols = variableColOffsets_[actualEndBlock] - startCol;
|
||||||
|
return matrix_.block(rowStart_, startCol, this->rows(), rangeCols);
|
||||||
|
}
|
||||||
|
|
||||||
/** Construct from a container of the sizes of each vertical block. */
|
const constBlock range(DenseIndex startBlock, DenseIndex endBlock) const {
|
||||||
template<typename CONTAINER>
|
assertInvariants();
|
||||||
VerticalBlockMatrix(const CONTAINER& dimensions, DenseIndex height) :
|
DenseIndex actualStartBlock = startBlock + blockStart_;
|
||||||
rowStart_(0), rowEnd_(height), blockStart_(0)
|
DenseIndex actualEndBlock = endBlock + blockStart_;
|
||||||
{
|
if (startBlock != 0 || endBlock != 0) {
|
||||||
fillOffsets(dimensions.begin(), dimensions.end());
|
checkBlock(actualStartBlock);
|
||||||
matrix_.resize(height, variableColOffsets_.back());
|
assert(actualEndBlock < (DenseIndex)variableColOffsets_.size());
|
||||||
assertInvariants();
|
|
||||||
}
|
}
|
||||||
|
const DenseIndex startCol = variableColOffsets_[actualStartBlock];
|
||||||
|
const DenseIndex rangeCols = variableColOffsets_[actualEndBlock] - startCol;
|
||||||
|
return ((const Matrix&) matrix_).block(rowStart_, startCol, this->rows(),
|
||||||
|
rangeCols);
|
||||||
|
}
|
||||||
|
|
||||||
/** Construct from a container of the sizes of each vertical block and a pre-prepared matrix. */
|
/** Return the full matrix, *not* including any portions excluded by rowStart(), rowEnd(), and firstBlock() */
|
||||||
template<typename CONTAINER>
|
Block full() {
|
||||||
VerticalBlockMatrix(const CONTAINER& dimensions, const Matrix& matrix) :
|
return range(0, nBlocks());
|
||||||
matrix_(matrix), rowStart_(0), rowEnd_(matrix.rows()), blockStart_(0)
|
}
|
||||||
{
|
|
||||||
fillOffsets(dimensions.begin(), dimensions.end());
|
/** Return the full matrix, *not* including any portions excluded by rowStart(), rowEnd(), and firstBlock() */
|
||||||
if(variableColOffsets_.back() != matrix_.cols())
|
const constBlock full() const {
|
||||||
throw std::invalid_argument("Requested to create a VerticalBlockMatrix with dimensions that do not sum to the total columns of the provided matrix.");
|
return range(0, nBlocks());
|
||||||
assertInvariants();
|
}
|
||||||
|
|
||||||
|
DenseIndex offset(DenseIndex block) const {
|
||||||
|
assertInvariants();
|
||||||
|
DenseIndex actualBlock = block + blockStart_;
|
||||||
|
checkBlock(actualBlock);
|
||||||
|
return variableColOffsets_[actualBlock];
|
||||||
|
}
|
||||||
|
|
||||||
|
/** Get or set the apparent first row of the underlying matrix for all operations */
|
||||||
|
DenseIndex& rowStart() {
|
||||||
|
return rowStart_;
|
||||||
|
}
|
||||||
|
|
||||||
|
/** Get or set the apparent last row (exclusive, i.e. rows() == rowEnd() - rowStart()) of the underlying matrix for all operations */
|
||||||
|
DenseIndex& rowEnd() {
|
||||||
|
return rowEnd_;
|
||||||
|
}
|
||||||
|
|
||||||
|
/** Get or set the apparent first block for all operations */
|
||||||
|
DenseIndex& firstBlock() {
|
||||||
|
return blockStart_;
|
||||||
|
}
|
||||||
|
|
||||||
|
/** Get the apparent first row of the underlying matrix for all operations */
|
||||||
|
DenseIndex rowStart() const {
|
||||||
|
return rowStart_;
|
||||||
|
}
|
||||||
|
|
||||||
|
/** Get the apparent last row (exclusive, i.e. rows() == rowEnd() - rowStart()) of the underlying matrix for all operations */
|
||||||
|
DenseIndex rowEnd() const {
|
||||||
|
return rowEnd_;
|
||||||
|
}
|
||||||
|
|
||||||
|
/** Get the apparent first block for all operations */
|
||||||
|
DenseIndex firstBlock() const {
|
||||||
|
return blockStart_;
|
||||||
|
}
|
||||||
|
|
||||||
|
/** Access to full matrix (*including* any portions excluded by rowStart(), rowEnd(), and firstBlock()) */
|
||||||
|
const Matrix& matrix() const {
|
||||||
|
return matrix_;
|
||||||
|
}
|
||||||
|
|
||||||
|
/** Non-const access to full matrix (*including* any portions excluded by rowStart(), rowEnd(), and firstBlock()) */
|
||||||
|
Matrix& matrix() {
|
||||||
|
return matrix_;
|
||||||
|
}
|
||||||
|
|
||||||
|
protected:
|
||||||
|
void assertInvariants() const {
|
||||||
|
assert(matrix_.cols() == variableColOffsets_.back());
|
||||||
|
assert(blockStart_ < (DenseIndex)variableColOffsets_.size());
|
||||||
|
assert(rowStart_ <= matrix_.rows());
|
||||||
|
assert(rowEnd_ <= matrix_.rows());
|
||||||
|
assert(rowStart_ <= rowEnd_);
|
||||||
|
}
|
||||||
|
|
||||||
|
void checkBlock(DenseIndex block) const {
|
||||||
|
assert(matrix_.cols() == variableColOffsets_.back());
|
||||||
|
assert(block < (DenseIndex)variableColOffsets_.size() - 1);
|
||||||
|
assert(
|
||||||
|
variableColOffsets_[block] < matrix_.cols() && variableColOffsets_[block+1] <= matrix_.cols());
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename ITERATOR>
|
||||||
|
void fillOffsets(ITERATOR firstBlockDim, ITERATOR lastBlockDim) {
|
||||||
|
variableColOffsets_.resize((lastBlockDim - firstBlockDim) + 1);
|
||||||
|
variableColOffsets_[0] = 0;
|
||||||
|
DenseIndex j = 0;
|
||||||
|
for (ITERATOR dim = firstBlockDim; dim != lastBlockDim; ++dim) {
|
||||||
|
variableColOffsets_[j + 1] = variableColOffsets_[j] + *dim;
|
||||||
|
++j;
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
friend class SymmetricBlockMatrix;
|
||||||
* Construct from iterator over the sizes of each vertical block. */
|
|
||||||
template<typename ITERATOR>
|
|
||||||
VerticalBlockMatrix(ITERATOR firstBlockDim, ITERATOR lastBlockDim, DenseIndex height) :
|
|
||||||
rowStart_(0), rowEnd_(height), blockStart_(0)
|
|
||||||
{
|
|
||||||
fillOffsets(firstBlockDim, lastBlockDim);
|
|
||||||
matrix_.resize(height, variableColOffsets_.back());
|
|
||||||
assertInvariants();
|
|
||||||
}
|
|
||||||
|
|
||||||
/** Copy the block structure and resize the underlying matrix, but do not copy the matrix data.
|
|
||||||
* If blockStart(), rowStart(), and/or rowEnd() have been modified, this copies the structure of
|
|
||||||
* the corresponding matrix view. In the destination VerticalBlockView, blockStart() and
|
|
||||||
* rowStart() will thus be 0, rowEnd() will be cols() of the source VerticalBlockView, and the
|
|
||||||
* underlying matrix will be the size of the view of the source matrix. */
|
|
||||||
static VerticalBlockMatrix LikeActiveViewOf(const VerticalBlockMatrix& rhs);
|
|
||||||
|
|
||||||
/** Copy the block structure, but do not copy the matrix data. If blockStart() has been
|
private:
|
||||||
* modified, this copies the structure of the corresponding matrix view. In the destination
|
/** Serialization function */
|
||||||
* VerticalBlockMatrix, blockStart() will be 0. */
|
friend class boost::serialization::access;
|
||||||
static VerticalBlockMatrix LikeActiveViewOf(const SymmetricBlockMatrix& rhs, DenseIndex height);
|
template<class ARCHIVE>
|
||||||
|
void serialize(ARCHIVE & ar, const unsigned int version) {
|
||||||
/// Row size
|
ar & BOOST_SERIALIZATION_NVP(matrix_);
|
||||||
DenseIndex rows() const { assertInvariants(); return rowEnd_ - rowStart_; }
|
ar & BOOST_SERIALIZATION_NVP(variableColOffsets_);
|
||||||
|
ar & BOOST_SERIALIZATION_NVP(rowStart_);
|
||||||
/// Column size
|
ar & BOOST_SERIALIZATION_NVP(rowEnd_);
|
||||||
DenseIndex cols() const { assertInvariants(); return variableColOffsets_.back() - variableColOffsets_[blockStart_]; }
|
ar & BOOST_SERIALIZATION_NVP(blockStart_);
|
||||||
|
}
|
||||||
/// Block count
|
};
|
||||||
DenseIndex nBlocks() const { assertInvariants(); return variableColOffsets_.size() - 1 - blockStart_; }
|
|
||||||
|
|
||||||
/** Access a single block in the underlying matrix with read/write access */
|
|
||||||
Block operator()(DenseIndex block) { return range(block, block+1); }
|
|
||||||
|
|
||||||
/** Access a const block view */
|
|
||||||
const constBlock operator()(DenseIndex block) const { return range(block, block+1); }
|
|
||||||
|
|
||||||
/** access ranges of blocks at a time */
|
|
||||||
Block range(DenseIndex startBlock, DenseIndex endBlock) {
|
|
||||||
assertInvariants();
|
|
||||||
DenseIndex actualStartBlock = startBlock + blockStart_;
|
|
||||||
DenseIndex actualEndBlock = endBlock + blockStart_;
|
|
||||||
if(startBlock != 0 || endBlock != 0) {
|
|
||||||
checkBlock(actualStartBlock);
|
|
||||||
assert(actualEndBlock < (DenseIndex)variableColOffsets_.size());
|
|
||||||
}
|
|
||||||
const DenseIndex startCol = variableColOffsets_[actualStartBlock];
|
|
||||||
const DenseIndex rangeCols = variableColOffsets_[actualEndBlock] - startCol;
|
|
||||||
return matrix_.block(rowStart_, startCol, this->rows(), rangeCols);
|
|
||||||
}
|
|
||||||
|
|
||||||
const constBlock range(DenseIndex startBlock, DenseIndex endBlock) const {
|
|
||||||
assertInvariants();
|
|
||||||
DenseIndex actualStartBlock = startBlock + blockStart_;
|
|
||||||
DenseIndex actualEndBlock = endBlock + blockStart_;
|
|
||||||
if(startBlock != 0 || endBlock != 0) {
|
|
||||||
checkBlock(actualStartBlock);
|
|
||||||
assert(actualEndBlock < (DenseIndex)variableColOffsets_.size());
|
|
||||||
}
|
|
||||||
const DenseIndex startCol = variableColOffsets_[actualStartBlock];
|
|
||||||
const DenseIndex rangeCols = variableColOffsets_[actualEndBlock] - startCol;
|
|
||||||
return ((const Matrix&)matrix_).block(rowStart_, startCol, this->rows(), rangeCols);
|
|
||||||
}
|
|
||||||
|
|
||||||
/** Return the full matrix, *not* including any portions excluded by rowStart(), rowEnd(), and firstBlock() */
|
|
||||||
Block full() { return range(0, nBlocks()); }
|
|
||||||
|
|
||||||
/** Return the full matrix, *not* including any portions excluded by rowStart(), rowEnd(), and firstBlock() */
|
|
||||||
const constBlock full() const { return range(0, nBlocks()); }
|
|
||||||
|
|
||||||
DenseIndex offset(DenseIndex block) const {
|
|
||||||
assertInvariants();
|
|
||||||
DenseIndex actualBlock = block + blockStart_;
|
|
||||||
checkBlock(actualBlock);
|
|
||||||
return variableColOffsets_[actualBlock];
|
|
||||||
}
|
|
||||||
|
|
||||||
/** Get or set the apparent first row of the underlying matrix for all operations */
|
|
||||||
DenseIndex& rowStart() { return rowStart_; }
|
|
||||||
|
|
||||||
/** Get or set the apparent last row (exclusive, i.e. rows() == rowEnd() - rowStart()) of the underlying matrix for all operations */
|
|
||||||
DenseIndex& rowEnd() { return rowEnd_; }
|
|
||||||
|
|
||||||
/** Get or set the apparent first block for all operations */
|
|
||||||
DenseIndex& firstBlock() { return blockStart_; }
|
|
||||||
|
|
||||||
/** Get the apparent first row of the underlying matrix for all operations */
|
|
||||||
DenseIndex rowStart() const { return rowStart_; }
|
|
||||||
|
|
||||||
/** Get the apparent last row (exclusive, i.e. rows() == rowEnd() - rowStart()) of the underlying matrix for all operations */
|
|
||||||
DenseIndex rowEnd() const { return rowEnd_; }
|
|
||||||
|
|
||||||
/** Get the apparent first block for all operations */
|
|
||||||
DenseIndex firstBlock() const { return blockStart_; }
|
|
||||||
|
|
||||||
/** Access to full matrix (*including* any portions excluded by rowStart(), rowEnd(), and firstBlock()) */
|
|
||||||
const Matrix& matrix() const { return matrix_; }
|
|
||||||
|
|
||||||
/** Non-const access to full matrix (*including* any portions excluded by rowStart(), rowEnd(), and firstBlock()) */
|
|
||||||
Matrix& matrix() { return matrix_; }
|
|
||||||
|
|
||||||
protected:
|
|
||||||
void assertInvariants() const {
|
|
||||||
assert(matrix_.cols() == variableColOffsets_.back());
|
|
||||||
assert(blockStart_ < (DenseIndex)variableColOffsets_.size());
|
|
||||||
assert(rowStart_ <= matrix_.rows());
|
|
||||||
assert(rowEnd_ <= matrix_.rows());
|
|
||||||
assert(rowStart_ <= rowEnd_);
|
|
||||||
}
|
|
||||||
|
|
||||||
void checkBlock(DenseIndex block) const {
|
|
||||||
assert(matrix_.cols() == variableColOffsets_.back());
|
|
||||||
assert(block < (DenseIndex)variableColOffsets_.size() - 1);
|
|
||||||
assert(variableColOffsets_[block] < matrix_.cols() && variableColOffsets_[block+1] <= matrix_.cols());
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename ITERATOR>
|
|
||||||
void fillOffsets(ITERATOR firstBlockDim, ITERATOR lastBlockDim) {
|
|
||||||
variableColOffsets_.resize((lastBlockDim-firstBlockDim)+1);
|
|
||||||
variableColOffsets_[0] = 0;
|
|
||||||
DenseIndex j=0;
|
|
||||||
for(ITERATOR dim=firstBlockDim; dim!=lastBlockDim; ++dim) {
|
|
||||||
variableColOffsets_[j+1] = variableColOffsets_[j] + *dim;
|
|
||||||
++ j;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
friend class SymmetricBlockMatrix;
|
|
||||||
|
|
||||||
private:
|
|
||||||
/** Serialization function */
|
|
||||||
friend class boost::serialization::access;
|
|
||||||
template<class ARCHIVE>
|
|
||||||
void serialize(ARCHIVE & ar, const unsigned int version) {
|
|
||||||
ar & BOOST_SERIALIZATION_NVP(matrix_);
|
|
||||||
ar & BOOST_SERIALIZATION_NVP(variableColOffsets_);
|
|
||||||
ar & BOOST_SERIALIZATION_NVP(rowStart_);
|
|
||||||
ar & BOOST_SERIALIZATION_NVP(rowEnd_);
|
|
||||||
ar & BOOST_SERIALIZATION_NVP(blockStart_);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue