sage logo

Metaclass: CodedOrdinal

Documentation: Definition: Coded data, where the domain from which the codeset comes is ordered. The Coded Ordinal data type adds sematics related to ordering so that models that make use of such domains may introduce model elements that involve statements about the order of the terms in a domain Exhibit 79: type CodedOrdinal alias CO specializes CV { BL lessOrEqual(CO o); BL lessThan(CO o); BL greaterThan(CO o); BL greaterOrEqual(CO o); };

Superclasses
Subclasses
Types
Template Slots
  Slot Name Documentation Type Cardinality
code The code (in a terminology system) that represents a concept String 1:1
codedSystemVersion Version of code system in a concept descriptor String 0:1
codeSystem Identifier for the code system ObjectIdentifier 0:1
codeSystemName String name of code system String 1:1
displayName A name or title for the code, under which the sending system shows the code value to its users. String 0:1
label A short human readable string indicating the content of the instancehuman-readable string for the instance String 0:1
nullFlavor If a value is an exceptional value (NULL-value), this specifies in what way and why proper information is missing. Class 0:1
originalText The text or phrase used as the basis for the coding. EncapsulatedData 0:1
qualifier Specifies additional codes that increase the specificity of the the primary code. ConceptRole 0:0
translation A set of other concept descriptors that translate this concept descriptor into other code systems. ConceptDescriptor 0:0
:ROLE   {Abstract, Concrete} 0:1
:SLOT-CONSTRAINTS   :CONSTRAINT 0:*

Own Slots
  Slot Name Value
alias CO
semantic_properties BL lessOrEqual(CO o); BL lessThan(CO o); BL greaterThan(CO o); BL greaterOrEqual(CO o);
:ROLE Concrete
:SLOT-CONSTRAINTS  

  ^ back to top

Return to Class Hierarchy

Generated: 10/04/2006, 1:24:56 PM, Pacific Daylight Time

The SAGE project was supported in part by grant 70NANB1H3049 of the NIST Advanced Technology Program. Protégé is a trademark of Stanford University, Copyright (c) 1998-2006 Stanford University.