Struct ImplicitPrecedence

Source

pub struct ImplicitPrecedence<'db>(/* private fields */);

Expand description

Extra information about sorting of implicit arguments of the function.

In most of the user written code, the implicits are not stated explicitly, but instead are inferred by the compiler. The order on how these implicit arguments are laid out on Sierra level is unspecified though for the users. Currently, the compiler sorts them alphabetically by name for reproducibility, but it can equally just randomize the order on each compilation.

Some compilation targets tend to expect that particular functions accept particular implicit arguments at fixed positions. For example, the Starknet OS has such assumptions. By reading the implicit precedence information attached to functions, the compiler can now reliably generate compatible code.

To set, add the #[implicit_precedence(...)] attribute to function declaration. Only free or impl functions can have this information defined. For extern functions, the compiler raises an error. It is recommended to always create this attribute from compiler plugins, and not force users to write it manually.

Use ImplicitPrecedence::UNSPECIFIED to represent lack of information.

Struct ImplicitPrecedence Copy item path

Implementations§

impl<'db> ImplicitPrecedence<'db>

pub const UNSPECIFIED: Self

pub fn apply(&self, implicits: &mut [TypeId<'db>], db: &dyn Database)

Trait Implementations§

impl<'db> Clone for ImplicitPrecedence<'db>

fn clone(&self) -> ImplicitPrecedence<'db>

fn clone_from(&mut self, source: &Self)

impl<'db> Debug for ImplicitPrecedence<'db>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl<'db> Default for ImplicitPrecedence<'db>

fn default() -> ImplicitPrecedence<'db>

impl<'db> FromIterator<TypeId<'db>> for ImplicitPrecedence<'db>

fn from_iter<T: IntoIterator<Item = TypeId<'db>>>(iter: T) -> Self

impl<'db> PartialEq for ImplicitPrecedence<'db>

fn eq(&self, other: &ImplicitPrecedence<'db>) -> bool

fn ne(&self, other: &Rhs) -> bool

impl<'db> Update for ImplicitPrecedence<'db>

unsafe fn maybe_update(old_pointer_: *mut Self, new_value_: Self) -> bool

impl<'db> Eq for ImplicitPrecedence<'db>

impl<'db> StructuralPartialEq for ImplicitPrecedence<'db>

Auto Trait Implementations§

impl<'db> Freeze for ImplicitPrecedence<'db>

impl<'db> RefUnwindSafe for ImplicitPrecedence<'db>

impl<'db> Send for ImplicitPrecedence<'db>

impl<'db> Sync for ImplicitPrecedence<'db>

impl<'db> Unpin for ImplicitPrecedence<'db>

impl<'db> UnwindSafe for ImplicitPrecedence<'db>

Blanket Implementations§

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> CloneToUninit for Twhere T: Clone,

unsafe fn clone_to_uninit(&self, dest: *mut u8)

impl<'db, T> DebugDbUpcast<'db, T> for Twhere T: ?Sized,

fn debug_db_upcast(&'db self) -> &'db T

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<T> From<T> for T

fn from(t: T) -> T

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

fn in_current_span(self) -> Instrumented<Self>

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T> IntoEither for T

fn into_either(self, into_left: bool) -> Either<Self, Self>

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where F: FnOnce(&Self) -> bool,

impl<T> Pointable for T

const ALIGN: usize

type Init = T

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

impl<T> Same for T

type Output = T

impl<T0, T1, E, TRewriter> SemanticRewriter<(T0, T1), E> for TRewriterwhere TRewriter: SemanticRewriter<T0, E> + SemanticRewriter<T1, E>,

fn internal_rewrite(&mut self, value: &mut (T0, T1)) -> Result<RewriteResult, E>

fn rewrite(&mut self, value: T) -> Result<T, Error>

impl<T, E, TRewriter> SemanticRewriter<Box<T>, E> for TRewriterwhere TRewriter: SemanticRewriter<T, E>,

fn internal_rewrite(&mut self, value: &mut Box<T>) -> Result<RewriteResult, E>

fn rewrite(&mut self, value: T) -> Result<T, Error>

impl<T, E, TRewriter> SemanticRewriter<Deque<T>, E> for TRewriterwhere TRewriter: SemanticRewriter<T, E>,

fn internal_rewrite(&mut self, value: &mut Deque<T>) -> Result<RewriteResult, E>

fn rewrite(&mut self, value: T) -> Result<T, Error>

impl<T, E, TRewriter> SemanticRewriter<Option<T>, E> for TRewriterwhere TRewriter: SemanticRewriter<T, E>,

fn internal_rewrite( &mut self, value: &mut Option<T>, ) -> Result<RewriteResult, E>

fn rewrite(&mut self, value: T) -> Result<T, Error>

impl<'a, K, V, E, TRewriter> SemanticRewriter<OrderedHashMap<K, V>, E> for TRewriterwhere K: Hash + Eq + LanguageElementId<'a>, V: Clone, TRewriter: SemanticRewriter<V, E>,

fn internal_rewrite( &mut self, value: &mut OrderedHashMap<K, V>, ) -> Result<RewriteResult, E>

fn rewrite(&mut self, value: T) -> Result<T, Error>

impl<T, E, TRewriter, E2> SemanticRewriter<Result<T, E2>, E> for TRewriterwhere TRewriter: SemanticRewriter<T, E>,

fn internal_rewrite( &mut self, value: &mut Result<T, E2>, ) -> Result<RewriteResult, E>

fn rewrite(&mut self, value: T) -> Result<T, Error>

impl<T, E, TRewriter> SemanticRewriter<Vec<T>, E> for TRewriterwhere T: Clone, TRewriter: SemanticRewriter<T, E>,

Struct ImplicitPrecedence

impl<T> Any for T
where T: 'static + ?Sized,

impl<T> Borrow<T> for T
where T: ?Sized,

impl<T> BorrowMut<T> for T
where T: ?Sized,

impl<T> CloneToUninit for T
where T: Clone,

impl<'db, T> DebugDbUpcast<'db, T> for T
where T: ?Sized,

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

impl<T, U> Into<U> for T
where U: From<T>,

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

impl<T0, T1, E, TRewriter> SemanticRewriter<(T0, T1), E> for TRewriter
where TRewriter: SemanticRewriter<T0, E> + SemanticRewriter<T1, E>,

impl<T, E, TRewriter> SemanticRewriter<Box<T>, E> for TRewriter
where TRewriter: SemanticRewriter<T, E>,

impl<T, E, TRewriter> SemanticRewriter<Deque<T>, E> for TRewriter
where TRewriter: SemanticRewriter<T, E>,

impl<T, E, TRewriter> SemanticRewriter<Option<T>, E> for TRewriter
where TRewriter: SemanticRewriter<T, E>,

impl<'a, K, V, E, TRewriter> SemanticRewriter<OrderedHashMap<K, V>, E> for TRewriter
where K: Hash + Eq + LanguageElementId<'a>, V: Clone, TRewriter: SemanticRewriter<V, E>,

impl<T, E, TRewriter, E2> SemanticRewriter<Result<T, E2>, E> for TRewriter
where TRewriter: SemanticRewriter<T, E>,

impl<T, E, TRewriter> SemanticRewriter<Vec<T>, E> for TRewriter
where T: Clone, TRewriter: SemanticRewriter<T, E>,

impl<T> ToOwned for T
where T: Clone,

impl<T, U> TryFrom<U> for T
where U: Into<T>,

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,