@medplum/core 0.2.2 → 0.3.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (640) hide show
  1. package/README.md +29 -25
  2. package/dist/cache.d.ts +1 -0
  3. package/dist/cache.js +3 -0
  4. package/dist/cache.js.map +1 -1
  5. package/dist/client.d.ts +66 -54
  6. package/dist/client.js +153 -122
  7. package/dist/client.js.map +1 -1
  8. package/dist/eventtarget.js +1 -1
  9. package/dist/eventtarget.js.map +1 -1
  10. package/dist/format.d.ts +1 -1
  11. package/dist/format.js.map +1 -1
  12. package/dist/index.d.ts +0 -2
  13. package/dist/index.js +0 -2
  14. package/dist/index.js.map +1 -1
  15. package/dist/jwt.js.map +1 -1
  16. package/dist/outcomes.d.ts +1 -1
  17. package/dist/outcomes.js +42 -28
  18. package/dist/outcomes.js.map +1 -1
  19. package/dist/search.js +4 -4
  20. package/dist/search.js.map +1 -1
  21. package/dist/searchparams.d.ts +1 -1
  22. package/dist/searchparams.js +1 -2
  23. package/dist/searchparams.js.map +1 -1
  24. package/dist/storage.js.map +1 -1
  25. package/dist/types.d.ts +1 -1
  26. package/dist/types.js +6 -6
  27. package/dist/types.js.map +1 -1
  28. package/dist/utils.d.ts +1 -1
  29. package/dist/utils.js +11 -6
  30. package/dist/utils.js.map +1 -1
  31. package/package.json +5 -6
  32. package/dist/fhir/AccessPolicy.d.ts +0 -75
  33. package/dist/fhir/AccessPolicy.js +0 -7
  34. package/dist/fhir/AccessPolicy.js.map +0 -1
  35. package/dist/fhir/Account.d.ts +0 -247
  36. package/dist/fhir/Account.js +0 -7
  37. package/dist/fhir/Account.js.map +0 -1
  38. package/dist/fhir/ActivityDefinition.d.ts +0 -500
  39. package/dist/fhir/ActivityDefinition.js +0 -7
  40. package/dist/fhir/ActivityDefinition.js.map +0 -1
  41. package/dist/fhir/Address.d.ts +0 -75
  42. package/dist/fhir/Address.js +0 -7
  43. package/dist/fhir/Address.js.map +0 -1
  44. package/dist/fhir/AdverseEvent.d.ts +0 -303
  45. package/dist/fhir/AdverseEvent.js +0 -7
  46. package/dist/fhir/AdverseEvent.js.map +0 -1
  47. package/dist/fhir/Age.d.ts +0 -47
  48. package/dist/fhir/Age.js +0 -7
  49. package/dist/fhir/Age.js.map +0 -1
  50. package/dist/fhir/AllergyIntolerance.d.ts +0 -283
  51. package/dist/fhir/AllergyIntolerance.js +0 -7
  52. package/dist/fhir/AllergyIntolerance.js.map +0 -1
  53. package/dist/fhir/Annotation.d.ts +0 -42
  54. package/dist/fhir/Annotation.js +0 -7
  55. package/dist/fhir/Annotation.js.map +0 -1
  56. package/dist/fhir/Appointment.d.ts +0 -284
  57. package/dist/fhir/Appointment.js +0 -7
  58. package/dist/fhir/Appointment.js.map +0 -1
  59. package/dist/fhir/AppointmentResponse.d.ts +0 -131
  60. package/dist/fhir/AppointmentResponse.js +0 -7
  61. package/dist/fhir/AppointmentResponse.js.map +0 -1
  62. package/dist/fhir/Attachment.d.ts +0 -58
  63. package/dist/fhir/Attachment.js +0 -7
  64. package/dist/fhir/Attachment.js.map +0 -1
  65. package/dist/fhir/AuditEvent.d.ts +0 -458
  66. package/dist/fhir/AuditEvent.js +0 -7
  67. package/dist/fhir/AuditEvent.js.map +0 -1
  68. package/dist/fhir/Basic.d.ts +0 -110
  69. package/dist/fhir/Basic.js +0 -7
  70. package/dist/fhir/Basic.js.map +0 -1
  71. package/dist/fhir/Binary.d.ts +0 -59
  72. package/dist/fhir/Binary.js +0 -7
  73. package/dist/fhir/Binary.js.map +0 -1
  74. package/dist/fhir/BiologicallyDerivedProduct.d.ts +0 -358
  75. package/dist/fhir/BiologicallyDerivedProduct.js +0 -7
  76. package/dist/fhir/BiologicallyDerivedProduct.js.map +0 -1
  77. package/dist/fhir/BodyStructure.d.ts +0 -119
  78. package/dist/fhir/BodyStructure.js +0 -7
  79. package/dist/fhir/BodyStructure.js.map +0 -1
  80. package/dist/fhir/Bot.d.ts +0 -49
  81. package/dist/fhir/Bot.js +0 -7
  82. package/dist/fhir/Bot.js.map +0 -1
  83. package/dist/fhir/Bundle.d.ts +0 -379
  84. package/dist/fhir/Bundle.js +0 -7
  85. package/dist/fhir/Bundle.js.map +0 -1
  86. package/dist/fhir/CapabilityStatement.d.ts +0 -1044
  87. package/dist/fhir/CapabilityStatement.js +0 -7
  88. package/dist/fhir/CapabilityStatement.js.map +0 -1
  89. package/dist/fhir/CarePlan.d.ts +0 -446
  90. package/dist/fhir/CarePlan.js +0 -7
  91. package/dist/fhir/CarePlan.js.map +0 -1
  92. package/dist/fhir/CareTeam.d.ts +0 -211
  93. package/dist/fhir/CareTeam.js +0 -7
  94. package/dist/fhir/CareTeam.js.map +0 -1
  95. package/dist/fhir/CatalogEntry.d.ts +0 -195
  96. package/dist/fhir/CatalogEntry.js +0 -7
  97. package/dist/fhir/CatalogEntry.js.map +0 -1
  98. package/dist/fhir/ChargeItem.d.ts +0 -287
  99. package/dist/fhir/ChargeItem.js +0 -7
  100. package/dist/fhir/ChargeItem.js.map +0 -1
  101. package/dist/fhir/ChargeItemDefinition.d.ts +0 -401
  102. package/dist/fhir/ChargeItemDefinition.js +0 -7
  103. package/dist/fhir/ChargeItemDefinition.js.map +0 -1
  104. package/dist/fhir/Claim.d.ts +0 -1092
  105. package/dist/fhir/Claim.js +0 -7
  106. package/dist/fhir/Claim.js.map +0 -1
  107. package/dist/fhir/ClaimResponse.d.ts +0 -1040
  108. package/dist/fhir/ClaimResponse.js +0 -7
  109. package/dist/fhir/ClaimResponse.js.map +0 -1
  110. package/dist/fhir/ClientApplication.d.ts +0 -46
  111. package/dist/fhir/ClientApplication.js +0 -7
  112. package/dist/fhir/ClientApplication.js.map +0 -1
  113. package/dist/fhir/ClinicalImpression.d.ts +0 -306
  114. package/dist/fhir/ClinicalImpression.js +0 -7
  115. package/dist/fhir/ClinicalImpression.js.map +0 -1
  116. package/dist/fhir/CodeSystem.d.ts +0 -541
  117. package/dist/fhir/CodeSystem.js +0 -7
  118. package/dist/fhir/CodeSystem.js.map +0 -1
  119. package/dist/fhir/CodeableConcept.d.ts +0 -33
  120. package/dist/fhir/CodeableConcept.js +0 -7
  121. package/dist/fhir/CodeableConcept.js.map +0 -1
  122. package/dist/fhir/Coding.d.ts +0 -50
  123. package/dist/fhir/Coding.js +0 -7
  124. package/dist/fhir/Coding.js.map +0 -1
  125. package/dist/fhir/Communication.d.ts +0 -264
  126. package/dist/fhir/Communication.js +0 -7
  127. package/dist/fhir/Communication.js.map +0 -1
  128. package/dist/fhir/CommunicationRequest.d.ts +0 -261
  129. package/dist/fhir/CommunicationRequest.js +0 -7
  130. package/dist/fhir/CommunicationRequest.js.map +0 -1
  131. package/dist/fhir/CompartmentDefinition.d.ts +0 -217
  132. package/dist/fhir/CompartmentDefinition.js +0 -7
  133. package/dist/fhir/CompartmentDefinition.js.map +0 -1
  134. package/dist/fhir/Composition.d.ts +0 -429
  135. package/dist/fhir/Composition.js +0 -7
  136. package/dist/fhir/Composition.js.map +0 -1
  137. package/dist/fhir/ConceptMap.d.ts +0 -518
  138. package/dist/fhir/ConceptMap.js +0 -7
  139. package/dist/fhir/ConceptMap.js.map +0 -1
  140. package/dist/fhir/Condition.d.ts +0 -326
  141. package/dist/fhir/Condition.js +0 -7
  142. package/dist/fhir/Condition.js.map +0 -1
  143. package/dist/fhir/Consent.d.ts +0 -460
  144. package/dist/fhir/Consent.js +0 -7
  145. package/dist/fhir/Consent.js.map +0 -1
  146. package/dist/fhir/ContactDetail.d.ts +0 -31
  147. package/dist/fhir/ContactDetail.js +0 -7
  148. package/dist/fhir/ContactDetail.js.map +0 -1
  149. package/dist/fhir/ContactPoint.d.ts +0 -47
  150. package/dist/fhir/ContactPoint.js +0 -7
  151. package/dist/fhir/ContactPoint.js.map +0 -1
  152. package/dist/fhir/Contract.d.ts +0 -1452
  153. package/dist/fhir/Contract.js +0 -7
  154. package/dist/fhir/Contract.js.map +0 -1
  155. package/dist/fhir/Contributor.d.ts +0 -37
  156. package/dist/fhir/Contributor.js +0 -7
  157. package/dist/fhir/Contributor.js.map +0 -1
  158. package/dist/fhir/Count.d.ts +0 -49
  159. package/dist/fhir/Count.js +0 -7
  160. package/dist/fhir/Count.js.map +0 -1
  161. package/dist/fhir/Coverage.d.ts +0 -327
  162. package/dist/fhir/Coverage.js +0 -7
  163. package/dist/fhir/Coverage.js.map +0 -1
  164. package/dist/fhir/CoverageEligibilityRequest.d.ts +0 -404
  165. package/dist/fhir/CoverageEligibilityRequest.js +0 -7
  166. package/dist/fhir/CoverageEligibilityRequest.js.map +0 -1
  167. package/dist/fhir/CoverageEligibilityResponse.d.ts +0 -434
  168. package/dist/fhir/CoverageEligibilityResponse.js +0 -7
  169. package/dist/fhir/CoverageEligibilityResponse.js.map +0 -1
  170. package/dist/fhir/DataRequirement.d.ts +0 -239
  171. package/dist/fhir/DataRequirement.js +0 -7
  172. package/dist/fhir/DataRequirement.js.map +0 -1
  173. package/dist/fhir/DetectedIssue.d.ts +0 -252
  174. package/dist/fhir/DetectedIssue.js +0 -7
  175. package/dist/fhir/DetectedIssue.js.map +0 -1
  176. package/dist/fhir/Device.d.ts +0 -493
  177. package/dist/fhir/Device.js +0 -7
  178. package/dist/fhir/Device.js.map +0 -1
  179. package/dist/fhir/DeviceDefinition.d.ts +0 -486
  180. package/dist/fhir/DeviceDefinition.js +0 -7
  181. package/dist/fhir/DeviceDefinition.js.map +0 -1
  182. package/dist/fhir/DeviceMetric.d.ts +0 -199
  183. package/dist/fhir/DeviceMetric.js +0 -7
  184. package/dist/fhir/DeviceMetric.js.map +0 -1
  185. package/dist/fhir/DeviceRequest.d.ts +0 -296
  186. package/dist/fhir/DeviceRequest.js +0 -7
  187. package/dist/fhir/DeviceRequest.js.map +0 -1
  188. package/dist/fhir/DeviceUseStatement.d.ts +0 -168
  189. package/dist/fhir/DeviceUseStatement.js +0 -7
  190. package/dist/fhir/DeviceUseStatement.js.map +0 -1
  191. package/dist/fhir/DiagnosticReport.d.ts +0 -254
  192. package/dist/fhir/DiagnosticReport.js +0 -7
  193. package/dist/fhir/DiagnosticReport.js.map +0 -1
  194. package/dist/fhir/Distance.d.ts +0 -47
  195. package/dist/fhir/Distance.js +0 -7
  196. package/dist/fhir/Distance.js.map +0 -1
  197. package/dist/fhir/DocumentManifest.d.ts +0 -196
  198. package/dist/fhir/DocumentManifest.js +0 -7
  199. package/dist/fhir/DocumentManifest.js.map +0 -1
  200. package/dist/fhir/DocumentReference.d.ts +0 -349
  201. package/dist/fhir/DocumentReference.js +0 -7
  202. package/dist/fhir/DocumentReference.js.map +0 -1
  203. package/dist/fhir/Dosage.d.ts +0 -152
  204. package/dist/fhir/Dosage.js +0 -7
  205. package/dist/fhir/Dosage.js.map +0 -1
  206. package/dist/fhir/Duration.d.ts +0 -46
  207. package/dist/fhir/Duration.js +0 -7
  208. package/dist/fhir/Duration.js.map +0 -1
  209. package/dist/fhir/EffectEvidenceSynthesis.d.ts +0 -591
  210. package/dist/fhir/EffectEvidenceSynthesis.js +0 -7
  211. package/dist/fhir/EffectEvidenceSynthesis.js.map +0 -1
  212. package/dist/fhir/Element.d.ts +0 -21
  213. package/dist/fhir/Element.js +0 -7
  214. package/dist/fhir/Element.js.map +0 -1
  215. package/dist/fhir/ElementDefinition.d.ts +0 -2701
  216. package/dist/fhir/ElementDefinition.js +0 -7
  217. package/dist/fhir/ElementDefinition.js.map +0 -1
  218. package/dist/fhir/Encounter.d.ts +0 -558
  219. package/dist/fhir/Encounter.js +0 -7
  220. package/dist/fhir/Encounter.js.map +0 -1
  221. package/dist/fhir/Endpoint.d.ts +0 -140
  222. package/dist/fhir/Endpoint.js +0 -7
  223. package/dist/fhir/Endpoint.js.map +0 -1
  224. package/dist/fhir/EnrollmentRequest.d.ts +0 -113
  225. package/dist/fhir/EnrollmentRequest.js +0 -7
  226. package/dist/fhir/EnrollmentRequest.js.map +0 -1
  227. package/dist/fhir/EnrollmentResponse.d.ts +0 -117
  228. package/dist/fhir/EnrollmentResponse.js +0 -7
  229. package/dist/fhir/EnrollmentResponse.js.map +0 -1
  230. package/dist/fhir/EpisodeOfCare.d.ts +0 -246
  231. package/dist/fhir/EpisodeOfCare.js +0 -7
  232. package/dist/fhir/EpisodeOfCare.js.map +0 -1
  233. package/dist/fhir/EventDefinition.d.ts +0 -253
  234. package/dist/fhir/EventDefinition.js +0 -7
  235. package/dist/fhir/EventDefinition.js.map +0 -1
  236. package/dist/fhir/Evidence.d.ts +0 -252
  237. package/dist/fhir/Evidence.js +0 -7
  238. package/dist/fhir/Evidence.js.map +0 -1
  239. package/dist/fhir/EvidenceVariable.d.ts +0 -370
  240. package/dist/fhir/EvidenceVariable.js +0 -7
  241. package/dist/fhir/EvidenceVariable.js.map +0 -1
  242. package/dist/fhir/ExampleScenario.d.ts +0 -628
  243. package/dist/fhir/ExampleScenario.js +0 -7
  244. package/dist/fhir/ExampleScenario.js.map +0 -1
  245. package/dist/fhir/ExplanationOfBenefit.d.ts +0 -1841
  246. package/dist/fhir/ExplanationOfBenefit.js +0 -7
  247. package/dist/fhir/ExplanationOfBenefit.js.map +0 -1
  248. package/dist/fhir/Expression.d.ts +0 -45
  249. package/dist/fhir/Expression.js +0 -7
  250. package/dist/fhir/Expression.js.map +0 -1
  251. package/dist/fhir/Extension.d.ts +0 -306
  252. package/dist/fhir/Extension.js +0 -7
  253. package/dist/fhir/Extension.js.map +0 -1
  254. package/dist/fhir/FamilyMemberHistory.d.ts +0 -306
  255. package/dist/fhir/FamilyMemberHistory.js +0 -7
  256. package/dist/fhir/FamilyMemberHistory.js.map +0 -1
  257. package/dist/fhir/Flag.d.ts +0 -132
  258. package/dist/fhir/Flag.js +0 -7
  259. package/dist/fhir/Flag.js.map +0 -1
  260. package/dist/fhir/Goal.d.ts +0 -299
  261. package/dist/fhir/Goal.js +0 -7
  262. package/dist/fhir/Goal.js.map +0 -1
  263. package/dist/fhir/GraphDefinition.d.ts +0 -350
  264. package/dist/fhir/GraphDefinition.js +0 -7
  265. package/dist/fhir/GraphDefinition.js.map +0 -1
  266. package/dist/fhir/Group.d.ts +0 -271
  267. package/dist/fhir/Group.js +0 -7
  268. package/dist/fhir/Group.js.map +0 -1
  269. package/dist/fhir/GuidanceResponse.d.ts +0 -196
  270. package/dist/fhir/GuidanceResponse.js +0 -7
  271. package/dist/fhir/GuidanceResponse.js.map +0 -1
  272. package/dist/fhir/HealthcareService.d.ts +0 -356
  273. package/dist/fhir/HealthcareService.js +0 -7
  274. package/dist/fhir/HealthcareService.js.map +0 -1
  275. package/dist/fhir/HumanName.d.ts +0 -58
  276. package/dist/fhir/HumanName.js +0 -7
  277. package/dist/fhir/HumanName.js.map +0 -1
  278. package/dist/fhir/Identifier.d.ts +0 -53
  279. package/dist/fhir/Identifier.js +0 -7
  280. package/dist/fhir/Identifier.js.map +0 -1
  281. package/dist/fhir/ImagingStudy.d.ts +0 -407
  282. package/dist/fhir/ImagingStudy.js +0 -7
  283. package/dist/fhir/ImagingStudy.js.map +0 -1
  284. package/dist/fhir/Immunization.d.ts +0 -444
  285. package/dist/fhir/Immunization.js +0 -7
  286. package/dist/fhir/Immunization.js.map +0 -1
  287. package/dist/fhir/ImmunizationEvaluation.d.ts +0 -149
  288. package/dist/fhir/ImmunizationEvaluation.js +0 -7
  289. package/dist/fhir/ImmunizationEvaluation.js.map +0 -1
  290. package/dist/fhir/ImmunizationRecommendation.d.ts +0 -254
  291. package/dist/fhir/ImmunizationRecommendation.js +0 -7
  292. package/dist/fhir/ImmunizationRecommendation.js.map +0 -1
  293. package/dist/fhir/ImplementationGuide.d.ts +0 -824
  294. package/dist/fhir/ImplementationGuide.js +0 -7
  295. package/dist/fhir/ImplementationGuide.js.map +0 -1
  296. package/dist/fhir/InsurancePlan.d.ts +0 -624
  297. package/dist/fhir/InsurancePlan.js +0 -7
  298. package/dist/fhir/InsurancePlan.js.map +0 -1
  299. package/dist/fhir/Invoice.d.ts +0 -346
  300. package/dist/fhir/Invoice.js +0 -7
  301. package/dist/fhir/Invoice.js.map +0 -1
  302. package/dist/fhir/JsonWebKey.d.ts +0 -99
  303. package/dist/fhir/JsonWebKey.js +0 -7
  304. package/dist/fhir/JsonWebKey.js.map +0 -1
  305. package/dist/fhir/Library.d.ts +0 -277
  306. package/dist/fhir/Library.js +0 -7
  307. package/dist/fhir/Library.js.map +0 -1
  308. package/dist/fhir/Linkage.d.ts +0 -146
  309. package/dist/fhir/Linkage.js +0 -7
  310. package/dist/fhir/Linkage.js.map +0 -1
  311. package/dist/fhir/List.d.ts +0 -200
  312. package/dist/fhir/List.js +0 -7
  313. package/dist/fhir/List.js.map +0 -1
  314. package/dist/fhir/Location.d.ts +0 -277
  315. package/dist/fhir/Location.js +0 -7
  316. package/dist/fhir/Location.js.map +0 -1
  317. package/dist/fhir/Login.d.ts +0 -119
  318. package/dist/fhir/Login.js +0 -7
  319. package/dist/fhir/Login.js.map +0 -1
  320. package/dist/fhir/MarketingStatus.d.ts +0 -82
  321. package/dist/fhir/MarketingStatus.js +0 -7
  322. package/dist/fhir/MarketingStatus.js.map +0 -1
  323. package/dist/fhir/Measure.d.ts +0 -620
  324. package/dist/fhir/Measure.js +0 -7
  325. package/dist/fhir/Measure.js.map +0 -1
  326. package/dist/fhir/MeasureReport.d.ts +0 -463
  327. package/dist/fhir/MeasureReport.js +0 -7
  328. package/dist/fhir/MeasureReport.js.map +0 -1
  329. package/dist/fhir/Media.d.ts +0 -205
  330. package/dist/fhir/Media.js +0 -7
  331. package/dist/fhir/Media.js.map +0 -1
  332. package/dist/fhir/Medication.d.ts +0 -230
  333. package/dist/fhir/Medication.js +0 -7
  334. package/dist/fhir/Medication.js.map +0 -1
  335. package/dist/fhir/MedicationAdministration.d.ts +0 -352
  336. package/dist/fhir/MedicationAdministration.js +0 -7
  337. package/dist/fhir/MedicationAdministration.js.map +0 -1
  338. package/dist/fhir/MedicationDispense.d.ts +0 -343
  339. package/dist/fhir/MedicationDispense.js +0 -7
  340. package/dist/fhir/MedicationDispense.js.map +0 -1
  341. package/dist/fhir/MedicationKnowledge.d.ts +0 -992
  342. package/dist/fhir/MedicationKnowledge.js +0 -7
  343. package/dist/fhir/MedicationKnowledge.js.map +0 -1
  344. package/dist/fhir/MedicationRequest.d.ts +0 -481
  345. package/dist/fhir/MedicationRequest.js +0 -7
  346. package/dist/fhir/MedicationRequest.js.map +0 -1
  347. package/dist/fhir/MedicationStatement.d.ts +0 -228
  348. package/dist/fhir/MedicationStatement.js +0 -7
  349. package/dist/fhir/MedicationStatement.js.map +0 -1
  350. package/dist/fhir/MedicinalProduct.d.ts +0 -453
  351. package/dist/fhir/MedicinalProduct.js +0 -7
  352. package/dist/fhir/MedicinalProduct.js.map +0 -1
  353. package/dist/fhir/MedicinalProductAuthorization.d.ts +0 -271
  354. package/dist/fhir/MedicinalProductAuthorization.js +0 -7
  355. package/dist/fhir/MedicinalProductAuthorization.js.map +0 -1
  356. package/dist/fhir/MedicinalProductContraindication.d.ts +0 -170
  357. package/dist/fhir/MedicinalProductContraindication.js +0 -7
  358. package/dist/fhir/MedicinalProductContraindication.js.map +0 -1
  359. package/dist/fhir/MedicinalProductIndication.d.ts +0 -179
  360. package/dist/fhir/MedicinalProductIndication.js +0 -7
  361. package/dist/fhir/MedicinalProductIndication.js.map +0 -1
  362. package/dist/fhir/MedicinalProductIngredient.d.ts +0 -336
  363. package/dist/fhir/MedicinalProductIngredient.js +0 -7
  364. package/dist/fhir/MedicinalProductIngredient.js.map +0 -1
  365. package/dist/fhir/MedicinalProductInteraction.d.ts +0 -158
  366. package/dist/fhir/MedicinalProductInteraction.js +0 -7
  367. package/dist/fhir/MedicinalProductInteraction.js.map +0 -1
  368. package/dist/fhir/MedicinalProductManufactured.d.ts +0 -113
  369. package/dist/fhir/MedicinalProductManufactured.js +0 -7
  370. package/dist/fhir/MedicinalProductManufactured.js.map +0 -1
  371. package/dist/fhir/MedicinalProductPackaged.d.ts +0 -259
  372. package/dist/fhir/MedicinalProductPackaged.js +0 -7
  373. package/dist/fhir/MedicinalProductPackaged.js.map +0 -1
  374. package/dist/fhir/MedicinalProductPharmaceutical.d.ts +0 -331
  375. package/dist/fhir/MedicinalProductPharmaceutical.js +0 -7
  376. package/dist/fhir/MedicinalProductPharmaceutical.js.map +0 -1
  377. package/dist/fhir/MedicinalProductUndesirableEffect.d.ts +0 -101
  378. package/dist/fhir/MedicinalProductUndesirableEffect.js +0 -7
  379. package/dist/fhir/MedicinalProductUndesirableEffect.js.map +0 -1
  380. package/dist/fhir/MessageDefinition.d.ts +0 -330
  381. package/dist/fhir/MessageDefinition.js +0 -7
  382. package/dist/fhir/MessageDefinition.js.map +0 -1
  383. package/dist/fhir/MessageHeader.d.ts +0 -323
  384. package/dist/fhir/MessageHeader.js +0 -7
  385. package/dist/fhir/MessageHeader.js.map +0 -1
  386. package/dist/fhir/Meta.d.ts +0 -75
  387. package/dist/fhir/Meta.js +0 -7
  388. package/dist/fhir/Meta.js.map +0 -1
  389. package/dist/fhir/MolecularSequence.d.ts +0 -760
  390. package/dist/fhir/MolecularSequence.js +0 -7
  391. package/dist/fhir/MolecularSequence.js.map +0 -1
  392. package/dist/fhir/Money.d.ts +0 -29
  393. package/dist/fhir/Money.js +0 -7
  394. package/dist/fhir/Money.js.map +0 -1
  395. package/dist/fhir/NamingSystem.d.ts +0 -218
  396. package/dist/fhir/NamingSystem.js +0 -7
  397. package/dist/fhir/NamingSystem.js.map +0 -1
  398. package/dist/fhir/Narrative.d.ts +0 -32
  399. package/dist/fhir/Narrative.js +0 -7
  400. package/dist/fhir/Narrative.js.map +0 -1
  401. package/dist/fhir/NutritionOrder.d.ts +0 -566
  402. package/dist/fhir/NutritionOrder.js +0 -7
  403. package/dist/fhir/NutritionOrder.js.map +0 -1
  404. package/dist/fhir/Observation.d.ts +0 -520
  405. package/dist/fhir/Observation.js +0 -7
  406. package/dist/fhir/Observation.js.map +0 -1
  407. package/dist/fhir/ObservationDefinition.d.ts +0 -278
  408. package/dist/fhir/ObservationDefinition.js +0 -7
  409. package/dist/fhir/ObservationDefinition.js.map +0 -1
  410. package/dist/fhir/OperationDefinition.d.ts +0 -468
  411. package/dist/fhir/OperationDefinition.js +0 -7
  412. package/dist/fhir/OperationDefinition.js.map +0 -1
  413. package/dist/fhir/OperationOutcome.d.ts +0 -160
  414. package/dist/fhir/OperationOutcome.js +0 -7
  415. package/dist/fhir/OperationOutcome.js.map +0 -1
  416. package/dist/fhir/Organization.d.ts +0 -184
  417. package/dist/fhir/Organization.js +0 -7
  418. package/dist/fhir/Organization.js.map +0 -1
  419. package/dist/fhir/OrganizationAffiliation.d.ts +0 -145
  420. package/dist/fhir/OrganizationAffiliation.js +0 -7
  421. package/dist/fhir/OrganizationAffiliation.js.map +0 -1
  422. package/dist/fhir/ParameterDefinition.d.ts +0 -57
  423. package/dist/fhir/ParameterDefinition.js +0 -7
  424. package/dist/fhir/ParameterDefinition.js.map +0 -1
  425. package/dist/fhir/Parameters.d.ts +0 -319
  426. package/dist/fhir/Parameters.js +0 -7
  427. package/dist/fhir/Parameters.js.map +0 -1
  428. package/dist/fhir/PasswordChangeRequest.d.ts +0 -51
  429. package/dist/fhir/PasswordChangeRequest.js +0 -7
  430. package/dist/fhir/PasswordChangeRequest.js.map +0 -1
  431. package/dist/fhir/Patient.d.ts +0 -342
  432. package/dist/fhir/Patient.js +0 -7
  433. package/dist/fhir/Patient.js.map +0 -1
  434. package/dist/fhir/PaymentNotice.d.ts +0 -135
  435. package/dist/fhir/PaymentNotice.js +0 -7
  436. package/dist/fhir/PaymentNotice.js.map +0 -1
  437. package/dist/fhir/PaymentReconciliation.d.ts +0 -280
  438. package/dist/fhir/PaymentReconciliation.js +0 -7
  439. package/dist/fhir/PaymentReconciliation.js.map +0 -1
  440. package/dist/fhir/Period.d.ts +0 -32
  441. package/dist/fhir/Period.js +0 -7
  442. package/dist/fhir/Period.js.map +0 -1
  443. package/dist/fhir/Person.d.ts +0 -175
  444. package/dist/fhir/Person.js +0 -7
  445. package/dist/fhir/Person.js.map +0 -1
  446. package/dist/fhir/PlanDefinition.d.ts +0 -837
  447. package/dist/fhir/PlanDefinition.js +0 -7
  448. package/dist/fhir/PlanDefinition.js.map +0 -1
  449. package/dist/fhir/Population.d.ts +0 -62
  450. package/dist/fhir/Population.js +0 -7
  451. package/dist/fhir/Population.js.map +0 -1
  452. package/dist/fhir/Practitioner.d.ts +0 -191
  453. package/dist/fhir/Practitioner.js +0 -7
  454. package/dist/fhir/Practitioner.js.map +0 -1
  455. package/dist/fhir/PractitionerRole.d.ts +0 -259
  456. package/dist/fhir/PractitionerRole.js +0 -7
  457. package/dist/fhir/PractitionerRole.js.map +0 -1
  458. package/dist/fhir/Procedure.d.ts +0 -372
  459. package/dist/fhir/Procedure.js +0 -7
  460. package/dist/fhir/Procedure.js.map +0 -1
  461. package/dist/fhir/ProdCharacteristic.d.ts +0 -112
  462. package/dist/fhir/ProdCharacteristic.js +0 -7
  463. package/dist/fhir/ProdCharacteristic.js.map +0 -1
  464. package/dist/fhir/ProductShelfLife.d.ts +0 -70
  465. package/dist/fhir/ProductShelfLife.js +0 -7
  466. package/dist/fhir/ProductShelfLife.js.map +0 -1
  467. package/dist/fhir/Project.d.ts +0 -43
  468. package/dist/fhir/Project.js +0 -7
  469. package/dist/fhir/Project.js.map +0 -1
  470. package/dist/fhir/ProjectMembership.d.ts +0 -66
  471. package/dist/fhir/ProjectMembership.js +0 -7
  472. package/dist/fhir/ProjectMembership.js.map +0 -1
  473. package/dist/fhir/Provenance.d.ts +0 -258
  474. package/dist/fhir/Provenance.js +0 -7
  475. package/dist/fhir/Provenance.js.map +0 -1
  476. package/dist/fhir/Quantity.d.ts +0 -46
  477. package/dist/fhir/Quantity.js +0 -7
  478. package/dist/fhir/Quantity.js.map +0 -1
  479. package/dist/fhir/Questionnaire.d.ts +0 -603
  480. package/dist/fhir/Questionnaire.js +0 -7
  481. package/dist/fhir/Questionnaire.js.map +0 -1
  482. package/dist/fhir/QuestionnaireResponse.d.ts +0 -313
  483. package/dist/fhir/QuestionnaireResponse.js +0 -7
  484. package/dist/fhir/QuestionnaireResponse.js.map +0 -1
  485. package/dist/fhir/Range.d.ts +0 -30
  486. package/dist/fhir/Range.js +0 -7
  487. package/dist/fhir/Range.js.map +0 -1
  488. package/dist/fhir/Ratio.d.ts +0 -30
  489. package/dist/fhir/Ratio.js +0 -7
  490. package/dist/fhir/Ratio.js.map +0 -1
  491. package/dist/fhir/Reference.d.ts +0 -67
  492. package/dist/fhir/Reference.js +0 -7
  493. package/dist/fhir/Reference.js.map +0 -1
  494. package/dist/fhir/RefreshToken.d.ts +0 -45
  495. package/dist/fhir/RefreshToken.js +0 -7
  496. package/dist/fhir/RefreshToken.js.map +0 -1
  497. package/dist/fhir/RelatedArtifact.d.ts +0 -57
  498. package/dist/fhir/RelatedArtifact.js +0 -7
  499. package/dist/fhir/RelatedArtifact.js.map +0 -1
  500. package/dist/fhir/RelatedPerson.d.ts +0 -190
  501. package/dist/fhir/RelatedPerson.js +0 -7
  502. package/dist/fhir/RelatedPerson.js.map +0 -1
  503. package/dist/fhir/RequestGroup.d.ts +0 -434
  504. package/dist/fhir/RequestGroup.js +0 -7
  505. package/dist/fhir/RequestGroup.js.map +0 -1
  506. package/dist/fhir/ResearchDefinition.d.ts +0 -291
  507. package/dist/fhir/ResearchDefinition.js +0 -7
  508. package/dist/fhir/ResearchDefinition.js.map +0 -1
  509. package/dist/fhir/ResearchElementDefinition.d.ts +0 -431
  510. package/dist/fhir/ResearchElementDefinition.js +0 -7
  511. package/dist/fhir/ResearchElementDefinition.js.map +0 -1
  512. package/dist/fhir/ResearchStudy.d.ts +0 -318
  513. package/dist/fhir/ResearchStudy.js +0 -7
  514. package/dist/fhir/ResearchStudy.js.map +0 -1
  515. package/dist/fhir/ResearchSubject.d.ts +0 -119
  516. package/dist/fhir/ResearchSubject.js +0 -7
  517. package/dist/fhir/ResearchSubject.js.map +0 -1
  518. package/dist/fhir/Resource.d.ts +0 -156
  519. package/dist/fhir/Resource.js +0 -7
  520. package/dist/fhir/Resource.js.map +0 -1
  521. package/dist/fhir/RiskAssessment.d.ts +0 -246
  522. package/dist/fhir/RiskAssessment.js +0 -7
  523. package/dist/fhir/RiskAssessment.js.map +0 -1
  524. package/dist/fhir/RiskEvidenceSynthesis.d.ts +0 -530
  525. package/dist/fhir/RiskEvidenceSynthesis.js +0 -7
  526. package/dist/fhir/RiskEvidenceSynthesis.js.map +0 -1
  527. package/dist/fhir/SampledData.d.ts +0 -62
  528. package/dist/fhir/SampledData.js +0 -7
  529. package/dist/fhir/SampledData.js.map +0 -1
  530. package/dist/fhir/Schedule.d.ts +0 -129
  531. package/dist/fhir/Schedule.js +0 -7
  532. package/dist/fhir/Schedule.js.map +0 -1
  533. package/dist/fhir/SearchParameter.d.ts +0 -277
  534. package/dist/fhir/SearchParameter.js +0 -7
  535. package/dist/fhir/SearchParameter.js.map +0 -1
  536. package/dist/fhir/ServiceRequest.d.ts +0 -309
  537. package/dist/fhir/ServiceRequest.js +0 -7
  538. package/dist/fhir/ServiceRequest.js.map +0 -1
  539. package/dist/fhir/Signature.d.ts +0 -71
  540. package/dist/fhir/Signature.js +0 -7
  541. package/dist/fhir/Signature.js.map +0 -1
  542. package/dist/fhir/Slot.d.ts +0 -134
  543. package/dist/fhir/Slot.js +0 -7
  544. package/dist/fhir/Slot.js.map +0 -1
  545. package/dist/fhir/Specimen.d.ts +0 -366
  546. package/dist/fhir/Specimen.js +0 -7
  547. package/dist/fhir/Specimen.js.map +0 -1
  548. package/dist/fhir/SpecimenDefinition.d.ts +0 -363
  549. package/dist/fhir/SpecimenDefinition.js +0 -7
  550. package/dist/fhir/SpecimenDefinition.js.map +0 -1
  551. package/dist/fhir/StructureDefinition.d.ts +0 -438
  552. package/dist/fhir/StructureDefinition.js +0 -7
  553. package/dist/fhir/StructureDefinition.js.map +0 -1
  554. package/dist/fhir/StructureMap.d.ts +0 -904
  555. package/dist/fhir/StructureMap.js +0 -7
  556. package/dist/fhir/StructureMap.js.map +0 -1
  557. package/dist/fhir/Subscription.d.ts +0 -172
  558. package/dist/fhir/Subscription.js +0 -7
  559. package/dist/fhir/Subscription.js.map +0 -1
  560. package/dist/fhir/Substance.d.ts +0 -213
  561. package/dist/fhir/Substance.js +0 -7
  562. package/dist/fhir/Substance.js.map +0 -1
  563. package/dist/fhir/SubstanceAmount.d.ts +0 -115
  564. package/dist/fhir/SubstanceAmount.js +0 -7
  565. package/dist/fhir/SubstanceAmount.js.map +0 -1
  566. package/dist/fhir/SubstanceNucleicAcid.d.ts +0 -309
  567. package/dist/fhir/SubstanceNucleicAcid.js +0 -7
  568. package/dist/fhir/SubstanceNucleicAcid.js.map +0 -1
  569. package/dist/fhir/SubstancePolymer.d.ts +0 -405
  570. package/dist/fhir/SubstancePolymer.js +0 -7
  571. package/dist/fhir/SubstancePolymer.js.map +0 -1
  572. package/dist/fhir/SubstanceProtein.d.ts +0 -218
  573. package/dist/fhir/SubstanceProtein.js +0 -7
  574. package/dist/fhir/SubstanceProtein.js.map +0 -1
  575. package/dist/fhir/SubstanceReferenceInformation.d.ts +0 -330
  576. package/dist/fhir/SubstanceReferenceInformation.js +0 -7
  577. package/dist/fhir/SubstanceReferenceInformation.js.map +0 -1
  578. package/dist/fhir/SubstanceSourceMaterial.d.ts +0 -521
  579. package/dist/fhir/SubstanceSourceMaterial.js +0 -7
  580. package/dist/fhir/SubstanceSourceMaterial.js.map +0 -1
  581. package/dist/fhir/SubstanceSpecification.d.ts +0 -827
  582. package/dist/fhir/SubstanceSpecification.js +0 -7
  583. package/dist/fhir/SubstanceSpecification.js.map +0 -1
  584. package/dist/fhir/SupplyDelivery.d.ts +0 -205
  585. package/dist/fhir/SupplyDelivery.js +0 -7
  586. package/dist/fhir/SupplyDelivery.js.map +0 -1
  587. package/dist/fhir/SupplyRequest.d.ts +0 -237
  588. package/dist/fhir/SupplyRequest.js +0 -7
  589. package/dist/fhir/SupplyRequest.js.map +0 -1
  590. package/dist/fhir/Task.d.ts +0 -807
  591. package/dist/fhir/Task.js +0 -7
  592. package/dist/fhir/Task.js.map +0 -1
  593. package/dist/fhir/TerminologyCapabilities.d.ts +0 -716
  594. package/dist/fhir/TerminologyCapabilities.js +0 -7
  595. package/dist/fhir/TerminologyCapabilities.js.map +0 -1
  596. package/dist/fhir/TestReport.d.ts +0 -549
  597. package/dist/fhir/TestReport.js +0 -7
  598. package/dist/fhir/TestReport.js.map +0 -1
  599. package/dist/fhir/TestScript.d.ts +0 -1184
  600. package/dist/fhir/TestScript.js +0 -7
  601. package/dist/fhir/TestScript.js.map +0 -1
  602. package/dist/fhir/Timing.d.ts +0 -178
  603. package/dist/fhir/Timing.js +0 -7
  604. package/dist/fhir/Timing.js.map +0 -1
  605. package/dist/fhir/TriggerDefinition.d.ts +0 -65
  606. package/dist/fhir/TriggerDefinition.js +0 -7
  607. package/dist/fhir/TriggerDefinition.js.map +0 -1
  608. package/dist/fhir/UsageContext.d.ts +0 -61
  609. package/dist/fhir/UsageContext.js +0 -7
  610. package/dist/fhir/UsageContext.js.map +0 -1
  611. package/dist/fhir/User.d.ts +0 -45
  612. package/dist/fhir/User.js +0 -7
  613. package/dist/fhir/User.js.map +0 -1
  614. package/dist/fhir/ValueSet.d.ts +0 -725
  615. package/dist/fhir/ValueSet.js +0 -7
  616. package/dist/fhir/ValueSet.js.map +0 -1
  617. package/dist/fhir/VerificationResult.d.ts +0 -340
  618. package/dist/fhir/VerificationResult.js +0 -7
  619. package/dist/fhir/VerificationResult.js.map +0 -1
  620. package/dist/fhir/VisionPrescription.d.ts +0 -264
  621. package/dist/fhir/VisionPrescription.js +0 -7
  622. package/dist/fhir/VisionPrescription.js.map +0 -1
  623. package/dist/fhir/index.d.ts +0 -196
  624. package/dist/fhir/index.js +0 -213
  625. package/dist/fhir/index.js.map +0 -1
  626. package/dist/fhirpath/functions.d.ts +0 -6
  627. package/dist/fhirpath/functions.js +0 -349
  628. package/dist/fhirpath/functions.js.map +0 -1
  629. package/dist/fhirpath/index.d.ts +0 -2
  630. package/dist/fhirpath/index.js +0 -15
  631. package/dist/fhirpath/index.js.map +0 -1
  632. package/dist/fhirpath/parse.d.ts +0 -10
  633. package/dist/fhirpath/parse.js +0 -266
  634. package/dist/fhirpath/parse.js.map +0 -1
  635. package/dist/fhirpath/tokenize.d.ts +0 -13
  636. package/dist/fhirpath/tokenize.js +0 -39
  637. package/dist/fhirpath/tokenize.js.map +0 -1
  638. package/dist/fhirpath/utils.d.ts +0 -13
  639. package/dist/fhirpath/utils.js +0 -34
  640. package/dist/fhirpath/utils.js.map +0 -1
