File: release_notes.xml

package info (click to toggle)
boost1.90 1.90.0-5
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 593,168 kB
  • sloc: cpp: 4,190,642; xml: 196,648; python: 34,618; ansic: 23,145; asm: 5,468; sh: 3,776; makefile: 1,162; perl: 1,020; sql: 728; ruby: 676; yacc: 478; java: 77; lisp: 24; csh: 6
file content (45 lines) | stat: -rw-r--r-- 1,778 bytes parent folder | download | duplicates (11)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE library PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
"http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">

<!-- Copyright (c) 2002-2006 Pavol Droba.
     Subject to the Boost Software License, Version 1.0. 
     (See accompanying file LICENSE_1_0.txt or  http://www.boost.org/LICENSE_1_0.txt)
-->

<section id="string_algo.release_notes" last-revision="$Date$">

    <using-namespace name="boost"/>
    <using-namespace name="boost::algorithm"/>

    <title>Release Notes</title>

    <itemizedlist>
        <listitem>
            <para><emphasis role="bold">1.32</emphasis></para>
            <para>Initial release in Boost</para>
        </listitem>
        <listitem>
            <para><emphasis role="bold">1.33</emphasis></para>
            <para>Internal version of collection traits removed, library adapted to Boost.Range</para>
        </listitem>
        <listitem>
            <para><emphasis role="bold">1.34</emphasis></para>
            <itemizedlist>
                <listitem>
                    <functionname>lexicographical_compare()</functionname>
                </listitem>
                <listitem>
                    <functionname>join()</functionname> and <functionname>join_if()</functionname> 
                </listitem>
                <listitem>
                    New comparison predicates <code>is_less</code>, <code>is_not_greater</code>
                </listitem>
                <listitem>
                     Negative indexes support (like Perl) in various algorithms
                     (<code>*_head/tail</code>, <code>*_nth</code>).
                </listitem>                                      
            </itemizedlist>
        </listitem>
    </itemizedlist>
</section>