class_docstr: A subclass of Queue; retrieves entries in priority order (lowest first).
  
  Entries are typically tuples of the form: (priority number, data).
code: def _get(self, heappop=heapq.heappop):
      return heappop(self._queue)
  
imports: import collections
  import heapq
  from types import GenericAlias
  from .None import locks
  from .None import mixins
label_desc: Use image node_id 3 for calling the PriorityQueue obj's underlying member method code with example usage: obj._get(heappop) and returns: heappop