/** * \file MinimumSingletonScore.cpp \brief Define SingletonScore * * This file is generated by a script (core/tools/make-container). * Do not edit directly. * * Copyright 2007-2010 IMP Inventors. All rights reserved. */ #include #include "IMP/algebra/internal/MinimalSet.h" IMPCONTAINER_BEGIN_NAMESPACE MinimumSingletonScore::MinimumSingletonScore(const SingletonScoresTemp &scores, unsigned int n, std::string name): SingletonScore(name), scores_(scores), n_(n) { } namespace { typedef algebra::internal::MinimalSet > MS; template MS find_minimal_set(It b, It e, Particle* v, unsigned int n) { IMP_LOG(TERSE, "Finding Minimum " << n << " of " << std::distance(b,e) << std::endl); MS bestn(n); for (It it= b; it != e; ++it) { double score= (*it)->evaluate(v, NULL); if (bestn.can_insert(score)) { bestn.insert(score, *it); } } return bestn; } } double MinimumSingletonScore::evaluate(Particle* v, DerivativeAccumulator *da) const { MS bestn= find_minimal_set(scores_.begin(), scores_.end(), v, n_); double score=0; for (unsigned int i=0; i< bestn.size(); ++i) { if (da) { bestn[i].second->evaluate(v, da); } score+= bestn[i].first; } return score; } bool MinimumSingletonScore::get_is_changed(Particle* v) const { for (unsigned int i=0; i< scores_.size(); ++i) { if (scores_[i]->get_is_changed(v)) return true; } return false; } ParticlesTemp MinimumSingletonScore ::get_input_particles(Particle* p) const { ParticlesTemp ret; for (unsigned int i=0; i< scores_.size(); ++i) { ParticlesTemp c= scores_[i]->get_input_particles(p); ret.insert(ret.end(), c.begin(), c.end()); } return ret; } ContainersTemp MinimumSingletonScore ::get_input_containers(Particle* p) const { ContainersTemp ret; for (unsigned int i=0; i< scores_.size(); ++i) { ContainersTemp c= scores_[i]->get_input_containers(p); ret.insert(ret.end(), c.begin(), c.end()); } return ret; } void MinimumSingletonScore::do_show(std::ostream &out) const { out << "size scores " << scores_.size() << std::endl; } IMPCONTAINER_END_NAMESPACE