mirror of
https://github.com/gnustep/libs-base.git
synced 2025-04-22 08:26:27 +00:00
105 lines
2.3 KiB
Mathematica
105 lines
2.3 KiB
Mathematica
|
/* Implementation for Objective-C BinaryTreeNode object
|
||
|
Copyright (C) 1993,1994, 1995, 1996 Free Software Foundation, Inc.
|
||
|
|
||
|
Written by: Andrew Kachites McCallum <mccallum@gnu.ai.mit.edu>
|
||
|
Date: May 1993
|
||
|
|
||
|
This file is part of the GNUstep Base Library.
|
||
|
|
||
|
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; if not, write to the Free
|
||
|
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111 USA.
|
||
|
*/
|
||
|
|
||
|
#include <config.h>
|
||
|
#include <base/BinaryTreeNode.h>
|
||
|
#include <base/NSString.h>
|
||
|
|
||
|
@implementation BinaryTreeNode
|
||
|
|
||
|
+ (void) initialize
|
||
|
{
|
||
|
if (self == [BinaryTreeNode class])
|
||
|
[self setVersion:0]; /* beta release */
|
||
|
}
|
||
|
|
||
|
- init
|
||
|
{
|
||
|
[super init];
|
||
|
_left = _right = _parent = nil;
|
||
|
return self;
|
||
|
}
|
||
|
|
||
|
- (void) encodeWithCoder: aCoder
|
||
|
{
|
||
|
[super encodeWithCoder:(id)aCoder];
|
||
|
[aCoder encodeObjectReference:_right withName:@"Right BinaryTree Node"];
|
||
|
[aCoder encodeObjectReference:_left withName:@"Left BinaryTree Node"];
|
||
|
[aCoder encodeObjectReference:_parent withName:@"Parent BinaryTree Node"];
|
||
|
[aCoder encodeObjectReference:_binary_tree
|
||
|
withName:@"BinaryTree"];
|
||
|
}
|
||
|
|
||
|
- initWithCoder: aCoder
|
||
|
{
|
||
|
[super initWithCoder:aCoder];
|
||
|
[aCoder decodeObjectAt:&_right withName:NULL];
|
||
|
[aCoder decodeObjectAt:&_left withName:NULL];
|
||
|
[aCoder decodeObjectAt:&_parent withName:NULL];
|
||
|
[aCoder decodeObjectAt:&_binary_tree withName:NULL];
|
||
|
return self;
|
||
|
}
|
||
|
|
||
|
- leftNode
|
||
|
{
|
||
|
return _left;
|
||
|
}
|
||
|
|
||
|
- rightNode
|
||
|
{
|
||
|
return _right;
|
||
|
}
|
||
|
|
||
|
- parentNode
|
||
|
{
|
||
|
return _parent;
|
||
|
}
|
||
|
|
||
|
- (void) setLeftNode: aNode
|
||
|
{
|
||
|
_left = aNode;
|
||
|
}
|
||
|
|
||
|
- (void) setRightNode: aNode
|
||
|
{
|
||
|
_right = aNode;
|
||
|
}
|
||
|
|
||
|
- (void) setParentNode: aNode
|
||
|
{
|
||
|
_parent = aNode;
|
||
|
}
|
||
|
|
||
|
- binaryTree
|
||
|
{
|
||
|
return _binary_tree;
|
||
|
}
|
||
|
|
||
|
- (void) setBinaryTree: anObject
|
||
|
{
|
||
|
_binary_tree = anObject;
|
||
|
}
|
||
|
|
||
|
@end
|
||
|
|