| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Removes try, maybe, maximise and minimise | Charlie Stanton | 2023-04-18 | 1 | -54/+0 |
| | | | | | These are no longer necessary and have been replaced by repeat | ||||
| * | Adds the repeat construct, obsoleting maximise, minimise, try, maybe and ↵ | Charlie Stanton | 2023-04-18 | 1 | -11/+67 |
| | | | | | | | probably more The repeat construct repeats a subex a number of times, this number is based on a provided list which is ordered by priority and can be unbounded. | ||||
| * | Renames TransducerOutput to OutputContent (and related types) and moves into ↵ | Charlie Stanton | 2023-03-05 | 1 | -1/+1 |
| | | | | | main/subexstate.go | ||||
| * | Renames walk.Datum to walk.Atom | Charlie Stanton | 2023-03-05 | 1 | -6/+21 |
| | | |||||
| * | Modify subex to take JSON split into "data" | Charlie Stanton | 2023-02-22 | 1 | -3/+6 |
| | | | | | | | Currently no way to reassemble the data on the other side Much of the potential data cannot be interacted with meaningfully, only the string functionality is implemented Should rename data to something else | ||||
| * | Introduces subex processing | Charlie Stanton | 2023-02-19 | 1 | -0/+163 |
| Doesn't integrate it at all yet | |||||
 |
index : stred go | |
| Prototype Go implementation of stred |
| aboutsummaryrefslogtreecommitdiff |