001/*
002 * This class is an auto-generated source file for a HAPI
003 * HL7 v2.x standard structure class.
004 *
005 * For more information, visit: http://hl7api.sourceforge.net/
006 * 
007 * The contents of this file are subject to the Mozilla Public License Version 1.1 
008 * (the "License"); you may not use this file except in compliance with the License. 
009 * You may obtain a copy of the License at http://www.mozilla.org/MPL/ 
010 * Software distributed under the License is distributed on an "AS IS" basis, 
011 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for the 
012 * specific language governing rights and limitations under the License. 
013 * 
014 * The Original Code is "[file_name]".  Description: 
015 * "[one_line_description]" 
016 * 
017 * The Initial Developer of the Original Code is University Health Network. Copyright (C) 
018 * 2012.  All Rights Reserved. 
019 * 
020 * Contributor(s): ______________________________________. 
021 * 
022 * Alternatively, the contents of this file may be used under the terms of the 
023 * GNU General Public License (the  "GPL"), in which case the provisions of the GPL are 
024 * applicable instead of those above.  If you wish to allow use of your version of this 
025 * file only under the terms of the GPL and not to allow others to use your version 
026 * of this file under the MPL, indicate your decision by deleting  the provisions above 
027 * and replace  them with the notice and other provisions required by the GPL License.  
028 * If you do not delete the provisions above, a recipient may use your version of 
029 * this file under either the MPL or the GPL. 
030 * 
031 */
032
033
034package ca.uhn.hl7v2.model.v27.message;
035
036import ca.uhn.hl7v2.model.v27.group.*;
037import ca.uhn.hl7v2.model.v27.segment.*;
038
039import ca.uhn.hl7v2.HL7Exception;
040import ca.uhn.hl7v2.parser.ModelClassFactory;
041import ca.uhn.hl7v2.parser.DefaultModelClassFactory;
042import ca.uhn.hl7v2.model.*;
043
044
045/**
046 * <p>Represents a RQC_I05 message structure (see chapter 11.3.5). This structure contains the 
047 * following elements: </p>
048 * <ul>
049                                 * <li>1: MSH (Message Header) <b> </b> </li>
050                                 * <li>2: SFT (Software Segment) <b>optional repeating</b> </li>
051                                 * <li>3: UAC (User Authentication Credential Segment) <b>optional </b> </li>
052                                 * <li>4: QRD (withdrawn) <b> </b> </li>
053                                 * <li>5: QRF (withdrawn) <b>optional </b> </li>
054                                 * <li>6: RQC_I05_PROVIDER (a Group object) <b> repeating</b> </li>
055                                 * <li>7: PID (Patient Identification) <b> </b> </li>
056                                 * <li>8: NK1 (Next of Kin / Associated Parties) <b>optional repeating</b> </li>
057                                 * <li>9: GT1 (Guarantor) <b>optional repeating</b> </li>
058                                 * <li>10: NTE (Notes and Comments) <b>optional repeating</b> </li>
059 * </ul>
060 */
061//@SuppressWarnings("unused")
062public class RQC_I05 extends AbstractMessage  {
063
064    /**
065     * Creates a new RQC_I05 message with DefaultModelClassFactory. 
066     */ 
067    public RQC_I05() { 
068       this(new DefaultModelClassFactory());
069    }
070
071    /** 
072     * Creates a new RQC_I05 message with custom ModelClassFactory.
073     */
074    public RQC_I05(ModelClassFactory factory) {
075       super(factory);
076       init(factory);
077    }
078
079    private void init(ModelClassFactory factory) {
080       try {
081                          this.add(MSH.class, true, false);
082                                  this.add(SFT.class, false, true);
083                                  this.add(UAC.class, false, false);
084                                  this.add(QRD.class, true, false);
085                                  this.add(QRF.class, false, false);
086                                  this.add(RQC_I05_PROVIDER.class, true, true);
087                                  this.add(PID.class, true, false);
088                                  this.add(NK1.class, false, true);
089                                  this.add(GT1.class, false, true);
090                                  this.add(NTE.class, false, true);
091               } catch(HL7Exception e) {
092          log.error("Unexpected error creating RQC_I05 - this is probably a bug in the source code generator.", e);
093       }
094    }
095
096
097    /** 
098     * Returns "2.7"
099     */
100    public String getVersion() {
101       return "2.7";
102    }
103
104
105
106
107    /**
108     * <p>
109     * Returns
110     * MSH (Message Header) - creates it if necessary
111     * </p>
112     * 
113     *
114     */
115    public MSH getMSH() { 
116       return getTyped("MSH", MSH.class);
117    }
118
119
120
121
122
123    /**
124     * <p>
125     * Returns
126     * the first repetition of 
127     * SFT (Software Segment) - creates it if necessary
128     * </p>
129     * 
130     *
131     */
132    public SFT getSFT() { 
133       return getTyped("SFT", SFT.class);
134    }
135
136
137    /**
138     * <p>
139     * Returns a specific repetition of
140     * SFT (Software Segment) - creates it if necessary
141     * </p>
142     * 
143     *
144     * @param rep The repetition index (0-indexed, i.e. the first repetition is at index 0)
145     * @throws HL7Exception if the repetition requested is more than one 
146     *     greater than the number of existing repetitions.
147     */
148    public SFT getSFT(int rep) { 
149       return getTyped("SFT", rep, SFT.class);
150    }
151
152    /** 
153     * <p>
154     * Returns the number of existing repetitions of SFT 
155     * </p>
156     * 
157     */ 
158    public int getSFTReps() { 
159        return getReps("SFT");
160    } 
161
162    /** 
163     * <p>
164     * Returns a non-modifiable List containing all current existing repetitions of SFT.
165     * <p>
166     * <p>
167     * Note that unlike {@link #getSFT()}, this method will not create any reps
168     * if none are already present, so an empty list may be returned.
169     * </p>
170     * 
171     */ 
172    public java.util.List<SFT> getSFTAll() throws HL7Exception {
173        return getAllAsList("SFT", SFT.class);
174    } 
175
176    /**
177     * <p>
178     * Inserts a specific repetition of SFT (Software Segment)
179     * </p>
180     * 
181     *
182     * @see AbstractGroup#insertRepetition(Structure, int) 
183     */
184    public void insertSFT(SFT structure, int rep) throws HL7Exception { 
185       super.insertRepetition( "SFT", structure, rep);
186    }
187
188
189    /**
190     * <p>
191     * Inserts a specific repetition of SFT (Software Segment)
192     * </p>
193     * 
194     *
195     * @see AbstractGroup#insertRepetition(Structure, int) 
196     */
197    public SFT insertSFT(int rep) throws HL7Exception { 
198       return (SFT)super.insertRepetition("SFT", rep);
199    }
200
201
202    /**
203     * <p>
204     * Removes a specific repetition of SFT (Software Segment)
205     * </p>
206     * 
207     *
208     * @see AbstractGroup#removeRepetition(String, int) 
209     */
210    public SFT removeSFT(int rep) throws HL7Exception { 
211       return (SFT)super.removeRepetition("SFT", rep);
212    }
213
214
215
216
217    /**
218     * <p>
219     * Returns
220     * UAC (User Authentication Credential Segment) - creates it if necessary
221     * </p>
222     * 
223     *
224     */
225    public UAC getUAC() { 
226       return getTyped("UAC", UAC.class);
227    }
228
229
230
231
232
233    /**
234     * <p>
235     * Returns
236     * QRD (withdrawn) - creates it if necessary
237     * </p>
238     * 
239     *
240     */
241    public QRD getQRD() { 
242       return getTyped("QRD", QRD.class);
243    }
244
245
246
247
248
249    /**
250     * <p>
251     * Returns
252     * QRF (withdrawn) - creates it if necessary
253     * </p>
254     * 
255     *
256     */
257    public QRF getQRF() { 
258       return getTyped("QRF", QRF.class);
259    }
260
261
262
263
264
265    /**
266     * <p>
267     * Returns
268     * the first repetition of 
269     * PROVIDER (a Group object) - creates it if necessary
270     * </p>
271     * 
272     *
273     */
274    public RQC_I05_PROVIDER getPROVIDER() { 
275       return getTyped("PROVIDER", RQC_I05_PROVIDER.class);
276    }
277
278
279    /**
280     * <p>
281     * Returns a specific repetition of
282     * PROVIDER (a Group object) - creates it if necessary
283     * </p>
284     * 
285     *
286     * @param rep The repetition index (0-indexed, i.e. the first repetition is at index 0)
287     * @throws HL7Exception if the repetition requested is more than one 
288     *     greater than the number of existing repetitions.
289     */
290    public RQC_I05_PROVIDER getPROVIDER(int rep) { 
291       return getTyped("PROVIDER", rep, RQC_I05_PROVIDER.class);
292    }
293
294    /** 
295     * <p>
296     * Returns the number of existing repetitions of PROVIDER 
297     * </p>
298     * 
299     */ 
300    public int getPROVIDERReps() { 
301        return getReps("PROVIDER");
302    } 
303
304    /** 
305     * <p>
306     * Returns a non-modifiable List containing all current existing repetitions of PROVIDER.
307     * <p>
308     * <p>
309     * Note that unlike {@link #getPROVIDER()}, this method will not create any reps
310     * if none are already present, so an empty list may be returned.
311     * </p>
312     * 
313     */ 
314    public java.util.List<RQC_I05_PROVIDER> getPROVIDERAll() throws HL7Exception {
315        return getAllAsList("PROVIDER", RQC_I05_PROVIDER.class);
316    } 
317
318    /**
319     * <p>
320     * Inserts a specific repetition of PROVIDER (a Group object)
321     * </p>
322     * 
323     *
324     * @see AbstractGroup#insertRepetition(Structure, int) 
325     */
326    public void insertPROVIDER(RQC_I05_PROVIDER structure, int rep) throws HL7Exception { 
327       super.insertRepetition( "PROVIDER", structure, rep);
328    }
329
330
331    /**
332     * <p>
333     * Inserts a specific repetition of PROVIDER (a Group object)
334     * </p>
335     * 
336     *
337     * @see AbstractGroup#insertRepetition(Structure, int) 
338     */
339    public RQC_I05_PROVIDER insertPROVIDER(int rep) throws HL7Exception { 
340       return (RQC_I05_PROVIDER)super.insertRepetition("PROVIDER", rep);
341    }
342
343
344    /**
345     * <p>
346     * Removes a specific repetition of PROVIDER (a Group object)
347     * </p>
348     * 
349     *
350     * @see AbstractGroup#removeRepetition(String, int) 
351     */
352    public RQC_I05_PROVIDER removePROVIDER(int rep) throws HL7Exception { 
353       return (RQC_I05_PROVIDER)super.removeRepetition("PROVIDER", rep);
354    }
355
356
357
358
359    /**
360     * <p>
361     * Returns
362     * PID (Patient Identification) - creates it if necessary
363     * </p>
364     * 
365     *
366     */
367    public PID getPID() { 
368       return getTyped("PID", PID.class);
369    }
370
371
372
373
374
375    /**
376     * <p>
377     * Returns
378     * the first repetition of 
379     * NK1 (Next of Kin / Associated Parties) - creates it if necessary
380     * </p>
381     * 
382     *
383     */
384    public NK1 getNK1() { 
385       return getTyped("NK1", NK1.class);
386    }
387
388
389    /**
390     * <p>
391     * Returns a specific repetition of
392     * NK1 (Next of Kin / Associated Parties) - creates it if necessary
393     * </p>
394     * 
395     *
396     * @param rep The repetition index (0-indexed, i.e. the first repetition is at index 0)
397     * @throws HL7Exception if the repetition requested is more than one 
398     *     greater than the number of existing repetitions.
399     */
400    public NK1 getNK1(int rep) { 
401       return getTyped("NK1", rep, NK1.class);
402    }
403
404    /** 
405     * <p>
406     * Returns the number of existing repetitions of NK1 
407     * </p>
408     * 
409     */ 
410    public int getNK1Reps() { 
411        return getReps("NK1");
412    } 
413
414    /** 
415     * <p>
416     * Returns a non-modifiable List containing all current existing repetitions of NK1.
417     * <p>
418     * <p>
419     * Note that unlike {@link #getNK1()}, this method will not create any reps
420     * if none are already present, so an empty list may be returned.
421     * </p>
422     * 
423     */ 
424    public java.util.List<NK1> getNK1All() throws HL7Exception {
425        return getAllAsList("NK1", NK1.class);
426    } 
427
428    /**
429     * <p>
430     * Inserts a specific repetition of NK1 (Next of Kin / Associated Parties)
431     * </p>
432     * 
433     *
434     * @see AbstractGroup#insertRepetition(Structure, int) 
435     */
436    public void insertNK1(NK1 structure, int rep) throws HL7Exception { 
437       super.insertRepetition( "NK1", structure, rep);
438    }
439
440
441    /**
442     * <p>
443     * Inserts a specific repetition of NK1 (Next of Kin / Associated Parties)
444     * </p>
445     * 
446     *
447     * @see AbstractGroup#insertRepetition(Structure, int) 
448     */
449    public NK1 insertNK1(int rep) throws HL7Exception { 
450       return (NK1)super.insertRepetition("NK1", rep);
451    }
452
453
454    /**
455     * <p>
456     * Removes a specific repetition of NK1 (Next of Kin / Associated Parties)
457     * </p>
458     * 
459     *
460     * @see AbstractGroup#removeRepetition(String, int) 
461     */
462    public NK1 removeNK1(int rep) throws HL7Exception { 
463       return (NK1)super.removeRepetition("NK1", rep);
464    }
465
466
467
468
469    /**
470     * <p>
471     * Returns
472     * the first repetition of 
473     * GT1 (Guarantor) - creates it if necessary
474     * </p>
475     * 
476     *
477     */
478    public GT1 getGT1() { 
479       return getTyped("GT1", GT1.class);
480    }
481
482
483    /**
484     * <p>
485     * Returns a specific repetition of
486     * GT1 (Guarantor) - creates it if necessary
487     * </p>
488     * 
489     *
490     * @param rep The repetition index (0-indexed, i.e. the first repetition is at index 0)
491     * @throws HL7Exception if the repetition requested is more than one 
492     *     greater than the number of existing repetitions.
493     */
494    public GT1 getGT1(int rep) { 
495       return getTyped("GT1", rep, GT1.class);
496    }
497
498    /** 
499     * <p>
500     * Returns the number of existing repetitions of GT1 
501     * </p>
502     * 
503     */ 
504    public int getGT1Reps() { 
505        return getReps("GT1");
506    } 
507
508    /** 
509     * <p>
510     * Returns a non-modifiable List containing all current existing repetitions of GT1.
511     * <p>
512     * <p>
513     * Note that unlike {@link #getGT1()}, this method will not create any reps
514     * if none are already present, so an empty list may be returned.
515     * </p>
516     * 
517     */ 
518    public java.util.List<GT1> getGT1All() throws HL7Exception {
519        return getAllAsList("GT1", GT1.class);
520    } 
521
522    /**
523     * <p>
524     * Inserts a specific repetition of GT1 (Guarantor)
525     * </p>
526     * 
527     *
528     * @see AbstractGroup#insertRepetition(Structure, int) 
529     */
530    public void insertGT1(GT1 structure, int rep) throws HL7Exception { 
531       super.insertRepetition( "GT1", structure, rep);
532    }
533
534
535    /**
536     * <p>
537     * Inserts a specific repetition of GT1 (Guarantor)
538     * </p>
539     * 
540     *
541     * @see AbstractGroup#insertRepetition(Structure, int) 
542     */
543    public GT1 insertGT1(int rep) throws HL7Exception { 
544       return (GT1)super.insertRepetition("GT1", rep);
545    }
546
547
548    /**
549     * <p>
550     * Removes a specific repetition of GT1 (Guarantor)
551     * </p>
552     * 
553     *
554     * @see AbstractGroup#removeRepetition(String, int) 
555     */
556    public GT1 removeGT1(int rep) throws HL7Exception { 
557       return (GT1)super.removeRepetition("GT1", rep);
558    }
559
560
561
562
563    /**
564     * <p>
565     * Returns
566     * the first repetition of 
567     * NTE (Notes and Comments) - creates it if necessary
568     * </p>
569     * 
570     *
571     */
572    public NTE getNTE() { 
573       return getTyped("NTE", NTE.class);
574    }
575
576
577    /**
578     * <p>
579     * Returns a specific repetition of
580     * NTE (Notes and Comments) - creates it if necessary
581     * </p>
582     * 
583     *
584     * @param rep The repetition index (0-indexed, i.e. the first repetition is at index 0)
585     * @throws HL7Exception if the repetition requested is more than one 
586     *     greater than the number of existing repetitions.
587     */
588    public NTE getNTE(int rep) { 
589       return getTyped("NTE", rep, NTE.class);
590    }
591
592    /** 
593     * <p>
594     * Returns the number of existing repetitions of NTE 
595     * </p>
596     * 
597     */ 
598    public int getNTEReps() { 
599        return getReps("NTE");
600    } 
601
602    /** 
603     * <p>
604     * Returns a non-modifiable List containing all current existing repetitions of NTE.
605     * <p>
606     * <p>
607     * Note that unlike {@link #getNTE()}, this method will not create any reps
608     * if none are already present, so an empty list may be returned.
609     * </p>
610     * 
611     */ 
612    public java.util.List<NTE> getNTEAll() throws HL7Exception {
613        return getAllAsList("NTE", NTE.class);
614    } 
615
616    /**
617     * <p>
618     * Inserts a specific repetition of NTE (Notes and Comments)
619     * </p>
620     * 
621     *
622     * @see AbstractGroup#insertRepetition(Structure, int) 
623     */
624    public void insertNTE(NTE structure, int rep) throws HL7Exception { 
625       super.insertRepetition( "NTE", structure, rep);
626    }
627
628
629    /**
630     * <p>
631     * Inserts a specific repetition of NTE (Notes and Comments)
632     * </p>
633     * 
634     *
635     * @see AbstractGroup#insertRepetition(Structure, int) 
636     */
637    public NTE insertNTE(int rep) throws HL7Exception { 
638       return (NTE)super.insertRepetition("NTE", rep);
639    }
640
641
642    /**
643     * <p>
644     * Removes a specific repetition of NTE (Notes and Comments)
645     * </p>
646     * 
647     *
648     * @see AbstractGroup#removeRepetition(String, int) 
649     */
650    public NTE removeNTE(int rep) throws HL7Exception { 
651       return (NTE)super.removeRepetition("NTE", rep);
652    }
653
654
655
656}
657