MathGroup Archive 2001

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Best code to match corresponding list items?

  • To: mathgroup at smc.vnet.net
  • Subject: [mg27770] Re: [mg27729] Best code to match corresponding list items?
  • From: Ken Levasseur <Kenneth_Levasseur at uml.edu>
  • Date: Wed, 14 Mar 2001 04:07:17 -0500 (EST)
  • References: <200103130852.DAA26255@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

Roger:

MathThread will do what you want:

In[20]:=
a = {x, y, z, w};
b = {s, t, u, q};
MapThread[List, {a, b}]
Out[22]=
{{x, s}, {y, t}, {z, u}, {w, q}}

It generalizes to any number of lists that have the same length

Ken Levasseur
Math. Sciences
UMass Lowell


Roger Ison wrote:

> Given two lists
> A={a1,a2,a3,...}
> B={b1,b2,b3...}
>
> I want to produce the list
> C={  {a1,b1}, {a2,b2}, {a3,b3}...}  }
> as efficiently as possible.
> Better yet, generalize to do this with N lists all of same length.
>
> Obviously it can be done directly with Table, but is there a more elegant,
> implicit way to write it that doesn't involve passing a function to Table
> and using an explicit index? Is there a general functional primitive for
> this that I simply haven't found? Seems like something so common, there
> ought to be a built-in function for it.
>
> Thanks,
> Roger



  • Prev by Date: Re: Best code to match corresponding list items?
  • Next by Date: Re: Best code to match corresponding list items?
  • Previous by thread: RE: Best code to match corresponding list items?
  • Next by thread: Re: Best code to match corresponding list items?