diff options
Diffstat (limited to 'sca-cpp/trunk/kernel/list.hpp')
-rw-r--r-- | sca-cpp/trunk/kernel/list.hpp | 210 |
1 files changed, 80 insertions, 130 deletions
diff --git a/sca-cpp/trunk/kernel/list.hpp b/sca-cpp/trunk/kernel/list.hpp index d3736de62c..16a0649fe9 100644 --- a/sca-cpp/trunk/kernel/list.hpp +++ b/sca-cpp/trunk/kernel/list.hpp @@ -43,16 +43,16 @@ long countILists = 0; long countCLists = 0; long countELists = 0; -bool resetListCounters() { +inline const bool resetListCounters() { countLists = countILists = countCLists = countELists = 0; return true; } -bool checkListCounters() { +inline const bool checkListCounters() { return countLists == 0; } -bool printListCounters() { +inline const bool printListCounters() { cout << "countLists " << countLists << endl; cout << "countELists " << countELists << endl; cout << "countILists " << countILists << endl; @@ -91,19 +91,19 @@ bool printListCounters() { template<typename T> class list { public: - list() { + inline list() : car() { debug_inc(countLists); debug_inc(countELists); debug_watchList(); } - list(const T car, const lambda<list<T>()>& cdr) : car(car), cdr(cdr) { + inline list(const T& car, const lambda<list<T>()>& cdr) : car(car), cdr(cdr) { debug_inc(countLists); debug_inc(countILists); debug_watchList(); } - list(const list& p) : car(p.car), cdr(p.cdr) { + inline list(const list& p) : car(p.car), cdr(p.cdr) { debug_inc(countLists); debug_inc(countCLists); #ifdef WANT_MAINTAINER_WATCH @@ -111,22 +111,13 @@ public: #endif } - const list<T>& operator=(const list<T>& p) { - if(this == &p) - return *this; - car = p.car; - cdr = p.cdr; -#ifdef WANT_MAINTAINER_WATCH - watch = p.watch; -#endif - return *this; - } + list<T>& operator=(const list<T>& p) = delete; - ~list() { + inline ~list() { debug_dec(countLists); } - const bool operator==(const list<T>& p) const { + inline const bool operator==(const list<T>& p) const { if(this == &p) return true; if(isNil(cdr)) @@ -140,7 +131,7 @@ public: return cdr() == p.cdr(); } - const bool operator<(const list<T>& p) const { + inline const bool operator<(const list<T>& p) const { if(this == &p) return false; if (isNil(cdr)) @@ -154,7 +145,7 @@ public: return cdr() < p.cdr(); } - const bool operator>(const list<T>& p) const { + inline const bool operator>(const list<T>& p) const { if(this == &p) return false; if (isNil(cdr)) @@ -168,11 +159,11 @@ public: return cdr() > p.cdr(); } - const bool operator!=(const list<T>& p) const { + inline const bool operator!=(const list<T>& p) const { return !this->operator==(p); } - operator const list<list<T> >() const { + inline operator const list<list<T> >() const { return (list<list<T> >)T(*this); } @@ -185,9 +176,10 @@ private: template<typename X> friend const bool isNil(const list<X>& p); template<typename X> friend const X car(const list<X>& p); template<typename X> friend const list<X> cdr(const list<X>& p); + template<typename X> friend const bool setlist(list<X>& target, const list<X>& l); - T car; - lambda<list<T>()> cdr; + const T car; + const lambda<list<T>()> cdr; }; #ifdef WANT_MAINTAINER_WATCH @@ -196,7 +188,7 @@ private: * Debug utility used to write the contents of a list to a string, easier * to watch than the list itself in a debugger. */ -template<typename T> const string watchList(const list<T>& p) { +template<typename T> inline const string watchList(const list<T>& p) { if(isNil(p)) return "()"; odebugstream os; @@ -209,21 +201,21 @@ template<typename T> const string watchList(const list<T>& p) { /** * Returns true if the given list is nil. */ -template<typename T> const bool isNil(const list<T>& p) { +template<typename T> inline const bool isNil(const list<T>& p) { return isNil(p.cdr); } /** * Write a list to an output stream. */ -template<typename T> ostream& writeHelper(ostream& out, const list<T>& l) { +template<typename T> inline ostream& writeHelper(ostream& out, const list<T>& l) { if (isNil(l)) return out; out << " " << car(l); return writeHelper(out, cdr(l)); } -template<typename T> ostream& operator<<(ostream& out, const list<T>& l) { +template<typename T> inline ostream& operator<<(ostream& out, const list<T>& l) { if(isNil(l)) return out << "()"; out << "(" << car(l); @@ -234,74 +226,74 @@ template<typename T> ostream& operator<<(ostream& out, const list<T>& l) { /** * Construct a (lazy) list from a value and a lambda function that returns the cdr. */ -template<typename T> const list<T> cons(const T& car, const lambda<list<T>()>& cdr) { +template<typename T> inline const list<T> cons(const T& car, const lambda<const list<T>()>& cdr) { return list<T> (car, cdr); } /** * Construct a list from a value and a cdr list. */ -template<typename T> const list<T> cons(const T& car, const list<T>& cdr) { +template<typename T> inline const list<T> cons(const T& car, const list<T>& cdr) { return list<T> (car, result(cdr)); } /** * Cons variations for use with the reduce and reduceRight functions. */ -template<typename T> const list<T> lcons(const list<T>& cdr, const T& car) { +template<typename T> inline const list<T> lcons(const list<T>& cdr, const T& car) { return cons<T>(car, cdr); } -template<typename T> const list<T> rcons(const T& car, const list<T>& cdr) { +template<typename T> inline const list<T> rcons(const T& car, const list<T>& cdr) { return cons<T>(car, cdr); } /** * Construct a list of one value. */ -template<typename T> const list<T> mklist(const T& car) { +template<typename T> inline const list<T> mklist(const T& car) { return list<T> (car, result(list<T> ())); } /** * Construct a list of two values. */ -template<typename T> const list<T> mklist(const T& a, const T& b) { +template<typename T> inline const list<T> mklist(const T& a, const T& b) { return cons(a, mklist(b)); } /** * Construct a list of three values. */ -template<typename T> const list<T> mklist(const T& a, const T& b, const T& c) { +template<typename T> inline const list<T> mklist(const T& a, const T& b, const T& c) { return cons(a, cons(b, mklist(c))); } /** * Construct a list of four values. */ -template<typename T> const list<T> mklist(const T& a, const T& b, const T& c, const T& d) { +template<typename T> inline const list<T> mklist(const T& a, const T& b, const T& c, const T& d) { return cons(a, cons(b, cons(c, mklist(d)))); } /** * Construct a list of five values. */ -template<typename T> const list<T> mklist(const T& a, const T& b, const T& c, const T& d, const T& e) { +template<typename T> inline const list<T> mklist(const T& a, const T& b, const T& c, const T& d, const T& e) { return cons(a, cons(b, cons(c, cons(d, mklist(e))))); } /** * Construct a list of six values. */ -template<typename T> const list<T> mklist(const T& a, const T& b, const T& c, const T& d, const T& e, const T& f) { +template<typename T> inline const list<T> mklist(const T& a, const T& b, const T& c, const T& d, const T& e, const T& f) { return cons(a, cons(b, cons(c, cons(d, cons(e, mklist(f)))))); } /** * Returns the car of a list. */ -template<typename T> const T car(const list<T>& p) { +template<typename T> inline const T car(const list<T>& p) { // Abort if trying to access the car of a nil list assertOrFail(!isNil(p.cdr)); return p.car; @@ -310,159 +302,144 @@ template<typename T> const T car(const list<T>& p) { /** * Returns the cdr of a list. */ -template<typename T> const list<T> cdr(const list<T>& p) { +template<typename T> inline const list<T> cdr(const list<T>& p) { return p.cdr(); } /** * Returns the car of the cdr (the 2nd element) of a list. */ -template<typename T> const T cadr(const list<T>& p) { +template<typename T> inline const T cadr(const list<T>& p) { return car(cdr(p)); } /** * Returns the 3rd element of a list. */ -template<typename T> const T caddr(const list<T>& p) { +template<typename T> inline const T caddr(const list<T>& p) { return car(cdr(cdr(p))); } /** * Returns the 4th element of a list. */ -template<typename T> const T cadddr(const list<T>& p) { +template<typename T> inline const T cadddr(const list<T>& p) { return car(cdr(cdr(cdr(p)))); } /** * Returns the 5th element of a list. */ -template<typename T> const T caddddr(const list<T>& p) { +template<typename T> inline const T caddddr(const list<T>& p) { return car(cdr(cdr(cdr(cdr(p))))); } /** * Returns the 6th element of a list. */ -template<typename T> const T cadddddr(const list<T>& p) { +template<typename T> inline const T cadddddr(const list<T>& p) { return car(cdr(cdr(cdr(cdr(cdr(p)))))); } /** * Returns the 7th element of a list. */ -template<typename T> const T caddddddr(const list<T>& p) { +template<typename T> inline const T caddddddr(const list<T>& p) { return car(cdr(cdr(cdr(cdr(cdr(cdr(p))))))); } /** * Returns the 8th element of a list. */ -template<typename T> const T cadddddddr(const list<T>& p) { +template<typename T> inline const T cadddddddr(const list<T>& p) { return car(cdr(cdr(cdr(cdr(cdr(cdr(cdr(p)))))))); } /** * Returns a list of elements from the 3rd to the end of a list. */ -template<typename T> const list<T> cddr(const list<T>& p) { +template<typename T> inline const list<T> cddr(const list<T>& p) { return cdr(cdr(p)); } /** * Returns a list of elements from the 4th to the end of a list. */ -template<typename T> const list<T> cdddr(const list<T>& p) { +template<typename T> inline const list<T> cdddr(const list<T>& p) { return cdr(cdr(cdr(p))); } /** * Returns a list of elements from the 5th to the end of a list. */ -template<typename T> const list<T> cddddr(const list<T>& p) { +template<typename T> inline const list<T> cddddr(const list<T>& p) { return cdr(cdr(cdr(cdr(p)))); } /** * Returns a list of elements from the 6th to the end of a list. */ -template<typename T> const list<T> cdddddr(const list<T>& p) { +template<typename T> inline const list<T> cdddddr(const list<T>& p) { return cdr(cdr(cdr(cdr(cdr(p))))); } /** * Returns a list of elements from the 7th to the end of a list. */ -template<typename T> const list<T> cddddddr(const list<T>& p) { +template<typename T> inline const list<T> cddddddr(const list<T>& p) { return cdr(cdr(cdr(cdr(cdr(cdr(p)))))); } /** * Returns a list of elements from the 8th to the end of a list. */ -template<typename T> const list<T> cdddddddr(const list<T>& p) { +template<typename T> inline const list<T> cdddddddr(const list<T>& p) { return cdr(cdr(cdr(cdr(cdr(cdr(cdr(p))))))); } /** * Returns the length of a list. */ -template<typename T> struct lengthRef { - const size_t operator()(const size_t c, const list<T>& p) { +template<typename T> inline const size_t length(const list<T>& p) { + const lambda<size_t(const size_t, const list<T>&)> lengthRef = [&lengthRef](const size_t c, const list<T>& p) -> const size_t { if(isNil(p)) return c; - return (*this)(c + 1, cdr(p)); - } -}; - -template<typename T> const size_t length(const list<T>& p) { - return lengthRef<T> ()(0, p); + return lengthRef(c + 1, cdr(p)); + }; + return lengthRef(0, p); } /** * Appends a list and a lambda function returning a list. */ -template<typename T> struct appendCdr { - const list<T> a; - const lambda<list<T>()> fb; - appendCdr(const list<T>& a, const lambda<list<T>()>& fb) : - a(a), fb(fb) { - } - const list<T> operator()() const { - return append(a, fb); - } -}; - -template<typename T> const list<T> append(const list<T>&a, const lambda<list<T>()>& fb) { +template<typename T> inline const list<T> append(const list<T>&a, const lambda<const list<T>()>& fb) { if(isNil(a)) return fb(); - - return cons<T>(car(a), appendCdr<T> (cdr(a), fb)); + return cons<T>(car(a), [a, fb]() { return append(cdr(a), fb); }); } /** * Appends two lists. */ -template<typename T> const list<T> append(const list<T>&a, const list<T>& b) { +template<typename T> inline const list<T> append(const list<T>&a, const list<T>& b) { return append(a, result(b)); } /** * Append a value to a list. */ -template<typename T> const list<T> operator+(const list<T>& l, const T& v) { +template<typename T> inline const list<T> operator+(const list<T>& l, const T& v) { return append(l, mklist(v)); } -template<typename T, typename V> const list<T> operator+(const list<T>& l, const V& v) { +template<typename T, typename V> const list<T> inline operator+(const list<T>& l, const V& v) { return append(l, mklist<T>(v)); } /** * Map a lambda function on a list. */ -template<typename T, typename R> const list<R> map(const lambda<R(const T)>& f, const list<T>& p) { +template<typename T, typename R> inline const list<R> map(const lambda<const R(const T)>& f, const list<T>& p) { if(isNil(p)) return list<R> (); return cons(f(car(p)), map(f, cdr(p))); @@ -471,46 +448,32 @@ template<typename T, typename R> const list<R> map(const lambda<R(const T)>& f, /** * Run a reduce lambda function on a list. */ -template<typename T, typename R> struct reduceAccumulate { - const lambda<R(const R&, const T&)> f; - reduceAccumulate(const lambda<R(const R, const T)>& f) : - f(f) { - } - R operator()(const R& acc, const list<T>& p) const { +template<typename T, typename R> inline const R reduce(const lambda<const R(const R, const T)>& f, const R& initial, const list<T>& p) { + const lambda<const R(const R&, const list<T>&p)> reduceAccumulate = [f, &reduceAccumulate](const R& acc, const list<T>& p) -> R { if(isNil(p)) return acc; - return (*this)(f(acc, car(p)), cdr(p)); - } -}; - -template<typename T, typename R> const R reduce(const lambda<R(const R, const T)>& f, const R& initial, const list<T>& p) { - return reduceAccumulate<T, R> (f)(initial, p); + return reduceAccumulate(f(acc, car(p)), cdr(p)); + }; + return reduceAccumulate(initial, p); } -template<typename T, typename R> struct reduceRightAccumulate { - const lambda<R(const T&, const R&)> f; - reduceRightAccumulate(const lambda<R(const T, const R)>& f) : - f(f) { - } - R operator()(const list<T>& p, const R& acc) const { +template<typename T, typename R> inline const R reduceRight(const lambda<const R(const T, const R)>& f, const R& initial, const list<T>& p) { + const lambda<const R(const list<T>&p, const R&)> reduceRightAccumulate = [f, &reduceRightAccumulate](const list<T>& p, const R& acc) -> R { if(isNil(p)) return acc; - return (*this)(cdr(p), f(car(p), acc)); - } -}; - -template<typename T, typename R> const R reduceRight(const lambda<R(const T, const R)>& f, const R& initial, const list<T>& p) { - return reduceRightAccumulate<T, R> (f)(p, initial); + return reduceRightAccumulate(cdr(p), f(car(p), acc)); + }; + return reduceRightAccumulate(p, initial); } /** * Run a filter lambda function on a list. */ -template<typename T> const list<T> filter(const lambda<bool(const T)>& f, const list<T>& p) { +template<typename T> inline const list<T> filter(const lambda<const bool(const T)>& f, const list<T>& p) { if(isNil(p)) return list<T> (); if(f(car(p))) { - const lambda<list<T>(const lambda<bool(const T)>, const list<T>)> ff(filter<T>); + const lambda<const list<T>(const lambda<const bool(const T)>, const list<T>)> ff(filter<T>); return cons(car(p), curry(ff, f, cdr(p))); } return filter(f, cdr(p)); @@ -519,7 +482,7 @@ template<typename T> const list<T> filter(const lambda<bool(const T)>& f, const /** * Returns a list pointing to a member of a list. */ -template<typename T> const list<T> member(const T& t, const list<T>& p) { +template<typename T> inline const list<T> member(const T& t, const list<T>& p) { if(isNil(p)) return list<T> (); if(t == car(p)) @@ -530,44 +493,31 @@ template<typename T> const list<T> member(const T& t, const list<T>& p) { /** * Reverse a list. */ -template<typename T> const list<T> reverseIter(const list<T>& acc, const list<T>& p) { +template<typename T> inline const list<T> reverseIter(const list<T>& acc, const list<T>& p) { if(isNil(p)) return acc; return reverseIter(cons(car(p), acc), cdr(p)); } -template<typename T> const list<T> reverse(const list<T>& p) { +template<typename T> inline const list<T> reverse(const list<T>& p) { return reverseIter(list<T> (), p); } -template<typename T> const list<T> seq(const T& start, const T& end); - -template<typename T> struct seqGenerate { - const T start; - const T end; - seqGenerate(const T& start, const T&end) : - start(start), end(end) { - } - const list<T> operator()() const { - return seq<T> (start, end); - } -}; - /** * Returns a sequence of values between the given bounds. */ -template<typename T> const list<T> seq(const T& start, const T& end) { +template<typename T> inline const list<T> seq(const T& start, const T& end) { if(start == end) return mklist(start); if(start < end) - return cons<T>(start, seqGenerate<T> (start + 1, end)); - return cons<T>(start, seqGenerate<T> (start - 1, end)); + return cons<T>(start, [start, end] { return seq<T> (start + 1, end); }); + return cons<T>(start, [start, end] { return seq<T> (start - 1, end); }); } /** * Returns the i-th element of a list. */ -template<typename T> const T listRef(const list<T>& l, const size_t i) { +template<typename T> inline const T listRef(const list<T>& l, const size_t i) { if (i == 0) return car(l); return listRef(cdr(l), i - 1); @@ -576,7 +526,7 @@ template<typename T> const T listRef(const list<T>& l, const size_t i) { /** * Returns the first pair matching a key from a list of key value pairs. */ -template<typename T> const list<T> assoc(const T& k, const list<list<T> >& p) { +template<typename T> inline const list<T> assoc(const T& k, const list<list<T> >& p) { if(isNil(p)) return list<T> (); if(k == car(car(p))) @@ -587,7 +537,7 @@ template<typename T> const list<T> assoc(const T& k, const list<list<T> >& p) { /** * Returns a list of lists containing elements from two input lists. */ -template<typename T> const list<list<T> > zip(const list<T>& a, const list<T>& b) { +template<typename T> inline const list<list<T> > zip(const list<T>& a, const list<T>& b) { if (isNil(a) || isNil(b)) return list<list<T> >(); return cons<list<T> >(mklist<T>(car(a), car(b)), zip(cdr(a), cdr(b))); @@ -596,19 +546,19 @@ template<typename T> const list<list<T> > zip(const list<T>& a, const list<T>& b /** * Converts a list of key value pairs to a list containing the list of keys and the list of values. */ -template<typename T> const list<T> unzipKeys(const list<list<T> >& l) { +template<typename T> inline const list<T> unzipKeys(const list<list<T> >& l) { if (isNil(l)) return list<T>(); return cons(car(car(l)), unzipKeys(cdr(l))); } -template<typename T> const list<T> unzipValues(const list<list<T> >& l) { +template<typename T> inline const list<T> unzipValues(const list<list<T> >& l) { if (isNil(l)) return list<T>(); return cons(cadr(car(l)), unzipValues(cdr(l))); } -template<typename T> const list<list<T> > unzip(const list<list<T> >& l) { +template<typename T> inline const list<list<T> > unzip(const list<list<T> >& l) { return mklist<list<T> >(unzipKeys(l), unzipValues(l)); } |