home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
OS/2 Shareware BBS: 10 Tools
/
10-Tools.zip
/
cset21v1.zip
/
IBMCPP
/
IBMCLASS
/
ILNSEQ.IF
< prev
next >
Wrap
Text File
|
1993-09-22
|
14KB
|
421 lines
/*******************************************************************************
* *
* COPYRIGHT: *
* IBM C/C++ Tools Version 2.01 - Collection Class Library *
* Licensed Materials - Property of IBM *
* (C) Copyright IBM Corporation 1992, 1993 *
* All Rights Reserved *
* US Government Users Restricted Rights - Use, duplication, or disclosure *
* restricted by GSA ADP Schedule Contract with IBM Corp. *
* *
*******************************************************************************/
#include <ibexcept.h>
template < class Element, class ElementOps >
inline void IGLinkedSequence < Element, ElementOps >::
checkNotEmpty () const
{
#ifndef INO_CHECKS
ICHECK (!isEmpty (), IEmptyException, ICollectionIsEmptyText)
#endif
}
template < class Element, class ElementOps >
inline void IGLinkedSequence < Element, ElementOps >::
checkCursorIsForThis (ICursor const& cursor) const
{
#ifndef INO_CHECKS
ICHECK (((Cursor const&)cursor).isFor (*this),
ICursorInvalidException, ICursorNotForThisText)
#endif
}
template < class Element, class ElementOps >
inline void IGLinkedSequence < Element, ElementOps >::
checkCursor (ICursor const& cursor) const
{
#ifndef INO_CHECKS
ICHECK (((Cursor const&)cursor).isFor (*this),
ICursorInvalidException, ICursorNotForThisText)
ICHECK (cursor.isValid (), ICursorInvalidException, IInvalidCursorText)
#endif
#ifdef IALL_CHECKS
ICHECK (ivImpl.checkNode(((Cursor const&)cursor).ivNode),
ICursorInvalidException, ICursorNotContainedText)
#endif
}
template < class Element, class ElementOps >
inline void IGLinkedSequence < Element, ElementOps >::
checkPositionExists (IPosition position) const
{
#ifndef INO_CHECKS
ICHECK (1 <= position && position <= numberOfElements(),
IPositionInvalidException, IInvalidPositionText)
#endif
}
template < class Element, class ElementOps >
inline void IGLinkedSequence < Element, ElementOps >::
checkPositionForAdd (IPosition position) const
{
#ifndef INO_CHECKS
ICHECK (1 <= position && position <= numberOfElements() + 1,
IPositionInvalidException, IInvalidPositionText)
#endif
}
template <class Element, class ElementOps>
inline IGLinkedSequence <Element, ElementOps>::
IGLinkedSequence (INumber n)
: ivImpl (&ivOps) {
}
template <class Element, class ElementOps>
inline IGLinkedSequence <Element, ElementOps>::
IGLinkedSequence (IGLinkedSequence < Element, ElementOps > const& sequence)
: ivImpl (sequence.ivImpl, &ivOps) {
}
template <class Element, class ElementOps>
inline IGLinkedSequence <Element, ElementOps>::
~IGLinkedSequence () {
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
add (Element const& element, ICursor& cursor)
{ addAsLast (element, cursor);
return True;
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
add (Element const& element)
{ Cursor cursor (*this);
return add (element, cursor);
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
addAllFrom (IGLinkedSequence < Element, ElementOps > const& sequence)
{
#ifndef INO_CHECKS
ICHECK (this != &sequence,
IIdenticalCollectionException, IIdenticalCollectionText)
#endif
ivImpl.addAllFrom (sequence.ivImpl);
}
template <class Element, class ElementOps>
inline Element const& IGLinkedSequence <Element, ElementOps>::
elementAt (ICursor const& cursor) const
{ checkCursor (cursor);
return ((Node*) ((Cursor const&)cursor).ivNode)->ivElement;
}
template <class Element, class ElementOps>
inline Element& IGLinkedSequence <Element, ElementOps>::
elementAt (ICursor const& cursor)
{ checkCursor (cursor);
return ((Node*) ((Cursor const&)cursor).ivNode)->ivElement;
}
template <class Element, class ElementOps>
inline Element const& IGLinkedSequence <Element, ElementOps>::
anyElement () const
{ return firstElement ();
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
removeAt (ICursor const& cursor)
{ checkCursor (cursor);
ivImpl.removeAt (((Cursor&)cursor).ivNode);
}
template < class Element, class ElementOps >
inline INumber IGLinkedSequence < Element, ElementOps >::
removeAll (IBoolean (*predicate) (Element const&, void*), void* env)
{ return ivImpl.removeAll (predicate, env);
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
replaceAt (ICursor const& cursor, Element const& element)
{ checkCursor (cursor);
elementOps().assign
(((Node*) ((Cursor const&)cursor).ivNode)->ivElement, element);
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
removeAll ()
{ ivImpl.removeAll ();
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
isBounded () const
{ return False;
}
template <class Element, class ElementOps>
inline INumber IGLinkedSequence <Element, ElementOps>::
maxNumberOfElements () const
{ ICHECK (False, INotBoundedException,
INotBoundedText)
return 0;
}
template <class Element, class ElementOps>
inline INumber IGLinkedSequence <Element, ElementOps>::
numberOfElements () const
{ return ivImpl.numberOfElements ();
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
isEmpty () const
{ return ivImpl.isEmpty ();
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
isFull () const
{ return ivImpl.isFull ();
}
template <class Element, class ElementOps>
inline ICursor* IGLinkedSequence <Element, ElementOps>::
newCursor () const
{ ICursor* result = new Cursor (*this);
ICHECK (result != 0, IOutOfMemory, IOutOfMemoryText)
return result;
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
setToFirst (ICursor& cursor) const
{ checkCursorIsForThis (cursor);
return ivImpl.setToFirst (((Cursor&)cursor).ivNode);
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
setToNext (ICursor& cursor) const
{ checkCursor (cursor);
return ivImpl.setToNext (((Cursor&)cursor).ivNode);
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
allElementsDo (IBoolean (*function) (Element&, void*), void* env)
{ return ivImpl.allElementsDo (function, env);
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
allElementsDo (IIterator < Element > & iterator)
{ return ivImpl.allElementsDo (&iterator);
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
allElementsDo (IBoolean (*function) (Element const&, void*),
void* env) const
{ return ivImpl.allElementsDo (function, env);
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
allElementsDo (IConstantIterator < Element > & iterator) const
{ return ivImpl.allElementsDo (&iterator);
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
isConsistent () const
{ return ivImpl.isConsistent ();
}
template <class Element, class ElementOps>
inline IGLinkedSequence <Element, ElementOps>&
IGLinkedSequence <Element, ElementOps>::
operator = (IGLinkedSequence < Element, ElementOps > const& sequence)
{ if (&sequence != this) {
removeAll ();
addAllFrom (sequence);
}
return *this;
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
removeFirst ()
{ checkNotEmpty ();
ivImpl.removeFirst ();
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
removeLast ()
{ checkNotEmpty ();
ivImpl.removeLast ();
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
removeAtPosition (IPosition position)
{ checkPositionExists (position);
ivImpl.removeAtPosition (position);
}
template <class Element, class ElementOps>
inline Element const& IGLinkedSequence <Element, ElementOps>::
firstElement () const
{ checkNotEmpty ();
ILinkedSequenceImpl::Node *node;
ivImpl.setToFirst (node);
return ((Node*)node)->ivElement;
}
template <class Element, class ElementOps>
inline Element const& IGLinkedSequence <Element, ElementOps>::
lastElement () const
{ checkNotEmpty ();
ILinkedSequenceImpl::Node *node;
ivImpl.setToLast (node);
return ((Node*)node)->ivElement;
}
template <class Element, class ElementOps>
inline Element const& IGLinkedSequence <Element, ElementOps>::
elementAtPosition (IPosition position) const
{ checkPositionExists (position);
ILinkedSequenceImpl::Node *node;
ivImpl.setToPosition (position, node);
return ((Node*)node)->ivElement;
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
setToLast (ICursor& cursor) const
{ checkCursorIsForThis (cursor);
return ivImpl.setToLast (((Cursor&)cursor).ivNode);
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
setToPrevious (ICursor& cursor) const
{ checkCursor (cursor);
return ivImpl.setToPrevious (((Cursor&)cursor).ivNode);
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
setToPosition (IPosition position, ICursor& cursor) const
{ checkPositionExists (position);
checkCursorIsForThis (cursor);
ivImpl.setToPosition (position, ((Cursor&)cursor).ivNode);
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
isFirst (ICursor const& cursor) const
{ checkCursor (cursor);
return ivImpl.isFirst (((Cursor const&)cursor).ivNode);
}
template <class Element, class ElementOps>
inline IBoolean IGLinkedSequence <Element, ElementOps>::
isLast (ICursor const& cursor) const
{ checkCursor (cursor);
return ivImpl.isLast (((Cursor const&)cursor).ivNode);
}
template <class Element, class ElementOps>
inline long IGLinkedSequence <Element, ElementOps>::
compare (IGLinkedSequence < Element, ElementOps > const& sequence,
long (*comparisonFunction) (Element const&, Element const&)) const {
return ivImpl.compare (sequence.ivImpl, comparisonFunction);
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
addAsFirst (Element const& element)
{ Cursor cursor (*this);
addAsFirst (element, cursor);
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
addAsFirst (Element const& element, ICursor& cursor)
{ checkCursorIsForThis (cursor);
Node* newNode = new Node (element);
ICHECK (newNode != 0, IOutOfMemory, IOutOfMemoryText)
((Cursor&)cursor).ivNode = ivImpl.addAsFirst (newNode);
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
addAsLast (Element const& element)
{ Cursor cursor (*this);
addAsLast (element, cursor);
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
addAsLast (Element const& element, ICursor& cursor)
{ checkCursorIsForThis (cursor);
Node* newNode = new Node (element);
ICHECK (newNode != 0, IOutOfMemory, IOutOfMemoryText)
((Cursor&)cursor).ivNode = ivImpl.addAsLast (newNode);
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
addAsNext (Element const& element, ICursor& cursor)
{ checkCursor (cursor);
Node* newNode = new Node (element);
ICHECK (newNode != 0, IOutOfMemory, IOutOfMemoryText)
((Cursor&)cursor).ivNode =
ivImpl.addAsNext (((Cursor&)cursor).ivNode, newNode);
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
addAsPrevious (Element const& element, ICursor& cursor)
{ checkCursor (cursor);
Node* newNode = new Node (element);
ICHECK (newNode != 0, IOutOfMemory, IOutOfMemoryText)
((Cursor&)cursor).ivNode =
ivImpl.addAsPrevious (((Cursor&)cursor).ivNode, newNode);
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
addAtPosition (IPosition position, Element const& element)
{ Cursor cursor (*this);
addAtPosition (position, element, cursor);
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
addAtPosition (IPosition position,
Element const& element,
ICursor& cursor) {
checkPositionForAdd (position);
checkCursorIsForThis (cursor);
Node* newNode = new Node (element);
ICHECK (newNode != 0, IOutOfMemory, IOutOfMemoryText)
((Cursor&)cursor).ivNode =
ivImpl.addAtPosition (position,newNode);
}
template <class Element, class ElementOps>
inline void IGLinkedSequence <Element, ElementOps>::
sort (long (*comparisonFunction) (Element const&, Element const&))
{ ivImpl.sort (comparisonFunction);
}