rs@googlegroups.com [mailto:racket-users@
> googlegroups.com] On Behalf Of Ken MacKenzie
> > Sent: jueves, 27 de octubre de 2016 19:28
> > To: Racket Users
> > Cc: deviloc...@gmail.com
> > Subject: Re: [racket-users] Structs vs Lists
> >
> > Thank you for
> MHO, Jos
> >
> > -Original Message-
> > From: racket-users@googlegroups.com [mailto:racket-users@
> googlegroups.com] On Behalf Of Ken MacKenzie
> > Sent: jueves, 27 de octubre de 2016 19:28
> > To: Racket Users
> > Cc: deviloc...@gmail.com
> >
t;
> MHO, Jos
>
> -Original Message-
> From: racket-users@googlegroups.com [mailto:racket-users@googlegroups.com] On
> Behalf Of Ken MacKenzie
> Sent: jueves, 27 de octubre de 2016 19:28
> To: Racket Users
> Cc: deviloc...@gmail.com
> Subject: Re: [racket-users] St
@googlegroups.com] On
Behalf Of Ken MacKenzie
Sent: jueves, 27 de octubre de 2016 19:28
To: Racket Users
Cc: deviloc...@gmail.com
Subject: Re: [racket-users] Structs vs Lists
Thank you for the information. Good to know. Performance isn't the first
thing I am thinking about, but as I am tinkering and
ge
Thank you for the information. Good to know. Performance isn't the first
thing I am thinking about, but as I am tinkering and getting running with
Racket I like to kind of dig into the underlying structure to know the cost of
certain operations.
Ken
> For accessing an arbitrary member, yes.
On Thu, Oct 27, 2016 at 1:09 PM, Ken MacKenzie wrote:
> Thank you that makes sense. Vectors are fixed length so in theory could I
> also say a Vector is possibly more performant than an equivalent list?
>
> Ken
>
For accessing an arbitrary member, yes. A Racket vector is like, say, a C
array: i
Thank you that makes sense. Vectors are fixed length so in theory could I also
say a Vector is possibly more performant than an equivalent list?
Ken
On Thursday, October 27, 2016 at 12:58:06 PM UTC-4, Jon Zeppieri wrote:
> On Thu, Oct 27, 2016 at 12:16 PM, Ken MacKenzie wrote:
> This is a ques
On Thu, Oct 27, 2016 at 12:16 PM, Ken MacKenzie
wrote:
> This is a question more about the footprint of each. Deep down is a
> Struct really just syntactic sugar over a list.
Not in Racket (or in most Lisps these days).
> As in most things in Lisp from my understanding are all just lists, i
This is a question more about the footprint of each. Deep down is a Struct
really just syntactic sugar over a list. As in most things in Lisp from my
understanding are all just lists, it is the basic building block of all data.
Is a struct also just a list and the element names enumerations o
9 matches
Mail list logo
