def own_slots(
self, cls: Union[ClassDefinitionName,
ClassDefinition]) -> List[SlotDefinition]:
""" Return the list of slots owned the class definition. An "own slot" is any ``cls`` slot that does not appear
in the class is_a parent. Own_slots include:
* any slot whose domain is cls
* slot_usage entries
* slots from mixins entries
* slots from apply_to entries
@param cls: class name or class definition name
@return: list of owned slots. List is sorted if sort_class_slots is true, otherwise in class order
"""
if not isinstance(cls, ClassDefinition):
cls = self.schema.classes[cls]
parent = self.schema.classes[cls.is_a] if cls.is_a else None
seen = set()
rval = []
for sname in cls.slots:
sname_base = alias_root(self.schema, sname)
if sname_base not in seen and (not parent
or sname not in parent.slots):
slot = self.schema.slots[sname]
rval.append(slot)
seen.add(sname_base)
return sorted(rval,
key=lambda s: s.name) if self.sort_class_slots else rval
def all_slots(self, cls: Union[ClassDefinitionName, ClassDefinition], *, cls_slots_first: bool = False,
seen: Optional[Set[ClassDefinitionName]] = None) \
-> List[SlotDefinition]:
""" Return all slots that are part of the class definition. This includes all is_a, mixin and apply_to slots
but does NOT include slot_usage targets. If class B has a slot_usage entry for slot "s", only the slot
definition for the redefined slot will be included, not its base. Slots are added in the order they appear
in classes, with recursive is_a's being added first followed by mixins and finally apply_tos
@param cls: class definition or class definition name
@param cls_slots_first: True means return own slots at the top of the list
@param seen: List of slots already recorded. Used for internal recursion
@return: ordered list of slots in the class with slot usages removed
"""
if not isinstance(cls, ClassDefinition):
cls = self.schema.classes[cls]
if seen is None:
seen = set()
rval = []
parent = self.schema.classes[cls.is_a] if cls.is_a else None
if cls_slots_first:
for slot in self.own_slots(cls):
sname_base = alias_root(self.schema, slot.name)
if sname_base not in seen:
rval.append(slot)
seen.add(sname_base)
return rval + (self.all_slots(parent,
cls_slots_first=cls_slots_first,
seen=seen) if parent else [])
else:
for sname in cls.slots:
sname_base = alias_root(self.schema, sname)
if sname_base not in seen:
slot = self.schema.slots[sname]
rval.append(slot)
seen.add(sname_base)
return sorted(
rval, key=lambda s: s.name) if self.sort_class_slots else rval
