Home | Trees | Indices | Help |
|
---|
|
object --+ | list --+ | ListSet
ListSet is an internal Muntjac class which implements a combination of
a List and a Set. The main purpose of this class is to provide a list
with a fast contains method. Each inserted object must by unique (as
specified by equals
). The set method allows duplicates because of the way sort
works.
This class is subject to change and should not be used outside Muntjac core.
|
|||
new empty list |
|
||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from Inherited from |
|
|||
Inherited from |
|
|||
Inherited from |
|
x.__init__(...) initializes x; see help(type(x)) for signature
|
y in x
|
append object to end
|
insert object before index
|
extend list by appending elements from the iterable
|
L.index(value, [start, [stop]]) -> integer -- return first index of value. Raises ValueError if the value is not present.
|
remove first occurrence of value. Raises ValueError if the value is not present.
|
Marks the "element" can be found more than once from the list. Allowed in set to make sorting work. |
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Sat Apr 20 16:01:19 2013 | http://epydoc.sourceforge.net |