# coding: utf-8
# AUTO-GENERATED FILE -- DO NOT EDIT

""" High performance data structures.
- deque:        ordered collection accessible from endpoints only
- defaultdict:  dict subclass with a default value factory
 """

__doc__ = """High performance data structures.
- deque:        ordered collection accessible from endpoints only
- defaultdict:  dict subclass with a default value factory
"""
__file__ = '/home/shared/src/ide/build-files/build-temp/runtimes-release/__os__/linux-x64/runtime-python2.7/lib/python2.7/lib-dynload/_collections.so'
__name__ = '_collections'
__package__ = None

class defaultdict(dict):
  """ defaultdict(default_factory[, ...]) --> dict with default factory
  
  The default factory is called without arguments to produce
  a new value when a key is not present, in __getitem__ only.
  A defaultdict compares equal to a dict with the same items.
  All remaining arguments are treated the same as if they were
  passed to the dict constructor, including keyword arguments.
   """

  def __init__(self, default_factory, *args):
    """ x.__init__(...) initializes x; see help(type(x)) for signature """
    return {}

  def copy(self):
    """ D.copy() -> a shallow copy of D. """
    return None

  default_factory = None

  def fromkeys(self, S, v=None):
    """ dict.fromkeys(S[,v]) -> New dict with keys from S and values equal to v.
    v defaults to None. """
    return {}

class deque(object):
  """ deque([iterable[, maxlen]]) --> deque object
  
  Build an ordered collection with optimized access from its endpoints. """

  def __init__(self, iterable=None, maxlen=None):
    """ x.__init__(...) initializes x; see help(type(x)) for signature """
    return None

  def append(self):
    """ Add an element to the right side of the deque. """
    pass

  def appendleft(self):
    """ Add an element to the left side of the deque. """
    pass

  def clear(self):
    """ Remove all elements from the deque. """
    pass

  def count(self, value):
    """ D.count(value) -> integer -- return number of occurrences of value """
    return 1

  def extend(self):
    """ Extend the right side of the deque with elements from the iterable """
    pass

  def extendleft(self):
    """ Extend the left side of the deque with elements from the iterable """
    pass

  maxlen = property(None, None, None,
                    """ maximum size of a deque or None if unbounded """
                    )


  def pop(self):
    """ Remove and return the rightmost element. """
    pass

  def popleft(self):
    """ Remove and return the leftmost element. """
    pass

  def remove(self, value):
    """ D.remove(value) -- remove first occurrence of value. """
    return None

  def reverse(self):
    """ D.reverse() -- reverse *IN PLACE* """
    return None

  def rotate(self):
    """ Rotate the deque n steps to the right (default n=1).  If n is negative, rotates left. """
    pass