pub(crate) struct Record(GcHeap<LispVecInner>);
Tuple Fields§
§0: GcHeap<LispVecInner>
Implementations§
Methods from Deref<Target = <GcHeap<LispVecInner> as std_ops_Deref>::Target>§
Trait Implementations§
Source§impl RootedDeref for Record
impl RootedDeref for Record
type Target = RootedRecord
fn rooted_deref(rooted: &Rt<Self>) -> &Self::Target
fn rooted_derefmut(rooted: &mut Rt<Self>) -> &mut Self::Target
Source§impl TaggedPtr for &Record
impl TaggedPtr for &Record
Source§const TAG: Tag = Tag::Record
const TAG: Tag = Tag::Record
Tag value. This is only applicable to base values. Use Int for sum
types.
Source§type Ptr = LispVec
type Ptr = LispVec
The type of object being pointed to. This will be different for all
implementors.
Source§unsafe fn from_obj_ptr(ptr: *const u8) -> Self
unsafe fn from_obj_ptr(ptr: *const u8) -> Self
Given an untyped pointer, reinterpret to self. Read more
Source§unsafe fn tag_ptr(ptr: *const Self::Ptr) -> Gc<Self>
unsafe fn tag_ptr(ptr: *const Self::Ptr) -> Gc<Self>
Given a pointer to
Ptr
return a Tagged pointer. Read moreSource§fn untag(val: Gc<Self>) -> Self
fn untag(val: Gc<Self>) -> Self
Remove the tag from the
Gc<T>
and return the inner type. If it is
base type then it will only have a single possible value and can be
untagged without checks, but sum types need to create all values
they can hold. We use tagged base types to let us reinterpret bits
without actually modify them. Read moreSource§impl<'old, 'new> WithLifetime<'new> for &'old Record
impl<'old, 'new> WithLifetime<'new> for &'old Record
impl Eq for Record
impl GcPtr for &Record
impl StructuralPartialEq for Record
Auto Trait Implementations§
impl !Freeze for Record
impl !RefUnwindSafe for Record
impl !Send for Record
impl !Sync for Record
impl Unpin for Record
impl !UnwindSafe for Record
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
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.