All Downloads are FREE. Search and download functionalities are using the official Maven repository.

ca.uhn.hl7v2.model.v23.message.VXR_V03 Maven / Gradle / Ivy

The newest version!
/*
 * This class is an auto-generated source file for a HAPI
 * HL7 v2.x standard structure class.
 *
 * For more information, visit: http://hl7api.sourceforge.net/
 * 
 * The contents of this file are subject to the Mozilla Public License Version 1.1 
 * (the "License"); you may not use this file except in compliance with the License. 
 * You may obtain a copy of the License at http://www.mozilla.org/MPL/ 
 * Software distributed under the License is distributed on an "AS IS" basis, 
 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for the 
 * specific language governing rights and limitations under the License. 
 * 
 * The Original Code is "[file_name]".  Description: 
 * "[one_line_description]" 
 * 
 * The Initial Developer of the Original Code is University Health Network. Copyright (C) 
 * 2012.  All Rights Reserved. 
 * 
 * Contributor(s): ______________________________________. 
 * 
 * Alternatively, the contents of this file may be used under the terms of the 
 * GNU General Public License (the  "GPL"), in which case the provisions of the GPL are 
 * applicable instead of those above.  If you wish to allow use of your version of this 
 * file only under the terms of the GPL and not to allow others to use your version 
 * of this file under the MPL, indicate your decision by deleting  the provisions above 
 * and replace  them with the notice and other provisions required by the GPL License.  
 * If you do not delete the provisions above, a recipient may use your version of 
 * this file under either the MPL or the GPL. 
 * 
 */


package ca.uhn.hl7v2.model.v23.message;

import ca.uhn.hl7v2.model.v23.group.*;
import ca.uhn.hl7v2.model.v23.segment.*;

import ca.uhn.hl7v2.HL7Exception;
import ca.uhn.hl7v2.parser.ModelClassFactory;
import ca.uhn.hl7v2.parser.DefaultModelClassFactory;
import ca.uhn.hl7v2.model.*;


/**
 * 

Represents a VXR_V03 message structure (see chapter ?). This structure contains the * following elements:

*
    *
  • 1: MSH (Message header segment)
  • *
  • 2: MSA (Message acknowledgement segment)
  • *
  • 3: QRD (Query definition segment)
  • *
  • 4: QRF (Query filter segment) optional
  • *
  • 5: PID (Patient Identification)
  • *
  • 6: PD1 (Patient Demographic) optional
  • *
  • 7: NK1 (Next of kin) optional repeating
  • *
  • 8: VXR_V03_PATIENT_VISIT (a Group object) optional
  • *
  • 9: VXR_V03_INSURANCE (a Group object) optional repeating
  • *
  • 10: VXR_V03_ORDER (a Group object) optional repeating
  • *
*/ //@SuppressWarnings("unused") public class VXR_V03 extends AbstractMessage { /** * Creates a new VXR_V03 message with DefaultModelClassFactory. */ public VXR_V03() { this(new DefaultModelClassFactory()); } /** * Creates a new VXR_V03 message with custom ModelClassFactory. */ public VXR_V03(ModelClassFactory factory) { super(factory); init(factory); } private void init(ModelClassFactory factory) { try { this.add(MSH.class, true, false); this.add(MSA.class, true, false); this.add(QRD.class, true, false); this.add(QRF.class, false, false); this.add(PID.class, true, false); this.add(PD1.class, false, false); this.add(NK1.class, false, true); this.add(VXR_V03_PATIENT_VISIT.class, false, false); this.add(VXR_V03_INSURANCE.class, false, true); this.add(VXR_V03_ORDER.class, false, true); } catch(HL7Exception e) { log.error("Unexpected error creating VXR_V03 - this is probably a bug in the source code generator.", e); } } /** * Returns "2.3" */ public String getVersion() { return "2.3"; } /** *

* Returns * MSH (Message header segment) - creates it if necessary *

