[jira] Resolved: (LUCY-99) Merge sort elements of arbitrary width

["Marvin Humphrey (JIRA)" <ji...@apache.org>]

     [ https://issues.apache.org/jira/browse/LUCY-99?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Marvin Humphrey resolved LUCY-99.
---------------------------------

    Resolution: Fixed

Committed as r909671.

> Merge sort elements of arbitrary width
> --------------------------------------
>
>                 Key: LUCY-99
>                 URL: https://issues.apache.org/jira/browse/LUCY-99
>             Project: Lucy
>          Issue Type: Improvement
>          Components: Core - Util
>            Reporter: Marvin Humphrey
>            Assignee: Marvin Humphrey
>            Priority: Minor
>         Attachments: mergesort_any_width.diff
>
>
> The present implementation of mergesort in SortUtils only handles four-byte and
> eight-byte elements, because it was intended only for sorting pointers, but it
> would be convenient to make it possible to sort elements of arbitrary width.
> We can add a width argument without sacrificing speed by taking advantage of
> the fact that optimizing compilers such as GCC produce identical assembler for 
> invocations of memcpy() where the amount to copy is a small constant known 
> at compile time as for direct assigment.

-- 
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.