`uniBinner` is an iterative implementation of a recursive binary partitioning algorithm which accepts the splitting and stopping functions that guide partitioning as arguments and applies them to the margin `y` alone.
uniBinner(x, y, stopper, splitter, dropPoints = FALSE)A list of lists each with elements `x`, `y`, `bnds`, `expn`, `n`, and `stopped`.
factor vector for the the first variable
numeric vector of the second variable (to be split)
function which accepts a list with elements `x`, `y`, `bnds`, `expn`, and `n` and returns a logical indicating whether a split should occur for the bin defined by that list
function which accepts a list of lists with elements `x`, `y`, `bnds`, `expn`, and `n` and returns a list where each element is a list of two corresponding to a split of the bin at that position in the original list
logical; should points be dropped from final bins?
Chris Salahub
`binner` creates a one-dimensional histogram of `y` for each categorical value of `x` by recursively splitting partitions of the data using `splitter` until `stopper` indicates that all partitions are not to be split.