romcomma.user.functions.Vector§
- class Vector(name, **kwargs)[source]§
Bases:
dict
A vector functon, which is little more than a named dictionary of Scalar functions, such that
vector(X, **kwargs)
concatenatesscalar(X, **kwargs)
for each dictionary itemkey: Scalar
.- Parameters:
name (str) –
kwargs (Scalar) –
- __init__(name, **kwargs)[source]§
Construct a vector function.
- Parameters:
name (str) – The name of this
Vector
.**kwargs (Scalar) – The Dict of
Scalar``s comprising this ``Vector
.
Methods
__init__
(name, **kwargs)Construct a vector function.
clear
()concat
(name, vectors)Concatenate vectors.
copy
()fromkeys
([value])Create a new dictionary with keys from iterable and values set to value.
get
(key[, default])Return the value for key if key is in the dictionary, else default.
items
()keys
()pop
(k[,d])If the key is not found, return the default if given; otherwise, raise a KeyError.
popitem
()Remove and return a (key, value) pair as a 2-tuple.
setdefault
(key[, default])Insert key with a value of default if key is not in the dictionary.
subVector
(name, scalars)Create a subVector of
self
.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
()Attributes
Meta data for providing to
data.storage
.name
- classmethod concat(name, vectors)[source]§
Concatenate vectors.
- Parameters:
name (str) – The name of the returned
Vector
.vectors (Sequence[Vector]) – A sequence of
Vector
functions to concatenate.
- Return type:
Returns: The concatenation of
vectors
, namedname
.
- property meta: Dict§
Meta data for providing to
data.storage
.
- subVector(name, scalars)[source]§
Create a subVector of
self
.- Parameters:
name (str) – The name of the
subVector
.scalars (Sequence[str]) – The keys of the items of
self
to be included in subVector.
- Return type:
Returns: A new instance of
Vector
namedname
containing theScalars
keyedscalars
. Effectively the pseudo-sliceself[scalars]
.
- clear() None. Remove all items from D. §
- copy() a shallow copy of D §
- fromkeys(value=None, /)§
Create a new dictionary with keys from iterable and values set to value.
- get(key, default=None, /)§
Return the value for key if key is in the dictionary, else default.
- items() a set-like object providing a view on D's items §
- keys() a set-like object providing a view on D's keys §
- pop(k[, d]) v, remove specified key and return the corresponding value. §
If the key is not found, return the default if given; otherwise, raise a KeyError.
- popitem()§
Remove and return a (key, value) pair as a 2-tuple.
Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.
- setdefault(key, default=None, /)§
Insert key with a value of default if key is not in the dictionary.
Return the value for key if key is in the dictionary, else default.
- 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 §