def __init__()

in heap.py [0:0]

• 20 lines of code
• 3 McCabe index (conditional complexity)

    def __init__(self,
                 ini_vector=None,
                 compare_function=lambda a, b: a > b,
                 value_score_function=lambda x: x,
                 key_function=lambda x: x,
                 use_score_caching=False):
        self.cmp = lambda a, b: compare_function(self._get_value_score(a), self._get_value_score(b))
        self.timestep = 0
        self.use_score_caching = use_score_caching
        self.value_score_function = value_score_function
        self.inverse_index = {}
        self.keyf = lambda v: key_function(v.value)
        self.invalid_pos = set()
        self.data = []
        if ini_vector:
            for (i, x) in enumerate(ini_vector):
                value = CachedScoreValue(x, None, None)
                self.data.append(value)
                self.inverse_index[self.keyf(value)] = i
            self.heapify()