class_docstr: Create a queue object with a given maximum size.
  
  If maxsize is <= 0, the queue size is infinite.
docstr: Return True if the queue is full, False otherwise (not reliable!).
  
  This method is likely to be removed at some point.  Use qsize() >= n
  as a direct substitute, but be aware that either approach risks a race
  condition where a queue can shrink before the result of full() or
  qsize() can be used.
docstr_tok: ["Return","True","if","the","queue","is","full",",","False","otherwise","(","not","reliable","!",")",".","This","method","is","likely","to","be","removed","at","some","point",".","Use","qsize","(",")",">","=","n","as","a","direct","substitute",",","but","be","aware","that","either","approach","risks","a","race","condition","where","a","queue","can","shrink","before","the","result","of","full","(",")","or","qsize","(",")","can","be","used","."]
code: def full(self):
      """Return True if the queue is full, False otherwise (not reliable!).
  
      This method is likely to be removed at some point.  Use qsize() >= n
      as a direct substitute, but be aware that either approach risks a race
      condition where a queue can shrink before the result of full() or
      qsize() can be used.
      """
      with self.mutex:
          return 0 < self.maxsize <= self._qsize()
  
imports: import threading
  import types
  from collections import deque
  from heapq import heappush, heappop
  from time import monotonic
label_desc: Use image node_id 6 for calling the Queue obj's underlying member method code with example usage: obj.full() and returns: unknown