exporter.cc

Go to the documentation of this file.

#include "exporter.hh"
#include "registry.hh"
#include "registryiterator.hh"
#include <typelib/utilmm/configset.hh>
#include <typelib/typevisitor.hh>
#include <set>
#include <fstream>
#include <boost/algorithm/string/join.hpp>

using namespace Typelib;
using namespace std;

void Exporter::save(std::string const& file_name, utilmm::config_set const& config, Registry const& registry)
{
    std::ofstream file(file_name.c_str(), std::ofstream::trunc);
    save(file, config, registry);
}

void Exporter::save(std::ostream& stream, utilmm::config_set const& config, Registry const& registry)
{
    begin(stream, registry);

    std::set<Type const*> saved_types;

    typedef std::map
        < const std::string
        , RegistryIterator
        , bool (*) (const std::string&, const std::string&)
        >     TypeMap;
    TypeMap types(nameSort);
       
    RegistryIterator const it_end(registry.end());
    for (RegistryIterator it = registry.begin(); it != it_end; ++it)
        types.insert(make_pair(it.getName(), it));

    // Some exporters need to limit how many times a namespace appears. So, the
    // main algorithm (here) is meant to limit switching between namespaces.
    TypeMap free_types(nameSort);
    std::string last_namespace;
    while (!types.empty())
    {
        TypeMap::iterator it = types.begin();
        TypeMap::iterator const end = types.end();

        while (it != end)
        {
            bool done_dependencies = false;
            if (it->second.isAlias())
                done_dependencies = (saved_types.find(&(*it->second)) != saved_types.end());
            else
            {
                std::set<Type const*> dependencies = it->second->dependsOn();
                done_dependencies = includes(saved_types.begin(), saved_types.end(),
                        dependencies.begin(), dependencies.end());
            }

            if (done_dependencies)
            {
                free_types.insert(*it);
                types.erase(it++);
            }
            else ++it;
        }

        if (free_types.empty())
        {
            list<string> remaining;
            for (TypeMap::iterator it = types.begin(); it != types.end(); ++it)
                remaining.push_back(it->first);
            throw ExportError(boost::join(remaining, " ") + " seem to be recursive type(s). Exporting them is not supported yet");
        }

        // Remove all non-persistent types from the free_type set. If we found
        // any, just go loop. Otherwise, do dump some other types.
        bool got_some = false;
        TypeMap::iterator free_it = free_types.begin();
        TypeMap::iterator save_it = free_types.end();
        while (free_it != free_types.end())
        {
            if (!free_it->second.isPersistent())
            {
                got_some = true;
                saved_types.insert(&(*free_it->second));
                free_types.erase(free_it++);
            }
            else
            {
                if (save_it == free_types.end() && free_it->second.getNamespace() == last_namespace)
                    save_it = free_it;
                ++free_it;
            }
        }
        if (got_some)
            continue;

        if (save_it == free_types.end())
            save_it = free_types.begin();

        std::string ns = save_it->second.getNamespace();
        while (save_it != free_types.end() && save_it->second.getNamespace() == ns)
        {
            saved_types.insert(&(*save_it->second));
            if (save(stream, save_it->second))
                last_namespace = ns;

            free_types.erase(save_it++);
        }
    }

    // Now save the remaining types in free_types
    for (TypeMap::iterator it = free_types.begin(); it != free_types.end(); ++it)
    {
        if (it->second.isPersistent())
            save(stream, it->second);
    }

    end(stream, registry);
}

void Exporter::begin(std::ostream& stream, Registry const& registry) {}
void Exporter::end  (std::ostream& stream, Registry const& registry) {}