Module index

Module ida_pro

This is the first header included in the IDA project.
It defines the most common types, functions and data. Also, it tries to make system dependent definitions.
The following preprocessor macros are used in the project (the list may be incomplete)
Platform must be specified as one of:
__NT__ - MS Windows (all platforms) __LINUX__ - Linux __MAC__ - MAC OS X
__EA64__ - 64-bit address size (sizeof(ea_t)==8) __X86__ - 32-bit debug servers (sizeof(void*)==4) __X64__ - x64 processor (sizeof(void*)==8) default __PPC__ - PowerPC __ARM__ - ARM

Global variables

var BADDIFF
BADDIFF = 18446744073709551615
var BADMEMSIZE
BADMEMSIZE = 9223372036854775807
var CEF_RETERR
CEF_RETERR = 1
var CP_BOM
CP_BOM = 65279
var CP_ELLIPSIS
CP_ELLIPSIS = 8230
var CP_REPLCHAR
CP_REPLCHAR = 65533
var CP_UTF16
UTF-16 codepage.
var CP_UTF8
CP_UTF8 = 65001
var ENC_MUTF8
ENC_MUTF8 = 'MUTF-8'
var ENC_UTF16
ENC_UTF16 = 'UTF-16'
var ENC_UTF16BE
ENC_UTF16BE = 'UTF-16BE'
var ENC_UTF16LE
ENC_UTF16LE = 'UTF-16LE'
var ENC_UTF32
ENC_UTF32 = 'UTF-32'
var ENC_UTF32BE
ENC_UTF32BE = 'UTF-32BE'
var ENC_UTF32LE
ENC_UTF32LE = 'UTF-32LE'
var ENC_UTF8
ENC_UTF8 = 'UTF-8'
var ENC_WIN1252
ENC_WIN1252 = 'windows-1252'
var FMT_64
FMT_64 = 'll'
var FMT_EA
FMT_EA = ''
var FMT_Z
FMT_Z = 'zu'
var FMT_ZS
FMT_ZS = 'zd'
var FMT_ZX
FMT_ZX = 'zX'
var IDA_SDK_VERSION
IDA SDK v8.4.
var IDBDEC_ESCAPE
convert non-printable characters to C escapes ( , \xNN, \uNNNN)
var IOREDIR_APPEND
append, do not overwrite the output file
var IOREDIR_INPUT
input redirection
var IOREDIR_OUTPUT
output redirection
var IOREDIR_QUOTED
the file name was quoted
var MAXSTR
maximum string size
var MAX_UTF8_SEQ_LEN
MAX_UTF8_SEQ_LEN = 8
var NULL_PIPE_HANDLE
NULL_PIPE_HANDLE = -1
var QWCONTINUED
QWCONTINUED = 8
var QWNOHANG
QWNOHANG = 1
var SUBSTCHAR
default char, used if a char cannot be represented in a codepage
var TCT_NOT_OWNER
TCT_NOT_OWNER = 2
var TCT_OWNER
TCT_OWNER = 1
var TCT_UNKNOWN
TCT_UNKNOWN = 0
var UTF16BE_BOM
UTF16BE_BOM = '\udcfe\udcff'
var UTF16LE_BOM
UTF16LE_BOM = '\udcff\udcfe'
var UTF32BE_BOM
UTF32BE_BOM = ''
var UTF32LE_BOM
UTF32LE_BOM = '\udcff\udcfe'
var UTF8_BOM
UTF8_BOM = '\ufeff'
var UTF8_ELLIPSIS
UTF8_ELLIPSIS = '…'
var UTF8_REPLCHAR
UTF8_REPLCHAR = '�'

Functions

def check_process_exit(*args) ‑> int
check_process_exit(handle, exit_code, msecs=-1) -> int
Check whether process has terminated or not.
handle: (C++: void *) process handle to wait for
exit_code: (C++: int *) pointer to the buffer for the exit code
msecs: how long to wait. special values:
  • 0: do not wait
  • 1 or -1: wait infinitely
  • other values: timeout in milliseconds
