PluginMap

class lsst.meas.base.PluginMap

Bases: collections.OrderedDict

Map of plugins to be run for a given task.

Notes

Plugins are classes derived from BasePlugin.

We assume plugins are added to the plugin map according to their “Execution Order”, so this class doesn’t actually do any of the sorting (though it does have to maintain that order, which it does by inheriting from collections.OrderedDict).

Methods Summary

clear()
copy()
fromkeys(S[, v])	If not specified, the value defaults to None.
get(k[,d])
items()
iter()	Return an iterator over plugins for use in single-object mode.
iterN()	Return an iterator over plugins for use in multi-object mode.
keys()
move_to_end	Move an existing element to the end (or beginning if last==False).
pop(k[,d])	value.
popitem($self, /[, last])	Remove and return a (key, value) pair from the dictionary.
setdefault(k[,d])
update([E, ]**F)	If E is present and has a .keys() method, then does: for k in E: D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]
values()

Methods Documentation

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

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

iter()

Return an iterator over plugins for use in single-object mode.

Notes

Plugins which should be used in single-object mode are identified by having the doMeasure config attribute evaluate to True. This is usually a simple boolean class attribute.

iterN()

Return an iterator over plugins for use in multi-object mode.

Notes

Plugins which should be used in multi-object mode are identified by having the doMeasureN config attribute evaluate to True. This is usually a simple boolean class attribute.

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($self, /, last=True)

Remove and return a (key, value) pair from the dictionary.

Pairs are returned in LIFO order if last is true or FIFO order if false.

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

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

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

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