c0a393e873fb6bbf469fc83fc563aba785c2f246,pynndescent/pynndescent_.py,,initialized_nnd_search,#Any#Any#Any#Any#Any#Any#Any#,89

Before Change

            if vertex == -1:
                break
            candidates = indices[indptr[vertex] : indptr[vertex + 1]]
            for j in range(candidates.shape[0]):
                if (
                    candidates[j] == vertex
                    or candidates[j] == -1
                    or candidates[j] in tried
                ):
                    continue
                d = dist(data[candidates[j]], query_points[i], *dist_args)
                unchecked_heap_push(initialization, i, d, candidates[j], 1)
                tried.add(candidates[j])

After Change

        // Find smallest flagged vertex
        vertex = smallest_flagged(initialization, i)

        while vertex >= 0:

            for j in range(indptr[vertex], indptr[vertex + 1]):

                candidate = indices[j]

                if candidate not in tried:
                    d = dist(data[candidate], query_points[i], *dist_args)
                    unchecked_heap_push(initialization, i, d, candidate, 1)
                    tried.add(candidate)

            // Find smallest flagged vertex
            vertex = smallest_flagged(initialization, i)

    return initialization


@numba.njit(fastmath=True)

Instances