bool Rect::Intersect(const Rect &r) const {
return
- (x() < (r.x()+r.w()) ) &&
- ( (x()+w()) > r.x()) &&
- (y() < (r.y()+r.h()) ) &&
- ( (y()+h()) > r.y());
+ (x() < (r.x()+(signed)r.w()) ) &&
+ ( (x()+(signed)w()) > r.x()) &&
+ (y() < (r.y()+(signed)r.h()) ) &&
+ ( (y()+(signed)h()) > r.y());
}
Rect Rect::Inflate(const unsigned int i) const {
sort(spaces.begin(),spaces.end(),colLRBT);
else
sort(spaces.begin(),spaces.end(),colRLBT);
- fprintf(stderr,"Spaces after sorting\n");
- for (siter=spaces.begin(); siter!=spaces.end(); ++siter)
- fprintf(stderr,"space(%d,%d)(%d,%d)\n",siter->x(),siter->y(),
- siter->x()+siter->w(),siter->y()+siter->h());
+
//Find first space that fits the window
best = NULL;
for (siter=spaces.begin(); siter!=spaces.end(); ++siter)