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
use bytes::{
buf::{Chain, Take},
Bytes, BytesMut,
};
pub trait ExactSizeBuf {
fn len(&self) -> usize;
#[inline]
fn is_empty(&self) -> bool {
self.len() == 0
}
}
impl ExactSizeBuf for Bytes {
#[inline]
fn len(&self) -> usize {
Bytes::len(self)
}
#[inline]
fn is_empty(&self) -> bool {
Bytes::is_empty(self)
}
}
impl ExactSizeBuf for BytesMut {
#[inline]
fn len(&self) -> usize {
BytesMut::len(self)
}
#[inline]
fn is_empty(&self) -> bool {
BytesMut::is_empty(self)
}
}
impl ExactSizeBuf for [u8] {
#[inline]
fn len(&self) -> usize {
<[u8]>::len(self)
}
#[inline]
fn is_empty(&self) -> bool {
<[u8]>::is_empty(self)
}
}
impl<T, U> ExactSizeBuf for Chain<T, U>
where
T: ExactSizeBuf,
U: ExactSizeBuf,
{
fn len(&self) -> usize {
let first_ref = self.first_ref();
let last_ref = self.last_ref();
first_ref.len() + last_ref.len()
}
fn is_empty(&self) -> bool {
let first_ref = self.first_ref();
let last_ref = self.last_ref();
first_ref.is_empty() && last_ref.is_empty()
}
}
impl<T> ExactSizeBuf for Take<T>
where
T: ExactSizeBuf,
{
fn len(&self) -> usize {
let inner_ref = self.get_ref();
let limit = self.limit();
limit.min(inner_ref.len())
}
fn is_empty(&self) -> bool {
let inner_ref = self.get_ref();
let limit = self.limit();
(limit == 0) || inner_ref.is_empty()
}
}