retval 0: process has exited, and the exit code is available. if *exit_code <
0: the process was killed with a signal -*exit_code
retval 1: process has not exited yet
retval -1: error happened, see error code for winerr() in *exit_code
def ea_array_frompointer(*args) ‑> ea_array *
ea_array_frompointer(t) -> ea_array
t: ea_t *
def ea_pointer_frompointer(*args) ‑> ea_pointer *
ea_pointer_frompointer(t) -> ea_pointer
t: ea_t *
def extend_sign(*args) ‑> uint64
extend_sign(v, nbytes, sign_extend) -> uint64
Sign-, or zero-extend the value 'v' to occupy 64 bits. The value 'v' is considered to be of size 'nbytes'.
v: (C++: uint64)
nbytes: (C++: int)
sign_extend: (C++: bool)
def int_pointer_frompointer(*args) ‑> int_pointer *
int_pointer_frompointer(t) -> int_pointer
t: int *
def is_control_tty(*args) ‑> enum tty_control_t
is_control_tty(fd) -> enum tty_control_t
Check if the current process is the owner of the TTY specified by 'fd' (typically an opened descriptor to /dev/tty).
fd: (C++: int)
def is_cvt64(*args) ‑> bool
is_cvt64() -> bool
is IDA converting IDB into I64?
def is_main_thread(*args) ‑> bool
is_main_thread() -> bool
Are we running in the main thread?
def log2ceil(*args) ‑> int
log2ceil(d64) -> int
calculate ceil(log2(d64)) or floor(log2(d64)), it returns 0 if d64 == 0
d64: (C++: uint64)
def log2floor(*args) ‑> int
log2floor(d64) -> int
d64: uint64
def parse_dbgopts(*args) ‑> bool
parse_dbgopts(ido, r_switch) -> bool
Parse the -r command line switch (for instant debugging). r_switch points to the value of the -r switch. Example: win32@localhost+
ido: (C++: struct instant_dbgopts_t *) instant_dbgopts_t *
r_switch: (C++: const char *) char const *
return: true-ok, false-parse error
def qatoll(*args) ‑> int64
qatoll(nptr) -> int64
nptr: char const *
def qcontrol_tty(*args) ‑> void
qcontrol_tty()
Make the current terminal the controlling terminal of the calling process.
note: The current terminal is supposed to be /dev/tty
def qdetach_tty(*args) ‑> void
qdetach_tty()
If the current terminal is the controlling terminal of the calling process, give up this controlling terminal.
note: The current terminal is supposed to be /dev/tty
def qexit(*args) ‑> void
qexit(code)
Call qatexit functions, shut down UI and kernel, and exit.
code: (C++: int) exit code
def qstrvec_t_add(*args) ‑> bool
qstrvec_t_add(_self, s) -> bool
self: PyObject *
s: char const *
def qstrvec_t_addressof(*args) ‑> PyObject *
qstrvec_t_addressof(_self, idx) -> PyObject *
self: PyObject *
idx: size_t
def qstrvec_t_assign(*args) ‑> bool
qstrvec_t_assign(_self, other) -> bool
self: PyObject *
other: PyObject *
def qstrvec_t_clear(*args) ‑> bool
qstrvec_t_clear(_self, qclear) -> bool
self: PyObject *
qclear: bool
def qstrvec_t_create(*args) ‑> PyObject *
qstrvec_t_create() -> PyObject *
def qstrvec_t_destroy(*args) ‑> bool
qstrvec_t_destroy(py_obj) -> bool
py_obj: PyObject *
def qstrvec_t_from_list(*args) ‑> bool
qstrvec_t_from_list(_self, py_list) -> bool
self: PyObject *
py_list: PyObject *
def qstrvec_t_get(*args) ‑> PyObject *
qstrvec_t_get(_self, idx) -> PyObject *
self: PyObject *
idx: size_t
qstrvec_t_get_clink(_self) -> qstrvec_t *
self: PyObject *
qstrvec_t_get_clink_ptr(_self) -> PyObject *
self: PyObject *
def qstrvec_t_insert(*args) ‑> bool
qstrvec_t_insert(_self, idx, s) -> bool
self: PyObject *
idx: size_t
s: char const *
def qstrvec_t_remove(*args) ‑> bool
qstrvec_t_remove(_self, idx) -> bool
self: PyObject *
idx: size_t
def qstrvec_t_set(*args) ‑> bool
qstrvec_t_set(_self, idx, s) -> bool
self: PyObject *
idx: size_t
s: char const *
def qstrvec_t_size(*args) ‑> size_t
qstrvec_t_size(_self) -> size_t
self: PyObject *
def qthread_equal(*args) ‑> bool
qthread_equal(q1, q2) -> bool
Are two threads equal?
q1: (C++: qthread_t)
q2: (C++: qthread_t)
def quote_cmdline_arg(*args) ‑> bool
quote_cmdline_arg(arg) -> bool
Quote a command line argument if it contains escape characters. For example, *.c will be converted into "*.c" because * may be inadvertently expanded by the shell
arg: (C++: qstring *)
return: true: modified 'arg'
def qvector_reserve(*args) ‑> void *
qvector_reserve(vec, old, cnt, elsize) -> void *
Change capacity of given qvector.
vec: (C++: void *) a pointer to a qvector
old: (C++: void *) a pointer to the qvector's array
cnt: (C++: size_t) number of elements to reserve
elsize: (C++: size_t) size of each element
return: a pointer to the newly allocated array
def readbytes(*args) ‑> int
readbytes(h, res, size, mf) -> int
Read at most 4 bytes from file.
h: (C++: int) file handle
res: (C++: uint32 *) value read from file
size: (C++: int) size of value in bytes (1,2,4)
mf: (C++: bool) is MSB first?
return: 0 on success, nonzero otherwise
def reloc_value(*args) ‑> void
reloc_value(value, size, delta, mf)
value: void *
size: int
delta: adiff_t
mf: bool
def relocate_relobj(*args) ‑> bool
relocate_relobj(_relobj, ea, mf) -> bool
_relobj: relobj_t *
ea: ea_t
mf: bool
def sel_array_frompointer(*args) ‑> sel_array *
sel_array_frompointer(t) -> sel_array
t: sel_t *
def sel_pointer_frompointer(*args) ‑> sel_pointer *
sel_pointer_frompointer(t) -> sel_pointer
t: sel_t *
def str2user(*args) ‑> PyObject *
str2user(str) -> str or None
Insert C-style escape characters to string
str: char const *
return: new string with escape characters inserted
def sval_pointer_frompointer(*args) ‑> sval_pointer *
sval_pointer_frompointer(t) -> sval_pointer
t: sval_t *
def tid_array_frompointer(*args) ‑> tid_array *
tid_array_frompointer(t) -> tid_array
t: tid_t *
def uchar_array_frompointer(*args) ‑> uchar_array *
uchar_array_frompointer(t) -> uchar_array
t: uchar *
def uval_array_frompointer(*args) ‑> uval_array *
uval_array_frompointer(t) -> uval_array
t: uval_t *
def writebytes(*args) ‑> int
writebytes(h, l, size, mf) -> int
Write at most 4 bytes to file.
h: (C++: int) file handle
l: (C++: uint32) value to write
size: (C++: int) size of value in bytes (1,2,4)
mf: (C++: bool) is MSB first?
return: 0 on success, nonzero otherwise

Classes

class boolvec_t (*args)
Proxy of C++ qvector< bool > class.
__init__(self) -> boolvec_t
__init__(self, x) -> boolvec_t
x: qvector< bool > const &

Methods

