/dports/lang/racket/racket-8.3/src/expander/read/ |
H A D | number.rkt | 159 (struct lazy-expt (n radix exp) 179 [(or (lazy-expt? n) 180 (lazy-expt? d)) 189 (define n-n (if (lazy-expt? n) (lazy-expt-n n) n)) 190 (define n-exp (if (lazy-expt? n) (lazy-expt-exp n) 0)) 191 (define d-n (if (lazy-expt? d) (lazy-expt-n d) d)) 192 (define d-exp (if (lazy-expt? d) (lazy-expt-exp d) 0)) 193 (define radix (if (lazy-expt? n) (lazy-expt-radix n) (lazy-expt-radix d))) 202 [(lazy-expt? n) 203 (* (lazy-expt-n n) (expt (lazy-expt-radix n) (lazy-expt-exp n)))] [all …]
|
/dports/lang/racket-minimal/racket-8.3/src/expander/read/ |
H A D | number.rkt | 159 (struct lazy-expt (n radix exp) 179 [(or (lazy-expt? n) 180 (lazy-expt? d)) 189 (define n-n (if (lazy-expt? n) (lazy-expt-n n) n)) 190 (define n-exp (if (lazy-expt? n) (lazy-expt-exp n) 0)) 191 (define d-n (if (lazy-expt? d) (lazy-expt-n d) d)) 192 (define d-exp (if (lazy-expt? d) (lazy-expt-exp d) 0)) 193 (define radix (if (lazy-expt? n) (lazy-expt-radix n) (lazy-expt-radix d))) 202 [(lazy-expt? n) 203 (* (lazy-expt-n n) (expt (lazy-expt-radix n) (lazy-expt-exp n)))] [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/listvecops/ |
H A D | listvecops.red | 134 then for each j in cdr y collect reval1({'expt,x,j},v) 136 then for each j in cdr x collect reval1({'expt,j,y},v) 141 if null u then if v then rederr "Unequal length lists found in expt." 143 else if null v then rederr "Unequal length lists found in expt." 144 else reval1({'expt,car u,car v},w) . listexpt2(cdr u,cdr v,w); 146 put('expt,'rtypefn,'getrtypeor); 147 put('expt,'listfn,'listexpt); 259 % A lazy hack to allow for list procedures.
|
/dports/lang/chibi-scheme/chibi-scheme-0.10/lib/scheme/ |
H A D | small.sld | 3 (scheme eval) (scheme file) (scheme inexact) (scheme lazy) 20 exact exact-integer-sqrt exact-integer? exact? expt features 73 ;; lazy
|
H A D | r5rs.sld | 14 (scheme lazy) 37 eval even? exact->inexact exact? exp expt floor for-each force gcd if
|
H A D | red.sld | 20 (scheme lazy) 200 expt features
|
/dports/lang/owl-lisp/owl-079f58f45039805517b9b880feec050e151c52b3/owl/ |
H A D | sexp.scm | 26 (owl lazy) 124 (expt base pow)) 142 (expt base (length digits))))
|
H A D | random.scm | 64 (owl lazy) 425 '(let loop ((rs (seed->rands (expt (time-ms) (+ 1 (band (time-ms) 7))))))
|
/dports/lang/gauche/Gauche-0.9.10/lib/ |
H A D | r7rs-setup.scm | 227 exact-integer? expt file-error? floor-quotient floor/ for-each 458 (define-syntax delay-force (with-module gauche lazy)) 496 (if (fixnum? (expt 2 32)) #e1e9 #e1e4)) 511 (if (fixnum? (expt 2 32)) 541 exact? exp expt floor for-each force gcd if imag-part inexact->exact
|
/dports/lang/chibi-scheme/chibi-scheme-0.10/lib/srfi/166/ |
H A D | test.sld | 179 (show #f (numeric (expt 2.0 80) 2))) 316 (test "abc" (show #f (trimmed/lazy 3 "abcde"))) 317 (test "abc" (show #f (trimmed/lazy 3 "abc\nde"))) 322 (test "prefix: abc" (show #f "prefix: " (trimmed/lazy 3 "abcde"))) 323 (test "prefix: abc" (show #f "prefix: " (trimmed/lazy 3 "abc\nde"))) 328 (test "abc :suffix" (show #f (trimmed/lazy 3 "abcde") " :suffix")) 331 (test "abc" (show #f (trimmed/lazy 10 (trimmed/lazy 3 "abcdefghijklmnopqrstuvwxyz")))) 332 (test "abc" (show #f (trimmed/lazy 3 (trimmed/lazy 10 "abcdefghijklmnopqrstuvwxyz")))) 465 (show #f (trimmed/lazy 471 (show #f (trimmed/lazy [all …]
|
/dports/lang/gauche/Gauche-0.9.10/test/include/ |
H A D | r7rs-tests.scm | 3 (import (scheme base) (scheme char) (scheme lazy) 233 (test (expt 2 140) (square root))) 694 (let ((a (- (expt 2 1000) 1)) 696 (c (+ (expt 2 1000) 1))) 875 (test 27 (expt 3 3)) 876 (test 1 (expt 0 0)) 877 (test 0 (expt 0 1)) 878 (test 1.0 (expt 0.0 0)) 879 (test 0.0 (expt 0 1.0)) 1567 (vector-map (lambda (n) (expt n n)) [all …]
|
/dports/lang/sagittarius-scheme/sagittarius-0.9.8/test/r7rs-tests/ |
H A D | r7rs-tests.scm | 3 (import (scheme base) (scheme char) (scheme lazy) 233 (test (expt 2 140) (square root))) 730 (let ((a (- (expt 2 1000) 1)) 732 (c (+ (expt 2 1000) 1))) 911 (test 27 (expt 3 3)) 912 (test 1 (expt 0 0)) 913 (test 0 (expt 0 1)) 914 (test 1.0 (expt 0.0 0)) 915 (test 0.0 (expt 0 1.0)) 1574 (vector-map (lambda (n) (expt n n)) [all …]
|
/dports/lang/chibi-scheme/chibi-scheme-0.10/tests/ |
H A D | r7rs-tests.scm | 3 (import (scheme base) (scheme char) (scheme lazy) 233 (test (expt 2 140) (square root))) 811 (let ((a (- (expt 2 1000) 1)) 813 (c (+ (expt 2 1000) 1))) 1001 (test 27 (expt 3 3)) 1002 (test 1 (expt 0 0)) 1003 (test 0 (expt 0 1)) 1004 (test 1.0 (expt 0.0 0)) 1005 (test 0.0 (expt 0 1.0)) 1676 (vector-map (lambda (n) (expt n n)) [all …]
|
/dports/lang/racket/racket-8.3/share/pkgs/math-doc/math/scribblings/ |
H A D | math-array.scrbl | 487 following example, which computes @racket[(+ (expt x x) (expt x x))] for @racket[x] from @racket[0] 490 @racketblock[(define xrr (array-map expt 496 (array-map expt 519 ``dynamic programming,'' you can make them lazy using @racket[array-lazy]. 1672 (array-axis-expand (list->array '(1 2 3 4)) 1 5 expt)] 1961 See @racket[array-lazy] for an example of the last circumstance. 1964 @defproc[(array-lazy [arr (Array A)]) (Array A)]{ 1974 (array-lazy 2006 (define (array-maybe-lazy arr) 2007 (if (array-strict? arr) arr (array-lazy arr))) [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/cgb/ |
H A D | smartev.red | 39 % degree in a lazy manner. 165 {'expt,car v,car u} . ev_2a1(cdr u,cdr v);
|
/dports/math/reduce/Reduce-svn5758-src/packages/factor/ |
H A D | unihens.red | 75 w:=expt(lc poly,number!-of!-factors -1); 709 w:=lazy!-adjoin(cadr w,caddr w,cadr cddr w) 751 % in sofar as we go. We use lazy evaluation in that this results in 753 % ( '!*lazy . (argument for eval) ) 761 l := lazy!-adjoin(cadr l,caddr l,cadr cddr l) 770 symbolic procedure lazy!-adjoin(item,l,tail); 771 % Dots item with each element in l using lazy evaluation on l. 775 l:=lazy!-adjoin(cadr l,caddr l,cadr cddr l) 892 lcfac:=modular!-expt(lc cdar flist,sub1 length flist) 977 modular!-expt(b!-inv,number!-of!-factors #- 1),fhat)
|
/dports/lang/racket/racket-8.3/share/pkgs/pict-lib/pict/ |
H A D | shadow.rkt | 72 (define MAX-RADIUS (expt 2 10)) 73 (define MAX-WEIGHT (expt 2 5)) 203 ;; used for benchmarking to force effectively lazy dc pict constructor
|
/dports/lang/sbcl/sbcl-1.3.13/doc/manual/ |
H A D | beyond-ansi.texinfo | 491 @code{length} when working with lazy or infinite sequences. 995 (float (/ (random (expt 2 23)) (expt 2 23)) 1.0f0)) 1000 occurring with probability @code{(expt 2 -23)} respectively 1001 @code{(expt 2 -52)}. Also note that there exist twice as many 1004 @code{(float (/ (1- (expt 2 23)) (expt 2 23)) 1.0f0)} while 1005 @code{(float (/ (1- (expt 2 24)) (expt 2 24)) 1.0f0)} is the
|
/dports/lang/gauche/Gauche-0.9.10/doc/ |
H A D | modr7rs.texi | 675 * R7RS lazy evaluation:: @code{scheme.lazy} 1548 [R7RS lazy] 1561 [R7RS lazy] 10399 @code{(expt e (/ pi 4))}. 10535 @code{(expt 2 1/3)}. 10541 @code{(expt 3 1/3)}. 10547 @code{(expt 2 1/4)}. 11238 Returns @code{(expt fl-e x)}. 11241 @code{(expt fl-e x)}を返します。 11249 Returns @code{(expt 2 x)} [all …]
|
H A D | corelib.texi | 2221 (class-of (expt 2 100)) @result{} #<class <integer>> 3298 @defun expt z1 z2 3311 Scheme標準では便宜上@code{(expt 0 0)}は1と定めています。 3315 @defun expt-mod base exponent mod 3322 @code{(modulo (expt base exponent) mod)} を効率よく計算します。 3329 (- (expt-mod 2 74207281 #e1e10) 1) 3434 @var{x} = (* @var{sign} @var{m} (expt 2.0 @var{e})) 3447 @var{x} = (* @var{sign} @var{m} (expt 2.0 @var{e})) 3462 (* 7074237631354954 (expt 2.0 -51)) 4099 @code{(expt 2 k)}が@var{n}の約数であるような最大の@var{k}を返します。 [all …]
|
/dports/math/cln/cln-1.3.6/doc/ |
H A D | cln.info | 619 (No "lazy recomputation".) 887 'cl_RA expt (const cl_RA& x, const cl_I& y)' 888 'cl_R expt (const cl_R& x, const cl_I& y)' 889 'cl_N expt (const cl_N& x, const cl_I& y)' 1198 '(expt(*root,2) == x)'. 1277 'cl_N expt (const cl_N& x, const cl_N& y)' 1619 to 'x * expt(2,n)'. 1624 expt(2,n))'. 1629 expt(2,y))'. 2386 'cl_MI expt (const cl_MI& x, const cl_I& y)' [all …]
|
H A D | cln.texi | 774 has a fixed precision. (No ``lazy recomputation''.) 1084 @cindex @code{expt ()} 1085 @itemx cl_R expt (const cl_R& x, const cl_I& y) 1502 the boolean value @code{(expt(*root,2) == x)}. 1592 @item cl_N expt (const cl_N& x, const cl_N& y) 1593 @cindex @code{expt ()} 2121 Equivalent to @code{x * expt(2,n)}. 2127 Equivalent to @code{floor(x / expt(2,n))}. 2133 returns @code{floor(x * expt(2,y))}. 3053 @cindex @code{expt ()} [all …]
|
/dports/math/reduce/Reduce-svn5758-src/csl/generated-c/ |
H A D | profile.dat | 2131 (lazy!-adjoin 18292946902051142636 68 11091) 4038 (!:expt 1906246832538517278 124 83372) 4502 (!:expt 1906246832538517278 124 2316) 12290 (!:expt 1906246832538517278 124 334717) 17079 (!:expt 1906246832538517278 124 379916) 17826 (!:expt 1906246832538517278 124 370816) 24568 (!:expt 1906246832538517278 124 11433) 24961 (!:expt 1906246832538517278 124 2664) 25921 (!:expt 1906246832538517278 124 996879) 27018 (!:expt 1906246832538517278 124 29213) [all …]
|
/dports/lang/sagittarius-scheme/sagittarius-0.9.8/doc/ |
H A D | r7rs.scrbl | 75 exact exact-integer-sqrt exact? expt 610 @define[Library]{@name{(scheme lazy)}} 612 keywords for lazy evaluation. 817 @define[Library]{@name{(scheme lazy-seq)}}
|
/dports/lang/guile2/guile-2.2.7/module/ice-9/ |
H A D | ChangeLog-2008 | 47 Implemented lazy duplicate binding handling. Fixed the 276 instead of lazy-catch. 279 instead of lazy-catch. 505 * boot-9.scm (expt): Only call integer-expt for an exact integer 506 exponent, not for an inexact integer one. Also, let integer-expt 633 lazy-handler-dispatch lookup. 673 lazy-handler-dispatch. 1225 * boot-9.scm (expt): switch if sense and use negative? rather than 1835 `pre-modules-obarray'. Do not use a lazy binder. 2434 * boot-9.scm (expt): In case of negative integer exponents return [all …]
|