1 //===- STLExtras.h - Useful functions when working with the STL -*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file contains some templates that are useful if you are working with the
13 // No library is required when using these functinons.
15 //===----------------------------------------------------------------------===//
17 #ifndef SUPPORT_STLEXTRAS_H
18 #define SUPPORT_STLEXTRAS_H
21 #include <utility> // for std::pair
22 #include "Support/iterator"
26 //===----------------------------------------------------------------------===//
27 // Extra additions to <functional>
28 //===----------------------------------------------------------------------===//
30 // bind_obj - Often times you want to apply the member function of an object
31 // as a unary functor. This macro is shorthand that makes it happen less
35 // struct Summer { void accumulate(int x); }
36 // vector<int> Numbers;
38 // for_each(Numbers.begin(), Numbers.end(),
39 // bind_obj(&MyS, &Summer::accumulate));
41 // TODO: When I get lots of extra time, convert this from an evil macro
43 #define bind_obj(OBJ, METHOD) std::bind1st(std::mem_fun(METHOD), OBJ)
46 // bitwise_or - This is a simple functor that applys operator| on its two
47 // arguments to get a boolean result.
50 struct bitwise_or : public std::binary_function<Ty, Ty, bool> {
51 bool operator()(const Ty& left, const Ty& right) const {
57 // deleter - Very very very simple method that is used to invoke operator
58 // delete on something. It is used like this:
60 // for_each(V.begin(), B.end(), deleter<Interval>);
63 static inline void deleter(T *Ptr) {
69 //===----------------------------------------------------------------------===//
70 // Extra additions to <iterator>
71 //===----------------------------------------------------------------------===//
73 // mapped_iterator - This is a simple iterator adapter that causes a function to
74 // be dereferenced whenever operator* is invoked on the iterator.
76 template <class RootIt, class UnaryFunc>
77 class mapped_iterator {
81 typedef typename std::iterator_traits<RootIt>::iterator_category
83 typedef typename std::iterator_traits<RootIt>::difference_type
85 typedef typename UnaryFunc::result_type value_type;
88 //typedef typename UnaryFunc::result_type *pointer;
89 typedef void reference; // Can't modify value returned by fn
91 typedef RootIt iterator_type;
92 typedef mapped_iterator<RootIt, UnaryFunc> _Self;
94 inline RootIt &getCurrent() const { return current; }
96 inline explicit mapped_iterator(const RootIt &I, UnaryFunc F)
97 : current(I), Fn(F) {}
98 inline mapped_iterator(const mapped_iterator &It)
99 : current(It.current), Fn(It.Fn) {}
101 inline value_type operator*() const { // All this work to do this
102 return Fn(*current); // little change
105 _Self& operator++() { ++current; return *this; }
106 _Self& operator--() { --current; return *this; }
107 _Self operator++(int) { _Self __tmp = *this; ++current; return __tmp; }
108 _Self operator--(int) { _Self __tmp = *this; --current; return __tmp; }
109 _Self operator+ (difference_type n) const { return _Self(current + n); }
110 _Self& operator+= (difference_type n) { current += n; return *this; }
111 _Self operator- (difference_type n) const { return _Self(current - n); }
112 _Self& operator-= (difference_type n) { current -= n; return *this; }
113 reference operator[](difference_type n) const { return *(*this + n); }
115 inline bool operator!=(const _Self &X) const { return !operator==(X); }
116 inline bool operator==(const _Self &X) const { return current == X.current; }
117 inline bool operator< (const _Self &X) const { return current < X.current; }
119 inline difference_type operator-(const _Self &X) const {
120 return current - X.current;
124 template <class _Iterator, class Func>
125 inline mapped_iterator<_Iterator, Func>
126 operator+(typename mapped_iterator<_Iterator, Func>::difference_type N,
127 const mapped_iterator<_Iterator, Func>& X) {
128 return mapped_iterator<_Iterator, Func>(X.getCurrent() - N);
132 // map_iterator - Provide a convenient way to create mapped_iterators, just like
133 // make_pair is useful for creating pairs...
135 template <class ItTy, class FuncTy>
136 inline mapped_iterator<ItTy, FuncTy> map_iterator(const ItTy &I, FuncTy F) {
137 return mapped_iterator<ItTy, FuncTy>(I, F);
141 // next/prior - These functions unlike std::advance do not modify the
142 // passed iterator but return a copy.
144 // next(myIt) returns copy of myIt incremented once
145 // next(myIt, n) returns copy of myIt incremented n times
146 // prior(myIt) returns copy of myIt decremented once
147 // prior(myIt, n) returns copy of myIt decremented n times
149 template <typename ItTy, typename Dist>
150 inline ItTy next(ItTy it, Dist n)
156 template <typename ItTy>
157 inline ItTy next(ItTy it)
163 template <typename ItTy, typename Dist>
164 inline ItTy prior(ItTy it, Dist n)
166 std::advance(it, -n);
170 template <typename ItTy>
171 inline ItTy prior(ItTy it)
173 std::advance(it, -1);
178 //===----------------------------------------------------------------------===//
179 // Extra additions to <algorithm>
180 //===----------------------------------------------------------------------===//
182 // apply_until - Apply a functor to a sequence continually, unless the
183 // functor returns true. Return true if the functor returned true, return false
184 // if the functor never returned true.
186 template <class InputIt, class Function>
187 bool apply_until(InputIt First, InputIt Last, Function Func) {
188 for ( ; First != Last; ++First)
189 if (Func(*First)) return true;
194 // reduce - Reduce a sequence values into a single value, given an initial
195 // value and an operator.
197 template <class InputIt, class Function, class ValueType>
198 ValueType reduce(InputIt First, InputIt Last, Function Func, ValueType Value) {
199 for ( ; First != Last; ++First)
200 Value = Func(*First, Value);
204 #if 1 // This is likely to be more efficient
206 // reduce_apply - Reduce the result of applying a function to each value in a
207 // sequence, given an initial value, an operator, a function, and a sequence.
209 template <class InputIt, class Function, class ValueType, class TransFunc>
210 inline ValueType reduce_apply(InputIt First, InputIt Last, Function Func,
211 ValueType Value, TransFunc XForm) {
212 for ( ; First != Last; ++First)
213 Value = Func(XForm(*First), Value);
217 #else // This is arguably more elegant
219 // reduce_apply - Reduce the result of applying a function to each value in a
220 // sequence, given an initial value, an operator, a function, and a sequence.
222 template <class InputIt, class Function, class ValueType, class TransFunc>
223 inline ValueType reduce_apply2(InputIt First, InputIt Last, Function Func,
224 ValueType Value, TransFunc XForm) {
225 return reduce(map_iterator(First, XForm), map_iterator(Last, XForm),
231 // reduce_apply_bool - Reduce the result of applying a (bool returning) function
232 // to each value in a sequence. All of the bools returned by the mapped
233 // function are bitwise or'd together, and the result is returned.
235 template <class InputIt, class Function>
236 inline bool reduce_apply_bool(InputIt First, InputIt Last, Function Func) {
237 return reduce_apply(First, Last, bitwise_or<bool>(), false, Func);
241 // map - This function maps the specified input sequence into the specified
242 // output iterator, applying a unary function in between.
244 template <class InIt, class OutIt, class Functor>
245 inline OutIt mapto(InIt Begin, InIt End, OutIt Dest, Functor F) {
246 return copy(map_iterator(Begin, F), map_iterator(End, F), Dest);
250 //===----------------------------------------------------------------------===//
251 // Extra additions to <utility>
252 //===----------------------------------------------------------------------===//
254 // tie - this function ties two objects and returns a temporary object
255 // that is assignable from a std::pair. This can be used to make code
256 // more readable when using values returned from functions bundled in
257 // a std::pair. Since an example is worth 1000 words:
259 // typedef std::map<int, int> Int2IntMap;
262 // Int2IntMap::iterator where;
264 // tie(where, inserted) = myMap.insert(std::make_pair(123,456));
273 template <typename T1, typename T2>
275 typedef T1 &first_type;
276 typedef T2 &second_type;
281 tier(first_type f, second_type s) : first(f), second(s) { }
282 tier& operator=(const std::pair<T1, T2>& p) {
290 template <typename T1, typename T2>
291 inline tier<T1, T2> tie(T1& f, T2& s) {
292 return tier<T1, T2>(f, s);
295 } // End llvm namespace