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.errors import (
38 from .utils.stack import (
57 # This is the main dict we're building.
61 def inscribe(function):
62 '''A decorator to inscribe functions into the default dictionary.'''
63 _dictionary[function.name] = function
68 '''Return a dictionary of Joy functions for use with joy().'''
69 return _dictionary.copy()
77 ('floordiv', ['/floor', '//', '/', 'div']),
78 ('mod', ['%', 'rem', 'remainder', 'modulus']),
81 ('getitem', ['pick', 'at']),
92 ('rolldown', ['roll<']),
93 ('rollup', ['roll>']),
99 def add_aliases(D, A):
101 Given a dict and a iterable of (name, [alias, ...]) pairs, create
102 additional entries in the dict mapping each alias to the named function
103 if it's in the dict. Aliases for functions not in the dict are ignored.
105 for name, aliases in A:
110 for alias in aliases:
116 *fraction == [uncons] dip uncons [swap] dip concat [*] infra [*] dip cons
117 *fraction0 == concat [[swap] dip * [*] dip] infra
118 anamorphism == [pop []] swap [dip swons] genrec
119 average == [sum 1.0 *] [size] cleave /
120 binary == nullary [popop] dip
121 cleave == fork [popd] dip
122 codireco == cons dip rest cons
123 dinfrirst == dip infra first
124 unstack == ? [uncons ?] loop pop
125 down_to_zero == [0 >] [dup --] while
127 enstacken == stack [clear] dip
128 flatten == [] swap [concat] step
130 gcd == 1 [tuck modulus dup 0 >] loop pop
131 ifte == [nullary not] dipd branch
133 least_fraction == dup [gcd] infra [div] concat map
134 make_generator == [codireco] ccons
135 nullary == [stack] dinfrirst
138 tailrec == [i] genrec
139 product == 1 swap [*] step
141 range == [0 <=] [1 - dup] anamorphism
142 range_to_zero == unit [down_to_zero] infra
144 size == 0 swap [pop ++] step
146 step_zero == 0 roll> step
147 swoncat == swap concat
148 tailrec == [i] genrec
149 ternary == unary [popop] dip
150 unary == nullary popd
152 while == swap [nullary] cons dup dipd concat loop
156 # ifte == [nullary] dipd swap branch
157 # genrec == [[genrec] cons cons cons cons] nullary swons concat ifte
159 # Another definition for while. FWIW
160 # while == over [[i] dip nullary] ccons [nullary] dip loop
164 ##second == rest first
165 ##third == rest rest first
169 ##z-down == [] swap uncons swap
170 ##z-up == swons swap shunt
171 ##z-right == [swons] cons dip uncons swap
172 ##z-left == swons [uncons swap] dip swap
175 ##divisor == popop 2 *
177 ##radical == swap dup * rollup * 4 * - sqrt
180 ##q0 == [[divisor] [minusb] [radical]] pam
181 ##q1 == [[root1] [root2]] pam
182 ##quadratic == [q0] ternary i [q1] ternary
186 ##PE1.1 == + dup [+] dip
187 ##PE1.2 == dup [3 & PE1.1] dip 2 >>
188 ##PE1.3 == 14811 swap [PE1.2] times pop
189 ##PE1 == 0 0 66 [7 PE1.3] times 4 PE1.3 pop
191 #PE1.2 == [PE1.1] step
192 #PE1 == 0 0 66 [[3 2 1 3 1 2 3] PE1.2] times [3 2 1 3] PE1.2 pop
196 def FunctionWrapper(f):
197 '''Set name attribute.'''
199 raise ValueError('Function %s must have doc string.' % f.__name__)
200 f.name = f.__name__.rstrip('_') # Don't shadow builtins.
204 def SimpleFunctionWrapper(f):
206 Wrap functions that take and return just a stack.
210 def inner(stack, expression, dictionary):
211 return f(stack), expression, dictionary
215 def BinaryBuiltinWrapper(f):
217 Wrap functions that take two arguments and return a single result.
221 def inner(stack, expression, dictionary):
223 (a, (b, stack)) = stack
225 raise StackUnderflowError('Not enough values on stack.')
226 # Boolean predicates like "or" fail here. :(
227 ## if ( not isinstance(a, int)
228 ## or not isinstance(b, int)
229 ## or isinstance(a, bool) # Because bools are ints in Python.
230 ## or isinstance(b, bool)
232 ## raise NotAnIntError
234 return (result, stack), expression, dictionary
238 def UnaryBuiltinWrapper(f):
240 Wrap functions that take one argument and return a single result.
244 def inner(stack, expression, dictionary):
247 return (result, stack), expression, dictionary
251 class DefinitionWrapper(object):
253 Provide implementation of defined functions, and some helper methods.
256 def __init__(self, name, body_text, doc=None):
257 self.name = self.__name__ = name
258 self.body = text_to_expression(body_text)
259 self._body = tuple(iter_stack(self.body))
260 self.__doc__ = doc or body_text
261 self._compiled = None
263 def __call__(self, stack, expression, dictionary):
265 return self._compiled(stack, expression, dictionary) # pylint: disable=E1102
266 expression = list_to_stack(self._body, expression)
267 return stack, expression, dictionary
270 def parse_definition(class_, defi):
272 Given some text describing a Joy function definition parse it and
273 return a DefinitionWrapper.
275 # At some point I decided that the definitions file should NOT
276 # use '==' to separate the name from the body. But somehow the
277 # xerblin\gui\default_joy_home\definitions.txt file didn't get
278 # the memo. Nor did the load_definitions() method.
279 # So I think the simplest way forward at the moment will be to
280 # edit this function to expect '=='.
282 name, part, body = defi.partition('==')
284 return class_(name.strip(), body.strip())
285 raise ValueError("No '==' in definition text %r" % (defi,))
287 # return class_(*(n.strip() for n in defi.split(None, 1)))
290 def add_definitions(class_, defs, dictionary):
292 Scan multi-line string defs for definitions and add them to the
295 for definition in _text_to_defs(defs):
296 class_.add_def(definition, dictionary)
299 def add_def(class_, definition, dictionary, fail_fails=False):
301 Add the definition to the dictionary.
303 F = class_.parse_definition(definition)
304 dictionary[F.name] = F
307 def load_definitions(class_, filename, dictionary):
308 with open(filename) as f:
309 lines = [line for line in f if '==' in line]
311 class_.add_def(line, dictionary)
314 class Def(DefinitionWrapper):
316 Definitions created by inscribe.
319 def __init__(self, name, body):
322 self._body = tuple(iter_stack(body))
323 self.__doc__ = expression_to_string(body)
324 self._compiled = None
327 def _text_to_defs(text):
330 for line in text.splitlines()
332 and not line.startswith('#')
344 def inscribe_(stack, expression, dictionary):
346 Create a new Joy function definition in the Joy dictionary. A
347 definition is given as a quote with a name followed by a Joy
348 expression. for example:
350 [sqr dup mul] inscribe
353 (name, body), stack = stack
355 dictionary[d.name] = d
356 return stack, expression, dictionary
360 @SimpleFunctionWrapper
362 '''Parse the string on the stack to a Joy expression.'''
364 expression = text_to_expression(text)
365 return expression, stack
369 # @SimpleFunctionWrapper
371 # '''Attempt to infer the stack effect of a Joy expression.'''
373 # effects = infer_expression(E)
374 # e = list_to_stack([(fi, (fo, ())) for fi, fo in effects])
379 @SimpleFunctionWrapper
384 getitem == drop first
386 Expects an integer and a quote on the stack and returns the item at the
387 nth position in the quote counting from 0.
391 -------------------------
395 n, (Q, stack) = stack
396 return pick(Q, n), stack
400 @SimpleFunctionWrapper
407 Expects an integer and a quote on the stack and returns the quote with
408 n items removed off the top.
412 ----------------------
416 n, (Q, stack) = stack
427 @SimpleFunctionWrapper
430 Expects an integer and a quote on the stack and returns the quote with
431 just the top n items in reverse order (because that's easier and you can
432 use reverse if needed.)
436 ----------------------
440 n, (Q, stack) = stack
454 def gcd2(stack, expression, dictionary):
455 '''Compiled GCD function.'''
456 (v1, (v2, stack)) = stack
461 (v1, (v2, stack)) = (v3, (v1, stack))
462 return (v2, stack), expression, dictionary
466 @SimpleFunctionWrapper
469 Use a Boolean value to select one of two items.
473 ----------------------
478 ---------------------
481 Currently Python semantics are used to evaluate the "truthiness" of the
482 Boolean value (so empty string, zero, etc. are counted as false, etc.)
484 (if_, (then, (else_, stack))) = stack
485 return then if if_ else else_, stack
489 @SimpleFunctionWrapper
492 Use a Boolean value to select one of two items from a sequence.
496 ------------------------
501 -----------------------
504 The sequence can contain more than two items but not fewer.
505 Currently Python semantics are used to evaluate the "truthiness" of the
506 Boolean value (so empty string, zero, etc. are counted as false, etc.)
508 (flag, (choices, stack)) = stack
509 (else_, (then, _)) = choices
510 return then if flag else else_, stack
514 @SimpleFunctionWrapper
516 '''Given a list find the maximum.'''
518 return max(iter_stack(tos)), stack
522 @SimpleFunctionWrapper
524 '''Given a list find the minimum.'''
526 return min(iter_stack(tos)), stack
530 @SimpleFunctionWrapper
533 Given a quoted sequence of numbers return the sum.
536 sum == 0 swap [+] step
540 return sum(iter_stack(tos)), stack
544 @SimpleFunctionWrapper
547 Expects an item on the stack and a quote under it and removes that item
548 from the the quote. The item is only removed once.
552 ------------------------
556 (tos, (second, stack)) = S
557 l = list(iter_stack(second))
559 return list_to_stack(l), stack
563 @SimpleFunctionWrapper
565 '''Given a list remove duplicate items.'''
567 I = list(iter_stack(tos))
568 return list_to_stack(sorted(set(I), key=I.index)), stack
572 @SimpleFunctionWrapper
574 '''Given a list return it sorted.'''
576 return list_to_stack(sorted(iter_stack(tos))), stack
580 @SimpleFunctionWrapper
582 '''Clear everything from the stack.
585 clear == stack [pop stack] loop
595 @SimpleFunctionWrapper
596 def disenstacken(stack):
598 The disenstacken operator expects a list on top of the stack and makes that
599 the stack discarding the rest of the stack.
605 @SimpleFunctionWrapper
608 Reverse the list on the top of the stack.
611 reverse == [] swap shunt
615 for term in iter_stack(tos):
621 @SimpleFunctionWrapper
624 Concatinate the two lists on the top of the stack.
627 [a b c] [d e f] concat
628 ----------------------------
632 (tos, (second, stack)) = S
633 return concat(second, tos), stack
637 @SimpleFunctionWrapper
640 Like concat but reverses the top list into the second.
643 shunt == [swons] step == reverse swap concat
645 [a b c] [d e f] shunt
646 ---------------------------
650 (tos, (second, stack)) = stack
653 second = term, second
658 @SimpleFunctionWrapper
661 Replace the two lists on the top of the stack with a list of the pairs
662 from each list. The smallest list sets the length of the result list.
664 (tos, (second, stack)) = S
667 for a, b in zip(iter_stack(tos), iter_stack(second))
669 return list_to_stack(accumulator), stack
673 @SimpleFunctionWrapper
677 return tos + 1, stack
681 @SimpleFunctionWrapper
685 return tos - 1, stack
689 @SimpleFunctionWrapper
700 a, (b, stack) = stack
706 return int(math.floor(n))
708 floor.__doc__ = math.floor.__doc__
712 @SimpleFunctionWrapper
715 divmod(x, y) -> (quotient, remainder)
717 Return the tuple (x//y, x%y). Invariant: q * y + r == x.
726 Return the square root of the number a.
727 Negative numbers return complex roots.
732 assert a < 0, repr(a)
733 r = math.sqrt(-a) * 1j
739 # if isinstance(text, str):
740 # return run(text, stack)
745 @SimpleFunctionWrapper
747 '''The identity function.'''
752 @SimpleFunctionWrapper
754 '''True if the form on TOS is void otherwise False.'''
756 return _void(form), stack
760 return any(not _void(i) for i in iter_stack(form))
771 def words(stack, expression, dictionary):
772 '''Print all the words in alphabetical order.'''
773 print(' '.join(sorted(dictionary)))
774 return stack, expression, dictionary
779 def sharing(stack, expression, dictionary):
780 '''Print redistribution information.'''
781 print("You may convey verbatim copies of the Program's source code as"
782 ' you receive it, in any medium, provided that you conspicuously'
783 ' and appropriately publish on each copy an appropriate copyright'
784 ' notice; keep intact all notices stating that this License and'
785 ' any non-permissive terms added in accord with section 7 apply'
786 ' to the code; keep intact all notices of the absence of any'
787 ' warranty; and give all recipients a copy of this License along'
789 ' You should have received a copy of the GNU General Public License'
790 ' along with Thun. If not see <http://www.gnu.org/licenses/>.')
791 return stack, expression, dictionary
796 def warranty(stack, expression, dictionary):
797 '''Print warranty information.'''
798 print('THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY'
799 ' APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE'
800 ' COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM'
801 ' "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR'
802 ' IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES'
803 ' OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE'
804 ' ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS'
805 ' WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE'
806 ' COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.')
807 return stack, expression, dictionary
810 # def simple_manual(stack):
812 # Print words and help for each word.
814 # for name, f in sorted(FUNCTIONS.items()):
816 # boxline = '+%s+' % ('-' * (len(name) + 2))
819 # '| %s |' % (name,),
821 # d if d else ' ...',
831 def help_(S, expression, dictionary):
832 '''Accepts a quoted symbol on the top of the stack and prints its docs.'''
833 ((symbol, _), stack) = S
834 word = dictionary[symbol]
835 print(HELP_TEMPLATE % (symbol, getdoc(word), symbol))
836 return stack, expression, dictionary
844 # Several combinators depend on other words in their definitions,
845 # we use symbols to prevent hard-coding these, so in theory, you
846 # could change the word in the dictionary to use different semantics.
847 S_choice = Symbol('choice')
848 S_first = Symbol('first')
849 S_genrec = Symbol('genrec')
850 S_getitem = Symbol('getitem')
852 S_ifte = Symbol('ifte')
853 S_infra = Symbol('infra')
854 S_loop = Symbol('loop')
855 S_pop = Symbol('pop')
856 S_primrec = Symbol('primrec')
857 S_step = Symbol('step')
858 S_swaack = Symbol('swaack')
859 S_times = Symbol('times')
864 def i(stack, expression, dictionary):
866 The i combinator expects a quoted program on the stack and unpacks it
867 onto the pending expression for evaluation.
878 raise StackUnderflowError('Not enough values on stack.')
879 return stack, concat(quote, expression), dictionary
884 def x(stack, expression, dictionary):
890 ... [Q] x = ... [Q] dup i
891 ... [Q] x = ... [Q] [Q] i
892 ... [Q] x = ... [Q] Q
896 return stack, concat(quote, expression), dictionary
901 def b(stack, expression, dictionary):
907 ... [P] [Q] b == ... [P] i [Q] i
908 ... [P] [Q] b == ... P Q
911 q, (p, (stack)) = stack
912 return stack, concat(p, concat(q, expression)), dictionary
917 def dupdip(stack, expression, dictionary):
921 [F] dupdip == dup [F] dip
931 return stack, concat(F, (a, expression)), dictionary
936 def infra(stack, expression, dictionary):
938 Accept a quoted program and a list on the stack and run the program
939 with the list as its stack. Does not affect the rest of the stack.
942 ... [a b c] [Q] . infra
943 -----------------------------
944 c b a . Q [...] swaack
947 (quote, (aggregate, stack)) = stack
948 return aggregate, concat(quote, (stack, (S_swaack, expression))), dictionary
953 def genrec(stack, expression, dictionary):
955 General Recursion Combinator.
958 [if] [then] [rec1] [rec2] genrec
959 ---------------------------------------------------------------------
960 [if] [then] [rec1 [[if] [then] [rec1] [rec2] genrec] rec2] ifte
962 From "Recursion Theory and Joy" (j05cmp.html) by Manfred von Thun:
963 "The genrec combinator takes four program parameters in addition to
964 whatever data parameters it needs. Fourth from the top is an if-part,
965 followed by a then-part. If the if-part yields true, then the then-part
966 is executed and the combinator terminates. The other two parameters are
967 the rec1-part and the rec2-part. If the if-part yields false, the
968 rec1-part is executed. Following that the four program parameters and
969 the combinator are again pushed onto the stack bundled up in a quoted
970 form. Then the rec2-part is executed, where it will find the bundled
971 form. Typically it will then execute the bundled form, either with i or
972 with app2, or some other combinator."
974 The way to design one of these is to fix your base case [then] and the
975 test [if], and then treat rec1 and rec2 as an else-part "sandwiching"
976 a quotation of the whole function.
978 For example, given a (general recursive) function 'F':
981 F == [I] [T] [R1] [R2] genrec
983 If the [I] if-part fails you must derive R1 and R2 from:
988 Just set the stack arguments in front, and figure out what R1 and R2
989 have to do to apply the quoted [F] in the proper way. In effect, the
990 genrec combinator turns into an ifte combinator with a quoted copy of
991 the original definition in the else-part:
994 F == [I] [T] [R1] [R2] genrec
995 == [I] [T] [R1 [F] R2] ifte
997 Primitive recursive functions are those where R2 == i.
1000 P == [I] [T] [R] tailrec
1001 == [I] [T] [R [P] i] ifte
1002 == [I] [T] [R P] ifte
1005 (rec2, (rec1, stack)) = stack
1006 (then, (if_, _)) = stack
1007 F = (if_, (then, (rec1, (rec2, (S_genrec, ())))))
1008 else_ = concat(rec1, (F, rec2))
1009 return (else_, stack), (S_ifte, expression), dictionary
1014 def map_(S, expression, dictionary):
1016 Run the quoted program on TOS on the items in the list under it, push a
1017 new list with the results in place of the program and original list.
1019 # (quote, (aggregate, stack)) = S
1020 # results = list_to_stack([
1021 # joy((term, stack), quote, dictionary)[0][0]
1022 # for term in iter_stack(aggregate)
1024 # return (results, stack), expression, dictionary
1025 (quote, (aggregate, stack)) = S
1027 return (aggregate, stack), expression, dictionary
1029 for term in iter_stack(aggregate):
1031 batch = (s, (quote, (S_infra, (S_first, batch))))
1032 stack = (batch, ((), stack))
1033 return stack, (S_infra, expression), dictionary
1038 def primrec(stack, expression, dictionary):
1040 From the "Overview of the language JOY":
1042 > The primrec combinator expects two quoted programs in addition to a
1043 data parameter. For an integer data parameter it works like this: If
1044 the data parameter is zero, then the first quotation has to produce
1045 the value to be returned. If the data parameter is positive then the
1046 second has to combine the data parameter with the result of applying
1047 the function to its predecessor.::
1051 > Then primrec tests whether the top element on the stack (initially
1052 the 5) is equal to zero. If it is, it pops it off and executes one of
1053 the quotations, the [1] which leaves 1 on the stack as the result.
1054 Otherwise it pushes a decremented copy of the top element and
1055 recurses. On the way back from the recursion it uses the other
1056 quotation, [*], to multiply what is now a factorial on top of the
1057 stack by the second element on the stack.::
1059 n [Base] [Recur] primrec
1061 0 [Base] [Recur] primrec
1062 ------------------------------
1065 n [Base] [Recur] primrec
1066 ------------------------------------------ n > 0
1067 n (n-1) [Base] [Recur] primrec Recur
1070 recur, (base, (n, stack)) = stack
1072 expression = concat(base, expression)
1074 expression = S_primrec, concat(recur, expression)
1075 stack = recur, (base, (n - 1, (n, stack)))
1076 return stack, expression, dictionary
1079 #def cleave(S, expression, dictionary):
1081 # The cleave combinator expects two quotations, and below that an item X.
1082 # It first executes [P], with X on top, and saves the top result element.
1083 # Then it executes [Q], again with X, and saves the top result.
1084 # Finally it restores the stack to what it was below X and pushes the two
1085 # results P(X) and Q(X).
1087 # (Q, (P, (x, stack))) = S
1088 # p = joy((x, stack), P, dictionary)[0][0]
1089 # q = joy((x, stack), Q, dictionary)[0][0]
1090 # return (q, (p, stack)), expression, dictionary
1095 def branch(stack, expression, dictionary):
1097 Use a Boolean value to select one of two quoted programs to run.
1101 branch == roll< choice i
1105 False [F] [T] branch
1106 --------------------------
1110 -------------------------
1114 (then, (else_, (flag, stack))) = stack
1115 return stack, concat(then if flag else else_, expression), dictionary
1120 ##def ifte(stack, expression, dictionary):
1122 ## If-Then-Else Combinator
1125 ## ... [if] [then] [else] ifte
1126 ## ---------------------------------------------------
1127 ## ... [[else] [then]] [...] [if] infra select i
1132 ## ... [if] [then] [else] ifte
1133 ## -------------------------------------------------------
1134 ## ... [else] [then] [...] [if] infra first choice i
1137 ## Has the effect of grabbing a copy of the stack on which to run the
1138 ## if-part using infra.
1140 ## (else_, (then, (if_, stack))) = stack
1141 ## expression = (S_infra, (S_first, (S_choice, (S_i, expression))))
1142 ## stack = (if_, (stack, (then, (else_, stack))))
1143 ## return stack, expression, dictionary
1148 def cond(stack, expression, dictionary):
1150 This combinator works like a case statement. It expects a single quote
1151 on the stack that must contain zero or more condition quotes and a
1152 default quote. Each condition clause should contain a quoted predicate
1153 followed by the function expression to run if that predicate returns
1154 true. If no predicates return true the default function runs.
1156 It works by rewriting into a chain of nested `ifte` expressions, e.g.::
1158 [[[B0] T0] [[B1] T1] [D]] cond
1159 -----------------------------------------
1160 [B0] [T0] [[B1] [T1] [D] ifte] ifte
1163 conditions, stack = stack
1165 expression = _cond(conditions, expression)
1167 # Attempt to preload the args to first ifte.
1168 (P, (T, (E, expression))) = expression
1170 # If, for any reason, the argument to cond should happen to contain
1171 # only the default clause then this optimization will fail.
1174 stack = (E, (T, (P, stack)))
1175 return stack, expression, dictionary
1178 def _cond(conditions, expression):
1179 (clause, rest) = conditions
1180 if not rest: # clause is [D]
1183 return (P, (T, (_cond(rest, ()), (S_ifte, expression))))
1188 def dip(stack, expression, dictionary):
1190 The dip combinator expects a quoted program on the stack and below it
1191 some item, it hoists the item into the expression and runs the program
1192 on the rest of the stack.
1201 (quote, (x, stack)) = stack
1203 raise StackUnderflowError('Not enough values on stack.')
1204 expression = (x, expression)
1205 return stack, concat(quote, expression), dictionary
1210 def dipd(S, expression, dictionary):
1212 Like dip but expects two items.
1216 ---------------------
1220 (quote, (x, (y, stack))) = S
1221 expression = (y, (x, expression))
1222 return stack, concat(quote, expression), dictionary
1227 def dipdd(S, expression, dictionary):
1229 Like dip but expects three items.
1233 -----------------------
1237 (quote, (x, (y, (z, stack)))) = S
1238 expression = (z, (y, (x, expression)))
1239 return stack, concat(quote, expression), dictionary
1244 def app1(S, expression, dictionary):
1246 Given a quoted program on TOS and anything as the second stack item run
1247 the program and replace the two args with the first result of the
1252 -----------------------------------
1253 ... [x ...] [Q] . infra first
1256 (quote, (x, stack)) = S
1257 stack = (quote, ((x, stack), stack))
1258 expression = (S_infra, (S_first, expression))
1259 return stack, expression, dictionary
1264 def app2(S, expression, dictionary):
1265 '''Like app1 with two items.
1269 -----------------------------------
1270 ... [y ...] [Q] . infra first
1271 [x ...] [Q] infra first
1274 (quote, (x, (y, stack))) = S
1275 expression = (S_infra, (S_first,
1276 ((x, stack), (quote, (S_infra, (S_first,
1278 stack = (quote, ((y, stack), stack))
1279 return stack, expression, dictionary
1284 def app3(S, expression, dictionary):
1285 '''Like app1 with three items.
1288 ... z y x [Q] . app3
1289 -----------------------------------
1290 ... [z ...] [Q] . infra first
1291 [y ...] [Q] infra first
1292 [x ...] [Q] infra first
1295 (quote, (x, (y, (z, stack)))) = S
1296 expression = (S_infra, (S_first,
1297 ((y, stack), (quote, (S_infra, (S_first,
1298 ((x, stack), (quote, (S_infra, (S_first,
1299 expression))))))))))
1300 stack = (quote, ((z, stack), stack))
1301 return stack, expression, dictionary
1306 def step(S, expression, dictionary):
1308 Run a quoted program on each item in a sequence.
1312 -----------------------
1317 ------------------------
1321 ... [a b c] [Q] . step
1322 ----------------------------------------
1323 ... a . Q [b c] [Q] step
1325 The step combinator executes the quotation on each member of the list
1326 on top of the stack.
1328 (quote, (aggregate, stack)) = S
1330 return stack, expression, dictionary
1331 head, tail = aggregate
1332 stack = quote, (head, stack)
1334 expression = tail, (quote, (S_step, expression))
1335 expression = S_i, expression
1336 return stack, expression, dictionary
1341 def times(stack, expression, dictionary):
1343 times == [-- dip] cons [swap] infra [0 >] swap while pop
1347 --------------------- w/ n <= 0
1352 -----------------------
1357 ------------------------------------- w/ n > 1
1358 ... . Q (n - 1) [Q] times
1361 # times == [-- dip] cons [swap] infra [0 >] swap while pop
1362 (quote, (n, stack)) = stack
1364 return stack, expression, dictionary
1367 expression = n, (quote, (S_times, expression))
1368 expression = concat(quote, expression)
1369 return stack, expression, dictionary
1372 # The current definition above works like this:
1375 # --------------------------------------
1376 # [P] nullary [Q [P] nullary] loop
1378 # while == [pop i not] [popop] [dudipd] tailrec
1380 #def while_(S, expression, dictionary):
1381 # '''[if] [body] while'''
1382 # (body, (if_, stack)) = S
1383 # while joy(stack, if_, dictionary)[0][0]:
1384 # stack = joy(stack, body, dictionary)[0]
1385 # return stack, expression, dictionary
1390 def loop(stack, expression, dictionary):
1392 Basic loop combinator.
1396 -----------------------
1400 ------------------------
1405 quote, stack = stack
1407 raise StackUnderflowError('Not enough values on stack.')
1408 if not isinstance(quote, tuple):
1409 raise NotAListError('Loop body not a list.')
1411 (flag, stack) = stack
1413 raise StackUnderflowError('Not enough values on stack.')
1415 expression = concat(quote, (quote, (S_loop, expression)))
1416 return stack, expression, dictionary
1421 def cmp_(stack, expression, dictionary):
1423 cmp takes two values and three quoted programs on the stack and runs
1424 one of the three depending on the results of comparing the two values:
1428 ------------------------- a > b
1432 ------------------------- a = b
1436 ------------------------- a < b
1439 L, (E, (G, (b, (a, stack)))) = stack
1440 expression = concat(G if a > b else L if a < b else E, expression)
1441 return stack, expression, dictionary
1444 # FunctionWrapper(cleave),
1445 # FunctionWrapper(while_),
1450 #divmod_ = pm = __(n2, n1), __(n4, n3)
1452 BinaryBuiltinWrapper(operator.eq),
1453 BinaryBuiltinWrapper(operator.ge),
1454 BinaryBuiltinWrapper(operator.gt),
1455 BinaryBuiltinWrapper(operator.le),
1456 BinaryBuiltinWrapper(operator.lt),
1457 BinaryBuiltinWrapper(operator.ne),
1459 BinaryBuiltinWrapper(operator.xor),
1460 BinaryBuiltinWrapper(operator.lshift),
1461 BinaryBuiltinWrapper(operator.rshift),
1463 BinaryBuiltinWrapper(operator.and_),
1464 BinaryBuiltinWrapper(operator.or_),
1466 BinaryBuiltinWrapper(operator.add),
1467 BinaryBuiltinWrapper(operator.floordiv),
1468 BinaryBuiltinWrapper(operator.mod),
1469 BinaryBuiltinWrapper(operator.mul),
1470 BinaryBuiltinWrapper(operator.pow),
1471 BinaryBuiltinWrapper(operator.sub),
1472 ## BinaryBuiltinWrapper(operator.truediv),
1474 UnaryBuiltinWrapper(bool),
1475 UnaryBuiltinWrapper(operator.not_),
1477 UnaryBuiltinWrapper(abs),
1478 UnaryBuiltinWrapper(operator.neg),
1479 UnaryBuiltinWrapper(sqrt),
1481 UnaryBuiltinWrapper(floor),
1482 UnaryBuiltinWrapper(round),
1485 del F # Otherwise Sphinx autodoc will pick it up.
1488 for name, primitive in getmembers(genlib, isfunction):
1489 inscribe(SimpleFunctionWrapper(primitive))
1492 add_aliases(_dictionary, ALIASES)
1495 DefinitionWrapper.add_definitions(definitions, _dictionary)