[Debtags-commits] [svn] r1192 - in tagcoll/trunk: debian tagcoll

[Benjamin Mesing]

Author: bmesing-guest
Date: Wed Aug 10 15:05:11 2005
New Revision: 1192

Modified:
   tagcoll/trunk/debian/control
   tagcoll/trunk/tagcoll/OpSet.h
Log:
Added build dependency to latex, dvips and gs
Updated documentation of OpSet


Modified: tagcoll/trunk/debian/control
==============================================================================
--- tagcoll/trunk/debian/control	(original)
+++ tagcoll/trunk/debian/control	Wed Aug 10 15:05:11 2005
@@ -1,7 +1,7 @@
 Source: tagcoll
 Priority: optional
 Maintainer: Enrico Zini <enrico at debian.org>
-Build-Depends: cdbs, debhelper (>> 4.1), dh-buildinfo, pkg-config, c++abi2-dev, cdbs, flex, bison, doxygen, graphviz, tdb-dev
+Build-Depends: cdbs, debhelper (>> 4.1), dh-buildinfo, pkg-config, c++abi2-dev, cdbs, flex, bison, doxygen, graphviz, latex, dvips, gs, tdb-dev, 
 Standards-Version: 3.6.2.0
 
 Package: tagcoll

Modified: tagcoll/trunk/tagcoll/OpSet.h
==============================================================================
--- tagcoll/trunk/tagcoll/OpSet.h	(original)
+++ tagcoll/trunk/tagcoll/OpSet.h	Wed Aug 10 15:05:11 2005
@@ -75,17 +75,21 @@
 	}
 	*/
 
-	// Return true if the tag set contains tag, else false
+	/** Return true if the tag set contains tag, else false */
 	bool contains(const T& item) const { return find(item) != end(); }
 
-	// Return true if the tag set contains ts, else false
+	/** Return true if the tag set contains ts, else false */
 	bool contains(const OpSet<T>& ts) const;
 
-	// Find the distance between two tagsets
-	// The distance between A and B is defined by infinity if the intersection
-	// between A and B is empty, else it is | (A + B) - (A ^ B) |
-	// That is, the cardinality of ((A <union> B) <difference> (A <intersection> B))
-	// Return -1 if the distance is infinity
+	/** 
+	 * @brief Calculates the distance between two tagsets.
+	 * 
+	 * The distance between A and B is defined by infinity if the 
+	 * intersection between A und B is empty, else it is 
+	 * \f$|(A \cup B) \setminus (A \cap B)|\f$
+	 * @returns the distance between the two tagsets or -1 if the distance 
+	 * is infinity
+	 */
 	int distance(const OpSet<T>& ts) const;
 
 	/**