Your message dated Mon, 05 Sep 2005 09:02:09 -0700
with message-id <[EMAIL PROTECTED]>
and subject line Bug#297009: fixed in robotour 3.1.1-2
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; 26 Feb 2005 13:37:24 +0000
>From [EMAIL PROTECTED] Sat Feb 26 05:37:24 2005
Return-path: <[EMAIL PROTECTED]>
Received: from c186089.adsl.hansenet.de (localhost.localdomain) [213.39.186.89]
by spohr.debian.org with esmtp (Exim 3.35 1 (Debian))
id 1D528K-0006ug-00; Sat, 26 Feb 2005 05:37:24 -0800
Received: from aj by localhost.localdomain with local (Exim 4.44)
id 1D534T-0006C9-SJ; Sat, 26 Feb 2005 15:37:29 +0100
To: Debian Bug Tracking System <[EMAIL PROTECTED]>
From: Andreas Jochens <[EMAIL PROTECTED]>
Subject: robotour: FTBFS (amd64/gcc-4.0): 'len' was not declared in this scope
Message-Id: <[EMAIL PROTECTED]>
Date: Sat, 26 Feb 2005 15:37:29 +0100
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:
Package: robotour
Severity: normal
Tags: patch
When building 'robotour' on amd64 with gcc-4.0,
I get the following error:
rtcollect.templ.cpp: In member function 'void lrt::Vector<T>::insert(T, int)':
rtcollect.templ.cpp:232: error: 'len' was not declared in this scope
rtcollect.templ.cpp: In member function 'void lrt::Vector<T>::remove(int)':
rtcollect.templ.cpp:238: error: 'len' was not declared in this scope
rtcollect.templ.cpp: In member function 'void lrt::Vector<T>::remove(int, int)':
rtcollect.templ.cpp:244: error: 'len' was not declared in this scope
rtcollect.templ.cpp: In member function 'void lrt::Vector<T>::clear()':
rtcollect.templ.cpp:250: error: 'len' was not declared in this scope
rtcollect.templ.cpp: In member function 'int lrt::Vector<T>::check(int)':
rtcollect.templ.cpp:268: error: 'len' was not declared in this scope
rtcollect.templ.cpp:277: error: 'len' was not declared in this scope
rtcollect.templ.cpp:278: error: 'data' was not declared in this scope
rtcollect.templ.cpp:279: error: 'data' was not declared in this scope
make[3]: *** [rtsystem.o] Error 1
make[3]: Leaving directory `/robotour-3.1.0/libRT'
With the attached patch 'robotour' can be compiled
on amd64 using gcc-4.0.
Regards
Andreas Jochens
diff -urN ../tmp-orig/robotour-3.1.0/libRT/rtcollect.special.h
./libRT/rtcollect.special.h
--- ../tmp-orig/robotour-3.1.0/libRT/rtcollect.special.h 2004-02-19
19:13:02.000000000 +0000
+++ ./libRT/rtcollect.special.h 2005-02-26 14:18:35.000000000 +0000
@@ -85,7 +85,7 @@
inline T** const getData() const { return (T**) Array<void*>::getData(); }
inline void exchange(int p1, int p2) { Array<void*>::exchange(p1, p2); }
// inline void sort() { Array<void*>::sort(p1, p2); }
- inline void reverse() { Array<void*>::reverse(p1, p2); }
+ inline void reverse() { Array<void*>::reverse(this->p1, this->p2); }
// inline void sort(int (*compareFun)(const T&, const T&), int l = 0, int r
= Math::MAX_INT) { Array<void*>::sort((voidPtrCompareFunction)compareFun, l,
r); }
protected:
@@ -112,8 +112,8 @@
inline const T** getData() const { return (T**) Vector<void*>::getData(); }
inline void exchange(int p1, int p2) { Vector<void*>::exchange(p1, p2); }
-// inline void sort() { Vector<void*>::sort(p1, p2); }
- inline void reverse() { Vector<void*>::reverse(p1, p2); }
+// inline void sort() { Vector<void*>::sort(this->p1, this->p2); }
+ inline void reverse() { Vector<void*>::reverse(this->p1, this->p2); }
// inline void sort(int (*compareFun)(const T&, const T&), int l = 0, int r
= Math::MAX_INT) { Vector<void*>::sort((voidPtrCompareFunction)compareFun, l,
r); }
inline void insert(T* elem, int before) { Vector<void*>::insert((void*)
elem, before); }
diff -urN ../tmp-orig/robotour-3.1.0/libRT/rtcollect.templ.cpp
./libRT/rtcollect.templ.cpp
--- ../tmp-orig/robotour-3.1.0/libRT/rtcollect.templ.cpp 2003-12-05
17:10:38.000000000 +0000
+++ ./libRT/rtcollect.templ.cpp 2005-02-26 14:32:03.252736311 +0000
@@ -184,70 +184,70 @@
template<class T> Vector<T>::Vector(int length) : Array<T>(up2pow(length))
{
- capacity = len;
- len = length;
+ capacity = this->len;
+ this->len = length;
}
template<class T> Vector<T>::Vector(const Vector<T>& vect) :
Array<T>(vect.capacity)
{
- capacity = len;
- len = vect.len;
+ capacity = this->len;
+ this->len = vect.len;
copy(&vect, 0, this, 0, vect.len);
}
template<class T> const T& Vector<T>::operator[](int i) const
{
- return data[checkConst(i)];
+ return this->data[this->checkConst(i)];
}
template<class T> T& Vector<T>::operator[](int i)
{
- T& ret = data[check(i)];
- if(len <= i)
- len = i+1;
+ T& ret = this->data[check(i)];
+ if(this->len <= i)
+ this->len = i+1;
return ret;
}
template<class T> Vector<T>& Vector<T>::operator= (const Vector<T>& arr)
{
copy(&arr, 0, this, 0, arr.len);
- len = arr.len;
+ this->len = arr.len;
return *this;
}
template<class T> Vector<T>& Vector<T>::operator +=(const T &elem)
{
- (*this)[len] = elem;
+ (*this)[this->len] = elem;
return *this;
}
template<class T> Vector<T>& Vector<T>::operator += (const Array<T> &arr)
{
- copy(&arr, 0, this, len, arr.length());
+ copy(&arr, 0, this, this->len, arr.length());
return *this;
}
template<class T> void Vector<T>::insert(T elem, int before)
{
- copy(this, before, this, before + 1, len - before);
+ copy(this, before, this, before + 1, this->len - before);
(*this)[before] = elem;
}
template<class T> void Vector<T>::remove(int pos)
{
- copy(this, pos + 1, this, pos, len - (pos + 1));
- len--;
+ copy(this, pos + 1, this, pos, this->len - (pos + 1));
+ this->len--;
}
template<class T> void Vector<T>::remove(int start, int length)
{
- copy(this, start + length, this, start, len - (start + length));
- len -= length;
+ copy(this, start + length, this, start, this->len - (start + length));
+ this->len -= length;
}
template<class T> void Vector<T>::clear()
{
- len = 0;
+ this->len = 0;
}
template<class T> inline int Vector<T>::up2pow(int val)
@@ -265,7 +265,7 @@
String err = "Vector Index out of bounds: ";
err += i;
err += " > ";
- err += len;
+ err += this->len;
System::exit(-1, err);
}
#endif
@@ -274,10 +274,10 @@
// need growing
int newcap = up2pow(i+1);
T* newdata = new T[newcap];
- for(int j = 0; j < len; j++)
- newdata[j] = data[j];
- delete [] data;
- data = newdata;
+ for(int j = 0; j < this->len; j++)
+ newdata[j] = this->data[j];
+ delete [] this->data;
+ this->data = newdata;
capacity = newcap;
return i;
}
diff -urN ../tmp-orig/robotour-3.1.0/libRT/rtmap.h ./libRT/rtmap.h
--- ../tmp-orig/robotour-3.1.0/libRT/rtmap.h 2003-05-31 16:09:56.000000000
+0000
+++ ./libRT/rtmap.h 2005-02-26 14:31:34.354314240 +0000
@@ -145,7 +145,7 @@
StringMap(bool caseSensitive) :
Map<String,V>(&String::compare)
{
- if(!caseSensitive) compareFun = &String::compareIgnoreCase;
+ if(!caseSensitive) this->compareFun =
&String::compareIgnoreCase;
}
/** Creates a new StringMap, copying all the contents over from the
given map. */
StringMap(const StringMap& sm) : Map<String,V>(sm) {}
---------------------------------------
Received: (at 297009-close) by bugs.debian.org; 5 Sep 2005 16:10:43 +0000
>From [EMAIL PROTECTED] Mon Sep 05 09:10:43 2005
Return-path: <[EMAIL PROTECTED]>
Received: from katie by spohr.debian.org with local (Exim 3.36 1 (Debian))
id 1ECJQ9-0001Rs-00; Mon, 05 Sep 2005 09:02:09 -0700
From: Matej Vela <[EMAIL PROTECTED]>
To: [EMAIL PROTECTED]
X-Katie: $Revision: 1.56 $
Subject: Bug#297009: fixed in robotour 3.1.1-2
Message-Id: <[EMAIL PROTECTED]>
Sender: Archive Administrator <[EMAIL PROTECTED]>
Date: Mon, 05 Sep 2005 09:02:09 -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
X-CrossAssassin-Score: 2
Source: robotour
Source-Version: 3.1.1-2
We believe that the bug you reported is fixed in the latest version of
robotour, which is due to be installed in the Debian FTP archive:
robotour_3.1.1-2.diff.gz
to pool/main/r/robotour/robotour_3.1.1-2.diff.gz
robotour_3.1.1-2.dsc
to pool/main/r/robotour/robotour_3.1.1-2.dsc
robotour_3.1.1-2_i386.deb
to pool/main/r/robotour/robotour_3.1.1-2_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.
Matej Vela <[EMAIL PROTECTED]> (supplier of updated robotour 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: Mon, 5 Sep 2005 17:48:18 +0200
Source: robotour
Binary: robotour
Architecture: source i386
Version: 3.1.1-2
Distribution: unstable
Urgency: low
Maintainer: Debian QA Group <[EMAIL PROTECTED]>
Changed-By: Matej Vela <[EMAIL PROTECTED]>
Description:
robotour - Control mobile robots in this programmer's game
Closes: 297009 321185
Changes:
robotour (3.1.1-2) unstable; urgency=low
.
* QA upload.
* Package is orphaned (see #316770); set maintainer to Debian QA Group.
* Comply with scoping rules in gcc 4.0. Thanks to Andreas Jochens for
the patch. Closes: #297009.
* Rebuild with gcc 4.0. Closes: #321185.
* Enable wxWindows visualization.
* Include makehtml and kickbot.
* Move help files to /usr/share/robotour/help to allow browsing from
within robotour. Provide a symlink from /usr/share/doc/robotour.
* robotour/robotour.man: Remove misplaced escape.
* debian/copyright: Update FSF address.
* debian/robotour.1: Integrated upstream; remove.
* Conforms to Standards version 3.6.2.
Files:
0708330a53556b04eea6aebde2643bf8 586 games optional robotour_3.1.1-2.dsc
77ba22d107e233d2e809ea6cc45a28c7 13601 games optional robotour_3.1.1-2.diff.gz
7b9474cd6b8e95d6833109365b4e080e 631100 games optional
robotour_3.1.1-2_i386.deb
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.1 (GNU/Linux)
iD8DBQFDHGmOxBYivKllgY8RAmqxAJ4zHXMiNV9koIhoitGtmshUdtR8RACfWVVd
9tPhcyvhhWGRdg/grm0yJfQ=
=OvSg
-----END PGP SIGNATURE-----
--
To UNSUBSCRIBE, email to [EMAIL PROTECTED]
with a subject of "unsubscribe". Trouble? Contact [EMAIL PROTECTED]
