pub fn lower_to_hir<R>(&self, f: LazyHir<'sb, 'ast, 'ctx, R>)
    where
        LazyHirTable<'sb, 'ast, 'ctx>: NodeStorage<I, Node = LazyNode<LazyHir<'sb, 'ast, 'ctx, R>>>,
    {
        self.ctx
            .lazy
            .hir
            .table
            .borrow_mut()
            .set(self.id, LazyNode::Pending(f));
    }
/// Schedule a callback that lowers the node to HIR.
Schedule a callback that lowers the node to HIR.
Schedule a callback that lowers the node to HIR .
pub fn lower_to_hir<R>(&self, f: LazyHir<'sb, 'ast, 'ctx, R>)
    where
        LazyHirTable<'sb, 'ast, 'ctx>: NodeStorage<I, Node = LazyNode<LazyHir<'sb, 'ast, 'ctx, R>>>,
    {
        self.ctx
            .lazy
            .hir
            .table
            .borrow_mut()
            .set(self.id, LazyNode::Pending(f));
    }
pub fn lower_to_hir < R > ( & self , f : LazyHir < ' sb , ' ast , ' ctx , R > ) where LazyHirTable < ' sb , ' ast , ' ctx > : NodeStorage < I , Node = LazyNode < LazyHir < ' sb , ' ast , ' ctx , R > > > , { self . ctx . lazy . hir . table . borrow_mut ( ) . set ( self . id , LazyNode :: Pending ( f ) ) ; }
Schedule a callback that lowers the node to HIR.
Schedule a callback that lowers the node to HIR .
&self
f
LazyHir<'sb, 'ast, 'ctx, R>
&self
f
LazyHir<'sb, 'ast, 'ctx, R>