Logo Search packages:      
Sourcecode: djvulibre version File versions

ArrayBase Class Reference

#include <Arrays.h>

Inheritance diagram for ArrayBase:

ArrayBaseT< TYPE > ArrayBaseT< GPBase > DArray< TYPE > TArray< TYPE > DArray< GPBase > DPArray< TYPE >

List of all members.


Detailed Description

Dynamic array base class. This is an auxiliary base class for {DArray} and {TArray} implementing some shared functions independent of the type of array elements. It's not supposed to be constructed by hands. Use {DArray} and {TArray} instead.

Definition at line 305 of file Arrays.h.


Arrays.h

Files #"Arrays.h"# and #"Arrays.cpp"# implement three array template classes. Class {TArray} implements an array of objects of trivial types such as char#, int#, float#, etc. It is faster than general implementation for any type done in {DArray} because it does not cope with element's constructors, destructors and copy operators. Although implemented as a template, which makes it possible to incorrectly use {TArray} with non-trivial classes, it should not be done.

A lot of things is shared by these three arrays. That is why there are more base classes: {itemize} {ArrayBase} defines functions independent of the elements type {ArrayBaseT} template class defining functions shared by {DArray} and {TArray} {itemize}

The main difference between {GArray} (now obsolete) and these ones is the copy-on-demand strategy, which allows you to copy array objects without copying the real data. It's the same thing, which has been implemented in {GString} long ago: as long as you don't try to modify the underlying data, it may be shared between several copies of array objects. As soon as you attempt to make any changes, a private copy is created automatically and transparently for you - the procedure, that we call "copy-on-demand".

Also, please note that now there is no separate class, which does fast sorting. Both {TArray} (dynamic array for trivial types) and {DArray} (dynamic array for arbitrary types) can sort their elements.

{ Historical comments} --- Leon chose to implement his own arrays because the STL classes were not universally available and the compilers were rarely able to deal with such a template galore. Later it became clear that there is no really good reason why arrays should be derived from containers. It was also suggested to create separate arrays implementation for simple classes and do the copy-on-demand strategy, which would allow to assign array objects without immediate copying of their elements.

At this point {DArray} and {TArray} should only be used when it is critical to have the copy-on-demand feature. The {GArray} implementation is a lot more efficient.

Template array classes.

Author:
Andrei Erofeev <eaf@geocities.com> -- Copy-on-demand implementation.
Version:
#
Id
Arrays.h,v 1.10 2004/05/13 15:16:34 leonb Exp
#

void check (void)
void detach (void)
void del (int n, unsigned int howmany=1)
void empty ()
int hbound () const
int lbound () const
void resize (int lobound, int hibound)
void resize (int hibound)
void shift (int disp)
int size () const
 Returns the number of elements in the array.
void touch (int n)

Protected Member Functions

_ArrayBase & assign (_ArrayRep *ar)
_ArrayRep * get (void) const
bool operator== (const _ArrayBase &ab)

The documentation for this class was generated from the following file:

Generated by  Doxygen 1.6.0   Back to index