DegreePattern Class Reference

DegreePattern provides a functionality to create, intersect and refine degree patterns. More...

#include "factory/DegreePattern.h"

Data Structures
struct	Pattern

Public Member Functions
int	getLength () const
	getter More...
int	operator[] (const int index) const
	operator [] More...
int &	operator[] (const int index)
	operator [] More...
	DegreePattern ()
	default constructor More...
	DegreePattern (const DegreePattern &degPat)
	copy constructor More...
	DegreePattern (const CFList &l)
	construct a degree pattern from a list of (univariate) polys More...
DegreePattern &	operator= (const DegreePattern &degPat)
	assignment More...
	~DegreePattern ()
	destructor More...
int	find (const int x) const
	find an element x More...
void	intersect (const DegreePattern &degPat)
	intersect two degree patterns More...
void	refine ()
	Refine a degree pattern. Assumes that (*this)[0]:= d is the degree of the poly to be factored. Now for every other entry a there should be some entry b such that a+b= d. Elements which do not satisfy this relation are removed. More...

Private Member Functions
void	release ()
	clear m_data More...
void	init (int n)
	initialise a DegreePattern More...
int *	getPattern () const
	getter More...

Private Attributes
struct DegreePattern::Pattern *	m_data

Detailed Description

DegreePattern provides a functionality to create, intersect and refine degree patterns.

Definition at line 31 of file DegreePattern.h.

Constructor & Destructor Documentation

DegreePattern::DegreePattern ( )

inline

default constructor

Definition at line 117 of file DegreePattern.h.

: m_data( new Pattern() ){}

DegreePattern::DegreePattern ( const DegreePattern &  degPat )

inline

copy constructor

Parameters

[in]

degPat

some degree pattern

Definition at line 120 of file DegreePattern.h.

                 : m_data( degPat.m_data )
  {
    ASSERT( degPat.m_data != NULL, "non-null pointer expected"  );
    m_data->m_refCounter++;
  };

DegreePattern::DegreePattern

(

const CFList &

l

)

construct a degree pattern from a list of (univariate) polys

Parameters

[in]

l

some list of (univariate) polys

Definition at line 24 of file DegreePattern.cc.

{
  m_data = NULL;

  if (l.length() == 0)
    m_data = new Pattern();
  else
  {

  Variable x= Variable (1);
  int p= getCharacteristic();
  int d= 0;
  char cGFName= 'Z';
  if (CFFactory::gettype() == GaloisFieldDomain)
  {
    d= getGFDegree();
    cGFName= gf_name;
  }
  setCharacteristic(0);
  CanonicalForm buf= 1;
  CFListIterator k= l;
  for (int i= 0; i < l.length(); i++, k++)
    buf *= (power (x, degree (k.getItem(), x)) + 1);

  int j= 0;
  for (CFIterator i= buf; i.hasTerms(); i++, j++)
    ;

  ASSERT ( j > 1, "j > 1 expected" );

  m_data = new Pattern( j - 1 );

  int i= 0;
  for (CFIterator m = buf; i < getLength(); i++, m++)
    (*this) [i]= m.exp();

  if (d > 1)
    setCharacteristic (p, d, cGFName);
  else
    setCharacteristic (p);
  }
}

DegreePattern::~DegreePattern ( )

inline

destructor

Definition at line 148 of file DegreePattern.h.

  {
    ASSERT( m_data !=  NULL, "non-null pointer expected"  );
    if( (--m_data->m_refCounter) < 1 )
      release();
  }

Member Function Documentation

int DegreePattern::find ( const int  x ) const

inline

find an element x

Returns

find returns the index + 1 of x, if x is an element of the degree pattern, 0 otherwise

Parameters

[in]

x

some int

Definition at line 159 of file DegreePattern.h.

  {
    if (getLength() == 0) return 0;
    for (int i= 0; i < getLength(); i++)
      if ((*this)[i] == x) return i + 1;
    return 0;
  };

int DegreePattern::getLength ( ) const

inline

getter

Returns

getLength returns the length of the degree pattern

Definition at line 86 of file DegreePattern.h.

  {
    ASSERT( m_data != NULL, "non-null pointer expected" );
    return m_data->m_length;
  }

int* DegreePattern::getPattern ( ) const

inlineprivate

getter

Returns

getPattern returns a degree pattern

Definition at line 74 of file DegreePattern.h.

  {
    ASSERT( m_data != NULL, "non-null pointer expected" );
    ASSERT( m_data->m_pattern != NULL, "non-null pointer expected" );
    return m_data->m_pattern;
  }

