sfa.containers module¶
-
class
sfa.containers.
AlgorithmSet
(*args, **kwargs)¶ Bases:
sfa.containers.AlgorithmSet
Methods
clear
(self)create
(self[, keys])Create a single or multiple objects according to keys.
get
(self, key[, default])items
(self)keys
(self)pop
(self, key[, default])If key is not found, d is returned if given, otherwise KeyError is raised.
popitem
(self)as a 2-tuple; but raise KeyError if D is empty.
setdefault
(self, key[, default])update
(\*args, \*\*kwds)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, v in F.items(): D[k] = v
values
(self)get_all_keys
-
class
sfa.containers.
DataSet
(*args, **kwargs)¶ Bases:
sfa.containers.DataSet
Methods
clear
(self)create
(self[, keys])Create a single or multiple objects according to keys.
get
(self, key[, default])items
(self)keys
(self)pop
(self, key[, default])If key is not found, d is returned if given, otherwise KeyError is raised.
popitem
(self)as a 2-tuple; but raise KeyError if D is empty.
setdefault
(self, key[, default])update
(\*args, \*\*kwds)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, v in F.items(): D[k] = v
values
(self)get_all_keys