Ah. You mean I need an info.rkt for the package, and _another_ one for
the frog collection? That seems obvious now that you say it, but I
hadn't realized that. So: info.rkt files are used both for packages
and collections.
Thank you.
My next dumb question: My frog.rkt has the command-line "main
I've run into this problem. What's most likely happening is mistyping
your password, which for whatever reason causes the bug tracker to
"log" you in, but as someone with _negative_ privileges. It's an
antisocial bug tracker.
Racket Users list:
http://lists.racket-lang.or
An interesting example might be an echo-style server, where the server
reads input and writes output forever. Here's what it can look like:
---
#lang racket/base
(provide start-server)
(require racket/tcp)
;; start-server: #:port nu
Here's a thought:
At Sat, 6 Apr 2013 10:21:53 -0400, Greg Hendershott wrote:
> I'm trying to add a raco command, following
> http://docs.racket-lang.org/raco/command.html
>
> My info.rkt is simply this:
>
> #lang setup/infotab
> (define deps (list "markdown" "rackjure"))
> (define ra
On 04.04.2013, at 17:09, Jay McCarthy wrote:
> On Thu, Apr 4, 2013 at 8:58 AM, Laurent wrote:
>> Some questions about Planet 2, using github, but not really used to it.
>
> I think these questions are about the Racket package system, since I
> don't know what "Planet 2" is, so I'll answer them
Thanks! What a great message!
Robby
On Mon, Apr 8, 2013 at 2:47 PM, Neil Toronto wrote:
> Moving this to the list because it seems general-interest-y.
>
>
> On 04/02/2013 11:08 AM, Robby Findler wrote:
>
>> Hi Neil; any advice on how to pick, at random, an natural number less
>> than 604707155
Moving this to the list because it seems general-interest-y.
On 04/02/2013 11:08 AM, Robby Findler wrote:
Hi Neil; any advice on how to pick, at random, an natural number less
than
6047071558442633408797999878063656490199914790037659740579688354375333108700179625697869824,
or other large intege
> Would it make sense to use memoization more broadly for the definition of
the factorial
> in the math lib, maybe with a `provide'd parameter to control how many
values can be
> memoized?
An interesting question. First of all it seems that especially binomial
can be improved. Second I think there
On Apr 8, 2013, at 3:11 PM, users-requ...@racket-lang.org wrote:
I would never recommend against using GMP for bignum code, but I use code like
this for factorial, based on the idea of binary splitting:
(define (iota m n)
(let loop ((result '())
(n (- n 1)))
(if (<= m n)
Hi Laurent,
I am curious to see how fast the libgmp versions of factorial
and binomial are on your computer. Om my computer libgmp
is much faster than the Racket one.
Since the libgmp versions converts a Racket bignum into
a mpz, there is some overhead, so a proper solution
would be to use
Thanks for the enhancements !
I will check them out soon (for now I'm sticking to stable releases).
I found that creating an info.rkt for the tool and setting it up via "raco
link" gives me reasonable workflow. After the initial "raco setup" I
deleted the "compiled" folder since that seems to cau
Andrey, you could write your own function like this:
(define (hashes-equal? h0 h1)
(for/and ([k (in-list (hash-keys h0))])
(and (hash-has-key? h1 k)
(equal? (hash-ref h0 k) (hash-ref h1 k)
This should work in general.
If you know that the two hashes use a specific comparison f
Would it make sense to use memoization more broadly for the definition of
the factorial in the math lib, maybe with a `provide'd parameter to control
how many values can be memoized?
https://github.com/plt/racket/blob/master/collects/math/private/number-theory/factorial.rkt
While building big numb
Philip wrote:
It should be noted that BYU's "Honor Code" applies only to students & staff. It
does *not* apply to visitors.
Does that mean there will be coffee at "coffee breaks"? --PR
Racket Users list:
http://lists.racket-lang.org/users
Right now i'm understand my mistake. Is there any function to perform
equality check between mutable and immutable hash-tables?
On Mon, Apr 8, 2013 at 7:06 PM, Asumu Takikawa wrote:
> is is actually not a bug. In your example, the TR code creates an
> immutable hash literal with `#hash`. The unt
Oh. Sorry. I was confused by ability to construct hash table many ways. And
problem with type inference for hash in typed racket.
Just rewrited my code and test passed.
sorry for inconvenience. I'm new to Racket :)
On Mon, Apr 8, 2013 at 7:04 PM, Tobias Hammer wrote:
> From the docs (3.13)
> "
On 2013-04-08 18:49:35 +0400, Andrey Larionov wrote:
>Is it a known bug what Typed Racket hash-table fail equality check
>with untyped variant? I'm attaching a source file with a test
>which prove it as on 5.3.3 and Today nightlies.
This is actually not a bug. In your example, the TR
L.S.,
Apologies for any duplicates you may receive.
EasyChair now open! [3]
Please find below the Third Call for Papers for the Second International
Workshop on Trends in Functional Programming In Education (TFPIE). As an
addendum to previous CfPs for this event, I would like you to consider t
From the docs (3.13)
"Two hash tables cannot be equal? unless they use the same key-comparison
procedure (equal?, eqv?, or eq?), both hold keys strongly or weakly, and
have the same mutability."
Your TR hash is immutable (created with #hash) and your racket hash is
mutable (created with ma
Is it a known bug what Typed Racket hash-table fail equality check with
untyped variant?
I'm attaching a source file with a test which prove it as on 5.3.3 and
Today nightlies.
hash-table-test.tar.gz
Description: GNU Zip compressed data
Racket Users list:
http://lists.rac
Thanks for fixing that, Jay. I went through the same confusion as Tony
when I submitted the "mischief" package. Nice to know it's clearer, now.
Carl Eastlund
On Sat, Apr 6, 2013 at 5:06 PM, Jay McCarthy wrote:
> K, I just changed it
>
> On Sat, Apr 6, 2013 at 3:03 PM, Robby Findler
> wrote:
Done.
On Mon, Apr 8, 2013 at 8:09 AM, Matthias Felleisen wrote:
>
> On Apr 8, 2013, at 7:51 AM, Jay McCarthy wrote:
>
>> "Package name" is a technical concept defined in the documentation
>> (section 1, the first bullet on the page). This name is used
>> throughout the system to refer to depende
On Apr 8, 2013, at 7:51 AM, Jay McCarthy wrote:
> "Package name" is a technical concept defined in the documentation
> (section 1, the first bullet on the page). This name is used
> throughout the system to refer to dependencies, install arguments,
> etc.
Perhaps the web page for submitting pa
every time i try to send data through lisner to connect
or from connect to listen i have to run the whole program again and again..
Racket Users list:
http://lists.racket-lang.org/users
how to get a sustained network using tcp
over which we can send data and receive it using ports...
Racket Users list:
http://lists.racket-lang.org/users
p.s.
My ~/Library/Racket/5.3.3.8/collects/info-domain/compiled/cache.rktd
is currently just this:
((#"/Users/greg/Library/Racket/5.3.3.8/pkgs/installed/ragg/ragg"
(name categories can-be-loaded-with required-core-version version
repositories scribblings blurb release-notes deps) (lib "ragg") 1
Thank you for following up.
> And, just to be sure, `raco setup frog' has no effect?
Correct, it has no effect. From subdir above frog:
$ raco setup frog
raco setup frog
raco setup: version: 5.3.3.8 [3m]
raco setup: variants: 3m
raco setup: main collects: /Users/greg/src/plt/racket/collects
raco
"Package name" is a technical concept defined in the documentation
(section 1, the first bullet on the page). This name is used
throughout the system to refer to dependencies, install arguments,
etc.
The package system only deals with its own terms and concepts, so it
explicitly ignores the first
error-print-width ?
Jos
> -Original Message-
> From: users-boun...@racket-lang.org
> [mailto:users-boun...@racket-lang.org] On Behalf Of Tom Schouten
> Sent: domingo, 07 de abril de 2013 16:29
> To: users@racket-lang.org
> Subject: [racket] full path in #
>
> Hello,
>
> Is there a way
29 matches
Mail list logo
