Concept Node Container. More...
#include <gconceptnodes.h>
Inheritance diagram for GConceptNodes:
Public Member Functions | |
GConceptNodes (size_t conceptid) | |
GConceptNodes (const GConceptNodes &nodes) | |
int | Compare (const GConceptNodes &nodes) const |
int | Compare (const size_t conceptid) const |
size_t | GetConceptId (void) const |
Public Member Functions inherited from RContainer< GConceptNode, false, true > | |
RContainer (size_t m, size_t i=0) | |
RContainer (const RContainer< GConceptNode, true, true > &src) | |
RContainer (const RContainer< GConceptNode, false, true > &src) | |
int | Compare (const RContainer< GConceptNode, false, true > &) const |
size_t | GetNb (void) const |
size_t | GetMaxPos (void) const |
size_t | GetMaxNb (void) const |
size_t | GetIncNb (void) const |
bool | VerifyIndex (size_t idx) const |
void | VerifyTab (size_t max=0) |
void | Clear (size_t m=0, size_t i=0, bool force=false) |
void | ReOrder (int sortOrder(const void *, const void *), size_t min, size_t max) |
void | ReOrder (int sortOrder(const void *, const void *)) |
void | ReOrder (void) |
void | Exchange (size_t pos1, size_t pos2) |
void | Shift (size_t idx, bool reverse) |
void | Transfer (RContainer< GConceptNode, a, o > &src) |
RContainer & | operator= (const RContainer< GConceptNode, true, true > &src) |
RContainer & | operator= (const RContainer< GConceptNode, false, true > &src) |
void | Copy (const RContainer< GConceptNode, a, true > &src) |
RContainer & | operator+= (const RContainer< GConceptNode, a, o > &src) |
size_t | GetIndex (const TUse &tag, bool &find, size_t min=0, size_t max=0) const |
bool | IsIn (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const |
bool | IsIn (const TUse &tag, size_t min=0, size_t max=0) const |
const GConceptNode * | operator[] (size_t idx) const |
GConceptNode * | operator[] (size_t idx) |
const GConceptNode * | GetPtrAt (size_t idx) const |
GConceptNode * | GetPtrAt (size_t idx) |
GConceptNode * | GetPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const |
GConceptNode * | GetPtr (const TUse &tag, size_t min=0, size_t max=0) const |
GConceptNode * | GetInsertPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) |
GConceptNode * | GetInsertPtr (const TUse &tag, size_t min=0, size_t max=0) |
GConceptNode * | GetInsertPtrAt (const TUse &tag, size_t pos) |
RContainer< GConceptNode, false, true > * | GetPtrs (const TUse &tag, size_t min=0, size_t max=0) const |
size_t | GetTab (const void **tab, size_t min=0, size_t max=0) const |
size_t | GetTab (void **tab, size_t min=0, size_t max=0) |
size_t | GetTab (const GConceptNode **tab, size_t min=0, size_t max=0) const |
size_t | GetTab (GConceptNode **tab, size_t min=0, size_t max=0) |
void | InsertPtrAt (GConceptNode *ins, size_t pos, bool del) |
void | InsertPtrAt (GConceptNode *ins, size_t pos) |
void | InsertPtr (GConceptNode *ins, bool del=false, size_t min=0, size_t max=0) |
void | DeletePtrAt (size_t pos, bool shift, bool del) |
void | DeletePtrAt (size_t pos, bool shift) |
void | DeletePtrAt (size_t pos) |
void | DeletePtr (const TUse &tag, bool sortkey, bool del, size_t min=0, size_t max=0) |
void | DeletePtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) |
void | DeletePtr (const TUse &tag, size_t min=0, size_t max=0) |
void | Inter (const iRContainer< GConceptNode > &src1, const iRContainer< GConceptNode > &src2) |
void | Union (const iRContainer< GConceptNode > &src1, const iRContainer< GConceptNode > &src2) |
virtual | ~RContainer (void) |
Public Member Functions inherited from iRContainer< C > | |
size_t | GetNb (void) const |
size_t | GetMaxPos (void) const |
size_t | GetMaxNb (void) const |
size_t | GetIncNb (void) const |
bool | VerifyIndex (size_t idx) const |
void | VerifyTab (size_t max=0) |
void | Clear (size_t m=0, size_t i=0, bool force=false) |
void | ReOrder (int sortOrder(const void *, const void *), size_t min, size_t max) |
void | ReOrder (int sortOrder(const void *, const void *)) |
void | ReOrder (void) |
void | Exchange (size_t pos1, size_t pos2) |
void | Shift (size_t idx, bool reverse) |
void | Transfer (iRContainer< C > &src) |
iRContainer & | operator= (const iRContainer< C > &src) |
void | Copy (const iRContainer< C > &src) |
iRContainer & | operator+= (const iRContainer< C > &src) |
size_t | GetIndex (bool order, const TUse &tag, bool &find, size_t min=0, size_t max=0) const |
size_t | GetIndex (const TUse &tag, bool &find, size_t min=0, size_t max=0) const |
bool | IsIn (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const |
bool | IsIn (const TUse &tag, size_t min=0, size_t max=0) const |
const C * | operator[] (size_t idx) const |
C * | operator[] (size_t idx) |
const C * | GetPtrAt (size_t idx) const |
C * | GetPtrAt (size_t idx) |
C * | GetPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const |
C * | GetPtr (const TUse &tag, size_t min=0, size_t max=0) const |
C * | GetInsertPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) |
C * | GetInsertPtr (const TUse &tag, size_t min=0, size_t max=0) |
C * | GetInsertPtrAt (const TUse &tag, size_t pos) |
size_t | GetTab (const void **tab, size_t min=0, size_t max=0) const |
size_t | GetTab (void **tab, size_t min=0, size_t max=0) |
size_t | GetTab (const C **tab, size_t min=0, size_t max=0) const |
size_t | GetTab (C **tab, size_t min=0, size_t max=0) |
void | InsertPtrAt (C *ins, size_t pos, bool del) |
void | InsertPtrAt (C *ins, size_t pos) |
void | InsertPtr (C *ins, bool del=false, size_t min=0, size_t max=0) |
void | DeletePtrAt (size_t pos, bool shift, bool del) |
void | DeletePtrAt (size_t pos, bool shift) |
void | DeletePtrAt (size_t pos) |
void | DeletePtr (const TUse &tag, bool sortkey, bool del, size_t min=0, size_t max=0) |
void | DeletePtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) |
void | DeletePtr (const TUse &tag, size_t min=0, size_t max=0) |
void | Inter (const iRContainer< C > &src1, const iRContainer< C > &src2) |
void | Union (const iRContainer< C > &src1, const iRContainer< C > &src2) |
virtual | ~iRContainer (void) |
Private Attributes | |
size_t | ConceptId |
Additional Inherited Members | |
Static Public Member Functions inherited from RContainer< GConceptNode, false, true > | |
static int | SortOrder (const void *a, const void *b) |
Static Public Member Functions inherited from iRContainer< C > | |
static int | SortOrder (const void *a, const void *b) |
Protected Member Functions inherited from iRContainer< C > | |
void | Create (const iRContainer< C > &src) |
iRContainer & | NormalCopy (const iRContainer< C > &src) |
void | DeepCopy (const iRContainer< C > &src) |
iRContainer & | Add (const iRContainer< C > &src) |
Protected Attributes inherited from iRContainer< C > | |
C ** | Tab |
size_t | NbPtr |
size_t | MaxPtr |
size_t | LastPtr |
size_t | IncPtr |
Detailed Description
Concept Node Container.
The GConceptNodes provides a representation for a container of concept nodes associated with a given concept.
The nodes are ordered by depths and syntactic positions.
Constructor & Destructor Documentation
GConceptNodes | ( | size_t | conceptid | ) |
Construct a concept node container.
- Parameters
-
conceptid Concept identifier.
GConceptNodes | ( | const GConceptNodes & | nodes | ) |
Copy constructor.
- Parameters
-
nodes Container to copy.
Member Function Documentation
int Compare | ( | const GConceptNodes & | nodes | ) | const |
Compare two node containers regarding their concept.
- Parameters
-
nodes Nodes to compare with.
- Returns
- a number compatible with R::RContainer.
int Compare | ( | const size_t | conceptid | ) | const |
Compare a node container with an concept.
- Parameters
-
conceptid Concept to compare with.
- Returns
- a number compatible with R::RContainer.
size_t GetConceptId | ( | void | ) | const |
- Returns
- the concept identifier.
Member Data Documentation
|
private |
Concept identifier.