Function sauron::prelude::mt_dom::diff::increment_node_idx_to_descendant_count

pub fn increment_node_idx_to_descendant_count<NS, TAG, ATT, VAL, EVENT>(
    node: &Node<NS, TAG, ATT, VAL, EVENT>, 
    cur_node_idx: &mut usize
) where
    TAG: PartialEq<TAG> + Clone + Debug,
    NS: PartialEq<NS> + Clone + Debug,
    ATT: PartialEq<ATT> + Clone + Debug,
    VAL: PartialEq<VAL> + Clone + Debug,
    EVENT: PartialEq<EVENT> + Clone + Debug, 

increment the cur_node_idx based on how many descendant it contains.

Note: This is not including the count of itself, since the node is being processed and the cur_node_idx is incremented in the loop together with its siblings TODO: this can be optimize by adding the children count and then descending into element node that has children only