PackageDelivery/PackageHandler.py at main · hash1khn/PackageDelivery · GitHub

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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
#ID:011027513
import csv
from Package import Package
from HashMap import HashMap

'''
************************************************************************************************
                        PackageHandler Class Pseudocode with BIG-O Analysis
                                TOTAL CLASS COMPLEXITY: O(N^2)
************************************************************************************************


        __init__ is used to initialize the class properties
************************************************************************************************
        __init__
        METHOD TIME COMPLEXITY: O(3) -> O(2+N) -> O(N)
        METHOD SPACE COMPLEXITY: O(N)
            INITIALIZE TOTAL_PACKAGES:  O(1) - self.location_names = [None] * 27
            INITIALIZE packages:        O(1) - self.raw_distance_data = []
            INITIALIZE build_packages_table_from_csv():   O(N)


        build_packages_table_from_csv loades the distances and package information from CSV Files
*************************************************************************************************
        initialize_location_name_data
        METHOD COMPLEXITY: O(3N) -> O(N)
            READ DIST. NAMES CSV:      O(N) - names_reader = csv.reader(file)
            READ PACKGE INFO FROM CSV: O(N) - raw_distance_names = list(names_reader)
            STORE DIST./PACKAGE INFO IN HashTable

'''


class PackageHandler:

    # Time-complexity: O(4) -> O(1)
    # Default Constructor
    # This will build a hashmap containing all the package data
    #
    def __init__(self):
        self.TOTAL_PACKAGES = 40
        self.packages = {}
        self.packages_hash_table = HashMap()
        self.build_packages_table_from_csv()

    def __iter__(self):
        return iter([package for id, package in self.packages.items()])

    # Time-complexity: O(1)
    # This method returns the number of packages the current set
    #
    def __len__(self):
        return len(self.packages)

    # Time-complexity: O(1)
    # This method adds a package to the current packages set
    # Method to insert item
    def insert(self, item):
        self.packages[item.id] = item

    # Time complexity: O(n + n) = O(2n) -> O(n)
    # This method loads in the distance names from the distances_names.csv file
    #   as well as the packages information from the packages.csv file
    #   and then uses that information to construct the location_address_to_names
    #   hashmap.
    def build_packages_table_from_csv(self):
        location_address_to_names = HashMap()

        with open("./data/distance_names.csv") as file:
            names_reader = csv.reader(file)
            raw_distance_names = list(names_reader)
            for entry in raw_distance_names:
                # Example
                # entry[1] -> 'Western Governors University'
                # entry[2] ->'4001 South 700 East'
                location_address_to_names.add(entry[2], entry[1])

        with open("./data/packages.csv") as file:
            packages_reader = csv.reader(file)
            raw_package_data = list(packages_reader)

        for entry in raw_package_data:
            if len(entry) > 1:
                self.insert(Package(id=entry[0], address_name=location_address_to_names.get(entry[1]), delivery_address=entry[1], deadline=entry[5],
                                    delivery_city=entry[2], delivery_zip=entry[4], weight=entry[6], status="AT THE HUB"))
                self.packages_hash_table.add(entry[0], Package(id=entry[0], address_name=location_address_to_names.get(entry[1]), delivery_address=entry[1], deadline=entry[5],
                                                               delivery_city=entry[2], delivery_zip=entry[4], weight=entry[6], status="AT THE HUB"))

    # Time complexity: O(1)
    # This method returns a package based on its ID
    def get_package_by_id(self, id):
        return self.packages_hash_table.get(id)

    # Time-complexity: O(n)
    # This method returns a list of packages matching the input address
    def get_packages_by_address(self, address):
        packages = list()
        for id in range(1, self.TOTAL_PACKAGES + 1):
            package = self.get_package_by_id(str(id))
            if (package.delivery_address == address):
                packages.append(package)
        return packages

    # Time-complexity: O(n)
    # This method returns a list of packages matching the input city
    def get_packages_by_city(self, city):
        packages = list()
        for id in range(1, self.TOTAL_PACKAGES + 1):
            package = self.get_package_by_id(str(id))
            if (package.delivery_city == city):
                packages.append(package)
        return packages

    # Time-complexity: O(n)
    # This method returns a list of packages matching the input deadline
    def get_packages_by_deadline(self, deadline):
        packages = list()
        for id in range(1, self.TOTAL_PACKAGES + 1):
            package = self.get_package_by_id(str(id))
            if (package.deadline == deadline):
                packages.append(package)
        return packages

    # Time-complexity: O(n)
    # This method returns a list of packages matching the input zip
    def get_packages_by_zip(self, zip):
        packages = list()
        for id in range(1, self.TOTAL_PACKAGES + 1):
            package = self.get_package_by_id(str(id))
            if (package.delivery_zip == zip):
                packages.append(package)
        return packages

    # Time-complexity: O(n)
    # This method returns a list of packages matching the input weight
    def get_packages_by_weight(self, weight):
        packages = list()
        for id in range(1, self.TOTAL_PACKAGES + 1):
            package = self.get_package_by_id(str(id))
            if (package.weight == weight):
                packages.append(package)
        return packages

    # Time-complexity: O(n)
    # This method returns a list of packages matching the input status
    def get_packages_by_status(self, status):
        packages = list()
        for id in range(1, self.TOTAL_PACKAGES + 1):
            package = self.get_package_by_id(str(id))
            if (package.status == status):
                packages.append(package)
        return packages