RegionInfo.h

Go to the documentation of this file.

// -*- mode: c++; indent-tabs-mode: nil; c-basic-offset: 4; coding: iso-8859-1; -*-

/*
ACT-CV - Machine Vision for Cognitive Modeling
Copyright (c) 2013 Marc Halbruegge

This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
*/

#pragma once

#include <string>

struct RegionInfo {
    int left;
    int top;
    int right;
    int bottom;
    
    std::string info;

    RegionInfo(int l=0, int t=0, int r=0, int b=0, const std::string& i="")
        : left(l),
          top(t),
          right(r),
          bottom(b),
          info(i)
    {}

    bool operator<(const RegionInfo &b) const {
        if(left < b.left) return true;
        else if(b.left < left) return false;
        if(top < b.top) return true;
        else if(b.top < top) return false;
        if(right < b.right) return true;
        else if(b.right < right) return false;
        if(bottom < b.bottom) return true;
        else if(b.bottom < bottom) return false;
        if(info < b.info) return true;
        else if(b.info < info) return false;
           
        return false;
    }

    bool operator==(const RegionInfo &b) const {
        return left == b.left
            && top == b.top
            && right == b.right
            && bottom == b.bottom
            && info == b.info;
    }

};

static std::ostream& operator << (std::ostream& o, const RegionInfo& info) {
    o << info.left << " "
        << info.top << " "
        << info.right << " "
        << info.bottom << " "
        << info.info;
    return o;
}