Method Summary |
|
__init__(self,
parent,
entries,
coerce_entries,
copy)
|
|
__getitem__(self,
i)
|
|
__setitem__ (self,
i,
value)
Set entry i of self to value. |
|
entries(self)
|
|
list(self)
|
Inherited from Vector |
|
__abs__ (self)
|
|
__add__ (self,
right)
|
|
__cmp__ (self,
right)
|
|
__invert__ (self)
|
|
__mod__ (self,
p)
|
|
__mul__ (self,
right)
|
|
__neg__ (self)
|
|
__pos__ (self)
|
|
__pow__ (self,
n)
|
|
__repr__ (self)
|
|
__rmul__ (self,
left)
|
|
__str__ (self)
|
|
__sub__ (self,
right)
|
|
base_field (self)
|
|
base_ring (self)
|
|
copy (self)
|
|
degree (self)
|
|
denominator (self)
|
|
dict (self)
|
|
get (self,
i)
get is meant to be more efficient than getitem, because it does not do
any error checking. |
|
height (self)
|
|
is_dense (self)
|
|
is_sparse (self)
|
|
is_vector (self)
|
|
nonzero_positions (self)
Returns the sorted list of integers i such that self[i] != 0. |
|
parent (self)
|
|
rational_reconstruction (self)
|
|
set (self,
i,
x)
set is meant to be more efficient than setitem, because it does not do
any error checking or coercion. |
|
str_latex (self)
Print a latex representation of self. |