Code Duplication - chen0040/pyalgs - Measure and Improve Code Quality continuously with Scrutinizer

Code Duplication Length = 13-14 lines in 2 locations

pyalgs/data_structures/commons/hashed_map.py 1 location


                    self.resize(self.M // 2)
                return x.value

    def put(self, key, value):
        i = self.hash(key)
        for j in range(self.M):
            k = (i + j) % self.M
            x = self.id[k]
            if x is None:
                self.id[k] = Node(key, value)
                self.N += 1
                if self.N == self.M // 2:
                    self.resize(self.M * 2)
                break
            if util.cmp(x.key, key) == 0:
                self.id[k].value = value
                break

    def resize(self, new_size):
        clone = HashedMapWithLinearProbing(new_size)

pyalgs/data_structures/commons/hashed_set.py 1 location


                    self.resize(self.M // 2)
                return True

    def add(self, key):
        i = self.hash(key)
        for j in range(self.M):
            k = (i + j) % self.M
            x = self.id[k]
            if x is None:
                self.id[k] = Node(key)
                self.N += 1
                if self.N == self.M // 2:
                    self.resize(self.M * 2)
                break
            if util.cmp(x.key, key) == 0:
                break

    def resize(self, new_size):
        clone = HashedSetWithLinearProbing(new_size)

		@@ 181-194 (lines=14) @@
178		self.resize(self.M // 2)
179		return x.value
180
181		def put(self, key, value):
182		i = self.hash(key)
183		for j in range(self.M):
184		k = (i + j) % self.M
185		x = self.id[k]
186		if x is None:
187		self.id[k] = Node(key, value)
188		self.N += 1
189		if self.N == self.M // 2:
190		self.resize(self.M * 2)
191		break
192		if util.cmp(x.key, key) == 0:
193		self.id[k].value = value
194		break
195
196		def resize(self, new_size):
197		clone = HashedMapWithLinearProbing(new_size)

		@@ 168-180 (lines=13) @@
165		self.resize(self.M // 2)
166		return True
167
168		def add(self, key):
169		i = self.hash(key)
170		for j in range(self.M):
171		k = (i + j) % self.M
172		x = self.id[k]
173		if x is None:
174		self.id[k] = Node(key)
175		self.N += 1
176		if self.N == self.M // 2:
177		self.resize(self.M * 2)
178		break
179		if util.cmp(x.key, key) == 0:
180		break
181
182		def resize(self, new_size):
183		clone = HashedSetWithLinearProbing(new_size)

chen0040 / pyalgs

Code Duplication Length = 13-14 lines in 2 locations

pyalgs/data_structures/commons/hashed_map.py 1 location

pyalgs/data_structures/commons/hashed_set.py 1 location