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
use core::str::from_utf8;
use super::iters::{DevTreeIndexIter, DevTreeIndexNodePropIter, DevTreeIndexNodeSiblingIter};
use super::tree::{DTINode, DevTreeIndex};
use crate::error::DevTreeError;
#[derive(Clone)]
pub struct DevTreeIndexNode<'a, 'i: 'a, 'dt: 'i> {
index: &'a DevTreeIndex<'i, 'dt>,
pub(super) node: &'a DTINode<'i, 'dt>,
}
impl<'a, 'i: 'a, 'dt: 'i> PartialEq for DevTreeIndexNode<'a, 'i, 'dt> {
fn eq(&self, other: &Self) -> bool {
self.index as *const DevTreeIndex == other.index as *const DevTreeIndex
&& self.node as *const DTINode == other.node as *const DTINode
}
}
impl<'a, 'i: 'a, 'dt: 'i> DevTreeIndexNode<'a, 'i, 'dt> {
pub(super) fn new(index: &'a DevTreeIndex<'i, 'dt>, node: &'a DTINode<'i, 'dt>) -> Self {
Self { node, index }
}
pub fn index(&self) -> &'a DevTreeIndex<'i, 'dt> {
self.index
}
pub fn name(&self) -> Result<&'dt str, DevTreeError> {
from_utf8(self.node.name).map_err(DevTreeError::StrError)
}
pub fn siblings(&self) -> DevTreeIndexNodeSiblingIter<'a, 'i, 'dt> {
DevTreeIndexNodeSiblingIter::from(DevTreeIndexIter::from_node(self.clone()))
}
pub fn props(&self) -> DevTreeIndexNodePropIter<'a, 'i, 'dt> {
DevTreeIndexNodePropIter(DevTreeIndexIter::from_node(self.clone()))
}
pub fn parent(&self) -> Option<Self> {
self.node.parent().map(|par| Self::new(self.index, par))
}
pub fn children(&self) -> DevTreeIndexNodeSiblingIter<'a, 'i, 'dt> {
match self.node.first_child() {
Some(child) => DevTreeIndexNodeSiblingIter::from(DevTreeIndexIter::from_node_include(
DevTreeIndexNode::new(self.index, child),
)),
None => DevTreeIndexNodeSiblingIter::from(DevTreeIndexIter::new_dead_iter(self.index)),
}
}
pub fn is_parent_of(&self, other: &Self) -> bool {
if let Some(parent) = &other.parent() {
return parent == self;
}
false
}
pub fn is_sibling_of(&self, other: &Self) -> bool {
other.parent() == self.parent()
}
}