19declare(strict_types=1);
32 $this->tree =
$DIC->repositoryTree();
55 $this->value = $a_value;
99 $valid = parent::isValid();
102 !$this->tree->isInTree($this->getTargetRefId()) ||
103 $this->tree->isDeleted($this->getTargetRefId())
126 $obj =
new stdClass();
139 if (is_object($a_std)) {
ADT definition base class.
__construct(ilADTDefinition $a_def)
exportStdClass()
@inheritDoc
setTargetRefId(?int $a_value)
importStdClass(?stdClass $a_std)
@inheritDoc
getCheckSum()
Get unique checksum.
isSmaller(ilADT $a_adt)
Check if given ADT is smaller than self.
isValidDefinition(ilADTDefinition $a_def)
isLarger(ilADT $a_adt)
Check if given ADT is larger than self.
addValidationError(string $a_error_code)
getCheckSum()
Get unique checksum.
getDefinition()
Get definition.
Tree class data representation in hierachical trees using the Nested Set Model with Gaps by Joe Celco...
__construct(Container $dic, ilPlugin $plugin)
@inheritDoc