structure to hold all necesary data to perform the LLL's basis reduction algorithm. More...

#include <eg_dbasis_red.h>

Collaboration diagram for EGdBsRed_t:

Data Fields
EGlpNum_t **	basis
	array of pointers to arrays containing the vector basis in extended (including zero coef) form. The vectors themselves are considered as allocated outside. everything else is considered as internally allocated.
size_t	basis_sz
	Actual length of the EGdBsRed_t::basis array.
size_t	dim
	Number of elements in the basis.
EGdMatrix_t	GM
	Here we store and compute the Gram-Schmidt needed for the LLL basis reduction algorithm.
size_t	length
	Length of the vectors in the basis, note that it should be that length >= dim.

Detailed Description

structure to hold all necesary data to perform the LLL's basis reduction algorithm.

Examples:: eg_dmatrix.ex.c.

Definition at line 102 of file eg_dbasis_red.h.

Field Documentation

EGlpNum_t** EGdBsRed_t::basis

array of pointers to arrays containing the vector basis in extended (including zero coef) form. The vectors themselves are considered as allocated outside. everything else is considered as internally allocated.

Definition at line 109 of file eg_dbasis_red.h.

size_t EGdBsRed_t::basis_sz

Actual length of the EGdBsRed_t::basis array.

Definition at line 107 of file eg_dbasis_red.h.

size_t EGdBsRed_t::dim

Number of elements in the basis.

Definition at line 104 of file eg_dbasis_red.h.

EGdMatrix_t EGdBsRed_t::GM

Here we store and compute the Gram-Schmidt needed for the LLL basis reduction algorithm.

Definition at line 114 of file eg_dbasis_red.h.

size_t EGdBsRed_t::length

Length of the vectors in the basis, note that it should be that length >= dim.