LCisect_vector.h

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

#include <vector>
#include "topo/LCisect.h"

//Forward class declaration.
class MGCurve;
class MGLoop;
class MGInterval;


class MG_DLL_DECLR MGLCisect_vector{

public:

typedef std::vector<MGLCisect>::iterator LCiterator;
typedef std::vector<MGLCisect>::const_iterator const_LCiterator;
typedef std::vector<MGLCisect>::iterator iterator;
typedef std::vector<MGLCisect>::const_iterator const_iterator;

public:

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

MGLCisect_vector();
MGLCisect_vector(const MGLoop& loop);       

// Operator overload.

const MGLCisect& operator[](int i)const{return m_lcisects[i];};
MGLCisect& operator[](int i){return m_lcisects[i];};


iterator begin(){return m_lcisects.begin();};
const_iterator begin()const{return m_lcisects.begin();};
iterator end(){return m_lcisects.end();};
const_iterator end()const{return m_lcisects.end();};

void append(const MGLCisect& lcisect);

void append(
    const MGLEPoint& lp,        
    double t,               
    const MGPosition& uv    
);

void append(const MGLCisect_vector& list);

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

const MGLCisect& first() const{return m_lcisects.front();};

void insertAt(LCiterator i, const MGLCisect& lcisect)
{m_lcisects.insert(i, lcisect);};

bool empty() const{return m_lcisects.empty();};

const MGLCisect& last() const{return m_lcisects.back();};

const MGLoop* loop() const {return m_loop;};

void update_lepoint(
    const MGLEPoint& lep
);

private:
    std::vector<MGLCisect> m_lcisects;
    const MGLoop* m_loop;
    double m_error_square;      

};
 // end of IsectContainer group
#endif