|
def | __init__ (self, name, firstCheckDelay=None) |
|
def | addPrivateObj (cls, obj) |
|
def | destroy (self) |
|
def | getContainerById (self, id) |
|
def | getContainerByIdGen (self, id, kwArgs) |
|
def | getContainerIds (self) |
|
def | getContainerNameById (self, id) |
|
def | getContainerNameByIdGen (self, id, kwArgs) |
|
def | getLeakEvent (self) |
|
def | getPathsToContainers (self, name, ot, doneCallback=None) |
|
def | getPathsToContainersNamed (self, name, on, doneCallback=None) |
|
def | removeContainerById (self, id) |
|
def | removePrivateObj (cls, obj) |
|
def | run (self) |
|
def | __init__ (self, name) |
|
def | destroy (self) |
|
def | finished (self) |
|
def | getFinishedEvent (self) |
|
def | getJobName (self) |
|
def | getPriority (self) |
|
def | isFinished (self) |
|
def | printingBegin (self) |
|
def | printingEnd (self) |
|
def | resume (self) |
|
def | run (self) |
|
def | setPriority (self, priority) |
|
def | suspend (self) |
|
def | __init__ (self) |
|
def | accept (self, event, method, extraArgs=[]) |
|
def | acceptOnce (self, event, method, extraArgs=[]) |
|
def | addTask (self, args, kwargs) |
|
def | detectLeaks (self) |
|
def | doMethodLater (self, args, kwargs) |
|
def | getAllAccepting (self) |
|
def | ignore (self, event) |
|
def | ignoreAll (self) |
|
def | isAccepting (self, event) |
|
def | isIgnoring (self, event) |
|
def | removeAllTasks (self) |
|
def | removeTask (self, taskOrName) |
|
Low-priority Python object-graph walker that looks for leaking containers.
To reduce memory usage, this does a random walk of the Python objects to
discover containers rather than keep a set of all visited objects; it may
visit the same object many times but eventually it will discover every object.
Checks container sizes at ever-increasing intervals.