| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| * | Adds casting strings to numbers in the sum operator | Charlie Stanton | 2023-04-19 | 2 | -13/+36 | |
| | | ||||||
| * | Creates functions for compounding atoms back into values in the walk module ↵ | Charlie Stanton | 2023-04-18 | 1 | -73/+19 | |
| | | | | | and uses them in subex/main | |||||
| * | Refactors store and sum states to use the new SubexParentState for states ↵ | Charlie Stanton | 2023-04-18 | 1 | -53/+104 | |
| | | | | | that run machines within themselves | |||||
| * | Fixes bug where stores wouldn't work inside other stores sometimes | Charlie Stanton | 2023-04-18 | 1 | -1/+1 | |
| | | | | | Something like $a($b(test)..."$b") wouldn't work as expected, this works now | |||||
| * | Adds the sum operator | Charlie Stanton | 2023-04-18 | 3 | -9/+78 | |
| | | | | | Currently doesn't parse strings as each atom is considered independantly. Instead individual characters in strings can be cast | |||||
| * | Removes try, maybe, maximise and minimise | Charlie Stanton | 2023-04-18 | 2 | -63/+1 | |
| | | | | | 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 | 3 | -12/+151 | |
| | | | | | | | 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. | |||||
| * | Fix bug where SubexStoreState is sometimes not a pointer | Charlie Stanton | 2023-03-15 | 1 | -1/+1 | |
| | | ||||||
| * | Renames TransducerOutput to OutputContent (and related types) and moves into ↵ | Charlie Stanton | 2023-03-05 | 4 | -29/+28 | |
| | | | | | main/subexstate.go | |||||
| * | Changes the slot map so only runes can be used as slots | Charlie Stanton | 2023-03-05 | 2 | -7/+5 | |
| | | ||||||
| * | Renames walk.Datum to walk.Atom | Charlie Stanton | 2023-03-05 | 4 | -89/+105 | |
| | | ||||||
| * | Refactors out terminator literal stuff into a separate parsing function | Charlie Stanton | 2023-03-05 | 1 | -117/+37 | |
| | | ||||||
| * | Adds syntax to recognise and deal with starting and ending arrays, maps and ↵ | Charlie Stanton | 2023-02-26 | 1 | -0/+123 | |
| | | | | | strings | |||||
| * | Replace append with walk.ConcatData in many places to fix bug to do with ↵ | Charlie Stanton | 2023-02-26 | 2 | -7/+7 | |
| | | | | | | | semantics of append When doing append, be very careful as it does make changes in place to the underlying array of the slice which may affect other slices | |||||
| * | Converts subex output back into WalkValues and prints for easier debugging | Charlie Stanton | 2023-02-26 | 1 | -3/+60 | |
| | | ||||||
| * | Modify subex to take JSON split into "data" | Charlie Stanton | 2023-02-22 | 4 | -85/+137 | |
| | | | | | | | 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 | 5 | -0/+631 | |
| Doesn't integrate it at all yet | ||||||
 |
index : stred go | |
| Prototype Go implementation of stred |
| aboutsummaryrefslogtreecommitdiff |