f98f52441b
- Incorporate debian patches to fix build with gcc3 PR: ports/86058 Submitted by: Geoffrey Mainland <mainland@apeiron.net> Approved by: Mathis Picker <Mathias.Picker@gmx.de> (maintainer)
31 lines
1 KiB
C++
31 lines
1 KiB
C++
--- ./platform/emulator/libfd/complalldist.hh.orig Fri May 16 06:18:42 2003
|
|
+++ ./platform/emulator/libfd/complalldist.hh Sat Sep 3 18:46:08 2005
|
|
@@ -9,8 +9,8 @@
|
|
* Organization or Person (Year(s))
|
|
*
|
|
* Last change:
|
|
- * $Date: 2003/05/16 10:18:42 $ by $Author: duchier $
|
|
- * $Revision: 1.16 $
|
|
+ * $Date: 2005/01/30 10:41:43 $ by $Author: glynn $
|
|
+ * $Revision: 1.16.8.1 $
|
|
*
|
|
* This file is part of Mozart, an implementation
|
|
* of Oz 3:
|
|
@@ -213,7 +213,7 @@
|
|
#endif
|
|
}
|
|
|
|
- list<T> (list<T> &E) :generic() {
|
|
+ list<T> (const list<T> &E) :generic() {
|
|
dlink<T> *p = E.root;
|
|
dlink<T> *q = NULL;
|
|
dlink<T> *r = NULL;
|
|
@@ -873,7 +873,7 @@
|
|
|
|
/* ------------------------------------------------------------------------ */
|
|
|
|
-inline list<edge> graph::MAX_CARD_BIPARTITE_MATCHING(const list<node>& A,
|
|
+ inline list<edge> graph::MAX_CARD_BIPARTITE_MATCHING(const list<node>& A,
|
|
const list<node>& B ) {
|
|
|
|
// G is a bipartite graph with sides A and B, all edges must be directed
|