Your message dated Fri, 19 Aug 2005 15:17:07 -0700
with message-id <[EMAIL PROTECTED]>
and subject line Bug#311022: fixed in tulip 2.0.2-5
has caused the attached Bug report to be marked as done.
This means that you claim that the problem has been dealt with.
If this is not the case it is now your responsibility to reopen the
Bug report if necessary, and/or fix the problem forthwith.
(NB: If you are a system administrator and have no idea what I am
talking about this indicates a serious mail system misconfiguration
somewhere. Please contact me immediately.)
Debian bug tracking system administrator
(administrator, Debian Bugs database)
--------------------------------------
Received: (at submit) by bugs.debian.org; 27 May 2005 21:20:45 +0000
>From [EMAIL PROTECTED] Fri May 27 14:20:44 2005
Return-path: <[EMAIL PROTECTED]>
Received: from nash.numericable.net [80.236.3.115]
by spohr.debian.org with esmtp (Exim 3.35 1 (Debian))
id 1DbmG4-00049e-00; Fri, 27 May 2005 14:20:44 -0700
Received: (qmail 8121 invoked from network); 27 May 2005 21:20:07 -0000
Received: from unknown (HELO [192.168.1.2]) ([81.220.179.3])
(envelope-sender <[EMAIL PROTECTED]>)
by nash.numericable.net (qmail-ldap-1.03) with SMTP
for <[EMAIL PROTECTED]>; 27 May 2005 21:20:07 -0000
Message-ID: <[EMAIL PROTECTED]>
Date: Fri, 27 May 2005 23:20:12 +0200
From: =?ISO-8859-15?Q?Herv=E9_Cauwelier?= <[EMAIL PROTECTED]>
User-Agent: Mozilla Thunderbird 1.0.2 (X11/20050404)
X-Accept-Language: fr, en
MIME-Version: 1.0
To: [EMAIL PROTECTED]
Subject: Patches to build with g++ 4.0
X-Enigmail-Version: 0.90.0.0
X-Enigmail-Supports: pgp-inline, pgp-mime
Content-Type: multipart/mixed;
boundary="------------030802040503060604070302"
Delivered-To: [EMAIL PROTECTED]
X-Spam-Checker-Version: SpamAssassin 2.60-bugs.debian.org_2005_01_02
(1.212-2003-09-23-exp) on spohr.debian.org
X-Spam-Status: No, hits=-7.0 required=4.0 tests=BAYES_01,HAS_PACKAGE
autolearn=no version=2.60-bugs.debian.org_2005_01_02
X-Spam-Level:
This is a multi-part message in MIME format.
--------------030802040503060604070302
Content-Type: text/plain; charset=ISO-8859-15; format=flowed
Content-Transfer-Encoding: 8bit
Package: tulip
Version: 2.0.2-4
Please find enclosed the patches I used to make tulip build with g++ 4.0
on Ubuntu.
The patches are originally each in a file of their own. I merged them
for convenience.
Regards,
--
Hervé Cauwelier
--------------030802040503060604070302
Content-Type: text/plain;
name="10_g++4.0_build_failures"
Content-Transfer-Encoding: 7bit
Content-Disposition: inline;
filename="10_g++4.0_build_failures"
--- tulip-2.0.2/library/tulip/include/tulip/tulipconf.h~ 2005-05-17
21:20:18.600976712 +0200
+++ tulip-2.0.2/library/tulip/include/tulip/tulipconf.h 2005-05-17
21:21:19.368738608 +0200
@@ -8,7 +8,7 @@
#else
# define _DEPRECATED __attribute__ ((deprecated))
# define stdext __gnu_cxx
-# if (__GNUC_MINOR__ < 4)
+# if (__GNUC__ == 3) && (__GNUC_MINOR__ < 4)
# include <ext/stl_hash_fun.h>
# else
# include <ext/hash_fun.h>
--- tulip-2.0.2/library/tulip/src/AcyclicTest.cpp~ 2005-05-22
19:53:33.000000000 +0200
+++ tulip-2.0.2/library/tulip/src/AcyclicTest.cpp 2005-05-22
19:54:52.000000000 +0200
@@ -45,7 +45,7 @@
}
bool AcyclicTest::compute(SuperGraph *graph) {
- if (resultsBuffer.find((unsigned int)graph)!=resultsBuffer.end()) return
resultsBuffer[(unsigned int)graph];
+ if (resultsBuffer.find((unsigned long)graph)!=resultsBuffer.end()) return
resultsBuffer[(unsigned long)graph];
SelectionProxy
*visited=graph->getLocalProperty<SelectionProxy>("AcyclicTestVisited");
SelectionProxy
*finished=graph->getLocalProperty<SelectionProxy>("AcyclicTestFinished");
visited->setAllNodeValue(false);
@@ -60,7 +60,7 @@
graph->delLocalProperty("AcyclicTestVisited");
graph->delLocalProperty("AcyclicTestFinished");
delete it;
- resultsBuffer[(unsigned int)graph]=false;
+ resultsBuffer[(unsigned long)graph]=false;
graph->addObserver(this);
return false;
}
@@ -69,7 +69,7 @@
graph->delLocalProperty("AcyclicTestVisited");
graph->delLocalProperty("AcyclicTestFinished");
if (result==true) {
- resultsBuffer[(unsigned int)graph]=true;
+ resultsBuffer[(unsigned long)graph]=true;
graph->addObserver(this);
}
return true;
@@ -77,22 +77,22 @@
void AcyclicTest::destroy(SuperGraph *graph) {
graph->removeObserver(this);
- resultsBuffer.erase((unsigned int)graph);
+ resultsBuffer.erase((unsigned long)graph);
}
void AcyclicTest::reverseEdge(SuperGraph *graph,const edge e) {
graph->removeObserver(this);
- resultsBuffer.erase((unsigned int)graph);
+ resultsBuffer.erase((unsigned long)graph);
}
void AcyclicTest::addEdge(SuperGraph *graph,const edge e) {
- if (resultsBuffer[(unsigned int)graph]==false) return;
+ if (resultsBuffer[(unsigned long)graph]==false) return;
graph->removeObserver(this);
- resultsBuffer.erase((unsigned int)graph);
+ resultsBuffer.erase((unsigned long)graph);
}
void AcyclicTest::delEdge(SuperGraph *graph,const edge e) {
- if (resultsBuffer[(unsigned int)graph]==true) return;
+ if (resultsBuffer[(unsigned long)graph]==true) return;
graph->removeObserver(this);
- resultsBuffer.erase((unsigned int)graph);
+ resultsBuffer.erase((unsigned long)graph);
}
--- tulip-2.0.2/library/tulip/src/Biconnex.cpp~ 2004-11-30 08:12:12.000000000
+0100
+++ tulip-2.0.2/library/tulip/src/Biconnex.cpp 2005-05-22 18:40:35.342541968
+0200
@@ -66,8 +66,8 @@
}
//=================================================================
bool BiconnexTest::compute(SuperGraph *graph) {
- if (resultsBuffer.find((unsigned int)graph)!=resultsBuffer.end())
- return resultsBuffer[(unsigned int)graph];
+ if (resultsBuffer.find((unsigned long)graph)!=resultsBuffer.end())
+ return resultsBuffer[(unsigned long)graph];
graph->addObserver(this);
MutableContainer<bool> mark;
mark.setAll(false);
@@ -84,37 +84,37 @@
// cerr << "connected test" << endl;
result=false;
} //connected test
- resultsBuffer[(unsigned int)graph]=result;
+ resultsBuffer[(unsigned long)graph]=result;
return result;
}
//=================================================================
void BiconnexTest::addEdge(SuperGraph *graph,const edge) {
- if (resultsBuffer.find((unsigned int)graph)!=resultsBuffer.end())
- if (resultsBuffer[(unsigned int)graph]) return;
+ if (resultsBuffer.find((unsigned long)graph)!=resultsBuffer.end())
+ if (resultsBuffer[(unsigned long)graph]) return;
graph->removeObserver(this);
- resultsBuffer.erase((unsigned int)graph);
+ resultsBuffer.erase((unsigned long)graph);
}
//=================================================================
void BiconnexTest::delEdge(SuperGraph *graph,const edge) {
graph->removeObserver(this);
- resultsBuffer.erase((unsigned int)graph);
+ resultsBuffer.erase((unsigned long)graph);
}
//=================================================================
void BiconnexTest::reverseEdge(SuperGraph *graph,const edge) {
}
//=================================================================
void BiconnexTest::addNode(SuperGraph *graph,const node) {
- resultsBuffer[(unsigned int)graph]=false;
+ resultsBuffer[(unsigned long)graph]=false;
}
//=================================================================
void BiconnexTest::delNode(SuperGraph *graph,const node) {
graph->removeObserver(this);
- resultsBuffer.erase((unsigned int)graph);
+ resultsBuffer.erase((unsigned long)graph);
}
//=================================================================
void BiconnexTest::destroy(SuperGraph *graph) {
graph->removeObserver(this);
- resultsBuffer.erase((unsigned int)graph);
+ resultsBuffer.erase((unsigned long)graph);
}
//=================================================================
--- tulip-2.0.2/library/tulip-qt/src/DataSetDialog.cpp~ 2005-05-22
22:25:37.000000000 +0200
+++ tulip-2.0.2/library/tulip-qt/src/DataSetDialog.cpp 2005-05-22
22:28:12.000000000 +0200
@@ -102,7 +102,7 @@
while( it->hasNext() ) {
pair<string,DataType> p;
p = it->next();
- cout << p.first << " : " << int( p.second.value ) << endl;
+ cout << p.first << " : " << long( p.second.value ) << endl;
} delete it;
}
--- tulip-2.0.2/library/tulip/src/LayoutProxy.cpp~ 2005-05-22
20:46:32.000000000 +0200
+++ tulip-2.0.2/library/tulip/src/LayoutProxy.cpp 2005-05-22
20:47:43.000000000 +0200
@@ -14,7 +14,7 @@
//======================================================
LayoutProxy::LayoutProxy (SuperGraph
*graph):PropertyProxy<PointType,LineType,Layout>(graph) {
- minMaxOk[(int)superGraph]=false;
+ minMaxOk[(long)superGraph]=false;
}
//======================================================
LayoutProxy::~LayoutProxy() {
@@ -22,7 +22,7 @@
//======================================================
Coord LayoutProxy::getMax(SuperGraph *sg) {
if (sg==0) sg=superGraph;
- int sgi=(int)sg;
+ long sgi=(long)sg;
if (minMaxOk.find(sgi)==minMaxOk.end()) minMaxOk[sgi]=false;
if (!minMaxOk[sgi]) computeMinMax(sg);
return max[sgi];
@@ -30,7 +30,7 @@
//======================================================
Coord LayoutProxy::getMin(SuperGraph *sg) {
if (sg==0) sg=superGraph;
- int sgi=(int)sg;
+ long sgi=(long)sg;
if (minMaxOk.find(sgi)==minMaxOk.end()) minMaxOk[sgi]=false;
if (!minMaxOk[sgi]) computeMinMax(sg);
return min[sgi];
@@ -204,7 +204,7 @@
minZ <?= tmpCoord[2];
}
} delete itE;
- int sgi=(int)sg;
+ long sgi=(long)sg;
minMaxOk[sgi]=true;
min[sgi][0]=minX;
min[sgi][1]=minY;
--- tulip-2.0.2/library/tulip/src/MetricProxy.cpp~ 2005-05-22
20:55:21.000000000 +0200
+++ tulip-2.0.2/library/tulip/src/MetricProxy.cpp 2005-05-22
20:56:40.000000000 +0200
@@ -93,7 +93,7 @@
///Renvoie le minimum de la metrique associe aux noeuds du MetricProxy
double MetricProxy::getNodeMin(SuperGraph *sg) {
if (sg==0) sg=superGraph;
- int sgi=(int)sg;
+ long sgi=(long)sg;
if (minMaxOkNode.find(sgi)==minMaxOkNode.end()) minMaxOkNode[sgi]=false;
if (!minMaxOkNode[sgi]) computeMinMaxNode(sg);
return minN[sgi];
@@ -105,7 +105,7 @@
///Renvoie le maximum de la metrique associe aux noeuds du MetricProxy
double MetricProxy::getNodeMax(SuperGraph *sg) {
if (sg==0) sg=superGraph;
- int sgi=(int)sg;
+ long sgi=(long)sg;
if (minMaxOkNode.find(sgi)==minMaxOkNode.end()) minMaxOkNode[sgi]=false;
if (!minMaxOkNode[sgi]) computeMinMaxNode(sg);
return maxN[sgi];
@@ -117,7 +117,7 @@
///Renvoie le Minimum de la metrique associe aux aretes du MetricProxy
double MetricProxy::getEdgeMin(SuperGraph *sg) {
if (sg==0) sg=superGraph;
- int sgi=(int)sg;
+ long sgi=(long)sg;
if (minMaxOkEdge.find(sgi)==minMaxOkEdge.end()) minMaxOkEdge[sgi]=false;
if (!minMaxOkEdge[sgi]) computeMinMaxEdge(sg);
return minE[sgi];
@@ -126,7 +126,7 @@
///Renvoie le Maximum de la metrique associe aux aretes du MetricProxy
double MetricProxy::getEdgeMax(SuperGraph *sg) {
if (sg==0) sg=superGraph;
- int sgi=(int)sg;
+ long sgi=(long)sg;
if (minMaxOkEdge.find(sgi)==minMaxOkEdge.end()) minMaxOkEdge[sgi]=false;
if (!minMaxOkEdge[sgi]) computeMinMaxEdge(sg);
return maxE[sgi];
@@ -150,7 +150,7 @@
} delete itN;
if (sg==0) sg=superGraph;
- int sgi=(int)sg;
+ long sgi=(long)sg;
minMaxOkNode[sgi]=true;
minN[sgi]=minN2;
@@ -175,7 +175,7 @@
} delete itE;
if (sg==0) sg=superGraph;
- int sgi=(int)sg;
+ long sgi=(long)sg;
minMaxOkEdge[sgi]=true;
minE[sgi]=minE2;
--- tulip-2.0.2/library/tulip-ogl/include/tulip/ObservableGlGraph.h~
2005-05-22 21:31:54.000000000 +0200
+++ tulip-2.0.2/library/tulip-ogl/include/tulip/ObservableGlGraph.h
2005-05-22 21:32:11.000000000 +0200
@@ -25,7 +25,7 @@
template<>
struct less<GlGraphObserver *> {
size_t operator()(const GlGraphObserver * obs1,const GlGraphObserver
*obs2) const {
- return (unsigned)obs1<(unsigned)obs2;
+ return (unsigned long)obs1<(unsigned long)obs2;
}
};
}
--- tulip-2.0.2/library/tulip/include/tulip/ObservableGraph.h~ 2005-05-19
21:48:45.486480936 +0200
+++ tulip-2.0.2/library/tulip/include/tulip/ObservableGraph.h 2005-05-19
21:59:49.248573760 +0200
@@ -30,7 +30,7 @@
template <>
struct less<GraphObserver *> {
size_t operator()(const GraphObserver * obs1,const GraphObserver *obs2)
const {
- return (unsigned)obs1<(unsigned)obs2;
+ return (unsigned long)obs1<(unsigned long)obs2;
}
};
}
--- tulip-2.0.2/library/tulip/src/SimpleTest.cpp~ 2005-05-22
20:10:29.000000000 +0200
+++ tulip-2.0.2/library/tulip/src/SimpleTest.cpp 2005-05-22
20:11:08.000000000 +0200
@@ -38,8 +38,8 @@
}
//=================================================================
bool SimpleTest::compute(SuperGraph *graph) {
- if (resultsBuffer.find((unsigned int)graph) != resultsBuffer.end())
- return resultsBuffer[(unsigned int)graph];
+ if (resultsBuffer.find((unsigned long)graph) != resultsBuffer.end())
+ return resultsBuffer[(unsigned long)graph];
Iterator<node> *itNode = graph->getNodes();
while (itNode->hasNext ()) {
node current = itNode->next ();
@@ -62,23 +62,23 @@
}
//=================================================================
bool SimpleTest::setResult(SuperGraph *graph, bool result) {
- resultsBuffer[(unsigned int)graph] = result;
+ resultsBuffer[(unsigned long)graph] = result;
graph->addObserver(this);
return result;
}
//=================================================================
void SimpleTest::deleteResult(SuperGraph *graph) {
- resultsBuffer.erase((unsigned int)graph);
+ resultsBuffer.erase((unsigned long)graph);
graph->removeObserver(this);
}
//=================================================================
void SimpleTest::addEdge(SuperGraph *graph, const edge) {
- if (resultsBuffer[(unsigned int)graph] == true)
+ if (resultsBuffer[(unsigned long)graph] == true)
deleteResult(graph);
}
//=================================================================
void SimpleTest::delEdge(SuperGraph *graph, const edge) {
- if (resultsBuffer[(unsigned int)graph] == false)
+ if (resultsBuffer[(unsigned long)graph] == false)
deleteResult(graph);
}
//=================================================================
--- tulip-2.0.2/library/tulip/src/SizesProxy.cpp~ 2005-05-22
21:14:34.000000000 +0200
+++ tulip-2.0.2/library/tulip/src/SizesProxy.cpp 2005-05-22
21:15:44.000000000 +0200
@@ -46,7 +46,7 @@
//=============================================================================
Size SizesProxy::getMax(SuperGraph *sg) {
if (sg==0) sg=superGraph;
- int sgi=(int)sg;
+ long sgi=(long)sg;
if (minMaxOk.find(sgi)==minMaxOk.end()) minMaxOk[sgi]=false;
if (!minMaxOk[sgi]) computeMinMax(sg);
return max[sgi];
@@ -54,7 +54,7 @@
//=============================================================================
Size SizesProxy::getMin(SuperGraph *sg) {
if (sg==0) sg=superGraph;
- int sgi=(int)sg;
+ long sgi=(long)sg;
if (minMaxOk.find(sgi)==minMaxOk.end()) minMaxOk[sgi]=false;
if (!minMaxOk[sgi]) computeMinMax(sg);
return min[sgi];
@@ -80,7 +80,7 @@
minS[i] <?= tmpSize[i];
}
}delete itN;
- int sgi=(int)sg;
+ long sgi=(long)sg;
minMaxOk[sgi]=true;
min[sgi]=minS;
max[sgi]=maxS;
--- tulip-2.0.2/library/tulip/src/TreeTest.cpp~ 2005-05-22 19:15:37.000000000
+0200
+++ tulip-2.0.2/library/tulip/src/TreeTest.cpp 2005-05-22 19:16:36.000000000
+0200
@@ -22,9 +22,9 @@
bool TreeTest::compute(SuperGraph *graph) {
- if (resultsBuffer.find((unsigned int)graph)!=resultsBuffer.end()) return
resultsBuffer[(unsigned int)graph];
+ if (resultsBuffer.find((unsigned long)graph)!=resultsBuffer.end()) return
resultsBuffer[(unsigned long)graph];
if (graph->numberOfEdges()!=graph->numberOfNodes()-1) {
- resultsBuffer[(unsigned int)graph]=false;
+ resultsBuffer[(unsigned long)graph]=false;
graph->addObserver(this);
return false;
}
@@ -34,14 +34,14 @@
node tmp=it->next();
if (graph->indeg(tmp)>1) {
delete it;
- resultsBuffer[(unsigned int)graph]=false;
+ resultsBuffer[(unsigned long)graph]=false;
graph->addObserver(this);
return false;
}
if (graph->indeg(tmp)==0) {
if (rootNodeFound) {
delete it;
- resultsBuffer[(unsigned int)graph]=false;
+ resultsBuffer[(unsigned long)graph]=false;
graph->addObserver(this);
return false;
}
@@ -50,12 +50,12 @@
}
} delete it;
if (AcyclicTest::isAcyclic(graph)) {
- resultsBuffer[(unsigned int)graph]=true;
+ resultsBuffer[(unsigned long)graph]=true;
graph->addObserver(this);
return true;
}
else {
- resultsBuffer[(unsigned int)graph]=false;
+ resultsBuffer[(unsigned long)graph]=false;
graph->addObserver(this);
return false;
}
@@ -63,26 +63,26 @@
void TreeTest::addEdge(SuperGraph *graph,const edge) {
graph->removeObserver(this);
- resultsBuffer.erase((unsigned int)graph);
+ resultsBuffer.erase((unsigned long)graph);
}
void TreeTest::delEdge(SuperGraph *graph,const edge) {
graph->removeObserver(this);
- resultsBuffer.erase((unsigned int)graph);
+ resultsBuffer.erase((unsigned long)graph);
}
void TreeTest::reverseEdge(SuperGraph *graph,const edge) {
graph->removeObserver(this);
- resultsBuffer.erase((unsigned int)graph);
+ resultsBuffer.erase((unsigned long)graph);
}
void TreeTest::addNode(SuperGraph *graph,const node) {
graph->removeObserver(this);
- resultsBuffer.erase((unsigned int)graph);
+ resultsBuffer.erase((unsigned long)graph);
}
void TreeTest::delNode(SuperGraph *graph,const node) {
graph->removeObserver(this);
- resultsBuffer.erase((unsigned int)graph);
+ resultsBuffer.erase((unsigned long)graph);
}
void TreeTest::destroy(SuperGraph *graph) {
graph->removeObserver(this);
- resultsBuffer.erase((unsigned int)graph);
+ resultsBuffer.erase((unsigned long)graph);
}
--- tulip-2.0.2/software/Tulip/src/viewGl.cpp~ 2005-05-22 22:48:08.000000000
+0200
+++ tulip-2.0.2/software/Tulip/src/viewGl.cpp 2005-05-22 22:51:26.000000000
+0200
@@ -317,13 +317,13 @@
//**********************************************************************
void viewGl::fileSave() {
if (!glWidget) return;
- if (openFiles.find((unsigned int)glWidget)==openFiles.end() ||
- (openFiles[(unsigned int)glWidget] == "")) {
+ if (openFiles.find((unsigned long)glWidget)==openFiles.end() ||
+ (openFiles[(unsigned long)glWidget] == "")) {
SuperGraph *graph = glWidget->getSuperGraph()->getRoot();
fileSaveAs();
return;
}
- fileSave("tlp", openFiles[(unsigned int)glWidget]);
+ fileSave("tlp", openFiles[(unsigned long)glWidget]);
}
//**********************************************************************
bool viewGl::fileSave(string plugin, string filename) {
@@ -358,7 +358,7 @@
if (name == QString::null) return;
string filename = name.latin1();
if (fileSave("tlp",filename))
- openFiles[(unsigned int)glWidget]=filename;
+ openFiles[(unsigned long)glWidget]=filename;
}
//**********************************************************************
void viewGl::fileOpen() {
@@ -426,7 +426,7 @@
QWidget *win = windows.at(i);
if (typeid(*win)==typeid(NavigateGlGraph)) {
NavigateGlGraph *tmpNavigate = dynamic_cast<NavigateGlGraph *>(win);
- if(openFiles[((unsigned int)tmpNavigate->getGlGraphWidget())] ==
s.latin1()) {
+ if(openFiles[((unsigned long)tmpNavigate->getGlGraphWidget())] ==
s.latin1()) {
int answer = QMessageBox::question(this, "Open", "This file is
already opened. Do you want to load it anyway?",
QMessageBox::Yes,
QMessageBox::No);
if(answer == QMessageBox::No)
@@ -463,7 +463,7 @@
if (dataSet.get<DataSet>("displaying", glGraphData))
glW->getGlGraph()->setParameters(glGraphData);
if(noPlugin)
- openFiles[((unsigned int)glW)]=s.latin1();
+ openFiles[((unsigned long)glW)]=s.latin1();
QApplication::restoreOverrideCursor();
restoreView();
}
@@ -775,7 +775,7 @@
glWidget = tmpNavigate->getGlGraphWidget();
fileSave();
}
- treatedGraph.insert((unsigned int)superGraph);
+ treatedGraph.insert((unsigned long)superGraph);
}
}
}
@@ -787,7 +787,7 @@
set<unsigned int>::iterator iterator = treatedGraph.begin();
while(iterator != treatedGraph.end()) {
unsigned int currentGraph = *iterator;
- if(currentGraph == (unsigned int)graph)
+ if(currentGraph == (unsigned long)graph)
return true;
iterator++;
}
@@ -1081,8 +1081,8 @@
w->setSuperGraph(0);
}
- if (openFiles.find((unsigned int)w) != openFiles.end())
- openFiles.erase((unsigned int)w);
+ if (openFiles.find((unsigned long)w) != openFiles.end())
+ openFiles.erase((unsigned long)w);
if(w == glWidget) {
glWidget->setSuperGraph(0);
--------------030802040503060604070302--
---------------------------------------
Received: (at 311022-close) by bugs.debian.org; 19 Aug 2005 22:25:28 +0000
>From [EMAIL PROTECTED] Fri Aug 19 15:25:28 2005
Return-path: <[EMAIL PROTECTED]>
Received: from katie by spohr.debian.org with local (Exim 3.36 1 (Debian))
id 1E6FAh-0006On-00; Fri, 19 Aug 2005 15:17:07 -0700
From: Yann Dirson <[EMAIL PROTECTED]>
To: [EMAIL PROTECTED]
X-Katie: $Revision: 1.56 $
Subject: Bug#311022: fixed in tulip 2.0.2-5
Message-Id: <[EMAIL PROTECTED]>
Sender: Archive Administrator <[EMAIL PROTECTED]>
Date: Fri, 19 Aug 2005 15:17:07 -0700
Delivered-To: [EMAIL PROTECTED]
X-Spam-Checker-Version: SpamAssassin 2.60-bugs.debian.org_2005_01_02
(1.212-2003-09-23-exp) on spohr.debian.org
X-Spam-Level:
X-Spam-Status: No, hits=-6.0 required=4.0 tests=BAYES_00,HAS_BUG_NUMBER
autolearn=no version=2.60-bugs.debian.org_2005_01_02
Source: tulip
Source-Version: 2.0.2-5
We believe that the bug you reported is fixed in the latest version of
tulip, which is due to be installed in the Debian FTP archive:
libtulip-2.0-dev_2.0.2-5_i386.deb
to pool/main/t/tulip/libtulip-2.0-dev_2.0.2-5_i386.deb
libtulip-2.0_2.0.2-5_i386.deb
to pool/main/t/tulip/libtulip-2.0_2.0.2-5_i386.deb
libtulip-ogl-2.0-dev_2.0.2-5_i386.deb
to pool/main/t/tulip/libtulip-ogl-2.0-dev_2.0.2-5_i386.deb
libtulip-ogl-2.0_2.0.2-5_i386.deb
to pool/main/t/tulip/libtulip-ogl-2.0_2.0.2-5_i386.deb
libtulip-qt-2.0-dev_2.0.2-5_i386.deb
to pool/main/t/tulip/libtulip-qt-2.0-dev_2.0.2-5_i386.deb
libtulip-qt-2.0_2.0.2-5_i386.deb
to pool/main/t/tulip/libtulip-qt-2.0_2.0.2-5_i386.deb
tulip_2.0.2-5.diff.gz
to pool/main/t/tulip/tulip_2.0.2-5.diff.gz
tulip_2.0.2-5.dsc
to pool/main/t/tulip/tulip_2.0.2-5.dsc
tulip_2.0.2-5_i386.deb
to pool/main/t/tulip/tulip_2.0.2-5_i386.deb
A summary of the changes between this version and the previous one is
attached.
Thank you for reporting the bug, which will now be closed. If you
have further comments please address them to [EMAIL PROTECTED],
and the maintainer will reopen the bug report if appropriate.
Debian distribution maintenance software
pp.
Yann Dirson <[EMAIL PROTECTED]> (supplier of updated tulip package)
(This message was generated automatically at their request; if you
believe that there is a problem with it please contact the archive
administrators by mailing [EMAIL PROTECTED])
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
Format: 1.7
Date: Fri, 19 Aug 2005 21:47:07 +0200
Source: tulip
Binary: libtulip-qt-2.0-dev libtulip-2.0-dev libtulip-ogl-2.0 libtulip-2.0
libtulip-qt-2.0 libtulip-ogl-2.0-dev tulip
Architecture: source i386
Version: 2.0.2-5
Distribution: unstable
Urgency: low
Maintainer: Yann Dirson <[EMAIL PROTECTED]>
Changed-By: Yann Dirson <[EMAIL PROTECTED]>
Description:
libtulip-2.0 - Tulip graph library - core runtime
libtulip-2.0-dev - Tulip graph library - core development files
libtulip-ogl-2.0 - Tulip graph library - OpenGL runtime
libtulip-ogl-2.0-dev - Tulip graph library - OpenGL development files
libtulip-qt-2.0 - Tulip graph library - Qt/OpenGL gui runtime
libtulip-qt-2.0-dev - Tulip graph library - Qt/OpenGL gui development files
tulip - A system dedicated to the visualization of huge graphs
Closes: 311022
Changes:
tulip (2.0.2-5) unstable; urgency=low
.
* Rebuilt with g++-4.0.
* Incorporated patch to allow building with g++-4.0 from Hervé Cauwelier
(Closes: #311022). Added a missing empty line whose lack corrupted
the diff.
=> debian/patches/10_g++4.0_build_failures
* Fixed typo in all short descriptions, saying "Tulib" instead of "Tulip" !
* Removed use of included 3rd-party libraries already in Debian:
* Modified tulip-ogl Makefile to get ftgl location from configure
* Modified configure.in to allow external versions of all 3
third-party libs to be used.
=> debian/patches/60_thirdparty-external
* Regenerated 99_autotools.
* Build-depend on libgle3-dev, asked configure to use it; do not use
ftgl-dev since the API broke compatibility in the new version.
* Changed build-depend from old mesag3-dev to freeglut3-dev.
Files:
97c726a38e769e8607109e1661fa1db9 845 graphics optional tulip_2.0.2-5.dsc
33a9b3ba8e54a8a68ebdd62151a78d65 118179 graphics optional tulip_2.0.2-5.diff.gz
5a8069e086cf338debce74691fbbbe61 3873734 graphics optional
tulip_2.0.2-5_i386.deb
fc3512b6449b8901ee1fbc229a9c026d 322316 libs optional
libtulip-2.0_2.0.2-5_i386.deb
ef67c489710629495dbb9918c7341836 49968 libdevel optional
libtulip-2.0-dev_2.0.2-5_i386.deb
eab28e74f048103e49facfb1a0a2d291 254064 libs optional
libtulip-ogl-2.0_2.0.2-5_i386.deb
902fde1ac6006212d016d03db4e7392c 24918 libdevel optional
libtulip-ogl-2.0-dev_2.0.2-5_i386.deb
26da00ddbc9af19d954ad4ea0ff55939 222848 libs optional
libtulip-qt-2.0_2.0.2-5_i386.deb
c995193901887b0ef7fde43fa99fac85 17260 libdevel optional
libtulip-qt-2.0-dev_2.0.2-5_i386.deb
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.1 (GNU/Linux)
iD8DBQFDBleTV1uVslwzwbgRArqMAJ9cu6lFg9fTT5BXWV7b2eLFCN6JuACgnsuC
YZ0fxa5AD5GUd89huT47/Bs=
=bGkl
-----END PGP SIGNATURE-----
--
To UNSUBSCRIBE, email to [EMAIL PROTECTED]
with a subject of "unsubscribe". Trouble? Contact [EMAIL PROTECTED]
