aboutsummaryrefslogtreecommitdiff
path: root/src/tafnode.cpp
diff options
context:
space:
mode:
authorMike Buland <eichlan@xagasoft.com>2007-07-12 22:52:13 +0000
committerMike Buland <eichlan@xagasoft.com>2007-07-12 22:52:13 +0000
commitd093a607848aa4cce99729d9b301f4888dfa66db (patch)
tree9fdabd3d3c3bfeb7b474a72f9c41b3abff298050 /src/tafnode.cpp
parentc67327f6d1b76de4212e70881ce5ca7e07ab096c (diff)
downloadlibbu++-d093a607848aa4cce99729d9b301f4888dfa66db.tar.gz
libbu++-d093a607848aa4cce99729d9b301f4888dfa66db.tar.bz2
libbu++-d093a607848aa4cce99729d9b301f4888dfa66db.tar.xz
libbu++-d093a607848aa4cce99729d9b301f4888dfa66db.zip
The SPtr now has != comparison operators
Diffstat (limited to 'src/tafnode.cpp')
-rw-r--r--src/tafnode.cpp23
1 files changed, 0 insertions, 23 deletions
diff --git a/src/tafnode.cpp b/src/tafnode.cpp
index 53b782e..98bb030 100644
--- a/src/tafnode.cpp
+++ b/src/tafnode.cpp
@@ -14,28 +14,6 @@ const Bu::TafNode::NodeType Bu::TafNode::getType() const
14 return eType; 14 return eType;
15} 15}
16 16
17/*
18const Bu::TafNode::PropList &Bu::TafNode::getProperties( const Bu::FString &sName ) const
19{
20 return hProp.get( sName );
21}
22
23const Bu::TafNode::NodeList &Bu::TafNode::getChildren( const Bu::FString &sName ) const
24{
25 return hChildren.get( sName );
26}
27
28const Bu::FString &Bu::TafNode::getProperty( const Bu::FString &sName ) const
29{
30 return getProperties( sName ).first();
31}
32
33const Bu::TafNode *Bu::TafNode::getChild( const Bu::FString &sName ) const
34{
35 return getChildren( sName ).first();
36}
37*/
38
39Bu::TafGroup::TafGroup( const Bu::FString &sName ) : 17Bu::TafGroup::TafGroup( const Bu::FString &sName ) :
40 TafNode( typeGroup ), 18 TafNode( typeGroup ),
41 sName( sName ) 19 sName( sName )
@@ -44,7 +22,6 @@ Bu::TafGroup::TafGroup( const Bu::FString &sName ) :
44 22
45Bu::TafGroup::~TafGroup() 23Bu::TafGroup::~TafGroup()
46{ 24{
47 //printf("Entering Bu::TafNode::~TafNode() \"%s\"\n", sName.getStr() );
48 for( NodeList::iterator i = lChildren.begin(); i != lChildren.end(); i++ ) 25 for( NodeList::iterator i = lChildren.begin(); i != lChildren.end(); i++ )
49 { 26 {
50 delete (*i); 27 delete (*i);