MultiOrderedDict Class Reference

Inheritance diagram for MultiOrderedDict:

Collaboration diagram for MultiOrderedDict:

Public Member Functions
	__init__ (self, *args, **kwds)
	__setitem__ (self, key, val, i=None)
	copy (self)
	insert (self, i, key, val)
Public Member Functions inherited from OrderedDict
	__delitem__ (self, key, dict_delitem=dict.__delitem__)
	__eq__ (self, other)
	__iter__ (self)
	__ne__ (self, other)
	__reduce__ (self)
	__repr__ (self, _repr_running={})
	__reversed__ (self)
	clear (self)
	fromkeys (cls, iterable, value=None)
	items (self)
	iteritems (self)
	iterkeys (self)
	itervalues (self)
	keys (self)
	pop (self, key, default=__marker)
	popitem (self, last=True)
	setdefault (self, key, default=None)
	update (*args, **kwds)
	values (self)
	viewitems (self)
	viewkeys (self)
	viewvalues (self)

Detailed Description

Definition at line 266 of file astdicts.py.

Constructor & Destructor Documentation

__init__()

__init__	(		self,
		*	args,
		**	kwds
	)

Initialize an ordered dictionary.  Signature is the same as for
regular dictionaries, but keyword arguments are not recommended
because their insertion order is arbitrary.

Reimplemented from OrderedDict.

Reimplemented in Section.

Definition at line 267 of file astdicts.py.

    def __init__(self, *args, **kwds):
        OrderedDict.__init__(self, *args, **kwds)
 

Member Function Documentation

__setitem__()

__setitem__	(		self,
			key,
			val,
			i = None
	)

Reimplemented from OrderedDict.

Definition at line 270 of file astdicts.py.

    def __setitem__(self, key, val, i=None):
        if key not in self:
#            print("__setitem__ key = " + key + " val = " + val)
            OrderedDict.__setitem__(
                self, key, val if isinstance(val, list) else [val])
            return
#        print("inserting key = " + key + " val = " + val)
        vals = self[key]
        if i is None:
            i = len(vals)
 
        if not isinstance(val, list):
            if val not in vals:
                vals.insert(i, val)
        else:
            for j in val.reverse():
                if j not in vals:
                    vals.insert(i, j)
 
 

References len().

Referenced by MultiOrderedDict.insert().

copy()

copy

(

self

)

Reimplemented from OrderedDict.

Definition at line 293 of file astdicts.py.

    def copy(self):
        # TODO - find out why for some reason copies
        #        the [] as an [[]], so do manually
        c = MultiOrderedDict() #self.__class__(self)
        for key, val in self.iteritems():
            for v in val:
                c[key] = v
        return c

References OrderedDict.iteritems().

insert()

insert	(		self,
			i,
			key,
			val
	)

Definition at line 290 of file astdicts.py.

    def insert(self, i, key, val):
        self.__setitem__(key, val, i)
 

References MultiOrderedDict.__setitem__(), and OrderedDict.__setitem__().

Referenced by Section.add_defaults(), and Section.add_templates().

---

The documentation for this class was generated from the following file:

• astdicts.py