+#include <set>
+#include <msp/core/algorithm.h>
#include "collection.h"
using namespace std;
namespace Msp {
namespace DataFile {
+Collection::Collection():
+ fallback(0)
+{ }
+
Collection::~Collection()
{
- for(TypeList::iterator i = types.begin(); i!=types.end(); ++i)
- delete *i;
+ for(CollectionItemTypeBase *t: types)
+ delete t;
+}
+
+void Collection::add_var(const string &name, const CollectionItemTypeBase *type, const Variant &var)
+{
+ insert_unique(items, name, var);
+ try
+ {
+ if(type)
+ type->notify_item(name, var);
+ }
+ catch(...)
+ {
+ remove_existing(items, name);
+ throw;
+ }
}
-void Collection::add_future(const string &name)
+const Variant &Collection::get_var(const string &name, const CollectionItemTypeBase *type)
{
- for(TypeList::const_iterator i=types.begin(); i!=types.end(); ++i)
- if((*i)->match_name(name))
+ const Variant *var = find_var(name, type);
+ if(var)
+ return *var;
+
+ throw key_error(name);
+}
+
+const Variant *Collection::find_var(const string &name, const CollectionItemTypeBase *type)
+{
+ ItemMap::iterator i = items.find(name);
+ if(i!=items.end())
+ return &i->second;
+
+ if(type)
+ {
+ bool loaded = false;
+ if(type->can_create())
{
- insert_unique(items, name, (*i)->create_future());
- return;
+ type->create_item(*this, name);
+ loaded = items.count(name);
}
+ for(auto j=sources.begin(); (!loaded && j!=sources.end()); ++j)
+ {
+ (*j)->load(*this, *type, name);
+ loaded = items.count(name);
+ }
+ if(!loaded && fallback)
+ if(CollectionItemTypeBase *fb_type = fallback->get_type(*type))
+ if(fallback->get_status(name, *fb_type))
+ return fallback->find_var(name, fb_type);
+ }
+
+ i = items.find(name);
+ return (i!=items.end() ? &i->second : 0);
}
-void Collection::add_future_with_keyword(const string &name, const string &keyword)
+void Collection::gather_items(vector<const Variant *> *vars, list<string> *names, const CollectionItemTypeBase &type, bool include_sources) const
{
- for(TypeList::const_iterator i=types.begin(); i!=types.end(); ++i)
- if((*i)->get_keyword()==keyword)
+ for(const auto &kvp: items)
+ if(type.check_item_type(kvp.second))
{
- insert_unique(items, name, (*i)->create_future());
- return;
+ if(vars)
+ vars->push_back(&kvp.second);
+ if(names)
+ names->push_back(kvp.first);
}
- throw runtime_error("Collection::add_future_with_keyword");
+ if(include_sources && names)
+ gather_names_from_sources(*names, type);
+}
+
+unsigned Collection::get_status(const string &name, const CollectionItemTypeBase &type) const
+{
+ ItemMap::const_iterator i = items.find(name);
+ if(i==items.end())
+ {
+ auto j = find_if(sources, [&name, &type](const CollectionSource *s){ return s->is_loadable(type, name); });
+ if(j!=sources.end())
+ return 2;
+ if(fallback)
+ if(CollectionItemTypeBase *fb_type = fallback->get_type(type))
+ return fallback->get_status(name, *fb_type);
+ return 0;
+ }
+
+ return type.check_item_type(i->second);
+}
+
+CollectionItemTypeBase *Collection::get_type(const CollectionItemTypeBase &type) const
+{
+ for(CollectionItemTypeBase *t: types)
+ if(t->is_same_type(type))
+ return t;
+ return 0;
+}
+
+CollectionItemTypeBase *Collection::get_type_for_item(const Variant &var) const
+{
+ for(CollectionItemTypeBase *t: types)
+ if(t->check_item_type(var))
+ return t;
+ return 0;
+}
+
+void Collection::add_source(const CollectionSource &s)
+{
+ sources.push_back(&s);
+}
+
+IO::Seekable *Collection::open_raw(const string &name) const
+{
+ for(const CollectionSource *s: sources)
+ if(IO::Seekable *io = s->open(name))
+ return io;
+
+ return 0;
+}
+
+void Collection::gather_names_from_sources(list<string> &names, const CollectionItemTypeBase &type) const
+{
+ set<string> new_names;
+ for(const CollectionSource *s: sources)
+ for(const string &n: s->get_names(type))
+ if(!items.count(n))
+ new_names.insert(n);
+ names.insert(names.end(), new_names.begin(), new_names.end());
+}
+
+void Collection::load_items_from_sources(const CollectionItemTypeBase &type)
+{
+ for(const CollectionSource *s: sources)
+ for(const string &n: s->get_names(type))
+ if(!items.count(n))
+ {
+ bool loaded = false;
+ if(type.can_create())
+ {
+ type.create_item(*this, n);
+ loaded = items.count(n);
+ }
+ if(!loaded)
+ s->load(*this, type, n);
+ }
+}
+
+void Collection::set_fallback(Collection *f)
+{
+ fallback = f;
}
Collection::Loader::Loader(Collection &c):
coll(c)
{
- for(TypeList::const_iterator i = coll.types.begin(); i!=coll.types.end(); ++i)
- (*i)->add_to_loader(*this);
+ for(const CollectionItemTypeBase *t: coll.types)
+ t->add_to_loader(*this);
}
-CollectionItemTypeBase::CollectionItemTypeBase():
- tag(0)
-{ }
-
CollectionItemTypeBase::~CollectionItemTypeBase()
{
- delete tag;
+ for(ExtractorBase *e: extractors)
+ delete e;
}
void CollectionItemTypeBase::set_keyword(const string &k)
bool CollectionItemTypeBase::match_name(const string &name) const
{
- for(vector<string>::const_iterator i=suffixes.begin(); i!=suffixes.end(); ++i)
- if(name.size()>i->size() && !name.compare(name.size()-i->size(), string::npos, *i))
+ for(const string &s: suffixes)
+ if(name.size()>s.size() && !name.compare(name.size()-s.size(), string::npos, s))
return true;
return false;
}