0.2.0

Never stop time tracking! Segment your time into tasks when switching activities during your day.

0.1.5

1. priority management: propagate priority changes to descendant notes
2. status propagation: update note status and propagate changes to ancestor files

0.1.4

Command to open a note that has a tracker running, if one is found.

0.1.3

Fix bugs and add new commands to change properties in YAML metadata

0.1.2

The most stable version so far, the core functionalities are working well with easy integration with other plugins.

0.1.1

1. Set preference interval to periodically compute the hierarchical elapsed time from the root notes.
2. Command to Start or Stop the tracker to be used as a hotkey (used in combination with the command that updates the elapsed time of the current note, triggered when the tracker stops, as defined in the settings of simple-time-tracker)

0.1.0

All the core functionalities working as expected.

0.0.3

Time Tree plugin has two main commands:

1. Compute hierarchical (aggregating) elapsed time from a root note descending to the leaves notes (no links to other notes);
2. Update metadata of the current note and its ascendent notes.

The first command can be time-consuming, hence the existence of the second command that only needs to update the necessary metadata as it goes (can be set to trigger automatically when the time tracker ends).

0.0.2

In the plugin's settings, the user can define a note to serve as the root of the tree structure. From that note, the new command calls the other commands to: calculate the total elapsed time of each note, aggregate the elapsed time of child notes, and finally update the node size property so the Custom Node Size plugin can edit the graph view accordingly to the accumulated elapsed times from the leaves to the root node.

0.0.1

First concept of the Time Tree plugin

Store elapsed time as YAML metadata.
The elapsed time considers the aggregated sum of linking notes up to a leaf node (note with no links).
If notes are expected to be linked as a tree structure, where all notes only have one parent note (except the root note), this would allow unlimited hierarchical subtasks.