Services & Resources / Wolfram Forums / MathGroup Archive
-----

MathGroup Archive 2013

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

Search the Archive

Re: Sparse Array Question

  • To: mathgroup at smc.vnet.net
  • Subject: [mg130603] Re: Sparse Array Question
  • From: christopher arthur <chris.arthur1 at gmail.com>
  • Date: Thu, 25 Apr 2013 02:54:24 -0400 (EDT)
  • Delivered-to: l-mathgroup@mail-archive0.wolfram.com
  • Delivered-to: l-mathgroup@wolfram.com
  • Delivered-to: mathgroup-outx@smc.vnet.net
  • Delivered-to: mathgroup-newsendx@smc.vnet.net
  • References: <kl7d3o$kdc$1@smc.vnet.net> <20130424110414.B00356A83@smc.vnet.net>
  • Reply-to: chris.arthur1 at gmail.com

Thanks to everyone for the suggestions...it turned out that the 
duplicate entries were in different lists to start, so I just made 
several SparseArrays and added them up.

Chris

debguy a écrit :
> Sort by the 2nd key if the ordering of the list is immaterial.  Then
> the task is near as simple as walking a simle list.
>
> Use of Dispatch with long lists of rules may speed things up.
>
>
>   




  • Prev by Date: Re: Generalised Hough Transformation
  • Next by Date: Re: Speak errors (was Re: audio)
  • Previous by thread: Re: Sparse Array Question
  • Next by thread: Re: Sparse Array Question