Lines Matching full:original
74 size_t CountUniqueItems_Aux( const C& original, const Iter& firstNew,
76 size_t CountUniqueItems_Aux( const C& original, Iter firstNew,
101 if ( const_iter(original.find( *tmp )) == const_iter(original.end()) )
126 size_t CountUniqueItems( const C& original, const Iter& firstNew,
130 return CountUniqueItems_Aux( original, firstNew, lastNew,
135 size_t CountUniqueItems( const C& original, const Iter& firstNew,
139 return CountUniqueItems_Aux( original, firstNew, lastNew,
143 return CountUniqueItems_Aux( original, firstNew, lastNew,
149 size_t CountNewItems( const C& original, const Iter& firstNew,
152 return CountUniqueItems( original, firstNew, lastNew,
153 container_category( original ) );
157 size_t CountNewItems( const C& original, const Iter& firstNew,
160 return CountUniqueItems( original, firstNew, lastNew,
161 container_category( original ) );
165 inline void VerifyInsertion( const C& original, const C& result,
170 DstIter first1 = original.begin();
173 DstIter* from_orig = new DstIter[original.size()];
179 EH_STD::pair<DstIter, DstIter> p = EH_STD::mismatch( first1, original.end(), first2 );
200 dstItem = EH_STD::find( first1, original.end(), *p.first );
201 EH_ASSERT( dstItem != original.end() );
219 const C& original, const C& result, const SrcIter& firstNew,
222 VerifyInsertion( original, result, firstNew, lastNew,
227 inline void VerifyInsertion(const C& original, const C& result,
231 VerifyInsertion( original, result, firstNew, lastNew,
237 const C& original, const C& result, const SrcIter& firstNew,
240 VerifyInsertion( original, result, firstNew, lastNew,
246 const C& original, const C& result, const SrcIter& firstNew,
249 VerifyInsertion( original, result, firstNew, lastNew,
256 const C& original, const C& result, SrcIter firstNew,
259 const C& original, const C& result, const SrcIter& firstNew,
263 typename C::const_iterator p1 = original.begin();
277 EH_ASSERT( p1 == original.end() );
281 inline void VerifyInsertion( const C& original, const C& result,
285 EH_ASSERT( result.size() == original.size() +
286 CountNewItems( original, firstNew, lastNew,
287 container_category(original) ) );
288 VerifyInsertion( original, result, firstNew, lastNew, insPos,
289 container_category(original) );
293 void VerifyInsertN( const C& original, const C& result, size_t insCnt,
296 typename C::const_iterator p1 = original.begin();
314 EH_ASSERT( p1 == original.end() );
331 : original( orig ), fPos( random_number( orig.size() ))
356 VerifyInsertion( original, c, &fInsVal, 1+&fInsVal, fPos );
360 const C& original;
368 : original( orig ), fPos( random_number( orig.size() )), fInsCnt(insCnt)
393 VerifyInsertN( original, c, fInsCnt, fInsVal, fPos );
397 const C& original;
406 : original( orig )
419 VerifyInsertion( original, c, &fInsVal, 1+&fInsVal, size_t(0) );
423 const C& original;
430 : original( orig )
443 VerifyInsertion( original, c, &fInsVal, 1+&fInsVal, size_t(0) );
447 const C& original;
502 original( orig ),
526 VerifyInsertion( original, c, fFirst, fLast, fPos );
530 const C& original;
