On Nov 17, 2012, at 8:01 PM, Jon Zeppieri wrote:
> On Sat, Nov 17, 2012 at 10:56 PM, Robby Findler
> wrote:
>>
>>
>> I also didn't improve the contour window much. I've looked into
>> it some, but I think I need a different strategy for it's
>> implementation. I hope to get to that before the
On Sat, Nov 17, 2012 at 10:48 PM, John Clements
wrote:
>
> On Nov 16, 2012, at 10:05 PM, Monica Tomson wrote:
>
> > Hi,
> >
> > I have an experiment for my project, basically, I need to embedded some
> s-expression into the code and make it run, like this,
> >
> > (define (test lst)
> >
> >
> > (d
On Nov 16, 2012, at 10:05 PM, Monica Tomson wrote:
> Hi,
>
> I have an experiment for my project, basically, I need to embedded some
> s-expression into the code and make it run, like this,
>
> (define (test lst)
>
>
> (define num 1)
>
>
> (define l (list))
>
>
> `@lst) ; oh,
I think I am going to take that route, thanks for the tip.
On Sat, Nov 17, 2012 at 6:36 AM, Matthias Felleisen wrote:
>
> You could just call lst with num as a parameter. Or you might be looking
> for define-syntax not define. Is that possible?
>
>
> On Nov 17, 2012, at 1:05 AM, Monica Tomson wro
On Sat, Nov 17, 2012 at 10:01 PM, Jon Zeppieri wrote:
> On Sat, Nov 17, 2012 at 10:56 PM, Robby Findler
> wrote:
>>
>>
>> I also didn't improve the contour window much. I've looked into
>> it some, but I think I need a different strategy for it's
>> implementation. I hope to get to that before th
On Sat, Nov 17, 2012 at 10:56 PM, Robby Findler
wrote:
>
>
> I also didn't improve the contour window much. I've looked into
> it some, but I think I need a different strategy for it's
> implementation. I hope to get to that before the next release goes
> out, but if you want high interactivity in
On Sat, Nov 17, 2012 at 9:47 PM, Jon Zeppieri wrote:
> On Sat, Nov 17, 2012 at 10:28 PM, Robby Findler
> wrote:
>>
>> It sounds like there is a leak somewhere. Does it happen if you are
>> just editing, and not running your program?
>>
>
> I've been doing both, so I can't really say. As I mention
On Sat, Nov 17, 2012 at 10:28 PM, Robby Findler
wrote:
>
> It sounds like there is a leak somewhere. Does it happen if you are
> just editing, and not running your program?
>
I've been doing both, so I can't really say. As I mentioned, though, I
had plenty of free memory when this was happening.
Some of the changes are, but I'm not sure exactly when the version
number bump happened wrt to the changes I've committed.
I don't think I fixed anything having those symptoms, tho.
It sounds like there is a leak somewhere. Does it happen if you are
just editing, and not running your program?
Ro
Since I installed 5.3.1 -- I'm currently on 5.3.1.5 -- DrRacket gets
slower with use. It's snappy enough when first started, but after a
while, it gets sluggish. Switching tabs (and I have only three open)
takes two to three seconds, and scrolling pauses frequently. The
garbage collector seems to b
Following up my earlier post with more detail -- pardon the length, but I want
to be sure of giving enough info to allow a useful answer:
I'm using Racket 5.3.1 on OS X and a fresh copy of the handin-server
collection, recently downloaded from the Racket git repo (and configured with
"raco setu
If I understand, that result is the ratio of the change in the thread's
process time to the change in real time. For example, if a thread's
process time grows by 500 milliseconds over one second, then that's
50% CPU usage.
At Sat, 17 Nov 2012 20:07:22 +0900, 주대연 wrote:
> Thanks for Matthew.
>
> I
Yes. More automated is always better, for saving effort and reducing
redundant annotations.
I see this in three ways:
* A stop-gap solution
* A last resort for types that can't be converted without importing Coq
* A way to squeeze better performance out of the typed/untyped boundary
whe
2012/11/17 Neil Toronto :
> The best place to use this is in "math/number-theory.rkt"... which I see is
> already using it for factorial and friends. You're all set.
Worked like a charm.
Thanks,
Jens Axel
Racket Users list:
http://lists.racket-lang.org/users
Wouldn't it be better to use the dependent contract (when that works)?
As an import to TR it definitely seems better, since it wouldn't be
checking the right thing otherwise. (As an export from TR, I guess it
doesn't matter.)
Robby
On Sat, Nov 17, 2012 at 2:18 PM, Neil Toronto wrote:
> On 11/17/
2012/11/17 Eric Dobson :
> I don't have a lot of
> time for TR hacking currently, but if a bug is filed I may get to it at some
> point.
I have filed a bug report.
/Jens Axel
Racket Users list:
http://lists.racket-lang.org/users
On 11/17/2012 12:18 PM, Jens Axel Søgaard wrote:
I have the following contract on next-prime :
(: next-prime : (case-> (N -> N) (Z -> Z)) )
It says that for all primes p, positive or negative, (next-prime p)
will be an integer.
Furthermore if p is a natural number, then (next-prime p) will
I've seen the first-order case come up a number of times, but not the
higher-order one, so it may be best to be conservative and start there
to see how it goes.
Robby
On Sat, Nov 17, 2012 at 2:09 PM, Eric Dobson wrote:
> Its even simpler than that because the cases in case-> are ordered. There
>
Its even simpler than that because the cases in case-> are ordered. There
are some intricacies when the first order checks of non flat contracts
overlap, but with non overlapping first order checks for higher order
contracts or only flat contracts it should be doable. I don't have a lot of
time fo
This has come up enough times that maybe TR should convert contracts
of the form:
(case-> (-> ...) (-> ...))
into a dependent contract that checks the two 'flat' things? (I guess
you'd have to have an ordering on types in case they overlap, but I
presume you have this already.)
On Sat, Nov 1
I have the following contract on next-prime :
(: next-prime : (case-> (N -> N) (Z -> Z)) )
It says that for all primes p, positive or negative, (next-prime p)
will be an integer.
Furthermore if p is a natural number, then (next-prime p) will also be
a natural number.
This type can't be conve
You could just call lst with num as a parameter. Or you might be looking for
define-syntax not define. Is that possible?
On Nov 17, 2012, at 1:05 AM, Monica Tomson wrote:
> Hi,
>
> I have an experiment for my project, basically, I need to embedded some
> s-expression into the code and make
Does this help:
> #lang racket
>
> (define-namespace-anchor top)
>
> (parameterize ((current-namespace (namespace-anchor->namespace top)))
> (eval '(define x 10))
> (namespace-variable-value 'x))
eval takes a namespace and you need to supply it explicitly (as an argument) or
implicitly
I am not familiar with your subject matter, or your point. Without a set of
inputs and outputs, I cannot discern if I succeeded.
#lang racket
(define (make-f n-bits k1 k2)
(define limit (expt 2 n-bits))
(define m (- limit k1))
(define a (- limit k2))
(lambda (i x) (modulo (* a x) m)))
(
Well, if by "examples" you mean valid values for X, any 32-bit number other
than 0 will work.
From: Richard Cleis
To: Hugh Aguilar
Cc: "users@racket-lang.org"
Sent: Saturday, November 17, 2012 4:59 AM
Subject: Re: [racket] LC53
Only excessively brave Rac
Only excessively brave Racketeers would attempt that without a good set of
examples. :-)
rac
On Nov 17, 2012, at 4:46 AM, Hugh Aguilar wrote:
> All of this talk about using Racket for numerical work reminds me of a simple
> function that I included in my novice package:
> http://www.forth.org/
All of this talk about using Racket for numerical work reminds me of a simple
function that I included in my novice package:
http://www.forth.org/novice.html
This is the LC53 linear-congruential prng (pseudo-random number generator) that
I invented. Here it is using infix pseudo-code:
m = 2^32 -
Thanks for Matthew.
I have one more question.
I want to obtain cpu usage rate you can see it in TaskManager in windows.
TaskManager shows us a cpu usage per thread.
I looked the reference manuals in Web Site but I didn't find it.
So How can I obtain that rate value per thread?
Thanks for your r
28 matches
Mail list logo
