#line 1 "/user/cvsspst/ees1cg/RAVL/RAVL-0.7/Math/Sequence/PrimitiveBinaryPolynomial.hh" // This file is part of RAVL, Recognition And Vision Library // Copyright (C) 2001, University of Surrey // This code may be redistributed under the terms of the GNU Lesser // General Public License (LGPL). See the lgpl.licence file for details or // see http://www.gnu.org/copyleft/lesser.html // file-header-ends-here #ifndef RAVLPRIMITIVEBINARYPOLYNOMAIL_HEADER #define RAVLPRIMITIVEBINARYPOLYNOMAIL_HEADER 1 ///////////////////////////////////////////////////////// //! rcsid="$Id: PrimitiveBinaryPolynomial.hh,v 1.2 2002/01/31 14:55:43 craftit Exp $" //! file="Ravl/Math/Sequence/PrimitiveBinaryPolynomial.hh" //! lib=RavlMath //! author="Charles Galambos" //! date="23/03/99" //! docentry="Ravl.Math.Sequences" //! example=exPrimiteBinaryPolynomial.cc #include "Ravl/SArray1d.hh" namespace RavlN { //! userlevel=Normal //: Evaluate a binary polynomial in a recurance sequence. // See Numerical Recipies in 'C' pg 312. (this is a full re-implementation)
// These are used in generating sobel sequences.
// Small object.
class PrimitiveBinaryPolynomialC {
public:
PrimitiveBinaryPolynomialC()
{}
//: Default constructor.
PrimitiveBinaryPolynomialC(int arg,int degree,const SArray1dC