Column class following the PersistenceMatrixColumn concept. Not compatible with row access. More...
Column class following the PersistenceMatrixColumn concept. Not compatible with row access.
Column based on a heap structure. The heap is represented as a vector sorted as a heap. The top of the heap is the cell with the biggest row index. The sum of two columns is lazy: the content of the source is simply inserted into the heap of the target. Therefore the underlying vector can contain several cells with the same row index. The real value of a cell at a row index corresponds to the sum in the coeffcient field of all values with same row index. Additionaly, the given cell range added into the heap does not need to be somehow ordered.