def add_unique(self, *args) ‑> bool
add_unique(self, x) -> bool
x: bool const &
def append(self, *args) ‑> bool &
push_back(self, x)
x: bool const &
push_back(self) -> bool &
def at(self, *args) ‑> bool const &
__getitem__(self, i) -> bool const &
i: size_t
def back(self)
def begin(self, *args) ‑> qvector< bool >::const_iterator
begin(self) -> qvector< bool >::iterator
begin(self) -> qvector< bool >::const_iterator
def capacity(self, *args) ‑> size_t
capacity(self) -> size_t
def clear(self, *args) ‑> void
clear(self)
def empty(self, *args) ‑> bool
empty(self) -> bool
def end(self, *args) ‑> qvector< bool >::const_iterator
end(self) -> qvector< bool >::iterator
end(self) -> qvector< bool >::const_iterator
def erase(self, *args) ‑> qvector< bool >::iterator
erase(self, it) -> qvector< bool >::iterator
it: qvector< bool >::iterator
erase(self, first, last) -> qvector< bool >::iterator
first: qvector< bool >::iterator
last: qvector< bool >::iterator
def extract(self, *args) ‑> bool *
extract(self) -> bool *
def find(self, *args) ‑> qvector< bool >::const_iterator
find(self, x) -> qvector< bool >::iterator
x: bool const &
find(self, x) -> qvector< bool >::const_iterator
x: bool const &
def front(self)
def grow(self, *args) ‑> void
grow(self, x=bool())
x: bool const &
def has(self, *args) ‑> bool
has(self, x) -> bool
x: bool const &
def inject(self, *args) ‑> void
inject(self, s, len)
s: bool *
len: size_t
def insert(self, *args) ‑> qvector< bool >::iterator
insert(self, it, x) -> qvector< bool >::iterator
it: qvector< bool >::iterator
x: bool const &
def pop_back(self, *args) ‑> void
pop_back(self)
def push_back(self, *args) ‑> bool &
push_back(self, x)
x: bool const &
push_back(self) -> bool &
def qclear(self, *args) ‑> void
qclear(self)
def reserve(self, *args) ‑> void
reserve(self, cnt)
cnt: size_t
def resize(self, *args) ‑> void
resize(self, _newsize, x)
_newsize: size_t
x: bool const &
resize(self, _newsize)
_newsize: size_t
def size(self, *args) ‑> size_t
size(self) -> size_t
def swap(self, *args) ‑> void
swap(self, r)
r: qvector< bool > &
def truncate(self, *args) ‑> void
truncate(self)
class channel_redir_t (*args)
Proxy of C++ channel_redir_t class.
__init__(self) -> channel_redir_t

Instance variables

var fd
channel number
var file
file name to redirect to/from. if empty, the channel must be closed.
var flags
i/o redirection flags
var length
length of the redirection string in the command line
var start
begin of the redirection string in the command line

Methods

def is_append(self, *args) ‑> bool
is_append(self) -> bool
def is_input(self, *args) ‑> bool
is_input(self) -> bool
def is_output(self, *args) ‑> bool
is_output(self) -> bool
def is_quoted(self, *args) ‑> bool
is_quoted(self) -> bool
class ea_array (*args)
Proxy of C++ ea_array class.
__init__(self, nelements) -> ea_array
nelements: size_t

Static methods

def frompointer(*args) ‑> ea_array *
frompointer(t) -> ea_array
t: ea_t *

Methods

def cast(self, *args) ‑> ea_t *
cast(self) -> ea_t *
class ea_pointer (*args)
Proxy of C++ ea_pointer class.
__init__(self) -> ea_pointer

Static methods

def frompointer(*args) ‑> ea_pointer *
frompointer(t) -> ea_pointer
t: ea_t *

Methods

def assign(self, *args) ‑> void
assign(self, value)
value: ea_t
def cast(self, *args) ‑> ea_t *
cast(self) -> ea_t *
def value(self, *args) ‑> ea_t
value(self) -> ea_t
class instant_dbgopts_t (*args)
Proxy of C++ instant_dbgopts_t class.
__init__(self) -> instant_dbgopts_t

Instance variables

var attach
should attach to a process?
var debmod
name of debugger module
var env
config variables for debmod. example: DEFAULT_CPU=13;MAXPACKETSIZE=-1
var event_id
event to trigger upon attaching
var host
remote hostname (if remote debugging)
var pid
process to attach to (-1: ask the user)
var port
port number for the remote debugger server
class int64vec_t (*args)
Proxy of C++ qvector< long long > class.
__init__(self) -> int64vec_t
__init__(self, x) -> int64vec_t
x: qvector< long long > const &

Methods

def add_unique(self, *args) ‑> bool
add_unique(self, x) -> bool
x: long long const &
def append(self, *args) ‑> long long &
push_back(self, x)
x: long long const &
push_back(self) -> long long &
def at(self, *args) ‑> long long const &
__getitem__(self, i) -> long long const &
i: size_t
def back(self)
def begin(self, *args) ‑> qvector< long long >::const_iterator
begin(self) -> qvector< long long >::iterator
begin(self) -> qvector< long long >::const_iterator
def capacity(self, *args) ‑> size_t
capacity(self) -> size_t
def clear(self, *args) ‑> void
clear(self)
def empty(self, *args) ‑> bool
empty(self) -> bool
def end(self, *args) ‑> qvector< long long >::const_iterator
end(self) -> qvector< long long >::iterator
end(self) -> qvector< long long >::const_iterator
def erase(self, *args) ‑> qvector< long long >::iterator
erase(self, it) -> qvector< long long >::iterator
it: qvector< long long >::iterator
erase(self, first, last) -> qvector< long long >::iterator
first: qvector< long long >::iterator
last: qvector< long long >::iterator
def extract(self, *args) ‑> long long *
extract(self) -> long long *
def find(self, *args) ‑> qvector< long long >::const_iterator
find(self, x) -> qvector< long long >::iterator
x: long long const &
find(self, x) -> qvector< long long >::const_iterator
x: long long const &
def front(self)
def has(self, *args) ‑> bool
has(self, x) -> bool
x: long long const &
def inject(self, *args) ‑> void
inject(self, s, len)
s: long long *
len: size_t
def insert(self, *args) ‑> qvector< long long >::iterator
insert(self, it, x) -> qvector< long long >::iterator
it: qvector< long long >::iterator
x: long long const &
def pop_back(self, *args) ‑> void
pop_back(self)
def push_back(self, *args) ‑> long long &
push_back(self, x)
x: long long const &
push_back(self) -> long long &
def qclear(self, *args) ‑> void
qclear(self)
def reserve(self, *args) ‑> void
reserve(self, cnt)
cnt: size_t
def resize(self, *args) ‑> void
resize(self, _newsize, x)
_newsize: size_t
x: long long const &
resize(self, _newsize)
_newsize: size_t
def size(self, *args) ‑> size_t
size(self) -> size_t
def swap(self, *args) ‑> void
swap(self, r)
r: qvector< long long > &
def truncate(self, *args) ‑> void
truncate(self)
class longlongvec_t (*args)
Proxy of C++ qvector< long long > class.
__init__(self) -> int64vec_t
__init__(self, x) -> int64vec_t
x: qvector< long long > const &

