gdb.printers.EigenSparseMatrixPrinter._Iterator Class Reference

Inheritance diagram for gdb.printers.EigenSparseMatrixPrinter._Iterator:

Public Member Functions
def	__init__ (self, rows, cols, val, row_major)
def	__next__ (self)
Public Member Functions inherited from gdb.printers._MatrixEntryIterator
def	__init__ (self, rows, cols, row_major)
def	__iter__ (self)
def	next (self)

Public Attributes
	val
Public Attributes inherited from gdb.printers._MatrixEntryIterator
	rows
	cols
	currentRow
	currentCol
	rowMajor

Constructor & Destructor Documentation

__init__()

def gdb.printers.EigenSparseMatrixPrinter._Iterator.__init__	(		self,
			rows,
			cols,
			val,
			row_major
	)

        def __init__(self, rows, cols, val, row_major):
            super(EigenSparseMatrixPrinter._Iterator, self).__init__(rows, cols, row_major)
 
            self.val = val
            

Member Function Documentation

__next__()

def gdb.printers.EigenSparseMatrixPrinter._Iterator.__next__

(

self

)

Reimplemented from gdb.printers._MatrixEntryIterator.

        def __next__(self):
            row, col = super(EigenSparseMatrixPrinter._Iterator, self).__next__()
                
            # repeat calculations from SparseMatrix.h:
            outer = row if self.rowMajor else col
            inner = col if self.rowMajor else row
            start = self.val['m_outerIndex'][outer]
            end = (
                (start + self.val['m_innerNonZeros'][outer])
                if self.val['m_innerNonZeros'] else self.val['m_outerIndex'][outer+1]
            )
 
            # and from CompressedStorage.h:
            data = self.val['m_data']
            if start >= end:
                item = 0
            elif (end > start) and (inner == data['m_indices'][end-1]):
                item = data['m_values'][end-1]
            else:
                # create Python index list from the target range within m_indices
                indices = [data['m_indices'][x] for x in range(int(start), int(end)-1)]
                # find the index with binary search
                idx = int(start) + bisect_left(indices, inner)
                if idx < end and data['m_indices'][idx] == inner:
                    item = data['m_values'][idx]
                else:
                    item = 0
 
            return '[%d,%d]' % (row, col), item
 
    def children(self):

References int(), gdb.printers._MatrixEntryIterator.rowMajor, gdb.printers.EigenMatrixPrinter.rowMajor, gdb.printers.EigenSparseMatrixPrinter.rowMajor, gdb.printers.EigenMatrixPrinter.val, gdb.printers.EigenSparseMatrixPrinter.val, gdb.printers.EigenSparseMatrixPrinter._Iterator.val, gdb.printers.EigenQuaternionPrinter.val, Eigen::internal::Pointer_type_promotion< A, B >.val, Eigen::internal::Pointer_type_promotion< A, A >.val, KeyValueType.val, KVType.val, FKeyValueType.val, and KeyKeyValueType.val.

Referenced by gdb.printers._MatrixEntryIterator.next(), and gdb.printers.EigenQuaternionPrinter._Iterator.next().

Member Data Documentation

val

gdb.printers.EigenSparseMatrixPrinter._Iterator.val

Referenced by gdb.printers.EigenSparseMatrixPrinter._Iterator.__next__(), gdb.printers.EigenSparseMatrixPrinter.children(), gdb.printers.EigenSparseMatrixPrinter.cols(), gdb.printers.EigenSparseMatrixPrinter.rows(), and gdb.printers.EigenSparseMatrixPrinter.to_string().

---

The documentation for this class was generated from the following file:

• printers.py