Thanks a lot.
Am 03.10.2017 9:05 nachm. schrieb "Matthew Butterick" <m...@mbtype.com>:
>
> > On Oct 3, 2017, at 10:31 AM, 'Shakin Billy' via Racket Users <
> racket-users@googlegroups.com> wrote:
> >
> > how do i access the pattern variable
hello,
how do i access the pattern variable var at compile time (phase 1?)
additional to an answer, could you point me to the right part of the
documentation? i really couldn't find it.
#lang racket
(define inp (open-input-string "12+34"))
(define-syntax (terminal stx)
(syntax-case stx ()
i couldn't make the inlining via define-syntax-rule work in typed racket. in
normal racket define-inline did'nt speed things up much but changing the code
of "acht-teiler" to:
CODE--
(define-syntax-rule (acht-teiler n)
(let loop ((i 2) (count 0) (quadrat 4) (steigung 5))
(cond ((= quadrat
@ matthias
i'm aware that java got more manpower, but since this is the first time i
compare racket and java in terms of speed i didn't know what to expect. I know
there are many loop optimizations but it doesn't seem to me many of them apply
here since it's just two nested loops without array
thx for the answers so far!
(multithreading)
the java version was intended to use mutlithreading, but i commented it out, so
it's singe-thread vs single-thread.
(compilation)
i'm not sure this will speed things up since i don't measure the time using cli
tools but built-in tools which run
thx for the answers so far!
multithreading:
Am Samstag, 1. Juli 2017 15:07:37 UTC+2 schrieb Shakin Billy:
> hi,
>
> i've been working a little on project euler problem 501.
> my first attempt is a burte forcce loop.4iw rote it in java und racket and
> found java to be faster by factor 3:
>
>
hi,
i've been working a little on project euler problem 501.
my first attempt is a burte forcce loop.4iw rote it in java und racket and
found java to be faster by factor 3:
racket
#lang typed/racket
(require racket/unsafe/ops)
(require racket/fixnum)
(require racket/trace)
;(require
7 matches
Mail list logo
