pub fn new(meta_data: &MetaData, chunk_writer: &'w mut W) -> SortedBlocksWriter<'w, W> {
        let requires_sorting = meta_data.headers.iter()
            .any(|header| header.line_order != LineOrder::Unspecified);

        let total_chunk_count = chunk_writer.total_chunks_count();

        SortedBlocksWriter {
            pending_chunks: BTreeMap::new(),
            unwritten_chunk_indices: (0 .. total_chunk_count).peekable(),
            requires_sorting,
            chunk_writer
        }
    }
/// New sorting writer. Returns `None` if sorting is not required.
New sorting writer. Returns `None` if sorting is not required.
New sorting writer . Returns ` None ` if sorting is not required .
pub fn new(meta_data: &MetaData, chunk_writer: &'w mut W) -> SortedBlocksWriter<'w, W> {
        let requires_sorting = meta_data.headers.iter()
            .any(|header| header.line_order != LineOrder::Unspecified);
        let total_chunk_count = chunk_writer.total_chunks_count();
        SortedBlocksWriter {
            pending_chunks: BTreeMap::new(),
            unwritten_chunk_indices: (0 .. total_chunk_count).peekable(),
            requires_sorting,
            chunk_writer
        }
    }
pub fn new ( meta_data : & MetaData , chunk_writer : & ' w mut W ) -> SortedBlocksWriter < ' w , W > { let requires_sorting = meta_data . headers . iter ( ) . any ( | header | header . line_order != LineOrder :: Unspecified ) ; let total_chunk_count = chunk_writer . total_chunks_count ( ) ; SortedBlocksWriter { pending_chunks : BTreeMap :: new ( ) , unwritten_chunk_indices : ( 0 .. total_chunk_count ) . peekable ( ) , requires_sorting , chunk_writer } }
New sorting writer.
New sorting writer .
meta_data
&MetaData
chunk_writer
&'w mut W
meta_data
&MetaData
chunk_writer
&'w mut W