Hi Everyone, I've been thinking about this for a little while now, but haven't hit on a suitable solution.
The DSA I'm querying allows an approximate search, which uses a synonym lookup. So as an example, if I search for Jim, Jim can also be known as James, Jamie, Jimmy. Now the results from the search come back fine, however, I want to display the sorted results with all the given names of Jim (or the original value of the given name searched for) sorted at the top, followed by the rest f the result set sorted normally. So something like: Adams, Jim Smith, Jim Jackson, James Goodyear, Jimmy Before this requirement I was just using ->sorted method on the message object (or is it search?), but I can now no longer use it. So I have now got 2 arrays of Entry objects, which I test, and ->pop_entry and I tried ->shift_entry too. But I was expecting that the original result object to eventually be undef (empty), but testing shows that my orginal result object still has entries in it. Anyway, Now that I have the 2 arrays, I still need to sort, which looking at the Search.pm code for ->sorted, isn't trivial (I can't make heads or tails of it yet). So, I was wondering, can I cheat here and create 2 new Search objects with the split in place, and just call ->sorted on each in turn? Has anyone else done something like this and is willing to show me? :) Pete :wq
