Class Method list used by SAP ABAP Class CL_FMHIE_TREE_DATA (Handling of hierarchical data in memory)
SAP ABAP Class
CL_FMHIE_TREE_DATA (Handling of hierarchical data in memory) is using
| # | Object Type | Object Name | Object Description | Note |
|---|---|---|---|---|
| 1 | CL_AUNIT_ASSERT - ASSERT_EQUALS | ABAP Unit: Assertions (see Longtext) | ||
| 2 | CL_BUBAS_HASHED_BUFFER - CONSTRUCTOR | Generischer Puffer - Budgetierung u. Verfügbarkeitskontrolle | ||
| 3 | CL_BUBAS_HASHED_BUFFER - COUNT | Generischer Puffer - Budgetierung u. Verfügbarkeitskontrolle | ||
| 4 | CL_BUBAS_HASHED_BUFFER - COUNT | Generischer Puffer - Budgetierung u. Verfügbarkeitskontrolle | ||
| 5 | CL_BUBAS_HASHED_BUFFER - DELETE_WITH_KEY | Generischer Puffer - Budgetierung u. Verfügbarkeitskontrolle | ||
| 6 | CL_BUBAS_HASHED_BUFFER - DELETE_WITH_KEY | Generischer Puffer - Budgetierung u. Verfügbarkeitskontrolle | ||
| 7 | CL_BUBAS_HASHED_BUFFER - GET | Generischer Puffer - Budgetierung u. Verfügbarkeitskontrolle | ||
| 8 | CL_BUBAS_HASHED_BUFFER - INSERT | Generischer Puffer - Budgetierung u. Verfügbarkeitskontrolle | ||
| 9 | CL_BUBAS_HASHED_BUFFER - INSERT | Generischer Puffer - Budgetierung u. Verfügbarkeitskontrolle | ||
| 10 | CL_BUBAS_HASHED_BUFFER - INSERT | Generischer Puffer - Budgetierung u. Verfügbarkeitskontrolle | ||
| 11 | CL_BUBAS_HASHED_BUFFER - INSERT | Generischer Puffer - Budgetierung u. Verfügbarkeitskontrolle | ||
| 12 | CL_BUBAS_HASHED_BUFFER - INSERT | Generischer Puffer - Budgetierung u. Verfügbarkeitskontrolle | ||
| 13 | CL_BUBAS_HASHED_BUFFER - REFRESH | Generischer Puffer - Budgetierung u. Verfügbarkeitskontrolle | ||
| 14 | CL_BUBAS_MASS_HASHED_BUFFER - GET_DIRECT_REFERENCE | Hashed buffer with direct reference methods | ||
| 15 | CL_BUBAS_MASS_HASHED_BUFFER - GET_DIRECT_REFERENCE | Hashed buffer with direct reference methods | ||
| 16 | CL_FMHIE_TREE_DATA - DELETE_NODE | Handling of hierarchical data in memory | ||
| 17 | CL_FMHIE_TREE_DATA - INSERT_NODE | Handling of hierarchical data in memory | ||
| 18 | CL_FMHIE_TREE_DATA - INSERT_NODE | Handling of hierarchical data in memory | ||
| 19 | CL_FMHIE_TREE_DATA - INSERT_NODE | Handling of hierarchical data in memory | ||
| 20 | CL_FMHIE_TREE_DATA - GET_SUBTREE | Handling of hierarchical data in memory | ||
| 21 | CL_FMHIE_TREE_DATA - GET_SUBTREE | Handling of hierarchical data in memory | ||
| 22 | CL_FMHIE_TREE_DATA - GET_SUBTREE | Handling of hierarchical data in memory | ||
| 23 | CL_FMHIE_TREE_DATA - GET_DIRECT_REFERENCE | Handling of hierarchical data in memory | ||
| 24 | CL_FMHIE_TREE_DATA - FIND_NODE | Handling of hierarchical data in memory | ||
| 25 | CL_FMHIE_TREE_DATA - FIND_NODE | Handling of hierarchical data in memory | ||
| 26 | CL_FMHIE_TREE_DATA - FIND_NODE | Handling of hierarchical data in memory | ||
| 27 | CL_FMHIE_TREE_DATA - FIND_NODE | Handling of hierarchical data in memory | ||
| 28 | CL_FMHIE_TREE_DATA - FIND_NODE | Handling of hierarchical data in memory | ||
| 29 | CL_FMHIE_TREE_DATA - FIND_NODE | Handling of hierarchical data in memory | ||
| 30 | CL_FMHIE_TREE_DATA - APPEND_NODES_FROM_EXT_DATA | Handling of hierarchical data in memory | ||
| 31 | CL_FMHIE_TREE_DATA - APPEND_NODES_FROM_EXT_DATA | Handling of hierarchical data in memory | ||
| 32 | CL_FMHIE_TREE_DATA - CHECK_DATA_MISSING | Handling of hierarchical data in memory | ||
| 33 | CL_FMHIE_TREE_DATA - CHECK_DATA_MISSING | Handling of hierarchical data in memory | ||
| 34 | CL_FMHIE_TREE_DATA - CHECK_DATA_MISSING | Handling of hierarchical data in memory | ||
| 35 | CL_FMHIE_TREE_DATA - CONSTRUCTOR | Handling of hierarchical data in memory | ||
| 36 | CL_FMHIE_TREE_DATA - COUNT | Handling of hierarchical data in memory | ||
| 37 | CL_FMHIE_TREE_DATA - COUNT | Handling of hierarchical data in memory | ||
| 38 | CL_FMHIE_TREE_DATA - DELETE_NODE | Handling of hierarchical data in memory | ||
| 39 | CL_FMHIE_TREE_DATA - FIND_NODE | Handling of hierarchical data in memory | ||
| 40 | CL_FMHIE_TREE_DATA - FIND_NODE | Handling of hierarchical data in memory | ||
| 41 | CL_FMHIE_TREE_DATA - FIND_NODE | Handling of hierarchical data in memory | ||
| 42 | CL_FMHIE_TREE_TRAVERSAL - CONSTRUCTOR | Iterator for tree traversal (only preorder right now) | ||
| 43 | CL_FMHIE_TREE_TRAVERSAL - CONSTRUCTOR | Iterator for tree traversal (only preorder right now) | ||
| 44 | CL_FMHIE_TREE_TRAVERSAL - GET_NEXT | Iterator for tree traversal (only preorder right now) | ||
| 45 | CL_FMHIE_TREE_TRAVERSAL - GET_NEXT | Iterator for tree traversal (only preorder right now) | ||
| 46 | CL_FMHIE_TREE_TRAVERSAL - INIT | Iterator for tree traversal (only preorder right now) | ||
| 47 | CL_FMHIE_TREE_TRAVERSAL - INIT | Iterator for tree traversal (only preorder right now) |