MathGroup Archive 2010

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

Search the Archive

Re: Extracting some elements, members of another list

  • To: mathgroup at smc.vnet.net
  • Subject: [mg112482] Re: Extracting some elements, members of another list
  • From: Nacho <ncc1701zzz at gmail.com>
  • Date: Fri, 17 Sep 2010 06:40:11 -0400 (EDT)
  • References: <i6nedc$g8u$1@smc.vnet.net>

Hi group!

Thanks a lot to all you for your nice answers. You have been very
helpful.

Finally, I decided to use the Dispatch[] version, it is fast and
elegant, I think. Easy to understand next month/year if I need to
revisit the code.

I knew about the Dispatch but I never though it was so fast! I'm
impressed.

Thanks again!

Regards.




On Sep 14, 11:14 am, Nacho <ncc1701... at gmail.com> wrote:
> Hi!
>
> I would like your advice about this problem:
>
> I have a list of elements, consisting in phone numbers with some data:
>
> list1= { { phone1, data1}, {phone2, data2}, {phone3, data3} .... }
>
> And a list of phones, a subset of the phone numbers in list1
>
> list2= {phone2, phone3, phone7... }
>
> I'd like to extract the elements from list1 whose phone numbers are
> present in list 2, that is:
>
> result= { { phone2, data2}, {phone3, data3, {phone7, data7} .... }
>
> I've used this with small lists and it works fine:
>
> result = Select[list1, MemberQ[list2, #[[1]]] &];
>
> The problem is that now I would like to use it with big lists. list1
> is over 1.000.000 elements long and list2 is about 500.000 elements
> long.  Ordering is not a problem, I could resort the lists.
>
> Any hint to extract this list faster? It seems to take a lot of time
> (estimation is about 5 hours and I have to do it repeatedly)
>
> Thanks!



  • Prev by Date: launching of remote parallel kernels hangs
  • Next by Date: Re: Generalizing Complement to handle multiple occurrences
  • Previous by thread: Re: Extracting some elements, members of another list
  • Next by thread: Re: Extracting some elements, members of another list