mne.Forward¶

class mne.Forward[source]¶

Forward class to represent info from forward solution.

Methods

`__contains__`((k) -> True if D has a key k, …)
`__getitem__`	x.__getitem__(y) <==> x[y]
`__iter__`() <==> iter(x)
`__len__`() <==> len(x)
`clear`(() -> None. Remove all items from D.)
`copy`()	Copy the Forward instance.
`fromkeys`(…)	v defaults to None.
`get`((k[,d]) -> D[k] if k in D, …)
`has_key`((k) -> True if D has a key k, else False)
`items`(() -> list of D’s (key, value) pairs, …)
`iteritems`(() -> an iterator over the (key, …)
`iterkeys`(() -> an iterator over the keys of D)
`itervalues`(…)
`keys`(() -> list of D’s keys)
`pop`((k[,d]) -> v, …)	If key is not found, d is returned if given, otherwise KeyError is raised
`popitem`(() -> (k, v), …)	2-tuple; but raise KeyError if D is empty.
`setdefault`((k[,d]) -> D.get(k,d), …)
`update`(([E, …)	If E present and has a .keys() method, does: for k in E: D[k] = E[k]
`values`(() -> list of D’s values)
`viewitems`(…)
`viewkeys`(…)
`viewvalues`(…)

fromkeys(S[, v]) → New dict with keys from S and values equal to v.¶: v defaults to None.

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.

update([E, ]**F) → None. Update D from dict/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 in F: D[k] = F[k]