@@ -1,7 +0,0 @@
1
- "use strict";
2
- /*
3
- * Generated by @medplum/generator
4
- * Do not edit manually.
5
- */
6
- Object.defineProperty(exports, "__esModule", { value: true });
7
- //# sourceMappingURL=ElementDefinition.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"ElementDefinition.js","sourceRoot":"","sources":["../../src/fhir/ElementDefinition.ts"],"names":[],"mappings":";AAAA;;;GAGG","sourcesContent":["/*\n * Generated by @medplum/generator\n * Do not edit manually.\n */\n\nimport { Address } from './Address';\nimport { Age } from './Age';\nimport { Annotation } from './Annotation';\nimport { Attachment } from './Attachment';\nimport { CodeableConcept } from './CodeableConcept';\nimport { Coding } from './Coding';\nimport { ContactDetail } from './ContactDetail';\nimport { ContactPoint } from './ContactPoint';\nimport { Contributor } from './Contributor';\nimport { Count } from './Count';\nimport { DataRequirement } from './DataRequirement';\nimport { Distance } from './Distance';\nimport { Dosage } from './Dosage';\nimport { Duration } from './Duration';\nimport { Expression } from './Expression';\nimport { Extension } from './Extension';\nimport { HumanName } from './HumanName';\nimport { Identifier } from './Identifier';\nimport { Meta } from './Meta';\nimport { Money } from './Money';\nimport { ParameterDefinition } from './ParameterDefinition';\nimport { Period } from './Period';\nimport { Quantity } from './Quantity';\nimport { Range } from './Range';\nimport { Ratio } from './Ratio';\nimport { Reference } from './Reference';\nimport { RelatedArtifact } from './RelatedArtifact';\nimport { SampledData } from './SampledData';\nimport { Signature } from './Signature';\nimport { Timing } from './Timing';\nimport { TriggerDefinition } from './TriggerDefinition';\nimport { UsageContext } from './UsageContext';\n\n/**\n * Base StructureDefinition for ElementDefinition Type: Captures\n * constraints on each element within the resource, profile, or\n * extension.\n */\nexport interface ElementDefinition {\n\n /**\n * Unique id for the element within a resource (for internal references).\n * This may be any string value that does not contain spaces.\n */\n readonly id?: string;\n\n /**\n * May be used to represent additional information that is not part of\n * the basic definition of the element. To make the use of extensions\n * safe and manageable, there is a strict set of governance applied to\n * the definition and use of extensions. Though any implementer can\n * define an extension, there is a set of requirements that SHALL be met\n * as part of the definition of the extension.\n */\n readonly extension?: Extension[];\n\n /**\n * May be used to represent additional information that is not part of\n * the basic definition of the element and that modifies the\n * understanding of the element in which it is contained and/or the\n * understanding of the containing element's descendants. Usually\n * modifier elements provide negation or qualification. To make the use\n * of extensions safe and manageable, there is a strict set of governance\n * applied to the definition and use of extensions. Though any\n * implementer can define an extension, there is a set of requirements\n * that SHALL be met as part of the definition of the extension.\n * Applications processing a resource are required to check for modifier\n * extensions.\n *\n * Modifier extensions SHALL NOT change the meaning of any elements on\n * Resource or DomainResource (including cannot change the meaning of\n * modifierExtension itself).\n */\n readonly modifierExtension?: Extension[];\n\n /**\n * The path identifies the element and is expressed as a "."-separated\n * list of ancestor elements, beginning with the name of the resource or\n * extension.\n */\n readonly path?: string;\n\n /**\n * Codes that define how this element is represented in instances, when\n * the deviation varies from the normal case.\n */\n readonly representation?: string[];\n\n /**\n * The name of this element definition slice, when slicing is working.\n * The name must be a token with no dots or spaces. This is a unique name\n * referring to a specific set of constraints applied to this element,\n * used to provide a name to different slices of the same element.\n */\n readonly sliceName?: string;\n\n /**\n * If true, indicates that this slice definition is constraining a slice\n * definition with the same name in an inherited profile. If false, the\n * slice is not overriding any slice in an inherited profile. If missing,\n * the slice might or might not be overriding a slice in an inherited\n * profile, depending on the sliceName.\n */\n readonly sliceIsConstraining?: boolean;\n\n /**\n * A single preferred label which is the text to display beside the\n * element indicating its meaning or to use to prompt for the element in\n * a user display or form.\n */\n readonly label?: string;\n\n /**\n * A code that has the same meaning as the element in a particular\n * terminology.\n */\n readonly code?: Coding[];\n\n /**\n * Indicates that the element is sliced into a set of alternative\n * definitions (i.e. in a structure definition, there are multiple\n * different constraints on a single element in the base resource).\n * Slicing can be used in any resource that has cardinality ..* on the\n * base resource, or any resource with a choice of types. The set of\n * slices is any elements that come after this in the element sequence\n * that have the same path, until a shorter path occurs (the shorter path\n * terminates the set).\n */\n readonly slicing?: ElementDefinitionSlicing;\n\n /**\n * A concise description of what this element means (e.g. for use in\n * autogenerated summaries).\n */\n readonly short?: string;\n\n /**\n * Provides a complete explanation of the meaning of the data element for\n * human readability. For the case of elements derived from existing\n * elements (e.g. constraints), the definition SHALL be consistent with\n * the base definition, but convey the meaning of the element in the\n * particular context of use of the resource. (Note: The text you are\n * reading is specified in ElementDefinition.definition).\n */\n readonly definition?: string;\n\n /**\n * Explanatory notes and implementation guidance about the data element,\n * including notes about how to use the data properly, exceptions to\n * proper use, etc. (Note: The text you are reading is specified in\n * ElementDefinition.comment).\n */\n readonly comment?: string;\n\n /**\n * This element is for traceability of why the element was created and\n * why the constraints exist as they do. This may be used to point to\n * source materials or specifications that drove the structure of this\n * element.\n */\n readonly requirements?: string;\n\n /**\n * Identifies additional names by which this element might also be known.\n */\n readonly alias?: string[];\n\n /**\n * The minimum number of times this element SHALL appear in the instance.\n */\n readonly min?: number;\n\n /**\n * The maximum number of times this element is permitted to appear in the\n * instance.\n */\n readonly max?: string;\n\n /**\n * Information about the base definition of the element, provided to make\n * it unnecessary for tools to trace the deviation of the element through\n * the derived and related profiles. When the element definition is not\n * the original definition of an element - i.g. either in a constraint on\n * another type, or for elements from a super type in a snap shot - then\n * the information in provided in the element definition may be different\n * to the base definition. On the original definition of the element, it\n * will be same.\n */\n readonly base?: ElementDefinitionBase;\n\n /**\n * Identifies an element defined elsewhere in the definition whose\n * content rules should be applied to the current element.\n * ContentReferences bring across all the rules that are in the\n * ElementDefinition for the element, including definitions, cardinality\n * constraints, bindings, invariants etc.\n */\n readonly contentReference?: string;\n\n /**\n * The data type or resource that the value of this element is permitted\n * to be.\n */\n readonly type?: ElementDefinitionType[];\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueBase64Binary?: string;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueBoolean?: boolean;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueCanonical?: string;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueCode?: string;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueDate?: string;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueDateTime?: string;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueDecimal?: number;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueId?: string;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueInstant?: string;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueInteger?: number;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueMarkdown?: string;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueOid?: string;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValuePositiveInt?: number;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueString?: string;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueTime?: string;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueUnsignedInt?: number;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueUri?: string;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueUrl?: string;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueUuid?: string;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueAddress?: Address;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueAge?: Age;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueAnnotation?: Annotation;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueAttachment?: Attachment;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueCodeableConcept?: CodeableConcept;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueCoding?: Coding;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueContactPoint?: ContactPoint;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueCount?: Count;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueDistance?: Distance;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueDuration?: Duration;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueHumanName?: HumanName;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueIdentifier?: Identifier;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueMoney?: Money;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValuePeriod?: Period;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueQuantity?: Quantity;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueRange?: Range;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueRatio?: Ratio;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueReference?: Reference;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueSampledData?: SampledData;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueSignature?: Signature;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueTiming?: Timing;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueContactDetail?: ContactDetail;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueContributor?: Contributor;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueDataRequirement?: DataRequirement;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueExpression?: Expression;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueParameterDefinition?: ParameterDefinition;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueRelatedArtifact?: RelatedArtifact;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueTriggerDefinition?: TriggerDefinition;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueUsageContext?: UsageContext;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueDosage?: Dosage;\n\n /**\n * The value that should be used if there is no value stated in the\n * instance (e.g. 'if not otherwise specified, the abstract is false').\n */\n readonly defaultValueMeta?: Meta;\n\n /**\n * The Implicit meaning that is to be understood when this element is\n * missing (e.g. 'when this element is missing, the period is ongoing').\n */\n readonly meaningWhenMissing?: string;\n\n /**\n * If present, indicates that the order of the repeating element has\n * meaning and describes what that meaning is. If absent, it means that\n * the order of the element has no meaning.\n */\n readonly orderMeaning?: string;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedBase64Binary?: string;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedBoolean?: boolean;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedCanonical?: string;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedCode?: string;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedDate?: string;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedDateTime?: string;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedDecimal?: number;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedId?: string;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedInstant?: string;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedInteger?: number;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedMarkdown?: string;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedOid?: string;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedPositiveInt?: number;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedString?: string;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedTime?: string;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedUnsignedInt?: number;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedUri?: string;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedUrl?: string;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedUuid?: string;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedAddress?: Address;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedAge?: Age;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedAnnotation?: Annotation;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedAttachment?: Attachment;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedCodeableConcept?: CodeableConcept;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedCoding?: Coding;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedContactPoint?: ContactPoint;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedCount?: Count;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedDistance?: Distance;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedDuration?: Duration;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedHumanName?: HumanName;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedIdentifier?: Identifier;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedMoney?: Money;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedPeriod?: Period;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedQuantity?: Quantity;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedRange?: Range;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedRatio?: Ratio;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedReference?: Reference;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedSampledData?: SampledData;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedSignature?: Signature;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedTiming?: Timing;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedContactDetail?: ContactDetail;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedContributor?: Contributor;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedDataRequirement?: DataRequirement;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedExpression?: Expression;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedParameterDefinition?: ParameterDefinition;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedRelatedArtifact?: RelatedArtifact;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedTriggerDefinition?: TriggerDefinition;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedUsageContext?: UsageContext;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedDosage?: Dosage;\n\n /**\n * Specifies a value that SHALL be exactly the value for this element in\n * the instance. For purposes of comparison, non-significant whitespace\n * is ignored, and all values must be an exact match (case and accent\n * sensitive). Missing elements/attributes must also be missing.\n */\n readonly fixedMeta?: Meta;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternBase64Binary?: string;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternBoolean?: boolean;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternCanonical?: string;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternCode?: string;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternDate?: string;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternDateTime?: string;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternDecimal?: number;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternId?: string;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternInstant?: string;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternInteger?: number;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternMarkdown?: string;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternOid?: string;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternPositiveInt?: number;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternString?: string;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternTime?: string;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternUnsignedInt?: number;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternUri?: string;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternUrl?: string;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternUuid?: string;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternAddress?: Address;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternAge?: Age;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternAnnotation?: Annotation;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternAttachment?: Attachment;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternCodeableConcept?: CodeableConcept;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternCoding?: Coding;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternContactPoint?: ContactPoint;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternCount?: Count;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternDistance?: Distance;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternDuration?: Duration;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternHumanName?: HumanName;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternIdentifier?: Identifier;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternMoney?: Money;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternPeriod?: Period;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternQuantity?: Quantity;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternRange?: Range;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternRatio?: Ratio;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternReference?: Reference;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternSampledData?: SampledData;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternSignature?: Signature;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternTiming?: Timing;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternContactDetail?: ContactDetail;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternContributor?: Contributor;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternDataRequirement?: DataRequirement;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternExpression?: Expression;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternParameterDefinition?: ParameterDefinition;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternRelatedArtifact?: RelatedArtifact;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternTriggerDefinition?: TriggerDefinition;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternUsageContext?: UsageContext;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternDosage?: Dosage;\n\n /**\n * Specifies a value that the value in the instance SHALL follow - that\n * is, any value in the pattern must be found in the instance. Other\n * additional values may be found too. This is effectively constraint by\n * example.\n *\n * When pattern[x] is used to constrain a primitive, it means that the\n * value provided in the pattern[x] must match the instance value\n * exactly.\n *\n * When pattern[x] is used to constrain an array, it means that each\n * element provided in the pattern[x] array must (recursively) match at\n * least one element from the instance array.\n *\n * When pattern[x] is used to constrain a complex object, it means that\n * each property in the pattern must be present in the complex object,\n * and its value must recursively match -- i.e.,\n *\n * 1. If primitive: it must match exactly the pattern value\n * 2. If a complex object: it must match (recursively) the pattern value\n * 3. If an array: it must match (recursively) the pattern value.\n */\n readonly patternMeta?: Meta;\n\n /**\n * A sample value for this element demonstrating the type of information\n * that would typically be found in the element.\n */\n readonly example?: ElementDefinitionExample[];\n\n /**\n * The minimum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly minValueDate?: string;\n\n /**\n * The minimum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly minValueDateTime?: string;\n\n /**\n * The minimum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly minValueInstant?: string;\n\n /**\n * The minimum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly minValueTime?: string;\n\n /**\n * The minimum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly minValueDecimal?: number;\n\n /**\n * The minimum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly minValueInteger?: number;\n\n /**\n * The minimum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly minValuePositiveInt?: number;\n\n /**\n * The minimum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly minValueUnsignedInt?: number;\n\n /**\n * The minimum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly minValueQuantity?: Quantity;\n\n /**\n * The maximum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly maxValueDate?: string;\n\n /**\n * The maximum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly maxValueDateTime?: string;\n\n /**\n * The maximum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly maxValueInstant?: string;\n\n /**\n * The maximum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly maxValueTime?: string;\n\n /**\n * The maximum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly maxValueDecimal?: number;\n\n /**\n * The maximum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly maxValueInteger?: number;\n\n /**\n * The maximum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly maxValuePositiveInt?: number;\n\n /**\n * The maximum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly maxValueUnsignedInt?: number;\n\n /**\n * The maximum allowed value for the element. The value is inclusive.\n * This is allowed for the types date, dateTime, instant, time, decimal,\n * integer, and Quantity.\n */\n readonly maxValueQuantity?: Quantity;\n\n /**\n * Indicates the maximum length in characters that is permitted to be\n * present in conformant instances and which is expected to be supported\n * by conformant consumers that support the element.\n */\n readonly maxLength?: number;\n\n /**\n * A reference to an invariant that may make additional statements about\n * the cardinality or value in the instance.\n */\n readonly condition?: string[];\n\n /**\n * Formal constraints such as co-occurrence and other constraints that\n * can be computationally evaluated within the context of the instance.\n */\n readonly constraint?: ElementDefinitionConstraint[];\n\n /**\n * If true, implementations that produce or consume resources SHALL\n * provide "support" for the element in some meaningful way. If false,\n * the element may be ignored and not supported. If false, whether to\n * populate or use the data element in any way is at the discretion of\n * the implementation.\n */\n readonly mustSupport?: boolean;\n\n /**\n * If true, the value of this element affects the interpretation of the\n * element or resource that contains it, and the value of the element\n * cannot be ignored. Typically, this is used for status, negation and\n * qualification codes. The effect of this is that the element cannot be\n * ignored by systems: they SHALL either recognize the element and\n * process it, and/or a pre-determination has been made that it is not\n * relevant to their particular system.\n */\n readonly isModifier?: boolean;\n\n /**\n * Explains how that element affects the interpretation of the resource\n * or element that contains it.\n */\n readonly isModifierReason?: string;\n\n /**\n * Whether the element should be included if a client requests a search\n * with the parameter _summary=true.\n */\n readonly isSummary?: boolean;\n\n /**\n * Binds to a value set if this element is coded (code, Coding,\n * CodeableConcept, Quantity), or the data types (string, uri).\n */\n readonly binding?: ElementDefinitionBinding;\n\n /**\n * Identifies a concept from an external specification that roughly\n * corresponds to this element.\n */\n readonly mapping?: ElementDefinitionMapping[];\n}\n\n/**\n * Information about the base definition of the element, provided to make\n * it unnecessary for tools to trace the deviation of the element through\n * the derived and related profiles. When the element definition is not\n * the original definition of an element - i.g. either in a constraint on\n * another type, or for elements from a super type in a snap shot - then\n * the information in provided in the element definition may be different\n * to the base definition. On the original definition of the element, it\n * will be same.\n */\nexport interface ElementDefinitionBase {\n\n /**\n * Unique id for the element within a resource (for internal references).\n * This may be any string value that does not contain spaces.\n */\n readonly id?: string;\n\n /**\n * May be used to represent additional information that is not part of\n * the basic definition of the element. To make the use of extensions\n * safe and manageable, there is a strict set of governance applied to\n * the definition and use of extensions. Though any implementer can\n * define an extension, there is a set of requirements that SHALL be met\n * as part of the definition of the extension.\n */\n readonly extension?: Extension[];\n\n /**\n * The Path that identifies the base element - this matches the\n * ElementDefinition.path for that element. Across FHIR, there is only\n * one base definition of any element - that is, an element definition on\n * a [StructureDefinition](structuredefinition.html#) without a\n * StructureDefinition.base.\n */\n readonly path?: string;\n\n /**\n * Minimum cardinality of the base element identified by the path.\n */\n readonly min?: number;\n\n /**\n * Maximum cardinality of the base element identified by the path.\n */\n readonly max?: string;\n}\n\n/**\n * Binds to a value set if this element is coded (code, Coding,\n * CodeableConcept, Quantity), or the data types (string, uri).\n */\nexport interface ElementDefinitionBinding {\n\n /**\n * Unique id for the element within a resource (for internal references).\n * This may be any string value that does not contain spaces.\n */\n readonly id?: string;\n\n /**\n * May be used to represent additional information that is not part of\n * the basic definition of the element. To make the use of extensions\n * safe and manageable, there is a strict set of governance applied to\n * the definition and use of extensions. Though any implementer can\n * define an extension, there is a set of requirements that SHALL be met\n * as part of the definition of the extension.\n */\n readonly extension?: Extension[];\n\n /**\n * Indicates the degree of conformance expectations associated with this\n * binding - that is, the degree to which the provided value set must be\n * adhered to in the instances.\n */\n readonly strength?: string;\n\n /**\n * Describes the intended use of this particular set of codes.\n */\n readonly description?: string;\n\n /**\n * Refers to the value set that identifies the set of codes the binding\n * refers to.\n */\n readonly valueSet?: string;\n}\n\n/**\n * Formal constraints such as co-occurrence and other constraints that\n * can be computationally evaluated within the context of the instance.\n */\nexport interface ElementDefinitionConstraint {\n\n /**\n * Unique id for the element within a resource (for internal references).\n * This may be any string value that does not contain spaces.\n */\n readonly id?: string;\n\n /**\n * May be used to represent additional information that is not part of\n * the basic definition of the element. To make the use of extensions\n * safe and manageable, there is a strict set of governance applied to\n * the definition and use of extensions. Though any implementer can\n * define an extension, there is a set of requirements that SHALL be met\n * as part of the definition of the extension.\n */\n readonly extension?: Extension[];\n\n /**\n * Allows identification of which elements have their cardinalities\n * impacted by the constraint. Will not be referenced for constraints\n * that do not affect cardinality.\n */\n readonly key?: string;\n\n /**\n * Description of why this constraint is necessary or appropriate.\n */\n readonly requirements?: string;\n\n /**\n * Identifies the impact constraint violation has on the conformance of\n * the instance.\n */\n readonly severity?: string;\n\n /**\n * Text that can be used to describe the constraint in messages\n * identifying that the constraint has been violated.\n */\n readonly human?: string;\n\n /**\n * A [FHIRPath](fhirpath.html) expression of constraint that can be\n * executed to see if this constraint is met.\n */\n readonly expression?: string;\n\n /**\n * An XPath expression of constraint that can be executed to see if this\n * constraint is met.\n */\n readonly xpath?: string;\n\n /**\n * A reference to the original source of the constraint, for traceability\n * purposes.\n */\n readonly source?: string;\n}\n\n/**\n * A sample value for this element demonstrating the type of information\n * that would typically be found in the element.\n */\nexport interface ElementDefinitionExample {\n\n /**\n * Unique id for the element within a resource (for internal references).\n * This may be any string value that does not contain spaces.\n */\n readonly id?: string;\n\n /**\n * May be used to represent additional information that is not part of\n * the basic definition of the element. To make the use of extensions\n * safe and manageable, there is a strict set of governance applied to\n * the definition and use of extensions. Though any implementer can\n * define an extension, there is a set of requirements that SHALL be met\n * as part of the definition of the extension.\n */\n readonly extension?: Extension[];\n\n /**\n * Describes the purpose of this example amoung the set of examples.\n */\n readonly label?: string;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueBase64Binary?: string;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueBoolean?: boolean;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueCanonical?: string;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueCode?: string;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueDate?: string;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueDateTime?: string;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueDecimal?: number;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueId?: string;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueInstant?: string;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueInteger?: number;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueMarkdown?: string;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueOid?: string;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valuePositiveInt?: number;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueString?: string;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueTime?: string;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueUnsignedInt?: number;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueUri?: string;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueUrl?: string;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueUuid?: string;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueAddress?: Address;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueAge?: Age;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueAnnotation?: Annotation;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueAttachment?: Attachment;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueCodeableConcept?: CodeableConcept;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueCoding?: Coding;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueContactPoint?: ContactPoint;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueCount?: Count;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueDistance?: Distance;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueDuration?: Duration;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueHumanName?: HumanName;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueIdentifier?: Identifier;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueMoney?: Money;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valuePeriod?: Period;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueQuantity?: Quantity;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueRange?: Range;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueRatio?: Ratio;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueReference?: Reference;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueSampledData?: SampledData;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueSignature?: Signature;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueTiming?: Timing;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueContactDetail?: ContactDetail;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueContributor?: Contributor;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueDataRequirement?: DataRequirement;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueExpression?: Expression;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueParameterDefinition?: ParameterDefinition;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueRelatedArtifact?: RelatedArtifact;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueTriggerDefinition?: TriggerDefinition;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueUsageContext?: UsageContext;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueDosage?: Dosage;\n\n /**\n * The actual value for the element, which must be one of the types\n * allowed for this element.\n */\n readonly valueMeta?: Meta;\n}\n\n/**\n * Identifies a concept from an external specification that roughly\n * corresponds to this element.\n */\nexport interface ElementDefinitionMapping {\n\n /**\n * Unique id for the element within a resource (for internal references).\n * This may be any string value that does not contain spaces.\n */\n readonly id?: string;\n\n /**\n * May be used to represent additional information that is not part of\n * the basic definition of the element. To make the use of extensions\n * safe and manageable, there is a strict set of governance applied to\n * the definition and use of extensions. Though any implementer can\n * define an extension, there is a set of requirements that SHALL be met\n * as part of the definition of the extension.\n */\n readonly extension?: Extension[];\n\n /**\n * An internal reference to the definition of a mapping.\n */\n readonly identity?: string;\n\n /**\n * Identifies the computable language in which mapping.map is expressed.\n */\n readonly language?: string;\n\n /**\n * Expresses what part of the target specification corresponds to this\n * element.\n */\n readonly map?: string;\n\n /**\n * Comments that provide information about the mapping or its use.\n */\n readonly comment?: string;\n}\n\n/**\n * Indicates that the element is sliced into a set of alternative\n * definitions (i.e. in a structure definition, there are multiple\n * different constraints on a single element in the base resource).\n * Slicing can be used in any resource that has cardinality ..* on the\n * base resource, or any resource with a choice of types. The set of\n * slices is any elements that come after this in the element sequence\n * that have the same path, until a shorter path occurs (the shorter path\n * terminates the set).\n */\nexport interface ElementDefinitionSlicing {\n\n /**\n * Unique id for the element within a resource (for internal references).\n * This may be any string value that does not contain spaces.\n */\n readonly id?: string;\n\n /**\n * May be used to represent additional information that is not part of\n * the basic definition of the element. To make the use of extensions\n * safe and manageable, there is a strict set of governance applied to\n * the definition and use of extensions. Though any implementer can\n * define an extension, there is a set of requirements that SHALL be met\n * as part of the definition of the extension.\n */\n readonly extension?: Extension[];\n\n /**\n * Designates which child elements are used to discriminate between the\n * slices when processing an instance. If one or more discriminators are\n * provided, the value of the child elements in the instance data SHALL\n * completely distinguish which slice the element in the resource matches\n * based on the allowed values for those elements in each of the slices.\n */\n readonly discriminator?: ElementDefinitionSlicingDiscriminator[];\n\n /**\n * A human-readable text description of how the slicing works. If there\n * is no discriminator, this is required to be present to provide\n * whatever information is possible about how the slices can be\n * differentiated.\n */\n readonly description?: string;\n\n /**\n * If the matching elements have to occur in the same order as defined in\n * the profile.\n */\n readonly ordered?: boolean;\n\n /**\n * Whether additional slices are allowed or not. When the slices are\n * ordered, profile authors can also say that additional slices are only\n * allowed at the end.\n */\n readonly rules?: string;\n}\n\n/**\n * Designates which child elements are used to discriminate between the\n * slices when processing an instance. If one or more discriminators are\n * provided, the value of the child elements in the instance data SHALL\n * completely distinguish which slice the element in the resource matches\n * based on the allowed values for those elements in each of the slices.\n */\nexport interface ElementDefinitionSlicingDiscriminator {\n\n /**\n * Unique id for the element within a resource (for internal references).\n * This may be any string value that does not contain spaces.\n */\n readonly id?: string;\n\n /**\n * May be used to represent additional information that is not part of\n * the basic definition of the element. To make the use of extensions\n * safe and manageable, there is a strict set of governance applied to\n * the definition and use of extensions. Though any implementer can\n * define an extension, there is a set of requirements that SHALL be met\n * as part of the definition of the extension.\n */\n readonly extension?: Extension[];\n\n /**\n * How the element value is interpreted when discrimination is evaluated.\n */\n readonly type?: string;\n\n /**\n * A FHIRPath expression, using [the simple subset of\n * FHIRPath](fhirpath.html#simple), that is used to identify the element\n * on which discrimination is based.\n */\n readonly path?: string;\n}\n\n/**\n * The data type or resource that the value of this element is permitted\n * to be.\n */\nexport interface ElementDefinitionType {\n\n /**\n * Unique id for the element within a resource (for internal references).\n * This may be any string value that does not contain spaces.\n */\n readonly id?: string;\n\n /**\n * May be used to represent additional information that is not part of\n * the basic definition of the element. To make the use of extensions\n * safe and manageable, there is a strict set of governance applied to\n * the definition and use of extensions. Though any implementer can\n * define an extension, there is a set of requirements that SHALL be met\n * as part of the definition of the extension.\n */\n readonly extension?: Extension[];\n\n /**\n * URL of Data type or Resource that is a(or the) type used for this\n * element. References are URLs that are relative to\n * http://hl7.org/fhir/StructureDefinition e.g. "string" is a reference\n * to http://hl7.org/fhir/StructureDefinition/string. Absolute URLs are\n * only allowed in logical models.\n */\n readonly code?: string;\n\n /**\n * Identifies a profile structure or implementation Guide that applies to\n * the datatype this element refers to. If any profiles are specified,\n * then the content must conform to at least one of them. The URL can be\n * a local reference - to a contained StructureDefinition, or a reference\n * to another StructureDefinition or Implementation Guide by a canonical\n * URL. When an implementation guide is specified, the type SHALL conform\n * to at least one profile defined in the implementation guide.\n */\n readonly profile?: string[];\n\n /**\n * Used when the type is "Reference" or "canonical", and identifies a\n * profile structure or implementation Guide that applies to the target\n * of the reference this element refers to. If any profiles are\n * specified, then the content must conform to at least one of them. The\n * URL can be a local reference - to a contained StructureDefinition, or\n * a reference to another StructureDefinition or Implementation Guide by\n * a canonical URL. When an implementation guide is specified, the target\n * resource SHALL conform to at least one profile defined in the\n * implementation guide.\n */\n readonly targetProfile?: string[];\n\n /**\n * If the type is a reference to another resource, how the resource is or\n * can be aggregated - is it a contained resource, or a reference, and if\n * the context is a bundle, is it included in the bundle.\n */\n readonly aggregation?: string[];\n\n /**\n * Whether this reference needs to be version specific or version\n * independent, or whether either can be used.\n */\n readonly versioning?: string;\n}\n"]}