Solvestacke2ter.hpp File Reference

Go to the source code of this file.

Macros
#define	NUMBITS   8
#define	MASKBIT   255
#define	LEVELSTACK   40
#define	NBTHREAD   7

Functions
template<>
void	INIT_ELEM< stack_elem > (void *ptr, int size)
template<>
void	CLEAR_ELEM< stack_elem > (void *ptr, int size)
template<typename compo , typename workspace , typename mon , typename T >
void	vider_pile (stack_elem *stack, int stacksize, pol< mon, T > *p, mon *&exceed_p, int &sizeexceed_p, workspace *w)
template<typename coeff , typename workspace , typename component >
void	SolveU (const harewell< coeff > &u, component &compo, workspace &w)
template<typename workspace , typename component , typename coeff >
void	SolveL (const harewell< coeff > &l, component &compo, workspace &w)
template<typename typmat , typename typPk , typename mon , typename typMk , typename workspace , typename typserv >
void	Solve (typmat &S, typmat &L, component< typPk, mon > &compo, int **pr, int **pc, typMk &tmpMk, workspace &w, typserv &serv)
template<typename typmat , typename typMk , typename component , typename typserv >
void	reorder_ind (const typmat &tmpmat, const typMk &verytmpMk, component &compo, typserv &serv)

Macro Definition Documentation

#define LEVELSTACK   40

#define MASKBIT   255

#define NBTHREAD   7

#define NUMBITS   8

Function Documentation

template<>

void CLEAR_ELEM< stack_elem >	(	void *	ptr,
		int	size
	)

template<>

void INIT_ELEM< stack_elem >	(	void *	ptr,
		int	size
	)

template<typename typmat , typename typMk , typename component , typename typserv >

void reorder_ind	(	const typmat &	tmpmat,
		const typMk &	verytmpMk,
		component &	compo,
		typserv &	serv
	)

template<typename typmat , typename typPk , typename mon , typename typMk , typename workspace , typename typserv >

void Solve	(	typmat &	S,
		typmat &	L,
		component< typPk, mon > &	compo,
		int **	pr,
		int **	pc,
		typMk &	tmpMk,
		workspace &	w,
		typserv &	serv
	)

template<typename workspace , typename component , typename coeff >

void SolveL	(	const harewell< coeff > &	l,
		component &	compo,
		workspace &	w
	)

template<typename coeff , typename workspace , typename component >

void SolveU	(	const harewell< coeff > &	u,
		component &	compo,
		workspace &	w
	)

template<typename compo , typename workspace , typename mon , typename T >

void vider_pile	(	stack_elem *	stack,
		int	stacksize,
		pol< mon, T > *	p,
		mon *&	exceed_p,
		int &	sizeexceed_p,
		workspace *	w
	)