Tom K. wrote:
> Chris - I really like this and find it useful. I would change the name to
> something like "growable" or "ArrayList"
hmm. I think I like "growable" or maybe "growarray".
> I think the right amount to grow is 2x -
I think that may be too much.. one if the key advantages of this
Christopher Barker wrote:
>
>
> What do folks think? is this useful? What would you change, etc?
>
Chris - I really like this and find it useful. I would change the name to
something like "growable" or "ArrayList" - accumulator seems like an object
for cumulative summation. I think the righ
2009/10/5 Christopher Barker :
> Francesc Alted wrote:
>> A Saturday 03 October 2009 10:06:12 Christopher Barker escrigué:
>>> This idea was inspired by a discussion at the SciPy conference, in which
>>> we spent a LOT of time during the numpy tutorial talking about how to
>>> accumulate values in
Francesc Alted wrote:
> A Saturday 03 October 2009 10:06:12 Christopher Barker escrigué:
>> This idea was inspired by a discussion at the SciPy conference, in which
>> we spent a LOT of time during the numpy tutorial talking about how to
>> accumulate values in an array when you don't know how big
A Saturday 03 October 2009 10:06:12 Christopher Barker escrigué:
> OK -- this one I'm intending to send!
>
> Hi all,
>
> This idea was inspired by a discussion at the SciPy conference, in which
> we spent a LOT of time during the numpy tutorial talking about how to
> accumulate values in an array w
Gökhan Sever wrote:
> Thanks for working on this. This append() method is a very handy for me,
> when working with lists. It is exiting to hear that it will be ported to
> ndarrays as well.
not exactly ported -- this will be a special, limited-use class.
> Any plans for insert() ?
I wouldn't
On Sat, Oct 3, 2009 at 2:26 AM, Christopher Barker wrote:
> Hasi all,
>
> This idea was inspired by a discussion at SciPY, in which we spent a
> LOT of time during the numpy tutorial talking about how to accumulate
> values in an array when you don't know how big the array needs to be
> when you
Christopher Barker wrote:
> OK -- this one I'm intending to send!
>
> Hi all,
>
> This idea was inspired by a discussion at the SciPy conference, in which
> we spent a LOT of time during the numpy tutorial talking about how to
> accumulate values in an array when you don't know how big the array
OK -- this one I'm intending to send!
Hi all,
This idea was inspired by a discussion at the SciPy conference, in which
we spent a LOT of time during the numpy tutorial talking about how to
accumulate values in an array when you don't know how big the array
needs to be when you start.
The "stand
(I clicked send too early the last time -- sorry about that!)
Hi all,
This idea was inspired by a discussion at the SciPy conference, in which
we spent a LOT of time during the numpy tutorial talking about how to
accumulate values in an array when you don't know how big the array
needs to be wh
On Sat, Oct 3, 2009 at 02:26, Christopher Barker wrote:
> The implementation I have now uses a regular numpy array as the
> "buffer". The buffer is re-sized as needed with ndarray.resize(). I've
> enclosed the class, a bunch of tests (This is the first time I've ever
> really done test-driven deve
Hasi all,
This idea was inspired by a discussion at SciPY, in which we spent a
LOT of time during the numpy tutorial talking about how to accumulate
values in an array when you don't know how big the array needs to be
when you start.
The "standard practice" is to accumulate in a python list,
12 matches
Mail list logo
