Struct MonoidActElement 

pub struct MonoidActElement<M>
where
    M: MonoidAct,
{
    pub key: M::Key,
    pub act: M::Act,
}

Fields

key: M::Key

act: M::Act

Implementations

impl<M> MonoidActElement<M>

where M: MonoidAct,

pub fn from_key(key: M::Key) -> Self

Examples found in repository

crates/competitive/src/data_structure/treap.rs (line 375)

    pub fn insert(&mut self, key: M::Key, value: L::Key) -> BstNodeId<TreapSpec<M, L>> {
        let (left, right) = TreapSpec::split(self.root.take(), SeekByKey::new(&key), false);
        let data = TreapData {
            priority: self.rng.rand64(),
            key: MonoidActElement::from_key(key),
            value: LazyMapElement::from_key(value),
        };
        let node = BstRoot::from_data(data, self.allocator.deref_mut());
        let node_id = self.node_id_manager.register(&node);
        self.root = TreapSpec::merge(TreapSpec::merge(left, Some(node)), right);
        node_id
    }

pub fn update_act<Spec>(node: BstDataMutRef<'_, Spec>, act: &M::Act)

where Spec: BstSpec<Data: BstDataAccess<MonoidAct, Value = Self>>,

Examples found in repository

crates/competitive/src/data_structure/treap.rs (line 483)

    pub fn update_key(&mut self, act: M::Act) {
        if let Some(node) = self.split3.mid_datamut() {
            MonoidActElement::<M>::update_act(node, &act);
            self.key_updated = true;
        }
    }

crates/competitive/src/data_structure/binary_search_tree/data.rs (line 100)

    pub fn top_down<Spec>(mut node: BstDataMutRef<'_, Spec>)
    where
        Spec: BstSpec<Data: BstDataAccess<marker::MonoidAct, Value = Self>>,
    {
        let act = replace(&mut node.data_mut().bst_data_mut().act, M::unit());
        if let Ok(left) = node.reborrow_datamut().left().descend() {
            Self::update_act(left, &act);
        }
        if let Ok(right) = node.reborrow_datamut().right().descend() {
            Self::update_act(right, &act);
        }
    }

pub fn top_down<Spec>(node: BstDataMutRef<'_, Spec>)

where Spec: BstSpec<Data: BstDataAccess<MonoidAct, Value = Self>>,

Examples found in repository

crates/competitive/src/data_structure/treap.rs (line 109)

    fn top_down(mut node: BstDataMutRef<'_, Self>) {
        MonoidActElement::<M>::top_down(node.reborrow_datamut());
        LazyMapElement::<L>::top_down(node.reborrow_datamut());
    }

Trait Implementations

impl<M> Debug for MonoidActElement<M>

where M: MonoidAct<Key: Debug, Act: Debug>,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.