libtbx.containers
index
/net/chevy/raid1/nat/src/cctbx_project/libtbx/containers.py

 
Modules
       
collections
sys

 
Classes
       
__builtin__.object
deque_template
queue
hashed_queue
stack
hashed_stack
_abcoll.MutableSet(_abcoll.Set)
OrderedSet

 
class OrderedSet(_abcoll.MutableSet)
    http://code.activestate.com/recipes/528878-ordered-set/
Minor changes for Python 2.3 compatibility.
 
 
Method resolution order:
OrderedSet
_abcoll.MutableSet
_abcoll.Set
_abcoll.Sized
_abcoll.Iterable
_abcoll.Container
__builtin__.object

Methods defined here:
__contains__(self, key)
__copy__(self)
__deepcopy__(self, memo)
__del__(self)
__eq__(self, other)
__init__(self, iterable=None)
__iter__(self)
__len__(self)
__ne__(self, other)
__repr__(self)
__reversed__(self)
add(self, key)
copy = __copy__(self)
discard(self, key)
pop(self, last=True)

Data and other attributes defined here:
__abstractmethods__ = frozenset([])

Methods inherited from _abcoll.MutableSet:
__iand__(self, it)
__ior__(self, it)
__isub__(self, it)
__ixor__(self, it)
clear(self)
This is slow (creates N new iterators!) but effective.
remove(self, value)
Remove an element. If not a member, raise a KeyError.

Methods inherited from _abcoll.Set:
__and__(self, other)
__ge__(self, other)
__gt__(self, other)
__le__(self, other)
__lt__(self, other)
__or__(self, other)
__sub__(self, other)
__xor__(self, other)
isdisjoint(self, other)

Data and other attributes inherited from _abcoll.Set:
__hash__ = None

Class methods inherited from _abcoll.Sized:
__subclasshook__(cls, C) from abc.ABCMeta

Data descriptors inherited from _abcoll.Sized:
__dict__
dictionary for instance variables (if defined)
__weakref__
list of weak references to the object (if defined)

Data and other attributes inherited from _abcoll.Sized:
__metaclass__ = <class 'abc.ABCMeta'>
Metaclass for defining Abstract Base Classes (ABCs).
 
Use this metaclass to create an ABC.  An ABC can be subclassed
directly, and then acts as a mix-in class.  You can also register
unrelated concrete classes (even built-in classes) and unrelated
ABCs as 'virtual subclasses' -- these and their descendants will
be considered subclasses of the registering ABC by the built-in
issubclass() function, but the registering ABC won't show up in
their MRO (Method Resolution Order) nor will method
implementations defined by the registering ABC be callable (not
even via super()).

 
class deque_template(__builtin__.object)
     Methods defined here:
__contains__(self, item)
__init__(self)
__nonzero__(self)
push(self, item)

 
class hashed_queue(queue)
    
Method resolution order:
hashed_queue
queue
deque_template
__builtin__.object

Data and other attributes defined here:
set_proxy_type = <type 'set'>
set() -> new empty set object
set(iterable) -> new set object
 
Build an unordered collection of unique elements.

Methods inherited from queue:
pull(self)

Data descriptors inherited from queue:
__dict__
dictionary for instance variables (if defined)
__weakref__
list of weak references to the object (if defined)

Data and other attributes inherited from queue:
list_proxy_type = <type 'collections.deque'>
deque(iterable[, maxlen]) --> deque object
 
Build an ordered collection with optimized access from its endpoints.

Methods inherited from deque_template:
__contains__(self, item)
__init__(self)
__nonzero__(self)
push(self, item)

 
class hashed_stack(stack)
    
Method resolution order:
hashed_stack
stack
deque_template
__builtin__.object

Data and other attributes defined here:
set_proxy_type = <type 'set'>
set() -> new empty set object
set(iterable) -> new set object
 
Build an unordered collection of unique elements.

Methods inherited from stack:
pull(self)

Data descriptors inherited from stack:
__dict__
dictionary for instance variables (if defined)
__weakref__
list of weak references to the object (if defined)

Data and other attributes inherited from stack:
list_proxy_type = <type 'list'>
list() -> new empty list
list(iterable) -> new list initialized from iterable's items

Methods inherited from deque_template:
__contains__(self, item)
__init__(self)
__nonzero__(self)
push(self, item)

 
class queue(deque_template)
    
Method resolution order:
queue
deque_template
__builtin__.object

Methods defined here:
pull(self)

Data descriptors defined here:
__dict__
dictionary for instance variables (if defined)
__weakref__
list of weak references to the object (if defined)

Data and other attributes defined here:
list_proxy_type = <type 'collections.deque'>
deque(iterable[, maxlen]) --> deque object
 
Build an ordered collection with optimized access from its endpoints.
set_proxy_type = None

Methods inherited from deque_template:
__contains__(self, item)
__init__(self)
__nonzero__(self)
push(self, item)

 
class stack(deque_template)
    
Method resolution order:
stack
deque_template
__builtin__.object

Methods defined here:
pull(self)

Data descriptors defined here:
__dict__
dictionary for instance variables (if defined)
__weakref__
list of weak references to the object (if defined)

Data and other attributes defined here:
list_proxy_type = <type 'list'>
list() -> new empty list
list(iterable) -> new list initialized from iterable's items
set_proxy_type = None

Methods inherited from deque_template:
__contains__(self, item)
__init__(self)
__nonzero__(self)
push(self, item)

 
Data
        division = _Feature((2, 2, 0, 'alpha', 2), (3, 0, 0, 'alpha', 0), 8192)