mikemccand commented on issue #12399: URL: https://github.com/apache/lucene/issues/12399#issuecomment-1612777794
> > Yeah, some of our custom sorts are because we want to sort one array, but use the sort key from another parallel array. Unfortunately I don't think (?) the JDK has existing APIs for this usage, yet, the way the SIMD sorting works, it would be a perfect fit (it reports the indices into the array that it then permute to, to achieve the sort ... so we'd want those sorted indices so we could permute our own (possible non-primitive) arrays). > > Yes, but I doubt that vectorization can help much here. One correction: I think the SIMD sorting would in fact help here. The way it works is to do the hard part of the sorting to produce a "permute array" (the indices into the original array to achieve the sort). One could easily use that to sort a second parallel array. Valhala (efficient array of structs) would be a nice option too, once it finally arrives. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
