def _insertIntoSortedList()

in archive/preprocess/growphrase.py [0:0]

• 4 lines of code
• 2 McCabe index (conditional complexity)

	def _insertIntoSortedList(self, sortedlist, item):
		i = bisect.bisect_left([l['size'] for l in sortedlist], item['size'])
		sortedlist.insert(i, item)
		return sortedlist