Function trimEndPoints

src/IECore/Ramp.cpp:254–289

// points well, so regardless of why they are there, this function will remove them.
template<typename PointContainer>
void trimEndPoints( PointContainer &points )
{
	if( points.empty() )
	{
		return;
	}

	// Count how many initial points have an X value matching the first point
	typename PointContainer::const_iterator startDuplicates = ++points.begin();
	while( startDuplicates != points.end() && startDuplicates->first == points.begin()->first )
	{
		startDuplicates++;
	}
	// We need to keep one of these points, the rest are duplicates and should be removed
	startDuplicates--;

	points.erase( points.begin(), startDuplicates );

	// Count how many points have an X value matching the last point
	typename PointContainer::const_reverse_iterator endDuplicates = ++points.rbegin();
	while( endDuplicates != points.rend() && endDuplicates->first == points.rbegin()->first )
	{
		endDuplicates++;
	}

	// We need to keep one of these points, the rest are duplicates and should be removed
	endDuplicates--;

	points.erase( endDuplicates.base(), points.rbegin().base() );

	// This originally indicated whether the end point duplication matched the expected multiplicity
	// for a certain interpolation. We no longer make assumptions about how the input data handles end
	// point multiplicity, and instead just remove any duplicates, so we no longer consider any inputs
	// to be invalid.
	return;
}

}