Changeset 1805:d284f81f02a5 in lemon-0.x

Timestamp:

11/16/05 14:19:05 (18 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2348

Message:

Iterable Bool maps can count the number of true and false values.

File:

• lemon/iterable_maps.h (modified) (11 diffs)

lemon/iterable_maps.h

@@ -31 +31 @@
   
   ///\todo This is only a static map!
+  ///\todo Undocumented.
   ///\param BaseMap is an interger map.
   template<class BaseMap>
@@ -64 +65 @@
     ///\e
     void set(Key k,Value v) { if(v) setTrue(k); else setFalse(k);}
+    ///Number of \c true items in the map
+
+    ///Returns the number of \c true values in the map.
+    ///This is a constant time operation.
+    int countTrue() { return vals.size()-sep; }
+    ///Number of \c false items in the map
+
+    ///Returns the number of \c false values in the map.
+    ///This is a constant time operation.
+    int countFalse() { return sep; }
 
     ///\e
@@ -71 +82 @@
       int i;
     public:
+      ///\e
       explicit FalseIt(const IterableBoolMap &_M) : M(_M), i(0) { }
+      ///\e
       FalseIt(Invalid)
         : M(*((IterableBoolMap*)(0))), i(std::numeric_limits<int>::max()) { }
+      ///\e
       FalseIt &operator++() { ++i; return *this;}
+      ///\e
       operator Key() const { return i<M.sep ? M.vals[i] : INVALID; }
+      ///\e
       bool operator !=(Invalid) const { return i<M.sep; }
+      ///\e
       bool operator ==(Invalid) const { return i>=M.sep; }
     };
@@ -85 +102 @@
       int i;
     public:
+      ///\e
       explicit TrueIt(const IterableBoolMap &_M)
         : M(_M), i(M.vals.size()-1) { }
+      ///\e
       TrueIt(Invalid)
         : M(*((IterableBoolMap*)(0))), i(-1) { }
+      ///\e
       TrueIt &operator++() { --i; return *this;}
+      ///\e
       operator Key() const { return i>=M.sep ? M.vals[i] : INVALID; }
+      ///\e
       bool operator !=(Invalid) const { return i>=M.sep; }
+      ///\e
       bool operator ==(Invalid) const { return i<M.sep; }
     };
@@ -123 +146 @@
       if(init) sep=0;
     }
+    ///\e
     RefType operator[] (Key k) { return RefType(*this,k);}  
+    ///\e
     Value operator[] (Key k) const { return isTrue(k);}  
   };
@@ -164 +189 @@
     ///\e
     void set(Key k, bool v) { imap.set(k,v);}
+    ///Number of \c true items in the map
+
+    ///Returns the number of \c true values in the map.
+    ///This is a constant time operation.
+    int countTrue() { return imap.countTrue(); }
+    ///Number of \c false items in the map
+
+    ///Returns the number of \c false values in the map.
+    ///This is a constant time operation.
+    int countFalse() { return imap.countFalse(); }
 #ifdef DOXYGEN
     ///\e
@@ -177 +212 @@
     {
     public:
+      ///\e
       explicit FalseIt(const IterableBoolNodeMap &m)
         : BimType::FalseIt(m.imap) { }
+      ///\e
       FalseIt(Invalid i) : BimType::FalseIt(i) { }
     };
@@ -185 +222 @@
     {
     public:
+      ///\e
       explicit TrueIt(const IterableBoolNodeMap &m)
         : BimType::TrueIt(m.imap) { }
+      ///\e
       TrueIt(Invalid i) : BimType::TrueIt(i) { }
     };  
@@ -222 +261 @@
     ///\e
     void set(Key k, bool v) { imap.set(k,v);}
+    ///Returns the number of \c true values in the map.
+    ///This is a constant time operation.
+    int countTrue() { return imap.countTrue(); }
+    ///Number of \c false items in the map
+
+    ///Returns the number of \c false values in the map.
+    ///This is a constant time operation.
+    int countFalse() { return imap.countFalse(); }
 #ifdef DOXYGEN
     ///\e
@@ -235 +282 @@
     {
     public:
+      ///\e
       explicit FalseIt(const IterableBoolEdgeMap &m)
         : BimType::FalseIt(m.imap) { }
+      ///\e
       FalseIt(Invalid i) : BimType::FalseIt(i) { }
     };
@@ -243 +292 @@
     {
     public:
+      ///\e
       explicit TrueIt(const IterableBoolEdgeMap &m)
         : BimType::TrueIt(m.imap) { }
+      ///\e
       TrueIt(Invalid i) : BimType::TrueIt(i) { }
     };