mne.
Info
¶Information about the recording.
This data structure behaves like a dictionary. It contains all meta-data that is available for a recording.
The attributes listed below are the possible dictionary entries:
Attributes: | bads : list of str
ch_names : list-like of str (read-only)
chs : list of dict
comps : list of dict
custom_ref_applied : bool
events : list of dict
hpi_results : list of dict
meas_date : list of int
nchan : int
projs : list of dict
sfreq : float
acq_pars : str | None
acq_stim : str | None
buffer_size_sec : float | None
ctf_head_t : dict | None
description : str | None
dev_ctf_t : dict | None
dev_head_t : dict | None
dig : list of dict | None
experimentor : str | None
file_id : dict | None
filename : str | None
highpass : float | None
hpi_meas : list of dict | None
hpi_subsystem : dict | None
line_freq : float | None
lowpass : float | None
meas_id : dict | None
proj_id : int | None
proj_name : str | None
subject_info : dict | None
proc_history : list of dict | None | not present in dict
|
---|
Methods
clear (() -> None. Remove all items from D.) |
|
copy () |
Copy the 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) |
|
normalize_proj () |
(Re-)Normalize projection vectors after subselection |
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 (...) |
__init__
()¶x.__init__(...) initializes x; see help(type(x)) for signature
clear
() → None. Remove all items from D.¶copy
()¶Copy the instance
Returns: | info : instance of Info
|
---|
fromkeys
(S[, v]) → New dict with keys from S and values equal to v.¶v defaults to None.
get
(k[, d]) → D[k] if k in D, else d. d defaults to None.¶has_key
(k) → True if D has a key k, else False¶items
() → list of D's (key, value) pairs, as 2-tuples¶iteritems
() → an iterator over the (key, value) items of D¶iterkeys
() → an iterator over the keys of D¶itervalues
() → an iterator over the values of D¶keys
() → list of D's keys¶normalize_proj
()¶(Re-)Normalize projection vectors after subselection
Applying projection after sub-selecting a set of channels that were originally used to compute the original projection vectors can be dangerous (e.g., if few channels remain, most power was in channels that are no longer picked, etc.). By default, mne will emit a warning when this is done.
This function will re-normalize projectors to use only the remaining channels, thus avoiding that warning. Only use this function if you’re confident that the projection vectors still adequately capture the original signal of interest.
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 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]
values
() → list of D's values¶viewitems
() → a set-like object providing a view on D's items¶viewkeys
() → a set-like object providing a view on D's keys¶viewvalues
() → an object providing a view on D's values¶