resiliparse 1.0.1

A collection of robust and fast processing tools for parsing and analyzing (not only) web archive data.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149

// Copyright 2023 Janek Bevendorff
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

//! Tree traversal tools.
//!
//! Tools for iterating DOM (sub) trees.

use crate::parse::html::dom::node::{ElementNode, Node, NodeRef};
use crate::parse::html::dom::traits::{NodeInterface, NodeInterfaceBaseImpl};
use crate::parse::html::dom::wrap_any_raw_node;
use crate::third_party::lexbor::*;
use parking_lot::ReentrantMutex;
use std::ptr;

pub(crate) struct NodeIteratorRaw {
    root: ReentrantMutex<*mut lxb_dom_node_t>,
    next_node: ReentrantMutex<*mut lxb_dom_node_t>,
}

unsafe impl Send for NodeIteratorRaw {}
unsafe impl Sync for NodeIteratorRaw {}

impl NodeIteratorRaw {
    pub(crate) unsafe fn new(root: *mut lxb_dom_node_t) -> Self {
        Self {
            root: ReentrantMutex::new(root),
            next_node: ReentrantMutex::new(root),
        }
    }
}

impl Iterator for NodeIteratorRaw {
    type Item = *mut lxb_dom_node_t;

    fn next(&mut self) -> Option<Self::Item> {
        let next = self.next_node.get_mut();
        let root = self.root.get_mut();
        if next.is_null() || root.is_null() {
            return None;
        }

        let return_node = next.clone();
        unsafe {
            if !(*(*next)).first_child.is_null() {
                *next = (*(*next)).first_child;
            } else {
                while next != root && (*(*next)).next.is_null() {
                    *next = (*(*next)).parent;
                }
                if next == root {
                    *next = ptr::null_mut();
                    return Some(return_node);
                }
                *next = (*(*next)).next;
            }
        }
        Some(return_node)
    }
}

// -------------------------------------- Generic Iterators ----------------------------------------

macro_rules! impl_iterator_for {
    ($Self: ty) => {
        impl Iterator for $Self {
            type Item = Node;

            fn next(&mut self) -> Option<Self::Item> {
                wrap_any_raw_node(&self.root.tree_(), self.iterator_raw.next()?)
            }
        }
    };
}

pub struct NodeIterator<'a> {
    root: NodeRef<'a>,
    iterator_raw: NodeIteratorRaw,
}

impl<'a> NodeIterator<'a> {
    pub(crate) fn new(root: NodeRef<'a>) -> Self {
        let ptr = *root.node_ptr_();
        Self {
            root,
            iterator_raw: unsafe { NodeIteratorRaw::new(ptr) },
        }
    }
}

impl_iterator_for!(NodeIterator<'_>);

pub struct NodeIteratorOwned {
    root: Node,
    iterator_raw: NodeIteratorRaw,
}

impl NodeIteratorOwned {
    pub(crate) fn new(root: Node) -> Self {
        let ptr = root.node_ptr_().clone();
        Self {
            root,
            iterator_raw: unsafe { NodeIteratorRaw::new(ptr) },
        }
    }
}

impl_iterator_for!(NodeIteratorOwned);

// --------------------------------------- ElementIterator -----------------------------------------

pub struct ElementIterator<'a> {
    root: &'a dyn NodeInterface,
    iterator_raw: NodeIteratorRaw,
}

impl<'a> ElementIterator<'a> {
    pub(crate) fn new(root: &'a dyn NodeInterface) -> Self {
        Self {
            root,
            iterator_raw: unsafe { NodeIteratorRaw::new(*root.node_ptr_()) },
        }
    }
}

impl Iterator for ElementIterator<'_> {
    type Item = ElementNode;

    fn next(&mut self) -> Option<Self::Item> {
        let tree = &self.root.tree_();
        while let Some(next) = unsafe { self.iterator_raw.next()?.as_ref() } {
            if next.type_ != lxb_dom_node_type_t::LXB_DOM_NODE_TYPE_ELEMENT {
                continue;
            }
            return Some(ElementNode::new(&tree, self.iterator_raw.next()?));
        }
        None
    }
}