/* Ousía Copyright (C) 2014, 2015 Benjamin Paaßen, Andreas Stöckel 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 3 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, see . */ #include "Document.hpp" #include #include namespace ousia { namespace model { /* Class DocumentEntity */ int DocumentEntity::getFieldDescriptorIndex(const std::string &fieldName, bool enforce) const { const NodeVector &fds = descriptor->getFieldDescriptors(); unsigned int f = 0; // look if we have an empty name. if (fieldName == "") { // in that case we look for a default field. // First: Do we only have one field? if (fds.size() == 1) { // if so we return that one. return f; } // Second: Do we have a TREE field? for (auto &fd : fds) { if (fd->getFieldType() == FieldDescriptor::FieldType::TREE) { return f; } f++; } } else { // otherwise we return the FieldDescriptor with the correct name (if // such a descriptor exists). for (auto &fd : fds) { if (fd->getName() == fieldName) { return f; } f++; } } if (enforce) { throw OusiaException("No field for the given name exists!"); } else { return -1; } } int DocumentEntity::getFieldDescriptorIndex( Handle fieldDescriptor, bool enforce) const { if (fieldDescriptor.isNull()) { throw OusiaException("The given FieldDescriptor handle is null!"); } const NodeVector &fds = descriptor->getFieldDescriptors(); int f = 0; for (auto &fd : fds) { if (fd->getName() == fieldDescriptor->getName() && fd->getFieldType() == fieldDescriptor->getFieldType()) { return f; } f++; } if (enforce) { throw OusiaException( "The given FieldDescriptor is not specified in the Descriptor of " "this " "node."); } else { return -1; } } /* Class Document */ void Document::continueResolve(ResolutionState &state) { continueResolveComposita(annotations, annotations.getIndex(), state); if (root != nullptr) { continueResolveCompositum(root, state); } continueResolveReferences(domains, state); } } /* Type registrations */ namespace RttiTypes { const Rtti DocumentEntity = RttiBuilder("DocumentEntity").parent(&Node); const Rtti Document = RttiBuilder("Document").parent(&Node).composedOf( {&AnnotationEntity, &StructuredEntity}); const Rtti AnnotationEntity = RttiBuilder("AnnotationEntity").parent(&DocumentEntity).composedOf( &StructuredEntity); const Rtti StructureNode = RttiBuilder("StructureNode").parent(&Node); const Rtti StructuredEntity = RttiBuilder("StructuredEntity").parent(&DocumentEntity).parent(&StructureNode).composedOf( {&StructuredEntity, &Anchor, &DocumentPrimitive}); const Rtti DocumentPrimitive = RttiBuilder("DocumentPrimitive").parent(&StructureNode); const Rtti Anchor = RttiBuilder("Anchor").parent(&StructureNode); } }