Files
@ 3ffeb97c88a7
Branch filter:
Location: CSY/reowolf/src/collections/sets.rs - annotation
3ffeb97c88a7
2.0 KiB
application/rls-services+xml
Add docs for implementing infinite types in a value based language.
Since we are a value based language and do not have the concept of
pointers, then if we want to lay out the memory of datatypes we run
into a problem when the types represent recursive datastructures:
these are infinite in size. So we have an algorithm for turning
some types into pointer-like things, such that we can lay everything
out in memory.
Since we are a value based language and do not have the concept of
pointers, then if we want to lay out the memory of datatypes we run
into a problem when the types represent recursive datastructures:
these are infinite in size. So we have an algorithm for turning
some types into pointer-like things, such that we can lay everything
out in memory.
5dea649b3ffd 5dea649b3ffd 10d2e43f1350 10d2e43f1350 10d2e43f1350 ef37386d0c6f 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 85419b0950c7 85419b0950c7 85419b0950c7 85419b0950c7 85419b0950c7 ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f ef37386d0c6f 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 10d2e43f1350 | #![allow(dead_code)] // For now, come back to this when compiler has matured -- MH 27/05/21
use std::collections::VecDeque;
/// Simple double ended queue that ensures that all elements are unique. Queue
/// elements are not ordered (we expect the queue to be rather small).
pub struct DequeSet<T: Eq> {
inner: VecDeque<T>,
}
impl<T: Eq> DequeSet<T> {
pub fn new() -> Self {
Self{ inner: VecDeque::new() }
}
#[inline]
pub fn pop_front(&mut self) -> Option<T> {
self.inner.pop_front()
}
#[inline]
pub fn pop_back(&mut self) -> Option<T> {
self.inner.pop_back()
}
#[inline]
pub fn push_back(&mut self, to_push: T) {
for element in self.inner.iter() {
if *element == to_push {
return;
}
}
self.inner.push_back(to_push);
}
#[inline]
pub fn push_front(&mut self, to_push: T) {
for element in self.inner.iter() {
if *element == to_push {
return;
}
}
self.inner.push_front(to_push);
}
#[inline]
pub fn clear(&mut self) {
self.inner.clear();
}
#[inline]
pub fn is_empty(&self) -> bool {
self.inner.is_empty()
}
}
/// Simple vector set that ensures that all elements are unique. Elements are
/// not ordered (we expect the vector to be small).
pub struct VecSet<T: Eq> {
inner: Vec<T>,
}
impl<T: Eq> VecSet<T> {
pub fn new() -> Self {
Self{ inner: Vec::new() }
}
#[inline]
pub fn pop(&mut self) -> Option<T> {
self.inner.pop()
}
#[inline]
pub fn push(&mut self, to_push: T) {
for element in self.inner.iter() {
if *element == to_push {
return;
}
}
self.inner.push(to_push);
}
#[inline]
pub fn clear(&mut self) {
self.inner.clear();
}
#[inline]
pub fn is_empty(&self) -> bool {
self.inner.is_empty()
}
}
|