a_dxf_hatch.cxx

Go to the documentation of this file.

/*
Copyright 2002-2011 Pierre SMARS (smars@yuntech.edu.tw)
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, see <http://www.gnu.org/licenses/>.
*/
#include "a_dxf_hatch.h"
#include "a_dxf_group.h"
 
//---------------------------------------------------------------------------
a_dxf_hatch::a_dxf_hatch(std::istream * file) : a_dxf_entity(file)
{
 
}
//---------------------------------------------------------------------------
void a_dxf_hatch::init()
{
        x_.clear();
        y_.clear();
        z_.clear();
}
//---------------------------------------------------------------------------
bool a_dxf_hatch::read()
{
        a_dxf_group group(file_);
        layer_ = "0";
        bool stop = false;
        for (;;)
        {
                group.read();
                if (group.code()==8)
                        layer_ = group.data();
                else if (group.code()==93)
                {
                        int n_edge = group.data_int();
                        int ix = 0, iy = 0;
                        do
                        {
                                group.read();
                                if (group.code()==10)
                                {
                                        x_.push_back(group.data_double());
                                        ix++;
                                }
                                else if (group.code()==20)
                                {
                                        y_.push_back(group.data_double());
                                        z_.push_back(0.);
                                        iy++;
                                }
                        } while ((ix<n_edge)||(iy<n_edge));
                }
                else if (group.code()==0)
                        break;
        }
        group.putback();
        return true;
}