Struct LispHashTable

pub(crate) struct LispHashTable(GcHeap<HashTableCore<'static>>);

Tuple Fields

0: GcHeap<HashTableCore<'static>>

Implementations

impl LispHashTable

pub(in core) unsafe fn new( table: IndexMap<Gc<ObjectType<'_>>, Gc<ObjectType<'_>>>, constant: bool, ) -> Self

pub(in core) fn forwarding_ptr( &self, ) -> Option<NonNull<u8>>

Methods from Deref<Target = <GcHeap<HashTableCore<'static>> as std_ops_Deref>::Target>

const NULL: *mut u8 = {0x0 as *mut u8}

const EMTPTY: AtomicPtr<u8> = _

fn header(&self) -> &GcHeader

pub(in core) fn forward( &self, fwd_ptr: NonNull<u8>, )

pub(in core) fn allocation_state( &self, ) -> AllocState

fn is_marked(&self) -> bool

Trait Implementations

impl<'new> CloneIn<'new, &'new LispHashTable> for LispHashTable

fn clone_in<const C: bool>(&self, bk: &'new Block<C>) -> Gc<&'new Self>

impl Markable for LispHashTable

type Value = NonNull<LispHashTable>

fn move_value(&self, to_space: &Bump) -> Option<(Self::Value, bool)>

impl PartialEq for LispHashTable

fn eq(&self, other: &LispHashTable) -> 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 RootedDeref for LispHashTable

type Target = RootedLispHashTable

fn rooted_deref(rooted: &Rt<Self>) -> &Self::Target

fn rooted_derefmut(rooted: &mut Rt<Self>) -> &mut Self::Target

impl TaggedPtr for &LispHashTable

const TAG: Tag = Tag::HashTable

Tag value. This is only applicable to base values. Use Int for sum types.

type Ptr = LispHashTable

The type of object being pointed to. This will be different for all implementors.

unsafe fn from_obj_ptr(ptr: *const u8) -> Self

Given an untyped pointer, reinterpret to self.

fn get_ptr(self) -> *const Self::Ptr

Get the underlying pointer.

unsafe fn tag_ptr(ptr: *const Self::Ptr) -> Gc<Self>

Given a pointer to Ptr return a Tagged pointer.

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.

fn tag(self) -> Gc<Self>

Given the type, return a tagged version of it. When using a sum type or an immediate value like i64, we override this method to set the proper tag.

impl Trace for LispHashTable

fn trace(&self, state: &mut GcState)

impl<'ob> TryFrom<Gc<ObjectType<'ob>>> for &'ob LispHashTable

type Error = TypeError

The type returned in the event of a conversion error.

fn try_from(obj: Gc<ObjectType<'ob>>) -> Result<Self, Self::Error>

Performs the conversion.

impl<'old, 'new> WithLifetime<'new> for &'old LispHashTable

type Out = &'new LispHashTable

unsafe fn with_lifetime(self) -> Self::Out

impl<'ob> From<&'ob LispHashTable> for Gc<ObjectType<'ob>>

fn from(x: &'ob LispHashTable) -> Self

Converts to this type from the input type.

impl Debug for LispHashTable

fn fmt(&self, f: &mut std_fmt_Formatter<'_>) -> std_fmt_Result

Formats the value using the given formatter.

impl Display for LispHashTable

fn fmt(&self, f: &mut std_fmt_Formatter<'_>) -> std_fmt_Result

Formats the value using the given formatter.

impl Deref for LispHashTable

type Target = <GcHeap<HashTableCore<'static>> as Deref>::Target

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl Eq for LispHashTable

impl GcPtr for &LispHashTable

impl StructuralPartialEq for LispHashTable