Simple metamodel for object states. Contains definitions for:

  • State,
  • Object,
  • Link,
  • LinkObject.


Link(state, associationName, objects)
LinkObject(state, associationClassName, ...)
Object(state, className, name)
OrderedDict(*args, **kwds) Dictionary that remembers insertion order


class pyuseocl.state.LinkObject(state, associationClassName, name, objects)[source]
set(name, value)[source]


class pyuseocl.state.Object(state, className, name)[source]
set(name, value)[source]


class pyuseocl.state.OrderedDict(*args, **kwds)[source]

Dictionary that remembers insertion order

Initialize an ordered dictionary. The signature is the same as regular dictionaries, but keyword arguments are not recommended because their insertion order is arbitrary.

__setitem__(key, value, dict_setitem=<slot wrapper '__setitem__' of 'dict' objects>)[source]

od.__setitem__(i, y) <==> od[i]=y

__delitem__(key, dict_delitem=<slot wrapper '__delitem__' of 'dict' objects>)[source]

od.__delitem__(y) <==> del od[y]

__iter__() <==> iter(od)[source]
__reversed__() <==> reversed(od)[source]
clear() → None. Remove all items from od.[source]
keys() → list of keys in od[source]
values() → list of values in od[source]
items() → list of (key, value) pairs in od[source]
iterkeys() → an iterator over the keys in od[source]

od.itervalues -> an iterator over the values in od


od.iteritems -> an iterator over the (key, value) pairs in od

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

pop(k[, d]) → v, remove specified key and return the corresponding[source]

value. If key is not found, d is returned if given, otherwise KeyError is raised.

setdefault(k[, d]) → od.get(k,d), also set od[k]=d if k not in od[source]
popitem() → (k, v), return and remove a (key, value) pair.[source]

Pairs are returned in LIFO order if last is true or FIFO order if false.

__repr__() <==> repr(od)[source]

Return state information for pickling

copy() → a shallow copy of od[source]
classmethod fromkeys(S[, v]) → New ordered dictionary with keys from S.[source]

If not specified, the value defaults to None.


od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive while comparison to a regular mapping is order-insensitive.


od.__ne__(y) <==> od!=y

viewkeys() → a set-like object providing a view on od's keys[source]
viewvalues() → an object providing a view on od's values[source]
viewitems() → a set-like object providing a view on od's items[source]


class pyuseocl.state.State[source]


class pyuseocl.state.StateElement(state)[source]