#include <iostream>#include "Conventions/CalDigitType.h"#include "Conventions/CalStripType.h"#include "Conventions/CalTimeType.h"#include "Midad/Base/DigitText.h"#include "Plex/PlexStripEndId.h"#include "Candidate/CandHandle.h"#include <set>#include <vector>Go to the source code of this file.
Classes | |
| class | TridModel |
Functions | |
| template<typename _InputIterator1, typename _InputIterator2> | |
| bool | test_set_intersection (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) |
|
||||||||||||||||||||||||
|
Definition at line 107 of file TridModel.h. Referenced by TridModel::Intersects(). 00109 {
00110 // concept requirements
00111 // Doesn't compile on MacOSX and isn't strictly neccessary, so I'll leave
00112 // it commented out. May cause problems if this algorithm is ever used wrongly.
00113 //__glibcxx_function_requires(_InputIteratorConcept <_InputIterator1> )
00114 //__glibcxx_function_requires(_InputIteratorConcept <_InputIterator2> )
00115 //__glibcxx_function_requires(_SameTypeConcept<
00116 // typename iterator_traits <_InputIterator1>::value_type,
00117 // typename iterator_traits <_InputIterator2>::value_type>)
00118 //__glibcxx_function_requires(_LessThanComparableConcept<
00119 // typename iterator_traits<_InputIterator1>::value_type>)
00120 //__glibcxx_requires_sorted(__first1, __last1);
00121 //__glibcxx_requires_sorted(__first2, __last2);
00122
00123 while (__first1 != __last1 && __first2 != __last2)
00124 if (*__first1 < *__first2)
00125 ++__first1;
00126 else if (*__first2 < *__first1)
00127 ++__first2;
00128 else
00129 {
00130 return true;
00131 }
00132 return false;
00133 }
|
1.3.9.1