int priority = entity->priority() - next->priority();  if (priority > 0) { return false; } else if (priority < 0) { return true; } else { return false; }
return false;
inline bool insertBefore(cEntity *entity, cEntity *next) {	// y-axis is the strongest sorter	if (entity->y() != next->y()) {		return entity->y() < next->y();	} else if (entity->x() != next->x()) {        return entity->x() < next->x();		} else {		// Do in-cell sorting		int priority = entity->priority() - next->priority();			if (priority > 0) {			return false; // Our priority is higher than the next tile		} else if (priority < 0) {			return true; // Our priority is smaller, so sort before us.		} else {			return false; // If the priority is the same, tiles that come later, draw later		}	}}