pub fn row_size<'a, I>(a: I) -> usize
where
    I: IntoIterator<Item = Datum<'a>>,
{
    // Using datums_size instead of a.data().len() here is safer because it will
    // return the size of the datams if they were packed into a Row. Although
    // a.data().len() happens to give the correct answer (and is faster), data()
    // is documented as for debugging only.
    let sz = datums_size(a);
    let size_of_row = std::mem::size_of::<Row>();
    // The Row struct attempts to inline data until it can't fit in the
    // preallocated size. Otherwise it spills to heap, and uses the Row to point
    // to that.
    if sz > Row::SIZE {
        sz + size_of_row
    } else {
        size_of_row
    }
}
/// Return the number of bytes these Datums would use if packed as a Row.
Return the number of bytes these Datums would use if packed as a Row.
Return the number of bytes these Datums would use if packed as a Row .
pub fn row_size<'a, I>(a: I) -> usize
where
    I: IntoIterator<Item = Datum<'a>>,
{
    // Using datums_size instead of a.data().len() here is safer because it will
    // return the size of the datams if they were packed into a Row. Although
    // a.data().len() happens to give the correct answer (and is faster), data()
    // is documented as for debugging only.
    let sz = datums_size(a);
    let size_of_row = std::mem::size_of::<Row>();
    // The Row struct attempts to inline data until it can't fit in the
    // preallocated size. Otherwise it spills to heap, and uses the Row to point
    // to that.
    if sz > Row::SIZE {
        sz + size_of_row
    } else {
        size_of_row
    }
}
pub fn row_size < ' a , I > ( a : I ) -> usize where I : IntoIterator < Item = Datum < ' a > > , { // Using datums_size instead of a.data().len() here is safer because it will // return the size of the datams if they were packed into a Row. Although // a.data().len() happens to give the correct answer (and is faster), data() // is documented as for debugging only. let sz = datums_size ( a ) ; let size_of_row = std :: mem :: size_of :: < Row > ( ) ; // The Row struct attempts to inline data until it can't fit in the // preallocated size. Otherwise it spills to heap, and uses the Row to point // to that. if sz > Row :: SIZE { sz + size_of_row } else { size_of_row } }
Return the number of bytes these Datums would use if packed as a Row.
Return the number of bytes these Datums would use if packed as a Row .
a
I
a
I