If this buffer has size numElems then return it If this buffer has size 1 then return a buffer with that element repeated numElem times Otherwise throw

Returns CDF of this buffer at numPoints evenly spaced points always including the min and the max

Computes inner, full outer, left outer or right outer joins Returns two index buffers with the locations which have to be taken from the original buffers (this and other) to join them. If the return is None, then take the complete buffer.

Missing values match other missing values (which is not correct)

Returns locations at which this is <= or >= than the first element of other

Reduce the groups by taking the first element per group

Returns a map of unique items

Returns hash of item at location l. Missing values get the same hash. Throws if out of bounds

Returns true if item at position l is missing. Throws if out of bounds

Takes an other buffer of the same size and returns a buffer of the same size with elements from this buffer, except if it is missing then from the other buffer, else missing value

partitions the buffer with the partition map supplied Returns as many new buffers of various sizes as many distinct values in the map

returns indexes where value is positive (or positive length)

Reduce the groups defined by the map with summation

negative indices yield NA values

given the bounds on BufferType this should never fail

takes element where mask is non missing and > 0, for string mask where non missing and non empty

uses the first element from cutoff