mirror of
https://github.com/IfcOpenShell/IfcOpenShell.git
synced 2026-08-14 03:14:23 +00:00
Thomas Krijnen
55 lines
2.9 KiB
C++
55 lines
2.9 KiB
C++
/********************************************************************************
|
|
* *
|
|
* This file is part of IfcOpenShell. *
|
|
* *
|
|
* IfcOpenShell is free software: you can redistribute it and/or modify *
|
|
* it under the terms of the Lesser GNU General Public License as published by *
|
|
* the Free Software Foundation, either version 3.0 of the License, or *
|
|
* (at your option) any later version. *
|
|
* *
|
|
* IfcOpenShell 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 *
|
|
* Lesser GNU General Public License for more details. *
|
|
* *
|
|
* You should have received a copy of the Lesser GNU General Public License *
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>. *
|
|
* *
|
|
********************************************************************************/
|
|
|
|
#include "mapping.h"
|
|
#define mapping POSTFIX_SCHEMA(mapping)
|
|
using namespace ifcopenshell::geometry;
|
|
|
|
taxonomy::ptr mapping::map_impl(const IfcSchema::IfcEdge* inst) {
|
|
if (!inst->EdgeStart()->declaration().is(IfcSchema::IfcVertexPoint::Class()) || !inst->EdgeEnd()->declaration().is(IfcSchema::IfcVertexPoint::Class())) {
|
|
Logger::Message(Logger::LOG_ERROR, "Only IfcVertexPoints are supported for EdgeStart and -End", inst);
|
|
return nullptr;
|
|
}
|
|
|
|
IfcSchema::IfcPoint* pnt1 = ((IfcSchema::IfcVertexPoint*) inst->EdgeStart())->VertexGeometry();
|
|
IfcSchema::IfcPoint* pnt2 = ((IfcSchema::IfcVertexPoint*) inst->EdgeEnd())->VertexGeometry();
|
|
if (!pnt1->declaration().is(IfcSchema::IfcCartesianPoint::Class()) || !pnt2->declaration().is(IfcSchema::IfcCartesianPoint::Class())) {
|
|
Logger::Message(Logger::LOG_ERROR, "Only IfcCartesianPoints are supported for VertexGeometry", inst);
|
|
return nullptr;
|
|
}
|
|
|
|
auto e = taxonomy::make<taxonomy::edge>();
|
|
|
|
e->start = taxonomy::cast<taxonomy::point3>(map(pnt1));
|
|
e->end = taxonomy::cast<taxonomy::point3>(map(pnt2));
|
|
|
|
if (inst->as<IfcSchema::IfcEdgeCurve>()) {
|
|
auto basis = map(inst->as<IfcSchema::IfcEdgeCurve>()->EdgeGeometry());
|
|
auto loop = taxonomy::dcast<taxonomy::loop>(basis);
|
|
if (loop && loop->children.size() == 1) {
|
|
loop->calculate_linear_edge_curves();
|
|
basis = loop->children[0]->basis;
|
|
}
|
|
e->basis = basis;
|
|
e->curve_sense = inst->as<IfcSchema::IfcEdgeCurve>()->SameSense();
|
|
}
|
|
|
|
return e;
|
|
}
|