|
| Set (const char *nm=0) |
|
| Set (const Set &) |
|
| ~Set () |
|
void | addStartIdx (int locidx) |
|
void | appendWithUndo (const Pick::Location &) |
|
void | bulkAppendWithUndo (const TypeSet< Pick::Location > &, const TypeSet< int > &indexes) |
|
void | bulkRemoveWithUndo (const TypeSet< Pick::Location > &, const TypeSet< int > &indexes) |
|
void | fillDisplayPars (IOPar &) const |
|
void | fillPar (IOPar &) const |
|
LocID | find (const TrcKey &) const |
|
Location & | get (LocID) |
|
const Location & | get (LocID) const |
|
void | getBoundingBox (TrcKeyZSampling &) const |
|
void | getLocations (ObjectSet< const Location > &, int idx=0) const |
|
void | getLocations (ObjectSet< Location > &, int idx=0) |
|
void | getPolygon (ODPolygon< double > &, int idx=0) const |
|
void | getStartStopIdx (int setidx, int &start, int &stop) const |
|
Pos::SurvID | getSurvID () const |
| pre-6.0.1 sets will return the survID of first loc More...
|
|
float | getXYArea (int idx=0) const |
| Only for closed polygons. Returns in m^2. More...
|
|
void | insertWithUndo (LocID, const Pick::Location &) |
|
bool | is2D () const |
| default is 3D More...
|
|
bool | isPolygon () const |
|
bool | isReadOnly () const |
|
bool | isSizeLargerThanThreshold () const |
|
void | moveWithUndo (LocID, const Pick::Location &, const Pick::Location &) |
|
LocID | nearestLocation (const Coord &) const |
|
LocID | nearestLocation (const Coord3 &, bool ignorez=false) const |
|
int | nrSets () const |
|
Set & | operator= (const Set &) |
|
void | removeSingleWithUndo (LocID) |
|
void | setReadOnly (bool yn) |
|
void | setStartIdx (int setidx, int locidx) |
|
const TypeSet< int > & | startIndexs () const |
|
bool | useDisplayPars (const IOPar &) |
|
bool | usePar (const IOPar &) |
|
bool | writeDisplayPars () const |
|
| NamedCallBacker (const char *nm=0) |
|
| NamedCallBacker (const NamedCallBacker &) |
|
virtual Notifier< NamedCallBacker > & | objectToBeDeleted () const |
|
bool | operator== (const NamedCallBacker &oth) const |
|
bool | operator== (const NamedObject &oth) const |
|
| CallBacker () |
|
| CallBacker (const CallBacker &) |
|
virtual | ~CallBacker () |
|
bool | attachCB (const NotifierAccess &, const CallBack &, bool onlyifnew=false) const |
|
bool | attachCB (const NotifierAccess *notif, const CallBack &cb, bool onlyifnew=false) const |
|
void | detachAllNotifiers () const |
| Call from the destructor of your inherited object. More...
|
|
void | detachCB (const NotifierAccess &, const CallBack &) const |
|
void | detachCB (const NotifierAccess *notif, const CallBack &cb) const |
|
virtual bool | isCapsule () const |
|
bool | isNotifierAttached (const NotifierAccess *) const |
| Only for debugging purposes, don't use. More...
|
|
void | stopReceivingNotifications () const |
|
| NamedObject (const char *nm=nullptr) |
|
| NamedObject (const NamedObject &oth) |
|
virtual | ~NamedObject () |
|
virtual BufferString | getName () const |
|
bool | getNameFromPar (const IOPar &) |
|
virtual const name_type & | name () const |
|
NamedObject & | operator= (const NamedObject &) |
|
bool | operator== (const NamedObject &oth) const |
|
virtual void | setName (const char *nm) |
|
virtual | ~ObjectWithName () |
|
bool | hasName (const char *nm) const |
|
bool | hasName (const name_type &nm) const |
|
void | putNameInPar (IOPar &) const |
|
| TypeSet () |
|
| TypeSet (const Location *t, size_type nr) |
|
| TypeSet (const TypeSet &oth) |
|
| TypeSet (Location typ) |
|
| TypeSet (size_type nr, Location typ) |
|
virtual TypeSet * | clone () const |
|
virtual | ~ValVec () |
|
ValVec & | add (const T &) |
|
virtual bool | addIfNew (const T &) |
|
virtual bool | append (const T *, size_type) |
|
virtual bool | append (const ValVec &) |
|
virtual T * | arr () |
| 3rd party access More...
|
|
virtual const T * | arr () const |
|
iterator | begin () |
|
const_iterator | begin () const |
|
const_iterator | cbegin () const |
|
const_iterator | cend () const |
|
virtual ValVec & | copy (const T *, size_type) |
|
virtual ValVec & | copy (const ValVec &) |
|
size_type | count (const T &) const |
|
virtual void | createDifference (const ValVec &, bool must_preserve_order=false) |
| Removes all items present in other set. More...
|
|
virtual void | createIntersection (const ValVec &) |
| Only keeps common items. More...
|
|
virtual void | createUnion (const ValVec &) |
|
bool | empty () const |
|
iterator | end () |
|
const_iterator | end () const |
|
virtual void | erase () |
|
T & | first () |
|
const T & | first () const |
|
T & | get (idx_type) |
|
const T & | get (idx_type) const |
|
virtual size_type | getCapacity () const |
|
idx_type | getIdx (const_iterator it) const |
|
idx_type | getIdx (iterator it) const |
|
virtual idx_type | indexOf (T, bool forward=true, idx_type start=-1) const |
|
virtual void | insert (idx_type, const T &) |
|
bool | isPresent (const T &) const |
|
T & | last () |
|
const T & | last () const |
|
size_type | max_size () const |
|
virtual void | move (idx_type from, idx_type to) |
|
virtual int64_t | nrItems () const |
|
bool | operator!= (const ValVec &oth) const |
|
ValVec & | operator+= (const T &t) |
|
ValVec & | operator-= (const T &t) |
|
ValVec & | operator= (const ValVec &oth) |
|
bool | operator== (const ValVec &) const |
|
T & | operator[] (idx_type i) |
|
const T & | operator[] (idx_type i) const |
|
T | pop () |
|
bool | push (const T &) |
|
virtual void | removeRange (idx_type from, idx_type to) |
|
virtual void | removeSingle (idx_type, bool preserver_order=true) |
|
void | replace (T, T) |
|
virtual void | reverse () |
|
void | setAll (T) |
|
virtual bool | setCapacity (size_type sz, bool withmargin) |
|
virtual bool | setSize (size_type sz, T val=T()) |
|
size_type | size () const |
|
void | swap (IT, IT) |
|
void | swap (ValVec &oth) |
|
virtual void | swapItems (int64_t i1, int64_t i2) |
|
virtual void | useIndexes (const idx_type *) |
|
virtual bool | validIdx (int64_t) const |
|
std::vector< T > & | vec () |
|
const std::vector< T > & | vec () const |
|
bool | isEmpty () const |
|
void | setEmpty () |
|
Set of picks with something in common.
<>