pub struct Cap { /* private fields */ }Expand description
A count-based limit for EXISTS subqueries that needs no order: it tracks
membership by primary key (cap.ts).
Implementations§
Trait Implementations§
Source§impl Input for Cap
impl Input for Cap
fn set_output(&self, output: Weak<dyn Output>)
fn fetch(&self, req: &FetchRequest) -> NodeStream
Source§impl InputBase for Cap
impl InputBase for Cap
fn get_schema(&self) -> Rc<SourceSchema>
fn destroy(&self)
Source§impl Output for Cap
impl Output for Cap
fn push(&self, change: Change, _pusher: &dyn InputBase)
Source§fn reconcile(&self, _pusher: &dyn InputBase)
fn reconcile(&self, _pusher: &dyn InputBase)
Phase two. Sinks can ignore it; operators must forward it.
Source§fn has_reconcile(&self) -> bool
fn has_reconcile(&self) -> bool
Whether the output has a phase two: false for a sink whose JS
counterpart has no
reconcile, such as a view, which pushes timed
for the inspector skip (MeasurePushOperator).Auto Trait Implementations§
impl !Freeze for Cap
impl !RefUnwindSafe for Cap
impl !Send for Cap
impl !Sync for Cap
impl !UnwindSafe for Cap
impl Forget for Cap
impl Move for Cap
impl Unpin for Cap
impl UnsafeUnpin for Cap
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