gccxml_gem 0.9.3-x86-darwin-11

Sign up to get free protection for your applications and to get access to all the features.
Files changed (176) hide show
  1. data/Rakefile +84 -0
  2. data/bin/gccxml +0 -0
  3. data/bin/gccxml_cc1plus +0 -0
  4. data/gccxml.rb +57 -0
  5. data/share/doc/gccxml-0.9/Copyright.txt +55 -0
  6. data/share/doc/gccxml-0.9/gccxml.html +168 -0
  7. data/share/doc/gccxml-0.9/gccxml.txt +293 -0
  8. data/share/gccxml-0.9/GCC/2.95/algorithm +76 -0
  9. data/share/gccxml-0.9/GCC/2.95/bitset +17 -0
  10. data/share/gccxml-0.9/GCC/2.95/cctype +24 -0
  11. data/share/gccxml-0.9/GCC/2.95/clocale +14 -0
  12. data/share/gccxml-0.9/GCC/2.95/cmath +33 -0
  13. data/share/gccxml-0.9/GCC/2.95/complex +38 -0
  14. data/share/gccxml-0.9/GCC/2.95/csetjmp +13 -0
  15. data/share/gccxml-0.9/GCC/2.95/csignal +14 -0
  16. data/share/gccxml-0.9/GCC/2.95/cstdarg +12 -0
  17. data/share/gccxml-0.9/GCC/2.95/cstddef +13 -0
  18. data/share/gccxml-0.9/GCC/2.95/cstdio +55 -0
  19. data/share/gccxml-0.9/GCC/2.95/cstdlib +66 -0
  20. data/share/gccxml-0.9/GCC/2.95/cstring +34 -0
  21. data/share/gccxml-0.9/GCC/2.95/ctime +24 -0
  22. data/share/gccxml-0.9/GCC/2.95/cwchar +65 -0
  23. data/share/gccxml-0.9/GCC/2.95/cwctype +31 -0
  24. data/share/gccxml-0.9/GCC/2.95/deque +19 -0
  25. data/share/gccxml-0.9/GCC/2.95/exception +20 -0
  26. data/share/gccxml-0.9/GCC/2.95/fstream +23 -0
  27. data/share/gccxml-0.9/GCC/2.95/functional +64 -0
  28. data/share/gccxml-0.9/GCC/2.95/gccxml_bitset +1066 -0
  29. data/share/gccxml-0.9/GCC/2.95/iomanip +20 -0
  30. data/share/gccxml-0.9/GCC/2.95/iosfwd +20 -0
  31. data/share/gccxml-0.9/GCC/2.95/iostream +27 -0
  32. data/share/gccxml-0.9/GCC/2.95/iterator +39 -0
  33. data/share/gccxml-0.9/GCC/2.95/list +19 -0
  34. data/share/gccxml-0.9/GCC/2.95/map +20 -0
  35. data/share/gccxml-0.9/GCC/2.95/memory +21 -0
  36. data/share/gccxml-0.9/GCC/2.95/new +13 -0
  37. data/share/gccxml-0.9/GCC/2.95/numeric +15 -0
  38. data/share/gccxml-0.9/GCC/2.95/pthread.h +16 -0
  39. data/share/gccxml-0.9/GCC/2.95/queue +20 -0
  40. data/share/gccxml-0.9/GCC/2.95/set +20 -0
  41. data/share/gccxml-0.9/GCC/2.95/sstream +24 -0
  42. data/share/gccxml-0.9/GCC/2.95/stack +19 -0
  43. data/share/gccxml-0.9/GCC/2.95/std/bastring.cc +524 -0
  44. data/share/gccxml-0.9/GCC/2.95/std/complext.h +397 -0
  45. data/share/gccxml-0.9/GCC/2.95/std/dcomplex.h +92 -0
  46. data/share/gccxml-0.9/GCC/2.95/std/fcomplex.h +88 -0
  47. data/share/gccxml-0.9/GCC/2.95/std/gslice_array.h +170 -0
  48. data/share/gccxml-0.9/GCC/2.95/std/indirect_array.h +157 -0
  49. data/share/gccxml-0.9/GCC/2.95/std/ldcomplex.h +96 -0
  50. data/share/gccxml-0.9/GCC/2.95/std/mask_array.h +154 -0
  51. data/share/gccxml-0.9/GCC/2.95/std/slice_array.h +156 -0
  52. data/share/gccxml-0.9/GCC/2.95/std/std_valarray.h +728 -0
  53. data/share/gccxml-0.9/GCC/2.95/std/straits.h +162 -0
  54. data/share/gccxml-0.9/GCC/2.95/std/valarray_meta.h +1035 -0
  55. data/share/gccxml-0.9/GCC/2.95/stdexcept +17 -0
  56. data/share/gccxml-0.9/GCC/2.95/stl_alloc.h +1057 -0
  57. data/share/gccxml-0.9/GCC/2.95/stl_bvector.h +836 -0
  58. data/share/gccxml-0.9/GCC/2.95/stl_deque.h +1699 -0
  59. data/share/gccxml-0.9/GCC/2.95/stl_list.h +843 -0
  60. data/share/gccxml-0.9/GCC/2.95/stl_tree.h +1331 -0
  61. data/share/gccxml-0.9/GCC/2.95/stl_vector.h +828 -0
  62. data/share/gccxml-0.9/GCC/2.95/string +26 -0
  63. data/share/gccxml-0.9/GCC/2.95/strstream +23 -0
  64. data/share/gccxml-0.9/GCC/2.95/typeinfo +11 -0
  65. data/share/gccxml-0.9/GCC/2.95/utility +25 -0
  66. data/share/gccxml-0.9/GCC/2.95/valarray +52 -0
  67. data/share/gccxml-0.9/GCC/2.95/vector +19 -0
  68. data/share/gccxml-0.9/GCC/2.96/sstream +305 -0
  69. data/share/gccxml-0.9/GCC/3.0/pthread.h +16 -0
  70. data/share/gccxml-0.9/GCC/3.1/pthread.h +16 -0
  71. data/share/gccxml-0.9/GCC/3.2/bits/fstream.tcc +500 -0
  72. data/share/gccxml-0.9/GCC/3.2/bits/gthr-default.h +585 -0
  73. data/share/gccxml-0.9/GCC/3.2/bits/istream.tcc +1207 -0
  74. data/share/gccxml-0.9/GCC/3.2/bits/locale_facets.h +1810 -0
  75. data/share/gccxml-0.9/GCC/3.2/bits/locale_facets.tcc +2397 -0
  76. data/share/gccxml-0.9/GCC/3.2/bits/messages_members.h +108 -0
  77. data/share/gccxml-0.9/GCC/3.2/bits/ostream.tcc +713 -0
  78. data/share/gccxml-0.9/GCC/3.2/bits/sstream.tcc +241 -0
  79. data/share/gccxml-0.9/GCC/3.2/bits/stl_deque.h +1682 -0
  80. data/share/gccxml-0.9/GCC/3.2/bits/stl_list.h +989 -0
  81. data/share/gccxml-0.9/GCC/3.2/bits/stl_tree.h +1462 -0
  82. data/share/gccxml-0.9/GCC/3.2/bits/stl_vector.h +1085 -0
  83. data/share/gccxml-0.9/GCC/3.2/bits/valarray_meta.h +1063 -0
  84. data/share/gccxml-0.9/GCC/3.2/fstream +579 -0
  85. data/share/gccxml-0.9/GCC/3.2/pthread.h +16 -0
  86. data/share/gccxml-0.9/GCC/3.2/sstream +384 -0
  87. data/share/gccxml-0.9/GCC/3.3/bits/fstream.tcc +530 -0
  88. data/share/gccxml-0.9/GCC/3.3/bits/list.tcc +378 -0
  89. data/share/gccxml-0.9/GCC/3.3/bits/locale_facets.h +2050 -0
  90. data/share/gccxml-0.9/GCC/3.3/bits/messages_members.h +108 -0
  91. data/share/gccxml-0.9/GCC/3.3/bits/sstream.tcc +243 -0
  92. data/share/gccxml-0.9/GCC/3.3/bits/stl_deque.h +1603 -0
  93. data/share/gccxml-0.9/GCC/3.3/bits/stl_list.h +1167 -0
  94. data/share/gccxml-0.9/GCC/3.3/bits/stl_tree.h +1462 -0
  95. data/share/gccxml-0.9/GCC/3.3/bits/stl_vector.h +992 -0
  96. data/share/gccxml-0.9/GCC/3.3/bits/valarray_meta.h +1135 -0
  97. data/share/gccxml-0.9/GCC/3.3/fstream +842 -0
  98. data/share/gccxml-0.9/GCC/3.3/gccxml_builtins.h +22 -0
  99. data/share/gccxml-0.9/GCC/3.3/sstream +638 -0
  100. data/share/gccxml-0.9/GCC/3.4/bits/gthr-default.h +669 -0
  101. data/share/gccxml-0.9/GCC/3.4/gccxml_builtins.h +91 -0
  102. data/share/gccxml-0.9/GCC/4.0/emmintrin.h +5 -0
  103. data/share/gccxml-0.9/GCC/4.0/gccxml_apple_emmintrin.h +1037 -0
  104. data/share/gccxml-0.9/GCC/4.0/gccxml_apple_mmintrin.h +669 -0
  105. data/share/gccxml-0.9/GCC/4.0/gccxml_apple_xmmintrin.h +870 -0
  106. data/share/gccxml-0.9/GCC/4.0/gccxml_builtins.h +128 -0
  107. data/share/gccxml-0.9/GCC/4.0/gccxml_gnu_emmintrin.h +977 -0
  108. data/share/gccxml-0.9/GCC/4.0/gccxml_gnu_mmintrin.h +636 -0
  109. data/share/gccxml-0.9/GCC/4.0/gccxml_gnu_xmmintrin.h +833 -0
  110. data/share/gccxml-0.9/GCC/4.0/mmintrin.h +5 -0
  111. data/share/gccxml-0.9/GCC/4.0/xmmintrin.h +5 -0
  112. data/share/gccxml-0.9/GCC/4.1/bits/gthr-default.h +622 -0
  113. data/share/gccxml-0.9/GCC/4.1/emmintrin.h +5 -0
  114. data/share/gccxml-0.9/GCC/4.1/gccxml_apple_emmintrin.h +1509 -0
  115. data/share/gccxml-0.9/GCC/4.1/gccxml_apple_mmintrin.h +942 -0
  116. data/share/gccxml-0.9/GCC/4.1/gccxml_apple_xmmintrin.h +1192 -0
  117. data/share/gccxml-0.9/GCC/4.1/gccxml_builtins.h +131 -0
  118. data/share/gccxml-0.9/GCC/4.1/gccxml_gnu_emmintrin.h +1004 -0
  119. data/share/gccxml-0.9/GCC/4.1/gccxml_gnu_mmintrin.h +637 -0
  120. data/share/gccxml-0.9/GCC/4.1/gccxml_gnu_xmmintrin.h +834 -0
  121. data/share/gccxml-0.9/GCC/4.1/mmintrin.h +5 -0
  122. data/share/gccxml-0.9/GCC/4.1/xmmintrin.h +5 -0
  123. data/share/gccxml-0.9/GCC/4.2/emmintrin.h +5 -0
  124. data/share/gccxml-0.9/GCC/4.2/gccxml_apple_emmintrin.h +1509 -0
  125. data/share/gccxml-0.9/GCC/4.2/gccxml_apple_mmintrin.h +942 -0
  126. data/share/gccxml-0.9/GCC/4.2/gccxml_apple_xmmintrin.h +1192 -0
  127. data/share/gccxml-0.9/GCC/4.2/gccxml_builtins.h +131 -0
  128. data/share/gccxml-0.9/GCC/4.2/gccxml_gnu_emmintrin.h +1013 -0
  129. data/share/gccxml-0.9/GCC/4.2/gccxml_gnu_mmintrin.h +663 -0
  130. data/share/gccxml-0.9/GCC/4.2/gccxml_gnu_xmmintrin.h +860 -0
  131. data/share/gccxml-0.9/GCC/4.2/mmintrin.h +5 -0
  132. data/share/gccxml-0.9/GCC/4.2/xmmintrin.h +5 -0
  133. data/share/gccxml-0.9/GCC/4.3/emmintrin.h +1043 -0
  134. data/share/gccxml-0.9/GCC/4.3/gccxml_builtins.h +183 -0
  135. data/share/gccxml-0.9/GCC/4.3/mmintrin.h +663 -0
  136. data/share/gccxml-0.9/GCC/4.3/xmmintrin.h +867 -0
  137. data/share/gccxml-0.9/GCC/4.4/bits/c++config.h +1431 -0
  138. data/share/gccxml-0.9/GCC/4.4/emmintrin.h +1041 -0
  139. data/share/gccxml-0.9/GCC/4.4/gccxml_builtins.h +153 -0
  140. data/share/gccxml-0.9/GCC/4.4/mmintrin.h +662 -0
  141. data/share/gccxml-0.9/GCC/4.4/xmmintrin.h +864 -0
  142. data/share/gccxml-0.9/GCC/4.5/gccxml_builtins.h +154 -0
  143. data/share/gccxml-0.9/GCC/4.5/iomanip +349 -0
  144. data/share/gccxml-0.9/GCC/COPYING.RUNTIME +73 -0
  145. data/share/gccxml-0.9/GCC/COPYING3 +674 -0
  146. data/share/gccxml-0.9/IBM/8.0/adapt_headers.sh +34 -0
  147. data/share/gccxml-0.9/IBM/8.0/stdlib.h.patch +27 -0
  148. data/share/gccxml-0.9/IBM/8.0/xstring.patch +19 -0
  149. data/share/gccxml-0.9/IBM/README +8 -0
  150. data/share/gccxml-0.9/IBM/find_flags +51 -0
  151. data/share/gccxml-0.9/IBM/find_flags_common +48 -0
  152. data/share/gccxml-0.9/Intel/find_flags +56 -0
  153. data/share/gccxml-0.9/Intel/pthread.h +16 -0
  154. data/share/gccxml-0.9/MIPSpro/7.3/exception +9 -0
  155. data/share/gccxml-0.9/MIPSpro/7.3/gccxml_mpro_internals.h +21 -0
  156. data/share/gccxml-0.9/MIPSpro/7.3/iomanip +161 -0
  157. data/share/gccxml-0.9/MIPSpro/7.3/ostream +9 -0
  158. data/share/gccxml-0.9/MIPSpro/7.3/stddef.h +9 -0
  159. data/share/gccxml-0.9/MIPSpro/7.3/stl_config.h +9 -0
  160. data/share/gccxml-0.9/MIPSpro/7.3/stl_locale.h +17 -0
  161. data/share/gccxml-0.9/MIPSpro/7.3/stl_monetary.h +14 -0
  162. data/share/gccxml-0.9/MIPSpro/7.3/stl_numeric_facets.h +13 -0
  163. data/share/gccxml-0.9/MIPSpro/7.3/stl_threads.h +11 -0
  164. data/share/gccxml-0.9/MIPSpro/7.3/string +18 -0
  165. data/share/gccxml-0.9/MIPSpro/find_flags +70 -0
  166. data/share/gccxml-0.9/MIPSpro/mipspro_defs.cxx +63 -0
  167. data/share/gccxml-0.9/Sun/5.8/Cstd.patch +156 -0
  168. data/share/gccxml-0.9/Sun/5.8/adapt_headers.sh +32 -0
  169. data/share/gccxml-0.9/Sun/5.8/std-5.10.patch +22 -0
  170. data/share/gccxml-0.9/Sun/README +8 -0
  171. data/share/gccxml-0.9/Sun/find_flags +51 -0
  172. data/share/gccxml-0.9/Sun/find_flags_common +42 -0
  173. data/share/gccxml-0.9/gccxml_config +2 -0
  174. data/share/gccxml-0.9/gccxml_identify_compiler.cc +13 -0
  175. data/share/man/man1/gccxml.1 +246 -0
  176. metadata +243 -0
