Node in the Roth-Ruckenstein's algorithm. More...

#include <RR_Factorization.h>

Collaboration diagram for rssoft::RR_Node:

Public Member Functions
	RR_Node (RR_Node *_parent, const gf::GFq_BivariatePolynomial &_Q, const gf::GFq_Element &_coeff, unsigned int _id)
unsigned int	get_id () const
int	get_degree () const
const gf::GFq_BivariatePolynomial &	getQ () const
const gf::GFq_Element &	get_coeff () const
void	add_ry (const gf::GFq_Element &root_y)
bool	is_in_ry_set (const gf::GFq_Element &root_y) const
Protected Attributes
RR_Node *	parent
	Pointer to the parent node.
const gf::GFq_BivariatePolynomial &	Q
	Node's polynomial.
const gf::GFq_Element &	coeff
unsigned int	id
	Identifier number of the node.
int	degree
	The distance of the node from the root counted in the number of arcs less one.
std::set< gf::GFq_Element >	ry_set
	Set of roots in Y of the node's polynomial.

Detailed Description

Node in the Roth-Ruckenstein's algorithm.

Constructor & Destructor Documentation

rssoft::RR_Node::RR_Node	(	RR_Node *	_parent,
		const gf::GFq_BivariatePolynomial &	_Q,
		const gf::GFq_Element &	_coeff,
		unsigned int	_id
	)

Constructor

Parameters:

_parent	Pointer to the parent node, 0 for root node
_Q	Node polynomial
_coeff	Coefficient on the arc towards this node
_id	Node identifier

                                  :
        parent(_parent),
        Q(_Q),
    coeff(_coeff),
        id(_id)
{
        if (_parent == 0)
        {
                degree = -1;
        }
        else
        {
                degree = _parent->get_degree()+1;
        }
}

Here is the call graph for this function:

Member Function Documentation

void rssoft::RR_Node::add_ry ( const gf::GFq_Element & root_y ) [inline]

Add a root in Y

        {
                ry_set.insert(root_y);
        }

const gf::GFq_Element& rssoft::RR_Node::get_coeff ( ) const [inline]

Get coefficient towards the node

        {
                return coeff;
        }

int rssoft::RR_Node::get_degree ( ) const [inline]

Get the degree of the node

        {
                return degree;
        }

unsigned int rssoft::RR_Node::get_id ( ) const [inline]

Get the node's Id

        {
                return id;
        }

const gf::GFq_BivariatePolynomial& rssoft::RR_Node::getQ ( ) const [inline]

Get node's polynomial

        {
                return Q;
        }

bool rssoft::RR_Node::is_in_ry_set ( const gf::GFq_Element & root_y ) const [inline]

Tells if an element is in the set of Y roots

        {
                std::set<gf::GFq_Element>::const_iterator e_it = ry_set.find(root_y);
                return e_it != ry_set.end();
        }