starseeker
d824fc0c4e
We want to be consistent with the previous layout, to avoid needlessly breaking existing codes. The header update means client codes are not required to include all of the stepcode library includes explicitly - i.e., stepcode itself does not force this requirement with its own internal includes. However, if client codes do not want to add the library prefixes to their own includes as we have for stepcode, they should still be able to add the various includes and work as before. Adjust the include directory names accordingly.
82 lines
2.2 KiB
C++
82 lines
2.2 KiB
C++
|
|
#ifndef gennodearray_h
|
|
#define gennodearray_h
|
|
|
|
/*
|
|
* NIST Utils Class Library
|
|
* clutils/gennode.h
|
|
* April 1997
|
|
* David Sauder
|
|
* K. C. Morris
|
|
|
|
* Development of this software was funded by the United States Government,
|
|
* and is not subject to copyright.
|
|
*/
|
|
|
|
/* $Id: gennodearray.h,v 3.0.1.3 1997/11/05 22:33:47 sauderd DP3.1 $ */
|
|
|
|
/*
|
|
* GenNodeArray - dynamic array object of GenericNodes.
|
|
* the array part of this is copied from Unidraws UArray - dynamic array object
|
|
* Copyright (c) 1990 Stanford University
|
|
*/
|
|
|
|
#include <sc_export.h>
|
|
#include <string.h>
|
|
#include <memory.h>
|
|
#include <stdlib.h> // to get bcopy for CenterLine
|
|
|
|
#include "clutils/gennode.h"
|
|
|
|
// the initial size of the array
|
|
#define ARRAY_DEFAULT_SIZE (1024)
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
// GenNodeArray
|
|
// If you delete this object, it does not delete the entries it points to.
|
|
// If you want it to delete the entries it points to you need to call
|
|
// DeleteEntries().
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
class SC_UTILS_EXPORT GenNodeArray {
|
|
public:
|
|
|
|
GenNodeArray( int defaultSize = ARRAY_DEFAULT_SIZE );
|
|
virtual ~GenNodeArray();
|
|
|
|
GenericNode *& operator[]( int index );
|
|
virtual int Index( GenericNode * gn );
|
|
virtual int Index( GenericNode ** gn );
|
|
|
|
int Count() const;
|
|
|
|
virtual void Append( GenericNode * gn );
|
|
virtual int Insert( GenericNode * gn );
|
|
virtual int Insert( GenericNode * gn, int index );
|
|
virtual void Remove( int index );
|
|
virtual void ClearEntries();
|
|
virtual void DeleteEntries();
|
|
|
|
protected:
|
|
virtual void Check( int index );
|
|
|
|
GenericNode ** _buf; // the array
|
|
int _bufsize; // the possible number of entries in the array
|
|
int _count; // the number of entries in the array
|
|
};
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
// class GenNodeArray inline public functions
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
inline GenericNode *& GenNodeArray::operator[]( int index ) {
|
|
Check( index );
|
|
return _buf[index];
|
|
}
|
|
|
|
inline int GenNodeArray::Count() const {
|
|
return _count;
|
|
}
|
|
|
|
#endif
|