BSP_CSGMesh_CFIterator.h

Go to the documentation of this file.

/*
 * ***** BEGIN GPL LICENSE BLOCK *****
 *
 * 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, write to the Free Software Foundation,
 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
 *
 * The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
 * All rights reserved.
 *
 * The Original Code is: all of this file.
 *
 * Contributor(s): none yet.
 *
 * ***** END GPL LICENSE BLOCK *****
 */

#ifndef BSP_CSGMesh_CFIterator_h

#define BSP_CSGMesh_CFIterator_h

#include "BSP_CSGMesh.h"
#include "../extern/CSG_BooleanOps.h"
struct BSP_CSGMesh_VertexIt {
        BSP_CSGMesh *mesh;
        BSP_MVertex * pos;
};


inline
        void
BSP_CSGMesh_VertexIt_Destruct(
        CSG_VertexIteratorDescriptor * iterator
) {
        delete ((BSP_CSGMesh_VertexIt *)(iterator->it));
        iterator->it = NULL;
        iterator->Done = NULL;
        iterator->Fill = NULL;
        iterator->Reset = NULL;
        iterator->Step = NULL;
        iterator->num_elements = 0;
};


inline
        int
BSP_CSGMesh_VertexIt_Done(
        CSG_IteratorPtr it
) {
        // assume CSG_IteratorPtr is of the correct type.
        BSP_CSGMesh_VertexIt * vertex_it = (BSP_CSGMesh_VertexIt *)it;

        /* dereferencing iterator::end() is illegal, so we dereference 1 before it */
        /* also check that vector is not empty */
        if (vertex_it->mesh->VertexSet().size() && 
                        vertex_it->pos <= &(*(vertex_it->mesh->VertexSet().end() -1) )) return 0;
        return 1;
};

inline
        void
BSP_CSGMesh_VertexIt_Fill(
        CSG_IteratorPtr it,
        CSG_IVertex *vert
) {
        // assume CSG_IteratorPtr is of the correct type.
        BSP_CSGMesh_VertexIt * vertex_it = (BSP_CSGMesh_VertexIt *)it;
                        
        vertex_it->pos->m_pos.getValue(vert->position);
};

inline
        void
BSP_CSGMesh_VertexIt_Step(
        CSG_IteratorPtr it
) {
        // assume CSG_IteratorPtr is of the correct type.
        BSP_CSGMesh_VertexIt * vertex_it = (BSP_CSGMesh_VertexIt *)it;

        ++(vertex_it->pos);
};

inline
        void
BSP_CSGMesh_VertexIt_Reset(
        CSG_IteratorPtr it
) {
        // assume CSG_IteratorPtr is of the correct type.
        BSP_CSGMesh_VertexIt * vertex_it = (BSP_CSGMesh_VertexIt *)it;
        vertex_it->pos = &vertex_it->mesh->VertexSet()[0];
};      

inline
        void
BSP_CSGMeshVertexIt_Construct(
        BSP_CSGMesh *mesh,
        CSG_VertexIteratorDescriptor *output
){
        // user should have insured mesh is not equal to NULL.
        
        output->Done = BSP_CSGMesh_VertexIt_Done;
        output->Fill = BSP_CSGMesh_VertexIt_Fill;
        output->Step = BSP_CSGMesh_VertexIt_Step;
        output->Reset = BSP_CSGMesh_VertexIt_Reset;
        output->num_elements = mesh->VertexSet().size();
        
        BSP_CSGMesh_VertexIt * v_it = new BSP_CSGMesh_VertexIt;
        v_it->mesh = mesh;
        if( output->num_elements > 0 )
                v_it->pos = &mesh->VertexSet()[0];
        output->it = v_it;
};                      


struct BSP_CSGMesh_FaceIt {
        BSP_CSGMesh *mesh;
        BSP_MFace *pos;
        int face_triangle;
};


inline
        void
BSP_CSGMesh_FaceIt_Destruct(
        CSG_FaceIteratorDescriptor *iterator
) {
        delete ((BSP_CSGMesh_FaceIt *)(iterator->it));
        iterator->it = NULL;
        iterator->Done = NULL;
        iterator->Fill = NULL;
        iterator->Reset = NULL;
        iterator->Step = NULL;
        iterator->num_elements = 0;
};


