tuborc3.0

Online document

___________________________________________________________________________

The container class libraries

CONTENTS

1 The container class libraries 1 Member functions . . . . . . . 38

What's new since version 1.0? . . 1 Friends . . . . . . . . . . . . 40

Why two sets of libraries? . . . . 3 Array . . . . . . . . . . . . . . 41

Container basics . . . . . . . . . 4 Example . . . . . . . . . . . . 41

Association class . . . . . . 8 Bag . . . . . . . . . . . . . . . 47

Container classes . . . . . . . 8 Member functions . . . . . . . 47

Containers and ownership . . . . 9 BaseDate . . . . . . . . . . . . 49

Container iterators . . . . . 11 Member functions . . . . . . . 49

Sequence classes . . . . . . . 12 BaseTime . . . . . . . . . . . . 51

Collections . . . . . . . . . 12 Member functions . . . . . . . 51

Unordered collections . . . 13 Btree . . . . . . . . . . . . . . 53

Ordered collections . . . . 13 Member functions . . . . . . . 53

The BIDS template library . . . 13 Friends . . . . . . . . . . . . 55

Templates, classes, and BtreeIterator . . . . . . . . . . 55

Header files . . . . . . . . . 22 ContainerIterator . . . . . . . . 64

Tuning an application . . . . 23 Member functions . . . . . . . 64

FDS implementation . . . . . . 24 Date . . . . . . . . . . . . . . 65

ADT implementation . . . . . . 27 Member functions . . . . . . . 65

The class library directory . . 31 Deque . . . . . . . . . . . . . . 66

The INCLUDE directory . . . . 32 Example . . . . . . . . . . . . 67

The OBJS directory . . . . . . 32 Member functions . . . . . . . 68

The SOURCE directory . . . . . 32 Dictionary . . . . . . . . . . . 69

Creating a library . . . . . 33 Member functions . . . . . . . 69

The LIB directory . . . . . . 34 DoubleList . . . . . . . . . . . 70

Member functions . . . . . . . 75 Member functions . . . . . . . 92

HashTable . . . . . . . . . . . 75 Set . . . . . . . . . . . . . . . 92

Member functions . . . . . . . 76 Member functions . . . . . . . 92

Friends . . . . . . . . . . . 78 Sortable . . . . . . . . . . . . 93

HashTableIterator . . . . . . . 78 Member functions . . . . . . . 95

Member functions . . . . . . . 78 Related functions . . . . . . . 96

List . . . . . . . . . . . . . . 79 SortedArray . . . . . . . . . . . 97

Member functions . . . . . . . 79 Stack . . . . . . . . . . . . . . 97

Friends . . . . . . . . . . . 80 Example . . . . . . . . . . . . 98

ListIterator . . . . . . . . . . 81 Member functions . . . . . . . 99

Member functions . . . . . . . 81 String . . . . . . . . . . . . 100

Related functions . . . . . . 87 TShouldDelete . . . . . . . . . 105

PriorityQueue . . . . . . . . . 88 Member functions . . . . . . 105

Member functions . . . . . . . 89

Queue . . . . . . . . . . . . . 90 Index 107

Example . . . . . . . . . . . 91

Online document

___________________________________________________________________________

templates, see based library supplied with version 1.0, plus a brand-

Chapter 13, "C++ new implementation based on templates. This chapter

specifics." describes both libraries. We assume that you are

familiar with the syntax and semantics of C++ and with

the basic concepts of object-oriented programming

(OOP). To understand the template-based version (called

BIDS, for Borland International Data Structures), you

should be acquainted with C++'s new template mechanism.

The chapter is divided into seven parts:

the basic concepts and terminology

o An overview of the BIDS library

o The CLASSLIB directory and how to use it

o Debugging tools

o An alphabetic reference guide to the Object container

library, listing each class and its members

===========================================================================

stored in them are all ultimately derived from the

- 1 -

class Object. Further, the data structures used to

implement each container class were fixed and (usually)

hidden from the programmer. This provides a simple,

effective model for most container applications.

Version 3.0 therefore offers an enhanced, code-

compatible version of the previous Object-based

container library. We call this the Object container

class library. In addition, a more flexible (but more

complex), template-based container library, called BIDS

(Borland International Data Structures), is supplied

with version 3.0. Through the power of templates, BIDS

BIDS models, we'll list the changes to the Object

container library since version 1.0:

o New Btree and PriorityQueue classes.

o New TShouldDelete class gives the programmer control

over container/element ownership. You can control the

fate of objects when they are detached from a

container and when the container is flushed (using

the new flush method) or destroyed.

o New memory management classes, MemBlocks and

program execution.

When you choose Existing Turbo C++ version 1.01 container class code

Container Class will still run with the version 3.0 libraries. The new

Library in the Object container class libraries, in directory

IDE's Options| \CLASSLIB, are distinguished by the prefix TC:

Linker|Libraries TCLASSx.LIB and TCLASDBx.LIB where x specifies the

dialog box, the memory model, and DB indicates the special debug

Object-based version. To reduce verbiage, we will often refer to

libraries will be this container implementation as the Object or TC

To use the The corresponding libraries for the new template-based

template-based container classes are distinguished by the prefix BIDS:

libraries, you BIDSx.LIB and BIDSDBx.LIB. Let's review the reasons for

must explicitly having two sets of container libraries. The use of all

add the these libraries is covered on page 31.

appropriate

BIDS[DB]x.LIB

library to your

project or

makefile.

The Object container classes have been retained and

enhanced to provide code compatibility with the version

1.0 library. They provide a gentler learning curve than

the template-based BIDS library. The Object container

code offers faster compilation but slightly slower

execution than the template version. The project files

for the example and demo programs are set up to use the

Object version of the container libraries.

BIDS exploits the new exciting templates feature of C++

implemented with a hash table, and a Deque object with

a double list. With BIDS you can fine-tune your

application by varying the container implementation

with the minimum recoding--often a single typedef will

suffice. You can switch easily from StackAsList to

StackAsVector and test the results. In fact, you'll see

that by setting appropriate values for <T>, a generic

class parameter, you can implement the Object model

exactly. With BIDS, you can even choose between

polymorphic and non-polymorphic implementations of the