public class MFN_M15 extends AbstractMessage
Represents a MFN_M15 message structure (see chapter 8.12.1). This structure contains the following elements:
log
Constructor and Description |
---|
MFN_M15()
Creates a new MFN_M15 message with DefaultModelClassFactory.
|
MFN_M15(ModelClassFactory factory)
Creates a new MFN_M15 message with custom ModelClassFactory.
|
Modifier and Type | Method and Description |
---|---|
MFN_M15_MF_INV_ITEM |
getMF_INV_ITEM()
Returns
the first repetition of
MF_INV_ITEM (a Group object) - creates it if necessary
|
MFN_M15_MF_INV_ITEM |
getMF_INV_ITEM(int rep)
Returns a specific repetition of
MF_INV_ITEM (a Group object) - creates it if necessary
|
List<MFN_M15_MF_INV_ITEM> |
getMF_INV_ITEMAll()
Returns a non-modifiable List containing all current existing repetitions of MF_INV_ITEM.
|
int |
getMF_INV_ITEMReps()
Returns the number of existing repetitions of MF_INV_ITEM
|
MFI |
getMFI()
Returns
MFI (Master File Identification) - creates it if necessary
|
MSH |
getMSH()
Returns
MSH (Message Header) - creates it if necessary
|
SFT |
getSFT()
Returns
the first repetition of
SFT (Software Segment) - creates it if necessary
|
SFT |
getSFT(int rep)
Returns a specific repetition of
SFT (Software Segment) - creates it if necessary
|
List<SFT> |
getSFTAll()
Returns a non-modifiable List containing all current existing repetitions of SFT.
|
int |
getSFTReps()
Returns the number of existing repetitions of SFT
|
UAC |
getUAC()
Returns
UAC (User Authentication Credential Segment) - creates it if necessary
|
String |
getVersion()
Returns "2.7"
|
MFN_M15_MF_INV_ITEM |
insertMF_INV_ITEM(int rep)
Inserts a specific repetition of MF_INV_ITEM (a Group object)
|
void |
insertMF_INV_ITEM(MFN_M15_MF_INV_ITEM structure,
int rep)
Inserts a specific repetition of MF_INV_ITEM (a Group object)
|
SFT |
insertSFT(int rep)
Inserts a specific repetition of SFT (Software Segment)
|
void |
insertSFT(SFT structure,
int rep)
Inserts a specific repetition of SFT (Software Segment)
|
MFN_M15_MF_INV_ITEM |
removeMF_INV_ITEM(int rep)
Removes a specific repetition of MF_INV_ITEM (a Group object)
|
SFT |
removeSFT(int rep)
Removes a specific repetition of SFT (Software Segment)
|
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 MFN_M15()
public MFN_M15(ModelClassFactory factory)
public String getVersion()
getVersion
in interface Message
getVersion
in class AbstractMessage
public SFT getSFT()
Returns the first repetition of SFT (Software Segment) - creates it if necessary
public SFT getSFT(int rep)
Returns a specific repetition of SFT (Software Segment) - 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 getSFTReps()
Returns the number of existing repetitions of SFT
public List<SFT> getSFTAll() throws HL7Exception
Returns a non-modifiable List containing all current existing repetitions of SFT.
Note that unlike getSFT()
, this method will not create any reps
if none are already present, so an empty list may be returned.
HL7Exception
public void insertSFT(SFT structure, int rep) throws HL7Exception
Inserts a specific repetition of SFT (Software Segment)
HL7Exception
AbstractGroup#insertRepetition(Structure, int)
public SFT insertSFT(int rep) throws HL7Exception
Inserts a specific repetition of SFT (Software Segment)
HL7Exception
AbstractGroup#insertRepetition(Structure, int)
public SFT removeSFT(int rep) throws HL7Exception
Removes a specific repetition of SFT (Software Segment)
HL7Exception
AbstractGroup.removeRepetition(String, int)
public UAC getUAC()
Returns UAC (User Authentication Credential Segment) - creates it if necessary
public MFN_M15_MF_INV_ITEM getMF_INV_ITEM()
Returns the first repetition of MF_INV_ITEM (a Group object) - creates it if necessary
public MFN_M15_MF_INV_ITEM getMF_INV_ITEM(int rep)
Returns a specific repetition of MF_INV_ITEM (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 getMF_INV_ITEMReps()
Returns the number of existing repetitions of MF_INV_ITEM
public List<MFN_M15_MF_INV_ITEM> getMF_INV_ITEMAll() throws HL7Exception
Returns a non-modifiable List containing all current existing repetitions of MF_INV_ITEM.
Note that unlike getMF_INV_ITEM()
, this method will not create any reps
if none are already present, so an empty list may be returned.
HL7Exception
public void insertMF_INV_ITEM(MFN_M15_MF_INV_ITEM structure, int rep) throws HL7Exception
Inserts a specific repetition of MF_INV_ITEM (a Group object)
HL7Exception
AbstractGroup#insertRepetition(Structure, int)
public MFN_M15_MF_INV_ITEM insertMF_INV_ITEM(int rep) throws HL7Exception
Inserts a specific repetition of MF_INV_ITEM (a Group object)
HL7Exception
AbstractGroup#insertRepetition(Structure, int)
public MFN_M15_MF_INV_ITEM removeMF_INV_ITEM(int rep) throws HL7Exception
Removes a specific repetition of MF_INV_ITEM (a Group object)
HL7Exception
AbstractGroup.removeRepetition(String, int)
Copyright © 2001–2017 University Health Network. All rights reserved.