60 template<
class E>
class SListPure;
61 template<
class E>
class StackPure;
62 template<
class E>
class SListIterator;
63 template<
class E>
class SListConstIterator;
319 if (
pos-- == 0)
break;
330 if (
pos-- == 0)
break;
434 return (pBefore->
m_next = pNew);
514 #if (_MSC_VER == 1100)
546 for(p =
m_head; p; p = pNext) {
563 template<
class COMPARER>
590 if(*i == e)
return x;
595 template<
class COMPARER>
596 int search (
const E& e,
const COMPARER &comp)
const {
599 if(comp.equal(*i,e))
return x;
859 template<
class COMPARER>
892 template<
class COMPARER>
893 int search (
const E& e,
const COMPARER &comp)
const {
909 if (m_head == m_tail)
return;
931 if (m_head == m_tail)
return;
936 for (pX = m_head; pX; pX = pX->
m_next) {
939 tail[i] = (tail[i]->m_next = pX);
941 head[i] = tail[i] = pX;
945 for (
int i = l; i <= h; i++) {
970 for (pX = m_head; pX; pX = pX->
m_next)
975 for (i = 0; i < n; i++) {
976 A[i]->m_next = A[i+1];
990 for(++pX; pX.valid(); ++pX)
1004 ostream &operator<<(ostream &os, const SListPure<E> &L)
1011 ostream &operator<<(ostream &os, const SList<E> &L)
1022 if (a.
low() >= a.
high())
return;
1027 for(i = a.
low(); i <= a.
high(); ++i)
1028 bucket[f.
getBucket(a[i])].pushBack(a[i]);
1031 for(
int j = min; j <= max; ++j) {
1033 for(; it.
valid(); ++it)