* * */ public MSH getMSH() { return getTyped("MSH", MSH.class); } /** *

* Returns * MSA (Message acknowledgement segment) - creates it if necessary *

* * */ public MSA getMSA() { return getTyped("MSA", MSA.class); } /** *

* Returns * QRD (Query definition segment) - creates it if necessary *

* * */ public QRD getQRD() { return getTyped("QRD", QRD.class); } /** *

* Returns * QRF (Query filter segment) - creates it if necessary *

* * */ public QRF getQRF() { return getTyped("QRF", QRF.class); } /** *

* Returns * PID (Patient Identification) - creates it if necessary *

* * */ public PID getPID() { return getTyped("PID", PID.class); } /** *

* Returns * PD1 (Patient Demographic) - creates it if necessary *

* * */ public PD1 getPD1() { return getTyped("PD1", PD1.class); } /** *

* Returns * the first repetition of * NK1 (Next of kin) - creates it if necessary *

* * */ public NK1 getNK1() { return getTyped("NK1", NK1.class); } /** *

* Returns a specific repetition of * NK1 (Next of kin) - creates it if necessary *

* * * @param rep The repetition index (0-indexed, i.e. the first repetition is at index 0) * @throws HL7Exception if the repetition requested is more than one * greater than the number of existing repetitions. */ public NK1 getNK1(int rep) { return getTyped("NK1", rep, NK1.class); } /** *

* Returns the number of existing repetitions of NK1 *

* */ public int getNK1Reps() { return getReps("NK1"); } /** *

* Returns a non-modifiable List containing all current existing repetitions of NK1. *

*

* Note that unlike {@link #getNK1()}, this method will not create any reps * if none are already present, so an empty list may be returned. *

* */ public java.util.List getNK1All() throws HL7Exception { return getAllAsList("NK1", NK1.class); } /** *

* Inserts a specific repetition of NK1 (Next of kin) *

* * * @see AbstractGroup#insertRepetition(Structure, int) */ public void insertNK1(NK1 structure, int rep) throws HL7Exception { super.insertRepetition( "NK1", structure, rep); } /** *

* Inserts a specific repetition of NK1 (Next of kin) *

* * * @see AbstractGroup#insertRepetition(Structure, int) */ public NK1 insertNK1(int rep) throws HL7Exception { return (NK1)super.insertRepetition("NK1", rep); } /** *

* Removes a specific repetition of NK1 (Next of kin) *

* * * @see AbstractGroup#removeRepetition(String, int) */ public NK1 removeNK1(int rep) throws HL7Exception { return (NK1)super.removeRepetition("NK1", rep); } /** *

* Returns * PATIENT_VISIT (a Group object) - creates it if necessary *

* * */ public VXR_V03_PATIENT_VISIT getPATIENT_VISIT() { return getTyped("PATIENT_VISIT", VXR_V03_PATIENT_VISIT.class); } /** *

* Returns * the first repetition of * INSURANCE (a Group object) - creates it if necessary *

* * */ public VXR_V03_INSURANCE getINSURANCE() { return getTyped("INSURANCE", VXR_V03_INSURANCE.class); } /** *

* Returns a specific repetition of * INSURANCE (a Group object) - creates it if necessary *

* * * @param rep The repetition index (0-indexed, i.e. the first repetition is at index 0) * @throws HL7Exception if the repetition requested is more than one * greater than the number of existing repetitions. */ public VXR_V03_INSURANCE getINSURANCE(int rep) { return getTyped("INSURANCE", rep, VXR_V03_INSURANCE.class); } /** *

* Returns the number of existing repetitions of INSURANCE *

* */ public int getINSURANCEReps() { return getReps("INSURANCE"); } /** *

* Returns a non-modifiable List containing all current existing repetitions of INSURANCE. *

*

* Note that unlike {@link #getINSURANCE()}, this method will not create any reps * if none are already present, so an empty list may be returned. *

* */ public java.util.List getINSURANCEAll() throws HL7Exception { return getAllAsList("INSURANCE", VXR_V03_INSURANCE.class); } /** *

* Inserts a specific repetition of INSURANCE (a Group object) *

* * * @see AbstractGroup#insertRepetition(Structure, int) */ public void insertINSURANCE(VXR_V03_INSURANCE structure, int rep) throws HL7Exception { super.insertRepetition( "INSURANCE", structure, rep); } /** *

* Inserts a specific repetition of INSURANCE (a Group object) *

* * * @see AbstractGroup#insertRepetition(Structure, int) */ public VXR_V03_INSURANCE insertINSURANCE(int rep) throws HL7Exception { return (VXR_V03_INSURANCE)super.insertRepetition("INSURANCE", rep); } /** *

* Removes a specific repetition of INSURANCE (a Group object) *

* * * @see AbstractGroup#removeRepetition(String, int) */ public VXR_V03_INSURANCE removeINSURANCE(int rep) throws HL7Exception { return (VXR_V03_INSURANCE)super.removeRepetition("INSURANCE", rep); } /** *

* Returns * the first repetition of * ORDER (a Group object) - creates it if necessary *

* * */ public VXR_V03_ORDER getORDER() { return getTyped("ORDER", VXR_V03_ORDER.class); } /** *

* Returns a specific repetition of * ORDER (a Group object) - creates it if necessary *

* * * @param rep The repetition index (0-indexed, i.e. the first repetition is at index 0) * @throws HL7Exception if the repetition requested is more than one * greater than the number of existing repetitions. */ public VXR_V03_ORDER getORDER(int rep) { return getTyped("ORDER", rep, VXR_V03_ORDER.class); } /** *

* Returns the number of existing repetitions of ORDER *

* */ public int getORDERReps() { return getReps("ORDER"); } /** *

* Returns a non-modifiable List containing all current existing repetitions of ORDER. *

*

* Note that unlike {@link #getORDER()}, this method will not create any reps * if none are already present, so an empty list may be returned. *

* */ public java.util.List getORDERAll() throws HL7Exception { return getAllAsList("ORDER", VXR_V03_ORDER.class); } /** *

* Inserts a specific repetition of ORDER (a Group object) *

* * * @see AbstractGroup#insertRepetition(Structure, int) */ public void insertORDER(VXR_V03_ORDER structure, int rep) throws HL7Exception { super.insertRepetition( "ORDER", structure, rep); } /** *

* Inserts a specific repetition of ORDER (a Group object) *

* * * @see AbstractGroup#insertRepetition(Structure, int) */ public VXR_V03_ORDER insertORDER(int rep) throws HL7Exception { return (VXR_V03_ORDER)super.insertRepetition("ORDER", rep); } /** *

* Removes a specific repetition of ORDER (a Group object) *

* * * @see AbstractGroup#removeRepetition(String, int) */ public VXR_V03_ORDER removeORDER(int rep) throws HL7Exception { return (VXR_V03_ORDER)super.removeRepetition("ORDER", rep); } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy