|
| SliceSet () |
|
void | getIdx (int dimnr, int inl, int crl, float z, int &) const |
|
void | getIdxs (int inl, int crl, float z, int &, int &, int &) const |
|
Array3D< float > * | createArray (int inldim=0, int crlcim=1, int depthdim=2) const |
|
float | getValue (int inl, int crl, float z) const |
|
| ObjectSet () |
|
| ObjectSet (const ObjectSet< Slice > &) |
|
virtual | ~ObjectSet () |
|
ObjectSet< Slice > & | operator= (const ObjectSet< Slice > &) |
|
virtual bool | isManaged () const |
|
bool | nullAllowed () const |
|
void | allowNull (bool yn=true) |
|
size_type | size () const |
|
virtual int64_t | nrItems () const |
|
virtual Slice * | operator[] (size_type) |
|
virtual const Slice * | operator[] (size_type) const |
|
virtual Slice * | operator[] (const Slice *) const |
| check & unconst More...
|
|
virtual bool | validIdx (int64_t) const |
|
virtual bool | isPresent (const Slice *) const |
|
virtual size_type | indexOf (const Slice *) const |
|
Slice * | first () |
|
const Slice * | first () const |
|
Slice * | last () |
|
const Slice * | last () const |
|
ObjectSet< Slice > & | add (Slice *t) |
|
ObjectSet< Slice > & | operator+= (Slice *t) |
|
void | push (Slice *t) |
|
bool | addIfNew (Slice *) |
|
virtual Slice * | replace (size_type idx, Slice *) |
|
virtual void | insertAt (Slice *newptr, size_type) |
|
virtual void | insertAfter (Slice *newptr, size_type) |
|
virtual void | copy (const ObjectSet< Slice > &) |
|
virtual void | append (const ObjectSet< Slice > &) |
|
virtual void | swap (int64_t, int64_t) |
|
virtual void | reverse () |
|
virtual void | erase () |
|
virtual Slice * | pop () |
|
virtual Slice * | removeSingle (size_type, bool keep_order=true) |
|
virtual void | removeRange (size_type from, size_type to) |
|
virtual ObjectSet< Slice > & | operator-= (Slice *) |
|
void | plainErase () |
|
virtual | ~Set () |
|
bool | isEmpty () const |
|
void | setEmpty () |
|
Set of attrib slices.
The two array2d directions shall be filled following the TrcKeyZSampling convention. The slices will be in order of increasing inl, crl or Z.
Slices can be null!