Struct SymPrelude 

pub struct SymPrelude<'db>(Id, PhantomData<&'db Value<SymPrelude<'static>>>);

A “prelude” is a set of item names automatically imported into scope.

Tuple Fields

0: Id

1: PhantomData<&'db Value<SymPrelude<'static>>>

Implementations

impl SymPrelude<'static>

pub fn ingredient<Db>(db: &Db) -> &IngredientImpl<Self>

where Db: ?Sized + Database,

impl<'db> SymPrelude<'db>

pub fn new<Db_, T0: Lookup<Vec<SymItem<'db>>> + Hash>( db: &'db Db_, items: T0, ) -> Self

where Db_: ?Sized + Database, Vec<SymItem<'db>>: HashEqLike<T0>,

pub fn items<Db_>(self, db: &'db Db_) -> Vec<SymItem<'db>>

where Db_: ?Sized + Database,

pub fn default_debug_fmt(this: Self, f: &mut Formatter<'_>) -> Result

Default debug formatting for this struct (may be useful if you define your own Debug impl)

Trait Implementations

impl<'db> AsId for SymPrelude<'db>

fn as_id(&self) -> Id

impl<'db> Clone for SymPrelude<'db>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Configuration for SymPrelude<'static>

const DEBUG_NAME: &'static str = "SymPrelude"

type Fields<'a> = (Vec<SymItem<'a>>,)

The fields of the struct being interned.

type Struct<'db> = SymPrelude<'db>

The end user struct

fn struct_from_id<'db>(id: Id) -> Self::Struct<'db>

Create an end-user struct from the salsa id

fn deref_struct(s: Self::Struct<'_>) -> Id

Deref the struct to yield the underlying id.

impl<'db> Debug for SymPrelude<'db>

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

Formats the value using the given formatter.

impl<'db> FromId for SymPrelude<'db>

fn from_id(id: Id) -> Self

impl<'db> Hash for SymPrelude<'db>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'db> Ord for SymPrelude<'db>

fn cmp(&self, other: &SymPrelude<'db>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<'db> PartialEq for SymPrelude<'db>

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'db> PartialOrd for SymPrelude<'db>

fn partial_cmp(&self, other: &SymPrelude<'db>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'db> SalsaStructInDb for SymPrelude<'db>

type MemoIngredientMap = MemoIngredientSingletonIndex

fn lookup_or_create_ingredient_index(aux: &Zalsa) -> IngredientIndices

Lookup or create ingredient indices.

fn cast(id: Id, type_id: TypeId) -> Option<Self>

Plumbing to support nested salsa supertypes.

impl<'db> Update for SymPrelude<'db>

unsafe fn maybe_update(old_pointer: *mut Self, new_value: Self) -> bool

Returns

impl<'db> Copy for SymPrelude<'db>

impl<'db> Eq for SymPrelude<'db>

impl<'db> Send for SymPrelude<'db>

impl<'db> StructuralPartialEq for SymPrelude<'db>

impl<'db> Sync for SymPrelude<'db>