mesh_split_file_writer.H

Go to the documentation of this file.

// Copyright (C) 2008 University of Louisiana at Lafayette
// Authors: Christopher Mire

#ifndef CAJUN_MESH_SPLIT_FILE_WRITER_H
#define CAJUN_MESH_SPLIT_FILE_WRITER_H

#include "mesh_writer_interface.H"
#include "access_data.H"

#include <fstream>
#include <vector>

namespace cajun
{
class mesh_split_file_writer_t : public mesh_writer_interface_t
{
public:
        mesh_split_file_writer_t (unsigned id_, size_t max_cells_);
        ~mesh_split_file_writer_t ();
        void write_mesh (const cell_t &cell1_,
                         point_3d_t &pt1_,
                         const cell_t &cell2_,
                         point_3d_t &pt2_,
                         const cell_t &cell3_,
                         point_3d_t &pt3_);
        void write_point (const cell_t &cell_, point_3d_t &pt_);
private:
        struct cell_index_t
        {
                cell_index_t () {;}
                cell_index_t (size_t cell_id_, size_t pt_id_, size_t index_)
                        {
                                cell_id = cell_id_;
                                pt_id = pt_id_;
                                index = index_;
                        };
                size_t cell_id;
                size_t pt_id;
                size_t index;
                bool operator== (const cell_index_t &cell_index_) const
                        {
                                return this->cell_id == cell_index_.cell_id &&
                                        this->pt_id == cell_index_.pt_id;
                        }
        };

        std::ofstream m_indices_file;
        std::ofstream m_vertices_file;

        triangle_data_t m_triangle_data;

        access_data_t *m_ad;
        unsigned m_qid;

        //restriced in size, used as ring buffer
        std::vector<cell_index_t> m_cell_indices;
        //static size of m_cell_indices
        size_t m_index_size;
        //current insert position into m_cell_indices
        unsigned m_index_counter;
        size_t m_num_vertices;
        bool m_match_closest_pts;

};
};

#endif

---