Help on module __init__:

NAME
    __init__ - Logilab common library (aka Logilab's extension to the standard library).

FILE
    /usr/lib/python2.4/vendor-packages/logilab/common/__init__.py

MODULE DOCS
    http://www.python.org/doc/current/lib/module-__init__.html

DESCRIPTION
    :type STD_BLACKLIST: tuple
    :var STD_BLACKLIST: directories ignored by default by the functions in
      this package which have to recurse into directories
    
    :type IGNORED_EXTENSIONS: tuple
    :var IGNORED_EXTENSIONS: file extensions that may usually be ignored
    
    :copyright:
      2000-2008 `LOGILAB S.A. <http://www.logilab.fr>`_ (Paris, FRANCE),
      all rights reserved.
    
    :contact:
      http://www.logilab.org/project/logilab-common --
      mailto:python-projects@logilab.org
    
    :license:
      `General Public License version 2
      <http://www.gnu.org/licenses/old-licenses/gpl-2.0.html>`_

CLASSES
    __builtin__.dict(__builtin__.object)
        attrdict
    __builtin__.object
        nullobject
    
    class attrdict(__builtin__.dict)
     |  A dictionary for which keys are also accessible as attributes.
     |  
     |  Method resolution order:
     |      attrdict
     |      __builtin__.dict
     |      __builtin__.object
     |  
     |  Methods defined here:
     |  
     |  __getattr__(self, attr)
     |  
     |  ----------------------------------------------------------------------
     |  Data and other attributes defined here:
     |  
     |  __dict__ = <dictproxy object>
     |      dictionary for instance variables (if defined)
     |  
     |  __weakref__ = <attribute '__weakref__' of 'attrdict' objects>
     |      list of weak references to the object (if defined)
     |  
     |  ----------------------------------------------------------------------
     |  Methods inherited from __builtin__.dict:
     |  
     |  __cmp__(...)
     |      x.__cmp__(y) <==> cmp(x,y)
     |  
     |  __contains__(...)
     |      D.__contains__(k) -> True if D has a key k, else False
     |  
     |  __delitem__(...)
     |      x.__delitem__(y) <==> del x[y]
     |  
     |  __eq__(...)
     |      x.__eq__(y) <==> x==y
     |  
     |  __ge__(...)
     |      x.__ge__(y) <==> x>=y
     |  
     |  __getattribute__(...)
     |      x.__getattribute__('name') <==> x.name
     |  
     |  __getitem__(...)
     |      x.__getitem__(y) <==> x[y]
     |  
     |  __gt__(...)
     |      x.__gt__(y) <==> x>y
     |  
     |  __hash__(...)
     |      x.__hash__() <==> hash(x)
     |  
     |  __init__(...)
     |      x.__init__(...) initializes x; see x.__class__.__doc__ for signature
     |  
     |  __iter__(...)
     |      x.__iter__() <==> iter(x)
     |  
     |  __le__(...)
     |      x.__le__(y) <==> x<=y
     |  
     |  __len__(...)
     |      x.__len__() <==> len(x)
     |  
     |  __lt__(...)
     |      x.__lt__(y) <==> x<y
     |  
     |  __ne__(...)
     |      x.__ne__(y) <==> x!=y
     |  
     |  __repr__(...)
     |      x.__repr__() <==> repr(x)
     |  
     |  __setitem__(...)
     |      x.__setitem__(i, y) <==> x[i]=y
     |  
     |  clear(...)
     |      D.clear() -> None.  Remove all items from D.
     |  
     |  copy(...)
     |      D.copy() -> a shallow copy of D
     |  
     |  get(...)
     |      D.get(k[,d]) -> D[k] if k in D, else d.  d defaults to None.
     |  
     |  has_key(...)
     |      D.has_key(k) -> True if D has a key k, else False
     |  
     |  items(...)
     |      D.items() -> list of D's (key, value) pairs, as 2-tuples
     |  
     |  iteritems(...)
     |      D.iteritems() -> an iterator over the (key, value) items of D
     |  
     |  iterkeys(...)
     |      D.iterkeys() -> an iterator over the keys of D
     |  
     |  itervalues(...)
     |      D.itervalues() -> an iterator over the values of D
     |  
     |  keys(...)
     |      D.keys() -> list of D's keys
     |  
     |  pop(...)
     |      D.pop(k[,d]) -> v, remove specified key and return the corresponding value
     |      If key is not found, d is returned if given, otherwise KeyError is raised
     |  
     |  popitem(...)
     |      D.popitem() -> (k, v), remove and return some (key, value) pair as a
     |      2-tuple; but raise KeyError if D is empty
     |  
     |  setdefault(...)
     |      D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in D
     |  
     |  update(...)
     |      D.update(E, **F) -> None.  Update D from E and F: for k in E: D[k] = E[k]
     |      (if E has keys else: for (k, v) in E: D[k] = v) then: for k in F: D[k] = F[k]
     |  
     |  values(...)
     |      D.values() -> list of D's values
     |  
     |  ----------------------------------------------------------------------
     |  Data and other attributes inherited from __builtin__.dict:
     |  
     |  __new__ = <built-in method __new__ of type object>
     |      T.__new__(S, ...) -> a new object with type S, a subtype of T
     |  
     |  fromkeys = <built-in method fromkeys of type object>
     |      dict.fromkeys(S[,v]) -> New dict with keys from S and values equal to v.
     |      v defaults to None.
    
    class nullobject(__builtin__.object)
     |  Methods defined here:
     |  
     |  __nonzero__(self)
     |  
     |  ----------------------------------------------------------------------
     |  Data and other attributes defined here:
     |  
     |  __dict__ = <dictproxy object>
     |      dictionary for instance variables (if defined)
     |  
     |  __weakref__ = <attribute '__weakref__' of 'nullobject' objects>
     |      list of weak references to the object (if defined)

FUNCTIONS
    flatten(iterable, tr_func=None, results=None)
        Flatten a list of list with any level.
        
        If tr_func is not None, it should be a one argument function that'll be called
        on each final element.
        
        :rtype: list
        
        >>> flatten([1, [2, 3]])
        [1, 2, 3]
    
    make_domains(lists)
        Given a list of lists, return a list of domain for each list to produce all
        combinations of possibles values.
        
        :rtype: list
        
        Example:
        
        >>> make_domains(['a', 'b'], ['c','d', 'e'])
        [['a', 'b', 'a', 'b', 'a', 'b'], ['c', 'c', 'd', 'd', 'e', 'e']]

DATA
    IGNORED_EXTENSIONS = ('.pyc', '.pyo', '.elc', '~')
    STD_BLACKLIST = ('CVS', '.svn', '.hg', 'debian', 'dist', 'build')
    __docformat__ = 'restructuredtext en'
    __version__ = '0.39.0'

VERSION
    0.39.0