#include <polynomial.h>

Inheritance diagram for Analitza::Polynomial:

Public Member Functions
	Polynomial (Apply *c)

void	negate (int i)

Analitza::Object *	toObject ()

Public Member Functions inherited from QList< Monomial >
	QList ()

	QList (const QList< T > &other)

	QList (std::initializer_list< T > args)

	~QList ()

void	append (const T &value)

void	append (const QList< T > &value)

const T &	at (int i) const

T &	back ()

const T &	back () const

iterator	begin ()

const_iterator	begin () const

void	clear ()

const_iterator	constBegin () const

const_iterator	constEnd () const

bool	contains (const T &value) const

int	count (const T &value) const

int	count () const

bool	empty () const

iterator	end ()

const_iterator	end () const

bool	endsWith (const T &value) const

iterator	erase (iterator pos)

iterator	erase (iterator begin, iterator end)

iterator	find (iterator from, const T &t)

iterator	find (const T &t)

const_iterator	find (const T &t) const

const_iterator	find (const_iterator from, const T &t) const

int	findIndex (const T &t) const

T &	first ()

const T &	first () const

T &	front ()

const T &	front () const

int	indexOf (const T &value, int from) const

void	insert (int i, const T &value)

iterator	insert (iterator before, const T &value)

bool	isEmpty () const

T &	last ()

const T &	last () const

int	lastIndexOf (const T &value, int from) const

int	length () const

QList< T >	mid (int pos, int length) const

void	move (int from, int to)

bool	operator!= (const QList< T > &other) const

QList< T >	operator+ (const QList< T > &other) const

QList< T > &	operator+= (const QList< T > &other)

QList< T > &	operator+= (const T &value)

QList< T > &	operator<< (const T &value)

QList< T > &	operator<< (const QList< T > &other)

QList< T > &	operator= (const QList< T > &other)

bool	operator== (const QList< T > &other) const

T &	operator[] (int i)

const T &	operator[] (int i) const

void	pop_back ()

void	pop_front ()

void	prepend (const T &value)

void	push_back (const T &value)

void	push_front (const T &value)

iterator	remove (iterator pos)

int	remove (const T &t)

int	removeAll (const T &value)

void	removeAt (int i)

void	removeFirst ()

void	removeLast ()

bool	removeOne (const T &value)

void	replace (int i, const T &value)

void	reserve (int alloc)

int	size () const

bool	startsWith (const T &value) const

void	swap (int i, int j)

void	swap (QList< T > &other)

T	takeAt (int i)

T	takeFirst ()

T	takeLast ()

QSet< T >	toSet () const

std::list< T >	toStdList () const

QVector< T >	toVector () const

T	value (int i, const T &defaultValue) const

T	value (int i) const

Additional Inherited Members
Static Public Member Functions inherited from QList< Monomial >
QList< T >	fromSet (const QSet< T > &set)

QList< T >	fromStdList (const std::list< T > &list)

QList< T >	fromVector (const QVector< T > &vector)

Public Attributes inherited from QList< Monomial >
typedef	const_pointer

typedef	const_reference

typedef	ConstIterator

typedef	difference_type

typedef	Iterator

typedef	pointer

typedef	reference

typedef	size_type

typedef	value_type

Detailed Description

Polynomial object.

The important method in this class is negate, wich change the sign of the Monomial referenced by an index.

Author: Aleix Pol aleix.nosp@m.pol@.nosp@m.kde.o.nosp@m.rg

Definition at line 67 of file polynomial.h.

Constructor & Destructor Documentation

Analitza::Polynomial::Polynomial ( Apply * c )

Member Function Documentation

void Analitza::Polynomial::negate ( int i )

Analitza::Object* Analitza::Polynomial::toObject ( )

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

polynomial.h

Analitza

Public Member Functions

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

Analitza

kdeedu API Reference

Search