# BinLists

BinLists[{x1,x2,}]

gives lists of the elements xi whose values lie in successive integer bins.

BinLists[{x1,x2,},dx]

gives lists of the elements xi whose values lie in successive bins of width dx.

BinLists[{x1,x2,},{xmin,xmax,dx}]

gives lists of the xi that lie in successive bins of width dx from xmin to xmax.

BinLists[{x1,x2,},{{b1,b2,}}]

gives lists of the xi that lie in the intervals [b1,b2), [b2,b3), .

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.

# Details

• 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 bi at each end can be and .
• If the bi 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.

# Examples

open allclose all

## Basic Examples(3)

Make lists of elements in bins of width 1 from 0 to 10:

 In[1]:=
 Out[1]=

List elements in a sequence of ranges:

 In[1]:=
 Out[1]=

List elements in bins of a specified width:

 In[1]:=
 Out[1]=