MbPath Class Reference
Path to component. More...
#include <name_item.h>
Inheritance diagram for MbPath: Collaboration diagram for MbPath:Public Member Functions | |
| MbPath () | |
| Constructor. | |
| MbPath (const MbPath &other) | |
| Copy-constructor. | |
| SimpleName | Hash () const |
| Calculate hash of itself. | |
| bool | operator== (const MbPath &other) const |
| An equality operator. | |
| bool | operator!= (const MbPath &other) const |
| An inequality operator. | |
| MbPath & | operator= (const MbPath &p) |
| An assignment operator. | |
| Public Member Functions inherited from SArray< SimpleName > | |
| SArray (size_t i_max=0, uint16 i_delta=1) | |
| Constructor. | |
| SArray (const SArray< SimpleName > &) | |
| Copy constructor. | |
| SArray (const std::vector< SimpleName > &) | |
| Copy constructor. | |
| virtual | ~SArray () |
| Destructor. | |
| size_t | Upper () const |
| The number of elements the memory is allocated for. | |
| uint16 | Delta () const |
| Get the increment by the number of elements while the allocation of additional memory. | |
| void | Delta (uint16 newDelta) |
| Set the increment by the number of elements while the allocation of additional memory (1 - autoincrement). | |
| void | SetMaxDelta (uint16 newDelta) |
| Set the maximum increment. | |
| bool | SetSize (size_t newSize, bool clear) |
| Functions that allocate potentially large memory, return an operation result (success/error). More... | |
| bool | Reserve (size_t n, bool addAdditionalSpace=true) |
| Reserve space for a given number of elements. | |
| void | Flush () |
| Set the number of elements to null. | |
| void | HardFlush () |
| Free the whole memory. | |
| void | Adjust () |
| Free the unnecessary memory. | |
| SimpleName * | Add () |
| Add an element to the end of the array. | |
| SimpleName * | Add (const SimpleName &) |
| Add an element to the end of the array. | |
| SimpleName * | AddItems (size_t n) |
| Add n elements to the end of the array. | |
| SimpleName * | AddAt (const SimpleName &ent, size_t index) |
| Insert an element by the index. | |
| SimpleName * | AddAfter (const SimpleName &, size_t index) |
| Add an element after the specified one. | |
| SimpleName * | InsertObj (const SimpleName &index, const SimpleName &ent) |
| Insert an element before the specified one. | |
| SimpleName * | InsertInd (size_t index, const SimpleName &) |
| Insert an element before the specified one. | |
| SimpleName * | InsertInd (size_t index) |
| Insert the empty element before the specified one. | |
| void | Remove (SimpleName *firstItr, SimpleName *lastItr) |
| Delete elements from the array from firstItr to lastItr-1 inclusively. | |
| void | RemoveInd (size_t firstIdx, size_t lastIdx) |
| Delete elements from the array from firstIdx to lastIdx-1 inclusively. | |
| void | RemoveInd (size_t idx) |
| Delete an element from array by the index. | |
| size_t | RemoveObj (const SimpleName &delObject) |
| Delete an element from array. | |
| bool | Fill (size_t fillCount, const SimpleName &fillData) |
| Fill an array. | |
| bool | FillZero (size_t fillCount, size_t startIndex=0) |
| Fill an array by bites consisting of 0. | |
| size_t | FindIt (const SimpleName &) const |
| Return an index of the element in the array. | |
| bool | IsExist (const SimpleName &) const |
| true if the element is found. | |
| size_t | Count () const |
| Get the number of elements in array. | |
| ptrdiff_t | MaxIndex () const |
| Get the number of elements in array. | |
| bool | SetCArray (const SimpleName *o, size_t count) |
| Assign the value from the c-array. | |
| void | Swap (SArray &arr) |
| Swap data of arrays. | |
| SArray< SimpleName > & | operator= (const SArray< SimpleName > &) |
| Assignment operator. | |
| SArray< SimpleName > & | operator= (const std::vector< SimpleName > &) |
| Assignment operator. | |
| SArray< SimpleName > & | operator+= (const SArray< SimpleName > &) |
| Merging operator. | |
| SArray< SimpleName > & | operator+= (const std::vector< SimpleName > &) |
| Merging operator. | |
| bool | operator== (const SArray< SimpleName > &w) const |
| Equality operator. More... | |
| SimpleName & | operator[] (size_t loc) const |
| Access by index operator. | |
| void | Sort (CompFunc comp=CompareSArrayItems< SimpleName >) |
| Sort the array. Sort in ascending order by default. | |
| const SimpleName * | GetAddr () const |
| Get the address of the beginning of the array. | |
| const SimpleName * | GetEndAddr () const |
| Get a pointer of the end (which follows the last element). | |
| bool | empty () const |
| Test whether vector is empty (i.e. whether its size is 0). | |
| size_t | size () const |
| Get the number of elements in array. | |
| void | reserve (size_t n) |
| Reserve space for a given number of elements. | |
| void | resize (size_t n, SimpleName val=SimpleName()) |
| Resizes the container so that it contains n elements. | |
| size_t | capacity () const |
| What is the number of elements the memory is allocated for? | |
| void | push_back (const SimpleName &e) |
| Add an element to the end of the array. | |
| void | pop_back () |
| Removes the last element in the array, reducing the array size by one. | |
| void | insert (Iterator pos, const SimpleName &e) |
| Insert an element before the specified one. | |
| void | erase (Iterator pos) |
| Delete an element from array by the index. | |
| void | erase (Iterator first, Iterator last) |
| Delete elements from the array from first to last-1 inclusively. | |
| void | clear () |
| Set the number of elements to null. | |
| void | shrink_to_fit () |
| Free the unnecessary memory (Reduce capacity). | |
| void | assign (Iterator first, Iterator last) |
| Assign new contents to the array, replacing its current contents. | |
| void | assign (size_t n, const SimpleName &val) |
| Assign new contents to the array, replacing its current contents. | |
| const SimpleName * | begin () const |
| Get the pointer to the first array element. | |
| SimpleName * | begin () |
| Get the pointer to the first array element. | |
| const SimpleName * | end () const |
| Get the pointer to the piece of memory after the array. | |
| SimpleName * | end () |
| Get the pointer to the piece of memory after the array. | |
| const SimpleName * | cbegin () const |
| Get the pointer to the first array element. | |
| const SimpleName * | cend () const |
| Get the pointer to the piece of memory after the array. | |
| const SimpleName & | front () const |
| SimpleName & | front () |
| const SimpleName & | back () const |
| SimpleName & | back () |
Friends | |
| reader & | operator>> (reader &in, MbPath &ref) |
| Read operator. | |
| writer & | operator<< (writer &out, const MbPath &ref) |
| Write operator. | |
| writer & | operator<< (writer &out, MbPath &ref) |
| Write operator. | |
Additional Inherited Members | |
| Public Types inherited from SArray< SimpleName > | |
| typedef int(* | CompFunc) (const SimpleName *, const SimpleName *) |
| A template of sorting function. | |
| Protected Member Functions inherited from SArray< SimpleName > | |
| bool | CatchMemory () |
| Catch memory. | |
| bool | AddMemory (size_t n) |
| Provide memory for n elements, independently from AutoDelta. | |
| size_t | AutoDelta () const |
| Calculate autoincrement. | |
| TEMPLATE_FRIEND bool set_array_size | TEMPLATE_SUFFIX (SArray< SimpleName > &, size_t newSize, bool clear) |
| Reallocate memory. | |
| TEMPLATE_FRIEND SimpleName *add_n_to_array | TEMPLATE_SUFFIX (SArray< SimpleName > &, size_t n) |
| Add memory for n elements of the array and return a pointer to the beginning of the selected piece of memory. | |
| TEMPLATE_FRIEND size_t find_in_array | TEMPLATE_SUFFIX (const SArray< SimpleName > &, const SimpleName &object) |
| Find an element in the array. | |
| TEMPLATE_FRIEND bool fill_array | TEMPLATE_SUFFIX (SArray< SimpleName > &, size_t fillCount, const SimpleName &fillData) |
| Fill fillCount elements of the array by copies of the object fillData. | |
| TEMPLATE_FRIEND bool fill_array_zero | TEMPLATE_SUFFIX (SArray< SimpleName > &, size_t fillCount, size_t startIndex) |
| Fill fillCount elements of the array by nulls. | |
| TEMPLATE_FRIEND reader &CALL_DECLARATION | operator>>TEMPLATE_SUFFIX (reader &in, SArray< SimpleName > &ref) |
| Read operator. | |
| TEMPLATE_FRIEND reader &CALL_DECLARATION | operator>>TEMPLATE_SUFFIX (reader &in, SArray< SimpleName > *&ptr) |
| Read operator. | |
| TEMPLATE_FRIEND writer &CALL_DECLARATION | operator<<TEMPLATE_SUFFIX (writer &out, const SArray< SimpleName > &ref) |
| Write operator. | |
| TEMPLATE_FRIEND writer &CALL_DECLARATION | operator<<TEMPLATE_SUFFIX (writer &out, const SArray< SimpleName > *ptr) |
| Write operator. | |
| Protected Attributes inherited from SArray< SimpleName > | |
| size_t | count |
| The number of elements in array. | |
| size_t | upper |
| The number of elements the memory is allocated for. | |
| uint16 | delta |
| Increment by the number of elements while the allocation of additional memory. | |
Detailed Description
Path to component.
Path as array of identifiers (path to component from upper component).
The documentation for this class was generated from the following file:
