def getBestItem(self, cube_indx):

        entryLst = []
        indexVector = []
        self.initDimVec = [0] * self.dimensions
        bestItemsLst = []

        # Iterate thro' the tuples: compute log prob of first entry in every tuple and sum them
        for j in range( self.dimensions ):
            entryLst.append( self.ruleLst[j][0] )
            indexVector.append(0)
        (score, entry_obj) = self.mergeEntries(entryLst, cube_indx)
        self.trackCubeDict[ tuple(indexVector) ] = 1

        # negate the score before returning
        return ( -score, entry_obj, cube_indx, indexVector )
Test freezing a Git clone.
dataset/ETHPy150Open sfu-natlang/Kriya/src/Kriya-Decoder/lazyMerge_CP.py/Cube.getBestItem--crossover with--dataset/ETHPy150Open pypa/pip/tests/functional/test_freeze.py/test_freeze_git_clone