[−][src]Enum glsp_engine::Deque
A type-erased deque
.
Because this type implements the DequeOps
trait, you can manipulate it
directly, without needing to access the underlying Root<Arr>
or
Root<Str>
.
Variants
Implementations
impl Deque
[src]
pub fn same(&self, other: &Deque) -> bool
[src]
Returns true
if both deques share the same identity.
Equivalent to (same? deq other)
.
pub fn shallow_clone(&self) -> Deque
[src]
Creates a shallow copy of the deque.
Equivalent to (clone deq)
.
pub fn deep_clone(&self) -> GResult<Deque>
[src]
Recursively copies the deque and all of its contents.
Equivalent to (deep-clone deq)
.
pub fn access_giter(&self, giter: &Root<GIter>) -> Root<GIter>ⓘ
[src]
Creates an indexing iterator for this collection.
Equivalent to [deq iter]
.
Trait Implementations
impl Clone for Deque
[src]
impl Debug for Deque
[src]
impl<I: DequeIndex> DequeAccess<I> for Deque
[src]
pub fn get<R: FromElement<Slot>>(&self, i: I) -> GResult<R>
[src]
pub fn set<V: IntoElement<Slot>>(&self, i: I, v: V) -> GResult<()>
[src]
pub fn insert<V: IntoElement<Slot>>(&self, i: I, v: V) -> GResult<()>
[src]
pub fn del(&self, i: I) -> GResult<()>
[src]
pub fn remove<R: FromElement<Slot>>(&self, i: I) -> GResult<R>
[src]
pub fn swap_remove<R: FromElement<Slot>>(&self, i: I) -> GResult<R>
[src]
pub fn swap_remove_start<R: FromElement<Slot>>(&self, i: I) -> GResult<R>
[src]
impl<I, R> DequeAccessRange<I, R> for Deque where
I: DequeIndex,
R: DequeRange<I> + Debug,
[src]
I: DequeIndex,
R: DequeRange<I> + Debug,
impl DequeOps for Deque
[src]
type Element = Slot
type Item = Val
pub fn freeze(&self)
[src]
pub fn deep_freeze(&self)
[src]
pub fn is_frozen(&self) -> bool
[src]
pub fn is_deep_frozen(&self) -> bool
[src]
pub fn sort(&self) -> GResult<()>
[src]
pub fn sort_by<F>(&self, f: F) -> GResult<()> where
F: FnMut(&Val, &Val) -> GResult<Ordering>,
[src]
F: FnMut(&Val, &Val) -> GResult<Ordering>,
pub fn can_mutate(&self) -> bool
[src]
pub fn swap<I1, I2>(&self, i: I1, j: I2) -> GResult<()> where
I1: DequeIndex,
I2: DequeIndex,
[src]
I1: DequeIndex,
I2: DequeIndex,
pub fn len(&self) -> usize
[src]
pub fn contains<V: IntoElement<Slot>>(&self, v: V) -> GResult<bool>
[src]
pub fn push<V: IntoElement<Slot>>(&self, v: V) -> GResult<()>
[src]
pub fn pop<R: FromElement<Slot>>(&self) -> GResult<R>
[src]
pub fn push_start<V: IntoElement<Slot>>(&self, v: V) -> GResult<()>
[src]
pub fn pop_start<R: FromElement<Slot>>(&self) -> GResult<R>
[src]
pub fn grow<V: IntoElement<Slot>>(
&self,
start: usize,
end: usize,
fill: V
) -> GResult<()>
[src]
&self,
start: usize,
end: usize,
fill: V
) -> GResult<()>
pub fn shrink(&self, start: usize, end: usize) -> GResult<()>
[src]
pub fn append(&self, _other: &Self) -> GResult<()>
[src]
pub fn prepend(&self, _other: &Self) -> GResult<()>
[src]
pub fn resize<V: IntoElement<Slot>>(
&self,
new_len: usize,
fill: V
) -> GResult<()>
[src]
&self,
new_len: usize,
fill: V
) -> GResult<()>
pub fn rotate_left(&self, mid: usize) -> GResult<()>
[src]
pub fn rotate_right(&self, k: usize) -> GResult<()>
[src]
pub fn capacity(&self) -> usize
[src]
pub fn reserve_exact(&self, additional: usize) -> GResult<()>
[src]
pub fn reserve(&self, additional: usize) -> GResult<()>
[src]
pub fn shrink_to_fit(&self) -> GResult<()>
[src]
pub fn truncate(&self, len: usize) -> GResult<()>
[src]
pub fn clear(&self) -> GResult<()>
[src]
pub fn extend<I, C>(&self, source: I) -> GResult<()> where
I: IntoIterator<Item = C>,
C: IntoElement<Slot>,
[src]
I: IntoIterator<Item = C>,
C: IntoElement<Slot>,
pub fn is_empty(&self) -> bool
[src]
pub fn iter<'a>(&'a self) -> IterDeque<'a, Self>ⓘ where
Self: DequeAccess<usize>,
[src]
Self: DequeAccess<usize>,
pub fn iter_to<'a, R: FromElement<Self::Element>>(
&'a self
) -> IterDequeTo<'a, Self, R>ⓘNotable traits for IterDequeTo<'a, T, R>
impl<'a, T: DequeAccess<usize>, R: FromElement<T::Element>> Iterator for IterDequeTo<'a, T, R> type Item = GResult<R>;
where
Self: DequeAccess<usize>,
[src]
&'a self
) -> IterDequeTo<'a, Self, R>ⓘ
Notable traits for IterDequeTo<'a, T, R>
impl<'a, T: DequeAccess<usize>, R: FromElement<T::Element>> Iterator for IterDequeTo<'a, T, R> type Item = GResult<R>;
Self: DequeAccess<usize>,
impl FromVal for Deque
[src]
impl IntoVal for Deque
[src]
impl<'a> IntoVal for &'a Deque
[src]
impl<'a> IntoVal for &'a mut Deque
[src]
impl PartialEq<Deque> for Deque
[src]
impl Splay for Deque
[src]
impl StructuralPartialEq for Deque
[src]
Auto Trait Implementations
impl !RefUnwindSafe for Deque
[src]
impl !Send for Deque
[src]
impl !Sync for Deque
[src]
impl Unpin for Deque
[src]
impl !UnwindSafe for Deque
[src]
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Erased for T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,