Implement a pointer tree view

[jonasstrehle]

The workbench needs support for a complex pointer tree view.

• The pointer tree view shall be a expandable list of a list of pointers and values
  • We need support for the following types
    • text (strings)
    • endpoint
    • boolean
    • integer + typed integer
    • decimal + typed decimal
    • list
    • map
• Pointers must be lazy-loaded, and only shown once the user expands the layer
• Pointer shown but not expanded shall only be displayed by there pointer id ($xxxxxxxxxxxxxxxxxx) plus their allowed type (if object {...}, array [...], if integer integer, if text text, ...
• The pointer id of a contained non expanded pointer (for example as element of a list) shall be a link and link to the actual pointer origin in the tree view (auto-opening all layers and jumping there)
• The tree view must work with recursive pointers
• The values of expanded pointers shall be automatically updated on value change
• The list shall be held in sync with the actual pointers, once a pointer was removed, it must be removed from the rendering (optionally closing and removing the elements that are below if required)
• Edit support for pointer tree view
  • Values (such as text / integer) shall be editable once clicked on. The user shall input a new value and hit enter to save the changes. The update shall be propagated for the pointer
• Detection of circular structures and display as "circular"
• Search filters (types, values, origins) support

[jonasstrehle]

@kha1dx Actual example pointer data comes from https://github.com/unyt-org/datex-workbench/blob/feat/pointer-view/src/lib/runtime.ts

Note: Do a git reset --hard origin/feat/pointer-view as @benStre has rebased the branch.