{"text": "#ifndef BOOST_GEOMETRY_PROJECTIONS_VANDG2_HPP\n#define BOOST_GEOMETRY_PROJECTIONS_VANDG2_HPP\n\n// Boost.Geometry - extensions-gis-projections (based on PROJ4)\n// This file is automatically generated. DO NOT EDIT.\n\n// Copyright (c) 2008-2015 Barend Gehrels, Amsterdam, the Netherlands.\n\n// Use, modification and distribution is subject to the Boost Software License,\n// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at\n// http://www.boost.org/LICENSE_1_0.txt)\n\n// This file is converted from PROJ4, http://trac.osgeo.org/proj\n// PROJ4 is originally written by Gerald Evenden (then of the USGS)\n// PROJ4 is maintained by Frank Warmerdam\n// PROJ4 is converted to Boost.Geometry by Barend Gehrels\n\n// Last updated version of proj: 4.9.1\n\n// Original copyright notice:\n\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the \"Software\"),\n// to deal in the Software without restriction, including without limitation\n// the rights to use, copy, modify, merge, publish, distribute, sublicense,\n// and/or sell copies of the Software, and to permit persons to whom the\n// Software is furnished to do so, subject to the following conditions:\n\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n// DEALINGS IN THE SOFTWARE.\n\n#include \n\n#include \n#include \n#include \n#include \n\nnamespace boost { namespace geometry { namespace projections\n{\n #ifndef DOXYGEN_NO_DETAIL\n namespace detail { namespace vandg2\n {\n\n static const double TOL = 1e-10;\n static const double TWORPI = 0.63661977236758134308;\n\n struct par_vandg2\n {\n int vdg3;\n };\n\n // template class, using CRTP to implement forward/inverse\n template \n struct base_vandg2_spheroid : public base_t_f,\n Geographic, Cartesian, Parameters>\n {\n\n typedef double geographic_type;\n typedef double cartesian_type;\n\n par_vandg2 m_proj_parm;\n\n inline base_vandg2_spheroid(const Parameters& par)\n : base_t_f,\n Geographic, Cartesian, Parameters>(*this, par) {}\n\n // FORWARD(s_forward) spheroid\n // Project coordinates from geographic (lon, lat) to cartesian (x, y)\n inline void fwd(geographic_type& lp_lon, geographic_type& lp_lat, cartesian_type& xy_x, cartesian_type& xy_y) const\n {\n double x1, at, bt, ct;\n\n bt = fabs(TWORPI * lp_lat);\n if ((ct = 1. - bt * bt) < 0.)\n ct = 0.;\n else\n ct = sqrt(ct);\n if (fabs(lp_lon) < TOL) {\n xy_x = 0.;\n xy_y = geometry::math::pi() * (lp_lat < 0. ? -bt : bt) / (1. + ct);\n } else {\n at = 0.5 * fabs(geometry::math::pi() / lp_lon - lp_lon / geometry::math::pi());\n if (this->m_proj_parm.vdg3) {\n x1 = bt / (1. + ct);\n xy_x = geometry::math::pi() * (sqrt(at * at + 1. - x1 * x1) - at);\n xy_y = geometry::math::pi() * x1;\n } else {\n x1 = (ct * sqrt(1. + at * at) - at * ct * ct) /\n (1. + at * at * bt * bt);\n xy_x = geometry::math::pi() * x1;\n xy_y = geometry::math::pi() * sqrt(1. - x1 * (x1 + 2. * at) + TOL);\n }\n if ( lp_lon < 0.) xy_x = -xy_x;\n if ( lp_lat < 0.) xy_y = -xy_y;\n }\n }\n\n static inline std::string get_name()\n {\n return \"vandg2_spheroid\";\n }\n\n };\n\n // van der Grinten II\n template \n void setup_vandg2(Parameters& par, par_vandg2& proj_parm)\n {\n proj_parm.vdg3 = 0;\n }\n\n // van der Grinten III\n template \n void setup_vandg3(Parameters& par, par_vandg2& proj_parm)\n {\n proj_parm.vdg3 = 1;\n par.es = 0.;\n }\n\n }} // namespace detail::vandg2\n #endif // doxygen\n\n /*!\n \\brief van der Grinten II projection\n \\ingroup projections\n \\tparam Geographic latlong point type\n \\tparam Cartesian xy point type\n \\tparam Parameters parameter type\n \\par Projection characteristics\n - Miscellaneous\n - Spheroid\n - no inverse\n \\par Example\n \\image html ex_vandg2.gif\n */\n template \n struct vandg2_spheroid : public detail::vandg2::base_vandg2_spheroid\n {\n inline vandg2_spheroid(const Parameters& par) : detail::vandg2::base_vandg2_spheroid(par)\n {\n detail::vandg2::setup_vandg2(this->m_par, this->m_proj_parm);\n }\n };\n\n /*!\n \\brief van der Grinten III projection\n \\ingroup projections\n \\tparam Geographic latlong point type\n \\tparam Cartesian xy point type\n \\tparam Parameters parameter type\n \\par Projection characteristics\n - Miscellaneous\n - Spheroid\n - no inverse\n \\par Example\n \\image html ex_vandg3.gif\n */\n template \n struct vandg3_spheroid : public detail::vandg2::base_vandg2_spheroid\n {\n inline vandg3_spheroid(const Parameters& par) : detail::vandg2::base_vandg2_spheroid(par)\n {\n detail::vandg2::setup_vandg3(this->m_par, this->m_proj_parm);\n }\n };\n\n #ifndef DOXYGEN_NO_DETAIL\n namespace detail\n {\n\n // Factory entry(s)\n template \n class vandg2_entry : public detail::factory_entry\n {\n public :\n virtual projection* create_new(const Parameters& par) const\n {\n return new base_v_f, Geographic, Cartesian, Parameters>(par);\n }\n };\n\n template \n class vandg3_entry : public detail::factory_entry\n {\n public :\n virtual projection* create_new(const Parameters& par) const\n {\n return new base_v_f, Geographic, Cartesian, Parameters>(par);\n }\n };\n\n template \n inline void vandg2_init(detail::base_factory& factory)\n {\n factory.add_to_factory(\"vandg2\", new vandg2_entry);\n factory.add_to_factory(\"vandg3\", new vandg3_entry);\n }\n\n } // namespace detail\n #endif // doxygen\n\n}}} // namespace boost::geometry::projections\n\n#endif // BOOST_GEOMETRY_PROJECTIONS_VANDG2_HPP\n\n", "meta": {"hexsha": "b4ff3140b866b48d649f867539e9fa2abc23a697", "size": 8779, "ext": "hpp", "lang": "C++", "max_stars_repo_path": "3party/boost/boost/geometry/extensions/gis/projections/proj/vandg2.hpp", "max_stars_repo_name": "bowlofstew/omim", "max_stars_repo_head_hexsha": "8045157c95244aa8f862d47324df42a19b87e335", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": 1.0, "max_stars_repo_stars_event_min_datetime": "2019-01-11T05:02:05.000Z", "max_stars_repo_stars_event_max_datetime": "2019-01-11T05:02:05.000Z", "max_issues_repo_path": "3party/boost/boost/geometry/extensions/gis/projections/proj/vandg2.hpp", "max_issues_repo_name": "bowlofstew/omim", "max_issues_repo_head_hexsha": "8045157c95244aa8f862d47324df42a19b87e335", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "3party/boost/boost/geometry/extensions/gis/projections/proj/vandg2.hpp", "max_forks_repo_name": "bowlofstew/omim", "max_forks_repo_head_hexsha": "8045157c95244aa8f862d47324df42a19b87e335", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": 2.0, "max_forks_repo_forks_event_min_datetime": "2018-04-04T10:55:01.000Z", "max_forks_repo_forks_event_max_datetime": "2020-04-23T18:52:06.000Z", "avg_line_length": 40.8325581395, "max_line_length": 132, "alphanum_fraction": 0.6049663971, "num_tokens": 1998, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO\n\n", "lm_q1_score": 0.523420348936324, "lm_q2_score": 0.28457600421652673, "lm_q1q2_score": 0.14895287142591926}} {"text": "/*\n * This file is a part of the TChecker project.\n *\n * See files AUTHORS and LICENSE for copyright details.\n *\n */\n\n#ifndef TCHECKER_REFZG_SEMANTICS_HH\n#define TCHECKER_REFZG_SEMANTICS_HH\n\n#include \n\n#include \"tchecker/basictypes.hh\"\n#include \"tchecker/dbm/db.hh\"\n#include \"tchecker/variables/clocks.hh\"\n\n/*!\n \\file semantics.hh\n \\brief Operational semantics on DBMs with reference clocks\n */\n\nnamespace tchecker {\n\nnamespace refzg {\n\n/*!\n \\class semantics_t\n \\brief Semantics for zone graphs implemented by DBMs with reference clocks\n */\nclass semantics_t {\npublic:\n /*!\n \\brief Destructor\n */\n virtual ~semantics_t() = default;\n\n /*!\n \\brief Compute initial zone with reference clocks\n \\param rdbm : a DBM\n \\param r : reference clocks for rdbm\n \\param delay_allowed : set of reference clocks allowed to delay\n \\param invariant : invariant\n \\param spread : reference clocks spread\n \\pre rdbm is not nullptr (checked by assertion).\n rdbm is a r.size()*r.size() array of difference bounds.\n rdbm is tight and consistent.\n the size of delay_allowed is the number of reference clocks in r\n \\post dbm is the initial zone w.r.t. delay_allowed, invariant and spread\n \\return STATE_OK if the resulting DBM is not empty, other values if the\n resulting DBM is empty (see details in implementations)\n */\n virtual tchecker::state_status_t initial(tchecker::dbm::db_t * rdbm, tchecker::reference_clock_variables_t const & r,\n boost::dynamic_bitset<> const & delay_allowed,\n tchecker::clock_constraint_container_t const & invariant) = 0;\n\n /*!\n \\brief Compute next zone with reference clocks\n \\param rdbm : a DBM\n \\param r : reference clocks for rdbm\n \\param src_delay_allowed : set of reference clocks allowed to delay in source\n state\n \\param src_invariant : invariant in source state\n \\param sync_ref_clocks : set of reference clocks to synchronize\n \\param guard : transition guard\n \\param clkreset : transition reset\n \\param tgt_delay_allowed : set of reference clocks allowed to delay in target\n state\n \\param tgt_invariant : invariant in target state\n \\pre rdbm is not nullptr (checked by assertion).\n rdbm is a r.size()*r.size() array of difference bounds.\n rdbm is tight and consistent.\n the size of src_delay_allowed is the number of reference clocks in r.\n the size of sync_ref_clocks is the number of reference clocks in r.\n the size of tgt_delay_allowed is the number of reference clocks in r\n \\post rdbm has been updated to its strongest postcondition w.r.t. src_delay_allowed,\n src_invariant, sync_ref_clocks, guard, clkreset, tgt_delay_allowed and tgt_invariant\n \\return STATE_OK if the resulting DBM is not empty, other values if the resulting\n DBM is empty (see details in implementations)\n */\n virtual tchecker::state_status_t\n next(tchecker::dbm::db_t * rdbm, tchecker::reference_clock_variables_t const & r,\n boost::dynamic_bitset<> const & src_delay_allowed, tchecker::clock_constraint_container_t const & src_invariant,\n boost::dynamic_bitset<> const & sync_ref_clocks, tchecker::clock_constraint_container_t const & guard,\n tchecker::clock_reset_container_t const & clkreset, boost::dynamic_bitset<> const & tgt_delay_allowed,\n tchecker::clock_constraint_container_t const & tgt_invariant) = 0;\n};\n\n/*!\n\\class standard_semantics_t\n\\brief Standard semantics: each transition in the zone graph consists of a delay\n(if allowed) followed by a transition from the timed automaton\n*/\nclass standard_semantics_t final : public tchecker::refzg::semantics_t {\npublic:\n /*!\n \\brief Destructor\n */\n virtual ~standard_semantics_t() = default;\n\n /*!\n \\brief Compute initial zone with reference clocks\n \\param rdbm : a DBM\n \\param r : reference clocks for rdbm\n \\param delay_allowed : set of reference clocks allowed to delay\n \\param invariant : invariant\n \\pre rdbm is not nullptr (checked by assertion).\n rdbm is a r.size()*r.size() array of difference bounds.\n rdbm is tight and consistent.\n the size of delay_allowed is the number of reference clocks in r (checked\n by assertion)\n \\post rdbm is the zone that only containts the zero valuation\n \\return tchecker::STATE_OK if the resulting DBM is not empty. Otherwise,\n tchecker::STATE_CLOCKS_SRC_INVARIANT_VIOLATED if the zero valuation does not\n satisfy invariant.\n */\n virtual tchecker::state_status_t initial(tchecker::dbm::db_t * rdbm, tchecker::reference_clock_variables_t const & r,\n boost::dynamic_bitset<> const & delay_allowed,\n tchecker::clock_constraint_container_t const & invariant);\n\n /*!\n \\brief Compute next zone with reference clocks\n \\param rdbm : a DBM\n \\param r : reference clocks for dbm\n \\param src_delay_allowed : set of reference clocks allowed to delay in source\n state\n \\param src_invariant : invariant in source state\n \\param sync_ref_clocks : set of reference clocks to synchronize\n \\param guard : transition guard\n \\param clkreset : transition reset\n \\param tgt_delay_allowed : set of reference clocks allowed to delay in target\n state\n \\param tgt_invariant : invariant in target state\n \\pre rdbm is not nullptr (checked by assertion).\n rdbm is a r.size()*r.size() array of difference bounds.\n rdbm is not tight and consistent.\n the size of src_delay_allowed is the number of reference clocks in r\n (checked by assertion).\n The size of sync_ref_clocks is the number of reference clocks in r (checked by\n assertion).)\n The size of tgt_delay_allowed is the number of reference clocks in r (checked\n by assertion).\n \\post rdbm has been delayed (only reference clocks which are allowed in\n src_delay_allowed), then intersected with src_invariant, then all reference\n clocks in sync_ref_clocks have been synchronized in rdbm, then rdbm has been\n intersected with guard, then dbm has been reset w.r.t clkreset, then\n intersected with tgt_invariant\n \\return tchecker::STATE_OK if the resulting DBM is not empty. Otherwise,\n tchecker::STATE_CLOCKS_SRC_INVARIANT_VIOLATED if intersection with src_invariant\n result in an empty zone, tchecker::STATE_CLOCKS_SYNC_EMPTY if synchronization\n of reference clocks in sync_ref_clocks yield an empty zone,\n tchecker::STATE_CLOCKS_GUARD_VIOLATED if intersection with guard result in an\n empty zone, tchecker::STATE_EMPTY_SYNC if synchronization of reference clocks\n result in an empty zone, tchecker::STATE_CLOCKS_TGT_INVARIANT_VIOLATED if\n intersection with tgt_invariant result in an empty zone\n */\n virtual tchecker::state_status_t\n next(tchecker::dbm::db_t * rdbm, tchecker::reference_clock_variables_t const & r,\n boost::dynamic_bitset<> const & src_delay_allowed, tchecker::clock_constraint_container_t const & src_invariant,\n boost::dynamic_bitset<> const & sync_ref_clocks, tchecker::clock_constraint_container_t const & guard,\n tchecker::clock_reset_container_t const & clkreset, boost::dynamic_bitset<> const & tgt_delay_allowed,\n tchecker::clock_constraint_container_t const & tgt_invariant);\n};\n\n/*!\n\\class elapsed_semantics_t\n\\brief elapsed semantics: each transition in the zone graph consists of a\ntransition from the automaton, followed by a delay (if allowed)\n*/\nclass elapsed_semantics_t final : public tchecker::refzg::semantics_t {\npublic:\n /*!\n \\brief Destructor\n */\n virtual ~elapsed_semantics_t() = default;\n\n /*!\n \\brief Compute initial zone with reference clocks\n \\param rdbm : a DBM\n \\param r : reference clocks for rdbm\n \\param delay_allowed : set of reference clocks allowed to delay\n \\param invariant : invariant\n \\pre rdbm is not nullptr (checked by assertion).\n rdbm is a r.size()*r.size() array of difference bounds.\n rdbm is not tight and consistent.\n the size of delay_allowed is the number of reference clocks in r (checked\n by assertion))\n \\post rdbm is the zone that contains all the time successors of the zero\n valuation (for reference clocks that are allowed to delay in delay_allowed),\n and that satisfy invariant\n \\return tchecker::STATE_OK if the resulting DBM is not empty. Otherwise,\n tchecker::STATE_CLOCKS_SRC_INVARIANT_VIOLATED if the (time successors of the)\n zero valuation does not satisfy invariant.\n */\n virtual tchecker::state_status_t initial(tchecker::dbm::db_t * rdbm, tchecker::reference_clock_variables_t const & r,\n boost::dynamic_bitset<> const & delay_allowed,\n tchecker::clock_constraint_container_t const & invariant);\n\n /*!\n \\brief Compute next zone with reference clocks\n \\param rdbm : a DBM\n \\param r : reference clocks for rdbm\n \\param src_delay_allowed : set of reference clocks allowed to delay in source\n state\n \\param src_invariant : invariant in source state\n \\param sync_ref_clocks : set of reference clocks to synchronize\n \\param guard : transition guard\n \\param clkreset : transition reset\n \\param tgt_delay_allowed : set of reference clocks allowed to delay in target\n state\n \\param tgt_invariant : invariant in target state\n \\pre rdbm is not nullptr (checked by assertion).\n rdbm is a r.size()*r.size() array of difference bounds.\n rdbm is not tight and consistent.\n the size of src_delay_allowed is the number of reference clocks in r\n (checked by assertion).\n The size of sync_ref_clocks is the number of reference clocks in r (checked by\n assertion).)\n The size of tgt_delay_allowed is the number of reference clocks in r (checked\n by assertion).\n \\post rdbm has been intersected with src_invariant, then all reference clocks\n in sync_ref_clocks have been synchronized in rdbm, then rdbm has been\n intersected with guard, then rdbm has been reset w.r.t clkreset, then\n intersected with tgt_invariant, then rdbm has been delayed (only reference\n clocks that are allowed in tgt_delay_allowed) and intersected wth\n tgt_invariant again\n \\return tchecker::STATE_OK if the resulting DBM is not empty. Otherwise,\n tchecker::STATE_CLOCKS_SRC_INVARIANT_VIOLATED if intersection with src_invariant\n result in an empty zone, tchecker::STATE_CLOCKS_EMPTY_SYNC if synchronization\n of reference clocks in sync_ref_clocks yields an empty zone,\n tchecker::STATE_CLOCKS_GUARD_VIOLATED if intersection with guard result in an\n empty zone, tchecker::STATE_EMPTY_SYNC if synchronization of reference clocks\n result in an empty zone, tchecker::STATE_CLOCKS_TGT_INVARIANT_VIOLATED if\n intersection with tgt_invariant result in an empty zone\n */\n virtual tchecker::state_status_t\n next(tchecker::dbm::db_t * rdbm, tchecker::reference_clock_variables_t const & r,\n boost::dynamic_bitset<> const & src_delay_allowed, tchecker::clock_constraint_container_t const & src_invariant,\n boost::dynamic_bitset<> const & sync_ref_clocks, tchecker::clock_constraint_container_t const & guard,\n tchecker::clock_reset_container_t const & clkreset, boost::dynamic_bitset<> const & tgt_delay_allowed,\n tchecker::clock_constraint_container_t const & tgt_invariant);\n};\n\n/*!\n \\brief type of semantics\n*/\nenum semantics_type_t {\n STANDARD_SEMANTICS, /*!< see tchecker::refzg::standard_semantics_t */\n ELAPSED_SEMANTICS, /*!< see tchecker::refzg::elapsed_semantics_t */\n};\n\n/*!\n \\brief Zone semantics factory\n \\param semantics_type : type zone graph semantics\n \\return A zone semantics over DBMs with reference clocks of type semantics\n \\note the returned semantics must be deallocated by the caller\n \\throw std::invalid_argument : if semantics is unknown\n*/\ntchecker::refzg::semantics_t * semantics_factory(enum tchecker::refzg::semantics_type_t semantics_type);\n\n} // end of namespace refzg\n\n} // end of namespace tchecker\n\n#endif // TCHECKER_REFZG_SEMANTICS_HH\n", "meta": {"hexsha": "b14ea7df7dd71c7c29f51fc3d6c496750d96af8c", "size": 11836, "ext": "hh", "lang": "C++", "max_stars_repo_path": "include/tchecker/refzg/semantics.hh", "max_stars_repo_name": "mukherjee-sayan/tchecker", "max_stars_repo_head_hexsha": "c4f37a479a7273c15fc45ccb9741984e72036f2e", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "include/tchecker/refzg/semantics.hh", "max_issues_repo_name": "mukherjee-sayan/tchecker", "max_issues_repo_head_hexsha": "c4f37a479a7273c15fc45ccb9741984e72036f2e", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "include/tchecker/refzg/semantics.hh", "max_forks_repo_name": "mukherjee-sayan/tchecker", "max_forks_repo_head_hexsha": "c4f37a479a7273c15fc45ccb9741984e72036f2e", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 1.0, "max_forks_repo_forks_event_min_datetime": "2022-03-11T10:01:27.000Z", "max_forks_repo_forks_event_max_datetime": "2022-03-11T10:01:27.000Z", "avg_line_length": 44.6641509434, "max_line_length": 119, "alphanum_fraction": 0.7550692802, "num_tokens": 2876, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO\n\n", "lm_q1_score": 0.5544704649604273, "lm_q2_score": 0.26588047891687405, "lm_q1q2_score": 0.14742287276894023}} {"text": "// Boost.Geometry - gis-projections (based on PROJ4)\r\n\r\n// Copyright (c) 2008-2015 Barend Gehrels, Amsterdam, the Netherlands.\r\n\r\n// This file was modified by Oracle on 2017, 2018.\r\n// Modifications copyright (c) 2017-2018, Oracle and/or its affiliates.\r\n// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle.\r\n\r\n// Use, modification and distribution is subject to the Boost Software License,\r\n// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at\r\n// http://www.boost.org/LICENSE_1_0.txt)\r\n\r\n// This file is converted from PROJ4, http://trac.osgeo.org/proj\r\n// PROJ4 is originally written by Gerald Evenden (then of the USGS)\r\n// PROJ4 is maintained by Frank Warmerdam\r\n// PROJ4 is converted to Boost.Geometry by Barend Gehrels\r\n\r\n// Last updated version of proj: 5.0.0\r\n\r\n// Original copyright notice:\r\n\r\n// Permission is hereby granted, free of charge, to any person obtaining a\r\n// copy of this software and associated documentation files (the \"Software\"),\r\n// to deal in the Software without restriction, including without limitation\r\n// the rights to use, copy, modify, merge, publish, distribute, sublicense,\r\n// and/or sell copies of the Software, and to permit persons to whom the\r\n// Software is furnished to do so, subject to the following conditions:\r\n\r\n// The above copyright notice and this permission notice shall be included\r\n// in all copies or substantial portions of the Software.\r\n\r\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\r\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\r\n// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\r\n// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\r\n// DEALINGS IN THE SOFTWARE.\r\n\r\n#ifndef BOOST_GEOMETRY_PROJECTIONS_IGH_HPP\r\n#define BOOST_GEOMETRY_PROJECTIONS_IGH_HPP\r\n\r\n#include \r\n#include \r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nnamespace boost { namespace geometry\r\n{\r\n\r\nnamespace projections\r\n{\r\n #ifndef DOXYGEN_NO_DETAIL\r\n namespace detail { namespace igh\r\n {\r\n // TODO: consider replacing dynamically created projections\r\n // with member objects\r\n template \r\n struct par_igh\r\n {\r\n boost::shared_ptr > pj[12];\r\n T dy0;\r\n };\r\n\r\n /* 40d 44' 11.8\" [degrees] */\r\n template \r\n inline T d4044118() { return (T(40) + T(44)/T(60.) + T(11.8)/T(3600.)) * geometry::math::d2r(); }\r\n\r\n template \r\n inline T d10() { return T(10) * geometry::math::d2r(); }\r\n template \r\n inline T d20() { return T(20) * geometry::math::d2r(); }\r\n template \r\n inline T d30() { return T(30) * geometry::math::d2r(); }\r\n template \r\n inline T d40() { return T(40) * geometry::math::d2r(); }\r\n template \r\n inline T d50() { return T(50) * geometry::math::d2r(); }\r\n template \r\n inline T d60() { return T(60) * geometry::math::d2r(); }\r\n template \r\n inline T d80() { return T(80) * geometry::math::d2r(); }\r\n template \r\n inline T d90() { return T(90) * geometry::math::d2r(); }\r\n template \r\n inline T d100() { return T(100) * geometry::math::d2r(); }\r\n template \r\n inline T d140() { return T(140) * geometry::math::d2r(); }\r\n template \r\n inline T d160() { return T(160) * geometry::math::d2r(); }\r\n template \r\n inline T d180() { return T(180) * geometry::math::d2r(); }\r\n\r\n static const double epsilon = 1.e-10; // allow a little 'slack' on zone edge positions\r\n\r\n // Converted from #define SETUP(n, proj, x_0, y_0, lon_0)\r\n template