/* Copyright (C) 2013 Carl Hetherington 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include "types.h" #include "raw_convert.h" #include #include using std::max; using std::min; using std::string; using boost::shared_ptr; bool operator== (Crop const & a, Crop const & b) { return (a.left == b.left && a.right == b.right && a.top == b.top && a.bottom == b.bottom); } bool operator!= (Crop const & a, Crop const & b) { return !(a == b); } /** @param r Resolution. * @return Untranslated string representation. */ string resolution_to_string (Resolution r) { switch (r) { case RESOLUTION_2K: return "2K"; case RESOLUTION_4K: return "4K"; } DCPOMATIC_ASSERT (false); return ""; } Resolution string_to_resolution (string s) { if (s == "2K") { return RESOLUTION_2K; } if (s == "4K") { return RESOLUTION_4K; } DCPOMATIC_ASSERT (false); return RESOLUTION_2K; } Crop::Crop (shared_ptr node) { left = node->number_child ("LeftCrop"); right = node->number_child ("RightCrop"); top = node->number_child ("TopCrop"); bottom = node->number_child ("BottomCrop"); } void Crop::as_xml (xmlpp::Node* node) const { node->add_child("LeftCrop")->add_child_text (raw_convert (left)); node->add_child("RightCrop")->add_child_text (raw_convert (right)); node->add_child("TopCrop")->add_child_text (raw_convert (top)); node->add_child("BottomCrop")->add_child_text (raw_convert (bottom)); }