LLisect_vector.h

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

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

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


class MG_DLL_DECLR MGLLisect_vector{

public:

typedef std::vector<MGLLisect>::iterator LLiterator;
typedef std::vector<MGLLisect>::const_iterator const_LLiterator;
typedef std::vector<MGLLisect>::iterator iterator;
typedef std::vector<MGLLisect>::const_iterator const_iterator;

public:

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

MGLLisect_vector();
MGLLisect_vector(const MGLoop& loop);       


const MGLLisect& operator[](size_t i)const{return m_llisects[i];};
MGLLisect& operator[](size_t i){return m_llisects[i];};

void append(const MGLLisect& lli);
void append(
    const MGPosition& uv,   
    const MGLEPoint& lp1,   
    const MGLEPoint& lp2    
);

void append(const MGLLisect_vector& list);

iterator begin(){return m_llisects.begin();};
const_iterator begin()const{return m_llisects.begin();};

iterator end(){return m_llisects.end();};
const_iterator end()const{return m_llisects.end();};

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

const MGLLisect& first() const{return m_llisects.front();};

void insertAt(LLiterator i, const MGLLisect& llisect)
{m_llisects.insert(i, llisect);};

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

const MGLLisect& last() const{return m_llisects.back();};

private:
    std::vector<MGLLisect> m_llisects;
    double m_error_square;      

};
 // end of IsectContainer group
#endif