Tree structure to manage time lapses.
More...
Tree structure to manage time lapses.
◆ TimeLapseTree()
TimeLapseTree::TimeLapseTree |
( |
| ) |
|
◆ ~TimeLapseTree()
TimeLapseTree::~TimeLapseTree |
( |
| ) |
|
◆ GetAllIdentifiers() [1/2]
void TimeLapseTree::GetAllIdentifiers |
( |
CArrayInt & | result | ) |
|
Gets all identifiers in the tree using CArrayInt.
- Parameters
-
result | Array to store the identifiers |
◆ GetAllIdentifiers() [2/2]
void TimeLapseTree::GetAllIdentifiers |
( |
int & | result[] | ) |
|
Gets all identifiers in the tree using a native array.
- Parameters
-
result | Array to store the identifiers |
◆ GetIdentifierInRange() [1/2]
void TimeLapseTree::GetIdentifierInRange |
( |
CArrayInt & | result, |
|
|
datetime | dt ) |
Gets identifiers of nodes within a specified time range using CArrayInt.
- Parameters
-
result | Array to store the identifiers |
dt | Time to check within the range |
◆ GetIdentifierInRange() [2/2]
void TimeLapseTree::GetIdentifierInRange |
( |
int & | result[], |
|
|
datetime | dt ) |
Gets identifiers of nodes within a specified time range using a native array.
- Parameters
-
result | Array to store the identifiers |
dt | Time to check within the range |
◆ GetNode()
Gets a node by its identifier.
- Parameters
-
- Returns
- Pointer to the found node
◆ GetNodesByIdentifierArr()
void TimeLapseTree::GetNodesByIdentifierArr |
( |
CArrayObj & | result, |
|
|
int & | identifiers[] ) |
Gets nodes by their identifiers using a native array.
- Parameters
-
result | Array to store the result nodes |
identifiers | Array of identifiers |
◆ GetNodesByIdentifierCArr()
void TimeLapseTree::GetNodesByIdentifierCArr |
( |
CArrayObj & | result, |
|
|
CArrayInt & | identifiers ) |
Gets nodes by their identifiers using CArrayInt.
- Parameters
-
result | Array to store the result nodes |
identifiers | Array of identifiers |
◆ GetNodesInRange()
void TimeLapseTree::GetNodesInRange |
( |
CArrayObj *& | result, |
|
|
datetime | dt ) |
Gets nodes within a specified time range.
- Parameters
-
result | Pointer to the array to store the result nodes |
dt | Time to check within the range |
◆ Insert() [1/2]
void TimeLapseTree::Insert |
( |
int | id, |
|
|
datetime | start, |
|
|
datetime | end ) |
Inserts a new node into the tree.
- Parameters
-
id | Node identifier |
start | Start time of the time lapse |
end | End time of the time lapse |
◆ Insert() [2/2]
Inserts an existing node into the tree.
- Parameters
-
newNode | Pointer to the new node |
◆ TraverseInorder()
void TimeLapseTree::TraverseInorder |
( |
| ) |
|
Traverses the tree in-order.
◆ UpdateNode() [1/2]
bool TimeLapseTree::UpdateNode |
( |
int | id, |
|
|
int | newStart, |
|
|
int | newEnd ) |
Updates an existing node's time range.
- Parameters
-
id | Node identifier |
newStart | New start time |
newEnd | New end time |
- Returns
- True if the update was successful
◆ UpdateNode() [2/2]
Updates an existing node with a new node's details.
- Parameters
-
newNode | Pointer to the new node |
- Returns
- True if the update was successful
The documentation for this class was generated from the following file:
- C:/Users/solut/AppData/Roaming/MetaQuotes/Terminal/010E047102812FC0C18890992854220E/MQL5/Include/AtingMQL5/src/time/TimeLapseTree.mqh