The buffers of merge_rank_one, kept from one join to the next: a fresh buffer per join is mapped anew, page by page. Each is written before it is read (updated zeroed row by row by the gathers). More...

#include <decomposition.hpp>

Collaboration diagram for numerical::detail::merge_workspace:

[legend]

Public Attributes
workspace_buffer	gaps {}
	`poles[j] − roots[i]`, row by root, then the eigenvectors in its place.

workspace_buffer	updated {}
	The kept columns of `q` times `u`.

workspace_buffer	columns {}
	One half's rows of the kept columns that reach it.

workspace_buffer	factor {}
	The rows of `u` for those columns.

Detailed Description

The buffers of merge_rank_one, kept from one join to the next: a fresh buffer per join is mapped anew, page by page. Each is written before it is read (updated zeroed row by row by the gathers).

Definition at line 3719 of file decomposition.hpp.

Member Data Documentation

◆ columns

workspace_buffer numerical::detail::merge_workspace::columns {}

One half's rows of the kept columns that reach it.

Definition at line 3723 of file decomposition.hpp.

◆ factor

workspace_buffer numerical::detail::merge_workspace::factor {}

The rows of u for those columns.

Definition at line 3724 of file decomposition.hpp.

◆ gaps

workspace_buffer numerical::detail::merge_workspace::gaps {}

poles[j] − roots[i], row by root, then the eigenvectors in its place.

Definition at line 3721 of file decomposition.hpp.

◆ updated

workspace_buffer numerical::detail::merge_workspace::updated {}

The kept columns of q times u.

Definition at line 3722 of file decomposition.hpp.

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