Clinical Document Architecture with Australian Schema, published by Australian Digital Health Agency. This guide is not an authorized publication; it is the continuous build for version 1.0.0 built by the FHIR (HL7® FHIR® Standard) CI Build. This version is based on the current content of https://github.com/AuDigitalHealth/cda-au-schema/ and changes regularly. See the Directory of published versions
Active as of 2024-11-22 |
TTL representation of the QTY logical model.
@prefix fhir: <http://hl7.org/fhir/> .
@prefix owl: <http://www.w3.org/2002/07/owl#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
# - resource -------------------------------------------------------------------
a fhir:StructureDefinition ;
fhir:nodeRole fhir:treeRoot ;
fhir:id [ fhir:v "QTY"] ; #
fhir:text [
fhir:status [ fhir:v "generated" ] ;
fhir:div "<div xmlns=\"http://www.w3.org/1999/xhtml\">\n <p>The quantity data type is an abstract generalization for all data types (1) whose value set has an order relation (less-or-equal) and (2) where difference is defined in all of the data type's totally ordered value subsets. The quantity type abstraction is needed in defining certain other types, such as the interval and the probability distribution.</p>\n </div>"
] ; #
fhir:extension ( [
fhir:url [ fhir:v "http://hl7.org/fhir/tools/StructureDefinition/logical-target"^^xsd:anyURI ] ;
fhir:value [
a fhir:boolean ;
( fhir:extension [
fhir:url [ fhir:v "http://hl7.org/fhir/StructureDefinition/data-absent-reason"^^xsd:anyURI ] ;
fhir:value [ fhir:v "not-applicable" ] ] ) ]
] [
fhir:url [ fhir:v "http://hl7.org/fhir/tools/StructureDefinition/xml-namespace"^^xsd:anyURI ] ;
fhir:value [ fhir:v "urn:hl7-org:v3"^^xsd:anyURI ]
] [
fhir:url [ fhir:v "http://hl7.org/fhir/tools/StructureDefinition/logical-container"^^xsd:anyURI ] ;
fhir:value [ fhir:v "http://hl7.org/cda/stds/core/StructureDefinition/ClinicalDocument"^^xsd:anyURI ]
] ) ; #
fhir:url [ fhir:v "http://hl7.org/cda/stds/core/StructureDefinition/QTY"^^xsd:anyURI] ; #
fhir:version [ fhir:v "1.0.0"] ; #
fhir:name [ fhir:v "QTY"] ; #
fhir:title [ fhir:v "QTY: Quantity (V3 Data Type)"] ; #
fhir:status [ fhir:v "active"] ; #
fhir:experimental [ fhir:v "false"^^xsd:boolean] ; #
fhir:date [ fhir:v "2024-11-22T03:02:41+00:00"^^xsd:dateTime] ; #
fhir:publisher [ fhir:v "HL7"] ; #
fhir:description [ fhir:v "The quantity data type is an abstract generalization for all data types (1) whose value set has an order relation (less-or-equal) and (2) where difference is defined in all of the data type's totally ordered value subsets. The quantity type abstraction is needed in defining certain other types, such as the interval and the probability distribution."] ; #
fhir:fhirVersion [ fhir:v "5.0.0"] ; #
fhir:mapping ( [
fhir:identity [ fhir:v "rim" ] ;
fhir:uri [ fhir:v "http://hl7.org/v3"^^xsd:anyURI ] ;
fhir:name [ fhir:v "RIM Mapping" ]
] ) ; #
fhir:kind [ fhir:v "logical"] ; #
fhir:abstract [ fhir:v "true"^^xsd:boolean] ; #
fhir:type [ fhir:v "http://hl7.org/cda/stds/core/StructureDefinition/QTY"^^xsd:anyURI] ; #
fhir:baseDefinition [
fhir:v "http://hl7.org/cda/stds/core/StructureDefinition/ANY"^^xsd:anyURI ;
fhir:link <http://hl7.org/cda/stds/core/StructureDefinition/ANY>
] ; #
fhir:derivation [ fhir:v "specialization"] ; #
fhir:snapshot [
( fhir:element [
fhir:id [ fhir:v "QTY" ] ;
fhir:path [ fhir:v "QTY" ] ;
fhir:short [ fhir:v "Base for all types and resources" ] ;
fhir:definition [ fhir:v "is an abstract generalization for all data types (1) whose value set has an order relation (less-or-equal) and (2) where difference is defined in all of the data type's totally ordered value subsets. The quantity type abstraction is needed in defining certain other types, such as the interval and the probability distribution." ] ;
fhir:min [ fhir:v "1"^^xsd:nonNegativeInteger ] ;
fhir:max [ fhir:v "*" ] ;
fhir:base [
fhir:path [ fhir:v "Base" ] ;
fhir:min [ fhir:v "0"^^xsd:nonNegativeInteger ] ;
fhir:max [ fhir:v "*" ] ] ;
fhir:isModifier [ fhir:v "false"^^xsd:boolean ] ;
( fhir:mapping [
fhir:identity [ fhir:v "rim" ] ;
fhir:map [ fhir:v "n/a" ] ] ) ] [
fhir:id [ fhir:v "QTY.nullFlavor" ] ;
fhir:path [ fhir:v "QTY.nullFlavor" ] ;
( fhir:representation [ fhir:v "xmlAttr" ] ) ;
fhir:label [ fhir:v "Exceptional Value Detail" ] ;
fhir:definition [ fhir:v "If a value is an exceptional value (NULL-value), this specifies in what way and why proper information is missing." ] ;
fhir:min [ fhir:v "0"^^xsd:nonNegativeInteger ] ;
fhir:max [ fhir:v "1" ] ;
fhir:base [
fhir:path [ fhir:v "ANY.nullFlavor" ] ;
fhir:min [ fhir:v "0"^^xsd:nonNegativeInteger ] ;
fhir:max [ fhir:v "1" ] ] ;
( fhir:type [
fhir:code [ fhir:v "code"^^xsd:anyURI ] ;
( fhir:profile [
fhir:v "http://hl7.org/cda/stds/core/StructureDefinition/cs-simple"^^xsd:anyURI ;
fhir:link <http://hl7.org/cda/stds/core/StructureDefinition/cs-simple> ] ) ] ) ;
fhir:binding [
fhir:strength [ fhir:v "required" ] ;
fhir:valueSet [
fhir:v "http://hl7.org/cda/stds/core/ValueSet/CDANullFlavor"^^xsd:anyURI ;
fhir:link <http://hl7.org/cda/stds/core/ValueSet/CDANullFlavor> ] ] ] )
] ; #
fhir:differential [
( fhir:element [
fhir:id [ fhir:v "QTY" ] ;
fhir:path [ fhir:v "QTY" ] ;
fhir:definition [ fhir:v "is an abstract generalization for all data types (1) whose value set has an order relation (less-or-equal) and (2) where difference is defined in all of the data type's totally ordered value subsets. The quantity type abstraction is needed in defining certain other types, such as the interval and the probability distribution." ] ;
fhir:min [ fhir:v "1"^^xsd:nonNegativeInteger ] ;
fhir:max [ fhir:v "*" ] ] )
] . #
IG © 2024+ Australian Digital Health Agency. Package au.digitalhealth.cda.schema#1.0.0 based on FHIR 5.0.0. Generated 2024-11-22
Links: Table of Contents | QA Report | Version History | Report an issue or propose a change
Publisher: Australian Digital Health Agency | ABN: 84 425 496 912, Level 25, 175 Liverpool Street, Sydney, NSW 2000 | Phone: 1300 901 001 | Email: help@digitalhealth.gov.au | https://www.digitalhealth.gov.au | Privacy policy | Terms of Use