| Home | Trees | Index | Help |
|
|---|
| Package mmLib :: Module mmCIF :: Class mmCIFTable |
|
object--+ |list--+ | mmCIFTable
| Method Summary | |
|---|---|
__init__(self,
name,
columns)
| |
__deepcopy__(self,
memo)
| |
__delitem__(self,
i)
| |
__eq__(self,
other)
| |
Retrieves mmCIFRow at index x from the table if the argument is a integer. | |
__setitem__(self,
x,
value)
| |
append(self,
row)
| |
Automaticly sets the mmCITable column names by inspecting all mmCIFRow objects it contains. | |
get(self,
x,
default)
| |
Preforms a SQL-like 'AND' select aginst all the rows in the table, and returns the first matching row found. | |
insert(self,
i,
row)
| |
Return true if the table is not a _loop table with multiple rows of data. | |
This is the same as get_row, but it iterates over all matching rows in the table. | |
remove(self,
row)
| |
Return a dictionary mapping the value of the row's value in column 'key' to the row itself. | |
| Inherited from list | |
x.__add__(y) <==> x+y | |
x.__contains__(y) <==> y in x | |
Use of negative indices is not supported. | |
x.__ge__(y) <==> x>=y | |
x.__getattribute__('name') <==> x.name | |
Use of negative indices is not supported. | |
x.__gt__(y) <==> x>y | |
x.__hash__() <==> hash(x) | |
x.__iadd__(y) <==> x+=y | |
x.__imul__(y) <==> x*=y | |
x.__iter__() <==> iter(x) | |
x.__le__(y) <==> x<=y | |
x.__len__() <==> len(x) | |
x.__lt__(y) <==> x<y | |
x.__mul__(n) <==> x*n | |
x.__ne__(y) <==> x!=y | |
x.__repr__() <==> repr(x) | |
x.__rmul__(n) <==> n*x | |
Use of negative indices is not supported. | |
L.count(value) -> integer -- return number of occurrences of value | |
L.extend(iterable) -- extend list by appending elements from the iterable | |
L.index(value, [start, [stop]]) -> integer -- return first index of value | |
L.pop([index]) -> item -- remove and return item at index (default last) | |
L.reverse() -- reverse *IN PLACE* | |
L.sort(cmpfunc=None) -- stable sort *IN PLACE*; cmpfunc(x, y) -> -1, 0, 1 | |
| Inherited from object | |
x.__delattr__('name') <==> del x.name | |
helper for pickle | |
helper for pickle | |
x.__setattr__('name', value) <==> x.name = value | |
x.__str__() <==> str(x) | |
| Inherited from type | |
T.__new__(S, ...) -> a new object with type S, a subtype of T | |
| Class Variable Summary | |
|---|---|
list |
__slots__ = ['name', 'columns', 'data']
|
member_descriptor |
columns = <member 'columns' of 'mmCIFTable' objects>
|
member_descriptor |
data = <member 'data' of 'mmCIFTable' objects>
|
member_descriptor |
name = <member 'name' of 'mmCIFTable' objects>
|
| Method Details |
|---|
__getitem__(self,
x)
Retrieves mmCIFRow at index x from the table if the argument is a
integer. If the argument is a string, then the data from the first row
is returned.
|
autoset_columns(self)Automaticly sets the mmCITable column names by inspecting all mmCIFRow objects it contains. |
get_row(self, *args)
Preforms a SQL-like 'AND' select aginst all the rows in the table,
and returns the first matching row found. The arguments are a
variable list of tuples of the form:
(<column-name>, <column-value>)
For example:
ger_row(('atom_id','CA'),('entity_id', '1'))
returns the first matching row with atom_id==1 and entity_id==1.
|
is_single(self)Return true if the table is not a _loop table with multiple rows of data. |
iter_rows(self, *args)This is the same as get_row, but it iterates over all matching rows in the table. |
row_index_dict(self, key)Return a dictionary mapping the value of the row's value in column 'key' to the row itself. If there are multiple rows with the same key value, they will be overwritten with the last found row. |
| Class Variable Details |
|---|
__slots__
|
columns
|
data
|
name
|
| Home | Trees | Index | Help |
|
|---|
| Generated by Epydoc 2.0 on Wed Nov 24 17:34:56 2004 | http://epydoc.sf.net |