• Getting Started
  • Installing Storm
  • Running Storm
    • Bundled Programs
    • In the Terminal
    • The Top Loop
    • Getting Help
    • External Code
  • Developing in Storm
    • Source References
    • Compilation Model
    • Compile from Source
    • Emacs Integration
  • Tutorials
    • Fundamentals
    • Values and Classes
    • Threading
    • Files and Streams
    • Serialization
    • UI
    • Tests
    • Using Grammar
    • New Expressions
      • Repeat Using AST
      • Repeat Using IR
      • Map Using AST
      • Map Using IR
    • New Entities
    • New Languages
    • Libraries in C
• Language Reference
  • Storm
    • Threading Model
    • Type System
    • The Name Tree
    • Exceptions
    • Compilation Model
    • Packages and Files
    • Top Loop
    • Command Line
    • Language Server
      • Emacs Plugin
      • Protocol
      • Languages
  • Basic Storm
    • Names
    • Comments
    • Definitions
      • Functions
      • Types
      • Enumerations
      • Global Variables
      • Named Threads
      • Generators
    • Code
      • Literals
      • Variables
      • Blocks
      • Function Calls
      • Function Return
      • Operators
      • Conditionals
      • Loops
      • Maybe and Null
      • Exceptions
      • Type Conversions
      • Function Objects
    • Extensibility
      • Expressions
      • Blocks
      • Metaprogramming
  • The Syntax Language
    • Terminology
    • Names
    • Visibility
    • Grammar
    • The Parse Tree
    • Syntax Transforms
    • Syntax Highlighting
    • Indentation
    • The Info Tree
  • Intermediate Language
    • Type Descriptions
    • Listings
    • Sizes and Offsets
    • References
    • Operands
    • Instructions
    • Binary Objects
    • Example
  • C
    • Compilation
    • Annotations
    • Objects
    • Threading
    • Debugging
• Library Reference
  • Standard Library
    • Primitive Types
    • Objects and Actors
    • Strings
    • Containers
    • Iterators
    • Maybe
    • Variant
    • Function Objects
    • Exceptions
    • Copying Objects
    • IO
      • Url
      • Buffers
      • Streams
      • Text IO
      • Standard Streams
      • Networking
      • Other Streams
      • Serialization
    • Threading
    • Geometry
    • Graphics
    • Time
    • System Interfaces
    • Stack Traces
    • Unknown Types
    • Unsafe Operations
  • Compiler Library
    • The Value Type
    • Named Entities
    • Parsing
    • Code Generation
  • Unit Tests
  • Parser Library
  • Sound Library
  • Graphics Library
  • Layout Library
  • UI Library
    • Windows
    • Layout
    • Rendering
  • Presentation Library
    • Presentations
    • Layout
    • Elements
    • Animations
    • Picture Elements
  • Crypto Library
  • Markdown Library
    • Markdown
    • Usage
    • Documentation
      • The Storm Theme
  • SQL Library
    • Database Interface
    • Language Extension
  • Inline Assembler
    • Syntax
• Programs
  • Progvis
  • Tree Tool
• Downloads
  • Release Notes

Tree Tool

The package trees contains a simple tree visualization tool. It was created to visualize AVL trees during lessons conducted remotely. It is thus not aimed at performing many operations automatically, but rather to provide a visual aid for trees that is simple to manipulate.

The program can be started by writing trees:main at the Storm interactive prompt, or by specifying the following command line: ./Storm -f trees.main.

The program has a very minimal (i.e. non-existent UI). The mouse is used to point at nodes. Clicking and dragging moves the node under the cursor, or scrolls the entire workspace if the background is dragged. Apart from that, the following commands are recognized.

The following commands are recognized:

• <numbers> followed by i: Insert a new node where the mouse pointer is currently located.

  Example: type 12i to insert a node with label 12.

• d: Delete the node pointed to by the mouse.
• Shift d: Delete the subtree that starts at the node pointed to by the mouse.
• c: Clear both outgoing edges from the node pointed to by the mouse.
• q: Clear all edges from all nodes.
• l or j: Add or replace the left child of the node pointed to by the mouse. Click the node that the edge should be attached to next.
• r or k: Add or replace the right child of the node pointed to by the mouse. Click the node that the edge should be attached to next.
• esc: Cancel the current operation (mainly creating new edges).
• < (on Swedish keyboards) or z: Insert a | node (used to visualize the current location when using the tool to visualize sorting algorithms).
• <numbers> followed by e: Load an example tree. This removes any nodes currently present.

  For example: 1e loads the file 1.tree, 2e loads the file 2.tree and so on.

• Shift l or Shift j: Rotate the node pointed to by the mouse with its left child.
• Shift r or Shift k: Rotate the node pointed to by the mouse with its right child.
• Shift c: Clone the tree that starts at the node pointed to by the mouse. Place it below the cloned tree.
• Ctrl z: Undo (node movements are not tracked). Keep in mind that loading a new graph clears the undo stack.
• a: Perform automatic layot of the subtree that starts in the node pointed to by the mouse.

© 2017-2024 Filip Strömbäck

Design by Christoffer Holm