On Thursday, January 28, 2016 at 11:36:50 PM UTC-6, Brandon Thomas wrote:
> On Thu, 2016-01-28 at 20:32 -0800, Scotty C wrote:
> > > I think you understand perfectly.
> > i'm coming around
> >
> > > You said the keys are 128-bit (16 byte) values. You can store one
> > > key
> > > directly in a by
> Way back in this thread you implied that you had extremely large FILES
> containing FIXED SIZE RECORDS, from which you needed
> to FILTER DUPLICATE records based on the value of a FIXED SIZE KEY
> field.
this is mostly correct. the data is state and state associated data on the
fringe. hence th
On Thu, 2016-01-28 at 20:32 -0800, Scotty C wrote:
> > I think you understand perfectly.
> i'm coming around
>
> > You said the keys are 128-bit (16 byte) values. You can store one
> > key
> > directly in a byte string of length 16.
> yup
>
> > So instead of using a vector of pointers to individ
> I think you understand perfectly.
i'm coming around
> You said the keys are 128-bit (16 byte) values. You can store one key
> directly in a byte string of length 16.
yup
> So instead of using a vector of pointers to individual byte strings,
> you would allocate a single byte string of length
Also perhaps worth noting: make-peeking-input-stream.
Robby
On Thursday, January 28, 2016, Jay McCarthy wrote:
> I suggest using peek-char
>
> Jay
>
> On Thu, Jan 28, 2016 at 6:06 PM, jon stenerson > wrote:
> > Some languages have stream libraries with a function to put stuff back
> into
> > a
> On Jan 28, 2016, at 7:08 PM, Jack Firth wrote:
>
> Out of idle curiosity: why `(define (topological-sort ...) (local ((define
> (topological-sort ... done)) (topological-sort ... '())` rather than using a
> local define and a different name like `topological-sort/accumulator`?
That would b
Out of idle curiosity: why `(define (topological-sort ...) (local ((define
(topological-sort ... done)) (topological-sort ... '())` rather than using a
local define and a different name like `topological-sort/accumulator`?
--
You received this message because you are subscribed to the Google Gr
On Thu, 28 Jan 2016 11:49:09 -0800 (PST), Scotty C
wrote:
>what's been bothering me was trying to get the data into 16 bytes in
>a byte string of that length. i couldn't get that to work so gave up and
>just shoved the data into 25 bytes. here's a bit of code. i think it's
>faster than my bignum
I suggest using peek-char
Jay
On Thu, Jan 28, 2016 at 6:06 PM, jon stenerson wrote:
> Some languages have stream libraries with a function to put stuff back into
> an input stream, like Common Lisp's unread-char, or C++ istream::putback. Is
> there anything like that in Racket?
>
> --
> You rece
On Thu, 28 Jan 2016 07:56:05 -0800 (PST), Scotty C
wrote:
>you knew this was coming, right? put this into your data structure of choice:
>
>16 5 1 12 6 24 17 9 2 22 4 10 13 18 19 20 0 23 7 21 15 11 8 3 14
>
>this is a particular 5x5 tile puzzle
>(#6 in www.aaai.org/Papers/AAAI/1996/AAAI96-178.pd
On Thu, 28 Jan 2016 07:56:05 -0800 (PST), Scotty C
wrote:
>> You claim you want filtering to be as fast as possible. If that were
>> so, you would not pack multiple keys (or features thereof) into a
>> bignum but rather would store the keys individually.
>
>chasing pointers? no, you're thinking
Some languages have stream libraries with a function to put stuff back
into an input stream, like Common Lisp's unread-char, or C++
istream::putback. Is there anything like that in Racket?
--
You received this message because you are subscribed to the Google Groups "Racket
Users" group.
To uns
On Thu, Jan 28, 2016 at 5:33 PM, Brian Adkins wrote:
> configure Emacs (like I already have) to display λ instead of lambda
I really like using the agda input mode in Emacs.
http://wiki.portal.chalmers.se/agda/pmwiki.php?n=Docs.UnicodeInput
--
You received this message because you are subscri
On Thu, 28 Jan 2016 16:30:57 -0600,
Brian Adkins wrote:
>
> I'm sure this is a really bad idea, but I couldn't resist after finding
> section 3.3.8 in the Dr. Racket documentation - what fun :)
>
> (define (∃ member list)
> (cond [ (∅? list) ∅ ]
> [ (≡ member (α list)) list ]
>
That seems to work, thank you.
~Leif Andersen
On Thu, Jan 28, 2016 at 4:05 PM, Ryan Culpepper wrote:
> The openssl library uses scheme_register_process_global to make sure it
> initializes the openssl foreign library only once. See the end of
> openssl/mzssl.rkt.
>
> Ryan
>
>
>
> On 01/28/2016
On Thursday, January 28, 2016 at 5:30:57 PM UTC-5, Brian Adkins wrote:
> I'm sure this is a really bad idea, but I couldn't resist after finding
> section 3.3.8 in the Dr. Racket documentation - what fun :)
>
> (define (∃ member list)
> (cond [ (∅? list) ∅ ]
> [ (≡ member (α list)) list
I'm sure this is a really bad idea, but I couldn't resist after finding section
3.3.8 in the Dr. Racket documentation - what fun :)
(define (∃ member list)
(cond [ (∅? list) ∅ ]
[ (≡ member (α list)) list ]
[ else (∃ member (ω list)) ]))
(∃ 8 '(3 9 8 5))
Using "alpha" for "car
2016-01-28 21:48 GMT+01:00 jmhuffle :
>Dear Racket friends,
>
>I am surprised because the following code works in "lang racket", but
> not in R6RS: in this last case, I got a contract violation for the value
> associated with "alignment within the horizontal panel. Is there a way to
> incl
If you're going to use Racket's GUI and class systems, there's no reason
to use R6RS. Why not just use #lang racket? Everything will work better.
Also, you probably want to use `racket/contract`, `racket/class`, and
`racket/gui/base` instead of the `scheme` equivalents.
Vincent
On Thu, 28 Jan
On 2016-01-28 15:19:12 -0500, Asumu Takikawa wrote:
> Welcome to Racket v6.4.0.4.
> -> (require redex)
> -> (define-language lc
> (e (e e)
> x
> (λ (x) e))
> (x variable-not-otherwise-mentioned)
> #:binding-forms
> (λ (x_param) e_bod
The openssl library uses scheme_register_process_global to make sure it
initializes the openssl foreign library only once. See the end of
openssl/mzssl.rkt.
Ryan
On 01/28/2016 02:33 PM, Leif Andersen wrote:
Since a lot of people were at POPL last week, I think it's worth
pinging this list ag
Dear Racket friends,
I am surprised because the following code works in "lang racket", but not in
R6RS: in this last case, I got a contract violation for the value associated
with "alignment within the horizontal panel. Is there a way to include such a
horizontal panel in a program using
On 2015-11-06 13:11:24 -0500, 'William J. Bowman' via users-redirect wrote:
> I was under the impression that redex-match now matches up to
> alpha-equivalence. If so, then I would expect the result of this example from
> the docs to return #t, but it returns #f:
>
> ```
> Furthermore, the notion
what's been bothering me was trying to get the data into 16 bytes in a byte
string of that length. i couldn't get that to work so gave up and just shoved
the data into 25 bytes. here's a bit of code. i think it's faster than my
bignum stuff.
(define p (bytes 16 5 1 12 6 24 17 9 2 22 4 10 13 18
Since a lot of people were at POPL last week, I think it's worth
pinging this list again.
Does anyone have a solution to the problem stated in the previous email?
Namely, is there a way to either create a top-level variable that
persists until the VM dies, get a list of all dynamically linked
lib
> On Jan 27, 2016, at 6:02 PM, Lehi Toskin wrote:
>
> On Wednesday, January 27, 2016 at 11:41:06 AM UTC-8, Jordan Johnson wrote:
>> Hi all,
>>
>>
>> I'm looking at audio again because I have a student doing a game project for
>> which he wants background music to play — and I'm feeling some t
> On Jan 28, 2016, at 9:31 AM, Alex Knauth wrote:
>
> Would there be a way to support check-syntax arrows automatically in the
> stepper, so that we could see that they are really two different y's, because
> the arrows point to different places? Would that be possible?
That’s a fascinating i
Would there be a way to support check-syntax arrows automatically in the
stepper, so that we could see that they are really two different y's, because
the arrows point to different places? Would that be possible?
> On Jan 28, 2016, at 12:04 PM, Matthias Felleisen wrote:
>
>
> Thanks for the b
Thanks for the bug report and the reminder that 2e omits a discussion of name
capture in beta-value.
The stepper works semantically correctly precisely because it reuses the
underlying evaluation machinery. It inserts machinery that can reconstruct
(reify) the internal state of execution as r
On Thursday, January 28, 2016 at 4:51:54 PM UTC+1, Paolo Giarrusso wrote:
> My supervisor (Prof. Klaus Ostermann) noticed an issue with DrRacket's
> stepper in ISL+ (with Racket 6.2.1) and name capture.
Update: My supervisor also filed a ticket on this:
http://bugs.racket-lang.org/query/?cmd=vie
> You claim you want filtering to be as fast as possible. If that were
> so, you would not pack multiple keys (or features thereof) into a
> bignum but rather would store the keys individually.
chasing pointers? no, you're thinking about doing some sort of byte-append and
subbytes type of thing.
Hi again everybody!
My supervisor (Prof. Klaus Ostermann) noticed an issue with DrRacket's stepper
in ISL+ (with Racket 6.2.1) and name capture. One could argue there's a
straightforward name capture bug, but I think this is more confusing. For extra
fun, as far as I can tell from quickly skimm
That's right: `syntax-case` doesn't have a way to write that as a
pattern.
And yes: `syntax-parse` is newer and will one day supplant `syntax-case`
(more completely than it has already).
At Thu, 28 Jan 2016 06:03:46 -0800 (PST), reilithion wrote:
> Thanks for the explanation! Does this mean that
Thanks for the explanation! Does this mean that syntax-case simply doesn't have
a way to write a pattern that matches save-the-world anywhere in the list? I'm
also curious why these two constructs have such different pattern matchers. Is
it just that syntax-parse is newer and will one day suppla
The pattern matcher in `syntax-case` is less powerful than the one in
`syntax-parse`. The pattern
(_ trash-left ... save-the-world . trash-right)
can match `save-the-world` only against the last item in a list --- or
against the first of the last pair for a non-list.
With `syntax-parse`, as y
On Wed, 27 Jan 2016 19:43:49 -0800 (PST), Scotty C
wrote:
>> Then you're not using the hash in a conventional manner ... else the
>> filter entries would be unique
>
>using it conventionally? absolutely. it is a hash with separate chaining.
You snipped the part I was responding to, which was:
36 matches
Mail list logo
