pub fn lexicographical_partition_ranges<'a>(
    columns: &'a [SortColumn],
) -> Result<impl Iterator<Item = Range<usize>> + 'a> {
    LexicographicalPartitionIterator::try_new(columns)
}
/// Given a list of already sorted columns, find partition ranges that would partition
/// lexicographically equal values across columns.
///
/// Here LexicographicalComparator is used in conjunction with binary
/// search so the columns *MUST* be pre-sorted already.
///
/// The returned vec would be of size k where k is cardinality of the sorted values; Consecutive
/// values will be connected: (a, b) and (b, c), where start = 0 and end = n for the first and last
/// range.
Given a list of already sorted columns, find partition ranges that would partition
lexicographically equal values across columns.

Here LexicographicalComparator is used in conjunction with binary
search so the columns *MUST* be pre-sorted already.

The returned vec would be of size k where k is cardinality of the sorted values; Consecutive
values will be connected: (a, b) and (b, c), where start = 0 and end = n for the first and last
range.
Given a list of already sorted columns find partition ranges that would partition lexicographically equal values across columns . Here LexicographicalComparator is used in conjunction with binary search so the columns * MUST * be pre - sorted already . The returned vec would be of size k where k is cardinality of the sorted values ; Consecutive values will be connected : ( a b ) and ( b c ) where start = 0 and end = n for the first and last range .
pub fn lexicographical_partition_ranges<'a>(
    columns: &'a [SortColumn],
) -> Result<impl Iterator<Item = Range<usize>> + 'a> {
    LexicographicalPartitionIterator::try_new(columns)
}
pub fn lexicographical_partition_ranges < ' a > ( columns : & ' a [ SortColumn ] , ) -> Result < impl Iterator < Item = Range < usize > > + ' a > { LexicographicalPartitionIterator :: try_new ( columns ) }
Given a list of already sorted columns, find partition ranges that would partition
lexicographically equal values across columns.
Given a list of already sorted columns find partition ranges that would partition lexicographically equal values across columns .
columns
&'a [SortColumn]