// Test of closest pair algorithms
// David Eppstein, UC Irvine, 19 Apr 1997
//
// Random binary values with two-adic valuation
// distance = 1/(2^i) where i=index of least significant differing bit

#include "PointSet.h"

class TwoAdic : public PointSet {
	long seed;
	unsigned long * values;

 public:
 	TwoAdic(unsigned long np);
 	~TwoAdic();
 	double operator() (point, point);
};