Methods

def add_unique(self, *args) ‑> bool
add_unique(self, x) -> bool
x: long long const &
def append(self, *args) ‑> long long &
push_back(self, x)
x: long long const &
push_back(self) -> long long &
def at(self, *args) ‑> long long const &
__getitem__(self, i) -> long long const &
i: size_t
def back(self)
def begin(self, *args) ‑> qvector< long long >::const_iterator
begin(self) -> qvector< long long >::iterator
begin(self) -> qvector< long long >::const_iterator
def capacity(self, *args) ‑> size_t
capacity(self) -> size_t
def clear(self, *args) ‑> void
clear(self)
def empty(self, *args) ‑> bool
empty(self) -> bool
def end(self, *args) ‑> qvector< long long >::const_iterator
end(self) -> qvector< long long >::iterator
end(self) -> qvector< long long >::const_iterator
def erase(self, *args) ‑> qvector< long long >::iterator
erase(self, it) -> qvector< long long >::iterator
it: qvector< long long >::iterator
erase(self, first, last) -> qvector< long long >::iterator
first: qvector< long long >::iterator
last: qvector< long long >::iterator
def extract(self, *args) ‑> long long *
extract(self) -> long long *
def find(self, *args) ‑> qvector< long long >::const_iterator
find(self, x) -> qvector< long long >::iterator
x: long long const &
find(self, x) -> qvector< long long >::const_iterator
x: long long const &
def front(self)
def has(self, *args) ‑> bool
has(self, x) -> bool
x: long long const &
def inject(self, *args) ‑> void
inject(self, s, len)
s: long long *
len: size_t
def insert(self, *args) ‑> qvector< long long >::iterator
insert(self, it, x) -> qvector< long long >::iterator
it: qvector< long long >::iterator
x: long long const &
def pop_back(self, *args) ‑> void
pop_back(self)
def push_back(self, *args) ‑> long long &
push_back(self, x)
x: long long const &
push_back(self) -> long long &
def qclear(self, *args) ‑> void
qclear(self)
def reserve(self, *args) ‑> void
reserve(self, cnt)
cnt: size_t
def resize(self, *args) ‑> void
resize(self, _newsize, x)
_newsize: size_t
x: long long const &
resize(self, _newsize)
_newsize: size_t
def size(self, *args) ‑> size_t
size(self) -> size_t
def swap(self, *args) ‑> void
swap(self, r)
r: qvector< long long > &
def truncate(self, *args) ‑> void
truncate(self)
class int_pointer (*args)
Proxy of C++ int_pointer class.
__init__(self) -> int_pointer

Static methods

def frompointer(*args) ‑> int_pointer *
frompointer(t) -> int_pointer
t: int *

Methods

def assign(self, *args) ‑> void
assign(self, value)
value: int
def cast(self, *args) ‑> int *
cast(self) -> int *
def value(self, *args) ‑> int
value(self) -> int
class intvec_t (*args)
Proxy of C++ qvector< int > class.
__init__(self) -> intvec_t
__init__(self, x) -> intvec_t
x: qvector< int > const &

Subclasses

Methods

def add_unique(self, *args) ‑> bool
add_unique(self, x) -> bool
x: int const &
def append(self, *args) ‑> int &
push_back(self, x)
x: int const &
push_back(self) -> int &
def at(self, *args) ‑> int const &
__getitem__(self, i) -> int const &
i: size_t
def back(self)
def begin(self, *args) ‑> qvector< int >::const_iterator
begin(self) -> qvector< int >::iterator
begin(self) -> qvector< int >::const_iterator
def capacity(self, *args) ‑> size_t
capacity(self) -> size_t
def clear(self, *args) ‑> void
clear(self)
def empty(self, *args) ‑> bool
empty(self) -> bool
def end(self, *args) ‑> qvector< int >::const_iterator
end(self) -> qvector< int >::iterator
end(self) -> qvector< int >::const_iterator
def erase(self, *args) ‑> qvector< int >::iterator
erase(self, it) -> qvector< int >::iterator
it: qvector< int >::iterator
erase(self, first, last) -> qvector< int >::iterator
first: qvector< int >::iterator
last: qvector< int >::iterator
def extract(self, *args) ‑> int *
extract(self) -> int *
def find(self, *args) ‑> qvector< int >::const_iterator
find(self, x) -> qvector< int >::iterator
x: int const &
find(self, x) -> qvector< int >::const_iterator
x: int const &
def front(self)
def has(self, *args) ‑> bool
has(self, x) -> bool
x: int const &
def inject(self, *args) ‑> void
inject(self, s, len)
s: int *
len: size_t
def insert(self, *args) ‑> qvector< int >::iterator
insert(self, it, x) -> qvector< int >::iterator
it: qvector< int >::iterator
x: int const &
def pop_back(self, *args) ‑> void
pop_back(self)
def push_back(self, *args) ‑> int &
push_back(self, x)
x: int const &
push_back(self) -> int &
def qclear(self, *args) ‑> void
qclear(self)
def reserve(self, *args) ‑> void
reserve(self, cnt)
cnt: size_t
def resize(self, *args) ‑> void
resize(self, _newsize, x)
_newsize: size_t
x: int const &
resize(self, _newsize)
_newsize: size_t
def size(self, *args) ‑> size_t
size(self) -> size_t
def swap(self, *args) ‑> void
swap(self, r)
r: qvector< int > &
def truncate(self, *args) ‑> void
truncate(self)
class svalvec_t (*args)
Proxy of C++ qvector< int > class.
__init__(self) -> intvec_t
__init__(self, x) -> intvec_t
x: qvector< int > const &

Subclasses

Methods

