Class MaxMinPicker

Pick a subset of items from a pool of items using the MaxMin Algorithm
Ashton, M. et. al., Quant. Struct.-Act. Relat., 21 (2002), 598-604 
ARGUMENTS:

  - distFunc: a function that should take two indices and return the
              distance between those two points.
              NOTE: the implementation caches distance values, so the
              client code does not need to do so; indeed, it should not.
  - poolSize: number of items in the pool
  - pickSize: number of items to pick from the pool
  - firstPicks: (optional) the first items to be picked (seeds the list)

C++ signature:
    LazyPick(RDPickers::MaxMinPicker* self, boost::python::api::object distFunc, int poolSize, int pickSize, boost::python::api::object firstPicks=()) -> std::vector<int, std::allocator<int> >

Pick a subset of items from a pool of items using the MaxMin Algorithm
Ashton, M. et. al., Quant. Struct.-Act. Relat., 21 (2002), 598-604 

ARGUMENTS:
  - distMat: 1D distance matrix (only the lower triangle elements)
  - poolSize: number of items in the pool
  - pickSize: number of items to pick from the pool
  - firstPicks: (optional) the first items to be picked (seeds the list)

C++ signature:
    Pick(RDPickers::MaxMinPicker* self, boost::python::numeric::array {lvalue} distMat, int poolSize, int pickSize, boost::python::api::object firstPicks=()) -> std::vector<int, std::allocator<int> >

C++ signature:
__init__(_object*) -> void*

Overrides: object.__init__