Services & Resources / Wolfram Forums
MathGroup Archive
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 1999

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

Search the Archive

RE: "extending" BinCounts, need for speed

  • To: mathgroup at
  • Subject: [mg15994] RE: [mg15871] "extending" BinCounts, need for speed
  • From: "Jean-Marie THOMAS" <jmthomas at>
  • Date: Fri, 19 Feb 1999 03:27:09 -0500
  • Sender: owner-wri-mathgroup at

Is that what you need?

On my machine bin is defined in less than 10 secs.

Hope this helps,

Jean-Marie THOMAS
mailto:jmthomas at
Conseil et Audit en Ingnierie de Calcul
Strasbourg, France

-----Original Message-----
From: Olivier Pelletier [mailto:pelletie at]
To: mathgroup at
Subject: [mg15994] [mg15871] "extending" BinCounts, need for speed


I have a huge (i.e. Length[list]>50000) list of points (a point being a
list {ai,bi})
I need to process it using a BinCounts-like function doing the
if ai is in the i-th "bin" then I should add bi to the value of this
bin. (BinCounts  takes a list of numbers and adds unity to the bin
corresponding to the value of the number).
Using Do[bin[[ai]]+= bi, {i,Length[my_list]}] simply takes too much
Any suggestion to improve the speed.
Thanks to everyone in advance


  • Prev by Date: 3D data graphing
  • Next by Date: Re: Plot[] problem (plnr) - help !!!
  • Previous by thread: "extending" BinCounts, need for speed
  • Next by thread: Re: "extending" BinCounts, need for speed