mindus - mindustry logic execution, map- and schematic- parsing and rendering


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
120
121
122
123
124
125
126
127
128

use std::borrow::Borrow;
use std::cmp::Ordering;
use std::fmt;
use std::hash::{Hash, Hasher};
use std::ops::Deref;

pub type BoxAccess<'a, D> = Access<'a, Box<D>, D>;

// Similar to Cow but doesn't require ToOwned
#[derive(Clone, Debug)]
pub enum Access<'a, T: AsRef<B>, B: ?Sized>
{
    Borrowed(&'a B),
    Owned(T),
}

impl<'a, T: AsRef<B>, B> Access<'a, T, B>
{
	pub const fn is_borrowed(&self) -> bool
	{
		match self
		{
			Self::Borrowed(..) => true,
			_ => false,
		}
	}
	
	pub const fn is_owned(&self) -> bool
	{
		match self
		{
			Self::Owned(..) => true,
			_ => false,
		}
	}
}

impl<'a, T: AsRef<B>, B: ?Sized> From<T> for Access<'a, T, B>
{
	fn from(value: T) -> Self
	{
		Self::Owned(value)
	}
}

impl<'a, T: AsRef<B>, B: ?Sized> AsRef<B> for Access<'a, T, B>
{
	fn as_ref(&self) -> &B
	{
		self
	}
}

impl<'a, T: AsRef<B>, B: ?Sized> Borrow<B> for Access<'a, T, B>
{
	fn borrow(&self) -> &B
	{
		match self
		{
			Self::Borrowed(r) => *r,
			Self::Owned(v) => v.as_ref(),
		}
	}
}

impl<'a, T: AsRef<B> + Default, B: ?Sized> Default for Access<'a, T, B>
{
	fn default() -> Self
	{
		Self::Owned(T::default())
	}
}

impl<'a, T: AsRef<B>, B: ?Sized> Deref for Access<'a, T, B>
{
	type Target = B;
	
	fn deref(&self) -> &Self::Target
	{
		match self
		{
			Self::Borrowed(r) => *r,
			Self::Owned(v) => v.as_ref(),
		}
	}
}

impl<'a, T: AsRef<B>, B: ?Sized + fmt::Display> fmt::Display for Access<'a, T, B>
{
	fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result
	{
		B::fmt(self, f)
	}
}

impl<'a, T: AsRef<B>, B: ?Sized + Eq> Eq for Access<'a, T, B> {}

impl<'a, T: AsRef<B>, B: ?Sized + Hash> Hash for Access<'a, T, B>
{
	fn hash<H: Hasher>(&self, state: &mut H)
	{
		B::hash(self, state)
	}
}

impl<'a, T: AsRef<B>, B: ?Sized + Ord> Ord for Access<'a, T, B>
{
	fn cmp(&self, other: &Self) -> Ordering
	{
		B::cmp(self, other)
	}
}

impl<'a, 'b, T: AsRef<B>, B: ?Sized + PartialEq<C>, U: AsRef<C>, C: ?Sized> PartialEq<Access<'b, U, C>> for Access<'a, T, B>
{
	fn eq(&self, other: &Access<'b, U, C>) -> bool
	{
		B::eq(self, other)
	}
}

impl<'a, 'b, T: AsRef<B>, B: ?Sized + PartialOrd<C>, U: AsRef<C>, C: ?Sized> PartialOrd<Access<'b, U, C>> for Access<'a, T, B>
{
	fn partial_cmp(&self, other: &Access<'b, U, C>) -> Option<Ordering>
	{
		B::partial_cmp(self, other)
	}
}