zjhttpc 0.12.0

HTTP client made by Jinhui ZHANG. Aims at easy to use, with special features I want
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

use std::any::Any;
use std::pin::Pin;
use std::task::{Context, Poll};

use async_std::{io, net::TcpStream};
use async_tls::client::TlsStream;

pub trait AsAny {
	fn as_any(&self) -> &dyn Any;
	fn as_any_mut(&mut self) -> &mut dyn Any;
}
pub trait RWStream: io::Read + io::Write + Unpin + Sync + Send + 'static {}
impl<T: Any + RWStream> AsAny for T {
	fn as_any(&self) -> &dyn Any {
		return self;
	}

	fn as_any_mut(&mut self) -> &mut dyn Any {
		return self;
	}
}

impl RWStream for TcpStream {}
impl RWStream for TlsStream<TcpStream> {}
impl RWStream for TlsStream<BoxedStream> {}
pub trait AnyStream: RWStream + AsAny {}
impl<T: RWStream + AsAny> AnyStream for T {}
pub type BoxedStream = Box<dyn AnyStream>;

/// Read-only boxed stream. Used for response body streams that don't need Write.
pub type ReadStream = Box<dyn async_std::io::Read + Unpin + Send + Sync>;

/// Chains two async `Read` streams: reads `first` to EOF, then reads `second`.
pub struct ChainRead<A, B> {
	first: Option<A>,
	second: B,
}

impl<A, B> ChainRead<A, B> {
	pub fn new(first: A, second: B) -> Self {
		Self {
			first: Some(first),
			second,
		}
	}

	pub fn into_second(self) -> B {
		self.second
	}
}

impl<A: io::Read + Unpin, B: io::Read + Unpin> io::Read for ChainRead<A, B> {
	fn poll_read(
		mut self: Pin<&mut Self>, cx: &mut Context<'_>, buf: &mut [u8],
	) -> Poll<io::Result<usize>> {
		if let Some(first) = &mut self.first {
			match Pin::new(first).poll_read(cx, buf) {
				Poll::Ready(Ok(0)) => {
					self.first = None;
				}
				other => return other,
			}
		}
		Pin::new(&mut self.second).poll_read(cx, buf)
	}
}

/// A trivial async `Read` over a byte slice (no heap allocation).
pub struct SliceRead {
	data: [u8; 4096],
	len: usize,
	pos: usize,
}

impl SliceRead {
	pub fn new(data: &[u8]) -> Self {
		let mut buf = [0u8; 4096];
		let len = data.len().min(4096);
		buf[..len].copy_from_slice(&data[..len]);
		Self {
			data: buf,
			len,
			pos: 0,
		}
	}
}

impl io::Read for SliceRead {
	fn poll_read(
		mut self: Pin<&mut Self>, _cx: &mut Context<'_>, buf: &mut [u8],
	) -> Poll<io::Result<usize>> {
		if self.pos >= self.len {
			return Poll::Ready(Ok(0));
		}
		let n = std::cmp::min(self.len - self.pos, buf.len());
		buf[..n].copy_from_slice(&self.data[self.pos..self.pos + n]);
		self.pos += n;
		Poll::Ready(Ok(n))
	}
}