pub struct FileSort<R = PlaceId, Q = RangeId, K = SortKeys, F = u16> {
pub sd: u16,
pub merge: bool,
pub keys: K,
pub input: Option<SortIo<Q, F>>,
pub output: Option<SortIo<Q, F>>,
pub sort_return: R,
pub sort_control: R,
}Expand description
A SORT or MERGE of SD sd. sort_return and sort_control are SORT-RETURN and SORT-CONTROL;
an input or output that is None fails the statement when the sort reaches it.
Fields§
§sd: u16§merge: bool§keys: K§input: Option<SortIo<Q, F>>§output: Option<SortIo<Q, F>>§sort_return: R§sort_control: RTrait Implementations§
impl<R: Eq, Q: Eq, K: Eq, F: Eq> Eq for FileSort<R, Q, K, F>
Source§impl<R: PartialEq, Q: PartialEq, K: PartialEq, F: PartialEq> PartialEq for FileSort<R, Q, K, F>
impl<R: PartialEq, Q: PartialEq, K: PartialEq, F: PartialEq> PartialEq for FileSort<R, Q, K, F>
impl<R: PartialEq, Q: PartialEq, K: PartialEq, F: PartialEq> StructuralPartialEq for FileSort<R, Q, K, F>
Auto Trait Implementations§
impl<R, Q, K, F> Freeze for FileSort<R, Q, K, F>
impl<R, Q, K, F> RefUnwindSafe for FileSort<R, Q, K, F>
impl<R, Q, K, F> Send for FileSort<R, Q, K, F>
impl<R, Q, K, F> Sync for FileSort<R, Q, K, F>
impl<R, Q, K, F> Unpin for FileSort<R, Q, K, F>
impl<R, Q, K, F> UnsafeUnpin for FileSort<R, Q, K, F>
impl<R, Q, K, F> UnwindSafe for FileSort<R, Q, K, F>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more