yt.utilities.lib.bounded_priority_queue module¶

A cython implementation of the bounded priority queue

This is a priority queue that only keeps track of smallest k values that have been added to it.

This priority queue is implemented with the configuration of having the largest element at the beginning - this exploited to store nearest neighbour lists.

class yt.utilities.lib.bounded_priority_queue.BoundedPriorityQueue¶

Bases: object

heap¶

pids¶

class yt.utilities.lib.bounded_priority_queue.NeighborList¶

Bases: object

data¶

pids¶

yt.utilities.lib.bounded_priority_queue.validate()¶

yt.utilities.lib.bounded_priority_queue.validate_nblist()¶

yt.utilities.lib.bounded_priority_queue.validate_pid()¶