SortableResizeArray< Elem > Class Template Reference

#include <ResizeArrayRaw.h>

Inheritance diagram for SortableResizeArray< Elem >:

Public Member Functions
	SortableResizeArray (void)
	SortableResizeArray (int size)
	SortableResizeArray (ResizeArray< Elem > &ra)
	SortableResizeArray (SortableResizeArray< Elem > &ra)
	SortableResizeArray (const ResizeArray< Elem > *ra)
	SortableResizeArray (const SortableResizeArray< Elem > *ra)
	SortableResizeArray (Elem **const r, int numElem, int maxElem)
SortableResizeArray< Elem > &	operator= (SortableResizeArray< Elem > &sa)
	~SortableResizeArray (void)
void	init (void)
void	sort (void)
void	sort (int bot, int top)
void	uniq (void)
int	bsearch (const Elem &elem) const
Public Member Functions inherited from ResizeArray< Elem >
iterator	begin (void)
iterator	end (void)
const_iterator	const_begin (void) const
const_iterator	const_end (void) const
	ResizeArray (void)
	ResizeArray (int s)
void	copy (ResizeArray< Elem > &ra)
void	swap (ResizeArray< Elem > &ra)
bool	shared () const
	ResizeArray (Elem **array, int arraySize, int allocSize=0)
	~ResizeArray (void)
void	resize (int i)
void	reserve (int i)
void	clear ()
void	setall (const Elem &elem)
int	add (const Elem &elem)
void	del (int index, int num=1)
int	insert (const Elem &elem, int index)
Elem &	item (int i)
Elem &	operator[] (int index)
const Elem &	operator[] (int index) const
int	size (void) const
int	find (const Elem &e) const

Additional Inherited Members
Public Types inherited from ResizeArray< Elem >
typedef Elem *	iterator
typedef const Elem *	const_iterator
Protected Attributes inherited from ResizeArray< Elem >
ResizeArrayRaw< Elem >	rep

Detailed Description

template<class Elem>
class SortableResizeArray< Elem >

Copyright (c) 1995, 1996, 1997, 1998, 1999, 2000 by The Board of Trustees of the University of Illinois. All rights reserved.

Definition at line 29 of file ResizeArrayRaw.h.

Constructor & Destructor Documentation

SortableResizeArray() [1/7]

template<class Elem>

SortableResizeArray< Elem >::SortableResizeArray ( void  )

inline

Definition at line 49 of file SortableResizeArray.h.

: ResizeArray<Elem>() { init(); }

SortableResizeArray() [2/7]

template<class Elem>

SortableResizeArray< Elem >::SortableResizeArray ( int  size )

inline

Definition at line 51 of file SortableResizeArray.h.

: ResizeArray<Elem>(size) { init(); }

SortableResizeArray() [3/7]

template<class Elem>

SortableResizeArray< Elem >::SortableResizeArray ( ResizeArray< Elem > &  ra )

inline

Definition at line 53 of file SortableResizeArray.h.

                                               : 
      ResizeArray<Elem>(ra) { init(); }

SortableResizeArray() [4/7]

template<class Elem>

SortableResizeArray< Elem >::SortableResizeArray ( SortableResizeArray< Elem > &  ra )

inline

Definition at line 56 of file SortableResizeArray.h.

                                                       :
      ResizeArray<Elem>(ra) { init(); }

SortableResizeArray() [5/7]

template<class Elem>

SortableResizeArray< Elem >::SortableResizeArray ( const ResizeArray< Elem > *  ra )

inline

Definition at line 59 of file SortableResizeArray.h.

                                                     : 
      ResizeArray<Elem>(ra) { init(); }

SortableResizeArray() [6/7]

template<class Elem>

SortableResizeArray< Elem >::SortableResizeArray ( const SortableResizeArray< Elem > *  ra )

inline

Definition at line 62 of file SortableResizeArray.h.

                                                             : 
      ResizeArray<Elem>(ra) { init(); }

SortableResizeArray() [7/7]

template<class Elem>

SortableResizeArray< Elem >::SortableResizeArray ( Elem **const  r, int  numElem, int  maxElem  )

inline

Definition at line 65 of file SortableResizeArray.h.

                                                                   : 
      ResizeArray<Elem>(r,numElem,maxElem) { init(); }

~SortableResizeArray()

template<class Elem>

SortableResizeArray< Elem >::~SortableResizeArray ( void  )

inline

Definition at line 73 of file SortableResizeArray.h.

{ }

Member Function Documentation

bsearch()

template<class Elem>

int SortableResizeArray< Elem >::bsearch ( const Elem &  elem ) const

inline

Definition at line 106 of file SortableResizeArray.h.

                                        {
      int test;
      int bot = -1;
      int top = this->size();
      if (this->size() == 0) return (-1);
      while (top - bot > 1) {
        if ( this->rep.array[test = (bot+top)/2] < elem )
          bot = test;
        else
          top = test;
      }
      return(top);
    }

init()

template<class Elem>

void SortableResizeArray< Elem >::init ( void  )

inline

Definition at line 75 of file SortableResizeArray.h.

Referenced by SortableResizeArray< PatchElem >::SortableResizeArray().

{ }

operator=()

template<class Elem>

SortableResizeArray<Elem>& SortableResizeArray< Elem >::operator= ( SortableResizeArray< Elem > &  sa )

inline

Definition at line 68 of file SortableResizeArray.h.

Referenced by SortedArray< PatchElem >::operator=().

                                                                         {
      ResizeArray<Elem>::operator=(sa);
      return(*this);
    }

sort() [1/2]

template<class Elem>

void SortableResizeArray< Elem >::sort ( void  )

inline

Definition at line 77 of file SortableResizeArray.h.

Referenced by ComputePmeMgr::initialize(), SortedArray< PatchElem >::sort(), and SortableResizeArray< PatchElem >::sort().

{ sort(0, this->rep.size()-1); }

sort() [2/2]

template<class Elem>

void SortableResizeArray< Elem >::sort ( int  bot, int  top  )

inline

Definition at line 82 of file SortableResizeArray.h.

                                {
      int index, size;
      if (top > this->rep.size()) top = this->rep.size();
      size = top - bot + 1;
    
      // Make all sub-heaps
      for ( index = size/2-1; index > 0; index-- )
        siftup(bot, index, size);
    
      // Take top element of overall heap, and put on top
      for ( index = size; index > 1; index-- ) {
        siftup(bot, 0, index);
        swap(bot, 0, index-1);
      }
    }

uniq()

template<class Elem >

void SortableResizeArray< Elem >::uniq ( void  )

inline

Definition at line 123 of file SortableResizeArray.h.

Referenced by UniqueSortedArray< PatchElem >::operator=(), and UniqueSortedArray< PatchElem >::UniqueSortedArray().

                                                {
  if (this->size()) {
    int oldIndex=0;
    int newIndex=0;
    while (++oldIndex < this->size()) {
      if ( ! ( this->rep.array[oldIndex] == this->rep.array[newIndex] ) ) {
        if (++newIndex != oldIndex)
          memcpy((void *)&(this->rep.array[newIndex]),
                 (void *)&(this->rep.array[oldIndex]),
                 sizeof(Elem));
      } else {
        this->rep.array[oldIndex].~Elem();
      }
    }
    this->rep.arraySize = ++newIndex;
  }
}

---

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

• ResizeArrayRaw.h
• SortableResizeArray.h