as(int i, const Vector< T > &b) | PLib::Vector | |
BasicArray() | PLib::BasicArray | |
BasicArray(const int ni) | PLib::BasicArray | |
BasicArray(const BasicArray< T > &f2) | PLib::BasicArray | |
BasicArray(T *ap, const int size) | PLib::BasicArray | |
BasicArray(BasicList< T > &list) | PLib::BasicArray | |
begin() (defined in PLib::BasicArray) | PLib::BasicArray | [inline] |
begin() const (defined in PLib::BasicArray) | PLib::BasicArray | [inline] |
clear() | PLib::BasicArray | |
const_iterator typedef (defined in PLib::BasicArray) | PLib::BasicArray | |
destruct | PLib::BasicArray | [protected] |
elem(const int i) | PLib::BasicArray | [inline] |
elem(const int i) const | PLib::BasicArray | [inline] |
end() (defined in PLib::BasicArray) | PLib::BasicArray | [inline] |
end() const (defined in PLib::BasicArray) | PLib::BasicArray | [inline] |
get(int i, int l) | PLib::Vector | |
iterator (defined in PLib::BasicArray) | PLib::BasicArray | |
memory() const | PLib::BasicArray | [inline] |
minimum() const (defined in PLib::Vector) | PLib::Vector | [inline] |
minIndex() const | PLib::Vector | |
n() const | PLib::BasicArray | [inline] |
operator *(const Vector< T > &a, const Vector< T > &b) | PLib::Vector | [friend] |
operator *(const Vector< T > &v, const double d) | PLib::Vector | [friend] |
operator *(const Vector< T > &v, const Complex d) | PLib::Vector | [friend] |
operator * (defined in PLib::Vector) | PLib::Vector | [friend] |
operator * (defined in PLib::Vector) | PLib::Vector | [friend] |
operator!= (defined in PLib::Vector) | PLib::Vector | [friend] |
PLib::BasicArray::operator!=(const BasicArray< T > &, const BasicArray< T > &) | PLib::BasicArray | [friend] |
operator+(const Vector< T > &a, const Vector< T > &b) | PLib::Vector | [friend] |
operator+=(const Vector< T > &a) | PLib::Vector | |
operator-(const Vector< T > &a, const Vector< T > &b) | PLib::Vector | [friend] |
operator-=(const Vector< T > &a) | PLib::Vector | |
operator<<(ostream &os, const BasicArray< T > &arry) | PLib::BasicArray | [friend] |
operator=(const Vector< T > &v) | PLib::Vector | |
operator=(const BasicArray< T > &b) | PLib::Vector | |
operator=(const T d) | PLib::Vector | |
operator==(const Vector< T > &a, const Vector< T > &b) | PLib::Vector | [friend] |
PLib::BasicArray::operator==(const BasicArray< T > &, const BasicArray< T > &) | PLib::BasicArray | [friend] |
operator>>(istream &is, BasicArray< T > &arry) | PLib::BasicArray | [friend] |
operator[](const int i) (defined in PLib::BasicArray) | PLib::BasicArray | [inline] |
operator[](const int i) const (defined in PLib::BasicArray) | PLib::BasicArray | [inline] |
print(ostream &os) const | PLib::BasicArray | |
push_back(const T i, int end_buffer=10, double end_mult=-1) | PLib::BasicArray | |
qSort(int M=7) | PLib::Vector | |
qSortStd() | PLib::Vector | |
reset(const T val=0.0) | PLib::BasicArray | [virtual] |
resize(const int nsize) (defined in PLib::BasicArray) | PLib::BasicArray | [inline] |
resize(const BasicArray< T > &A) | PLib::BasicArray | [inline] |
rows() const | PLib::Vector | [inline] |
rsize | PLib::BasicArray | [protected] |
size() const | PLib::BasicArray | [inline] |
sortIndex(Vector< int > &index, int M=7) const | PLib::Vector | |
sze | PLib::BasicArray | [protected] |
trim(const int nsize) | PLib::BasicArray | |
untrim() (defined in PLib::BasicArray) | PLib::BasicArray | [inline] |
Vector() | PLib::Vector | [inline] |
Vector(const int r) (defined in PLib::Vector) | PLib::Vector | [inline] |
Vector(const Vector< T > &v) (defined in PLib::Vector) | PLib::Vector | [inline] |
Vector(const BasicArray< T > &v) (defined in PLib::Vector) | PLib::Vector | [inline] |
Vector(T *ap, const int size) (defined in PLib::Vector) | PLib::Vector | [inline] |
Vector(BasicList< T > &list) (defined in PLib::Vector) | PLib::Vector | [inline] |
wdth | PLib::BasicArray | [protected] |
width(const int w) | PLib::BasicArray | [inline] |
x | PLib::BasicArray | [protected] |
~BasicArray() | PLib::BasicArray | [virtual] |
~Vector() (defined in PLib::Vector) | PLib::Vector | [inline, virtual] |