Set of BufferString objects. More...
Public Member Functions | |
| BufferStringSet () | |
| BufferStringSet (const char *arr[], int len=-1) | |
| BufferStringSet (const BufferStringSet &bss) | |
| BufferStringSet & | operator= (const BufferStringSet &) |
| bool | operator== (const BufferStringSet &) const |
| BufferString & | get (int idx) |
| const BufferString & | get (int idx) const |
| int | indexOf (const char *) const |
| first match | |
| int | indexOf (const GlobExpr &) const |
| first match | |
| bool | isPresent (const char *s) const |
| int | nearestMatch (const char *) const |
| algo may not be very good, but anyway | |
| bool | isSubsetOf (const BufferStringSet &) const |
| BufferStringSet & | add (const char *) |
| BufferStringSet & | add (const BufferString &) |
| BufferStringSet & | add (const BufferStringSet &, bool allowduplicates) |
| bool | addIfNew (const char *) |
| returns whether added | |
| bool | addIfNew (const BufferString &) |
| int | maxLength () const |
| void | sort (BufferStringSet *slave=0) |
| int * | getSortIndexes () const |
| returns new int [size()] | |
| void | useIndexes (int *, BufferStringSet *slave=0) |
| virtual void | fillPar (IOPar &) const |
| virtual void | usePar (const IOPar &) |
Set of BufferString objects.
| BufferStringSet::BufferStringSet | ( | ) |
| BufferStringSet::BufferStringSet | ( | const char * | arr[], | |
| int | len = -1 | |||
| ) |
| BufferStringSet::BufferStringSet | ( | const BufferStringSet & | bss | ) | [inline] |
| BufferStringSet& BufferStringSet::add | ( | const char * | ) |
| BufferStringSet& BufferStringSet::add | ( | const BufferString & | ) |
| BufferStringSet& BufferStringSet::add | ( | const BufferStringSet & | , | |
| bool | allowduplicates | |||
| ) |
| bool BufferStringSet::addIfNew | ( | const char * | ) |
returns whether added
| bool BufferStringSet::addIfNew | ( | const BufferString & | ) |
| virtual void BufferStringSet::fillPar | ( | IOPar & | ) | const [virtual] |
| BufferString& BufferStringSet::get | ( | int | idx | ) | [inline] |
| const BufferString& BufferStringSet::get | ( | int | idx | ) | const [inline] |
| int* BufferStringSet::getSortIndexes | ( | ) | const |
returns new int [size()]
| int BufferStringSet::indexOf | ( | const char * | ) | const |
first match
| int BufferStringSet::indexOf | ( | const GlobExpr & | ) | const |
first match
| bool BufferStringSet::isPresent | ( | const char * | s | ) | const [inline] |
| bool BufferStringSet::isSubsetOf | ( | const BufferStringSet & | ) | const |
| int BufferStringSet::maxLength | ( | ) | const |
| int BufferStringSet::nearestMatch | ( | const char * | ) | const |
algo may not be very good, but anyway
| BufferStringSet& BufferStringSet::operator= | ( | const BufferStringSet & | ) |
| bool BufferStringSet::operator== | ( | const BufferStringSet & | ) | const |
| void BufferStringSet::sort | ( | BufferStringSet * | slave = 0 |
) |
| void BufferStringSet::useIndexes | ( | int * | , | |
| BufferStringSet * | slave = 0 | |||
| ) |
| virtual void BufferStringSet::usePar | ( | const IOPar & | ) | [virtual] |
1.7.1