|  | 
|  | AimsRoi (Hierarchy *hierarchy=NULL) | 
|  | 
| virtual | ~AimsRoi () | 
|  | 
| void | setLabel (const carto::VolumeRef< short > &label) | 
|  | 
| void | setHierarchy (Hierarchy *hie) | 
|  | 
| Hierarchy * | getHierarchy () | 
|  | 
| std::set< Vertex * > | VertByNameAndDescendantName (std::string &name) | 
|  | 
| void | setBucketFilename (const std::string &) | 
|  | 
| void | data2bucket () | 
|  | 
| void | data2bucket (const std::map< int, std::string > &nameList) | 
|  | 
| void | bucket2data (int borderWidth=0) | 
|  | 
| AimsRoi * | clipBucket (int x, int y, int z, int lx, int ly, int lz) | 
|  | 
|  | Graph (const std::string &s="") | 
|  | 
|  | Graph (const FactoryPtr factory, const std::string &s="") | 
|  | 
| virtual | ~Graph () | 
|  | 
| void | extract (Graph &graph, InputIterator iv1, InputIterator iv2) | 
|  | 
| void | clear () | 
|  | 
| Vertex * | addVertex (const std::string &s="") | 
|  | 
| Vertex * | cloneVertex (const Vertex *vertex) | 
|  | 
| bool | hasVertex (const Vertex *vertex) const | 
|  | 
| void | removeVertex (Vertex *vertex) | 
|  | 
| Vertex * | randomVertex () const | 
|  | 
| const std::set< Vertex * > & | vertices () const | 
|  | 
| std::set< Vertex * > | getVerticesWith (const std::string &s) const | 
|  | 
| std::set< Vertex * > | getVerticesWith (const std::string &s, const T &t) const | 
|  | 
| Edge * | addUndirectedEdge (Vertex *vertex1, Vertex *vertex2, std::string s) | 
|  | 
| Edge * | addEdge (Vertex *vertex1, Vertex *vertex2, std::string s="") | 
|  | 
| Edge * | addDirectedEdge (Vertex *vertex1, Vertex *vertex2, std::string s) | 
|  | 
| bool | hasEdge (const Edge *edge) const | 
|  | 
| void | removeEdge (Edge *edge) | 
|  | 
| const std::set< Edge * > & | edges () const | 
|  | 
| std::set< Edge * > | edges (const Vertex *vertex1, const Vertex *vertex2) const | 
|  | 
| std::set< Edge * > | getEdgesWith (const std::string &s) const | 
|  | 
| std::set< Edge * > | getEdgesWith (const std::string &s, const T &t) const | 
|  | 
| iterator | begin () | 
|  | 
| iterator | end () | 
|  | 
| const_iterator | begin () const | 
|  | 
| const_iterator | end () const | 
|  | 
| reverse_iterator | rbegin () | 
|  | 
| reverse_iterator | rend () | 
|  | 
| const_reverse_iterator | rbegin () const | 
|  | 
| const_reverse_iterator | rend () const | 
|  | 
| size_t | order () const | 
|  | 
| size_t | size () const __attribute__((__deprecated__("use edgeSize() for " "the number of edges. In a future release | 
|  | 
| size_t | size () will return the " "number properties as it does in GenericObject"))) | 
|  | 
| size_t | edgesSize () const | 
|  | 
| virtual bool | isUndirected () const | 
|  | 
| virtual bool | isDirected () const | 
|  | 
| virtual bool | check (const carto::SyntaxSet &syntax, std::set< std::string > &missing) const | 
|  | 
| void | clear () | 
|  | 
| Vertex * | addVertex (const std::string &s="") | 
|  | 
| Vertex * | cloneVertex (const Vertex *vertex) | 
|  | 
| bool | hasVertex (const Vertex *vertex) const | 
|  | 
| void | removeVertex (Vertex *vertex) | 
|  | 
| Vertex * | randomVertex () const | 
|  | 
| const std::set< Vertex * > & | vertices () const | 
|  | 
| std::set< Vertex * > | getVerticesWith (const std::string &s) const | 
|  | 
| std::set< Vertex * > | getVerticesWith (const std::string &s, const T &t) const | 
|  | 
| Edge * | addUndirectedEdge (Vertex *vertex1, Vertex *vertex2, std::string s) | 
|  | 
| Edge * | addEdge (Vertex *vertex1, Vertex *vertex2, std::string s="") | 
|  | 
| Edge * | addDirectedEdge (Vertex *vertex1, Vertex *vertex2, std::string s) | 
|  | 
| bool | hasEdge (const Edge *edge) const | 
|  | 
| void | removeEdge (Edge *edge) | 
|  | 
| const std::set< Edge * > & | edges () const | 
|  | 
| std::set< Edge * > | edges (const Vertex *vertex1, const Vertex *vertex2) const | 
|  | 
| std::set< Edge * > | getEdgesWith (const std::string &s) const | 
|  | 
| std::set< Edge * > | getEdgesWith (const std::string &s, const T &t) const | 
|  | 
| iterator | begin () | 
|  | 
| iterator | end () | 
|  | 
| const_iterator | begin () const | 
|  | 
| const_iterator | end () const | 
|  | 
| reverse_iterator | rbegin () | 
|  | 
| reverse_iterator | rend () | 
|  | 
| const_reverse_iterator | rbegin () const | 
|  | 
| const_reverse_iterator | rend () const | 
|  | 
| size_t | order () const | 
|  | 
| size_t | size () const __attribute__((__deprecated__("use edgeSize() for " "the number of edges. In a future release | 
|  | 
| size_t | size () will return the " "number properties as it does in GenericObject"))) | 
|  | 
| size_t | edgesSize () const | 
|  | 
| virtual bool | isUndirected () const | 
|  | 
| virtual bool | isDirected () const | 
|  | 
| virtual bool | check (const carto::SyntaxSet &syntax, std::set< std::string > &missing) const | 
|  | 
| virtual | ~GraphObject () | 
|  | 
|  | SyntaxedObject (const std::string &s) | 
|  | 
|  | SyntaxedObject (const SyntaxedObject &x) | 
|  | 
|  | SyntaxedObject (const SyntaxedObject< PropertySet > &x) | 
|  | 
Definition at line 52 of file roi.h.