Esempi in Python per UnorderedList

Esempio n. 1

 def test_add(self):
     data = [randint(0, 100) for i in range(10)]
     L = UnorderedList()
     for d in data:
         L.add(d)
     self.assertFalse(L.is_empty())
     self.assertEqual(sorted(data), sorted(self.get_data(L)))

Esempio n. 2

File: hash_separate_chaining.py Progetto: overide/Datastructure-and-Algorithm-with-Python

	def put(self,key,value):
		hash_value = self.hash_function(key,len(self.slot))
		if self.slot[hash_value] == None: # if slot is empty and no list is created yet!
			l = UnorderedList() # Create a list then add the key:value pair
			self.slot[hash_value] = l
			l.add(key,value)
		else:
			l = self.slot[hash_value] # if list is already present for hash value 
			if l.search(key):
				i = l.index(key)
				l.getNode(i).set_value(value) #replace
			else:
				l.add(key,value)

Esempio n. 3

File: deque.py Progetto: overide/Datastructure-and-Algorithm-with-Python

class Deque:

	def __init__(self):
		self.dq = UnorderedList()

	def add_rear(self,item):
		self.dq.add(item)

	def add_front(self,item):
		self.dq.append(item)

	def remove_rear(self):
		return self.dq.pop(0)

	def remove_front(self):
		return self.dq.pop()

	def size(self):
		return self.dq.size()

	def is_empty(self):
		return self.dq.is_empty()

	def show(self):
		print(self.dq)

Esempio n. 4

 def __init__(self, capacity=8):
     self._capacity = capacity
     self._table = []
     for index in range(self._capacity):
         self._table.append(UnorderedList())
     self._size = 0
     self._index = None

Esempio n. 5

 def test_remove(self):
     L = UnorderedList()
     data = [1, 2, 3, 4, 5]
     for d in data:
         L.add(d)
     L.remove(3)
     self.assertNotIn(3, self.get_data(L))
     L.remove(5)
     self.assertNotIn(5, self.get_data(L))

Esempio n. 6

File: queue.py Progetto: overide/Datastructure-and-Algorithm-with-Python

class Queue:

	def __init__(self):
		self.q = UnorderedList()

	def enque(self,items):
		self.q.add(items)

	def deque(self):
		return self.q.pop()

	def size(self):
		return self.q.size()

	def is_empty(self):
		return self.q.is_empty()

	def show(self):
		print(self.q)

Esempio n. 7

class Stack:
    def __init__(self):
        self.s = UnorderedList()

    def push(self, items):
        self.s.add(items)

    def pop_stack(self):
        return self.s.pop(0)

    def peek_stack(self):
        return self.s.head.get_data()

    def is_empty(self):
        return self.s.is_empty()

    def size(self):
        return self.s.size()

    def show(self):
        print(self.s)

Esempio n. 8

 def test_search(self):
     L = UnorderedList()
     data = [randint(0, 100) for i in range(10)]
     for d in data:
         L.add(d)
     self.assertTrue(all([L.search(i) for i in data]))
     self.assertFalse(all([L.search(i) for i in range(100, 110)]))

Esempio n. 9

class Deque:
    def __init__(self):
        self.dq = UnorderedList()

    def add_rear(self, item):
        self.dq.add(item)

    def add_front(self, item):
        self.dq.append(item)

    def remove_rear(self):
        return self.dq.pop(0)

    def remove_front(self):
        return self.dq.pop()

    def size(self):
        return self.dq.size()

    def is_empty(self):
        return self.dq.is_empty()

    def show(self):
        print(self.dq)

Esempio n. 10

 def __init__(self):
     self.s = UnorderedList()

Esempio n. 11

 def test_remove_with_one_element(self):
     L = UnorderedList()
     L.add(3)
     L.remove(3)
     self.assertNotIn(3, self.get_data(L))
     self.assertEqual(L.size(), 0)

Esempio n. 12

 def test_size(self):
     L = UnorderedList()
     for i in range(10):
         L.add(i)
     self.assertEqual(L.size(), 10)

Esempio n. 13

 def test_is_empty(self):
     L = UnorderedList()
     self.assertTrue(L.is_empty())
     L.add(32)
     self.assertFalse(L.is_empty())

Esempio n. 14

File: queue.py Progetto: overide/Datastructure-and-Algorithm-with-Python

	def __init__(self):
		self.q = UnorderedList()