rsip-dns 0.1.4

SIP Rust library implementing RFC 3263, implemented on top of rsip
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
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

use crate::resolvables::{ResolvableExt, ResolvableItem, ResolvableState};
use async_trait::async_trait;
use std::collections::VecDeque;

#[derive(Debug, Clone)]
pub struct Resolvable<T>(ResolvableInner<T>)
where
    T: ResolvableItem;

#[async_trait]
impl<T> ResolvableExt<T> for Resolvable<T>
where
    T: ResolvableItem,
{
    fn state(&self) -> ResolvableState {
        self.0.state()
    }

    async fn resolve_next(&mut self) -> Option<T> {
        self.0.resolve_next().await
    }
}

impl<T> Resolvable<T>
where
    T: ResolvableItem,
{
    pub fn unset() -> Self {
        Self(ResolvableInner::Unset)
    }

    pub fn empty() -> Self {
        Self(ResolvableInner::Empty)
    }

    pub fn non_empty(stuff: impl Into<VecDeque<T>>) -> Self {
        Self(ResolvableInner::NonEmpty(stuff.into()))
    }
}

impl<T> Default for Resolvable<T>
where
    T: ResolvableItem,
{
    fn default() -> Self {
        Self(Default::default())
    }
}

impl<T> From<Vec<T>> for Resolvable<T>
where
    T: ResolvableItem,
{
    fn from(from: Vec<T>) -> Self {
        Self(from.into())
    }
}

#[derive(Debug, Clone)]
enum ResolvableInner<T>
where
    T: ResolvableItem,
{
    Unset,
    Empty,
    NonEmpty(VecDeque<T>),
}

#[async_trait]
impl<T> ResolvableExt<T> for ResolvableInner<T>
where
    T: ResolvableItem,
{
    fn state(&self) -> ResolvableState {
        use ResolvableState::*;

        match self {
            Self::Unset => Unset,
            Self::Empty => Empty,
            Self::NonEmpty(_) => NonEmpty,
        }
    }

    async fn resolve_next(&mut self) -> Option<T> {
        match self {
            Self::Unset => None,
            Self::Empty => None,
            Self::NonEmpty(data) => {
                let element = data.pop_front();
                if data.is_empty() {
                    *self = Self::Empty
                }
                element
            }
        }
    }
}

impl<T> Default for ResolvableInner<T>
where
    T: ResolvableItem,
{
    fn default() -> Self {
        Self::Unset
    }
}

impl<T> From<Vec<T>> for ResolvableInner<T>
where
    T: ResolvableItem,
{
    fn from(from: Vec<T>) -> Self {
        if from.is_empty() {
            Self::Empty
        } else {
            Self::NonEmpty(from.into())
        }
    }
}