/*
 *   surf - visualizing algebraic curves and algebraic surfaces
 *   Copyright (C) 1996-1997 Friedrich-Alexander-Universitaet
 *                           Erlangen-Nuernberg
 *                 1997-2000 Johannes Gutenberg-Universitaet Mainz
 *   Authors: Stephan Endrass, Hans Huelf, Ruediger Oertel,
 *            Kai Schneider, Ralf Schmitt, Johannes Beigel
 *
 *   This program is free software; you can redistribute it and/or modify
 *   it under the terms of the GNU General Public License as published by
 *   the Free Software Foundation; either version 2 of the License, or
 *   (at your option) any later version.
 *
 *   This program is distributed in the hope that it will be useful,
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *   GNU General Public License for more details.
 *
 *   You should have received a copy of the GNU General Public License
 *   along with this program; if not, write to the Free Software
 *   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 *
 */




#ifndef STURMCHAIN_H
#define STURMCHAIN_H

class Polyx;
class Sturmchain
{
  Polyx* Chain;  // list of polyx starting with f, f' ...
  int    Length; 
public:
  Sturmchain( const Polyx& );
  ~Sturmchain();
  int SignChange( double, double ) const;
  int DivideIntervalMulti( double, double, int, double, double, int,
			   double*, int&, int ); // subdivide interval
                           // trying to get all roots in range
  int DivideIntervalSingle( double, double, int, double, double, int,
			    double*, int&, int ); // subdivide interval
                           // trying to get largest root in range
};

#endif // STURMCHAIN_H