UniqueSortedArray< Elem > Class Template Reference

#include <UniqueSortedArray.h>

Inheritance diagram for UniqueSortedArray< Elem >:

List of all members.

Public Member Functions
	UniqueSortedArray (int s=0)
	UniqueSortedArray (UniqueSortedArray< Elem > &ua)
	UniqueSortedArray (SortedArray< Elem > &sa)
UniqueSortedArray< Elem > &	operator= (UniqueSortedArray< Elem > &ua)
UniqueSortedArray< Elem > &	operator= (SortedArray< Elem > &sa)
int	add (const Elem &elem)
int	insert (const Elem &elem)

---

Detailed Description

template<class Elem>
class UniqueSortedArray< 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 12 of file UniqueSortedArray.h.

---

Constructor & Destructor Documentation

template<class Elem>

UniqueSortedArray< Elem >::UniqueSortedArray

(

int

s = 0

)

[inline]

Definition at line 16 of file UniqueSortedArray.h.

: SortedArray<Elem>(s) { }

template<class Elem>

UniqueSortedArray< Elem >::UniqueSortedArray

(

UniqueSortedArray< Elem > &

ua

)

[inline]

Definition at line 18 of file UniqueSortedArray.h.

                                                   : 
      SortedArray<Elem>(ua) { }

template<class Elem>

UniqueSortedArray< Elem >::UniqueSortedArray

(

SortedArray< Elem > &

sa

)

[inline]

Definition at line 21 of file UniqueSortedArray.h.

                                             : SortedArray<Elem>(sa) { 
      this->uniq(); 
    }

---

Member Function Documentation

template<class Elem>

int UniqueSortedArray< Elem >::add

(

const Elem &

elem

)

[inline]

Reimplemented from SortedArray< Elem >.

Definition at line 50 of file UniqueSortedArray.h.

Referenced by GlobalMasterIMD::get_vmd_forces(), and ComputeHomePatches::initialize().

{ return(insert(elem)); }

template<class Elem>

int UniqueSortedArray< Elem >::insert

(

const Elem &

elem

)

[inline]

Reimplemented from SortedArray< Elem >.

Definition at line 58 of file UniqueSortedArray.h.

References SortedArray< Elem >::bsearch(), ResizeArray< Elem >::rep, and ResizeArray< Elem >::size().

Referenced by UniqueSortedArray< PatchElem >::add().

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

template<class Elem>

UniqueSortedArray<Elem>& UniqueSortedArray< Elem >::operator=

(

SortedArray< Elem > &

sa

)

[inline]

Definition at line 36 of file UniqueSortedArray.h.

                                                               {
      SortedArray<Elem>::operator=(sa);
      this->uniq();
      return(*this);
    }

template<class Elem>

UniqueSortedArray<Elem>& UniqueSortedArray< Elem >::operator=

(

UniqueSortedArray< Elem > &

ua

)

[inline]

Reimplemented from SortedArray< Elem >.

Definition at line 31 of file UniqueSortedArray.h.

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

                                                                      {
      SortedArray<Elem>::operator=(ua);
      return(*this);
    }

---

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

• UniqueSortedArray.h