Robert Kern wrote:
> James Stroud wrote:
> http://numeric.scipy.org
>
Thanks! That's anotehr solution, yes!
--
Ángel Gutiérrez Rodríguez - [EMAIL PROTECTED]
Instituto de Ciencia de los Materiales de Madrid - CSIC
SpLine - European Syncrothorn Radiation Facility - Grenoble - France
Postal adress:
bruno at modulix wrote:
> for N:
> mylist = [mylist]
>
Right that!
> I'm afraid I don't understand. Could you forgive my stupidity and
> re-explain this a bit more clearly ?
>
No need to. Former solution worked fine. Thanks!
--
Ángel Gutiérrez Rodríguez - [EMAIL PROTECTED]
Instituto de Cienc
James Stroud wrote:
> Numarray does this sort of thing, but you have to familiarize yourself
> with its indexing conventions:
>
> py> import numarray
> py> numarray.ones((3,2))
> array([[1, 1],
> [1, 1],
> [1, 1]])
> py> numarray.ones((1,2,3))
> array([[[1, 1, 1],
> [1,
Ángel Gutiérrez Rodríguez wrote:
> I would like to have a list of lists N times deep, and my solution is (in
> pseudocode):
>
> def deep(x):
> a=[x]
> return a
>
> mylist=[]
> for N: mylist=deep(mylist)
>
> Is there a more elegant way to do it?
>
> The maine idea is: from a list having the
Ángel Gutiérrez Rodríguez wrote:
> I would like to have a list of lists N times deep, and my solution is (in
> pseudocode):
>
> def deep(x):
> a=[x]
> return a
Hint : what's exactly the difference between deep(x) and [x] ?
> mylist=[]
> for N: mylist=deep(mylist)
>
> Is there a more elegant
