Category:Tailspin: Difference between revisions
Content added Content deleted
(add link to language introduction) |
(Update tailspin language description) |
||
Line 3: | Line 3: | ||
|tags=tailspin}} |
|tags=tailspin}} |
||
Tailspin simplifies data transfer and the processing of data according to rules and conditions. |
|||
⚫ | |||
Thanks to its declarative data structures and corresponding condition matching syntax, |
|||
many algorithms look exactly like the specification, for example, compare the |
|||
[https://rosettacode.org/wiki/JSON#Tailspin json parser] |
|||
and the [https://www.json.org/json-en.html json specification]. |
|||
Despite the grounding in business data processing, Tailspin turns out to be fun to use and has been |
|||
used for the [https://adventofcode.com/ adventofcode] events of [https://github.com/tobega/aoc2018 2018] |
|||
and [https://github.com/tobega/aoc2019 2019] |
|||
⚫ | The inspiration comes mostly from xslt, but data structures are json-like. The main idea is to let your data flow through a series of transforms so it should be easy to specify that flow. Transform steps can be specified as a set of templates with pattern-matching determining which template to apply. Output is generally specified as literals with interpolation of values. |
||
[http://tobega.blogspot.com/2020/05/a-little-tailspin.html Quick intro] |
[http://tobega.blogspot.com/2020/05/a-little-tailspin.html Quick intro] |