Distributed-File-System/utils.py at main · AydanPirani/Distributed-File-System · 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
import re

# INTRODUCER_HOST = "fa22-cs425-3610.cs.illinois.edu"
INTRODUCER_HOST = "fa22-cs425-3601.cs.illinois.edu"

# map < str: map <int: list> >
fileStructure = None

class Status:
    NEW = 'NEW'
    RUNNING = 'RUNNING'
    LEAVE = 'LEAVE'

class Type:
    PING = "Ping"
    PONG = "Pong"
    JOIN = "Join"
    SEND = "Send"
    FILES = "Files"

# TODO: Change membership list SEND to be more descriptive
class SDFS_Type:
    PUT = "Put"
    GET = "Get"
    DELETE = "Delete"
    SEND_FILE = "Send_File"
    RECEIVE_FILE = "Receive_File"
    UPDATE_FILES = "Update_Files"
    ROUTE = "Route"
    UPDATE_PROCESS = "Update_Process"

class Field:
    TYPE = "Type"
    MEMBERSHIP = "Membership"

def get_neighbors(host):
    print(host)
    number = int(re.findall(r'36(.+).c', host)[0])
    predecessor = number - 1
    successor = number + 1
    for i in range(3):
        if i < 2:
            if predecessor < 1:
                yield "fa22-cs425-36%02d.cs.illinois.edu" % (10 + predecessor)
            else:
                yield "fa22-cs425-36%02d.cs.illinois.edu" % predecessor
            predecessor -= 1
        else:
            if successor > 10:
                yield "fa22-cs425-36%02d.cs.illinois.edu" % (successor - 10)
            else:
                yield "fa22-cs425-36%02d.cs.illinois.edu" % successor
            successor += 1


def get_all_hosts():
    l = []
    for i in range(1, 11):
        l.append("fa22-cs425-36%02d.cs.illinois.edu" % i)
    return l

def elem(s):
    return next(iter(s))