/* Check if an area is fully on an other  */
bool lv_area_is_in(const lv_area_t *ain_p, const lv_area_t *aholder_p)
/* Check if an area is fully on an other  */
bool lv_area_is_in(const lv_area_t *ain_p, const lv_area_t *aholder_p)
{
    bool is_in = false;
    if(ain_p->x1  >= aholder_p->x1 &&
            ain_p->y1  >= aholder_p->y1 &&
            ain_p->x2  <= aholder_p->x2 &&
            ain_p->y2  <= aholder_p->y2) {
        is_in = true;
    }
    return is_in;
}