Skip to content

hapifhir/playground-basic

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

HAPI FHIR Playground:

This project is a skeleton project for using HAPI FHIR to access a public FHIR server hosted at http://hapi.fhir.org/baseR4.

Getting Started:

  • Take a few minutes to familiarize yourself with the FHIR Standard for health data exchange. In particular you might want to read the Executive Summary and the Developer Introduction

  • Try clicking on the link below. It is a FHIR Search operation used to look for patients with the name "Smith". (This is a publically accessible test server used by people all over the world, so we don't control what data is on it. Sometimes you may find unexpected or weird data there.)

    http://hapi.fhir.org/baseR4/Patient?family=SMITH

  • Create your own GitHub project and copy the contents of this repository into your own project (please don't fork this repository)

  • Locate the class SampleClient and run it. This class runs the same search shown above.

  • Please, do not fork this repo. Create your own private GitHub repository to do your work in.

Task 1:

  • Modify SampleClient so that it prints the first and last name, and birth date of each Patient to the screen

  • Sort the output so that the results are ordered by the patient's first name

  • Commit your work

Task 2:

  • Create a text file containing 20 different last names

  • Modify 'SampleClient' so that instead of searching for patients with last name 'SMITH', it reads in the contents of this file and for each last name queries for patients with that last name

  • Print the average response time for these 20 searches by implementing an IClientInterceptor that uses the requestStopWatch to determine the response time of each request.

  • Run this loop three times, printing the average response time for each loop. The first two times the loop should run as described above. The third time the loop of 20 searches is run, the searches should be performed with caching disabled.

  • If there is enough time between runs, you should expect to see loop 2 with a shorter average response time than loop 1 and 3.

  • Please include unit tests for your work

  • Commit your work