Next

Tridash Tutorials

Alexander Gutev

Table of Contents

1. Hello Node
1.1. Nodes
1.2. First Application
1.3. Inline Node Declarations
1.4. Two-Way Bindings
2. Functional Bindings
2.1. Example Application: Adding Numbers
2.2. Binding to Functor Nodes
3. Conditional Bindings
3.1. Case Operator
3.2. Example 1: Maximum of Two Numbers
3.3. Example 2: Sum Limit
3.4. Improvements
4. Writing your own Functions
4.1. Definition Operator
4.2. Node self
4.3. Optional Arguments
4.4. Recursive Meta-Nodes
4.5. Nested Meta-Nodes
4.6. Local Nodes
4.7. Referencing Outer Nodes
4.8. Fun Example: Simple Meter
5. Subnodes
5.1. Example: Color Object
6. Error Handling with Failure Values
6.1. Invalid Input
6.2. Failure Values
6.3. Handling Failures
6.4. Initial Values
6.5. Exercise
7. Failure Types
7.1. Identifying the cause of Failures
7.2. Example: Checking Failure type in Adding Numbers Application
7.3. Creating Failure Values
7.4. Proper Failure Types
8. Target Node Transforms
8.1. Node Attributes
8.2. Attribute target-node
8.3. Target-Node for own Meta-Nodes
9. Contexts
9.1. Explicit Contexts
9.2. Handling Failures with Explicit Contexts
9.3. Improved Error Handling in Adding Numbers
9.4. Concise Syntax
10. Node States
10.1. Stateful Bindings
10.2. Interfacing with JavaScript
10.3. Example: Counter Application
10.4. State Transitions
10.5. Example: Alternating Increment Button
10.6. Exercises
11. List Processing
11.1. Creating Lists
11.2. Higher-Order Meta-Nodes
11.3. Example: Message List
12. Modules And Organization
12.1. Multiple Source Files
12.2. Modules In Depth
12.3. Adding Modularity to Adding Numbers
12.4. Infix Operators
13. What’s Next?

This set of tutorials covers the basics of the Tridash programming language.

Prior programming experience is not strictly necessary however is helpful.

[Tip]

The full source code for these tutorials is available in the tutorials directory of the Tridash source: https://github.com/alex-gutev/tridash/tree/master/tutorials.

   Next