xPC implementation of k-d tree nearest neighbor

Is there an implementation of k-d nearest neighbors that works with xPC?

I tried the nearest neighbor function, but xPC doesn't handle the generated data structure.