ATLAS Offline Software
Loading...
Searching...
No Matches
DVL_algorithms.h
Go to the documentation of this file.
1// This file's extension implies that it's C, but it's really -*- C++ -*-.
2
3/*
4 Copyright (C) 2002-2019 CERN for the benefit of the ATLAS collaboration
5*/
6
7// $Id$
14
15
16#ifndef ATHCONTAINERS_TOOLS_DVL_ALGORITHMS_H
17#define ATHCONTAINERS_TOOLS_DVL_ALGORITHMS_H
18
19
20#include "AthContainers/tools/DVLIterator.h"
21#include <iterator>
22#include <algorithm>
23
24
25#include "AthContainers/tools/DVL_algorithms.icc"
26
27
28
29//===========================================================================
30// Algorithms requiring @c ForwardIterator.
31// Usable with @c DataVector and @c DataList.
32//
33
34namespace std {
35
36
47template <class DVL, class T>
48typename DataModel_detail::iterator<DVL>
49remove (typename DataModel_detail::iterator<DVL> beg,
50 typename DataModel_detail::iterator<DVL> end,
51 const T& value)
52{
53 // Implemented with iter_swap, no extra index manipulation needed.
54 return DataModel_detail::dvl_remove (beg, end, value);
55}
56
57
68template <class DVL, class Predicate>
69typename DataModel_detail::iterator<DVL>
70remove_if (typename DataModel_detail::iterator<DVL> beg,
71 typename DataModel_detail::iterator<DVL> end,
72 Predicate pred)
73{
74 // Implemented with iter_swap, no extra index manipulation needed.
75 return DataModel_detail::dvl_remove_if (beg, end, pred);
76}
77
78
90template <class DVL, class T>
91typename std::reverse_iterator<DataModel_detail::iterator<DVL> >
92remove (typename std::reverse_iterator<DataModel_detail::iterator<DVL> > beg,
93 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > end,
94 const T& value)
95{
96 // Implemented with iter_swap, no extra index manipulation needed.
97 return DataModel_detail::dvl_remove (beg, end, value);
98}
99
100
112template <class DVL, class Predicate>
113typename std::reverse_iterator<DataModel_detail::iterator<DVL> >
114remove_if (typename std::reverse_iterator<DataModel_detail::iterator<DVL> > beg,
115 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > end,
116 Predicate pred)
117{
118 // Implemented with iter_swap, no extra index manipulation needed.
119 return DataModel_detail::dvl_remove_if (beg, end, pred);
120}
121
122
133template <class DVL>
134typename DataModel_detail::iterator<DVL>
135unique (typename DataModel_detail::iterator<DVL> beg,
136 typename DataModel_detail::iterator<DVL> end)
137{
138 // Implemented with iter_swap, no extra index manipulation needed.
139 return DataModel_detail::dvl_unique (beg, end);
140}
141
142
153template <class DVL, class BinaryPredicate>
154typename DataModel_detail::iterator<DVL>
155unique (typename DataModel_detail::iterator<DVL> beg,
156 typename DataModel_detail::iterator<DVL> end,
157 BinaryPredicate pred)
158{
159 // Implemented with iter_swap, no extra index manipulation needed.
160 return DataModel_detail::dvl_unique (beg, end, pred);
161}
162
163
175template <class DVL>
176typename std::reverse_iterator<DataModel_detail::iterator<DVL> >
177unique (typename std::reverse_iterator<DataModel_detail::iterator<DVL> > beg,
178 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > end)
179{
180 // Implemented with iter_swap, no extra index manipulation needed.
181 return DataModel_detail::dvl_unique (beg, end);
182}
183
184
197template <class DVL, class BinaryPredicate>
198typename std::reverse_iterator<DataModel_detail::iterator<DVL> >
199unique (typename std::reverse_iterator<DataModel_detail::iterator<DVL> > beg,
200 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > end,
201 BinaryPredicate pred)
202{
203 // Implemented with iter_swap, no extra index manipulation needed.
204 return DataModel_detail::dvl_unique (beg, end, pred);
205}
206
207
220template <class DVL>
221void rotate (typename DataModel_detail::iterator<DVL> beg,
222 typename DataModel_detail::iterator<DVL> mid,
223 typename DataModel_detail::iterator<DVL> end)
224{
225 std::rotate (beg.base(), mid.base(), end.base());
226 DataModel_detail::resortAux (beg, end);
227}
228
229
242template <class DVL>
243void
244rotate (typename std::reverse_iterator<DataModel_detail::iterator<DVL> > beg,
245 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > mid,
246 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > end)
247{
248 typedef typename DVL::BaseContainer::reverse_iterator ri;
249 std::rotate (ri(beg.base().base()),
250 ri(mid.base().base()),
251 ri(end.base().base()));
252 DataModel_detail::resortAux (beg, end);
253}
254
255
256} // namespace std
257
258
259
260//===========================================================================
261// Algorithms requiring @c BidirectionalIterator.
262// Usable with @c DataVector and @c DataList.
263//
264
265namespace std {
266
267
279template <class DVL>
280void reverse (typename DataModel_detail::iterator<DVL> beg,
281 typename DataModel_detail::iterator<DVL> end)
282{
283 std::reverse (beg.base(), end.base());
284 DataModel_detail::resortAux (beg, end);
285}
286
287
299template <class DVL>
300void
301reverse (typename std::reverse_iterator<DataModel_detail::iterator<DVL> > beg,
302 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > end)
303{
304 typedef typename DVL::BaseContainer::reverse_iterator ri;
305 std::reverse (ri(beg.base().base()), ri(end.base().base()));
306 DataModel_detail::resortAux (beg, end);
307}
308
309
322template <class DVL, class Predicate>
323typename DataModel_detail::iterator<DVL>
324partition (typename DataModel_detail::iterator<DVL> beg,
325 typename DataModel_detail::iterator<DVL> end,
326 Predicate pred)
327{
328 typename DataModel_detail::iterator<DVL> ret
329 (std::partition (beg.base(), end.base(),
330 DataModel_detail::Predwrapper<DVL, Predicate> (pred)),
331 beg.container());
332 DataModel_detail::resortAux (beg, end);
333 return ret;
334}
335
336
349template <class DVL, class Predicate>
350typename std::reverse_iterator<DataModel_detail::iterator<DVL> >
351partition (typename std::reverse_iterator<DataModel_detail::iterator<DVL> > beg,
352 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > end,
353 Predicate pred)
354{
355 typedef typename DataModel_detail::iterator<DVL> Iterator;
356 typedef typename DVL::BaseContainer::reverse_iterator ri;
357 typedef typename DataModel_detail::Predwrapper<DVL, Predicate> pwrap_t;
358 std::reverse_iterator<Iterator> ret
359 (Iterator (std::partition (ri(beg.base().base()),
360 ri(end.base().base()),
361 pwrap_t (pred)).base(),
362 beg.base().container()));
363 DataModel_detail::resortAux (beg, end);
364 return ret;
365}
366
367
380template <class DVL, class Predicate>
381typename DataModel_detail::iterator<DVL>
382stable_partition (typename DataModel_detail::iterator<DVL> beg,
383 typename DataModel_detail::iterator<DVL> end,
384 Predicate pred)
385{
386 DataModel_detail::iterator<DVL> ret
387 (std::stable_partition (beg.base(), end.base(),
388 DataModel_detail::Predwrapper<DVL, Predicate>
389 (pred)),
390 beg.container());
391 DataModel_detail::resortAux (beg, end);
392 return ret;
393}
394
395
408template <class DVL, class Predicate>
409typename std::reverse_iterator<DataModel_detail::iterator<DVL> >
410stable_partition
411 (typename std::reverse_iterator<DataModel_detail::iterator<DVL> > beg,
412 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > end,
413 Predicate pred)
414{
415 typedef typename DataModel_detail::iterator<DVL> Iterator;
416 typedef typename DVL::BaseContainer::reverse_iterator ri;
417 typedef typename DataModel_detail::Predwrapper<DVL, Predicate> pwrap_t;
418 std::reverse_iterator<Iterator> ret
419 (Iterator (std::stable_partition (ri(beg.base().base()),
420 ri(end.base().base()),
421 pwrap_t (pred)).base(),
422 beg.base().container()));
423 DataModel_detail::resortAux (beg, end);
424 return ret;
425}
426
427
440template <class DVL>
441void
442inplace_merge (typename DataModel_detail::iterator<DVL> beg,
443 typename DataModel_detail::iterator<DVL> mid,
444 typename DataModel_detail::iterator<DVL> end)
445{
446 std::inplace_merge (beg.base(), mid.base(), end.base());
447 DataModel_detail::resortAux (beg, end);
448}
449
450
464template <class DVL, class Compare>
465void
466inplace_merge (typename DataModel_detail::iterator<DVL> beg,
467 typename DataModel_detail::iterator<DVL> mid,
468 typename DataModel_detail::iterator<DVL> end,
469 Compare comp)
470{
471 std::inplace_merge (beg.base(), mid.base(), end.base(),
472 typename DataModel_detail::Compwrapper<DVL, Compare>(comp));
473 DataModel_detail::resortAux (beg, end);
474}
475
476
489template <class DVL>
490void
491inplace_merge (typename std::reverse_iterator<DataModel_detail::iterator<DVL> > beg,
492 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > mid,
493 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > end)
494{
495 typedef typename DVL::BaseContainer::reverse_iterator ri;
496 std::inplace_merge (ri (beg.base().base()),
497 ri (mid.base().base()),
498 ri (end.base().base()));
499 DataModel_detail::resortAux (beg, end);
500}
501
502
516template <class DVL, class Compare>
517void
518inplace_merge (typename std::reverse_iterator<DataModel_detail::iterator<DVL> > beg,
519 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > mid,
520 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > end,
521 Compare comp)
522{
523 typedef typename DVL::BaseContainer::reverse_iterator ri;
524 std::inplace_merge (ri (beg.base().base()),
525 ri (mid.base().base()),
526 ri (end.base().base()),
527 typename DataModel_detail::Compwrapper<DVL, Compare>(comp));
528 DataModel_detail::resortAux (beg, end);
529}
530
531
532} // namespace std
533
534
535
536//===========================================================================
537// Algorithms requiring @c RandomAccessIterator.
538// Usable with @c DataVector.
539//
540
541namespace std {
542
543
553template <class DVL>
554void sort (typename DataModel_detail::iterator<DVL> beg,
555 typename DataModel_detail::iterator<DVL> end)
556{
557 // Wrap the default comparison object,
558 // in case someone's overridden operator< for pointers.
559 typedef std::less<typename DVL::BaseContainer::value_type> less;
560 std::sort (beg.base(), end.base(),
561 typename DataModel_detail::Compwrapper<DVL, less> (less()));
562 DataModel_detail::resortAux (beg, end);
563}
564
565
576template <class DVL, class Compare>
577void sort (typename DataModel_detail::iterator<DVL> beg,
578 typename DataModel_detail::iterator<DVL> end,
579 Compare comp)
580{
581 std::sort (beg.base(), end.base(),
582 typename DataModel_detail::Compwrapper<DVL, Compare> (comp));
583 DataModel_detail::resortAux (beg, end);
584}
585
586
597template <class DVL>
598void sort (typename std::reverse_iterator<DataModel_detail::iterator<DVL> > beg,
599 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > end)
600{
601 typedef typename DVL::BaseContainer::reverse_iterator ri;
602 // Wrap the default comparison object,
603 // in case someone's overridden operator< for pointers.
604 typedef std::less<typename DVL::BaseContainer::value_type> less;
605 std::sort (ri (beg.base().base()), ri (end.base().base()),
606 typename DataModel_detail::Compwrapper<DVL, less> (less()));
607 DataModel_detail::resortAux (beg, end);
608}
609
610
622template <class DVL, class Compare>
623void sort (typename std::reverse_iterator<DataModel_detail::iterator<DVL> > beg,
624 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > end,
625 const Compare& comp)
626{
627 typedef typename DVL::BaseContainer::reverse_iterator ri;
628 std::sort (ri (beg.base().base()), ri (end.base().base()),
629 typename DataModel_detail::Compwrapper<DVL, Compare> (comp));
630 DataModel_detail::resortAux (beg, end);
631}
632
633
643template <class DVL>
644void stable_sort (DataModel_detail::iterator<DVL> beg,
645 DataModel_detail::iterator<DVL> end)
646{
647 // Wrap the default comparison object,
648 // in case someone's overridden operator< for pointers.
649 typedef std::less<typename DVL::BaseContainer::value_type> less;
650 std::stable_sort (beg.base(), end.base(),
651 DataModel_detail::Compwrapper<DVL, less> (less()));
652 DataModel_detail::resortAux (beg, end);
653}
654
655
665template <class DVL, class Compare>
666void stable_sort (DataModel_detail::iterator<DVL> beg,
667 DataModel_detail::iterator<DVL> end,
668 Compare comp)
669{
670 std::stable_sort (beg.base(), end.base(),
671 DataModel_detail::Compwrapper<DVL, Compare> (comp));
672 DataModel_detail::resortAux (beg, end);
673}
674
675
686template <class DVL>
687void stable_sort (std::reverse_iterator<DataModel_detail::iterator <DVL> > beg,
688 std::reverse_iterator<DataModel_detail::iterator <DVL> > end)
689{
690 typedef typename DVL::BaseContainer::reverse_iterator ri;
691 // Wrap the default comparison object,
692 // in case someone's overridden operator< for pointers.
693 typedef std::less<typename DVL::BaseContainer::value_type> less;
694 std::stable_sort (ri (beg.base().base()), ri (end.base().base()),
695 typename DataModel_detail::Compwrapper<DVL, less> (less()));
696 DataModel_detail::resortAux (beg, end);
697}
698
699
710template <class DVL, class Compare>
711void stable_sort (std::reverse_iterator<DataModel_detail::iterator <DVL> > beg,
712 std::reverse_iterator<DataModel_detail::iterator <DVL> > end,
713 Compare comp)
714{
715 typedef typename DVL::BaseContainer::reverse_iterator ri;
716 std::stable_sort (ri (beg.base().base()), ri (end.base().base()),
717 typename DataModel_detail::Compwrapper<DVL, Compare>(comp));
718 DataModel_detail::resortAux (beg, end);
719}
720
721
733template <class DVL>
734void partial_sort (DataModel_detail::iterator<DVL> beg,
735 DataModel_detail::iterator<DVL> mid,
736 DataModel_detail::iterator<DVL> end)
737{
738 // Wrap the default comparison object,
739 // in case someone's overridden operator< for pointers.
740 typedef std::less<typename DVL::BaseContainer::value_type> less;
741 std::partial_sort (beg.base(), mid.base(), end.base(),
742 DataModel_detail::Compwrapper<DVL, less> (less()));
743 DataModel_detail::resortAux (beg, end);
744}
745
746
758template <class DVL, class Compare>
759void partial_sort (DataModel_detail::iterator<DVL> beg,
760 DataModel_detail::iterator<DVL> mid,
761 DataModel_detail::iterator<DVL> end,
762 Compare comp)
763{
764 std::partial_sort (beg.base(), mid.base(), end.base(),
765 DataModel_detail::Compwrapper<DVL, Compare> (comp));
766 DataModel_detail::resortAux (beg, end);
767}
768
769
781template <class DVL>
782void partial_sort (std::reverse_iterator<DataModel_detail::iterator<DVL> > beg,
783 std::reverse_iterator<DataModel_detail::iterator<DVL> > mid,
784 std::reverse_iterator<DataModel_detail::iterator<DVL> > end)
785{
786 typedef typename DVL::BaseContainer::reverse_iterator ri;
787 // Wrap the default comparison object,
788 // in case someone's overridden operator< for pointers.
789 typedef std::less<typename DVL::BaseContainer::value_type> less;
790 std::partial_sort (ri (beg.base().base()),
791 ri (mid.base().base()),
792 ri (end.base().base()),
793 typename DataModel_detail::Compwrapper<DVL, less>
794 (less()));
795 DataModel_detail::resortAux (beg, end);
796}
797
798
810template <class DVL, class Compare>
811void partial_sort (std::reverse_iterator<DataModel_detail::iterator<DVL> > beg,
812 std::reverse_iterator<DataModel_detail::iterator<DVL> > mid,
813 std::reverse_iterator<DataModel_detail::iterator<DVL> > end,
814 Compare comp)
815{
816 typedef typename DVL::BaseContainer::reverse_iterator ri;
817 std::partial_sort (ri (beg.base().base()),
818 ri (mid.base().base()),
819 ri (end.base().base()),
820 typename DataModel_detail::Compwrapper<DVL, Compare>
821 (comp));
822 DataModel_detail::resortAux (beg, end);
823}
824
825
838template <class DVL, class UniformRandom>
839void shuffle (typename DataModel_detail::iterator<DVL> beg,
840 typename DataModel_detail::iterator<DVL> end,
841 UniformRandom& g)
842{
843 std::shuffle (beg.base(), end.base(), g);
844 DataModel_detail::resortAux (beg, end);
845}
846
847
860template <class DVL, class UniformRandom>
861void
862shuffle
863 (typename std::reverse_iterator<DataModel_detail::iterator<DVL> > beg,
864 typename std::reverse_iterator<DataModel_detail::iterator<DVL> > end,
865 UniformRandom& g)
866{
867 typedef typename DVL::BaseContainer::reverse_iterator ri;
868 std::shuffle (ri(beg.base().base()),
869 ri(end.base().base()),
870 g);
871 DataModel_detail::resortAux (beg, end);
872}
873
874
875} // namespace std
876
877
878
879#endif // not ATHCONTAINERS_TOOLS_DVL_ALGORITHMS_H
DVL_algorithms.icc
DataModel_detail::iterator
(Non-const) Iterator class for DataVector/DataList.
Definition DVLIterator.h:184
base
std::string base
Definition hcg.cxx:81
std
STL namespace.
std::unique
DataModel_detail::iterator< DVL > unique(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
Specialization of unique for DataVector/List.
Definition DVL_algorithms.h:135
std::remove
DataModel_detail::iterator< DVL > remove(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end, const T &value)
Specialization of remove for DataVector/List.
Definition DVL_algorithms.h:49
std::sort
void sort(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
Specialization of sort for DataVector/List.
Definition DVL_algorithms.h:554
std::inplace_merge
void inplace_merge(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > mid, typename DataModel_detail::iterator< DVL > end)
Specialization of inplace_merge for DataVector/List.
Definition DVL_algorithms.h:442
std::shuffle
void shuffle(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end, UniformRandom &g)
Specialization of shuffle for DataVector/List.
Definition DVL_algorithms.h:839
std::rotate
void rotate(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > mid, typename DataModel_detail::iterator< DVL > end)
Specialization of rotate for DataVector/List.
Definition DVL_algorithms.h:221
std::stable_partition
DataModel_detail::iterator< DVL > stable_partition(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end, Predicate pred)
Specialization of stable_partition for DataVector/List.
Definition DVL_algorithms.h:382
std::stable_sort
void stable_sort(DataModel_detail::iterator< DVL > beg, DataModel_detail::iterator< DVL > end)
Specialization of stable_sort for DataVector/List.
Definition DVL_algorithms.h:644
std::partition
DataModel_detail::iterator< DVL > partition(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end, Predicate pred)
Specialization of partition for DataVector/List.
Definition DVL_algorithms.h:324
std::partial_sort
void partial_sort(DataModel_detail::iterator< DVL > beg, DataModel_detail::iterator< DVL > mid, DataModel_detail::iterator< DVL > end)
Specialization of partial_sort for DataVector/List.
Definition DVL_algorithms.h:734
std::reverse
void reverse(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
Specialization of reverse for DataVector/List.
Definition DVL_algorithms.h:280
std::remove_if
DataModel_detail::iterator< DVL > remove_if(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end, Predicate pred)
Specialization of remove_if for DataVector/List.
Definition DVL_algorithms.h:70
Generated on for ATLAS Offline Software by doxygen 1.14.0