forked from UNN/2026-rff_mp
321 lines
7.5 KiB
Python
321 lines
7.5 KiB
Python
head = None
|
||
|
||
#node1 = {'name' : 'Ivan', 'phone' : '123-456', 'next' : None}
|
||
#head = node1
|
||
|
||
#node2 = {'name' : 'Dima', 'phone' : '789-123', 'next' : None}
|
||
#node1['next'] = node2
|
||
|
||
def ll_insert(head, name, phone):
|
||
|
||
curent = head
|
||
while curent is not None:
|
||
if curent['name'] == name:
|
||
curent['phone'] = phone
|
||
return head
|
||
curent = curent['next']
|
||
|
||
|
||
n_node = {'name' : name, 'phone' : phone, 'next' : None}
|
||
|
||
if head is None:
|
||
return n_node
|
||
|
||
curent = head
|
||
while curent['next'] is not None:
|
||
curent = curent['next']
|
||
curent['next'] = n_node
|
||
return head
|
||
|
||
|
||
|
||
print("====== TESTING ll_insert FUNC ========")
|
||
head = ll_insert(head,'Ivan','123-456')
|
||
|
||
print(head)
|
||
|
||
head = ll_insert(head, 'Boris', '123-456')
|
||
|
||
print(head)
|
||
|
||
head = ll_insert(head, 'Ivan', '321-654')
|
||
|
||
print(head)
|
||
|
||
head = ll_insert(head, 'Dima', '345-678')
|
||
|
||
print(head)
|
||
|
||
head = ll_insert(head, 'Boris', '111-222')
|
||
|
||
print(head)
|
||
|
||
head = ll_insert(head, 'Methody', '221-112')
|
||
|
||
head = ll_insert(head, 'Kiril', '112-221')
|
||
|
||
print(f"======= END TEST =======\n\n\n")
|
||
|
||
|
||
def ll_find(head, name):
|
||
curent = head
|
||
while curent is not None:
|
||
if curent['name'] == name:
|
||
return curent['phone']
|
||
curent = curent['next']
|
||
return None
|
||
|
||
print("====== TESTING ll_find FUNC ======")
|
||
|
||
print("Ivan`s phone: "+ ll_find(head, 'Ivan'))
|
||
|
||
print("Dima`s phone: "+ ll_find(head, 'Dima'))
|
||
|
||
print("Boris phone: "+ ll_find(head, 'Boris'))
|
||
|
||
print(f"====== END TEST ======\n\n\n")
|
||
|
||
|
||
def ll_delete(head, name):
|
||
if head is None:
|
||
return None
|
||
|
||
if head['name'] == name:
|
||
return head['next']
|
||
|
||
prev = head
|
||
curent = head['next']
|
||
while curent is not None:
|
||
if curent['name'] == name:
|
||
prev['next'] = curent['next']
|
||
return head
|
||
prev = curent
|
||
curent = curent['next']
|
||
return head
|
||
|
||
|
||
print("====== TEST ll_delete FUNC ======")
|
||
|
||
print("Del of Dima:", ll_delete(head, 'Dima'))
|
||
|
||
print("====== END TEST ======")
|
||
|
||
|
||
def ll_list_all(head):
|
||
records = []
|
||
curent = head
|
||
while curent is not None:
|
||
records.append((curent['name'],curent['phone']))
|
||
curent = curent['next']
|
||
records.sort(key=lambda pair: pair[0])
|
||
return records
|
||
|
||
print(f"\n\n\n\n")
|
||
|
||
print("====== TESTING ll_list_all FUNC ======")
|
||
|
||
print(ll_list_all(head))
|
||
|
||
print("====== END ======")
|
||
|
||
|
||
#============================== HASH FUNCTIONS =========================
|
||
SIZE = 5
|
||
buckets = [None] * SIZE
|
||
|
||
|
||
|
||
def hash_function(name, size):
|
||
return hash(name) % size
|
||
|
||
|
||
def ht_insert(buckets, name, phone):
|
||
index = hash_function(name, len(buckets))
|
||
head = buckets[index]
|
||
new_head = ll_insert(head, name, phone)
|
||
buckets[index] = new_head
|
||
|
||
print(f"\n\n\n ====== TEST INSERT HASH ======")
|
||
print(buckets)
|
||
ht_insert(buckets, "Ivan", "123-456")
|
||
print(buckets)
|
||
ht_insert(buckets, "Dima", "789-123")
|
||
print(buckets)
|
||
ht_insert(buckets, "Boris", "456-789")
|
||
print(buckets)
|
||
print("====== END TEST ======\n\n\n")
|
||
|
||
|
||
def ht_find(buckets, name):
|
||
index = hash_function(name, len(buckets))
|
||
head = buckets[index]
|
||
return ll_find(head, name)
|
||
|
||
print("====== TEST FIND HASH FUN ======")
|
||
print("find by name Ivan: ",ht_find(buckets, "Ivan"))
|
||
print("find by name Dima: ",ht_find(buckets, "Dima"))
|
||
print("find by name Boris: ", ht_find(buckets, "Boris"))
|
||
print("====== END TEST ======\n\n\n")
|
||
|
||
def ht_list_all(buckets):
|
||
all_records = []
|
||
for head in buckets:
|
||
current = head
|
||
while current is not None:
|
||
all_records.append((current['name'], current['phone']))
|
||
current = current['next']
|
||
all_records.sort(key=lambda x: x[0])
|
||
return all_records
|
||
|
||
|
||
print("====== TEST FUNC LIST ALL ======")
|
||
print(ht_list_all(buckets))
|
||
print("====== END TEST ======\n\n\n")
|
||
|
||
def ht_delete(buckets, name):
|
||
index = hash_function(name, len(buckets))
|
||
head = buckets[index]
|
||
new_head = ll_delete(head, name)
|
||
buckets[index] = new_head
|
||
|
||
|
||
print("====== GLOBAL TEST FOR HASH BASED FUN ======")
|
||
buckets = [None] * 10
|
||
|
||
ht_insert(buckets, "Ivan", "123-456")
|
||
print(buckets)
|
||
ht_insert(buckets, "Boris", "789-012")
|
||
print(buckets)
|
||
ht_insert(buckets, "Anna", "345-678")
|
||
print(buckets)
|
||
ht_insert(buckets, "Ivan", "111-222") # update
|
||
print(buckets)
|
||
|
||
print("Find Ivan`s phone: ",ht_find(buckets, "Ivan")) # 111-222
|
||
print("Find Petr`s phone: ",ht_find(buckets, "Petr")) # None
|
||
|
||
# Удаляем
|
||
print("delite Boris from buckets")
|
||
ht_delete(buckets, "Boris")
|
||
print("search Boris = ",ht_find(buckets, "Boris")) # None
|
||
|
||
# Все записи
|
||
print("list all records: ",ht_list_all(buckets))
|
||
print("====== END GLOBAL TEST ======\n\n\n")
|
||
|
||
|
||
|
||
# ======================== TREE FUNC ====================
|
||
|
||
def create_node(name,phone):
|
||
return {'name': name, 'phone': phone, 'left': None, 'right': None}
|
||
|
||
print("====== START TREE FUNC CHAPTER ======\n\n")
|
||
print("====== TEST CREATE NODE FUNC ======")
|
||
root = create_node('Ivan', '123-456')
|
||
print("Create Ivan node: ",root)
|
||
print("====== END TEST ====== \n\n\n")
|
||
|
||
def bst_insert(root, name, phone):
|
||
if root is None:
|
||
return create_node(name, phone)
|
||
|
||
if name == root['name']:
|
||
root[phone] = phone
|
||
elif name < root['name']:
|
||
root['left'] = bst_insert(root['left'], name, phone)
|
||
elif name >= root['name']:
|
||
root['right'] = bst_insert(root['right'], name , phone)
|
||
return root
|
||
|
||
print("====== TEST INSERT FUNC ======")
|
||
root = bst_insert(root, 'Dima', '456-789')
|
||
print("add Dima: ", root)
|
||
root = bst_insert(root, 'Boris', '789-123')
|
||
print("add Boris: ", root)
|
||
root = bst_insert(root, 'Eva', '321-123')
|
||
print("add Eva: ", root)
|
||
print("====== END TEST =======\n\n\n")
|
||
|
||
|
||
def bst_find(root, name):
|
||
if root is None:
|
||
return None
|
||
if name == root['name']
|
||
return root['phone']
|
||
elif name<root['name']:
|
||
return bst_find(root['left'], name)
|
||
else:
|
||
return bst_find(root['right'], name)
|
||
|
||
|
||
print("====== START FIND TEST ======")
|
||
print("search by Ivan`s phone: ", bst_find(root, 'Ivan'))
|
||
print("search by Eva`s phone: ", bst_find(root,'Eva'))
|
||
print("====== END TEST ====== \n\n\n")
|
||
|
||
|
||
|
||
def bst_delete(root,name):
|
||
if root is None:
|
||
return None
|
||
|
||
if name< root['name']:
|
||
root['left'] = bst_delete(root['left'], name)
|
||
elif name > root['name']:
|
||
root['right'] = bst_delete(root['right'], name)
|
||
|
||
else:
|
||
if root['left'] is None:
|
||
return root['right']
|
||
if root['right'] is None:
|
||
return root['rihgt']
|
||
|
||
min_node = find_min(root['right'])
|
||
root['name'] = min_node['name']
|
||
root['phone'] = min_node['phone']
|
||
|
||
root['right'] = bst_delete(root['right'], min_node['name'])
|
||
return root
|
||
|
||
|
||
|
||
def bst_list_all(root):
|
||
result = []
|
||
def inorder(node):
|
||
if node is None:
|
||
return
|
||
inorder(node['left'])
|
||
result.append((node['name'], node['phone']))
|
||
inorder(node['right'])
|
||
inorder(root)
|
||
return result
|
||
|
||
|
||
print("====== GLOBAL TEST TREES ======")
|
||
root = None
|
||
|
||
root = bst_insert(root, "Ivan", "123-456")
|
||
print("add Ivan: ", root)
|
||
root = bst_insert(root, "Boris", "789-012")
|
||
print("add Boris: ", root)
|
||
root = bst_insert(root, "Anna", "345-678")
|
||
print("add Anna: ", root)
|
||
root = bst_insert(root, "Ivan", "111-222") # обновление
|
||
print("update Ivan: ", root)
|
||
|
||
print("Find Ivan`s phone: ",bst_find(root, "Ivan")) # 111-222
|
||
print("Find Peter`s phone: ",bst_find(root, "Petr")) # None
|
||
|
||
root = bst_delete(root, "Boris")
|
||
print("Del Boris")
|
||
print("Find Boris: ",bst_find(root, "Boris")) # None
|
||
|
||
print("Find ALL: ",bst_list_all(root)) # [('Anna','345-678'), ('Ivan','111-222')]
|
||
|
||
|
||
print("====== END TEST ======")
|
||
|
||
|
||
|