Is there difference between b1rc1 and b1? Best regards, Sergey Shandar. On 3/16/2015 4:33 PM, Marshall Clow wrote:

Boost release 1.58.0 beta 1 is now available from SourceForge

See http://sourceforge.net/projects/boost/files/boost/1.58.0.beta.1/ <http://sourceforge.net/projects/boost/files/boost/1.58.0.beta.1/>

This release contains three new libraries: • Endian: Types and conversion functions for correct byte ordering and more regardless of processor endianness. • Sort: includes spreadsort, a general-case hybrid radix sort that is faster than O(n*log(n)) • WinAPI:

For details of what's in the release, see http://www.boost.org/users/history/version_1_58_0.html <http://www.boost.org/users/history/version_1_58_0.html>. Note that the links to files on this web page are for the final release - use the SourceForge link above to get the beta files.

Please download the beta, give it a try, and report any problems you encounter.

IMPORTANT NOTE: There is a bug with the build scripts; you have to specify the address-mode and architecture to b2. I used: ./b2 address-model=64 architecture=x86

(this will be fixed before the final release)

Thanks,

-- The Boost Release Team

_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

On 3/16/2015 4:33 PM, Marshall Clow wrote:

Boost release 1.58.0 beta 1 is now available from SourceForge

See http://sourceforge.net/projects/boost/files/boost/1.58.0.beta.1/ <http://sourceforge.net/projects/boost/files/boost/1.58.0.beta.1/>

This release contains three new libraries: • Endian: Types and conversion functions for correct byte ordering and more regardless of processor endianness. • Sort: includes spreadsort, a general-case hybrid radix sort that is faster than O(n*log(n)) • WinAPI: I mean, is there difference between b1-rc2 and b1?

Best regards, Sergey Shandar.