1 # -*- coding: utf-8 -*-
3 # Copyright © 2014-2020 Simon Forman
5 # This file is part of Thun
7 # Thun is free software: you can redistribute it and/or modify
8 # it under the terms of the GNU General Public License as published by
9 # the Free Software Foundation, either version 3 of the License, or
10 # (at your option) any later version.
12 # Thun is distributed in the hope that it will be useful,
13 # but WITHOUT ANY WARRANTY; without even the implied warranty of
14 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 # GNU General Public License for more details.
17 # You should have received a copy of the GNU General Public License
18 # along with Thun. If not see <http://www.gnu.org/licenses/>.
21 This module contains the Joy function infrastructure and a library of
22 functions. Its main export is a Python function initialize() that
23 returns a dictionary of Joy functions suitable for use with the joy()
26 from inspect import getdoc, getmembers, isfunction
27 from functools import wraps
28 from itertools import count
31 from .parser import text_to_expression, Symbol
32 from .utils import generated_library as genlib
33 from .utils.stack import (
52 # This is the main dict we're building.
56 def inscribe(function):
57 '''A decorator to inscribe functions into the default dictionary.'''
58 _dictionary[function.name] = function
63 '''Return a dictionary of Joy functions for use with joy().'''
64 return _dictionary.copy()
72 ('floordiv', ['/floor', '//']),
73 ('truediv', ['/', 'div']),
74 ('mod', ['%', 'rem', 'remainder', 'modulus']),
77 ('getitem', ['pick', 'at']),
88 ('rolldown', ['roll<']),
89 ('rollup', ['roll>']),
95 def add_aliases(D, A):
97 Given a dict and a iterable of (name, [alias, ...]) pairs, create
98 additional entries in the dict mapping each alias to the named function
99 if it's in the dict. Aliases for functions not in the dict are ignored.
101 for name, aliases in A:
106 for alias in aliases:
112 *fraction == [uncons] dip uncons [swap] dip concat [*] infra [*] dip cons
113 *fraction0 == concat [[swap] dip * [*] dip] infra
114 anamorphism == [pop []] swap [dip swons] genrec
115 average == [sum 1.0 *] [size] cleave /
116 binary == nullary [popop] dip
117 cleave == fork [popd] dip
118 codireco == cons dip rest cons
119 dinfrirst == dip infra first
120 unstack == ? [uncons ?] loop pop
121 down_to_zero == [0 >] [dup --] while
123 enstacken == stack [clear] dip
124 flatten == [] swap [concat] step
126 gcd == 1 [tuck modulus dup 0 >] loop pop
127 ifte == [nullary not] dipd branch
129 least_fraction == dup [gcd] infra [div] concat map
130 make_generator == [codireco] ccons
131 nullary == [stack] dinfrirst
134 tailrec == [i] genrec
135 product == 1 swap [*] step
137 range == [0 <=] [1 - dup] anamorphism
138 range_to_zero == unit [down_to_zero] infra
140 size == 0 swap [pop ++] step
142 step_zero == 0 roll> step
143 swoncat == swap concat
144 tailrec == [i] genrec
145 ternary == unary [popop] dip
146 unary == nullary popd
148 while == swap [nullary] cons dup dipd concat loop
152 # ifte == [nullary] dipd swap branch
153 # genrec == [[genrec] cons cons cons cons] nullary swons concat ifte
155 # Another definition for while. FWIW
156 # while == over [[i] dip nullary] ccons [nullary] dip loop
160 ##second == rest first
161 ##third == rest rest first
165 ##z-down == [] swap uncons swap
166 ##z-up == swons swap shunt
167 ##z-right == [swons] cons dip uncons swap
168 ##z-left == swons [uncons swap] dip swap
171 ##divisor == popop 2 *
173 ##radical == swap dup * rollup * 4 * - sqrt
176 ##q0 == [[divisor] [minusb] [radical]] pam
177 ##q1 == [[root1] [root2]] pam
178 ##quadratic == [q0] ternary i [q1] ternary
182 ##PE1.1 == + dup [+] dip
183 ##PE1.2 == dup [3 & PE1.1] dip 2 >>
184 ##PE1.3 == 14811 swap [PE1.2] times pop
185 ##PE1 == 0 0 66 [7 PE1.3] times 4 PE1.3 pop
187 #PE1.2 == [PE1.1] step
188 #PE1 == 0 0 66 [[3 2 1 3 1 2 3] PE1.2] times [3 2 1 3] PE1.2 pop
192 def FunctionWrapper(f):
193 '''Set name attribute.'''
195 raise ValueError('Function %s must have doc string.' % f.__name__)
196 f.name = f.__name__.rstrip('_') # Don't shadow builtins.
200 def SimpleFunctionWrapper(f):
202 Wrap functions that take and return just a stack.
206 def inner(stack, expression, dictionary):
207 return f(stack), expression, dictionary
211 def BinaryBuiltinWrapper(f):
213 Wrap functions that take two arguments and return a single result.
217 def inner(stack, expression, dictionary):
218 (a, (b, stack)) = stack
220 return (result, stack), expression, dictionary
224 def UnaryBuiltinWrapper(f):
226 Wrap functions that take one argument and return a single result.
230 def inner(stack, expression, dictionary):
233 return (result, stack), expression, dictionary
237 class DefinitionWrapper(object):
239 Provide implementation of defined functions, and some helper methods.
242 def __init__(self, name, body_text, doc=None):
243 self.name = self.__name__ = name
244 self.body = text_to_expression(body_text)
245 self._body = tuple(iter_stack(self.body))
246 self.__doc__ = doc or body_text
247 self._compiled = None
249 def __call__(self, stack, expression, dictionary):
251 return self._compiled(stack, expression, dictionary) # pylint: disable=E1102
252 expression = list_to_stack(self._body, expression)
253 return stack, expression, dictionary
256 def parse_definition(class_, defi):
258 Given some text describing a Joy function definition parse it and
259 return a DefinitionWrapper.
261 # At some point I decided that the definitions file should NOT
262 # use '==' to separate the name from the body. But somehow the
263 # xerblin\gui\default_joy_home\definitions.txt file didn't get
264 # the memo. Nor did the load_definitions() method.
265 # So I think the simplest way forward at the moment will be to
266 # edit this function to expect '=='.
268 name, part, body = defi.partition('==')
270 return class_(name.strip(), body.strip())
271 raise ValueError("No '==' in definition text %r" % (defi,))
273 # return class_(*(n.strip() for n in defi.split(None, 1)))
276 def add_definitions(class_, defs, dictionary):
278 Scan multi-line string defs for definitions and add them to the
281 for definition in _text_to_defs(defs):
282 class_.add_def(definition, dictionary)
285 def add_def(class_, definition, dictionary, fail_fails=False):
287 Add the definition to the dictionary.
289 F = class_.parse_definition(definition)
290 dictionary[F.name] = F
293 def load_definitions(class_, filename, dictionary):
294 with open(filename) as f:
295 lines = [line for line in f if '==' in line]
297 class_.add_def(line, dictionary)
300 def _text_to_defs(text):
303 for line in text.splitlines()
305 and not line.startswith('#')
317 def inscribe_(stack, expression, dictionary):
319 Create a new Joy function definition in the Joy dictionary. A
320 definition is given as a string with a name followed by a double
321 equal sign then one or more Joy functions, the body. for example:
325 If you want the definition to persist over restarts, enter it into
326 the definitions.txt resource.
328 definition, stack = stack
329 DefinitionWrapper.add_def(definition, dictionary, fail_fails=True)
330 return stack, expression, dictionary
334 @SimpleFunctionWrapper
336 '''Parse the string on the stack to a Joy expression.'''
338 expression = text_to_expression(text)
339 return expression, stack
343 # @SimpleFunctionWrapper
345 # '''Attempt to infer the stack effect of a Joy expression.'''
347 # effects = infer_expression(E)
348 # e = list_to_stack([(fi, (fo, ())) for fi, fo in effects])
353 @SimpleFunctionWrapper
358 getitem == drop first
360 Expects an integer and a quote on the stack and returns the item at the
361 nth position in the quote counting from 0.
365 -------------------------
369 n, (Q, stack) = stack
370 return pick(Q, n), stack
374 @SimpleFunctionWrapper
381 Expects an integer and a quote on the stack and returns the quote with
382 n items removed off the top.
386 ----------------------
390 n, (Q, stack) = stack
401 @SimpleFunctionWrapper
404 Expects an integer and a quote on the stack and returns the quote with
405 just the top n items in reverse order (because that's easier and you can
406 use reverse if needed.)
410 ----------------------
414 n, (Q, stack) = stack
427 @SimpleFunctionWrapper
430 Use a Boolean value to select one of two items.
434 ----------------------
439 ---------------------
442 Currently Python semantics are used to evaluate the "truthiness" of the
443 Boolean value (so empty string, zero, etc. are counted as false, etc.)
445 (if_, (then, (else_, stack))) = stack
446 return then if if_ else else_, stack
450 @SimpleFunctionWrapper
453 Use a Boolean value to select one of two items from a sequence.
457 ------------------------
462 -----------------------
465 The sequence can contain more than two items but not fewer.
466 Currently Python semantics are used to evaluate the "truthiness" of the
467 Boolean value (so empty string, zero, etc. are counted as false, etc.)
469 (flag, (choices, stack)) = stack
470 (else_, (then, _)) = choices
471 return then if flag else else_, stack
475 @SimpleFunctionWrapper
477 '''Given a list find the maximum.'''
479 return max(iter_stack(tos)), stack
483 @SimpleFunctionWrapper
485 '''Given a list find the minimum.'''
487 return min(iter_stack(tos)), stack
491 @SimpleFunctionWrapper
494 Given a quoted sequence of numbers return the sum.
497 sum == 0 swap [+] step
501 return sum(iter_stack(tos)), stack
505 @SimpleFunctionWrapper
508 Expects an item on the stack and a quote under it and removes that item
509 from the the quote. The item is only removed once.
513 ------------------------
517 (tos, (second, stack)) = S
518 l = list(iter_stack(second))
520 return list_to_stack(l), stack
524 @SimpleFunctionWrapper
526 '''Given a list remove duplicate items.'''
528 I = list(iter_stack(tos))
529 return list_to_stack(sorted(set(I), key=I.index)), stack
533 @SimpleFunctionWrapper
535 '''Given a list return it sorted.'''
537 return list_to_stack(sorted(iter_stack(tos))), stack
541 @SimpleFunctionWrapper
543 '''Clear everything from the stack.
546 clear == stack [pop stack] loop
556 @SimpleFunctionWrapper
557 def disenstacken(stack):
559 The disenstacken operator expects a list on top of the stack and makes that
560 the stack discarding the rest of the stack.
566 @SimpleFunctionWrapper
569 Reverse the list on the top of the stack.
572 reverse == [] swap shunt
576 for term in iter_stack(tos):
582 @SimpleFunctionWrapper
585 Concatinate the two lists on the top of the stack.
588 [a b c] [d e f] concat
589 ----------------------------
593 (tos, (second, stack)) = S
594 return concat(second, tos), stack
598 @SimpleFunctionWrapper
601 Like concat but reverses the top list into the second.
604 shunt == [swons] step == reverse swap concat
606 [a b c] [d e f] shunt
607 ---------------------------
611 (tos, (second, stack)) = stack
614 second = term, second
619 @SimpleFunctionWrapper
622 Replace the two lists on the top of the stack with a list of the pairs
623 from each list. The smallest list sets the length of the result list.
625 (tos, (second, stack)) = S
628 for a, b in zip(iter_stack(tos), iter_stack(second))
630 return list_to_stack(accumulator), stack
634 @SimpleFunctionWrapper
638 return tos + 1, stack
642 @SimpleFunctionWrapper
646 return tos - 1, stack
650 @SimpleFunctionWrapper
661 a, (b, stack) = stack
667 return int(math.floor(n))
669 floor.__doc__ = math.floor.__doc__
673 @SimpleFunctionWrapper
676 divmod(x, y) -> (quotient, remainder)
678 Return the tuple (x//y, x%y). Invariant: div*y + mod == x.
687 Return the square root of the number a.
688 Negative numbers return complex roots.
693 assert a < 0, repr(a)
694 r = math.sqrt(-a) * 1j
700 # if isinstance(text, str):
701 # return run(text, stack)
706 @SimpleFunctionWrapper
708 '''The identity function.'''
713 @SimpleFunctionWrapper
715 '''True if the form on TOS is void otherwise False.'''
717 return _void(form), stack
721 return any(not _void(i) for i in iter_stack(form))
732 def words(stack, expression, dictionary):
733 '''Print all the words in alphabetical order.'''
734 print(' '.join(sorted(dictionary)))
735 return stack, expression, dictionary
740 def sharing(stack, expression, dictionary):
741 '''Print redistribution information.'''
742 print("You may convey verbatim copies of the Program's source code as"
743 ' you receive it, in any medium, provided that you conspicuously'
744 ' and appropriately publish on each copy an appropriate copyright'
745 ' notice; keep intact all notices stating that this License and'
746 ' any non-permissive terms added in accord with section 7 apply'
747 ' to the code; keep intact all notices of the absence of any'
748 ' warranty; and give all recipients a copy of this License along'
750 ' You should have received a copy of the GNU General Public License'
751 ' along with Thun. If not see <http://www.gnu.org/licenses/>.')
752 return stack, expression, dictionary
757 def warranty(stack, expression, dictionary):
758 '''Print warranty information.'''
759 print('THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY'
760 ' APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE'
761 ' COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM'
762 ' "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR'
763 ' IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES'
764 ' OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE'
765 ' ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS'
766 ' WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE'
767 ' COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.')
768 return stack, expression, dictionary
771 # def simple_manual(stack):
773 # Print words and help for each word.
775 # for name, f in sorted(FUNCTIONS.items()):
777 # boxline = '+%s+' % ('-' * (len(name) + 2))
780 # '| %s |' % (name,),
782 # d if d else ' ...',
792 def help_(S, expression, dictionary):
793 '''Accepts a quoted symbol on the top of the stack and prints its docs.'''
794 ((symbol, _), stack) = S
795 word = dictionary[symbol]
796 print(HELP_TEMPLATE % (symbol, getdoc(word), symbol))
797 return stack, expression, dictionary
805 # Several combinators depend on other words in their definitions,
806 # we use symbols to prevent hard-coding these, so in theory, you
807 # could change the word in the dictionary to use different semantics.
808 S_choice = Symbol('choice')
809 S_first = Symbol('first')
810 S_genrec = Symbol('genrec')
811 S_getitem = Symbol('getitem')
813 S_ifte = Symbol('ifte')
814 S_infra = Symbol('infra')
815 S_loop = Symbol('loop')
816 S_pop = Symbol('pop')
817 S_primrec = Symbol('primrec')
818 S_step = Symbol('step')
819 S_swaack = Symbol('swaack')
820 S_times = Symbol('times')
825 def i(stack, expression, dictionary):
827 The i combinator expects a quoted program on the stack and unpacks it
828 onto the pending expression for evaluation.
837 return stack, concat(quote, expression), dictionary
842 def x(stack, expression, dictionary):
848 ... [Q] x = ... [Q] dup i
849 ... [Q] x = ... [Q] [Q] i
850 ... [Q] x = ... [Q] Q
854 return stack, concat(quote, expression), dictionary
859 def b(stack, expression, dictionary):
865 ... [P] [Q] b == ... [P] i [Q] i
866 ... [P] [Q] b == ... P Q
869 q, (p, (stack)) = stack
870 return stack, concat(p, concat(q, expression)), dictionary
875 def dupdip(stack, expression, dictionary):
879 [F] dupdip == dup [F] dip
889 return stack, concat(F, (a, expression)), dictionary
894 def infra(stack, expression, dictionary):
896 Accept a quoted program and a list on the stack and run the program
897 with the list as its stack. Does not affect the rest of the stack.
900 ... [a b c] [Q] . infra
901 -----------------------------
902 c b a . Q [...] swaack
905 (quote, (aggregate, stack)) = stack
906 return aggregate, concat(quote, (stack, (S_swaack, expression))), dictionary
911 def genrec(stack, expression, dictionary):
913 General Recursion Combinator.
916 [if] [then] [rec1] [rec2] genrec
917 ---------------------------------------------------------------------
918 [if] [then] [rec1 [[if] [then] [rec1] [rec2] genrec] rec2] ifte
920 From "Recursion Theory and Joy" (j05cmp.html) by Manfred von Thun:
921 "The genrec combinator takes four program parameters in addition to
922 whatever data parameters it needs. Fourth from the top is an if-part,
923 followed by a then-part. If the if-part yields true, then the then-part
924 is executed and the combinator terminates. The other two parameters are
925 the rec1-part and the rec2-part. If the if-part yields false, the
926 rec1-part is executed. Following that the four program parameters and
927 the combinator are again pushed onto the stack bundled up in a quoted
928 form. Then the rec2-part is executed, where it will find the bundled
929 form. Typically it will then execute the bundled form, either with i or
930 with app2, or some other combinator."
932 The way to design one of these is to fix your base case [then] and the
933 test [if], and then treat rec1 and rec2 as an else-part "sandwiching"
934 a quotation of the whole function.
936 For example, given a (general recursive) function 'F':
939 F == [I] [T] [R1] [R2] genrec
941 If the [I] if-part fails you must derive R1 and R2 from:
946 Just set the stack arguments in front, and figure out what R1 and R2
947 have to do to apply the quoted [F] in the proper way. In effect, the
948 genrec combinator turns into an ifte combinator with a quoted copy of
949 the original definition in the else-part:
952 F == [I] [T] [R1] [R2] genrec
953 == [I] [T] [R1 [F] R2] ifte
955 Primitive recursive functions are those where R2 == i.
958 P == [I] [T] [R] tailrec
959 == [I] [T] [R [P] i] ifte
960 == [I] [T] [R P] ifte
963 (rec2, (rec1, stack)) = stack
964 (then, (if_, _)) = stack
965 F = (if_, (then, (rec1, (rec2, (S_genrec, ())))))
966 else_ = concat(rec1, (F, rec2))
967 return (else_, stack), (S_ifte, expression), dictionary
972 def map_(S, expression, dictionary):
974 Run the quoted program on TOS on the items in the list under it, push a
975 new list with the results in place of the program and original list.
977 # (quote, (aggregate, stack)) = S
978 # results = list_to_stack([
979 # joy((term, stack), quote, dictionary)[0][0]
980 # for term in iter_stack(aggregate)
982 # return (results, stack), expression, dictionary
983 (quote, (aggregate, stack)) = S
985 return (aggregate, stack), expression, dictionary
987 for term in iter_stack(aggregate):
989 batch = (s, (quote, (S_infra, (S_first, batch))))
990 stack = (batch, ((), stack))
991 return stack, (S_infra, expression), dictionary
996 def primrec(stack, expression, dictionary):
998 From the "Overview of the language JOY":
1000 > The primrec combinator expects two quoted programs in addition to a
1001 data parameter. For an integer data parameter it works like this: If
1002 the data parameter is zero, then the first quotation has to produce
1003 the value to be returned. If the data parameter is positive then the
1004 second has to combine the data parameter with the result of applying
1005 the function to its predecessor.::
1009 > Then primrec tests whether the top element on the stack (initially
1010 the 5) is equal to zero. If it is, it pops it off and executes one of
1011 the quotations, the [1] which leaves 1 on the stack as the result.
1012 Otherwise it pushes a decremented copy of the top element and
1013 recurses. On the way back from the recursion it uses the other
1014 quotation, [*], to multiply what is now a factorial on top of the
1015 stack by the second element on the stack.::
1017 n [Base] [Recur] primrec
1019 0 [Base] [Recur] primrec
1020 ------------------------------
1023 n [Base] [Recur] primrec
1024 ------------------------------------------ n > 0
1025 n (n-1) [Base] [Recur] primrec Recur
1028 recur, (base, (n, stack)) = stack
1030 expression = concat(base, expression)
1032 expression = S_primrec, concat(recur, expression)
1033 stack = recur, (base, (n - 1, (n, stack)))
1034 return stack, expression, dictionary
1037 #def cleave(S, expression, dictionary):
1039 # The cleave combinator expects two quotations, and below that an item X.
1040 # It first executes [P], with X on top, and saves the top result element.
1041 # Then it executes [Q], again with X, and saves the top result.
1042 # Finally it restores the stack to what it was below X and pushes the two
1043 # results P(X) and Q(X).
1045 # (Q, (P, (x, stack))) = S
1046 # p = joy((x, stack), P, dictionary)[0][0]
1047 # q = joy((x, stack), Q, dictionary)[0][0]
1048 # return (q, (p, stack)), expression, dictionary
1053 def branch(stack, expression, dictionary):
1055 Use a Boolean value to select one of two quoted programs to run.
1059 branch == roll< choice i
1063 False [F] [T] branch
1064 --------------------------
1068 -------------------------
1072 (then, (else_, (flag, stack))) = stack
1073 return stack, concat(then if flag else else_, expression), dictionary
1078 ##def ifte(stack, expression, dictionary):
1080 ## If-Then-Else Combinator
1083 ## ... [if] [then] [else] ifte
1084 ## ---------------------------------------------------
1085 ## ... [[else] [then]] [...] [if] infra select i
1090 ## ... [if] [then] [else] ifte
1091 ## -------------------------------------------------------
1092 ## ... [else] [then] [...] [if] infra first choice i
1095 ## Has the effect of grabbing a copy of the stack on which to run the
1096 ## if-part using infra.
1098 ## (else_, (then, (if_, stack))) = stack
1099 ## expression = (S_infra, (S_first, (S_choice, (S_i, expression))))
1100 ## stack = (if_, (stack, (then, (else_, stack))))
1101 ## return stack, expression, dictionary
1106 def cond(stack, expression, dictionary):
1108 This combinator works like a case statement. It expects a single quote
1109 on the stack that must contain zero or more condition quotes and a
1110 default quote. Each condition clause should contain a quoted predicate
1111 followed by the function expression to run if that predicate returns
1112 true. If no predicates return true the default function runs.
1114 It works by rewriting into a chain of nested `ifte` expressions, e.g.::
1116 [[[B0] T0] [[B1] T1] [D]] cond
1117 -----------------------------------------
1118 [B0] [T0] [[B1] [T1] [D] ifte] ifte
1121 conditions, stack = stack
1123 expression = _cond(conditions, expression)
1125 # Attempt to preload the args to first ifte.
1126 (P, (T, (E, expression))) = expression
1128 # If, for any reason, the argument to cond should happen to contain
1129 # only the default clause then this optimization will fail.
1132 stack = (E, (T, (P, stack)))
1133 return stack, expression, dictionary
1136 def _cond(conditions, expression):
1137 (clause, rest) = conditions
1138 if not rest: # clause is [D]
1141 return (P, (T, (_cond(rest, ()), (S_ifte, expression))))
1146 def dip(stack, expression, dictionary):
1148 The dip combinator expects a quoted program on the stack and below it
1149 some item, it hoists the item into the expression and runs the program
1150 on the rest of the stack.
1158 (quote, (x, stack)) = stack
1159 expression = (x, expression)
1160 return stack, concat(quote, expression), dictionary
1165 def dipd(S, expression, dictionary):
1167 Like dip but expects two items.
1171 ---------------------
1175 (quote, (x, (y, stack))) = S
1176 expression = (y, (x, expression))
1177 return stack, concat(quote, expression), dictionary
1182 def dipdd(S, expression, dictionary):
1184 Like dip but expects three items.
1188 -----------------------
1192 (quote, (x, (y, (z, stack)))) = S
1193 expression = (z, (y, (x, expression)))
1194 return stack, concat(quote, expression), dictionary
1199 def app1(S, expression, dictionary):
1201 Given a quoted program on TOS and anything as the second stack item run
1202 the program and replace the two args with the first result of the
1207 -----------------------------------
1208 ... [x ...] [Q] . infra first
1211 (quote, (x, stack)) = S
1212 stack = (quote, ((x, stack), stack))
1213 expression = (S_infra, (S_first, expression))
1214 return stack, expression, dictionary
1219 def app2(S, expression, dictionary):
1220 '''Like app1 with two items.
1224 -----------------------------------
1225 ... [y ...] [Q] . infra first
1226 [x ...] [Q] infra first
1229 (quote, (x, (y, stack))) = S
1230 expression = (S_infra, (S_first,
1231 ((x, stack), (quote, (S_infra, (S_first,
1233 stack = (quote, ((y, stack), stack))
1234 return stack, expression, dictionary
1239 def app3(S, expression, dictionary):
1240 '''Like app1 with three items.
1243 ... z y x [Q] . app3
1244 -----------------------------------
1245 ... [z ...] [Q] . infra first
1246 [y ...] [Q] infra first
1247 [x ...] [Q] infra first
1250 (quote, (x, (y, (z, stack)))) = S
1251 expression = (S_infra, (S_first,
1252 ((y, stack), (quote, (S_infra, (S_first,
1253 ((x, stack), (quote, (S_infra, (S_first,
1254 expression))))))))))
1255 stack = (quote, ((z, stack), stack))
1256 return stack, expression, dictionary
1261 def step(S, expression, dictionary):
1263 Run a quoted program on each item in a sequence.
1267 -----------------------
1272 ------------------------
1276 ... [a b c] [Q] . step
1277 ----------------------------------------
1278 ... a . Q [b c] [Q] step
1280 The step combinator executes the quotation on each member of the list
1281 on top of the stack.
1283 (quote, (aggregate, stack)) = S
1285 return stack, expression, dictionary
1286 head, tail = aggregate
1287 stack = quote, (head, stack)
1289 expression = tail, (quote, (S_step, expression))
1290 expression = S_i, expression
1291 return stack, expression, dictionary
1296 def times(stack, expression, dictionary):
1298 times == [-- dip] cons [swap] infra [0 >] swap while pop
1302 --------------------- w/ n <= 0
1307 -----------------------
1312 ------------------------------------- w/ n > 1
1313 ... . Q (n - 1) [Q] times
1316 # times == [-- dip] cons [swap] infra [0 >] swap while pop
1317 (quote, (n, stack)) = stack
1319 return stack, expression, dictionary
1322 expression = n, (quote, (S_times, expression))
1323 expression = concat(quote, expression)
1324 return stack, expression, dictionary
1327 # The current definition above works like this:
1330 # --------------------------------------
1331 # [P] nullary [Q [P] nullary] loop
1333 # while == [pop i not] [popop] [dudipd] tailrec
1335 #def while_(S, expression, dictionary):
1336 # '''[if] [body] while'''
1337 # (body, (if_, stack)) = S
1338 # while joy(stack, if_, dictionary)[0][0]:
1339 # stack = joy(stack, body, dictionary)[0]
1340 # return stack, expression, dictionary
1345 def loop(stack, expression, dictionary):
1347 Basic loop combinator.
1351 -----------------------
1355 ------------------------
1359 quote, (flag, stack) = stack
1361 expression = concat(quote, (quote, (S_loop, expression)))
1362 return stack, expression, dictionary
1367 def cmp_(stack, expression, dictionary):
1369 cmp takes two values and three quoted programs on the stack and runs
1370 one of the three depending on the results of comparing the two values:
1374 ------------------------- a > b
1378 ------------------------- a = b
1382 ------------------------- a < b
1385 L, (E, (G, (b, (a, stack)))) = stack
1386 expression = concat(G if a > b else L if a < b else E, expression)
1387 return stack, expression, dictionary
1390 # FunctionWrapper(cleave),
1391 # FunctionWrapper(while_),
1396 #divmod_ = pm = __(n2, n1), __(n4, n3)
1398 BinaryBuiltinWrapper(operator.eq),
1399 BinaryBuiltinWrapper(operator.ge),
1400 BinaryBuiltinWrapper(operator.gt),
1401 BinaryBuiltinWrapper(operator.le),
1402 BinaryBuiltinWrapper(operator.lt),
1403 BinaryBuiltinWrapper(operator.ne),
1405 BinaryBuiltinWrapper(operator.xor),
1406 BinaryBuiltinWrapper(operator.lshift),
1407 BinaryBuiltinWrapper(operator.rshift),
1409 BinaryBuiltinWrapper(operator.and_),
1410 BinaryBuiltinWrapper(operator.or_),
1412 BinaryBuiltinWrapper(operator.add),
1413 BinaryBuiltinWrapper(operator.floordiv),
1414 BinaryBuiltinWrapper(operator.mod),
1415 BinaryBuiltinWrapper(operator.mul),
1416 BinaryBuiltinWrapper(operator.pow),
1417 BinaryBuiltinWrapper(operator.sub),
1418 BinaryBuiltinWrapper(operator.truediv),
1420 UnaryBuiltinWrapper(bool),
1421 UnaryBuiltinWrapper(operator.not_),
1423 UnaryBuiltinWrapper(abs),
1424 UnaryBuiltinWrapper(operator.neg),
1425 UnaryBuiltinWrapper(sqrt),
1427 UnaryBuiltinWrapper(floor),
1428 UnaryBuiltinWrapper(round),
1431 del F # Otherwise Sphinx autodoc will pick it up.
1434 for name, primitive in getmembers(genlib, isfunction):
1435 inscribe(SimpleFunctionWrapper(primitive))
1438 add_aliases(_dictionary, ALIASES)
1441 DefinitionWrapper.add_definitions(definitions, _dictionary)