Trees | Indices | Help |
|
---|
|
An array of structs which do not all have the same size.
Nested Classes | |
__metaclass__ Give each object a unique ID. (Inherited from rekall.obj.BaseObject) |
Instance Methods | |||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from |
Class Methods | |||
|
Class Variables | |
obj_name = <No name>
(Inherited from rekall.obj.BaseObject)
|
|
obj_parent = <No parent>
(Inherited from rekall.obj.BaseObject)
|
|
obj_producers = None hash(x) (Inherited from rekall.obj.BaseObject) |
|
target_size = 0
(Inherited from rekall.obj.Array)
|
Properties | |
obj_size It is generally too expensive to rely on the size of this array. |
|
indices Returns (usually 1) representation(s) of self usable as dict keys. (Inherited from rekall.obj.BaseObject) |
|
obj_end (Inherited from rekall.obj.BaseObject) | |
parents Returns all the parents of this object. (Inherited from rekall.obj.BaseObject) |
|
Inherited from |
Method Details |
Constructor. This array may be initialized using one of the following parameters: maximum_size: The maximum size of the array in bytes. maximum_offset: If we reach this offset iteration is terminated. count: The total count of items in this list. max_count: The maximum size of the array. This is a safety mechanism if count is calculated. max_count should be set to an upper bound on the size of the array.
|
It is generally too expensive to rely on the count of this array.
|
|
|
Property Details |
obj_sizeIt is generally too expensive to rely on the size of this array.
|
Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Mon Oct 9 03:27:52 2017 | http://epydoc.sourceforge.net |