Re: [boost] [review] Last day for formal review for Sort library

Subject: Re: [boost] [review] Last day for formal review for Sort library
From: DUPUIS Etienne (e.dupuis_at_[hidden])
Date: 2014-12-12 05:39:57

------ Message d'origine ------
De : "Steven Ross" <spreadsort_at_[hidden]>
À : "boost_at_[hidden]" <boost_at_[hidden]>
Envoyé 09/12/2014 12:17:07
Objet : Re: [boost] [review] Last day for formal review for Sort library

>
>I've added such an example to the develop branch that handles signed
>ints,
>signed floats, and multiple string keys all together:
>https://github.com/spreadsort/sort/blob/develop/example/generalizedstruct.cpp

>And will mention it in the docs. Surprisingly, considering all the
>complexity of its get_char function, it's about 50% faster than
>std::sort
>on random data formatted like this. Below are the comparison and
>get_char
>functions for you to see. Comparison sorting is definitely easier, but
>hybrid-radix sorting is feasible and surprisingly efficient even for
>harder-to-represent cases:
>
>struct DATA_TYPE {
>   time_t birth;
>   float net_worth;
>   string first_name;
>   string last_name;
>};
>
>
Great, this is exactly the kind of more complex example one needs.

Regards,
Étienne


>
This message and any attachments are confidential and intended solely for the addressees. Any unauthorized modification, edition, use or dissemination is prohibited. If you have received this message by mistake, please notify us immediately. ATEME decline all responsibility for this message if it has been altered, deformed, falsified or even edited or disseminated without authorization.