本文整理汇总了C++中NodeVector::front方法的典型用法代码示例。如果您正苦于以下问题：C++ NodeVector::front方法的具体用法？C++ NodeVector::front怎么用？C++ NodeVector::front使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类NodeVector的用法示例。
在下文中一共展示了NodeVector::front方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: intersect
/**
* 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;
}
}示例2: simplify
/**
* Simplifies the given UnionType by removing duplicate types. If the resulting
* UnionType contains only one type, that type is returned instead of the union.
*/
NodePtr simplify(const UnionType::Ptr& input)
{
// Remove duplicate types.
NodeVector newTypes;
copyUnique(input->getTypes(), newTypes);
// Return either the new union or the only type left in the vector, if there's one.
if (newTypes.size() == 1) {
return newTypes.front();
}
UnionType::Ptr ut(new UnionType);
ut->setTypes(newTypes);
return ut;
}