#include <ResizeArrayRaw.h>

Inheritance diagram for SortedArray< Elem >:

Public Member Functions
	SortedArray (void)

	SortedArray (int s)

	SortedArray (SortedArray< Elem > &sa)

	SortedArray (SortableResizeArray< Elem > &ra)

SortedArray< Elem > &	operator= (SortedArray< Elem > &sa)

SortedArray< Elem > &	operator= (SortableResizeArray< Elem > &ra)

int	load (const Elem &elem)

int	add (const Elem &elem)

void	del (const Elem &elem)

void	sort (void)

int	bsearch (const Elem &elem)

int	insert (const Elem &elem)

int	index (const Elem &elem)

Elem *	find (const Elem &elem)

Public Member Functions inherited from SortableResizeArray< Elem >
	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

Protected Attributes
int	isSorted

Protected Attributes inherited from ResizeArray< Elem >
ResizeArrayRaw< Elem >	rep

Additional Inherited Members
Public Types inherited from ResizeArray< Elem >
typedef Elem *	iterator

typedef const Elem *	const_iterator

Detailed Description

template<class Elem>
class SortedArray< Elem >

Definition at line 27 of file ResizeArrayRaw.h.

Constructor & Destructor Documentation

◆ SortedArray() [1/4]

template<class Elem>

SortedArray< Elem >::SortedArray ( void )

inline

Definition at line 20 of file SortedArray.h.

                       : SortableResizeArray<Elem>() { 
       isSorted = 1;
     }

◆ SortedArray() [2/4]

template<class Elem>

SortedArray< Elem >::SortedArray ( int s )

inline

Definition at line 24 of file SortedArray.h.

                        : SortableResizeArray<Elem>(s) { 
       isSorted = 1;
     }

◆ SortedArray() [3/4]

template<class Elem>

SortedArray< Elem >::SortedArray ( SortedArray< Elem > & sa )

inline

Definition at line 28 of file SortedArray.h.

                                        : SortableResizeArray<Elem>(sa) { 
       if(!(isSorted = sa.isSorted)) sort();
       isSorted = 1;
     }

◆ SortedArray() [4/4]

template<class Elem>

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

inline

Definition at line 33 of file SortedArray.h.

                                                : 
         SortableResizeArray<Elem>(ra) {
       sort(); isSorted = 1;
     }

Member Function Documentation

◆ add()

template<class Elem>

int SortedArray< Elem >::add ( const Elem & elem )

inline

Definition at line 55 of file SortedArray.h.

Referenced by ComputeQM::initialize(), ComputeQMMgr::recvForce(), Patch::registerDEdaSumDeposit(), Patch::registerForceDeposit(), Patch::registerPositionPickup(), and Patch::registerPsiSumDeposit().

                               {
       return(insert(elem));
     }

◆ bsearch()

template<class Elem>

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

inline

Definition at line 68 of file SortedArray.h.

Referenced by SortedArray< PatchElem >::del(), and SortedArray< PatchElem >::index().

                                   { 
       if (!isSorted) sort();
       return (SortableResizeArray<Elem>::bsearch(elem));
     }

◆ del()

template<class Elem>

void SortedArray< Elem >::del ( const Elem & elem )

inline

Definition at line 59 of file SortedArray.h.

Referenced by PatchMgr::sendMovePatches(), PatchMgr::sendOneHomePatch(), Patch::unregisterDEdaSumDeposit(), Patch::unregisterForceDeposit(), Patch::unregisterPositionPickup(), and Patch::unregisterPsiSumDeposit().

                                 {
       int found = bsearch(elem);
       if (this->size() != 0 && this->rep[found] == elem) {
         SortableResizeArray<Elem>::del(found,1);
       }
     }

◆ find()

template<class Elem>

Elem * SortedArray< Elem >::find ( const Elem & elem )

inline

Definition at line 94 of file SortedArray.h.

Referenced by ComputeQM::doWork(), PatchMgr::homePatch(), Molecule::prepare_qm(), ComputeQM::processFullQM(), HomePatch::qmSwapAtoms(), ComputeQMMgr::recvPntChrg(), and PatchMgr::~PatchMgr().

                                                       {
   int found = bsearch(elem);
   if ( found < 0 || found == this->size() ) 
     return ((Elem *)NULL);
   if (this->rep[found] == elem) {
     return (&(this->rep[found]));
   } else {
     return ((Elem *)NULL);
   }
 }

◆ index()

template<class Elem>

int SortedArray< Elem >::index ( const Elem & elem )

inline

Definition at line 75 of file SortedArray.h.

75 { return bsearch(elem); }

SortedArray::bsearch

int bsearch(const Elem &elem)

Definition: SortedArray.h:68

◆ insert()

template<class Elem>

int SortedArray< Elem >::insert ( const Elem & elem )

inline

Definition at line 81 of file SortedArray.h.

Referenced by SortedArray< PatchElem >::add(), lssDistSort::lssDistSort(), lssDistSort::operator=(), Molecule::prepare_qm(), and ComputeQMMgr::procQMRes().

                                                      {
   int found = bsearch(elem);
   if (found == -1) {
     return (ResizeArray<Elem>::insert(elem, 0));
   }
   if (found == (this->size()-1) && this->rep[found] < elem) {
     return (ResizeArray<Elem>::insert(elem, this->size()));
   } else {
     return (ResizeArray<Elem>::insert(elem, found));
   }
 }

◆ load()

template<class Elem>

int SortedArray< Elem >::load ( const Elem & elem )

inline

Definition at line 50 of file SortedArray.h.

Referenced by PatchMgr::createHomePatch(), PatchMgr::movePatch(), ComputeQM::processFullQM(), and ComputeQMMgr::recvPntChrg().

                                {
       isSorted = 0;
       return(ResizeArray<Elem>::add(elem));
     }

◆ operator=() [1/2]

template<class Elem>

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

inline

Definition at line 38 of file SortedArray.h.

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

                                                           {
       SortableResizeArray<Elem>::operator=(sa);
       isSorted = sa.isSorted;
       return(*this);
     }

◆ operator=() [2/2]

template<class Elem>

SortedArray<Elem>& SortedArray< Elem >::operator= ( SortableResizeArray< Elem > & ra )

inline

Definition at line 44 of file SortedArray.h.

                                                                  {
       SortableResizeArray<Elem>::operator=(ra);
       sort(); isSorted = 1;
       return(*this);
     }