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
129
130
131
132
use std::borrow::Cow;
use std::collections::HashMap;
use std::collections::hash_map::Entry;

use crate::data::dynamic::DynData;

pub trait BlockLogic
{
	fn get_size(&self) -> u8;
	
	fn is_symmetric(&self) -> bool
	{
		true
	}
	
	fn state_from_i32(&self, _config: i32) -> DynData
	{
		DynData::Empty
	}
}

pub struct Block
{
	name: Cow<'static, str>,
	logic: Box<dyn BlockLogic>,
}

impl Block
{
	pub fn new(name: Cow<'static, str>, logic: Box<dyn BlockLogic>) -> Self
	{
		Self{name, logic}
	}
	
	pub fn get_name(&self) -> &str
	{
		&self.name
	}
	
	pub fn get_size(&self) -> u8
	{
		self.logic.get_size()
	}
	
	pub fn is_symmetric(&self) -> bool
	{
		self.logic.is_symmetric()
	}
	
	pub fn state_from_i32(&self, config: i32) -> DynData
	{
		self.logic.state_from_i32(config)
	}
}

#[derive(Clone, Copy, Debug, Eq, PartialEq)]
pub enum Rotation
{
	Right, Up, Left, Down
}

impl From<u8> for Rotation
{
	fn from(val: u8) -> Self
	{
		match val & 3
		{
			0 => Rotation::Right,
			1 => Rotation::Up,
			2 => Rotation::Left,
			_ => Rotation::Down,
		}
	}
}

impl From<Rotation> for u8
{
	fn from(rot: Rotation) -> Self
	{
		match rot
		{
			Rotation::Right => 0,
			Rotation::Up => 1,
			Rotation::Left => 2,
			Rotation::Down => 3,
		}
	}
}

pub struct BlockRegistry<'l>
{
	blocks: HashMap<&'l str, &'l Block>,
}

impl<'l> BlockRegistry<'l>
{
	pub fn new() -> Self
	{
		Self{blocks: HashMap::new()}
	}
	
	pub fn register(&mut self, block: &'l Block) -> Result<(), &'l Block>
	{
		let key = match block.name
		{
			Cow::Borrowed(r) => r,
			Cow::Owned(ref s) => s,
		};
		match self.blocks.entry(key)
		{
			Entry::Occupied(e) => Err(e.get()),
			Entry::Vacant(e) =>
			{
				e.insert(block);
				Ok(())
			},
		}
	}
	
	pub fn get(&self, name: &str) -> Option<&'l Block>
	{
		self.blocks.get(name).map(|&r| r)
	}
}

impl<'l> AsRef<HashMap<&'l str, &'l Block>> for BlockRegistry<'l>
{
	fn as_ref(&self) -> &HashMap<&'l str, &'l Block>
	{
		&self.blocks
	}
}