pub fn iter_chunks(&self, start: usize, end: usize) -> ChunkIter {
        ChunkIter {
            cursor: Cursor::new(self, start),
            end,
        }
    }
/// Returns an iterator over chunks of the rope.
///
/// Each chunk is a `&str` slice borrowed from the rope's storage. The size
/// of the chunks is indeterminate but for large strings will generally be
/// in the range of 511-1024 bytes.
///
/// The empty string will yield a single empty slice. In all other cases, the
/// slices will be nonempty.
///
/// Time complexity: technically O(n log n), but the constant factor is so
/// tiny it is effectively O(n). This iterator does not allocate.
Returns an iterator over chunks of the rope.
Each chunk is a `&str` slice borrowed from the rope's storage. The size
of the chunks is indeterminate but for large strings will generally be
in the range of 511-1024 bytes.

The empty string will yield a single empty slice. In all other cases, the
slices will be nonempty.

Time complexity: technically O(n log n), but the constant factor is so
tiny it is effectively O(n). This iterator does not allocate.
Returns an iterator over chunks of the rope . Each chunk is a ` &str ` slice borrowed from the rope ' s storage . The size of the chunks is indeterminate but for large strings will generally be in the range of 511 - 1024 bytes . The empty string will yield a single empty slice . In all other cases the slices will be nonempty . Time complexity : technically O ( n log n ) but the constant factor is so tiny it is effectively O ( n ) . This iterator does not allocate .
pub fn iter_chunks(&self, start: usize, end: usize) -> ChunkIter {
        ChunkIter {
            cursor: Cursor::new(self, start),
            end,
        }
    }
pub fn iter_chunks ( & self , start : usize , end : usize ) -> ChunkIter { ChunkIter { cursor : Cursor :: new ( self , start ) , end , } }
Returns an iterator over chunks of the rope.
Returns an iterator over chunks of the rope .
&self
start
usize
end
usize