void DegreePattern::init ( int  n )

inlineprivate

initialise a DegreePattern

Definition at line 60 of file DegreePattern.h.

  {
    ASSERT ( m_data != NULL, "non-null pointer expected" );
    ASSERT( m_data->m_refCounter > 0, "ref count > 0 expected" );

    if( (--m_data->m_refCounter) < 1 )
      release();

    m_data = new Pattern(n);
  }

void DegreePattern::intersect

(

const DegreePattern &

degPat

)

intersect two degree patterns

Parameters

[in]

degPat

some degree pattern

Definition at line 68 of file DegreePattern.cc.

{
  if (degPat.getLength() < getLength())
  {
    DegreePattern bufDeg= *this;
    *this= degPat;
    return (*this).intersect (bufDeg);
  }

  int count= 0;
  int length= tmin (getLength(), degPat.getLength());
  int* buf= new int [length];
  for (int i= 0; i < length; i++)
  {
    if (degPat.find ((*this)[i]))
    {
      buf[i]= (*this)[i];
      count++;
    }
    else
      buf[i]= -1;
  }
  ASSERT ( count > 0, "count > 0 expected" );

  init (count);
  count= 0;
  for (int i= 0; i < length; i++)
  {
    if (buf[i] != -1)
    {
      (*this) [count]= buf[i];
      count++;
    }
  }
  delete[] buf;
}

DegreePattern& DegreePattern::operator= ( const DegreePattern &  degPat )

inline

assignment

Parameters

[in]

degPat

some degree pattern

Definition at line 132 of file DegreePattern.h.

  {
    ASSERT( m_data != NULL, "non-null pointer expected"  );
    ASSERT( degPat.m_data != NULL, "non-null pointer expected" );
    if( m_data != degPat.m_data )
    {
      m_data = degPat.m_data;
      m_data->m_refCounter++;
    }

    return *this;
  }

int DegreePattern::operator[] ( const int  index ) const

inline

operator []

Returns

operator[] returns the element at index

Parameters

[in]

index

some int >= 0, < getLength()

Definition at line 95 of file DegreePattern.h.

  {
    ASSERT( m_data != NULL, "non-null pointer expected" );
    ASSERT( index >= 0 && index < getLength(), "bad index" );
    ASSERT( getPattern() != NULL, "non-null pointer expected" );
    return getPattern()[index];
  }

int& DegreePattern::operator[] ( const int  index )

inline

operator []

Returns

operator[] sets the element at index

Parameters

[in]

index

some int >= 0, < getLength()

Definition at line 107 of file DegreePattern.h.

  {
    ASSERT( m_data != NULL, "non-null pointer expected" );
    ASSERT( index >= 0 && index < getLength(), "bad index" );
    ASSERT( getPattern() != NULL, "non-null pointer expected" );
    return getPattern()[index];
  }

void DegreePattern::refine

(

)

Refine a degree pattern. Assumes that (*this)[0]:= d is the degree of the poly to be factored. Now for every other entry a there should be some entry b such that a+b= d. Elements which do not satisfy this relation are removed.

Definition at line 105 of file DegreePattern.cc.

{
  if (getLength() <= 1)
    return;
  int count= 0;
  int* buf= new int [getLength()];
  int d= (*this) [0];
  int pos;
  for (int i= 0; i < getLength(); i++)
    buf[i]= -1;
  for (int i= 1; i < getLength(); i++)
  {
    pos= (*this).find (d - (*this)[i]);
    if (pos)
    {
      buf[i]= (*this)[i];
      count++;
    }
  }
  buf[0]= d;
  count++;
  if (count == getLength())
  {
    delete [] buf;
    return;
  }
  int length= getLength();

  ASSERT ( count > 0, "count > 0 expected" );
  init (count);
  count= 0;
  for (int i= 0; i < length; i++)
  {
    if (buf[i] != -1)
    {
      (*this)[count]= buf[i];
      count++;
    }
  }

  delete[] buf;
  return;
}

void DegreePattern::release ( )

inlineprivate

clear m_data

Definition at line 48 of file DegreePattern.h.

  {
    ASSERT ( m_data != NULL, "non-null pointer expected");
    ASSERT ( m_data->m_refCounter == 0, "ref count of 0 expected");
    if( m_data->m_pattern != NULL )
      delete[] m_data->m_pattern;
    m_data->m_pattern = NULL;

    delete m_data;
    m_data = NULL;
  }

Field Documentation

struct DegreePattern::Pattern* DegreePattern::m_data

private

---

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

• factory/DegreePattern.h
• factory/DegreePattern.cc