Home | Trees | Index | Help |
|
---|
Package young :: Module young :: Class Word |
|
object
--+ |list
--+ | Word
Method Summary | |
---|---|
__mul__(self,
other)
| |
__repr__(self)
| |
__str__(self)
| |
Test whether two words are Knuth equivalent. | |
w.L(k) returns the largest number thant can be realised as the sum of the lengths of k disjoint increasing sequences extracted from Word w. | |
Return a Young instance. | |
Inherited from list | |
x.__init__(...) initializes x; see x.__class__.__doc__ for signature | |
x.__add__(y) <==> x+y | |
x.__contains__(y) <==> y in x | |
x.__delitem__(y) <==> del x[y] | |
Use of negative indices is not supported. | |
x.__eq__(y) <==> x==y | |
x.__ge__(y) <==> x>=y | |
x.__getattribute__('name') <==> x.name | |
x.__getitem__(y) <==> x[y] | |
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.__ne__(y) <==> x!=y | |
T.__new__(S, ...) -> a new object with type S, a subtype of T | |
L.__reversed__() -- return a reverse iterator over the list | |
x.__rmul__(n) <==> n*x | |
x.__setitem__(i, y) <==> x[i]=y | |
Use of negative indices is not supported. | |
L.append(object) -- append object to end | |
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.insert(index, object) -- insert object before index | |
L.pop([index]) -> item -- remove and return item at index (default last) | |
L.remove(value) -- remove first occurrence of value | |
L.reverse() -- reverse *IN PLACE* | |
L.sort(cmp=None, key=None, reverse=False) -- stable sort *IN PLACE*; cmp(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 |
Method Details |
---|
equivalent(self, other)Test whether two words are Knuth equivalent. |
L(self, k)w.L(k) returns the largest number thant can be realised as the sum of the lengths of k disjoint increasing sequences extracted from Word w. |
toyoung(self)Return a Young instance. |
Home | Trees | Index | Help |
|
---|
Generated by Epydoc 2.1 on Wed Dec 08 22:20:20 2004 | http://epydoc.sf.net |