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.v251.group;
035
036import ca.uhn.hl7v2.model.v251.segment.*;
037
038import java.util.List;
039
040import ca.uhn.hl7v2.HL7Exception;
041import ca.uhn.hl7v2.parser.ModelClassFactory;
042import ca.uhn.hl7v2.model.*;
043
044/**
045 * <p>Represents a MFR_M05_MF_QUERY group structure (a Group object).
046 * A Group is an ordered collection of message segments that can repeat together or be optionally in/excluded together.
047 * This Group contains the following elements:  
048 * </p>
049 * <ul>
050                 * <li>1: MFE (Master File Entry) <b> </b></li>
051                 * <li>2: LOC (Location Identification) <b> </b></li>
052                 * <li>3: LCH (Location Characteristic) <b>optional repeating</b></li>
053                 * <li>4: LRL (Location Relationship) <b>optional repeating</b></li>
054                 * <li>5: LDP (Location Department) <b> repeating</b></li>
055                 * <li>6: LCH (Location Characteristic) <b>optional repeating</b></li>
056                 * <li>7: LCC (Location Charge Code) <b>optional repeating</b></li>
057 * </ul>
058 */
059@SuppressWarnings("unused")
060public class MFR_M05_MF_QUERY extends AbstractGroup {
061
062    /** 
063     * Creates a new MFR_M05_MF_QUERY group
064     */
065    public MFR_M05_MF_QUERY(Group parent, ModelClassFactory factory) {
066       super(parent, factory);
067       init(factory);
068    }
069
070    private void init(ModelClassFactory factory) {
071       try {
072                          this.add(MFE.class, true, false);
073                          this.add(LOC.class, true, false);
074                          this.add(LCH.class, false, true);
075                          this.add(LRL.class, false, true);
076                          this.add(LDP.class, true, true);
077                          this.add(LCH.class, false, true);
078                          this.add(LCC.class, false, true);
079       } catch(HL7Exception e) {
080          log.error("Unexpected error creating MFR_M05_MF_QUERY - this is probably a bug in the source code generator.", e);
081       }
082    }
083
084    /** 
085     * Returns "2.5.1"
086     */
087    public String getVersion() {
088       return "2.5.1";
089    }
090
091
092
093    /**
094     * Returns
095     * MFE (Master File Entry) - creates it if necessary
096     */
097    public MFE getMFE() { 
098       MFE retVal = getTyped("MFE", MFE.class);
099       return retVal;
100    }
101
102
103
104
105    /**
106     * Returns
107     * LOC (Location Identification) - creates it if necessary
108     */
109    public LOC getLOC() { 
110       LOC retVal = getTyped("LOC", LOC.class);
111       return retVal;
112    }
113
114
115
116
117    /**
118     * Returns
119     * the first repetition of 
120     * LCH (Location Characteristic) - creates it if necessary
121     */
122    public LCH getLCH() { 
123       LCH retVal = getTyped("LCH", LCH.class);
124       return retVal;
125    }
126
127
128    /**
129     * Returns a specific repetition of
130     * LCH (Location Characteristic) - creates it if necessary
131     *
132     * @param rep The repetition index (0-indexed, i.e. the first repetition is at index 0)
133     * @throws HL7Exception if the repetition requested is more than one 
134     *     greater than the number of existing repetitions.
135     */
136    public LCH getLCH(int rep) { 
137       LCH retVal = getTyped("LCH", rep, LCH.class);
138       return retVal;
139    }
140
141    /** 
142     * Returns the number of existing repetitions of LCH 
143     */ 
144    public int getLCHReps() {  
145        return getReps("LCH");
146    } 
147
148    /** 
149     * <p>
150     * Returns a non-modifiable List containing all current existing repetitions of LCH.
151     * <p>
152     * <p>
153     * Note that unlike {@link #getLCH()}, this method will not create any reps
154     * if none are already present, so an empty list may be returned.
155     * </p>
156     */ 
157    public List<LCH> getLCHAll() throws HL7Exception {
158        return getAllAsList("LCH", LCH.class);
159    } 
160
161    /**
162     * Inserts a specific repetition of LCH (Location Characteristic)
163     * @see AbstractGroup#insertRepetition(Structure, int) 
164     */
165    public void insertLCH(LCH structure, int rep) throws HL7Exception { 
166       super.insertRepetition("LCH", structure, rep);
167    }
168
169
170    /**
171     * Inserts a specific repetition of LCH (Location Characteristic)
172     * @see AbstractGroup#insertRepetition(Structure, int) 
173     */
174    public LCH insertLCH(int rep) throws HL7Exception { 
175       return (LCH)super.insertRepetition("LCH", rep);
176    }
177
178
179    /**
180     * Removes a specific repetition of LCH (Location Characteristic)
181     * @see AbstractGroup#removeRepetition(String, int) 
182     */
183    public LCH removeLCH(int rep) throws HL7Exception { 
184       return (LCH)super.removeRepetition("LCH", rep);
185    }
186
187
188
189    /**
190     * Returns
191     * the first repetition of 
192     * LRL (Location Relationship) - creates it if necessary
193     */
194    public LRL getLRL() { 
195       LRL retVal = getTyped("LRL", LRL.class);
196       return retVal;
197    }
198
199
200    /**
201     * Returns a specific repetition of
202     * LRL (Location Relationship) - creates it if necessary
203     *
204     * @param rep The repetition index (0-indexed, i.e. the first repetition is at index 0)
205     * @throws HL7Exception if the repetition requested is more than one 
206     *     greater than the number of existing repetitions.
207     */
208    public LRL getLRL(int rep) { 
209       LRL retVal = getTyped("LRL", rep, LRL.class);
210       return retVal;
211    }
212
213    /** 
214     * Returns the number of existing repetitions of LRL 
215     */ 
216    public int getLRLReps() {  
217        return getReps("LRL");
218    } 
219
220    /** 
221     * <p>
222     * Returns a non-modifiable List containing all current existing repetitions of LRL.
223     * <p>
224     * <p>
225     * Note that unlike {@link #getLRL()}, this method will not create any reps
226     * if none are already present, so an empty list may be returned.
227     * </p>
228     */ 
229    public List<LRL> getLRLAll() throws HL7Exception {
230        return getAllAsList("LRL", LRL.class);
231    } 
232
233    /**
234     * Inserts a specific repetition of LRL (Location Relationship)
235     * @see AbstractGroup#insertRepetition(Structure, int) 
236     */
237    public void insertLRL(LRL structure, int rep) throws HL7Exception { 
238       super.insertRepetition("LRL", structure, rep);
239    }
240
241
242    /**
243     * Inserts a specific repetition of LRL (Location Relationship)
244     * @see AbstractGroup#insertRepetition(Structure, int) 
245     */
246    public LRL insertLRL(int rep) throws HL7Exception { 
247       return (LRL)super.insertRepetition("LRL", rep);
248    }
249
250
251    /**
252     * Removes a specific repetition of LRL (Location Relationship)
253     * @see AbstractGroup#removeRepetition(String, int) 
254     */
255    public LRL removeLRL(int rep) throws HL7Exception { 
256       return (LRL)super.removeRepetition("LRL", rep);
257    }
258
259
260
261    /**
262     * Returns
263     * the first repetition of 
264     * LDP (Location Department) - creates it if necessary
265     */
266    public LDP getLDP() { 
267       LDP retVal = getTyped("LDP", LDP.class);
268       return retVal;
269    }
270
271
272    /**
273     * Returns a specific repetition of
274     * LDP (Location Department) - creates it if necessary
275     *
276     * @param rep The repetition index (0-indexed, i.e. the first repetition is at index 0)
277     * @throws HL7Exception if the repetition requested is more than one 
278     *     greater than the number of existing repetitions.
279     */
280    public LDP getLDP(int rep) { 
281       LDP retVal = getTyped("LDP", rep, LDP.class);
282       return retVal;
283    }
284
285    /** 
286     * Returns the number of existing repetitions of LDP 
287     */ 
288    public int getLDPReps() {  
289        return getReps("LDP");
290    } 
291
292    /** 
293     * <p>
294     * Returns a non-modifiable List containing all current existing repetitions of LDP.
295     * <p>
296     * <p>
297     * Note that unlike {@link #getLDP()}, this method will not create any reps
298     * if none are already present, so an empty list may be returned.
299     * </p>
300     */ 
301    public List<LDP> getLDPAll() throws HL7Exception {
302        return getAllAsList("LDP", LDP.class);
303    } 
304
305    /**
306     * Inserts a specific repetition of LDP (Location Department)
307     * @see AbstractGroup#insertRepetition(Structure, int) 
308     */
309    public void insertLDP(LDP structure, int rep) throws HL7Exception { 
310       super.insertRepetition("LDP", structure, rep);
311    }
312
313
314    /**
315     * Inserts a specific repetition of LDP (Location Department)
316     * @see AbstractGroup#insertRepetition(Structure, int) 
317     */
318    public LDP insertLDP(int rep) throws HL7Exception { 
319       return (LDP)super.insertRepetition("LDP", rep);
320    }
321
322
323    /**
324     * Removes a specific repetition of LDP (Location Department)
325     * @see AbstractGroup#removeRepetition(String, int) 
326     */
327    public LDP removeLDP(int rep) throws HL7Exception { 
328       return (LDP)super.removeRepetition("LDP", rep);
329    }
330
331
332
333    /**
334     * Returns
335     * the first repetition of 
336     * LCH2 (Location Characteristic) - creates it if necessary
337     */
338    public LCH getLCH2() { 
339       LCH retVal = getTyped("LCH2", LCH.class);
340       return retVal;
341    }
342
343
344    /**
345     * Returns a specific repetition of
346     * LCH (Location Characteristic) - creates it if necessary
347     *
348     * @param rep The repetition index (0-indexed, i.e. the first repetition is at index 0)
349     * @throws HL7Exception if the repetition requested is more than one 
350     *     greater than the number of existing repetitions.
351     */
352    public LCH getLCH2(int rep) { 
353       LCH retVal = getTyped("LCH2", rep, LCH.class);
354       return retVal;
355    }
356
357    /** 
358     * Returns the number of existing repetitions of LCH2 
359     */ 
360    public int getLCH2Reps() {  
361        return getReps("LCH2");
362    } 
363
364    /** 
365     * <p>
366     * Returns a non-modifiable List containing all current existing repetitions of LCH2.
367     * <p>
368     * <p>
369     * Note that unlike {@link #getLCH2()}, this method will not create any reps
370     * if none are already present, so an empty list may be returned.
371     * </p>
372     */ 
373    public List<LCH> getLCH2All() throws HL7Exception {
374        return getAllAsList("LCH2", LCH.class);
375    } 
376
377    /**
378     * Inserts a specific repetition of LCH2 (Location Characteristic)
379     * @see AbstractGroup#insertRepetition(Structure, int) 
380     */
381    public void insertLCH2(LCH structure, int rep) throws HL7Exception { 
382       super.insertRepetition("LCH2", structure, rep);
383    }
384
385
386    /**
387     * Inserts a specific repetition of LCH2 (Location Characteristic)
388     * @see AbstractGroup#insertRepetition(Structure, int) 
389     */
390    public LCH insertLCH2(int rep) throws HL7Exception { 
391       return (LCH)super.insertRepetition("LCH2", rep);
392    }
393
394
395    /**
396     * Removes a specific repetition of LCH2 (Location Characteristic)
397     * @see AbstractGroup#removeRepetition(String, int) 
398     */
399    public LCH removeLCH2(int rep) throws HL7Exception { 
400       return (LCH)super.removeRepetition("LCH2", rep);
401    }
402
403
404
405    /**
406     * Returns
407     * the first repetition of 
408     * LCC (Location Charge Code) - creates it if necessary
409     */
410    public LCC getLCC() { 
411       LCC retVal = getTyped("LCC", LCC.class);
412       return retVal;
413    }
414
415
416    /**
417     * Returns a specific repetition of
418     * LCC (Location Charge Code) - creates it if necessary
419     *
420     * @param rep The repetition index (0-indexed, i.e. the first repetition is at index 0)
421     * @throws HL7Exception if the repetition requested is more than one 
422     *     greater than the number of existing repetitions.
423     */
424    public LCC getLCC(int rep) { 
425       LCC retVal = getTyped("LCC", rep, LCC.class);
426       return retVal;
427    }
428
429    /** 
430     * Returns the number of existing repetitions of LCC 
431     */ 
432    public int getLCCReps() {  
433        return getReps("LCC");
434    } 
435
436    /** 
437     * <p>
438     * Returns a non-modifiable List containing all current existing repetitions of LCC.
439     * <p>
440     * <p>
441     * Note that unlike {@link #getLCC()}, this method will not create any reps
442     * if none are already present, so an empty list may be returned.
443     * </p>
444     */ 
445    public List<LCC> getLCCAll() throws HL7Exception {
446        return getAllAsList("LCC", LCC.class);
447    } 
448
449    /**
450     * Inserts a specific repetition of LCC (Location Charge Code)
451     * @see AbstractGroup#insertRepetition(Structure, int) 
452     */
453    public void insertLCC(LCC structure, int rep) throws HL7Exception { 
454       super.insertRepetition("LCC", structure, rep);
455    }
456
457
458    /**
459     * Inserts a specific repetition of LCC (Location Charge Code)
460     * @see AbstractGroup#insertRepetition(Structure, int) 
461     */
462    public LCC insertLCC(int rep) throws HL7Exception { 
463       return (LCC)super.insertRepetition("LCC", rep);
464    }
465
466
467    /**
468     * Removes a specific repetition of LCC (Location Charge Code)
469     * @see AbstractGroup#removeRepetition(String, int) 
470     */
471    public LCC removeLCC(int rep) throws HL7Exception { 
472       return (LCC)super.removeRepetition("LCC", rep);
473    }
474
475
476
477}
478