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.
128 lines
3.0 KiB
128 lines
3.0 KiB
//
|
|
// LinkBase.m
|
|
// ANTLR
|
|
//
|
|
// Created by Alan Condit on 6/14/10.
|
|
// [The "BSD licence"]
|
|
// Copyright (c) 2010 Alan Condit
|
|
// All rights reserved.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions
|
|
// are met:
|
|
// 1. Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
// 2. Redistributions in binary form must reproduce the above copyright
|
|
// notice, this list of conditions and the following disclaimer in the
|
|
// documentation and/or other materials provided with the distribution.
|
|
// 3. The name of the author may not be used to endorse or promote products
|
|
// derived from this software without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
// OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
// IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
// INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
// NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
// THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
#import "LinkBase.h"
|
|
|
|
@implementation LinkBase
|
|
|
|
@synthesize fPrev;
|
|
@synthesize fNext;
|
|
|
|
+(id<LinkList>)newLinkBase
|
|
{
|
|
return [[LinkBase alloc] init];
|
|
}
|
|
|
|
+(id<LinkList>)newLinkBase:(id<LinkList>)np Prev:(id<LinkList>)pp
|
|
{
|
|
return [[LinkBase alloc] initWithPtr:np Prev:pp];
|
|
}
|
|
|
|
-(id<LinkList>)init
|
|
{
|
|
if ((self = [super init]) != nil) {
|
|
fNext = nil;
|
|
fPrev = nil;
|
|
}
|
|
return(self);
|
|
}
|
|
|
|
-(id<LinkList>)initWithPtr:(id<LinkList>)np Prev:(id<LinkList>)pp
|
|
{
|
|
if ((self = [super init]) != nil) {
|
|
fNext = np;
|
|
fPrev = pp;
|
|
}
|
|
return(self);
|
|
}
|
|
|
|
-(void)dealloc
|
|
{
|
|
#ifdef DEBUG_DEALLOC
|
|
NSLog( @"called dealloc in LinkBase" );
|
|
#endif
|
|
if (fNext) [fNext release];
|
|
if (fPrev) [fPrev release];
|
|
[super dealloc];
|
|
}
|
|
|
|
- (id) copyWithZone:(NSZone *)aZone
|
|
{
|
|
LinkBase *copy;
|
|
|
|
copy = [[self class] allocWithZone:aZone];
|
|
copy.fPrev = fPrev;
|
|
copy.fNext = fNext;
|
|
return( copy );
|
|
}
|
|
|
|
-(id<LinkList>)append:(id<LinkList>)node
|
|
{
|
|
node.fPrev = (id<LinkList>)self;
|
|
node.fNext = (id<LinkList>)self.fNext;
|
|
if (node.fNext != nil)
|
|
node.fNext.fPrev = node;
|
|
self.fNext = node;
|
|
return( node );
|
|
}
|
|
|
|
-(id<LinkList>)insert:(id<LinkList>)node
|
|
{
|
|
node.fNext = self;
|
|
node.fPrev = self.fPrev;
|
|
if (node.fPrev != nil)
|
|
node.fPrev.fNext = node;
|
|
self.fPrev = node;
|
|
return( node );
|
|
}
|
|
|
|
-(id<LinkList>)getfNext
|
|
{
|
|
return(fNext);
|
|
}
|
|
|
|
-(void)setfNext:(id<LinkList>)np
|
|
{
|
|
fNext = np;
|
|
}
|
|
|
|
-(id<LinkList>)getfPrev
|
|
{
|
|
return(fPrev);
|
|
}
|
|
|
|
-(void)setfPrev:(id<LinkList>)pp
|
|
{
|
|
fPrev = pp;
|
|
}
|
|
|
|
@end
|