def add_unique(self, *args) ‑> bool
add_unique(self, x) -> bool
x: int const &
def append(self, *args) ‑> int &
push_back(self, x)
x: int const &
push_back(self) -> int &
def at(self, *args) ‑> int const &
__getitem__(self, i) -> int const &
i: size_t
def back(self)
def begin(self, *args) ‑> qvector< int >::const_iterator
begin(self) -> qvector< int >::iterator
begin(self) -> qvector< int >::const_iterator
def capacity(self, *args) ‑> size_t
capacity(self) -> size_t
def clear(self, *args) ‑> void
clear(self)
def empty(self, *args) ‑> bool
empty(self) -> bool
def end(self, *args) ‑> qvector< int >::const_iterator
end(self) -> qvector< int >::iterator
end(self) -> qvector< int >::const_iterator
def erase(self, *args) ‑> qvector< int >::iterator
erase(self, it) -> qvector< int >::iterator
it: qvector< int >::iterator
erase(self, first, last) -> qvector< int >::iterator
first: qvector< int >::iterator
last: qvector< int >::iterator
def extract(self, *args) ‑> int *
extract(self) -> int *
def find(self, *args) ‑> qvector< int >::const_iterator
find(self, x) -> qvector< int >::iterator
x: int const &
find(self, x) -> qvector< int >::const_iterator
x: int const &
def front(self)
def has(self, *args) ‑> bool
has(self, x) -> bool
x: int const &
def inject(self, *args) ‑> void
inject(self, s, len)
s: int *
len: size_t
def insert(self, *args) ‑> qvector< int >::iterator
insert(self, it, x) -> qvector< int >::iterator
it: qvector< int >::iterator
x: int const &
def pop_back(self, *args) ‑> void
pop_back(self)
def push_back(self, *args) ‑> int &
push_back(self, x)
x: int const &
push_back(self) -> int &
def qclear(self, *args) ‑> void
qclear(self)
def reserve(self, *args) ‑> void
reserve(self, cnt)
cnt: size_t
def resize(self, *args) ‑> void
resize(self, _newsize, x)
_newsize: size_t
x: int const &
resize(self, _newsize)
_newsize: size_t
def size(self, *args) ‑> size_t
size(self) -> size_t
def swap(self, *args) ‑> void
swap(self, r)
r: qvector< int > &
def truncate(self, *args) ‑> void
truncate(self)
class qmutex_locker_t (*args)
Proxy of C++ qmutex_locker_t class.
__init__(self, _lock) -> qmutex_locker_t
_lock: qmutex_t
class qrefcnt_obj_t (*args, **kwargs)
Proxy of C++ qrefcnt_obj_t class.

Instance variables

var refcnt
counter

Methods

def release(self, *args) ‑> void
release(self)
Call destructor. We use release() instead of operator delete() to maintain binary compatibility with all compilers (vc and gcc use different vtable layouts for operator delete)
class sel_array (*args)
Proxy of C++ sel_array class.
__init__(self, nelements) -> sel_array
nelements: size_t

Static methods

def frompointer(*args) ‑> sel_array *
frompointer(t) -> sel_array
t: sel_t *

Methods

def cast(self, *args) ‑> sel_t *
cast(self) -> sel_t *
class sel_pointer (*args)
Proxy of C++ sel_pointer class.
__init__(self) -> sel_pointer

Static methods

def frompointer(*args) ‑> sel_pointer *
frompointer(t) -> sel_pointer
t: sel_t *

Methods

def assign(self, *args) ‑> void
assign(self, value)
value: sel_t
def cast(self, *args) ‑> sel_t *
cast(self) -> sel_t *
def value(self, *args) ‑> sel_t
value(self) -> sel_t
class sizevec_t (*args)
Proxy of C++ qvector< size_t > class.
__init__(self) -> sizevec_t
__init__(self, x) -> sizevec_t
x: qvector< size_t > const &

Methods

def add_unique(self, *args) ‑> bool
add_unique(self, x) -> bool
x: size_t const &
def at(self, *args) ‑> size_t const &
at(self, _idx) -> size_t const &
_idx: size_t
def back(self)
def begin(self, *args) ‑> qvector< size_t >::const_iterator
begin(self) -> qvector< size_t >::iterator
begin(self) -> qvector< size_t >::const_iterator
def capacity(self, *args) ‑> size_t
capacity(self) -> size_t
def clear(self, *args) ‑> void
clear(self)
def empty(self, *args) ‑> bool
empty(self) -> bool
def end(self, *args) ‑> qvector< size_t >::const_iterator
end(self) -> qvector< size_t >::iterator
end(self) -> qvector< size_t >::const_iterator
def erase(self, *args) ‑> qvector< size_t >::iterator
erase(self, it) -> qvector< size_t >::iterator
it: qvector< size_t >::iterator
erase(self, first, last) -> qvector< size_t >::iterator
first: qvector< size_t >::iterator
last: qvector< size_t >::iterator
def extract(self, *args) ‑> size_t *
extract(self) -> size_t *
def find(self, *args) ‑> qvector< size_t >::const_iterator
find(self, x) -> qvector< size_t >::iterator
x: size_t const &
find(self, x) -> qvector< size_t >::const_iterator
x: size_t const &
def front(self)
def grow(self, *args) ‑> void
grow(self, x=size_t())
x: size_t const &
def has(self, *args) ‑> bool
has(self, x) -> bool
x: size_t const &
def inject(self, *args) ‑> void
inject(self, s, len)
s: size_t *
len: size_t
def insert(self, *args) ‑> qvector< size_t >::iterator
insert(self, it, x) -> qvector< size_t >::iterator
it: qvector< size_t >::iterator
x: size_t const &
def pop_back(self, *args) ‑> void
pop_back(self)
def push_back(self, *args) ‑> size_t &
push_back(self, x)
x: size_t const &
push_back(self) -> size_t &
def qclear(self, *args) ‑> void
qclear(self)
def reserve(self, *args) ‑> void
reserve(self, cnt)
cnt: size_t
def resize(self, *args) ‑> void
resize(self, _newsize, x)
_newsize: size_t
x: size_t const &
resize(self, _newsize)
_newsize: size_t
def size(self, *args) ‑> size_t
size(self) -> size_t
def swap(self, *args) ‑> void
swap(self, r)
r: qvector< size_t > &
def truncate(self, *args) ‑> void
truncate(self)
class strvec_t (*args)
Proxy of C++ qvector< simpleline_t > class.
__init__(self) -> strvec_t
__init__(self, x) -> strvec_t
x: qvector< simpleline_t > const &

Methods

