treaty -


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

use crate::{
    any::TypeName,
    effect::{Effect, Effective, ErasedEffective, ReadyExt as _},
    higher_ranked_type,
    hkt::Marker,
    protocol::{
        walker::hint::{HintMeta, Meta},
        DynVisitor,
    },
    Flow,
};

use super::VisitResult;

/// Protocol for visiting a sequence.
///
/// This protocol uses a scope to give temporary control to the visitor.
/// The visitor will drive the walker for each item.
pub trait Sequence<'ctx, E: Effect> {
    fn visit<'a: 'c, 'b: 'c, 'c>(
        &'a mut self,
        scope: DynSequenceScope<'b, 'ctx, E>,
    ) -> ErasedEffective<'c, VisitResult<DynSequenceScope<'b, 'ctx, E>>, E>
    where
        'ctx: 'a;
}

pub struct SequenceProto<E: Effect>(Marker<E>);

higher_ranked_type! {
    impl TypeName {
        impl['a, 'ctx, E] type T['a, 'ctx] for SequenceProto<E> =
            dyn Sequence<'ctx, E> + Send + Sync + 'a
        where {
            E: Effect
        };

        impl['a, 'ctx, E] type HigherRanked['a, 'ctx] for dyn Sequence<'ctx, E> + Send + Sync + 'a =
            SequenceProto<E>
        where {
            E: Effect
        };
    }
}

pub trait SequenceScope<'ctx, E: Effect> {
    fn size_hint(&mut self) -> ErasedEffective<'_, (usize, Option<usize>), E>;

    fn next<'a: 'c, 'b: 'c, 'c>(
        &'a mut self,
        visitor: DynVisitor<'b, 'ctx>,
    ) -> ErasedEffective<'c, Flow, E>
    where
        'ctx: 'c + 'a + 'b;
}

pub type DynSequenceScope<'a, 'ctx, E> = &'a mut (dyn SequenceScope<'ctx, E> + Send + Sync + 'a);

#[derive(Default)]
pub struct SequenceKnown {
    pub len: (usize, Option<usize>),
}

higher_ranked_type! {
    impl Meta {
        impl['a, 'ctx] type T['a, 'ctx] for SequenceKnown =
            SequenceKnown;

        impl['a, 'ctx] type HigherRanked['a, 'ctx] for SequenceKnown =
            SequenceKnown;
    }
}

pub struct SequenceHint {
    pub len: (usize, Option<usize>),
}

higher_ranked_type! {
    impl Meta {
        impl['a, 'ctx] type T['a, 'ctx] for SequenceHint =
            SequenceHint;

        impl['a, 'ctx] type HigherRanked['a, 'ctx] for SequenceHint =
            SequenceHint;
    }
}

impl<E: Effect> HintMeta for SequenceProto<E> {
    type Known = SequenceKnown;

    type Hint = SequenceHint;

    type Effect = E;
}

#[inline(always)]
pub fn visit_sequence<'a, 'ctx, E: Effect>(
    visitor: DynVisitor<'a, 'ctx>,
    scope: DynSequenceScope<'a, 'ctx, E>,
) -> ErasedEffective<'a, VisitResult<DynSequenceScope<'a, 'ctx, E>>, E> {
    if let Some(object) = visitor.0.upcast_mut::<SequenceProto<E>>() {
        // Allow the visitor to give a hint if it wants.
        object.visit(scope)
    } else {
        // If the visitor doesn't support request hint then we continue.
        VisitResult::Skipped(scope).ready()
    }
}