mne.
Projection
[source]¶Projection vector.
A basic class to proj a meaningful print for projection vectors.
Methods
__contains__ ($self, key, /) |
True if D has a key k, else False. |
__getitem__ |
x.__getitem__(y) <==> x[y] |
__iter__ ($self, /) |
Implement iter(self). |
__len__ ($self, /) |
Return len(self). |
clear () |
|
copy () |
|
fromkeys ($type, iterable[, value]) |
Returns a new dict with keys from iterable and values equal to value. |
get (k[,d]) |
|
items () |
|
keys () |
|
plot_topomap ([layout, cmap, sensors, …]) |
Plot topographic maps of SSP projections. |
pop (k[,d]) |
If key is not found, d is returned if given, otherwise KeyError is raised |
popitem () |
2-tuple; but raise KeyError if D is empty. |
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 () |
__contains__
($self, key, /)¶True if D has a key k, else False.
__getitem__
()¶x.__getitem__(y) <==> x[y]
__iter__
($self, /)¶Implement iter(self).
__len__
($self, /)¶Return len(self).
clear
() → None. Remove all items from D.¶copy
() → a shallow copy of D¶fromkeys
($type, iterable, value=None, /)¶Returns a new dict with keys from iterable and values equal to value.
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¶plot_topomap
(layout=None, cmap=None, sensors=True, colorbar=False, res=64, size=1, show=True, outlines='head', contours=6, image_interp='bilinear', axes=None, info=None)[source]¶Plot topographic maps of SSP projections.
Parameters: |
|
---|---|
Returns: |
|
Notes
New in version 0.15.0.
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 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¶