DFT_P11_TIMING_QUANTITY.cs :  » Network-Clients » nHapi » NHapi » Model » V251 » Group » C# / CSharp Open Source

Home
C# / CSharp Open Source
1.2.6.4 mono .net core
2.2.6.4 mono core
3.Aspect Oriented Frameworks
4.Bloggers
5.Build Systems
6.Business Application
7.Charting Reporting Tools
8.Chat Servers
9.Code Coverage Tools
10.Content Management Systems CMS
11.CRM ERP
12.Database
13.Development
14.Email
15.Forum
16.Game
17.GIS
18.GUI
19.IDEs
20.Installers Generators
21.Inversion of Control Dependency Injection
22.Issue Tracking
23.Logging Tools
24.Message
25.Mobile
26.Network Clients
27.Network Servers
28.Office
29.PDF
30.Persistence Frameworks
31.Portals
32.Profilers
33.Project Management
34.RSS RDF
35.Rule Engines
36.Script
37.Search Engines
38.Sound Audio
39.Source Control
40.SQL Clients
41.Template Engines
42.Testing
43.UML
44.Web Frameworks
45.Web Service
46.Web Testing
47.Wiki Engines
48.Windows Presentation Foundation
49.Workflows
50.XML Parsers
C# / C Sharp
C# / C Sharp by API
C# / CSharp Tutorial
C# / CSharp Open Source » Network Clients » nHapi 
nHapi » NHapi » Model » V251 » Group » DFT_P11_TIMING_QUANTITY.cs
using NHapi.Base.Parser;
using NHapi.Base;
using NHapi.Base.Log;
using System;
using NHapi.Model.V251.Segment;

using NHapi.Base.Model;

namespace NHapi.Model.V251.Group{
///<summary>
///Represents the DFT_P11_TIMING_QUANTITY Group.  A Group is an ordered collection of message 
/// segments that can repeat together or be optionally in/excluded together.
/// This Group contains the following elements: 
///<ol>
///<li>0: TQ1 (Timing/Quantity) </li>
///<li>1: TQ2 (Timing/Quantity Relationship) optional repeating</li>
///</ol>
///</summary>
[Serializable]
public class DFT_P11_TIMING_QUANTITY : AbstractGroup {

  ///<summary> 
  /// Creates a new DFT_P11_TIMING_QUANTITY Group.
  ///</summary>
  public DFT_P11_TIMING_QUANTITY(IGroup parent, IModelClassFactory factory) : base(parent, factory){
     try {
        this.add(typeof(TQ1), true, false);
        this.add(typeof(TQ2), false, true);
     } catch(HL7Exception e) {
        HapiLogFactory.getHapiLog(GetType()).error("Unexpected error creating DFT_P11_TIMING_QUANTITY - this is probably a bug in the source code generator.", e);
     }
  }

  ///<summary>
  /// Returns TQ1 (Timing/Quantity) - creates it if necessary
  ///</summary>
  public TQ1 TQ1 { 
get{
     TQ1 ret = null;
     try {
        ret = (TQ1)this.GetStructure("TQ1");
     } catch(HL7Exception e) {
        HapiLogFactory.getHapiLog(GetType()).error("Unexpected error accessing data - this is probably a bug in the source code generator.", e);
        throw new System.Exception("An unexpected error ocurred",e);
     }
     return ret;
  }
  }

  ///<summary>
  /// Returns  first repetition of TQ2 (Timing/Quantity Relationship) - creates it if necessary
  ///</summary>
  public TQ2 GetTQ2() {
     TQ2 ret = null;
     try {
        ret = (TQ2)this.GetStructure("TQ2");
     } catch(HL7Exception e) {
        HapiLogFactory.getHapiLog(GetType()).error("Unexpected error accessing data - this is probably a bug in the source code generator.", e);
        throw new System.Exception("An unexpected error ocurred",e);
     }
     return ret;
  }

  ///<summary>
  ///Returns a specific repetition of TQ2
  /// * (Timing/Quantity Relationship) - creates it if necessary
  /// throws HL7Exception if the repetition requested is more than one 
  ///     greater than the number of existing repetitions.
  ///</summary>
  public TQ2 GetTQ2(int rep) { 
     return (TQ2)this.GetStructure("TQ2", rep);
  }

  /** 
   * Returns the number of existing repetitions of TQ2 
   */ 
  public int TQ2RepetitionsUsed { 
get{
      int reps = -1; 
      try { 
          reps = this.GetAll("TQ2").Length; 
      } catch (HL7Exception e) { 
          string message = "Unexpected error accessing data - this is probably a bug in the source code generator."; 
          HapiLogFactory.getHapiLog(GetType()).error(message, e); 
          throw new System.Exception(message);
      } 
      return reps; 
  }
  } 

}
}
www.java2v.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.