headson 0.17.0

Budget‑constrained JSON preview renderer
Documentation 
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

use crate::order::{PriorityOrder, RankedNode};

pub(crate) fn digits(mut n: usize) -> usize {
    if n == 0 {
        return 1;
    }
    let mut d = 0;
    while n > 0 {
        d += 1;
        n /= 10;
    }
    d
}

fn max_index_for_child(
    order: &PriorityOrder,
    flags: &[u32],
    rid: u32,
    child: usize,
) -> Option<usize> {
    if flags.get(child).copied().unwrap_or_default() != rid {
        return None;
    }
    match order.nodes[child] {
        RankedNode::AtomicLeaf { .. } | RankedNode::SplittableLeaf { .. } => {
            order.index_in_parent_array.get(child).and_then(|idx| *idx)
        }
        RankedNode::Array { .. } | RankedNode::Object { .. } => {
            Some(compute_max_index(order, flags, rid, child))
        }
        _ => None,
    }
}

pub(crate) fn compute_max_index(
    order: &PriorityOrder,
    flags: &[u32],
    rid: u32,
    id: usize,
) -> usize {
    let mut max_idx = 0usize;
    if let Some(kids) = order.children.get(id) {
        for &cid in kids.iter() {
            let child_id = cid.0;
            if let Some(child_max) =
                max_index_for_child(order, flags, rid, child_id)
            {
                if child_max > max_idx {
                    max_idx = child_max;
                }
            }
        }
    }
    max_idx
}