@@ -0,0 +1,378 @@
1
+ // List implementation (out of line) -*- C++ -*-
2
+
3
+ // Copyright (C) 2001, 2002 Free Software Foundation, Inc.
4
+ //
5
+ // This file is part of the GNU ISO C++ Library. This library is free
6
+ // software; you can redistribute it and/or modify it under the
7
+ // terms of the GNU General Public License as published by the
8
+ // Free Software Foundation; either version 2, or (at your option)
9
+ // any later version.
10
+
11
+ // This library is distributed in the hope that it will be useful,
12
+ // but WITHOUT ANY WARRANTY; without even the implied warranty of
13
+ // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
+ // GNU General Public License for more details.
15
+
16
+ // You should have received a copy of the GNU General Public License along
17
+ // with this library; see the file COPYING. If not, write to the Free
18
+ // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
19
+ // USA.
20
+
21
+ // As a special exception, you may use this file as part of a free software
22
+ // library without restriction. Specifically, if other files instantiate
23
+ // templates or use macros or inline functions from this file, or you compile
24
+ // this file and link it with other files to produce an executable, this
25
+ // file does not by itself cause the resulting executable to be covered by
26
+ // the GNU General Public License. This exception does not however
27
+ // invalidate any other reasons why the executable file might be covered by
28
+ // the GNU General Public License.
29
+
30
+ /*
31
+ *
32
+ * Copyright (c) 1994
33
+ * Hewlett-Packard Company
34
+ *
35
+ * Permission to use, copy, modify, distribute and sell this software
36
+ * and its documentation for any purpose is hereby granted without fee,
37
+ * provided that the above copyright notice appear in all copies and
38
+ * that both that copyright notice and this permission notice appear
39
+ * in supporting documentation. Hewlett-Packard Company makes no
40
+ * representations about the suitability of this software for any
41
+ * purpose. It is provided "as is" without express or implied warranty.
42
+ *
43
+ *
44
+ * Copyright (c) 1996,1997
45
+ * Silicon Graphics Computer Systems, Inc.
46
+ *
47
+ * Permission to use, copy, modify, distribute and sell this software
48
+ * and its documentation for any purpose is hereby granted without fee,
49
+ * provided that the above copyright notice appear in all copies and
50
+ * that both that copyright notice and this permission notice appear
51
+ * in supporting documentation. Silicon Graphics makes no
52
+ * representations about the suitability of this software for any
53
+ * purpose. It is provided "as is" without express or implied warranty.
54
+ */
55
+
56
+ /** @file list.tcc
57
+ * This is an internal header file, included by other library headers.
58
+ * You should not attempt to use it directly.
59
+ */
60
+
61
+ #ifndef __GLIBCPP_INTERNAL_LIST_TCC
62
+ #define __GLIBCPP_INTERNAL_LIST_TCC
63
+
64
+ namespace std
65
+ {
66
+ template<typename _Tp, typename _Alloc>
67
+ void
68
+ _List_base<_Tp,_Alloc>::
69
+ __clear()
70
+ {
71
+ typedef _List_node<_Tp> _Node;
72
+ _Node* __cur = static_cast<_Node*>(this->_M_node->_M_next);
73
+ while (__cur != this->_M_node)
74
+ {
75
+ _Node* __tmp = __cur;
76
+ __cur = static_cast<_Node*>(__cur->_M_next);
77
+ _Destroy(&__tmp->_M_data);
78
+ _M_put_node(__tmp);
79
+ }
80
+ this->_M_node->_M_next = this->_M_node;
81
+ this->_M_node->_M_prev = this->_M_node;
82
+ }
83
+
84
+ template<typename _Tp, typename _Alloc>
85
+ typename list<_Tp,_Alloc>::iterator
86
+ list<_Tp,_Alloc>::
87
+ insert(iterator __position, const value_type& __x)
88
+ {
89
+ _Node* __tmp = _M_create_node(__x);
90
+ __tmp->_M_next = __position._M_node;
91
+ __tmp->_M_prev = __position._M_node->_M_prev;
92
+ __position._M_node->_M_prev->_M_next = __tmp;
93
+ __position._M_node->_M_prev = __tmp;
94
+ return __tmp;
95
+ }
96
+
97
+ template<typename _Tp, typename _Alloc>
98
+ typename list<_Tp,_Alloc>::iterator
99
+ list<_Tp,_Alloc>::
100
+ erase(iterator __position)
101
+ {
102
+ _List_node_base* __next_node = __position._M_node->_M_next;
103
+ _List_node_base* __prev_node = __position._M_node->_M_prev;
104
+ _Node* __n = static_cast<_Node*>(__position._M_node);
105
+ __prev_node->_M_next = __next_node;
106
+ __next_node->_M_prev = __prev_node;
107
+ _Destroy(&__n->_M_data);
108
+ _M_put_node(__n);
109
+ return iterator(static_cast<_Node*>(__next_node));
110
+ }
111
+
112
+ template<typename _Tp, typename _Alloc>
113
+ void
114
+ list<_Tp,_Alloc>::
115
+ resize(size_type __new_size, const value_type& __x)
116
+ {
117
+ iterator __i = begin();
118
+ size_type __len = 0;
119
+ for ( ; __i != end() && __len < __new_size; ++__i, ++__len)
120
+ ;
121
+ if (__len == __new_size)
122
+ erase(__i, end());
123
+ else // __i == end()
124
+ insert(end(), __new_size - __len, __x);
125
+ }
126
+
127
+ template<typename _Tp, typename _Alloc>
128
+ list<_Tp,_Alloc>&
129
+ list<_Tp,_Alloc>::
130
+ operator=(const list& __x)
131
+ {
132
+ if (this != &__x)
133
+ {
134
+ iterator __first1 = begin();
135
+ iterator __last1 = end();
136
+ const_iterator __first2 = __x.begin();
137
+ const_iterator __last2 = __x.end();
138
+ while (__first1 != __last1 && __first2 != __last2)
139
+ *__first1++ = *__first2++;
140
+ if (__first2 == __last2)
141
+ erase(__first1, __last1);
142
+ else
143
+ insert(__last1, __first2, __last2);
144
+ }
145
+ return *this;
146
+ }
147
+
148
+ template<typename _Tp, typename _Alloc>
149
+ void
150
+ list<_Tp,_Alloc>::
151
+ _M_fill_assign(size_type __n, const value_type& __val)
152
+ {
153
+ iterator __i = begin();
154
+ for ( ; __i != end() && __n > 0; ++__i, --__n)
155
+ *__i = __val;
156
+ if (__n > 0)
157
+ insert(end(), __n, __val);
158
+ else
159
+ erase(__i, end());
160
+ }
161
+
162
+ template<typename _Tp, typename _Alloc>
163
+ template <typename _InputIter>
164
+ void
165
+ list<_Tp,_Alloc>::
166
+ _M_assign_dispatch(_InputIter __first2, _InputIter __last2, __false_type)
167
+ {
168
+ iterator __first1 = begin();
169
+ iterator __last1 = end();
170
+ for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2)
171
+ *__first1 = *__first2;
172
+ if (__first2 == __last2)
173
+ erase(__first1, __last1);
174
+ else
175
+ insert(__last1, __first2, __last2);
176
+ }
177
+
178
+ template<typename _Tp, typename _Alloc>
179
+ void
180
+ list<_Tp,_Alloc>::
181
+ remove(const value_type& __value)
182
+ {
183
+ iterator __first = begin();
184
+ iterator __last = end();
185
+ while (__first != __last)
186
+ {
187
+ iterator __next = __first;
188
+ ++__next;
189
+ if (*__first == __value)
190
+ erase(__first);
191
+ __first = __next;
192
+ }
193
+ }
194
+
195
+ template<typename _Tp, typename _Alloc>
196
+ void
197
+ list<_Tp,_Alloc>::
198
+ unique()
199
+ {
200
+ iterator __first = begin();
201
+ iterator __last = end();
202
+ if (__first == __last) return;
203
+ iterator __next = __first;
204
+ while (++__next != __last)
205
+ {
206
+ if (*__first == *__next)
207
+ erase(__next);
208
+ else
209
+ __first = __next;
210
+ __next = __first;
211
+ }
212
+ }
213
+
214
+ template<typename _Tp, typename _Alloc>
215
+ void
216
+ list<_Tp,_Alloc>::
217
+ merge(list& __x)
218
+ {
219
+ // _GLIBCXX_RESOLVE_LIB_DEFECTS
220
+ // 300. list::merge() specification incomplete
221
+ if (this != &__x)
222
+ {
223
+ iterator __first1 = begin();
224
+ iterator __last1 = end();
225
+ iterator __first2 = __x.begin();
226
+ iterator __last2 = __x.end();
227
+ while (__first1 != __last1 && __first2 != __last2)
228
+ if (*__first2 < *__first1)
229
+ {
230
+ iterator __next = __first2;
231
+ _M_transfer(__first1, __first2, ++__next);
232
+ __first2 = __next;
233
+ }
234
+ else
235
+ ++__first1;
236
+ if (__first2 != __last2)
237
+ _M_transfer(__last1, __first2, __last2);
238
+ }
239
+ }
240
+
241
+ // FIXME put this somewhere else
242
+ inline void
243
+ __List_base_reverse(_List_node_base* __p)
244
+ {
245
+ _List_node_base* __tmp = __p;
246
+ do {
247
+ std::swap(__tmp->_M_next, __tmp->_M_prev);
248
+ __tmp = __tmp->_M_prev; // Old next node is now prev.
249
+ } while (__tmp != __p);
250
+ }
251
+
252
+ template<typename _Tp, typename _Alloc>
253
+ void
254
+ list<_Tp,_Alloc>::
255
+ sort()
256
+ {
257
+ // Do nothing if the list has length 0 or 1.
258
+ if (_M_node->_M_next != _M_node && _M_node->_M_next->_M_next != _M_node)
259
+ {
260
+ list __carry;
261
+ list __counter[64];
262
+ int __fill = 0;
263
+ while (!empty())
264
+ {
265
+ __carry.splice(__carry.begin(), *this, begin());
266
+ int __i = 0;
267
+ while(__i < __fill && !__counter[__i].empty())
268
+ {
269
+ __counter[__i].merge(__carry);
270
+ __carry.swap(__counter[__i++]);
271
+ }
272
+ __carry.swap(__counter[__i]);
273
+ if (__i == __fill) ++__fill;
274
+ }
275
+
276
+ for (int __i = 1; __i < __fill; ++__i)
277
+ __counter[__i].merge(__counter[__i-1]);
278
+ swap(__counter[__fill-1]);
279
+ }
280
+ }
281
+
282
+ template<typename _Tp, typename _Alloc>
283
+ template <typename _Predicate>
284
+ void
285
+ list<_Tp,_Alloc>::
286
+ remove_if(_Predicate __pred)
287
+ {
288
+ iterator __first = begin();
289
+ iterator __last = end();
290
+ while (__first != __last)
291
+ {
292
+ iterator __next = __first;
293
+ ++__next;
294
+ if (__pred(*__first)) erase(__first);
295
+ __first = __next;
296
+ }
297
+ }
298
+
299
+ template<typename _Tp, typename _Alloc>
300
+ template <typename _BinaryPredicate>
301
+ void
302
+ list<_Tp,_Alloc>::
303
+ unique(_BinaryPredicate __binary_pred)
304
+ {
305
+ iterator __first = begin();
306
+ iterator __last = end();
307
+ if (__first == __last) return;
308
+ iterator __next = __first;
309
+ while (++__next != __last)
310
+ {
311
+ if (__binary_pred(*__first, *__next))
312
+ erase(__next);
313
+ else
314
+ __first = __next;
315
+ __next = __first;
316
+ }
317
+ }
318
+
319
+ template<typename _Tp, typename _Alloc>
320
+ template <typename _StrictWeakOrdering>
321
+ void
322
+ list<_Tp,_Alloc>::
323
+ merge(list& __x, _StrictWeakOrdering __comp)
324
+ {
325
+ // _GLIBCXX_RESOLVE_LIB_DEFECTS
326
+ // 300. list::merge() specification incomplete
327
+ if (this != &__x)
328
+ {
329
+ iterator __first1 = begin();
330
+ iterator __last1 = end();
331
+ iterator __first2 = __x.begin();
332
+ iterator __last2 = __x.end();
333
+ while (__first1 != __last1 && __first2 != __last2)
334
+ if (__comp(*__first2, *__first1))
335
+ {
336
+ iterator __next = __first2;
337
+ _M_transfer(__first1, __first2, ++__next);
338
+ __first2 = __next;
339
+ }
340
+ else
341
+ ++__first1;
342
+ if (__first2 != __last2) _M_transfer(__last1, __first2, __last2);
343
+ }
344
+ }
345
+
346
+ template<typename _Tp, typename _Alloc>
347
+ template <typename _StrictWeakOrdering>
348
+ void
349
+ list<_Tp,_Alloc>::
350
+ sort(_StrictWeakOrdering __comp)
351
+ {
352
+ // Do nothing if the list has length 0 or 1.
353
+ if (_M_node->_M_next != _M_node && _M_node->_M_next->_M_next != _M_node)
354
+ {
355
+ list __carry;
356
+ list __counter[64];
357
+ int __fill = 0;
358
+ while (!empty())
359
+ {
360
+ __carry.splice(__carry.begin(), *this, begin());
361
+ int __i = 0;
362
+ while(__i < __fill && !__counter[__i].empty())
363
+ {
364
+ __counter[__i].merge(__carry, __comp);
365
+ __carry.swap(__counter[__i++]);
366
+ }
367
+ __carry.swap(__counter[__i]);
368
+ if (__i == __fill) ++__fill;
369
+ }
370
+
371
+ for (int __i = 1; __i < __fill; ++__i)
372
+ __counter[__i].merge(__counter[__i-1], __comp);
373
+ swap(__counter[__fill-1]);
374
+ }
375
+ }
376
+ } // namespace std
377
+
378
+ #endif /* __GLIBCPP_INTERNAL_LIST_TCC */