def append(self, *args) ‑> simpleline_t &
push_back(self, x)
x: simpleline_t const &
push_back(self) -> simpleline_t &
def at(self, *args) ‑> simpleline_t const &
__getitem__(self, i) -> simpleline_t const &
i: size_t
def back(self)
def begin(self, *args) ‑> qvector< simpleline_t >::const_iterator
begin(self) -> qvector< simpleline_t >::iterator
begin(self) -> qvector< simpleline_t >::const_iterator
def capacity(self, *args) ‑> size_t
capacity(self) -> size_t
def clear(self, *args) ‑> void
clear(self)
def empty(self, *args) ‑> bool
empty(self) -> bool
def end(self, *args) ‑> qvector< simpleline_t >::const_iterator
end(self) -> qvector< simpleline_t >::iterator
end(self) -> qvector< simpleline_t >::const_iterator
def erase(self, *args) ‑> qvector< simpleline_t >::iterator
erase(self, it) -> qvector< simpleline_t >::iterator
it: qvector< simpleline_t >::iterator
erase(self, first, last) -> qvector< simpleline_t >::iterator
first: qvector< simpleline_t >::iterator
last: qvector< simpleline_t >::iterator
def extract(self, *args) ‑> simpleline_t *
extract(self) -> simpleline_t *
def front(self)
def grow(self, *args) ‑> void
grow(self, x=simpleline_t())
x: simpleline_t const &
def inject(self, *args) ‑> void
inject(self, s, len)
s: simpleline_t *
len: size_t
def insert(self, *args) ‑> qvector< simpleline_t >::iterator
insert(self, it, x) -> qvector< simpleline_t >::iterator
it: qvector< simpleline_t >::iterator
x: simpleline_t const &
def pop_back(self, *args) ‑> void
pop_back(self)
def push_back(self, *args) ‑> simpleline_t &
push_back(self, x)
x: simpleline_t const &
push_back(self) -> simpleline_t &
def qclear(self, *args) ‑> void
qclear(self)
def reserve(self, *args) ‑> void
reserve(self, cnt)
cnt: size_t
def resize(self, *args) ‑> void
resize(self, _newsize, x)
_newsize: size_t
x: simpleline_t const &
resize(self, _newsize)
_newsize: size_t
def size(self, *args) ‑> size_t
size(self) -> size_t
def swap(self, *args) ‑> void
swap(self, r)
r: qvector< simpleline_t > &
def truncate(self, *args) ‑> void
truncate(self)
class sval_pointer (*args)
Proxy of C++ sval_pointer class.
__init__(self) -> sval_pointer

Static methods

def frompointer(*args) ‑> sval_pointer *
frompointer(t) -> sval_pointer
t: sval_t *

Methods

def assign(self, *args) ‑> void
assign(self, value)
value: sval_t
def cast(self, *args) ‑> sval_t *
cast(self) -> sval_t *
def value(self, *args) ‑> sval_t
value(self) -> sval_t
class tid_array (*args)
Proxy of C++ tid_array class.
__init__(self, nelements) -> tid_array
nelements: size_t

Static methods

def frompointer(*args) ‑> tid_array *
frompointer(t) -> tid_array
t: tid_t *

Methods

def cast(self, *args) ‑> tid_t *
cast(self) -> tid_t *
class uchar_array (*args)
Proxy of C++ uchar_array class.
__init__(self, nelements) -> uchar_array
nelements: size_t

Static methods

def frompointer(*args) ‑> uchar_array *
frompointer(t) -> uchar_array
t: uchar *

Methods

def cast(self, *args) ‑> uchar *
cast(self) -> uchar *
class uint64vec_t (*args)
Proxy of C++ qvector< unsigned long long > class.
__init__(self) -> uint64vec_t
__init__(self, x) -> uint64vec_t
x: qvector< unsigned long long > const &

Methods

def add_unique(self, *args) ‑> bool
add_unique(self, x) -> bool
x: unsigned long long const &
def append(self, *args) ‑> unsigned long long &
push_back(self, x)
x: unsigned long long const &
push_back(self) -> unsigned long long &
def at(self, *args) ‑> unsigned long long const &
__getitem__(self, i) -> unsigned long long const &
i: size_t
def back(self)
def begin(self, *args) ‑> qvector< unsigned long long >::const_iterator
begin(self) -> qvector< unsigned long long >::iterator
begin(self) -> qvector< unsigned long long >::const_iterator
def capacity(self, *args) ‑> size_t
capacity(self) -> size_t
def clear(self, *args) ‑> void
clear(self)
def empty(self, *args) ‑> bool
empty(self) -> bool
def end(self, *args) ‑> qvector< unsigned long long >::const_iterator
end(self) -> qvector< unsigned long long >::iterator
end(self) -> qvector< unsigned long long >::const_iterator
def erase(self, *args) ‑> qvector< unsigned long long >::iterator
erase(self, it) -> qvector< unsigned long long >::iterator
it: qvector< unsigned long long >::iterator
erase(self, first, last) -> qvector< unsigned long long >::iterator
first: qvector< unsigned long long >::iterator
last: qvector< unsigned long long >::iterator
def extract(self, *args) ‑> unsigned long long *
extract(self) -> unsigned long long *
def find(self, *args) ‑> qvector< unsigned long long >::const_iterator
find(self, x) -> qvector< unsigned long long >::iterator
x: unsigned long long const &
find(self, x) -> qvector< unsigned long long >::const_iterator
x: unsigned long long const &
def front(self)
def has(self, *args) ‑> bool
has(self, x) -> bool
x: unsigned long long const &
def inject(self, *args) ‑> void
inject(self, s, len)
s: unsigned long long *
len: size_t
def insert(self, *args) ‑> qvector< unsigned long long >::iterator
insert(self, it, x) -> qvector< unsigned long long >::iterator
it: qvector< unsigned long long >::iterator
x: unsigned long long const &
def pop_back(self, *args) ‑> void
pop_back(self)
def push_back(self, *args) ‑> unsigned long long &
push_back(self, x)
x: unsigned long long const &
push_back(self) -> unsigned long long &
def qclear(self, *args) ‑> void
qclear(self)
def reserve(self, *args) ‑> void
reserve(self, cnt)
cnt: size_t
def resize(self, *args) ‑> void
resize(self, _newsize, x)
_newsize: size_t
x: unsigned long long const &
resize(self, _newsize)
_newsize: size_t
def size(self, *args) ‑> size_t
size(self) -> size_t
def swap(self, *args) ‑> void
swap(self, r)
r: qvector< unsigned long long > &
def truncate(self, *args) ‑> void
truncate(self)
class ulonglongvec_t (*args)
Proxy of C++ qvector< unsigned long long > class.
__init__(self) -> uint64vec_t
__init__(self, x) -> uint64vec_t
x: qvector< unsigned long long > const &

