66 const T& tail(const Dune::SLList<T,A>& alist)  in tail()  argument
69   Iterator tail=alist.begin();  in tail()
71   for(int i = alist.size() - 1; i > 0; --i)  in tail()
77 int check(const Dune::SLList<T,A>& alist, const T* vals)  in check()  argument
81   for(iterator iter = alist.begin(); iter != alist.end(); ++iter, i++) {  in check()
92 void randomizeListBack(Dune::SLList<T,A>& alist){  in randomizeListBack()  argument
103     alist.push_back(d);  in randomizeListBack()
107   check(alist, vals);  in randomizeListBack()
111 void randomizeListFront(Dune::SLList<T,A>& alist){  in randomizeListFront()  argument
121     alist.push_front(d);  in randomizeListFront()
125   check(alist, vals);  in randomizeListFront()
130   List alist, blist;  in testAssign()  local
132   alist.push_back(3);  in testAssign()
133   alist.push_back(4);  in testAssign()
134   alist.push_back(5);  in testAssign()
138   blist=alist;  in testAssign()
139   List::iterator biter=blist.begin(), aiter=alist.begin();  in testAssign()
140   for(; aiter!=alist.end(); ++aiter, ++biter)  in testAssign()
151   List alist;  in testDelete()  local
153   alist.push_back(3);  in testDelete()
154   alist.push_back(4);  in testDelete()
155   alist.push_back(5);  in testDelete()
157   List::ModifyIterator iter = alist.beginModify();  in testDelete()
159   if(*(alist.begin())!=4) {  in testDelete()
169   if(iter!=alist.end()) {  in testDelete()
173   if(tail(alist)!=4) {  in testDelete()
185   List alist;  in testEmpty()  local
186   if(!alist.empty()) {  in testEmpty()
191   if(0 != alist.size()) {  in testEmpty()
196   randomizeListBack(alist);  in testEmpty()
199   if(alist.empty()) {  in testEmpty()
204   if(0 == alist.size()) {  in testEmpty()
209   for(int elements=alist.size(); elements>0; --elements)  in testEmpty()
210     alist.pop_front();  in testEmpty()
212   if(!alist.empty()) {  in testEmpty()
217   if(0 != alist.size()) {  in testEmpty()
227   randomizeListFront(alist);  in testEmpty()
229   if(alist.empty()) {  in testEmpty()
234   if(0 == alist.size()) {  in testEmpty()
239   alist.clear();  in testEmpty()
241   if(!alist.empty()) {  in testEmpty()
246   if(0 != alist.size()) {  in testEmpty()
259   List alist;  in testInsert()  local
261   alist.push_back(3);  in testInsert()
262   List::ModifyIterator iter=alist.beginModify();  in testInsert()
271   if(*alist.begin()!=7) {  in testInsert()
276   iter=alist.beginModify();  in testInsert()
279   if(iter==alist.end() || *iter!=7) {  in testInsert()
284   if(*(alist.begin())!=5) {  in testInsert()
288   iter = alist.endModify();  in testInsert()
290   if(iter!=alist.end()) {  in testInsert()
298   if(iter != alist.end()) {  in testInsert()
303   if(tail(alist)!=20) {  in testInsert()
308   alist.clear();  in testInsert()
309   iter=alist.beginModify();  in testInsert()
311   if(iter!=alist.end()) {  in testInsert()
322   Dune::SLList<int,IntAllocator> alist;  in testPushPop()  local
325   if(alist.begin() != alist.end()) {  in testPushPop()
331   alist.push_back(1);  in testPushPop()
335   if(*(alist.begin())!=1) {  in testPushPop()
340   alist.push_back(2);  in testPushPop()
344   if(*(alist.begin())!=1) {  in testPushPop()
349   alist.push_front(3);  in testPushPop()
352   if(*(alist.begin())!=3) {  in testPushPop()
357   alist.pop_front();  in testPushPop()
361   if(*(alist.begin())!=1) {  in testPushPop()
363 …std::cerr<<"Entry should be 1, but is "<<*(alist.begin())<<"! Push back failed! "<<__FILE__<<":"<<…  in testPushPop()