82 lines
3.8 KiB
C++
82 lines
3.8 KiB
C++
/**************************************************************************************/
|
|
/* */
|
|
/* Visualization Library */
|
|
/* http://visualizationlibrary.org */
|
|
/* */
|
|
/* Copyright (c) 2005-2020, Michele Bosi */
|
|
/* All rights reserved. */
|
|
/* */
|
|
/* Redistribution and use in source and binary forms, with or without modification, */
|
|
/* are permitted provided that the following conditions are met: */
|
|
/* */
|
|
/* - Redistributions of source code must retain the above copyright notice, this */
|
|
/* list of conditions and the following disclaimer. */
|
|
/* */
|
|
/* - Redistributions in binary form must reproduce the above copyright notice, this */
|
|
/* list of conditions and the following disclaimer in the documentation and/or */
|
|
/* other materials provided with the distribution. */
|
|
/* */
|
|
/* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND */
|
|
/* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED */
|
|
/* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE */
|
|
/* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR */
|
|
/* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES */
|
|
/* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; */
|
|
/* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON */
|
|
/* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT */
|
|
/* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS */
|
|
/* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */
|
|
/* */
|
|
/**************************************************************************************/
|
|
|
|
#ifndef VLXLinker_INCLUDE_ONCE
|
|
#define VLXLinker_INCLUDE_ONCE
|
|
|
|
#include <vlX/VisitorLinker.hpp>
|
|
#include <vlX/VisitorLinkMapper.hpp>
|
|
|
|
namespace vlX
|
|
{
|
|
/** Links several VLX hierachies also resolving IDs across them. */
|
|
class Linker
|
|
{
|
|
public:
|
|
void add(VLXTaggedValue* module)
|
|
{
|
|
mModules.push_back(module);
|
|
}
|
|
|
|
bool link()
|
|
{
|
|
std::map< std::string, vl::ref<VLXStructure> > link_map;
|
|
|
|
// map all the IDs to the appropriate VLXStructures
|
|
VisitorLinkMapper link_mapper(&link_map);
|
|
for(size_t i=0; i<mModules.size(); ++i)
|
|
mModules[i]->acceptVisitor(&link_mapper);
|
|
|
|
if (link_mapper.error())
|
|
return false;
|
|
|
|
// link all the IDs to the associated VLXStructure
|
|
VisitorLinker linker(&link_map);
|
|
for(size_t i=0; i<mModules.size(); ++i)
|
|
mModules[i]->acceptVisitor(&linker);
|
|
|
|
if (linker.error())
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
|
|
std::vector< vl::ref<VLXTaggedValue> >& modules() { return mModules; }
|
|
|
|
const std::vector< vl::ref<VLXTaggedValue> >& modules() const { return mModules; }
|
|
|
|
public:
|
|
std::vector< vl::ref<VLXTaggedValue> > mModules;
|
|
};
|
|
}
|
|
|
|
#endif
|