LowercaseOrderedDict

class mpdaf.tools.LowercaseOrderedDict(*args)

Bases: collections.abc.MutableMapping, collections.OrderedDict

Ordered dictonary where all strings keys are case insensitive. i.e. keys such as ‘abc’, ‘ABC’, ‘Abc’ all map to the same value. This can be useful for mimicing the storage of FITS headers.

Methods Summary

clear()
copy()
fromkeys(S[, v])	If not specified, the value defaults to None.
get(k[,d])
items()
keys()
move_to_end	Move an existing element to the end (or beginning if last==False).
pop(k[,d])	If key is not found, d is returned if given, otherwise KeyError is raised.
popitem()	as a 2-tuple; but raise KeyError if D is empty.
setdefault(k[,d])
update([E, ]**F)	If E present and has a .keys() method, does: for k in E: D[k] = E[k] If E present and lacks .keys() method, does: for (k, v) in E: D[k] = v In either case, this is followed by: for k, v in F.items(): D[k] = v
values()

Methods Documentation

clear() → None. Remove all items from D.

copy() → a shallow copy of od

fromkeys(S[, v]) → New ordered dictionary with keys from S.

If not specified, the value defaults to None.

get(k[, d]) → D[k] if k in D, else d. d defaults to None.

items() → a set-like object providing a view on D's items

keys() → a set-like object providing a view on D's keys

move_to_end()

Move an existing element to the end (or beginning if last==False).

Raises KeyError if the element does not exist. When last=True, acts like a fast version of self[key]=self.pop(key).

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() → (k, v), remove and return some (key, value) pair

as a 2-tuple; but raise KeyError if D is empty.

setdefault(k[, d]) → D.get(k,d), also set D[k]=d if k not in D

update([E, ]**F) → None. Update D from mapping/iterable E and F.

If E present and has a .keys() method, does: for k in E: D[k] = E[k] If E present and lacks .keys() method, does: for (k, v) in E: D[k] = v In either case, this is followed by: for k, v in F.items(): D[k] = v

values() → an object providing a view on D's values