Struct rustc::middle::subst::VecPerParamSpace[src]
pub struct VecPerParamSpace<T> {
// some fields omitted
}Vector of things sorted by param space. Used to keep the set of things declared on the type, self, or method distinct.
Methods
impl<T> VecPerParamSpace<T>
fn empty() -> VecPerParamSpace<T>
fn params_from_type(types: Vec<T>) -> VecPerParamSpace<T>
fn new(t: Vec<T>, s: Vec<T>, f: Vec<T>) -> VecPerParamSpace<T>
fn sort(t: Vec<T>, space: |&T| -> ParamSpace) -> VecPerParamSpace<T>
fn push(&mut self, space: ParamSpace, value: T)
fn get_self<'a>(&'a self) -> Option<&'a T>
fn len(&self, space: ParamSpace) -> uint
fn get_vec<'a>(&'a self, space: ParamSpace) -> &'a Vec<T>
fn get_mut_vec<'a>(&'a mut self, space: ParamSpace) -> &'a mut Vec<T>
fn opt_get<'a>(&'a self, space: ParamSpace, index: uint) -> Option<&'a T>
fn get<'a>(&'a self, space: ParamSpace, index: uint) -> &'a T
fn get_mut<'a>(&'a mut self, space: ParamSpace, index: uint) -> &'a mut T
fn iter<'a>(&'a self) -> Chain<Items<'a, T>, Chain<Items<'a, T>, Items<'a, T>>>
fn all_vecs(&self, pred: |&Vec<T>| -> bool) -> bool
fn all(&self, pred: |&T| -> bool) -> bool
fn any(&self, pred: |&T| -> bool) -> bool
fn is_empty(&self) -> bool
fn map<U>(&self, pred: |&T| -> U) -> VecPerParamSpace<U>
fn map_rev<U>(&self, pred: |&T| -> U) -> VecPerParamSpace<U>
Executes the map but in reverse order. For hacky reasons, we rely on this in table.
FIXME(#5527) -- order of eval becomes irrelevant with newer trait reform, which features an idempotent algorithm that can be run to a fixed point