Persson-dev/GDMC-2024
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Clean again

Browse Source
This commit is contained in:
Xeon0X
2024-06-23 21:36:54 +02:00
parent 230364a9a8
commit 67ef6fa8f8
1 changed files with 0 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
networks/roads_2/Road.py
View File

@@ -57,7 +57,6 @@ class Road:
def _surface(self): def _surface(self):
# Segments # Segments
for i in range(1, len(self.polyline.segments)): for i in range(1, len(self.polyline.segments)):
if len(self.polyline.segments[i].segment()) > 2: if len(self.polyline.segments[i].segment()) > 2:
for k in range(len(self.polyline.segments[i].points_thick_by_line)): for k in range(len(self.polyline.segments[i].points_thick_by_line)):
@@ -104,22 +103,6 @@ class Road:
circle_list = [[] for _ in range(len(circle))] circle_list = [[] for _ in range(len(circle))]
for j in range(len(circle)): for j in range(len(circle)):
for k in range(len(circle[j])): for k in range(len(circle[j])):
jj = j % 7
match jj:
case 0:
blob = 'pink_concrete'
case 1:
blob = 'red_concrete'
case 2:
blob = 'orange_concrete'
case 3:
blob = 'yellow_concrete'
case 4:
blob = 'green_concrete'
case 5:
blob = 'blue_concrete'
case 6:
blob = 'purple_concrete'
if circle[j][k].is_in_triangle(double_point_a, self.polyline.centers[i], double_point_b): if circle[j][k].is_in_triangle(double_point_a, self.polyline.centers[i], double_point_b):
circle_list[j].append(circle[j][k]) circle_list[j].append(circle[j][k])