/**
* Copies the entries of the input vector of types to the output vector,
* omitting duplicate types. Useful for TypeSet and UnionType simplification.
*/
void copyUnique(const NodeVector& input, NodeVector& output)
{
for (NodeVector::const_iterator it = input.begin(); it != input.end(); it++) {
bool exists = false;
for (NodeVector::iterator is = output.begin(); is != output.end(); is++) {
if (equal(*it, *is)) {
exists = true;
break;
}
}
if (!exists) output.push_back(*it);
}
assert(output.size() <= input.size());
assert(output.empty() == input.empty());
}
/**
* Returns the intersection between the TypeSet and the other node. The other
* node may also be a type set, in which case this function is called
* recursively to resolve the intersect.
*/
NodePtr intersect(const TypeSet::Ptr& typeSet, const NodePtr& other)
{
// Intersect all types in the type set with the other type.
NodeVector newTypes;
const NodeVector& types = typeSet->getTypes();
for (NodeVector::const_iterator it = types.begin(); it != types.end(); it++) {
NodePtr type = intersect(*it, other);
if (type->isKindOf(kInvalidType)) continue; // skip if the intersect was impossible
bool exists = false;
for (NodeVector::iterator is = newTypes.begin(); is != newTypes.end(); is++) {
if (equal(type, *is)) {
exists = true;
break;
}
}
if (!exists) newTypes.push_back(type);
}
// Return the new type set if it contains multiple types, a single type if
// there's only one left after the intersect, or InvalidType if the
// intersect yielded no types in the set.
if (newTypes.empty()) {
return NodePtr(new InvalidType);
} else if (newTypes.size() == 1) {
return newTypes.front();
} else {
TypeSet::Ptr ts(new TypeSet);
ts->setTypes(newTypes);
return ts;
}
}
Algorithm* Network::findAlgorithm(const std::string& name) {
NodeVector nodes = depthFirstSearch(_visibleNetworkRoot);
for (NodeVector::iterator node = nodes.begin(); node != nodes.end(); ++node) {
if ((*node)->algorithm()->name() == name) return (*node)->algorithm();
}
ostringstream msg;
msg << "Could not find algorithm with name '" << name << "'. Known algorithms are: ";
if (!nodes.empty()) msg << '\'' << nodes[0]->algorithm()->name() << '\'';
for (int i=1; i<(int)nodes.size(); i++) {
msg << ", '" << nodes[i]->algorithm()->name() << '\'';
}
throw EssentiaException(msg);
}
virtual void encode(const NodeVector& nodes) {
if (nodes.empty()) {
out << "[] ";
} else {
out << "[ ";
bool first = true;
for (NodeVector::const_iterator it = nodes.begin(); it != nodes.end(); it++) {
if (first) {
first = false;
} else {
out << ", ";
}
encode(*it);
}
out << "] ";
}
}