Stephen directed me to this mailing list post from a while back about
Redex term rendering since I was having the same issue.
On 2012-04-18 18:33:56 -0400, Stephen Chang wrote:
> Something like:
>
> (define-metafunction L
> [(x->pict x) ,(lw->pict (language-nts L) (to-lw x))])
>
> still gives a
Jay,
Ha! I was just about to write you guys back about this. I think I found the
problem(s).
1) Too many database connections.
I had the max_connections on the postgres pool set to like 60 or something.
The Racket
server would happily accept a bunch of connections, blow up the database wit
I'm playing around with submodules with a small toy program:
https://gist.github.com/2417377
Submodules are neat! In particular, it includes several submodules
for different roles.
1. We can require this as a regular library. Under this, it just
exposes 'solve'.
2. When run directly
Hi: I had a quick look at the code that signals this error and it
isn't clear how it got there.
Can you put your file somewhere so we can have a look at it and try to
extract at least the text bits from it?
Thanks,
Robby
On Sun, Apr 15, 2012 at 4:00 PM, Prachi Khadke wrote:
> Hi
>
> I am using
Pedro wrote at 04/18/2012 02:54 PM:
So to put it in a simple way, I need to tokenize all my data and
create an index which I load into memory...?
That's a simple way that might do everything you want.
If you do this, and then find you want it to work better, then I suggest
hitting an IR t
On Wed, Apr 18, 2012 at 2:54 PM, Pedro wrote:
> So to put it in a simple way, I need to tokenize all my data and
> create an index which I load into memory...?
> Is this how it is usually done? For example, does my browser (firefox)
> keep an index of all the words present in urls and page titles
This is very counter-intuitive to me:
#lang racket
(require plot)
(plot (list (axes)
(function (λ(x) (* x x)) #:samples 4 -2 0) ; 2 samples?!
(function (λ(x) (* x x)) #:samples 8 0 2))) ; 4 samples?!
It is really surprising to suppose that the number of samples isn't
spec
I'm surprised you don't get any difference with the new version.
This is very surprising for me. Here are results from my tiny Macbook Air:
% ab -c 20 -n 1 http://localhost:8000/
This is ApacheBench, Version 2.3 <$Revision: 655654 $>
Copyright 1996 Adam Twiss, Zeus Technology Ltd, http://www.
>
> I think the subfield you're looking for is called "information retrieval",
> and there are textbooks on it.
Managing Gigabytes, for example:
http://ww2.cs.mu.oz.au/mg/
Racket Users list:
http://lists.racket-lang.org/users
With the new Script Plugin on PLaneT, it has been quite easy to do
something along these lines:
http://planet.plt-scheme.org/package-source/orseau/script-plugin.plt/2/0/examples/indent-let.rkt
I use a double-space instead of a tab separator (mostly by laziness to look
for how to make the tab key a
Hi all,
The Script Plugin for DrRacket may help to create simple plugins, like
automatic text (or snip%s) insertion, text selection replacement (and much
more), without needing to restart DrRacket :
http://planet.plt-scheme.org/display.ss?package=script-plugin.plt&owner=orseau
Docs:
http://planet.
Oops: I had scaled it to 1000 (also runs in under .1 seconds). Here is
the right code:
(define (euler29d)
(- (sqr 399)
(for/sum ([base '(2 3 5 6 7 10 11 12 13 14 15 17 18 19 20)])
(define lst
(for*/list ([exp (stop-before (in-naturals 1) (λ (exp) (>
(expt bas
Thanks for more food for thought.
Cristian, I really like the form of your solution with the answer being
produced at the bottom. You also taught me about stop-before and
stop-after. Very nice.
Maxim, Thanks for bringing up for*/set. Your solution is elegant, but
unfortunately is relatively sl
On Wed, Apr 18, 2012 at 10:21 AM, Neil Van Dyke wrote:
> Pedro wrote at 04/17/2012 04:21 PM:
>
>> My first question is: which kind of kind of data structure should I
>> use in order to perform such a quick search? I'm guessing I should
>> split my notes' data into words and store each single word
About two weeks ago, David T. Pierson wrote:
>
> Yes, thanks. And now that I see that, I think I've used it before.
> But I couldn't find it last night. My first inclination was to look
> at the Community page: [...]
Since several people thought that that's where they'll find the link,
I've add
Pedro wrote at 04/17/2012 04:21 PM:
My first question is: which kind of kind of data structure should I
use in order to perform such a quick search? I'm guessing I should
split my notes' data into words and store each single word in some
kind of tree. But should I just jam every single word in th
On 04/18/2012 07:05 AM, Rüdiger Asche wrote:
I'm doodling around with vyzo's crypto lib from PLaneT, doing some very
rudimentary crypting and encrypting. I'm undoubtedly doing something
wrong, I just don't know what...
Here's my code (running from a directory that contains the crypto files):
(r
ok, I figured out the raised exception part... turns out the OpenSSL
interface is a little bit too rigurous with respect to lib failure
returns; they are all translated to raised errors. Can easily be
eliminated by modifying check_error() in error.ss. But about the other
question... very l
Hey all
I'm a sucker for note taking applications. I can't get enough of
applications like zim or tomboy notes.
Both have served me well but, after many years using them, I can't get
over some features they're missing that I find important. I decided I
would hack my own note taking application. Wh
I'm doodling around with vyzo's crypto lib from PLaneT, doing some
very rudimentary crypting and encrypting. I'm undoubtedly doing
something wrong, I just don't know what...
Here's my code (running from a directory that contains the crypto files):
(require srfi/78
"main.ss"
What about for*/set ?
#lang racket
(require racket/set)
(define (generate-powers lower upper)
(for*/set ([a (in-range lower (add1 upper))]
[b (in-range lower (add1 upper))])
(expt a b)))
(set-count (generate-powers 2 5))
(set-count (generate-powers 2 100))
Best regards
On Wed, Apr 18, 2012 at 12:39, Roelof Wobben wrote:
> Op 18-4-2012 12:32, Pierpaolo Bernardi schreef:
>
>> On Wed, Apr 18, 2012 at 11:17, Roelof Wobben wrote:
>>>
>>> Hello,
>>>
>>> I try to make a function which controls the key-events.
>>>
>>> The function does only have to react on backspace ,
On Apr 18, 2012, at 5:17 AM, Roelof Wobben wrote:
> The function does only have to react on backspace , left , right .
> Give no reaction on tab , rubout or the other keys with a length more then 1.
> When given another key with length 1 it has to insert the key.
>
> So i thought this would work
On Wed, Apr 18, 2012 at 12:32, Pierpaolo Bernardi wrote:
> maybe:
>
> (define (edit e k)
> (cond ((key=? "right" k)
> (if (zero? (string-length (editor-post e)))
> e
> ))
> ((key=? "left" k)
> (if (zero? (string-length (editor-pre e)))
> e
>
Op 18-4-2012 12:32, Pierpaolo Bernardi schreef:
On Wed, Apr 18, 2012 at 11:17, Roelof Wobben wrote:
Hello,
I try to make a function which controls the key-events.
The function does only have to react on backspace , left , right .
Give no reaction on tab , rubout or the other keys with a lengt
On Wed, Apr 18, 2012 at 11:17, Roelof Wobben wrote:
> Hello,
>
> I try to make a function which controls the key-events.
>
> The function does only have to react on backspace , left , right .
> Give no reaction on tab , rubout or the other keys with a length more then
> 1.
> When given another key
Hello,
I try to make a function which controls the key-events.
The function does only have to react on backspace , left , right .
Give no reaction on tab , rubout or the other keys with a length more
then 1.
When given another key with length 1 it has to insert the key.
So i thought this woul
27 matches
Mail list logo
