68                              searcher->getShape()->getWidth(),searcher->getShape()->getDepth(),  in fulfilledBy()
70 …                        target->getShape()->getWidth(),target->getShape()->getDepth())  < distance;  in fulfilledBy()
103   int w = toint(searcher->getShape()->getWidth());  in fulfilledBy()
104   int d = toint(searcher->getShape()->getDepth());  in fulfilledBy()
133          node->x < cx + target->getShape()->getWidth() &&  in fulfilledBy()
134          node->y > cy - target->getShape()->getDepth();  in fulfilledBy()
419   for( int sx = 0; sx < creature->getShape()->getWidth(); sx++ ) {  in isBlocked()
420     for( int sy = 0; sy < creature->getShape()->getDepth(); sy++ ) {  in isBlocked()
421       if ( !creature->getShape()->isInside( sx, sy ) ) continue;  in isBlocked()
460 	return SDLHandler::intersects( aLast.x - a->getShape()->getWidth() / 2,   in isOutOfTheWay()
461                                  aLast.y - a->getShape()->getDepth() / 2,   in isOutOfTheWay()
462                                  a->getShape()->getWidth(),   in isOutOfTheWay()
463                                  a->getShape()->getDepth(),  in isOutOfTheWay()
464                                  bCurrent.x - b->getShape()->getWidth() / 2,   in isOutOfTheWay()
465                                  bCurrent.y - b->getShape()->getDepth() / 2,   in isOutOfTheWay()
466                                  b->getShape()->getWidth(),   in isOutOfTheWay()
467                                  b->getShape()->getDepth() );  in isOutOfTheWay()