public class PPR_PC1 extends AbstractMessage
Represents a PPR_PC1 message structure (see chapter ?). This structure contains the following elements:
log
Constructor and Description |
---|
PPR_PC1()
Creates a new PPR_PC1 message with DefaultModelClassFactory.
|
PPR_PC1(ModelClassFactory factory)
Creates a new PPR_PC1 message with custom ModelClassFactory.
|
Modifier and Type | Method and Description |
---|---|
MSH |
getMSH()
Returns
MSH (Message header segment) - creates it if necessary
|
PPR_PC1_PATIENT_VISIT |
getPATIENT_VISIT()
Returns
PATIENT_VISIT (a Group object) - creates it if necessary
|
PID |
getPID()
Returns
PID (Patient Identification) - creates it if necessary
|
PPR_PC1_PROBLEM |
getPROBLEM()
Returns
the first repetition of
PROBLEM (a Group object) - creates it if necessary
|
PPR_PC1_PROBLEM |
getPROBLEM(int rep)
Returns a specific repetition of
PROBLEM (a Group object) - creates it if necessary
|
List<PPR_PC1_PROBLEM> |
getPROBLEMAll()
Returns a non-modifiable List containing all current existing repetitions of PROBLEM.
|
int |
getPROBLEMReps()
Returns the number of existing repetitions of PROBLEM
|
String |
getVersion()
Returns "2.3"
|
PPR_PC1_PROBLEM |
insertPROBLEM(int rep)
Inserts a specific repetition of PROBLEM (a Group object)
|
void |
insertPROBLEM(PPR_PC1_PROBLEM structure,
int rep)
Inserts a specific repetition of PROBLEM (a Group object)
|
PPR_PC1_PROBLEM |
removePROBLEM(int rep)
Removes a specific repetition of PROBLEM (a Group object)
|
accept, encode, fillResponseHeader, generateACK, generateACK, generateACK, getEncodingCharactersValue, getFieldSeparatorValue, getMessage, getParent, getParser, getValidationContext, initQuickstart, parse, printStructure, printStructure, setParser, toString
add, add, add, addNonstandardSegment, addNonstandardSegment, clear, currentReps, get, get, getAll, getAllAsList, getClass, getFieldNumForName, getModelClassFactory, getName, getNames, getNonStandardNames, getReps, getTyped, getTyped, insert, insert, insertRepetition, insertRepetition, isChoiceElement, isEmpty, isGroup, isRepeating, isRequired, provideLocation, removeRepetition, tryToInstantiateStructure, visitNestedStructures
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
addNonstandardSegment, addNonstandardSegment, get, get, getAll, getClass, getNames, isChoiceElement, isGroup, isRepeating, isRequired
isEmpty, provideLocation
public PPR_PC1()
public PPR_PC1(ModelClassFactory factory)
public String getVersion()
getVersion
in interface Message
getVersion
in class AbstractMessage
public PPR_PC1_PATIENT_VISIT getPATIENT_VISIT()
Returns PATIENT_VISIT (a Group object) - creates it if necessary
public PPR_PC1_PROBLEM getPROBLEM()
Returns the first repetition of PROBLEM (a Group object) - creates it if necessary
public PPR_PC1_PROBLEM getPROBLEM(int rep)
Returns a specific repetition of PROBLEM (a Group object) - creates it if necessary
rep
- The repetition index (0-indexed, i.e. the first repetition is at index 0)HL7Exception
- if the repetition requested is more than one
greater than the number of existing repetitions.public int getPROBLEMReps()
Returns the number of existing repetitions of PROBLEM
public List<PPR_PC1_PROBLEM> getPROBLEMAll() throws HL7Exception
Returns a non-modifiable List containing all current existing repetitions of PROBLEM.
Note that unlike getPROBLEM()
, this method will not create any reps
if none are already present, so an empty list may be returned.
HL7Exception
public void insertPROBLEM(PPR_PC1_PROBLEM structure, int rep) throws HL7Exception
Inserts a specific repetition of PROBLEM (a Group object)
HL7Exception
AbstractGroup#insertRepetition(Structure, int)
public PPR_PC1_PROBLEM insertPROBLEM(int rep) throws HL7Exception
Inserts a specific repetition of PROBLEM (a Group object)
HL7Exception
AbstractGroup#insertRepetition(Structure, int)
public PPR_PC1_PROBLEM removePROBLEM(int rep) throws HL7Exception
Removes a specific repetition of PROBLEM (a Group object)
HL7Exception
AbstractGroup.removeRepetition(String, int)
Copyright © 2001–2017 University Health Network. All rights reserved.