Methods

def add_unique(self, *args) ‑> bool
add_unique(self, x) -> bool
x: unsigned long long const &
def append(self, *args) ‑> unsigned long long &
push_back(self, x)
x: unsigned long long const &
push_back(self) -> unsigned long long &
def at(self, *args) ‑> unsigned long long const &
__getitem__(self, i) -> unsigned long long const &
i: size_t
def back(self)
def begin(self, *args) ‑> qvector< unsigned long long >::const_iterator
begin(self) -> qvector< unsigned long long >::iterator
begin(self) -> qvector< unsigned long long >::const_iterator
def capacity(self, *args) ‑> size_t
capacity(self) -> size_t
def clear(self, *args) ‑> void
clear(self)
def empty(self, *args) ‑> bool
empty(self) -> bool
def end(self, *args) ‑> qvector< unsigned long long >::const_iterator
end(self) -> qvector< unsigned long long >::iterator
end(self) -> qvector< unsigned long long >::const_iterator
def erase(self, *args) ‑> qvector< unsigned long long >::iterator
erase(self, it) -> qvector< unsigned long long >::iterator
it: qvector< unsigned long long >::iterator
erase(self, first, last) -> qvector< unsigned long long >::iterator
first: qvector< unsigned long long >::iterator
last: qvector< unsigned long long >::iterator
def extract(self, *args) ‑> unsigned long long *
extract(self) -> unsigned long long *
def find(self, *args) ‑> qvector< unsigned long long >::const_iterator
find(self, x) -> qvector< unsigned long long >::iterator
x: unsigned long long const &
find(self, x) -> qvector< unsigned long long >::const_iterator
x: unsigned long long const &
def front(self)
def has(self, *args) ‑> bool
has(self, x) -> bool
x: unsigned long long const &
def inject(self, *args) ‑> void
inject(self, s, len)
s: unsigned long long *
len: size_t
def insert(self, *args) ‑> qvector< unsigned long long >::iterator
insert(self, it, x) -> qvector< unsigned long long >::iterator
it: qvector< unsigned long long >::iterator
x: unsigned long long const &
def pop_back(self, *args) ‑> void
pop_back(self)
def push_back(self, *args) ‑> unsigned long long &
push_back(self, x)
x: unsigned long long const &
push_back(self) -> unsigned long long &
def qclear(self, *args) ‑> void
qclear(self)
def reserve(self, *args) ‑> void
reserve(self, cnt)
cnt: size_t
def resize(self, *args) ‑> void
resize(self, _newsize, x)
_newsize: size_t
x: unsigned long long const &
resize(self, _newsize)
_newsize: size_t
def size(self, *args) ‑> size_t
size(self) -> size_t
def swap(self, *args) ‑> void
swap(self, r)
r: qvector< unsigned long long > &
def truncate(self, *args) ‑> void
truncate(self)
class uintvec_t (*args)
Proxy of C++ qvector< unsigned int > class.
__init__(self) -> uintvec_t
__init__(self, x) -> uintvec_t
x: qvector< unsigned int > const &

Subclasses

Methods

def add_unique(self, *args) ‑> bool
add_unique(self, x) -> bool
x: unsigned int const &
def append(self, *args) ‑> unsigned int &
push_back(self, x)
x: unsigned int const &
push_back(self) -> unsigned int &
def at(self, *args) ‑> unsigned int const &
__getitem__(self, i) -> unsigned int const &
i: size_t
def back(self)
def begin(self, *args) ‑> qvector< unsigned int >::const_iterator
begin(self) -> qvector< unsigned int >::iterator
begin(self) -> qvector< unsigned int >::const_iterator
def capacity(self, *args) ‑> size_t
capacity(self) -> size_t
def clear(self, *args) ‑> void
clear(self)
def empty(self, *args) ‑> bool
empty(self) -> bool
def end(self, *args) ‑> qvector< unsigned int >::const_iterator
end(self) -> qvector< unsigned int >::iterator
end(self) -> qvector< unsigned int >::const_iterator
def erase(self, *args) ‑> qvector< unsigned int >::iterator
erase(self, it) -> qvector< unsigned int >::iterator
it: qvector< unsigned int >::iterator
erase(self, first, last) -> qvector< unsigned int >::iterator
first: qvector< unsigned int >::iterator
last: qvector< unsigned int >::iterator
def extract(self, *args) ‑> unsigned int *
extract(self) -> unsigned int *
def find(self, *args) ‑> qvector< unsigned int >::const_iterator
find(self, x) -> qvector< unsigned int >::iterator
x: unsigned int const &
find(self, x) -> qvector< unsigned int >::const_iterator
x: unsigned int const &
def front(self)
def has(self, *args) ‑> bool
has(self, x) -> bool
x: unsigned int const &
def inject(self, *args) ‑> void
inject(self, s, len)
s: unsigned int *
len: size_t
def insert(self, *args) ‑> qvector< unsigned int >::iterator
insert(self, it, x) -> qvector< unsigned int >::iterator
it: qvector< unsigned int >::iterator
x: unsigned int const &
def pop_back(self, *args) ‑> void
pop_back(self)
def push_back(self, *args) ‑> unsigned int &
push_back(self, x)
x: unsigned int const &
push_back(self) -> unsigned int &
def qclear(self, *args) ‑> void
qclear(self)
def reserve(self, *args) ‑> void
reserve(self, cnt)
cnt: size_t
def resize(self, *args) ‑> void
resize(self, _newsize, x)
_newsize: size_t
x: unsigned int const &
resize(self, _newsize)
_newsize: size_t
def size(self, *args) ‑> size_t
size(self) -> size_t
def swap(self, *args) ‑> void
swap(self, r)
r: qvector< unsigned int > &
def truncate(self, *args) ‑> void
truncate(self)
class uvalvec_t (*args)
Proxy of C++ qvector< unsigned int > class.
__init__(self) -> uintvec_t
__init__(self, x) -> uintvec_t
x: qvector< unsigned int > const &

