Anyfix was inspired by Jelly and 05AB1E, two of my favorite golfing languages made by Dennis and Adnan (PPCG), respectively. It uses the Jelly SBCS. It was designed to support prefix, infix, postfix, or any combination of the three, by waiting for there to be enough arguments before applying an operation (instead of throwing errors) but because of that, dyads and above default to prefix and monads default to postfix. As soon as any of the operators have enough arguments, the first one in the program will be executed, and it will update again to see if any others can run because of the update.
Anyfix is currently under heavy development so things may change at any time without warning. I will try to not break things that worked in the past but no guarantees are made.
“string”: string of arbitrary length. \k for any character k currently returns k for most k; changes will be made later.
“string1“string2“string3”: list of strings of arbitrary length, of arbitrary length. String syntax still applies
”c: string of length 1. '\k still works.
123: number
0123: octal
0b11: binary
0q11: quaternary
0x11: hexadecimal
[1 2 3]: list. Can be nested like [1 2 3 [4 5 6]]. Try [1[2[3[4]5]6]7] :D
(1 2 3): splat (that is, all elements returned by its evaluation will be pushed independently onto the stack). Useful for overriding order of operations
ßcode»: sort over a key function. If top-of-stack is a list, sort that; otherwise, sort the whole stack
Ɓcode»: sort the stack over a key function, even if the top of the stack is a list
€code»: map over a key function. If top-of-stack is a list, map that; otherwise, map the whole stack
£code»: map the stack over a key function, even if the top of the stack is a list
þcode»: filter over a key function. If top-of-stack is a list, filter that; otherwise, filter the whole stack
ʠcode»: filter out over a key function. If top-of-stack is a list, filter out that; otherwise, apply on the whole stack
/code»: reduce over a key (dyadic) function
\code»: reduce over a key (dyadic) function, keeping intermediate results
¿code»: while loop; look at the top of the stack each time and if stack is non-empty and the top value is true, run the code on the stack
¢code»: while loop; pop the top of the stack each time and if stack is non-empty and the popped value is true, run the code on the stack
¡code»: while loop; keep running the code until the elements are no longer unique
Codeblocks do not need the trailing '»'; that's only required for if code contains more than one token.
¥: Convert the top of the stack to a string, with a specified number of digits of precision
©: Copy top of stack to register
¬: Logical inverse
®: Push register
½: Square Root
ƽ: Integer Square Root
Ø: Center a list or string to a specified length using 0 for padding lists and ' ' for strings
Ç: Copy 1-from-top to top
Ð: Triplicate top of stack
×: Multiply
ç: Copy 1-from-top {top} times
ı: Complex Number
ȷ: 1-from-top * 10 ** top (exp-10)
÷: Arbitrary-precision Division
ø: Center a list or string to a specified length padding with the specified item. If a list or multi-character string is given as a padding element, it may use a fractional portion of it
!: Factorial / Pi Function
": Duplicate top of stack
#: Parse to integer or float
$: Convert the top of the stack to a string
&: Logical AND
*: Exponentiation
+: Addition (Integer, String, List Element-wise, Integer into List on each element)
-: Negate (Integer)
:: Integer Division
;: Concatenate. Implicitly calls converts from integers to strings
<: Less Than
=: Equality Check
>: Greater Than
?: Ternary: 2-from-top if top else 1-from-top
@: Pop the top of the stack into the register
A: Absolute Value
B: Integer -> Binary Digits, or String -> Characters; does nothing to multi-value things
D: Integer -> Decimal Digits, or String -> Characters; does nothing to multi-value things
F: Flatten Array
I: Differences between elements
J: Range of Length (according to L)
K: Join by space
L: Length; converts numbers to strings automatically
O: String -> Map to code-points, Character -> code-point, Integer -> character at that code-point
P: Product
R: Range [1..x]
S: Sum
U: Reverses the top if it can be iterated over; otherwise, the whole stack
W: Wrap; x -> [x]
X: Expand the top of the stack to individual elements; does nothing if the top is not a list or string
Z: Zip; transform of a list of lists or strings
_: Subtraction; 1-from-top - top
b: Convert from number to digits in specified base
p: Pad on the left side to match a certain length using 0 for lists and ' ' for strings
q: Pad on the right side to match a certain length using 0 for lists and ' ' for strings
s: Split list into sublists of specified length
x: Repeat List Element-wise ([1 2 3] x 4 becomes [1 1 1 1 2 2 2 2 3 3 3 3])
z: Zip; transform of a list of lists or strings using a specified filled if the matrix is not rectangular
{: Pad on the left side to match a certain length using the specified item. If a list or multi-character string is given as a padding element, it may use a fractional portion of it
|: Logical OR
'}': Pad on the right side to match a certain length using the specified item. If a list or multi-character string is given as a padding element, it may use a fractional portion of it
¹: Identity (returns the argument)
²: Squared
³: 16
⁴: 10
⁵: 100
⁶: ' '
⁷: ''
⁸: '\n'
⁹: []
⁺: Only keep positive numbers and strings
¯: Only keep negative numbers
⁼: Check type equality
⁽: Move the top of the stack to the bottom
⁾: Move the bottom of the stack to the top
Ƒ: Find the start and end of all matches of the pattern 1-from-top in the string top
Ɠ: Evaluate a single line of input
Ɱ: Determine whether or not the pattern 1-from-top matches the start of the string top
Ɲ: Finds the end of the match of the pattern 1-from-top in the string top if it matches; otherwise, 0
Ƥ: Print followed by a newline
Ƭ: Split, not regular expression
Ʋ: Copy the 1-from-top into the top-of-stack-th position in the stack
Ȥ: Copy the top-of-stack-th element to the top
ƈ: Read a single character of input
ƒ: Find all substrings of top that match pattern 1-from-top, non-overlapping
ɠ: Read a line of input
ɦ: Read all input into a list of lines
ƥ: Print not followed by a newline
ɼ: Replace all occurrences of the string 2-from-top with 1-from-top in the string top
ʂ: Replace all occurrences of the pattern 2-from-top with 1-from-top in the string top
ƭ: Split, regular expression
ȥ: Move the top-of-stack-th element to the top, pulling it out of the stack
ʋ: Push the 1-from-top into the top-of-stack-th position in the stack
Ạ: Python AND
Ḅ: Bit (x % 2)
İ: Reverse increments; cumulatively add all of the elements of the array top to the element 1-from-top. 1 10R İ is equivalent to 10R \+ +1
Ḷ: Range [0..x-1]
Ọ: Python OR
Ḃ: Binary digits -> Integer
Ḋ: Decimal digits -> Integer
Ŀ: Edit Distance between strings / lists / integers (automatically converts to digits)
ḅ: Convert list to number using specified base
ġ: Greatest Common Divisor
ŀ: Lowest Common Multiple
ẋ: Repeat iterable overall; [1 2 3] ẋ 4 becomes [1 2 3 1 2 3 1 2 3 1 2 3]
«: Swap top two elements
‘: Increment
’: Decrement
“Hello, World!” - prints "Hello, World!". Heh, very boring.
(more to come later)
Copyright 2017, Alexander Liao
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.