From: <ro...@us...> - 2003-04-15 19:25:27
|
Update of /cvsroot/nsclspectcl/SpecTcl/SpecTcl In directory sc8-pr-cvs1:/tmp/cvs-serv1263 Modified Files: XamineEventHandler.h XamineEventHandler.cpp SpectrumPackage.cpp GatePackage.h GatePackage.cpp GateFactory.h GateFactory.cpp GateCommand.h GateCommand.cpp Log Message: To support real valued parameters, primitive gates must be internally stored as real valued coordinate pairs. Modifications support the input, listing and application information when gate coordinates are floating point. Index: XamineEventHandler.h =================================================================== RCS file: /cvsroot/nsclspectcl/SpecTcl/SpecTcl/XamineEventHandler.h,v retrieving revision 4.2 retrieving revision 4.3 diff -C2 -d -r4.2 -r4.3 *** XamineEventHandler.h 2 Jan 2003 16:19:45 -0000 4.2 --- XamineEventHandler.h 15 Apr 2003 19:25:19 -0000 4.3 *************** *** 1,279 **** - /* - GNU GENERAL PUBLIC LICENSE - Version 2, June 1991 - - Copyright (C) 1989, 1991 Free Software Foundation, Inc. - 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA - Everyone is permitted to copy and distribute verbatim copies - of this license document, but changing it is not allowed. - - Preamble - - The licenses for most software are designed to take away your - freedom to share and change it. By contrast, the GNU General Public - License is intended to guarantee your freedom to share and change free - software--to make sure the software is free for all its users. This - General Public License applies to most of the Free Software - Foundation's software and to any other program whose authors commit to - using it. (Some other Free Software Foundation software is covered by - the GNU Library General Public License instead.) You can apply it to - your programs, too. - - When we speak of free software, we are referring to freedom, not - price. Our General Public Licenses are designed to make sure that you - have the freedom to distribute copies of free software (and charge for - this service if you wish), that you receive source code or can get it - if you want it, that you can change the software or use pieces of it - in new free programs; and that you know you can do these things. - - To protect your rights, we need to make restrictions that forbid - anyone to deny you these rights or to ask you to surrender the rights. - These restrictions translate to certain responsibilities for you if you - distribute copies of the software, or if you modify it. - - For example, if you distribute copies of such a program, whether - gratis or for a fee, you must give the recipients all the rights that - you have. You must make sure that they, too, receive or can get the - source code. And you must show them these terms so they know their - rights. - - We protect your rights with two steps: (1) copyright the software, and - (2) offer you this license which gives you legal permission to copy, - distribute and/or modify the software. - - Also, for each author's protection and ours, we want to make certain - that everyone understands that there is no warranty for this free - software. If the software is modified by someone else and passed on, we - want its recipients to know that what they have is not the original, so - that any problems introduced by others will not reflect on the original - authors' reputations. - - Finally, any free program is threatened constantly by software - patents. We wish to avoid the danger that redistributors of a free - program will individually obtain patent licenses, in effect making the - program proprietary. To prevent this, we have made it clear that any - patent must be licensed for everyone's free use or not licensed at all. - - The precise terms and conditions for copying, distribution and - modification follow. - - GNU GENERAL PUBLIC LICENSE - TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION - - 0. This License applies to any program or other work which contains - a notice placed by the copyright holder saying it may be distributed - under the terms of this General Public License. The "Program", below, - refers to any such program or work, and a "work based on the Program" - means either the Program or any derivative work under copyright law: - that is to say, a work containing the Program or a portion of it, - either verbatim or with modifications and/or translated into another - language. (Hereinafter, translation is included without limitation in - the term "modification".) Each licensee is addressed as "you". - - Activities other than copying, distribution and modification are not - covered by this License; they are outside its scope. The act of - running the Program is not restricted, and the output from the Program - is covered only if its contents constitute a work based on the - Program (independent of having been made by running the Program). - Whether that is true depends on what the Program does. - - 1. You may copy and distribute verbatim copies of the Program's - source code as you receive it, in any medium, provided that you - conspicuously and appropriately publish on each copy an appropriate - copyright notice and disclaimer of warranty; keep intact all the - notices that refer to this License and to the absence of any warranty; - and give any other recipients of the Program a copy of this License - along with the Program. - - You may charge a fee for the physical act of transferring a copy, and - you may at your option offer warranty protection in exchange for a fee. - - 2. You may modify your copy or copies of the Program or any portion - of it, thus forming a work based on the Program, and copy and - distribute such modifications or work under the terms of Section 1 - above, provided that you also meet all of these conditions: - - a) You must cause the modified files to carry prominent notices - stating that you changed the files and the date of any change. - - b) You must cause any work that you distribute or publish, that in - whole or in part contains or is derived from the Program or any - part thereof, to be licensed as a whole at no charge to all third - parties under the terms of this License. - - c) If the modified program normally reads commands interactively - when run, you must cause it, when started running for such - interactive use in the most ordinary way, to print or display an - announcement including an appropriate copyright notice and a - notice that there is no warranty (or else, saying that you provide - a warranty) and that users may redistribute the program under - these conditions, and telling the user how to view a copy of this - License. (Exception: if the Program itself is interactive but - does not normally print such an announcement, your work based on - the Program is not required to print an announcement.) - - These requirements apply to the modified work as a whole. If - identifiable sections of that work are not derived from the Program, - and can be reasonably considered independent and separate works in - themselves, then this License, and its terms, do not apply to those - sections when you distribute them as separate works. But when you - distribute the same sections as part of a whole which is a work based - on the Program, the distribution of the whole must be on the terms of - this License, whose permissions for other licensees extend to the - entire whole, and thus to each and every part regardless of who wrote it. - - Thus, it is not the intent of this section to claim rights or contest - your rights to work written entirely by you; rather, the intent is to - exercise the right to control the distribution of derivative or - collective works based on the Program. - - In addition, mere aggregation of another work not based on the Program - with the Program (or with a work based on the Program) on a volume of - a storage or distribution medium does not bring the other work under - the scope of this License. - - 3. You may copy and distribute the Program (or a work based on it, - under Section 2) in object code or executable form under the terms of - Sections 1 and 2 above provided that you also do one of the following: - - a) Accompany it with the complete corresponding machine-readable - source code, which must be distributed under the terms of Sections - 1 and 2 above on a medium customarily used for software interchange; or, - - b) Accompany it with a written offer, valid for at least three - years, to give any third party, for a charge no more than your - cost of physically performing source distribution, a complete - machine-readable copy of the corresponding source code, to be - distributed under the terms of Sections 1 and 2 above on a medium - customarily used for software interchange; or, - - c) Accompany it with the information you received as to the offer - to distribute corresponding source code. (This alternative is - allowed only for noncommercial distribution and only if you - received the program in object code or executable form with such - an offer, in accord with Subsection b above.) - - The source code for a work means the preferred form of the work for - making modifications to it. For an executable work, complete source - code means all the source code for all modules it contains, plus any - associated interface definition files, plus the scripts used to - control compilation and installation of the executable. However, as a - special exception, the source code distributed need not include - anything that is normally distributed (in either source or binary - form) with the major components (compiler, kernel, and so on) of the - operating system on which the executable runs, unless that component - itself accompanies the executable. - - If distribution of executable or object code is made by offering - access to copy from a designated place, then offering equivalent - access to copy the source code from the same place counts as - distribution of the source code, even though third parties are not - compelled to copy the source along with the object code. - - 4. You may not copy, modify, sublicense, or distribute the Program - except as expressly provided under this License. Any attempt - otherwise to copy, modify, sublicense or distribute the Program is - void, and will automatically terminate your rights under this License. - However, parties who have received copies, or rights, from you under - this License will not have their licenses terminated so long as such - parties remain in full compliance. - - 5. You are not required to accept this License, since you have not - signed it. However, nothing else grants you permission to modify or - distribute the Program or its derivative works. These actions are - prohibited by law if you do not accept this License. Therefore, by - modifying or distributing the Program (or any work based on the - Program), you indicate your acceptance of this License to do so, and - all its terms and conditions for copying, distributing or modifying - the Program or works based on it. - - 6. Each time you redistribute the Program (or any work based on the - Program), the recipient automatically receives a license from the - original licensor to copy, distribute or modify the Program subject to - these terms and conditions. You may not impose any further - restrictions on the recipients' exercise of the rights granted herein. - You are not responsible for enforcing compliance by third parties to - this License. - - 7. If, as a consequence of a court judgment or allegation of patent - infringement or for any other reason (not limited to patent issues), - conditions are imposed on you (whether by court order, agreement or - otherwise) that contradict the conditions of this License, they do not - excuse you from the conditions of this License. If you cannot - distribute so as to satisfy simultaneously your obligations under this - License and any other pertinent obligations, then as a consequence you - may not distribute the Program at all. For example, if a patent - license would not permit royalty-free redistribution of the Program by - all those who receive copies directly or indirectly through you, then - the only way you could satisfy both it and this License would be to - refrain entirely from distribution of the Program. - - If any portion of this section is held invalid or unenforceable under - any particular circumstance, the balance of the section is intended to - apply and the section as a whole is intended to apply in other - circumstances. - - It is not the purpose of this section to induce you to infringe any - patents or other property right claims or to contest validity of any - such claims; this section has the sole purpose of protecting the - integrity of the free software distribution system, which is - implemented by public license practices. Many people have made - generous contributions to the wide range of software distributed - through that system in reliance on consistent application of that - system; it is up to the author/donor to decide if he or she is willing - to distribute software through any other system and a licensee cannot - impose that choice. - - This section is intended to make thoroughly clear what is believed to - be a consequence of the rest of this License. - - 8. If the distribution and/or use of the Program is restricted in - certain countries either by patents or by copyrighted interfaces, the - original copyright holder who places the Program under this License - may add an explicit geographical distribution limitation excluding - those countries, so that distribution is permitted only in or among - countries not thus excluded. In such case, this License incorporates - the limitation as if written in the body of this License. - - 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. - - Each version is given a distinguishing version number. If the Program - specifies a version number of this License which applies to it and "any - later version", you have the option of following the terms and conditions - either of that version or of any later version published by the Free Software - Foundation. If the Program does not specify a version number of this License, - you may choose any version ever published by the Free Software Foundation. - - 10. If you wish to incorporate parts of the Program into other free - programs whose distribution conditions are different, write to the author to - ask for permission. For software which is copyrighted by the Free Software - Foundation, write to the Free Software Foundation; we sometimes make - exceptions for this. Our decision will be guided by the two goals of - preserving the free status of all derivatives of our free software and of - promoting the sharing and reuse of software generally. - - NO WARRANTY - - 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR - THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN - OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE - THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, - INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND - FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND - PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, - YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. - - 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING - WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR - REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, - INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING - OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO - LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR - THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), - EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH - DAMAGES. - - END OF TERMS AND CONDITIONS - */ --- 1,2 ---- *************** *** 326,330 **** CHistogrammer* m_pHistogrammer; //1:1 association object data member int m_nFd; ! Tcl_Channel m_SocketChannel; // Channel open on the gates socket. public: --- 49,53 ---- CHistogrammer* m_pHistogrammer; //1:1 association object data member int m_nFd; ! Tcl_TimerToken m_Timer; // Poll timer for read. public: *************** *** 336,343 **** m_pInterp(pInterp), m_pHistogrammer(pHistogrammer), ! m_nFd(pHistogrammer->getDisplayer()->GetEventFd()), ! m_SocketChannel(Tcl_MakeTcpClientChannel((ClientData)(long)m_nFd)) { ! Set(TK_READABLE); // Starts out enabled. } virtual ~ CXamineEventHandler ( ) // Destructor --- 59,65 ---- m_pInterp(pInterp), m_pHistogrammer(pHistogrammer), ! m_nFd(pHistogrammer->getDisplayer()->GetEventFd()) { ! Set(); // Starts out enabled. } virtual ~ CXamineEventHandler ( ) // Destructor *************** *** 350,354 **** m_pHistogrammer(rhs.m_pHistogrammer), m_nFd(rhs.m_nFd), ! m_SocketChannel(rhs.m_SocketChannel) { --- 72,76 ---- m_pHistogrammer(rhs.m_pHistogrammer), m_nFd(rhs.m_nFd), ! m_Timer(rhs.m_Timer) { *************** *** 373,377 **** (m_pHistogrammer == rhs.m_pHistogrammer) && (m_nFd == rhs.m_nFd) && ! (m_SocketChannel == rhs.m_SocketChannel)); } --- 95,99 ---- (m_pHistogrammer == rhs.m_pHistogrammer) && (m_nFd == rhs.m_nFd) && ! (m_Timer == rhs.m_Timer)); } *************** *** 394,404 **** m_pHistogrammer = m_pHistogrammer; m_nFd = (m_pHistogrammer->getDisplayer()->GetEventFd()); // Update file id. ! Set(TK_READABLE); // Set callback on next fid. } public: ! virtual void operator() (int mask) ; ! virtual void Set(int mask); virtual void Clear(); --- 116,126 ---- m_pHistogrammer = m_pHistogrammer; m_nFd = (m_pHistogrammer->getDisplayer()->GetEventFd()); // Update file id. ! Set(); // Set callback on next fid. } public: ! virtual void operator() () ; ! virtual void Set(); virtual void Clear(); *************** *** 408,412 **** virtual UInt_t FindDisplayBinding (const std::string& rName); ! static void CallbackRelay(ClientData pObject, int mask); }; --- 130,134 ---- virtual UInt_t FindDisplayBinding (const std::string& rName); ! static void CallbackRelay(ClientData pObject); }; Index: XamineEventHandler.cpp =================================================================== RCS file: /cvsroot/nsclspectcl/SpecTcl/SpecTcl/XamineEventHandler.cpp,v retrieving revision 4.5 retrieving revision 4.6 diff -C2 -d -r4.5 -r4.6 *** XamineEventHandler.cpp 4 Apr 2003 17:39:08 -0000 4.5 --- XamineEventHandler.cpp 15 Apr 2003 19:25:20 -0000 4.6 *************** *** 303,306 **** --- 303,308 ---- #include <XamineEvent.h> + #include <Gamma2DW.h> + #include <vector> #include <string> *************** *** 327,331 **** // Operation Type: // Evaluation operator. ! void CXamineEventHandler::operator()(int mask) { // Called when Xamine's gate fd is readable. --- 329,333 ---- // Operation Type: // Evaluation operator. ! void CXamineEventHandler::operator()() { // Called when Xamine's gate fd is readable. *************** *** 336,343 **** // is called. // - // Formal Parameters: - // int mask: - // Mask indicating what sort of Fd event - // triggered this handler. // --- 338,341 ---- *************** *** 347,351 **** CXamineEvent Event; ! if(pDisplay->PollEvent(0, Event)) { // Determine what kind of beast we got: --- 345,350 ---- CXamineEvent Event; ! int pollstat = pDisplay->PollEvent(0, Event); ! if(pollstat > 0) { // Successful poll => something read. // Determine what kind of beast we got: *************** *** 380,388 **** } catch(...) { } // Some spectra will not be bound. ! } ! cerr << "\n Restarting Xamine..."; - Tcl_Close(m_pInterp->getInterpreter(), m_SocketChannel); pDisplay->Restart(); --- 379,385 ---- } catch(...) { } // Some spectra will not be bound. ! } cerr << "\n Restarting Xamine..."; pDisplay->Restart(); *************** *** 391,400 **** cerr << "\n Reconnecting with Xamine gate inputs.."; m_nFd = m_pHistogrammer->getDisplayer()->GetEventFd(); - m_SocketChannel = Tcl_MakeTcpClientChannel((ClientData)(long)m_nFd); - Set(TK_READABLE); cerr << "\n"; } - } } --- 388,395 ---- cerr << "\n Reconnecting with Xamine gate inputs.."; m_nFd = m_pHistogrammer->getDisplayer()->GetEventFd(); cerr << "\n"; } } + Set(); // Re-schedule self. } *************** *** 420,425 **** // - #ifdef __WITH_MAPPED_SPECTRA - BUGBUGBUGBUG CGateFactory Factory(m_pHistogrammer);; // We'll use this to create the --- 415,418 ---- *************** *** 442,468 **** vector<CPoint> GatePoints; CGateFactory::GateType gType; ! ! GatePoints.insert(GatePoints.begin(), ! rXamineGate.begin(), ! rXamineGate.end()); switch(rXamineGate.getGateType()) { case kgCut1d: ! if((spType == ke1D) || (spType == keM1D)) gType = CGateFactory::cut; ! else if((spType == keG1D) || (spType == keMG1D)) gType = CGateFactory::gammacut; else { ! cerr << "Unknown gate type received from Xamine... better update SpecTcl" << endl; return; } break; case kgContour2d: ! if((spType == ke2D) || (spType == keM2D)) gType = CGateFactory::contour; ! else if((spType == keG2D) || (spType == keMG2D)) gType = CGateFactory::gammacontour; else { ! cerr << "Unknown gate type received from Xamine... better update SpecTcl" << endl; return; --- 435,467 ---- vector<CPoint> GatePoints; + vector<FPoint> ScaledPoints; CGateFactory::GateType gType; ! GatePoints.insert(GatePoints.begin(), // These are the unmapped gate points. ! rXamineGate.begin(), // Later we need to map them to ! rXamineGate.end()); // Parameter coordinates. switch(rXamineGate.getGateType()) { + case kgCut1d: ! if((spType == ke1D)) // Ordinary 1d spectrum -> ordinary cut. ! gType = CGateFactory::cut; ! else if((spType == keG1D)) // Gamma spectrum -> Gamma cut. gType = CGateFactory::gammacut; else { ! cerr << "Cut gate received on a spectrum type that doesn't know about" ! << " cut gates.\n Consider updating SpecTcl??" << endl; return; } break; + case kgContour2d: ! if((spType == ke2D)) ! gType = CGateFactory::contour; ! else if((spType == keG2D)) gType = CGateFactory::gammacontour; else { ! cerr << "Contour gate received on a spectrum type that doesn't know" ! << " about contours.\n Consider updating SpecTcl?" << endl; return; *************** *** 470,478 **** break; case kgBand2d: ! if((spType == ke2D) || (spType == keM2D)) gType = CGateFactory::band; ! else if((spType == keG2D) || (spType == keMG2D)) gType = CGateFactory::gammaband; else { ! cerr << "Unknown gate type received from Xamine... better update SpecTcl" << endl; return; --- 469,479 ---- break; case kgBand2d: ! if((spType == ke2D)) // Ordinary 2d -> Band. ! gType = CGateFactory::band; ! else if((spType == keG2D)) // Gamma spectrum -> Gamm aband. gType = CGateFactory::gammaband; else { ! cerr << "Band received on a spectrum that type that doesn't know how" ! << " to handle it.\n Consider updating Spectcl." << endl; return; *************** *** 490,494 **** switch(spType) { case ke1D: // 1-d spectrum must be a cut.. - case keM1D: if(gType != CGateFactory::cut) { cerr << "Only cuts can be accepted on 1-d spectra\n"; --- 491,494 ---- *************** *** 497,501 **** break; case keG1D: // 1-d gamma spectrum must be a gamma cut... - case keMG1D: if((gType != CGateFactory::gammacut) && (gType != CGateFactory::cut)) { --- 497,500 ---- *************** *** 505,509 **** break; case ke2D: // 2-d spectrum must be a band or contour.. - case keM2D: if( (gType != CGateFactory::band) && (gType != CGateFactory::contour)) { --- 504,507 ---- *************** *** 514,518 **** break; case keG2D: // 2-d gamma spectrum must be a gammaband or gammacontour.. - case keMG2D: if((gType != CGateFactory::band) && (gType != CGateFactory::contour) && --- 512,515 ---- *************** *** 528,593 **** return; } ! // The points are in spectrum coordinates, so we need to reverse the ! // scale factor which is applied to each parameter. How this is done ! // depends on the gate type a bit too. ! // Note that doing things the way we do makes stuff work even for ! // 1-d cut points for which the y axis is irrelevant. ! // switch(spType) { case ke1D: case ke2D: case keG1D: - case keG2D: - { - Int_t xscale = 0; - Int_t yscale = 0; - if(pSpec->Dimensionality() > 0) xscale = -pSpec->getScale(0); // Inverse - if(pSpec->Dimensionality() > 1) yscale = -pSpec->getScale(1); // scale.. - vector<CPoint>::iterator p = GatePoints.begin(); - for(; p != GatePoints.end(); p++) { - *p = CPoint(scale((*p).X(), xscale), - scale((*p).Y(), yscale)); - } - break; - } - case keM1D: - { - CMSpectrum1DL* pS = (CMSpectrum1DL*)pSpec; - vector<CPoint>::iterator p = GatePoints.begin(); - for(; p != GatePoints.end(); p++) { - *p = CPoint(pS->SpecToParamPoint((*p).X()), (*p).Y()); - } - break; - } - case keMG1D: - { - CMGamma1DL* pS = (CMGamma1DL*)pSpec; - vector<CPoint>::iterator p = GatePoints.begin(); - for(; p != GatePoints.end(); p++) { - *p = CPoint(pS->SpecPointToGate((*p).X()), - pS->SpecPointToGate((*p).Y())); - } - break; - } - case keM2D: - { - CMSpectrum2DB* pS = (CMSpectrum2DB*)pSpec; - vector<CPoint>::iterator p = GatePoints.begin(); - for(; p != GatePoints.end(); p++) { - *p = CPoint(pS->SpecToXParamPoint((*p).X()), - pS->SpecToYParamPoint((*p).Y())); - } - break; - } - case keMG2D: { ! CMGamma2DW* pS = (CMGamma2DW*)pSpec; vector<CPoint>::iterator p = GatePoints.begin(); for(; p != GatePoints.end(); p++) { ! *p = CPoint(pS->SpecPointToGate((*p).X(), 0), ! pS->SpecPointToGate((*p).Y(), 1)); } break; } default: cerr << "Gates must only be accepted on simple 1-d or 2-d spectra\n"; --- 525,560 ---- return; } ! // Points are in spectrum coordinates (axis coordinates). They must be ! // transformed back into parameter coordinates. ! ! UInt_t yIndex = 1; // For typcial 2d, this index into the ! switch(spType) { + case keG2D: // For a gamma all x transforms are first. + { + CGamma2DW* pGSpectrum = (CGamma2DW*)pSpec; + yIndex = pGSpectrum->getnParams(); + } case ke1D: case ke2D: case keG1D: { ! ! Float_t x,y(0.0); ! ! ! vector<CPoint>::iterator p = GatePoints.begin(); for(; p != GatePoints.end(); p++) { ! CPoint& rp(*p); ! x = pSpec->AxisToParameter(0, rp.X()); ! if(pSpec->Dimensionality() > 1) ! y = pSpec->AxisToParameter(yIndex, rp.Y()); ! ScaledPoints.push_back(FPoint(x,y)); ! } break; } + default: cerr << "Gates must only be accepted on simple 1-d or 2-d spectra\n"; *************** *** 609,614 **** case ke1D: case ke2D: - case keM1D: - case keM2D: for(pid = pIds.begin(); pid != pIds.end(); pid++) { CParameter* pParam = m_pHistogrammer->FindParameter(*pid); --- 576,579 ---- *************** *** 621,632 **** // Use the gate factory creation mechanism to produce a dynamically // allocated SpecTcl gate: ! pSpecTclGate = Factory.CreateGate(gType, Parameters, GatePoints); break; case keG1D: case keG2D: - case keMG1D: - case keMG2D: Names.push_back(strSpecName); ! pSpecTclGate = Factory.CreateGate(gType, GatePoints, Names); break; default: --- 586,595 ---- // Use the gate factory creation mechanism to produce a dynamically // allocated SpecTcl gate: ! pSpecTclGate = Factory.CreateGate(gType, Parameters, ScaledPoints); break; case keG1D: case keG2D: Names.push_back(strSpecName); ! pSpecTclGate = Factory.CreateGate(gType, ScaledPoints, Names); break; default: *************** *** 655,659 **** } delete pSpecTclGate; ! #endif } --- 618,622 ---- } delete pSpecTclGate; ! } *************** *** 723,735 **** // // Functional Description: ! // void Set(int mask) // Registers the CallbackRelay static member as a socket callback ! // handler as per the mask. // void ! CXamineEventHandler::Set(int mask) { ! Tcl_CreateChannelHandler(m_SocketChannel, mask, ! CallbackRelay, this); } // --- 686,699 ---- // // Functional Description: ! // void Set() // Registers the CallbackRelay static member as a socket callback ! // handler as per the mask. There are problems now with cygwin's TCL ! // fd notification on sockets,so we'll use a timer <sigh> // void ! CXamineEventHandler::Set() { ! m_Timer = Tcl_CreateTimerHandler(500, CallbackRelay, (ClientData)this); ! } // *************** *** 741,745 **** CXamineEventHandler::Clear() { ! Tcl_DeleteChannelHandler(m_SocketChannel, CallbackRelay, this); } // --- 705,709 ---- CXamineEventHandler::Clear() { ! Tcl_DeleteTimerHandler(m_Timer); } // *************** *** 751,758 **** // void ! CXamineEventHandler::CallbackRelay(ClientData pObject, int mask) { CXamineEventHandler* pThis = (CXamineEventHandler*)pObject; ! pThis->operator()(mask); } --- 715,722 ---- // void ! CXamineEventHandler::CallbackRelay(ClientData pObject) { CXamineEventHandler* pThis = (CXamineEventHandler*)pObject; ! pThis->operator()(); } Index: SpectrumPackage.cpp =================================================================== RCS file: /cvsroot/nsclspectcl/SpecTcl/SpecTcl/SpectrumPackage.cpp,v retrieving revision 4.4 retrieving revision 4.5 diff -C2 -d -r4.4 -r4.5 *** SpectrumPackage.cpp 1 Apr 2003 19:55:40 -0000 4.4 --- SpectrumPackage.cpp 15 Apr 2003 19:25:20 -0000 4.5 *************** *** 296,299 **** --- 296,302 ---- // // $Log$ + // Revision 4.5 2003/04/15 19:25:20 ron-fox + // To support real valued parameters, primitive gates must be internally stored as real valued coordinate pairs. Modifications support the input, listing and application information when gate coordinates are floating point. + // // Revision 4.4 2003/04/01 19:55:40 ron-fox // Support for Real valued parameters and spectra with arbitrary binnings. *************** *** 1669,1672 **** --- 1672,1676 ---- m_pHistogrammer->getParameterDictionary()); CSpectrum* pSpectrum(0); + CSpectrum* pOld(0); // Will hold old spectrum. // First thing to try to do is to get the spectrum formatter to read the *************** *** 1693,1697 **** catch (...) { } ! CSpectrum* pOld = m_pHistogrammer->RemoveSpectrum(pSpectrum->getName()); if(pOld) delete pOld; } --- 1697,1701 ---- catch (...) { } ! pOld = m_pHistogrammer->RemoveSpectrum(pSpectrum->getName()); if(pOld) delete pOld; } *************** *** 1706,1709 **** --- 1710,1723 ---- // m_pHistogrammer->AddSpectrum(*pSpectrum); + if((fFlags & fReplace) != 0) { + if(pOld) { // If there's an old spectrum, transfer it's + // gate. + CGateContainer* pGate = (CGateContainer*)pOld->getGate(); + if(pGate) { + pSpectrum->ApplyGate(pGate); + } + } + delete pOld; + } if(fFlags & fBind) { // Bind it if requested. Index: GatePackage.h =================================================================== RCS file: /cvsroot/nsclspectcl/SpecTcl/SpecTcl/GatePackage.h,v retrieving revision 4.1 retrieving revision 4.2 diff -C2 -d -r4.1 -r4.2 *** GatePackage.h 2 Jan 2003 16:19:45 -0000 4.1 --- GatePackage.h 15 Apr 2003 19:25:20 -0000 4.2 *************** *** 276,287 **** END OF TERMS AND CONDITIONS */ ! // Class: CGatePackage //ANSI C++ ! // ! // Encapsulates a package of commands which ! // manipulates gates. This class also provides ! // services which bridge between the Tcl ! // scripting language and the underlying ! // representation of gates etc. ! // // // Author: --- 276,288 ---- END OF TERMS AND CONDITIONS */ ! /* ! Change Log: ! $Log$ ! Revision 4.2 2003/04/15 19:25:20 ron-fox ! To support real valued parameters, primitive gates must be internally stored as real valued coordinate pairs. Modifications support the input, listing and application information when gate coordinates are floating point. ! ! */ ! ! // // Author: *************** *** 349,360 **** //Required for 1:1 association classes class CGatePackage : public CTCLCommandPackage { ! CHistogrammer* m_pHistogrammer; // Pointer to SpecTcl Histogrammer CGateCommand* m_pGateCommand; // 1:1 association object data member CApplyCommand* m_pApplyCommand; // 1:1 association object data member CUngateCommand* m_pUngateCommand; // 1:1 association object data member ! static UInt_t m_nNextId; // Next Gate Id. public: --- 350,369 ---- //Required for 1:1 association classes + /*! + + Encapsulates a package of commands which + manipulates gates. This class also provides + services which bridge between the Tcl + scripting language and the underlying + representation of gates etc. + */ class CGatePackage : public CTCLCommandPackage { ! CHistogrammer* m_pHistogrammer; //!< Pointer to SpecTcl Histogrammer CGateCommand* m_pGateCommand; // 1:1 association object data member CApplyCommand* m_pApplyCommand; // 1:1 association object data member CUngateCommand* m_pUngateCommand; // 1:1 association object data member ! static UInt_t m_nNextId; //!< Next Gate Id. public: *************** *** 443,462 **** public: ! Bool_t AddGate (CTCLResult& rResult, const std::string& rGateName, ! const CGate* pGate) ; ! CTCLString ListGates () ; ! CTCLString ListGatesById () ; Bool_t DeleteGates (CTCLResult& rResult, ! const vector<string>& rGateNames) ; ! Bool_t DeleteGates (CTCLResult& rResult, const vector<UInt_t>& rIds) ; Bool_t ApplyGate (CTCLString& rResult, const string& rGateName, ! const string& rSpectrumName) ; ! Bool_t ListAppliedGate (CTCLString& rApplication, const string& rName) ; Bool_t Ungate(CTCLString& rResult, const string & rName); ! std::string GateToString (CGateContainer* pGate) ; static UInt_t AssignId(); protected: ! static void SortGateListById (vector<CGateContainer*>& rpGates) ; private: --- 452,474 ---- public: ! Bool_t AddGate (CTCLResult& rResult, ! const std::string& rGateName, ! const CGate* pGate); ! CTCLString ListGates(); ! CTCLString ListGatesById(); Bool_t DeleteGates (CTCLResult& rResult, ! const vector<string>& rGateNames); ! Bool_t DeleteGates (CTCLResult& rResult, ! const vector<UInt_t>& rIds) ; Bool_t ApplyGate (CTCLString& rResult, const string& rGateName, ! const string& rSpectrumName); ! Bool_t ListAppliedGate (CTCLString& rApplication, ! const string& rName) ; Bool_t Ungate(CTCLString& rResult, const string & rName); ! std::string GateToString (CGateContainer* pGate); static UInt_t AssignId(); protected: ! static void SortGateListById (vector<CGateContainer*>& rpGates); private: Index: GatePackage.cpp =================================================================== RCS file: /cvsroot/nsclspectcl/SpecTcl/SpecTcl/GatePackage.cpp,v retrieving revision 4.2 retrieving revision 4.3 diff -C2 -d -r4.2 -r4.3 *** GatePackage.cpp 2 Jan 2003 16:19:44 -0000 4.2 --- GatePackage.cpp 15 Apr 2003 19:25:21 -0000 4.3 *************** *** 295,298 **** --- 295,306 ---- // //////////////////////////.cpp file///////////////////////////////////////////////////// + /* + Change Log: + $Log$ + Revision 4.3 2003/04/15 19:25:21 ron-fox + To support real valued parameters, primitive gates must be internally stored as real valued coordinate pairs. Modifications support the input, listing and application information when gate coordinates are floating point. + + */ + #include "GatePackage.h" #include "GateCommand.h" *************** *** 424,450 **** // Operation Type: Selector. // CTCLString CGatePackage::ListGates() { ! // Returns a TCL formatted list which contains ! // the gate definitions sorted by alphabetical ! // order. ! // Each gate definition is a sublist containing the following elements: ! // Gate name. ! // Gate Id ! // Gate Type ! // Gate contents which is a list that is gate type dependent: ! // Cut: { parameter { low hi }} ! // Band, ! // Contour { {xparam yparam} { {x1 y1} {x2 y2} ... } ! // GammaCut { low hi {speclist}} ! // GammaBand { {x1 y1} {x2 y2} ... {speclist}} ! // GammaContour { {x1 y1} {x2 y2}...{speclist}} ! // Not { Gatename} ! // And, ! // Or { Gate1 Gate2 ... } ! // True, ! // False, ! // Deleted {} ! // CTCLString Gates; CGateDictionaryIterator gi = m_pHistogrammer->GateBegin(); --- 432,464 ---- // Operation Type: Selector. // + + /*! + \para Functionality + Returns a TCL formatted list which contains + the gate definitions sorted by alphabetical + order. + + Each gate definition is a sublist containing the following elements: + # Gate name. + # Gate Id + # Gate Type + # Gate contents which is a list that is gate type dependent: + - Cut: { parameter { low hi }} + - Band, + - Contour { {xparam yparam} { {x1 y1} {x2 y2} ... } + - GammaCut { low hi {speclist}} + - GammaBand { {x1 y1} {x2 y2} ... {speclist}} + - GammaContour { {x1 y1} {x2 y2}...{speclist}} + - Not { Gatename} + - And, + - Or { Gate1 Gate2 ... } + - True, + - False, + - Deleted {} + + */ CTCLString CGatePackage::ListGates() { ! CTCLString Gates; CGateDictionaryIterator gi = m_pHistogrammer->GateBegin(); *************** *** 498,524 **** // Operation Type: Mutator // Bool_t CGatePackage::DeleteGates(CTCLResult& rResult, const vector<string>& rGateNames) { ! // Deletes gates given a set of gate names. ! // ! // The result string has either nothing appended ! // to it (all the gates were deleted) or alternatively ! // a list of failure lists as follows: ! // ! // {gate_name failure_reason} ... ! // ! // Formal Parameters: ! // CTCLResult& rResult: ! /// The result string as described above. ! // const vector<string>& rNames: ! // Set of names of gates to delete. ! // Returns: ! // kfTRUE - All gates deleted. ! // kfFALSE - Some gates could not be deleted. ! // NOTE: ! // The deleted gates are actually replaced by a ! // CFalseGate. CTCLString ResultString; --- 512,543 ---- // Operation Type: Mutator // + /*! + \para Functionality: + Deletes gates given a set of gate names. + + The result string has either nothing appended + to it (all the gates were deleted) or alternatively + a list of failure lists as follows: + <BR> + {gate_name failure_reason} ...<BR> + + \para Formal Parameters: + \param <TT>rResult (CTCLResult& [out]):</TT> + The result string as described above. + \param <TT>rNames (const vector<string>& [in]):</TT> + Set of names of gates to delete. + \para Returns: + \retval Bool_t + - kfTRUE - All gates deleted. + - kfFALSE - Some gates could not be deleted. + \note <CENTER><B>NOTE:</B></CENTER> + The deleted gates are actually replaced by a + CFalseGate. + */ Bool_t CGatePackage::DeleteGates(CTCLResult& rResult, const vector<string>& rGateNames) { ! CTCLString ResultString; *************** *** 733,751 **** // Operation Type: Utility // std::string CGatePackage::GateToString(CGateContainer* pGate) { ! // Converts a gate to its string ! // representation. ! // ! // Formal Parameters: ! // CGateContainer* pGate: ! // Pointer to the container of the ! // gate to convert. ! // ! // Returns: ! // std::string: ! // String representation of the gate as defined ! // in the definition of ListGates() ! // CTCLString Result; char Id[100]; --- 752,775 ---- // Operation Type: Utility // + + /*! + \para Functionality: + Converts a gate to its string + representation. + + \para Formal Parameters: + \param <TT>pGate ( pGateCGateContainer* [in]):</TT> + Pointer to the container of the + gate to convert. + + \para Returns: + \retval std::string: + String representation of the gate as defined + in the definition of ListGates() + + */ std::string CGatePackage::GateToString(CGateContainer* pGate) { ! CTCLString Result; char Id[100]; *************** *** 840,847 **** CConstituentIterator rIter = rGate->Begin(); string GateInfo = rGate->GetConstituent(rIter); ! UInt_t id, low, hi; // because constituents have 'too much data'. char param[100]; ! sscanf(GateInfo.c_str(), "%d %d %d", &id, &low, &hi); ! sprintf(param,"%d %d", low, hi); Result.AppendElement(param); } --- 864,872 ---- CConstituentIterator rIter = rGate->Begin(); string GateInfo = rGate->GetConstituent(rIter); ! UInt_t id; ! Float_t low, hi; // because constituents have 'too much data'. char param[100]; ! sscanf(GateInfo.c_str(), "%d %f %f", &id, &low, &hi); ! sprintf(param,"%f %f", low, hi); Result.AppendElement(param); } Index: GateFactory.h =================================================================== RCS file: /cvsroot/nsclspectcl/SpecTcl/SpecTcl/GateFactory.h,v retrieving revision 4.1 retrieving revision 4.2 diff -C2 -d -r4.1 -r4.2 *** GateFactory.h 2 Jan 2003 16:19:45 -0000 4.1 --- GateFactory.h 15 Apr 2003 19:25:21 -0000 4.2 *************** *** 298,301 **** --- 298,309 ---- // + /* + Change Log: + $Log$ + Revision 4.2 2003/04/15 19:25:21 ron-fox + To support real valued parameters, primitive gates must be internally stored as real valued coordinate pairs. Modifications support the input, listing and application information when gate coordinates are floating point. + + */ + #ifndef __GATEFACTORY_H //Required for current class #define __GATEFACTORY_H *************** *** 350,375 **** // The GateFactory Class: // class CGateFactory { ! CHistogrammer* m_pHistogrammer; //Ptr to histogrammer. public: ! // Data types... in this case the enum for the type sof gates which ! // can be created: enum GateType { ! And, // And of multiple gates. ! band, // 2-d band. ! bandcontour, // Contour from band pair. ! contour, // contour ! cut, // Cut on 1-d spectrum. ! deleted, // Deleted gate placeholder. ! falseg, // Always false gate. ! Not, // Inverse of contained gate. ! Or, // OR of multiple gates. ! trueg, // Alwayw made gate. ! gammacut, // Gamma cut ! gammaband, // Gamma band ! gammacontour // Gamma contour }; --- 358,389 ---- // The GateFactory Class: // + /*! + Gate factories well, they produce gates. Given a generic + description of a gate the factory produces an instance of the + specific type of gate being described. All the real work is done + by the three overloaded CreateGate functions. + */ class CGateFactory { ! CHistogrammer* m_pHistogrammer; //!< Ptr to histogrammer. public: ! // Data types... + //! enum for the type sof gates which can be created: enum GateType { ! And, //!< And of multiple gates. ! band, //!< 2-d band. ! bandcontour, //!< Contour from band pair. ! contour, //!< contour ! cut, //!< Cut on 1-d spectrum. ! deleted, //!< Deleted gate placeholder. ! falseg, //!< Always false gate. ! Not, //!< Inverse of contained gate. ! Or, //!< OR of multiple gates. ! trueg, //!< Alwayw made gate. ! gammacut, //!< Gamma cut ! gammaband, //!< Gamma band ! gammacontour //!< Gamma contour }; *************** *** 385,394 **** - //Copy constructor alternative to compiler provided default copy constructor - //Copy alternatives for association objects: - // (1) initialize association object to nullAssociation Object - // (2) Shallow copy to copy pointers of association objects - // (3) Deep copy to create new association objects - // and copy values of association objects CGateFactory (const CGateFactory& aCGateFactory ) --- 399,402 ---- *************** *** 427,434 **** public: ! CGate* CreateGate (GateType nGateType, const vector<string>& rGates); ! CGate* CreateGate (GateType eType, const vector<string>& rParameters, ! const vector<CPoint>& rPoints); ! CGate* CreateGate (GateType eType, const vector<CPoint>& rPoints, const vector<string>& Ids); --- 435,445 ---- public: ! CGate* CreateGate (GateType nGateType, ! const vector<string>& rGates); ! CGate* CreateGate (GateType eType, ! const vector<string>& rParameters, ! const vector<FPoint>& rPoints); ! CGate* CreateGate (GateType eType, ! const vector<FPoint>& rPoints, const vector<string>& Ids); *************** *** 437,443 **** CDeletedGate* CreateDeletedGate (); CBand* CreateBand (const vector<string>& rParameters, ! const vector<CPoint>& rPoints); CContour* CreateContour (const vector<string>& rParameters, ! const vector<CPoint>& rPoints); C2Bands* CreateBandContour (const vector<string>& rBands); CNot* CreateNotGate (const string& rGateNames); --- 448,454 ---- CDeletedGate* CreateDeletedGate (); CBand* CreateBand (const vector<string>& rParameters, ! const vector<FPoint>& rPoints); CContour* CreateContour (const vector<string>& rParameters, ! const vector<FPoint>& rPoints); C2Bands* CreateBandContour (const vector<string>& rBands); CNot* CreateNotGate (const string& rGateNames); *************** *** 445,454 **** COrGate* CreateOrGate (const vector<string>& rGateNames) ; CCut* CreateCut (const string& rParameterName, ! UInt_t nLow, UInt_t nHigh); ! CGammaCut* CreateGammaCut (UInt_t nLow, UInt_t nHigh, const vector<string>& Specs); ! CGammaBand* CreateGammaBand (const vector<CPoint>& rPoints, const vector<string>& Specs); ! CGammaContour* CreateGammaContour (const vector<CPoint>& rPoints, const vector<string>& Specs); --- 456,465 ---- COrGate* CreateOrGate (const vector<string>& rGateNames) ; CCut* CreateCut (const string& rParameterName, ! Float_t nLow, Float_t nHigh); ! CGammaCut* CreateGammaCut (Float_t nLow, Float_t nHigh, const vector<string>& Specs); ! CGammaBand* CreateGammaBand (const vector<FPoint>& rPoints, const vector<string>& Specs); ! CGammaContour* CreateGammaContour (const vector<FPoint>& rPoints, const vector<string>& Specs); Index: GateFactory.cpp =================================================================== RCS file: /cvsroot/nsclspectcl/SpecTcl/SpecTcl/GateFactory.cpp,v retrieving revision 4.2 retrieving revision 4.3 diff -C2 -d -r4.2 -r4.3 *** GateFactory.cpp 2 Jan 2003 16:19:44 -0000 4.2 --- GateFactory.cpp 15 Apr 2003 19:25:21 -0000 4.3 *************** *** 296,299 **** --- 296,308 ---- // //////////////////////////.cpp file///////////////////////////////////////////////////// + + /* + Change log: + $Log$ + Revision 4.3 2003/04/15 19:25:21 ron-fox + To support real valued parameters, primitive gates must be internally stored as real valued coordinate pairs. Modifications support the input, listing and application information when gate coordinates are floating point. + + */ + #include "GateFactory.h" #include "GateFactoryException.h" *************** *** 328,335 **** // Functions for class CGateFactory ! static inline int max(int i, int j) { return (i > j ) ? i : j; } ! static inline int min(int i, int j) { return (i < j) ? i : j ; } --- 337,344 ---- // Functions for class CGateFactory ! static inline Float_t max(Float_t i, Float_t j) { return (i > j ) ? i : j; } ! static inline Float_t min(Float_t i, Float_t j) { return (i < j) ? i : j ; } *************** *** 339,359 **** // const vector<string>& rGates) // Operation Type: Creational CGate* CGateFactory::CreateGate(GateType nGateType, const vector<string>& rGates) { ! // Creates a gate given the input data. This can create ! // gates which are primitive gates without point arrays ! // and compound gates. ! // ! // Formal Parameters: ! // CGateFactory::GateType nGateType: ! // This must be one of: ! // {bandcountour, not, and, or, true, false, deleted} ! // std::vector<std::string>& Gates: ! // List of gates which are used to generate the final gate. ! // Returns: ! // Pointer to dynamically generated gate. It is up to the ! // caller to delete the gate when done with it. switch(nGateType) { --- 348,387 ---- // const vector<string>& rGates) // Operation Type: Creational + + /*! + + \para Functionality: + Creates a gate given the input data. This can create + gates which are primitive gates without point arrays + and compound gates. + + \para Formal Parameters: + \param <TT>GateType (CGateFactory [in])</TT> + This must be one of: + - bandcountour Contour formed from two bands. + - not Inverse of a gate. + - and And of a list of gates. + - or Or of a list of gates. + - true Always true + - false Always false + - deleted Gate that has been deleted. + \param Gates (std::vector<std::string>& [in]): + List of gates which are used to generate the final gate. + + \para Returns: + \retval CGate* + Pointer to dynamically generated gate. It is up to the + caller to delete the gate when done with it. + + \para Exceptions: + \throw CGateFactoryException + If there was a problem createing a gate, an exception is thrown indicating + the type of gate being created and why the exception was thrown. + */ CGate* CGateFactory::CreateGate(GateType nGateType, const vector<string>& rGates) { ! switch(nGateType) { *************** *** 403,428 **** // Function: CreateGate(GateType eType, // const vector<string>& rParameters, ! // const vector<CPoint>& rPoints) // Operation Type: Creational CGate* CGateFactory::CreateGate(GateType eType, const vector<string>& rParameters, ! const vector<CPoint>& rPoints) { ! // Creates a gate from a list of points. ! // ! // Formal Parameters: ! // CGateFactory::GateType: ! // Type of gate being created. ! // Should be one of: ! // { cut, contour, band} ! // vector<string>& rParameters: ! // Set of parameters involved in the gate. ! // vector<CPoint>& rPoints: ! // A set of points involved in the gate. ! // Returns: ! // Pointer to a created gate or throws a CGateFactoryException if the ! // gate could not be made. ! // switch(eType) { --- 431,469 ---- // Function: CreateGate(GateType eType, // const vector<string>& rParameters, ! // const vector<FPoint>& rPoints) // Operation Type: Creational + /*! + \para Functionality: + Creates a gate from a list of points. + + \para Formal Parameters: + \param <TT> GateType (CGateFactory [in])</TT> + Type of gate being created. + Should be one of: + - cut Upper lower limit cut (slice). + - contour Interior of closed polygon. + - band Below a polyline. + \param rParameters (vector<string>& [in]): + Set of parameters involved in the gate. + \param rPoints (vector<FPoint>& [in]): + A set of points involved in the gate. + + \para Returns: + \retval CGate* + Pointer to a created gate or throws a CGateFactoryException if the + gate could not be made. + + \para Throws: + \throw CGateFactoryException + If the gate could not be made. The exception describes the type + of gate being made along with why the exception was thrown. + + */ CGate* CGateFactory::CreateGate(GateType eType, const vector<string>& rParameters, ! const vector<FPoint>& rPoints) { ! switch(eType) { *************** *** 451,458 **** } } CGate* CGateFactory::CreateGate(GateType eType, ! const vector<CPoint>& rPoints, const vector<string>& rSpectrum) { switch(eType) { --- 492,526 ---- } } + /*! + + \para Functionality: + Create a gamma gate. These are really accepted on a spectrum unlike + the other gates that are accepted on parameters. + + \para Formal Parameters: + \param <TT>eType (GateType [in]):</TT> + Type of gate that is to be created. This must be one of: + - gammacut A cut on a set of gamma parameters. + -gammaband A band on a set of ordered pairs of gamma params. + -gammacontour A contour on a set of ordered pairs of gamma + parameters. + \param <TT>rPoints (const vector<FPoint>& [in]):</TT> + The set of points that define the contour. + \param <TT>rSpectrum (const vector<string>& [in]):</TT> + The set of spectra on which this gate should be displayed. + + \para Returns: + \retval CGate* + A pointer to the gate that was created. + \para Exceptions: + \throw CGateFactoryException + In the event creating the gate is impossible. The exception + indicates the type of the gate being created and why the + gate could not be created. + */ CGate* CGateFactory::CreateGate(GateType eType, ! const vector<FPoint>& rPoints, const vector<string>& rSpectrum) { switch(eType) { *************** *** 475,478 **** --- 543,551 ---- } } + + /////////////////////////////////////////////////////// + + // The functions below create the gates of various types. + // Function: CreateTrueGate() // Operation Type: creational *************** *** 506,514 **** } // Function: CreateBand(const vector<string>& rParameters, ! // const vector<CPoint>& rPoints) // Operation Type: Creational CBand* CGateFactory::CreateBand(const vector<string>& rParameters, ! const vector<CPoint>& rPoints) { // Creates a band gate. --- 579,587 ---- } // Function: CreateBand(const vector<string>& rParameters, ! // const vector<FPoint>& rPoints) // Operation Type: Creational CBand* CGateFactory::CreateBand(const vector<string>& rParameters, ! const vector<FPoint>& rPoints) { // Creates a band gate. *************** *** 518,523 **** // const vector<string>& rParams: // 2 element vector containing x and y parameter names. ! // const vector<CPoint>& rPoints ! // 2 element vector containing x,y points of the band. // --- 591,597 ---- // const vector<string>& rParams: // 2 element vector containing x and y parameter names. ! // const vector<FPoint>& rPoints ! // at least 2 element vector containing x,y ! // points of the band. // *************** *** 547,556 **** // // Function: CreateContour(const vector<string>& rParameters, ! // const vector<CPoint>& rPoints) // Operation Type: Creational // CContour* CGateFactory::CreateContour(const vector<string>& rParameters, ! const vector<CPoint>& rPoints) { // Creates a contour gate. Contour gates --- 621,630 ---- // // Function: CreateContour(const vector<string>& rParameters, ! // const vector<FPoint>& rPoints) // Operation Type: Creational // CContour* CGateFactory::CreateContour(const vector<string>& rParameters, ! const vector<FPoint>& rPoints) { // Creates a contour gate. Contour gates *************** *** 567,571 **** // x (element 0) and y (element 1) parameter // names of the parameters being checked in the gate. ! // const vector<CPoint>& rPoints: // The set of points which define the edge of the // contour. --- 641,645 ---- // x (element 0) and y (element 1) parameter // names of the parameters being checked in the gate. ! // const vector<FPoint>& rPoints: // The set of points which define the edge of the // contour. *************** *** 591,603 **** CGammaCut* ! CGateFactory::CreateGammaCut(UInt_t nLow, UInt_t nHigh, const vector<string>& rSpectrum) { if(rSpectrum.size() > 0) { - //vector<CSpectrum*> Specs; - //for(UInt_t i = 0; i < rSpectrum.size(); i++) { - //Specs.push_back(NameToSpec(rSpectrum[i], gammacut, - // "Translating spectrum")); - //} return n... [truncated message content] |