| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Add subex syntax to copy across booleans, numbers, strings and values | Charlie Stanton | 2023-04-21 | 1 | -0/+49 |
| | | |||||
| * | Properly exports all SubexASTs | Charlie Stanton | 2023-04-20 | 1 | -52/+52 |
| | | |||||
| * | Adds non-string literal syntax to subex | Charlie Stanton | 2023-04-20 | 1 | -0/+6 |
| | | |||||
| * | Adds the NOT operator | Charlie Stanton | 2023-04-19 | 1 | -0/+15 |
| | | |||||
| * | Adds the reciprocal operator | Charlie Stanton | 2023-04-19 | 1 | -0/+15 |
| | | |||||
| * | Adds the negate operator | Charlie Stanton | 2023-04-19 | 1 | -0/+14 |
| | | | | | Negates all of the numbers produced by its content subex | ||||
| * | Combines sum and product into an arithmetic state that contains a function ↵ | Charlie Stanton | 2023-04-19 | 1 | -2/+4 |
| | | | | | | | for it's operation Creates arithmetic.go which will house all of these functions | ||||
| * | Adds product/and operator | Charlie Stanton | 2023-04-19 | 1 | -4/+16 |
| | | |||||
| * | Replaces a few instances of SubexStates with pointers as they should be | Charlie Stanton | 2023-04-19 | 1 | -1/+1 |
| | | | | | This potentially avoids bugs/errors and also improves the performance of pruning | ||||
| * | Replaces the parent/child implementation for operators like store and sum ↵ | Charlie Stanton | 2023-04-19 | 1 | -7/+9 |
| | | | | | | | | | | with an output stack Previously a store state was a parent of another state machine that it would run inside of itself in order to capture the output to be stored. This was limited as the greedyness of the child would not be transferred to the parent. The new implementation gives states more control over the output state and turns it into a stack. By pushing to the stack before the child and popping afterwards, all of the child's output can be retrieved while the child is very much part of the complete machine. | ||||
| * | Adds the sum operator | Charlie Stanton | 2023-04-18 | 1 | -0/+12 |
| | | | | | 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 | 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 |