def test_linear_search(self): array = np.random.rand(50, 1) found = plot_gtex.linear_search(array[0], array) self.assertEqual(0, found) r = plot_gtex.linear_search(100, array) self.assertEqual(r, -1)
def test_linear_search(self): L = [1, 2, 3, 4, 5, 6] r = plot_gtex.linear_search(3, L) self.assertEqual(r, 2) r = plot_gtex.linear_search(10, L) self.assertEqual(r, -1)
def test_linear_search(self): """ This function tests the functionality of the linear search method """ L = [1, 2, 3, 4, 5] r = plot_gtex.linear_search(3, L) self.assertEqual(r, 2) r = plot_gtex.linear_search(100, L) self.assertEqual(r, -1)
def test_binary_search(self): array = [['cat', 1], ['dog', 2]] found = plot_gtex.binary_search('cat', array) self.assertEqual(1, found) r = plot_gtex.linear_search('pigeon', array) self.assertEqual(r, -1)
def test_linear_search_random_list(self): for x in range(100): L = [] for y in range(50): num = random.randint(5 * y, 5 * y + 4) L.append(num) location = random.randint(0, 49) key = L[location] self.assertEqual(pg.linear_search(key, L), location)
def test_linear_search_when_not_in_list(self): """test if linear search returns -1 when entry not in lst""" for j in range(10): # including rand interation r = [] for i in range((10)): r = r + [random.choice(string.ascii_letters)] rset = list(dict.fromkeys(r).keys()) rr = plot_gtex.linear_search('aa', rset) self.assertEqual(rr, -1)
def test_linear_search(self): """test if linear search works""" for j in range(10): # including rand interation r = [] for i in range((10)): r = r + [random.choice(string.ascii_letters)] rset = list(dict.fromkeys(r).keys()) aa_indx = random.randint(0, len(rset)-1) rset[aa_indx] = 'aa' rr = plot_gtex.linear_search('aa', rset) self.assertEqual(rr, aa_indx)
def test_linear_search_rand_not_in_list(self): for k in range(100): rand_int = random.randint(1001, 2001) key = rand_int L = [] for i in range(100): rand_int_for_list = random.randint(1, 1000) if rand_int_for_list != rand_int: L.append(rand_int_for_list) else: continue L = list(dict.fromkeys(L)) rand_idx = random.randint(1, len(L) - 1) r = plot_gtex.linear_search(key, L) self.assertEqual(r, -1)
def test_linear_search_empty(self): assert plot_gtex.linear_search("string", []) == -1
def test_linear_search_large(self): size = random.randint(1, 10000) rand_index = random.randint(0, size + 1) ones = [1 for _ in range(size)] ones[rand_index] = 0 assert plot_gtex.linear_search(0, ones) == rand_index
def test_linear_search(self): # successfull search A = ['a', 'b', 'c', 'd', 'e', 'f'] LS = plot_gtex.linear_search('c', A) self.assertEqual('c', A[LS])
def test_linear_exists(self): self.key = 5 self.data_list = list(range(10)) self.assertEqual(linear_search(self.key, self.data_list), 5)
def test_linear_search_empty(self): '''Test for linear search''' L = [] self.assertEqual(pg.linear_search(4, L), -1)
def test_linear_search_empty_list(self): res = plot_gtex.linear_search(0, []) self.assertEqual(res, -1)
def test_hit(self): self.assertEqual(pgtx.linear_search(1, [1, 2, 3]), 0)
def test_no_hit(self): self.assertEqual(pgtx.linear_search('aa', [1, 2, 3]), -1)
def test_linear_search_easy(self): key = 'blue' L = ['red', 'blue', 'yellow'] r = plot_gtex.linear_search(key, L) self.assertEqual(r, 1)
def test_linear_search_easy_not_in_list(self): key = 'green' L = ['red', 'blue', 'yellow'] r = plot_gtex.linear_search(key, L) self.assertEqual(r, -1)
def test_linear_search_fail(self): # No hits in the list A = [1, 2, 3, 4, 5, 6] LS = plot_gtex.linear_search(7, A) self.assertEqual(-1, LS)
def test_linear_search_small(self): numbers = [100, 200, 300, 400, 500] assert plot_gtex.linear_search(500, numbers) == 4
def test_linear_search_not_found(self): '''Test for linear search''' L = [2, 4, 5, 6, 7, 8] self.assertEqual(pg.linear_search(1, L), -1)
def test_linear_search_empty_list(self): self.assertEqual(pg.linear_search(1, []), -1)
def test_linear_search_with_val(self): res = plot_gtex.linear_search(3, self.linear_data) self.assertEqual(res, 1)
def test_linear_no_key(self): self.key = None self.data_list = list(range(10)) self.assertEqual(linear_search(self.key, self.data_list), -1)
def test_linear_search_constant(self): L = [1, 2, 3, 4, 5, 6] r = plot_gtex.linear_search(3, L) self.assertEqual(r, 2) # the index where 3 occurs in L
def test_linear_search_empty_list(self): key = 'cheddar' L = [] r = plot_gtex.linear_search(key, L) self.assertEqual(r, -1)
def test_linear_missing(self): self.key = 100 self.data_list = list(range(10)) self.assertEqual(linear_search(self.key, self.data_list), -1)
def test_linear_search(self): '''Test for linear search''' L = [2, 4, 5, 6, 7, 8] self.assertEqual(pg.linear_search(4, L), 1)
def test_linear_empty(self): self.key = 5 self.data_list = [] self.assertEqual(linear_search(self.key, self.data_list), -1)
def test_linear_search_key_mid(self): key = 'provolone' L = ['cheddar', 'brie', 'provolone', 'swiss', 'gouda'] r = plot_gtex.linear_search(key, L) self.assertEqual(r, 2)