Matrix::iterator Class Reference

Reseatable iterator over the non-zero entries of one column of the matrix. More...

#include <matrix.hpp>

Inheritance diagram for Matrix::iterator:

Public Member Functions
	iterator (const Matrix *M0)
void	set (int newcol)
void	next ()
bool	valid ()
int	row ()
ring_elem	entry ()

Private Attributes
const Matrix *	M
int	col
vec	v

Additional Inherited Members
Static Public Member Functions inherited from our_new_delete
static void *	operator new (size_t size)
static void *	operator new[] (size_t size)
static void	operator delete (void *obj)
static void	operator delete[] (void *obj)
static void *	operator new (size_t size, void *existing_memory)
static void *	operator new[] (size_t size, void *existing_memory)
static void	operator delete (void *obj, void *existing_memory)
static void	operator delete[] (void *obj, void *existing_memory)

Detailed Description

Reseatable iterator over the non-zero entries of one column of the matrix.

Note

AI-generated documentation. Verify against the source before relying on it.

Constructed in a "no column" state (col == -1, v == nullptr) and then set(col) aims it at a specific column; next() advances through that column's sparse vec list (decreasing row order; zero entries are not present). Read-only by design — the matrix itself is immutable.

Definition at line 302 of file matrix.hpp.

---

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

• Macaulay2/e/matrix.hpp