You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
tdepim/kode/class.cpp

177 lines
3.8 KiB

/*
This file is part of kdepim.
Copyright (c) 2004 Cornelius Schumacher <schumacher@kde.org>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library 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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#include "class.h"
#include <kdebug.h>
using namespace KODE;
Class::Class()
{
mBaseClasses.setAutoDelete( true );
}
Class::Class( const TQString &name, const TQString &nameSpace )
: mName( name ), mNameSpace( nameSpace )
{
}
Class::Class( const Class &c )
{
*this = c;
}
Class &Class::operator=( const Class &c )
{
if ( this == &c ) return *this;
mName = c.mName;
mNameSpace = c.mNameSpace;
mFunctions = c.mFunctions;
mMemberVariables = c.mMemberVariables;
mIncludes = c.mIncludes;
mHeaderIncludes = c.mHeaderIncludes;
mForwardDeclarations = c.mForwardDeclarations;
mEnums = c.mEnums;
mDocs = c.mDocs;
TQPtrListIterator<Class> it( c.mBaseClasses );
while( it.current() ) {
mBaseClasses.append( new Class( *( it.current() ) ) );
++it;
}
mTypedefs = c.mTypedefs;
return *this;
}
void Class::setName( const TQString &name )
{
mName = name;
}
void Class::setNameSpace( const TQString &nameSpace )
{
mNameSpace = nameSpace;
}
void Class::addInclude( const TQString &include,
const TQString &forwardDeclaration )
{
if ( mIncludes.find( include ) == mIncludes.end() ) {
mIncludes.append( include );
}
if( !forwardDeclaration.isEmpty() &&
mForwardDeclarations.find( forwardDeclaration ) ==
mForwardDeclarations.end() ) {
mForwardDeclarations.append( forwardDeclaration );
}
}
void Class::addHeaderInclude( const TQString &include )
{
if ( include.isEmpty() )
return;
if ( mHeaderIncludes.find( include ) == mHeaderIncludes.end() ) {
mHeaderIncludes.append( include );
}
}
void Class::addHeaderIncludes( const TQStringList &includes )
{
TQStringList::ConstIterator it;
for ( it = includes.begin(); it != includes.end(); ++it )
addHeaderInclude( *it );
}
void Class::addBaseClass( const Class &c )
{
mBaseClasses.append( new Class( c ) );
}
void Class::addFunction( const Function &function )
{
mFunctions.append( function );
}
void Class::addMemberVariable( const MemberVariable &v )
{
mMemberVariables.append( v );
}
Class::List Class::baseClasses() const
{
Class::List b;
TQPtrListIterator<Class> it( mBaseClasses );
while( it.current() ) {
b.append( Class( *( it.current() ) ) );
++it;
}
return b;
}
void Class::addTypedef( const Typedef &t )
{
mTypedefs.append( t );
}
void Class::addEnum( const Enum &e )
{
mEnums.append( e );
}
bool Class::isValid() const
{
return !mName.isEmpty();
}
bool Class::hasFunction( const TQString &functionName ) const
{
Function::List::ConstIterator it;
for( it = mFunctions.begin(); it != mFunctions.end(); ++it ) {
if ( (*it).name() == functionName ) return true;
}
return false;
}
bool Class::isTQObject() const
{
Function::List::ConstIterator it;
for( it = mFunctions.begin(); it != mFunctions.end(); ++it ) {
if ( (*it).access() & Function::Signal || (*it).access() & Function::Slot )
return true;
}
return false;
}
void Class::setDocs( const TQString &str )
{
mDocs = str;
}