2019SZI-Projekt/UI/window.py

113 lines
3.4 KiB
Python
Raw Normal View History

import pygame as pg
2019-04-25 20:56:02 +02:00
import numpy as np
2019-04-25 18:25:37 +02:00
import random
2019-06-09 13:25:00 +02:00
import itertools as it
import math
2019-04-29 13:49:54 +02:00
from UI.grid import Grid, Node
2019-05-01 02:21:02 +02:00
from Logic.Apath import a_path
2019-04-08 12:16:50 +02:00
class Window():
2019-04-28 16:13:41 +02:00
def __init__(self, grid: Grid,start: (int,int),end: (int,int),mode: int):
2019-06-09 13:25:00 +02:00
2019-04-28 16:09:06 +02:00
self.start = start
self.end = end
self.grid = grid
2019-04-28 16:09:06 +02:00
# assign to variables for brevity
2019-04-08 01:15:47 +02:00
cols = self.grid.cols
rows = self.grid.rows
width = Node.r_width
height = Node.r_height
margin = Node.r_margin
2019-04-28 16:09:06 +02:00
screen_width = cols * (width + margin) + 2 * margin
screen_height = rows * (height + margin) + 2 * margin
self.screen = pg.display.set_mode([screen_width, screen_height])
self.end = False
self.clock = pg.time.Clock()
2019-04-28 16:09:06 +02:00
2019-04-29 12:51:48 +02:00
def obstacles(self, grid: Grid,option: int):
2019-04-28 16:09:06 +02:00
if option == 1:
2019-06-09 13:25:00 +02:00
for x in range(len(grid.table)*2):
2019-06-09 12:13:31 +02:00
grid.generate_trash(random.randint(1,len(grid.table)-1),random.randint(1,len(grid.table)-1))
2019-04-29 12:51:48 +02:00
elif option == 2:
2019-04-28 16:09:06 +02:00
for x in range (13):
grid.change_field(x,14,3)
for x in range (8):
grid.change_field(12,x+6,3)
2019-04-25 18:25:37 +02:00
2019-04-29 12:51:48 +02:00
obstacles(self,grid,mode)
2019-04-28 16:09:06 +02:00
grid.change_field(start[0], start[1], 1)
grid.change_field(end[0], end[1], 2)
2019-06-09 13:25:00 +02:00
2019-04-25 18:25:37 +02:00
2019-06-09 12:13:31 +02:00
#list of trash to collect
to_collect = grid.get_trash_possition(5)
2019-06-09 13:25:00 +02:00
print("to collect len: ",len(to_collect))
#sort list of tuples to get minimum distance betwen all of them
#fajnie jakby sie udalo to zrobic wydajniej ale narazie niech bedzie tak
2019-06-09 12:13:31 +02:00
sorted(to_collect)
2019-06-09 13:25:00 +02:00
pg.init() # pylint: disable=no-member
# setup window
pg.display.set_caption('Inteligentna śmieciarka')
#draw starting map
self.grid.draw_map(self.screen)
2019-06-09 12:13:31 +02:00
2019-06-09 13:37:29 +02:00
#move of the truck
def move_truck(path):
for index, t in enumerate(path):
x,y =t
if index != 0:
self.grid.change_field(path[index-1][0],path[index-1][1],4)
self.grid.change_field(x, y, 1)
self.grid.draw_node(self.screen, path[index-1][0],path[index-1][1])
self.grid.draw_node(self.screen, x, y)
pg.time.delay(500)
#visit all points from from to_collect
2019-06-09 12:13:31 +02:00
for ind, x in enumerate(to_collect):
#copy table
2019-06-09 13:37:29 +02:00
obs = [3,8,6,7]
2019-06-09 12:13:31 +02:00
if ind == 0:
array = [[self.grid.table[col][row] for row in range(cols)] for col in range(rows)]
path = a_path(array,(start[0],start[1]),(x[0],x[1]),obs)
print("Path:",path)
else:
array = [[self.grid.table[col][row] for row in range(cols)] for col in range(rows)]
path = a_path(array,(to_collect[ind-1][0],to_collect[ind-1][1]),(x[0],x[1]),obs)
print("Path:",path)
2019-06-09 13:37:29 +02:00
2019-06-09 12:13:31 +02:00
#draw movement of garbage truck
2019-06-09 13:37:29 +02:00
move_truck(path)
#last move
array = [[self.grid.table[col][row] for row in range(cols)] for col in range(rows)]
path = a_path(array,(to_collect[len(to_collect)-1][0],to_collect[len(to_collect)-1][1]),(end[0],end[1]),obs)
print("Path:",path)
move_truck(path)
2019-04-28 16:13:41 +02:00
2019-04-15 12:54:29 +02:00
pg.quit() # pylint: disable=no-member