175 lines
3.9 KiB
C++
175 lines
3.9 KiB
C++
/*
|
|
* This program source code file is part of KiCad, a free EDA CAD application.
|
|
*
|
|
* Copyright (C) 2015 Cirilo Bernardo <cirilo.bernardo@gmail.com>
|
|
*
|
|
* 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, you may find one here:
|
|
* http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
|
|
* or you may search the http://www.gnu.org website for the version 2 license,
|
|
* or you may write to the Free Software Foundation, Inc.,
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
|
|
*/
|
|
|
|
|
|
#include <iostream>
|
|
#include "plugins/3dapi/ifsg_coordindex.h"
|
|
#include "3d_cache/sg/sg_coordindex.h"
|
|
#include "plugins/3dapi/sg_types.h"
|
|
|
|
|
|
extern char BadObject[];
|
|
extern char BadOperand[];
|
|
extern char BadParent[];
|
|
extern char WrongParent[];
|
|
|
|
|
|
IFSG_COORDINDEX::IFSG_COORDINDEX( bool create )
|
|
{
|
|
m_node = NULL;
|
|
|
|
if( !create )
|
|
return;
|
|
|
|
m_node = new SGCOORDINDEX( NULL );
|
|
|
|
if( m_node )
|
|
m_node->AssociateWrapper( &m_node );
|
|
|
|
return;
|
|
}
|
|
|
|
|
|
IFSG_COORDINDEX::IFSG_COORDINDEX( SGNODE* aParent )
|
|
{
|
|
m_node = new SGCOORDINDEX( NULL );
|
|
|
|
if( !m_node->SetParent( aParent ) )
|
|
{
|
|
delete m_node;
|
|
m_node = NULL;
|
|
|
|
#ifdef DEBUG
|
|
std::cerr << __FILE__ << ": " << __FUNCTION__ << ": " << __LINE__ << "\n";
|
|
std::cerr << WrongParent << "\n";
|
|
#endif
|
|
|
|
return;
|
|
}
|
|
|
|
m_node->AssociateWrapper( &m_node );
|
|
|
|
return;
|
|
}
|
|
|
|
|
|
IFSG_COORDINDEX::IFSG_COORDINDEX( IFSG_NODE& aParent )
|
|
{
|
|
SGNODE* pp = aParent.GetRawPtr();
|
|
|
|
if( !pp )
|
|
{
|
|
#ifdef DEBUG
|
|
std::cerr << __FILE__ << ": " << __FUNCTION__ << ": " << __LINE__ << "\n";
|
|
std::cerr << BadParent << "\n";
|
|
#endif
|
|
|
|
return;
|
|
}
|
|
|
|
m_node = new SGCOORDINDEX( NULL );
|
|
|
|
if( !m_node->SetParent( pp ) )
|
|
{
|
|
#ifdef DEBUG
|
|
std::cerr << __FILE__ << ": " << __FUNCTION__ << ": " << __LINE__ << "\n";
|
|
std::cerr << WrongParent << "\n";
|
|
#endif
|
|
|
|
delete m_node;
|
|
m_node = NULL;
|
|
return;
|
|
}
|
|
|
|
m_node->AssociateWrapper( &m_node );
|
|
|
|
return;
|
|
}
|
|
|
|
|
|
bool IFSG_COORDINDEX::Attach( SGNODE* aNode )
|
|
{
|
|
if( m_node )
|
|
m_node->DisassociateWrapper( &m_node );
|
|
|
|
m_node = NULL;
|
|
|
|
if( !aNode )
|
|
return false;
|
|
|
|
if( S3D::SGTYPE_COORDINDEX != aNode->GetNodeType() )
|
|
{
|
|
return false;
|
|
}
|
|
|
|
m_node = aNode;
|
|
m_node->AssociateWrapper( &m_node );
|
|
|
|
return true;
|
|
}
|
|
|
|
|
|
bool IFSG_COORDINDEX::NewNode( SGNODE* aParent )
|
|
{
|
|
if( m_node )
|
|
m_node->DisassociateWrapper( &m_node );
|
|
|
|
m_node = new SGCOORDINDEX( aParent );
|
|
|
|
if( aParent != m_node->GetParent() )
|
|
{
|
|
#ifdef DEBUG
|
|
std::cerr << __FILE__ << ": " << __FUNCTION__ << ": " << __LINE__ << "\n";
|
|
std::cerr << " * [BUG] invalid SGNODE parent (";
|
|
std::cerr << aParent->GetNodeTypeName( aParent->GetNodeType() );
|
|
std::cerr << ") to SGCOORDINDEX\n";
|
|
#endif
|
|
|
|
delete m_node;
|
|
m_node = NULL;
|
|
return false;
|
|
}
|
|
|
|
m_node->AssociateWrapper( &m_node );
|
|
|
|
return true;
|
|
}
|
|
|
|
|
|
bool IFSG_COORDINDEX::NewNode( IFSG_NODE& aParent )
|
|
{
|
|
SGNODE* np = aParent.GetRawPtr();
|
|
|
|
if( NULL == np )
|
|
{
|
|
#ifdef DEBUG
|
|
std::cerr << __FILE__ << ": " << __FUNCTION__ << ": " << __LINE__ << "\n";
|
|
std::cerr << BadParent << "\n";
|
|
#endif
|
|
|
|
return false;
|
|
}
|
|
|
|
return NewNode( np );
|
|
}
|