Rogue Wave banner
Previous fileTop of documentContentsIndexNext file

RWBinaryTree


RWBinaryTree-->RWCollection-->RWCollectable

Data Type and Member Function Indexes
(exclusive of constructors and destructors)

Synopsis

typedef RWBinaryTree SortedCollection;   // Smalltalk typedef.
#include <rw/bintree.h>
RWBinaryTree bt;

Description

Class RWBinaryTree represents a group of ordered elements, internally sorted by the compareTo() function. Duplicates are allowed. An object stored by an RWBinaryTree must inherit abstract base class RWCollectable.

Persistence

Polymorphic

Public Constructors

RWBinaryTree();
RWBinaryTree(const RWBinaryTree& t);
virtual ~RWBinaryTree();

Public Member Operators

void
operator=(const RWBinaryTree& bt);
void
operator+=(const RWCollection ct);
RWBoolean
operator<=(const RWBinaryTree& bt) const;
RWBoolean
operator==(const RWBinaryTree& bt) const;

Public Member Functions

virtual void
apply(RWapplyCollectable ap, void*);
void
balance();
virtual RWspace
binaryStoreSize() const;
virtual void
clear();
virtual void
clearAndDestroy();
virtual int
compareTo(const RWCollectable* a) const;
virtual RWBoolean
contains(const RWCollectable* target) const;
virtual size_t
entries() const;
virtual RWCollectable*
find(const RWCollectable* target) const;
virtual unsigned
hash() const;
unsigned
height() const;
virtual RWCollectable*
insert(RWCollectable* c);
virtual RWClassID
isA() const;
virtual RWBoolean
isEmpty() const;
virtual RWBoolean
isEqual(const RWCollectable* a) const;
virtual size_t
occurrencesOf(const RWCollectable* target) const;
virtual RWCollectable*
remove(const RWCollectable* target);
virtual void
removeAndDestroy(const RWCollectable* target);
virtual void
restoreGuts(RWvistream&);
virtual void
restoreGuts(RWFile&);
virtual void
saveGuts(RWvostream&) const;
virtual void
saveGuts(RWFile&) const;
RWStringID
stringID();


Previous fileTop of documentContentsIndexNext file
©Copyright 1999, Rogue Wave Software, Inc.
Send mail to report errors or comment on the documentation.