CCisect_list.h

/********************************************************************/
/* Copyright (c) 2015 DG Technologies Inc. and Yuzi Mizuno          */
/* All rights reserved.                                             */
/********************************************************************/
#ifndef _MGCCisect_list_HH_
#define _MGCCisect_list_HH_

#include "mg/CCisect.h"

//Forward class declaration.
class MGCurve;


class MG_DLL_DECLR MGCCisect_list{

public:

typedef std::list<MGCCisect> container_type;

typedef container_type::iterator CCiterator;
typedef container_type::const_iterator const_CCiterator;

typedef container_type::iterator iterator;
typedef container_type::const_iterator const_iterator;

MG_DLL_DECLR friend std::ostream& operator<< (std::ostream&, const MGCCisect_list& );

explicit MGCCisect_list(const MGCurve *c1=NULL, const MGCurve *c2=NULL);

//Copy Constructor.
//MGCCisect_list(const MGCCisect_list& list);

~MGCCisect_list(){;};


//Assignment.
//MGCCisect_list& MGCCisect_list::operator= (const MGCCisect_list&);


void append(
    const MGCCisect& isect
);
void push_back(
    const MGCCisect& isect
){m_CCilist.push_back(isect);};

void append(
    const MGPosition& point,    
    double t1,                  
    double t2,                  
    const MGCCRELATION r1=MGCCREL_UNKNOWN
);

void append(const MGCCisect_list& lst);

CCiterator begin(){return m_CCilist.begin();}
const_CCiterator begin() const{return m_CCilist.begin();}

void clear(){m_CCilist.clear();}

const MGCurve* curve1() const {return m_curve1;}

const MGCurve* curve2() const {return m_curve2;}

CCiterator end(){return m_CCilist.end();}
const_CCiterator end() const{return m_CCilist.end();}

int entries() const{return int(m_CCilist.size());};
int size() const{return int(m_CCilist.size());};

CCiterator erase(CCiterator i){return m_CCilist.erase(i);}

const MGCCisect& first() const{return m_CCilist.front();};
const MGCCisect& front() const{return m_CCilist.front();};

void insertAt(CCiterator i, const MGCCisect& isect)
{m_CCilist.insert(i, isect);};

bool isEmpty() const{return m_CCilist.empty();};
bool empty() const{return m_CCilist.empty();};

const MGCCisect& last() const{return m_CCilist.back();};
const MGCCisect& back() const{return m_CCilist.back();};

void pop_front(){m_CCilist.pop_front();}

void pop_back(){m_CCilist.pop_back();}

void prepend(const MGCCisect& isect){m_CCilist.push_front(isect);};
void push_front(const MGCCisect& isect){m_CCilist.push_front(isect);};

MGCCisect removeAt(CCiterator i);

MGCCisect removeFirst();

MGCCisect removeLast();

MGCCisect_list& replace12() ;

private:
    std::list<MGCCisect> m_CCilist;
    const MGCurve* m_curve1;    
    const MGCurve* m_curve2;    
    double m_error;         

};
 // end of IsectContainer group
#endif