BinLists

BinLists[{x1,x2,}]
gives lists of the elements whose values lie in successive integer bins.

BinLists[{x1,x2,},dx]
gives lists of the elements whose values lie in successive bins of width dx.

BinLists[{x1,x2,},{xmin,xmax,dx}]
gives lists of the that lie in successive bins of width dx from to .

BinLists[{x1,x2,},{{b1,b2,}}]
gives lists of the that lie in the intervals , , .

BinLists[{{x1,y1,},{x2,y2,},},xbins,ybins,]
gives an array of lists where the first index corresponds to x bins, the second to y, and so on.

DetailsDetails

  • BinLists drops elements whose values do not correspond to real numbers.
  • Within each bin, elements appear in the same order as in the original data.
  • BinLists[data,dx] takes the bin boundaries to be integer multiples of dx, with the first bin starting at Ceiling[Min[data]-dx,dx] and the last bin ending at Floor[Max[data]+dx,dx].
  • BinLists[data] is equivalent to BinLists[data,1].
  • BinLists[data,{xmin,xmax}] is equivalent to BinLists[data,{xmin,xmax,1}].
  • In BinLists[data,{xmin,xmax,dx}], elements are placed in bin i when their values satisfy .
  • In the form BinLists[data,{{b1,b2,}}], the at each end can be -Infinity and +Infinity.
  • If the do not form an increasing sequence, they are automatically sorted by BinLists.
  • In BinLists[data,{{b1,b2,}}], elements are put in bin i when their values satisfy .
  • If data consists of length-n sublists, then n bin specifications must be given, and BinLists[data,] yields an array of lists of depth n.
  • BinLists works with SparseArray objects.
Introduced in 2007
(6.0)