Subclasses

Methods

def add_unique(self, *args) ‑> bool
add_unique(self, x) -> bool
x: unsigned int const &
def append(self, *args) ‑> unsigned int &
push_back(self, x)
x: unsigned int const &
push_back(self) -> unsigned int &
def at(self, *args) ‑> unsigned int const &
__getitem__(self, i) -> unsigned int const &
i: size_t
def back(self)
def begin(self, *args) ‑> qvector< unsigned int >::const_iterator
begin(self) -> qvector< unsigned int >::iterator
begin(self) -> qvector< unsigned int >::const_iterator
def capacity(self, *args) ‑> size_t
capacity(self) -> size_t
def clear(self, *args) ‑> void
clear(self)
def empty(self, *args) ‑> bool
empty(self) -> bool
def end(self, *args) ‑> qvector< unsigned int >::const_iterator
end(self) -> qvector< unsigned int >::iterator
end(self) -> qvector< unsigned int >::const_iterator
def erase(self, *args) ‑> qvector< unsigned int >::iterator
erase(self, it) -> qvector< unsigned int >::iterator
it: qvector< unsigned int >::iterator
erase(self, first, last) -> qvector< unsigned int >::iterator
first: qvector< unsigned int >::iterator
last: qvector< unsigned int >::iterator
def extract(self, *args) ‑> unsigned int *
extract(self) -> unsigned int *
def find(self, *args) ‑> qvector< unsigned int >::const_iterator
find(self, x) -> qvector< unsigned int >::iterator
x: unsigned int const &
find(self, x) -> qvector< unsigned int >::const_iterator
x: unsigned int const &
def front(self)
def has(self, *args) ‑> bool
has(self, x) -> bool
x: unsigned int const &
def inject(self, *args) ‑> void
inject(self, s, len)
s: unsigned int *
len: size_t
def insert(self, *args) ‑> qvector< unsigned int >::iterator
insert(self, it, x) -> qvector< unsigned int >::iterator
it: qvector< unsigned int >::iterator
x: unsigned int const &
def pop_back(self, *args) ‑> void
pop_back(self)
def push_back(self, *args) ‑> unsigned int &
push_back(self, x)
x: unsigned int const &
push_back(self) -> unsigned int &
def qclear(self, *args) ‑> void
qclear(self)
def reserve(self, *args) ‑> void
reserve(self, cnt)
cnt: size_t
def resize(self, *args) ‑> void
resize(self, _newsize, x)
_newsize: size_t
x: unsigned int const &
resize(self, _newsize)
_newsize: size_t
def size(self, *args) ‑> size_t
size(self) -> size_t
def swap(self, *args) ‑> void
swap(self, r)
r: qvector< unsigned int > &
def truncate(self, *args) ‑> void
truncate(self)
class eavec_t (*args)
Proxy of C++ qvector< unsigned int > class.
__init__(self) -> uintvec_t
__init__(self, x) -> uintvec_t
x: qvector< unsigned int > const &

Subclasses

Methods

def add_unique(self, *args) ‑> bool
add_unique(self, x) -> bool
x: unsigned int const &
def append(self, *args) ‑> unsigned int &
push_back(self, x)
x: unsigned int const &
push_back(self) -> unsigned int &
def at(self, *args) ‑> unsigned int const &
__getitem__(self, i) -> unsigned int const &
i: size_t
def back(self)
def begin(self, *args) ‑> qvector< unsigned int >::const_iterator
begin(self) -> qvector< unsigned int >::iterator
begin(self) -> qvector< unsigned int >::const_iterator
def capacity(self, *args) ‑> size_t
capacity(self) -> size_t
def clear(self, *args) ‑> void
clear(self)
def empty(self, *args) ‑> bool
empty(self) -> bool
def end(self, *args) ‑> qvector< unsigned int >::const_iterator
end(self) -> qvector< unsigned int >::iterator
end(self) -> qvector< unsigned int >::const_iterator
def erase(self, *args) ‑> qvector< unsigned int >::iterator
erase(self, it) -> qvector< unsigned int >::iterator
it: qvector< unsigned int >::iterator
erase(self, first, last) -> qvector< unsigned int >::iterator
first: qvector< unsigned int >::iterator
last: qvector< unsigned int >::iterator
def extract(self, *args) ‑> unsigned int *
extract(self) -> unsigned int *
def find(self, *args) ‑> qvector< unsigned int >::const_iterator
find(self, x) -> qvector< unsigned int >::iterator
x: unsigned int const &
find(self, x) -> qvector< unsigned int >::const_iterator
x: unsigned int const &
def front(self)
def has(self, *args) ‑> bool
has(self, x) -> bool
x: unsigned int const &
def inject(self, *args) ‑> void
inject(self, s, len)
s: unsigned int *
len: size_t
def insert(self, *args) ‑> qvector< unsigned int >::iterator
insert(self, it, x) -> qvector< unsigned int >::iterator
it: qvector< unsigned int >::iterator
x: unsigned int const &
def pop_back(self, *args) ‑> void
pop_back(self)
def push_back(self, *args) ‑> unsigned int &
push_back(self, x)
x: unsigned int const &
push_back(self) -> unsigned int &
def qclear(self, *args) ‑> void
qclear(self)
def reserve(self, *args) ‑> void
reserve(self, cnt)
cnt: size_t
def resize(self, *args) ‑> void
resize(self, _newsize, x)
_newsize: size_t
x: unsigned int const &
resize(self, _newsize)
_newsize: size_t
def size(self, *args) ‑> size_t
size(self) -> size_t
def swap(self, *args) ‑> void
swap(self, r)
r: qvector< unsigned int > &
def truncate(self, *args) ‑> void
truncate(self)
class uval_array (*args)
Proxy of C++ uval_array class.
__init__(self, nelements) -> uval_array
nelements: size_t

Static methods

def frompointer(*args) ‑> uval_array *
frompointer(t) -> uval_array
t: uval_t *

Methods

def cast(self, *args) ‑> uval_t *
cast(self) -> uval_t *