近值排序

近值排序

report from :https://codereview.stackexchange.com/questions/48470/std-lib-like-c-function-to-find-nearest-elements-in-a-container


// Distance
// ========

template <typename T>
struct Distance {
	T operator () (const T& a, const T&  b) {
		return std::abs(a - b);
	}
};

// Compare Distance
// ================

template <
	typename T,
	typename DistanceFunctor = Distance<T>,
	typename CompareFunctor = std::less<decltype(
		std::declval<DistanceFunctor>()(std::declval<T>(), std::declval<T>()))>>
struct CompareDistance
{
	T pivot;
	DistanceFunctor distance;
	CompareFunctor compare;
	CompareDistance(T&& pivot)
		: pivot(std::move(pivot))
	{}

	CompareDistance(T&& pivot, DistanceFunctor&& distance)
		: pivot(std::move(pivot)),
		distance(std::move(distance))
	{}

	CompareDistance(T&& pivot, DistanceFunctor&& distance, CompareFunctor&& compare)
		: pivot(std::move(pivot)),
		distance(std::move(distance)),
		compare(std::move(compare))
	{}

	bool operator () (const T& a, const T& b) {
		return compare(distance(a, pivot), distance(b, pivot));
	}
};

// Distance Sort
// =============

template <typename Iterator, typename T>
inline void distance_sort(
	Iterator first,
	Iterator last,
	T&& pivot)
{
	typedef typename std::iterator_traits<Iterator>::value_type value_type;
	CompareDistance<value_type> compare_distance(std::move(pivot));
	std::sort(first, last, compare_distance);
}

template <typename Iterator, typename T, typename Distance>
inline void distance_sort(
	Iterator first,
	Iterator last,
	T&& pivot,
	Distance&& distance)
{
	typedef typename std::iterator_traits<Iterator>::value_type value_type;
	CompareDistance<value_type, Distance> compare_distance(
		std::move(pivot),
		std::move(distance));
	std::sort(first, last, compare_distance);
}

template <typename Iterator, typename T, typename Distance, typename Compare>
inline void distance_sort(
	Iterator first,
	Iterator last,
	T&& pivot,
	Distance&& distance,
	Compare&& compare)
{
	typedef typename std::iterator_traits<Iterator>::value_type value_type;
	CompareDistance<value_type, Distance, Compare> compare_distance(
		std::move(pivot),
		std::move(distance),
		std::move(compare));
	std::sort(first, last, compare_distance);
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值