From 8f06d4e1ee3018f5202716da471b2b699bb43474 Mon Sep 17 00:00:00 2001
From: AntonObersteiner <anton.obersteiner@gmail.com>
Date: Sun, 2 Jun 2024 21:10:30 +0200
Subject: [PATCH] split choice network stuff into separate file

---
 choice_network.py | 75 +++++++++++++++++++++++++++++++++++++++++++++++
 generate.py       | 74 ++--------------------------------------------
 2 files changed, 77 insertions(+), 72 deletions(-)
 create mode 100644 choice_network.py

diff --git a/choice_network.py b/choice_network.py
new file mode 100644
index 0000000..67edccf
--- /dev/null
+++ b/choice_network.py
@@ -0,0 +1,75 @@
+#!/usr/bin/python3
+
+from random import randint, random, choice
+
+class Choice:
+	def __init__(self, **data):
+		""" stores a dict.
+		the keys are strings that indicate the next state,
+		the values are lists that store the possible emissions in transition to that new state.
+		"""
+		self.data = data
+		self.new_states = list(self.data.keys())
+
+	def choose(self):
+		new_state = choice(self.new_states)
+		emission = choice(self.data[new_state])
+		return new_state, emission
+
+class SingleArgChoice:
+	def __init__(self, kwarg):
+		if len(kwarg) != 1:
+			raise ValueError(
+				f"{self.__class__.__name__} takes exactly one keyword argument!"
+			)
+		for self.next_state, self.value in kwarg.items():
+			pass
+
+class RandInt(SingleArgChoice):
+	def __init__(self, **kwarg):
+		super().__init__(kwarg)
+		assert len(self.value) == 2
+		assert type(self.value[0]) == int
+		assert type(self.value[1]) == int
+
+		self.minimum = self.value[0]
+		self.maximum = self.value[1]
+
+	def choose(self):
+		number = randint(self.minimum, self.maximum)
+		return self.next_state, f"{number} "
+
+class FixedText(SingleArgChoice):
+	def __init__(self, **kwarg):
+		super().__init__(kwarg)
+		self.text = self.value
+
+	def choose(self):
+		return self.next_state, self.text
+
+class Network:
+	def __init__(self, **choices):
+		""" takes a dict,
+		the keys are strings that name states,
+		the values are the choices for new states and emissions possible in these states.
+		the 'start' state and the 'stop' state have their respective special roles.
+		"""
+		self.choices = choices
+		self.recursion_warning = 100
+
+	def choose(self):
+		state = 'start'
+		emissions = []
+		states = [state]
+		while state != 'stop':
+			state, emission = self.choices[state].choose()
+			emissions.append(emission)
+			states.append(states)
+			if len(emissions) > self.recursion_warning:
+				raise RecursionError(
+					"there are over a hundred emissions. probably a bug!"
+				)
+
+		return emissions, states
+
+
diff --git a/generate.py b/generate.py
index d581cfa..e52372d 100755
--- a/generate.py
+++ b/generate.py
@@ -2,6 +2,8 @@
 
 from random import randint, random, choice
 
+from choice_network import Choice, FixedText, RandInt, Network
+
 
 greeting = """
 Englisch version below.
@@ -21,82 +23,10 @@ Hi, we have two students matching the criteria from the database and a certain a
 Maybe you can filter it with regular expressions? Good luck.
 """
 
-def matriculation_number():
-	return randint(40_000_000, 55_000_000)
 # fünf Tatverdächtige
 # Uhrzeiten, siehe Infos von Verantwortlichen
 # Groß-Klein-Schreibung
 
-class Choice:
-	def __init__(self, **data):
-		""" stores a dict.
-		the keys are strings that indicate the next state,
-		the values are lists that store the possible emissions in transition to that new state.
-		"""
-		self.data = data
-		self.new_states = list(self.data.keys())
-
-	def choose(self):
-		new_state = choice(self.new_states)
-		emission = choice(self.data[new_state])
-		return new_state, emission
-
-class SingleArgChoice:
-	def __init__(self, kwarg):
-		if len(kwarg) != 1:
-			raise ValueError(
-				f"{self.__class__.__name__} takes exactly one keyword argument!"
-			)
-		for self.next_state, self.value in kwarg.items():
-			pass
-
-class RandInt(SingleArgChoice):
-	def __init__(self, **kwarg):
-		super().__init__(kwarg)
-		assert len(self.value) == 2
-		assert type(self.value[0]) == int
-		assert type(self.value[1]) == int
-
-		self.minimum = self.value[0]
-		self.maximum = self.value[1]
-
-	def choose(self):
-		number = randint(self.minimum, self.maximum)
-		return self.next_state, f"{number} "
-
-class FixedText(SingleArgChoice):
-	def __init__(self, **kwarg):
-		super().__init__(kwarg)
-		self.text = self.value
-
-	def choose(self):
-		return self.next_state, self.text
-
-class Network:
-	def __init__(self, **choices):
-		""" takes a dict,
-		the keys are strings that name states,
-		the values are the choices for new states and emissions possible in these states.
-		the 'start' state and the 'stop' state have their respective special roles.
-		"""
-		self.choices = choices
-		self.recursion_warning = 100
-
-	def choose(self):
-		state = 'start'
-		emissions = []
-		states = [state]
-		while state != 'stop':
-			state, emission = self.choices[state].choose()
-			emissions.append(emission)
-			states.append(states)
-			if len(emissions) > self.recursion_warning:
-				raise RecursionError(
-					"there are over a hundred emissions. probably a bug!"
-				)
-
-		return emissions, states
-
 network = Network(
 	start = Choice(
 		student = ["Student ", "Studentin ", "", "Studierende:r "],