2026-rff_mp/BudakovIS/docs/LinkedListPhoneBook.py

175 lines
3.5 KiB
Python
Raw Normal View History

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
2026-02-28 01:47:27 +00:00
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)
2026-02-28 02:02:47 +00:00
head = ll_insert(head, 'Methody', '221-112')
head = ll_insert(head, 'Kiril', '112-221')
2026-02-28 01:47:27 +00:00
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
2026-02-28 02:02:47 +00:00
print("====== TEST ll_delete FUNC ======")
2026-02-28 01:47:27 +00:00
print("Del of Dima:", ll_delete(head, 'Dima'))
2026-02-28 02:02:47 +00:00
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 ======")
# 2.hash tables
SIZE = 1000
buckets = [None] * SIZE
def hash_func(name):
return hash(name) % SIZE
def ht_insert(buckets, name, phone):
idx = hash_func(name)
buckets[idx] = ll_insert(buckets[idx], name, phone)
return buckets
def ht_find(buckets, name):
idx = hash_func(name)
return ll_find(buckets[idx], name)
def ht_delete(buckets, name):
idx = hash_func(name)
buckets[idx] = ll_delete(buckets[idx], name)
return buckets
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 pair: pair[0])
return all_records
print("---- TESTING BUCKETS ----")
buckets = ht_insert(buckets, 'Alice', '111-111')
buckets = ht_insert(buckets, 'Bob', '222-222')
buckets = ht_insert(buckets, 'Charlie', '333-333')
buckets = ht_insert(buckets, 'Alice', '999-999')
print(ht_find(buckets, 'Bob'))
print(ht_find(buckets, 'David'))
buckets = ht_delete(buckets, 'Bob')
print(ht_find(buckets, 'Bob'))
print(ht_list_all(buckets))