view ReporterBase.h @ 302:74824093c1c4

Implement O((M+N) log(M+N)) duplicate key detection in batchinsert,
rather than naive O(N^2).

Note that I haven't measured the constants in those complexity
expressions; I am anticipating that 40000 is a sufficiently large N for
this to matter.

Write a test case for duplicate keys, too.  Use 0037, since no-one else
seems to be writing tests, and everything is merged onto the trunk these
days anyway.

#ifndef __REPORTERBASE_H
#define __REPORTERBASE_H

class ReporterBase {
public:
  virtual ~ReporterBase(){};
  virtual void add_point(unsigned int trackID, unsigned int qpos, unsigned int spos, double dist) = 0;
  virtual void report(char*,void*) = 0;
};

#endif