inline
        int
BSP_CSGMesh_FaceIt_Done(
        CSG_IteratorPtr it
) {
        // assume CSG_IteratorPtr is of the correct type.
        BSP_CSGMesh_FaceIt * face_it = (BSP_CSGMesh_FaceIt *)it;

        /* dereferencing iterator::end() is illegal, so we dereference 1 before it */
        /* also check that vector is not empty */
        if (face_it->mesh->FaceSet().size() && 
                        face_it->pos <= &(*(face_it->mesh->FaceSet().end() -1))) {
                if (face_it->face_triangle + 3 <= (int)face_it->pos->m_verts.size()) {
                        return 0;
                }
        }
        return 1;
};

inline
        void
BSP_CSGMesh_FaceIt_Fill(
        CSG_IteratorPtr it,
        CSG_IFace *face
){
        // assume CSG_IteratorPtr is of the correct type.
        BSP_CSGMesh_FaceIt * face_it = (BSP_CSGMesh_FaceIt *)it;                
        // essentially iterating through a triangle fan here.

        if (face_it->pos->m_verts.size()>3) {
                // QUAD
                face->vertex_index[0] = int(face_it->pos->m_verts[0]);
                face->vertex_index[1] = int(face_it->pos->m_verts[1]);
                face->vertex_index[2] = int(face_it->pos->m_verts[2]);
                face->vertex_index[3] = int(face_it->pos->m_verts[3]);

                face->orig_face = face_it->pos->m_orig_face;

                face->vertex_number = 4;
        }
        else {
                // TRIANGLE
                face->vertex_index[0] = int(face_it->pos->m_verts[0]);
                face->vertex_index[1] = int(face_it->pos->m_verts[1]);
                face->vertex_index[2] = int(face_it->pos->m_verts[2]);

                face->orig_face = face_it->pos->m_orig_face;

                face->vertex_number = 3;
        }
};

inline
        void
BSP_CSGMesh_FaceIt_Step(
        CSG_IteratorPtr it
) {
        // assume CSG_IteratorPtr is of the correct type.
        BSP_CSGMesh_FaceIt * face_it = (BSP_CSGMesh_FaceIt *)it;                

        /* dereferencing iterator::end() is illegal, so we dereference 1 before it */
        /* also check that vector is not empty */
        if (face_it->mesh->FaceSet().size() && 
                        face_it->pos <= &(*(face_it->mesh->FaceSet().end() -1))) {

                //if (face_it->face_triangle + 3 < face_it->pos->m_verts.size()) {
                //      (face_it->face_triangle)++;
                //} else {
                        face_it->face_triangle = 0;
                        (face_it->pos) ++;
                //}
        }
};

inline
        void
BSP_CSGMesh_FaceIt_Reset(
        CSG_IteratorPtr it
) {
        // assume CSG_IteratorPtr is of the correct type.
        BSP_CSGMesh_FaceIt * f_it = (BSP_CSGMesh_FaceIt *)it;           
        f_it->pos = &f_it->mesh->FaceSet()[0];
        f_it->face_triangle = 0;
};

inline
        void
BSP_CSGMesh_FaceIt_Construct(
        BSP_CSGMesh * mesh,
        CSG_FaceIteratorDescriptor *output
) {

        output->Done = BSP_CSGMesh_FaceIt_Done;
        output->Fill = BSP_CSGMesh_FaceIt_Fill;
        output->Step = BSP_CSGMesh_FaceIt_Step;
        output->Reset = BSP_CSGMesh_FaceIt_Reset;

        output->num_elements = mesh->FaceSet().size();
        
        BSP_CSGMesh_FaceIt * f_it = new BSP_CSGMesh_FaceIt;
        f_it->mesh = mesh;
        if( output->num_elements > 0 )
                f_it->pos = &mesh->FaceSet()[0];
        f_it->face_triangle = 0;

        output->it = f_it;
};


#endif