diff -r 096d83158d41 -r 81b47fc5c444 lemon/bucket_heap.h
--- a/lemon/bucket_heap.h	Fri Mar 02 17:56:22 2007 +0000
+++ b/lemon/bucket_heap.h	Fri Mar 02 18:04:28 2007 +0000
@@ -100,7 +100,7 @@
   private:
 
     void relocate_last(int idx) {
-      if (idx + 1 < (int)data.size()) {
+      if (idx + 1 < int(data.size())) {
 	data[idx] = data.back();
 	if (data[idx].prev != -1) {
 	  data[data[idx].prev].next = idx;
@@ -127,7 +127,7 @@
     }
 
     void lace(int idx) {
-      if ((int)first.size() <= data[idx].value) {
+      if (int(first.size()) <= data[idx].value) {
 	first.resize(data[idx].value + 1, -1);
       }
       data[idx].next = first[data[idx].value];
@@ -354,7 +354,7 @@
   private:
 
     void relocate_last(int idx) {
-      if (idx + 1 != (int)data.size()) {
+      if (idx + 1 != int(data.size())) {
 	data[idx] = data.back();
 	if (data[idx].prev != -1) {
 	  data[data[idx].prev].next = idx;
@@ -381,7 +381,7 @@
     }
 
     void lace(int idx) {
-      if ((int)first.size() <= data[idx].value) {
+      if (int(first.size()) <= data[idx].value) {
 	first.resize(data[idx].value + 1, -1);
       }
       data[idx].next = first[data[idx].value];
@@ -607,7 +607,7 @@
         data[idx].item = i;
       }
       index[i] = idx;
-      if (p >= (int)first.size()) first.resize(p + 1, -1);
+      if (p >= int(first.size())) first.resize(p + 1, -1);
       data[idx].next = first[p];
       first[p] = idx;
       if (p < minimal) {
@@ -750,7 +750,7 @@
         data[idx].item = i;
       }
       index[i] = idx;
-      if (p >= (int)first.size()) first.resize(p + 1, -1);
+      if (p >= int(first.size())) first.resize(p + 1, -1);
       data[idx].next = first[p];
       first[p] = idx;
       if (p > maximal) {