set.html

ST20 Embedded Toolset R2.0.5用于开发基于ST20芯片机顶盒软件的开发平台,2.0.5版本,国内找不到的.在国外论坛上花了N天才找到!

pair<const_iterator, const_iterator>
    <B>equal_range</B>(const Key&amp; keyval) const;</PRE>

<P>The member function returns a pair of iterators <CODE>X</CODE>
such that <CODE>X.<A HREF="utility.html#pair::first">first</A> ==
<A HREF="#set::lower_bound">lower_bound</A>(keyval)</CODE>
and <CODE>X.<A HREF="utility.html#pair::second">second</A> ==
<A HREF="#set::upper_bound">upper_bound</A>(keyval)</CODE>.</P>

<H3><CODE><A NAME="set::erase">set::erase</A></CODE></H3>

<PRE>iterator <B>erase</B>(iterator where);
iterator <B>erase</B>(iterator first, iterator last);
size_type <B>erase</B>(const Key&amp; keyval);</PRE>

<P>The first member function removes the element of the controlled
sequence pointed to by <CODE>where</CODE>.
The second member function removes the elements
in the range <CODE>[first, last)</CODE>.
Both return an iterator that designates the first element remaining
beyond any elements removed, or
<CODE><A HREF="#set::end">end</A>()</CODE> if no such element exists.</P>

<P>The third member removes
the elements with sort keys in the range
<CODE>[<A HREF="#set::lower_bound">lower_bound</A>(keyval),
<A HREF="#set::upper_bound">upper_bound</A>(keyval)).</CODE>
It returns the number of elements it removes.</P>

<P>The member functions never throw an exception.</P>

<H3><CODE><A NAME="set::find">set::find</A></CODE></H3>

<PRE>iterator <B>find</B>(const Key&amp; keyval);
const_iterator <B>find</B>(const Key&amp; keyval) const;</PRE>

<P>The member function returns an iterator that designates
the element in the controlled sequence whose sort key has
<A HREF="lib_stl.html#equivalent ordering">equivalent ordering</A>
to <CODE>keyval</CODE>. If no such element exists,
the function returns
<CODE><A HREF="#set::end">end</A>()</CODE>.</P>

<H3><CODE><A NAME="set::get_allocator">set::get_allocator</A></CODE></H3>

<PRE>Alloc <B>get_allocator</B>() const;</PRE>

<P>The member function returns the stored
<A HREF="memory.html#allocator object">allocator object</A>.</P>

<H3><CODE><A NAME="set::insert">set::insert</A></CODE></H3>

<PRE>pair&lt;iterator, bool&gt; <B>insert</B>(const value_type&amp; val);
iterator <B>insert</B>(iterator where, const value_type&amp; val);
template&lt;class InIt&gt;
    void <B>insert</B>(InIt first, InIt last);</PRE>

<P>The first member function determines whether an element <CODE>X</CODE>
exists in the sequence whose key has
<A HREF="lib_stl.html#equivalent ordering">equivalent ordering</A>
to that of <CODE>val</CODE>. If not, it creates such
an element <CODE>X</CODE> and initializes it with <CODE>val</CODE>.
The function then determines the iterator <CODE>where</CODE> that
designates <CODE>X</CODE>. If an insertion occurred, the function
returns <CODE><A HREF="utility.html#pair">pair</A>(where, true)</CODE>.
Otherwise, it returns <CODE>pair(where, false)</CODE>.</P>

<P>The second member function returns <CODE>insert(val).first</CODE>,
using <CODE>where</CODE> as a starting place within the controlled
sequence to search for the insertion point. (Insertion can occur
in amortized constant time, instead of logarithmic time, if the
insertion point immediately precedes or follows <CODE>where</CODE>.)
The third member function
inserts the sequence of element values,
for each <CODE>where</CODE> in the range <CODE>[first, last)</CODE>,
by calling <CODE>insert(*where)</CODE>.</P>


<P>If an exception is thrown during the
insertion of a single element, the container is left unaltered
and the exception is rethrown.
If an exception is thrown during the
insertion of multiple elements, the container is left in a stable
but unspecified state and the exception is rethrown.</P>

<H3><CODE><A NAME="set::iterator">set::iterator</A></CODE></H3>

<PRE>typedef T0 <B>iterator</B>;</PRE>

<P>The type describes an object that can serve as a bidirectional
iterator for the controlled sequence.
It is described here as a
synonym for the implementation-defined type <CODE>T0</CODE>.</P>

<H3><CODE><A NAME="set::key_comp">set::key_comp</A></CODE></H3>

<PRE>key_compare <B>key_comp</B>() const;</PRE>

<P>The member function returns the stored function object that
determines the order of elements in the controlled sequence.
The stored object defines the member function:</P>

<PRE>bool operator(const Key&amp; left, const Key&amp; right);</PRE>

<P>which returns true if <CODE>left</CODE> strictly
precedes <CODE>right</CODE> in the sort order.</P>

<H3><CODE><A NAME="set::key_compare">set::key_compare</A></CODE></H3>

<PRE>typedef Pr <B>key_compare</B>;</PRE>

<P>The type describes a function object that can compare two
sort keys to determine the relative order of two
elements in the controlled sequence.</P>

<H3><CODE><A NAME="set::key_type">set::key_type</A></CODE></H3>

<PRE>typedef Key <B>key_type</B>;</PRE>

<P>The type describes the sort key object which constitutes each
element of the controlled sequence.</P>

<H3><CODE><A NAME="set::lower_bound">set::lower_bound</A></CODE></H3>

<PRE>iterator <B>lower_bound</B>(const Key&amp; keyval);
const_iterator <B>lower_bound</B>(const Key&amp; keyval) const;</PRE>

<P>The member function returns an iterator that designates the
earliest element <CODE>X</CODE> in the controlled sequence for which
<CODE><A HREF="#set::key_comp">key_comp</A>()(X, keyval)</CODE> is
false.</P> If no such element exists, the function returns
<CODE><A HREF="#set::end">end</A>()</CODE>.

<H3><CODE><A NAME="set::max_size">set::max_size</A></CODE></H3>

<PRE>size_type <B>max_size</B>() const;</PRE>

<P>The member function returns the length of the longest sequence that
the object can control.</P>

<H3><CODE><A NAME="set::pointer">set::pointer</A></CODE></H3>

<PRE>typedef Alloc::pointer <B>pointer</B>;</PRE>

<P>The type describes an object that can serve as a pointer to an
element of the controlled sequence.</P>

<H3><CODE><A NAME="set::rbegin">set::rbegin</A></CODE></H3>

<PRE>reverse_iterator <B>rbegin</B>();
const_reverse_iterator <B>rbegin</B>() const;</PRE>

<P>The member function returns a reverse bidirectional
iterator that points just
beyond the end of the controlled sequence. Hence, it designates the
beginning of the reverse sequence.</P>

<H3><CODE><A NAME="set::reference">set::reference</A></CODE></H3>

<PRE>typedef Alloc::const_reference <B>const_reference</B>;</PRE>

<P>The type describes an object that can serve as a reference to an
element of the controlled sequence.</P>

<H3><CODE><A NAME="set::rend">set::rend</A></CODE></H3>

<PRE>reverse_iterator <B>rend</B>();
const_reverse_iterator <B>rend</B>() const;</PRE>

<P>The member function returns a reverse bidirectional
iterator that points at the
first element of the sequence (or just beyond the end of an empty
sequence). Hence, it designates the end of the reverse sequence.</P>

<H3><CODE><A NAME="set::reverse_iterator">set::reverse_iterator</A></CODE></H3>

<PRE>typedef reverse_iterator&lt;iterator&gt; <B>reverse_iterator</B>;</PRE>

<P>The type describes an object that can serve as a reverse
bidirectional iterator for the controlled sequence.</P>

<H3><CODE><A NAME="set::set">set::set</A></CODE></H3>

<PRE><B>set</B>();
explicit <B>set</B>(const Pr&amp; pred);
<B>set</B>(const Pr&amp; pred, const Alloc&amp; al);
<B>set</B>(const set&amp; right);
template&lt;class InIt&gt;
    <B>set</B>(InIt first, InIt last);
template&lt;class InIt&gt;
    <B>set</B>(InIt first, InIt last,
        const Pr&amp; pred);
template&lt;class InIt&gt;
    <B>set</B>(InIt first, InIt last,
        const Pr&amp; pred, const Alloc&amp; al);</PRE>

<P>All constructors store an
<A HREF="memory.html#allocator object">allocator object</A> and
initialize the controlled sequence. The allocator object is the argument
<CODE>al</CODE>, if present. For the copy constructor, it is
<CODE>right.<A HREF="#set::get_allocator">get_allocator</A>()</CODE>.
Otherwise, it is <CODE>Alloc()</CODE>.</P>

<P>All constructors also store a function object that can later
be returned by calling
<CODE><A HREF="#set::key_comp">key_comp</A>()</CODE>.
The function object is the argument <CODE>pred</CODE>, if present.
For the copy constructor, it is
<CODE>right.<A HREF="#set::key_comp">key_comp</A>()</CODE>).
Otherwise, it is <CODE>Pr()</CODE>.</P>

<P>The first three constructors specify an
empty initial controlled sequence. The fourth constructor specifies
a copy of the sequence controlled by <CODE>right</CODE>.
The last three constructors specify the sequence of element values
<CODE>[first, last)</CODE>.</P>


<H3><CODE><A NAME="set::size">set::size</A></CODE></H3>

<PRE>size_type <B>size</B>() const;</PRE>

<P>The member function returns the length of the controlled sequence.</P>

<H3><CODE><A NAME="set::size_type">set::size_type</A></CODE></H3>

<PRE>typedef T2 <B>size_type</B>;</PRE>

<P>The unsigned integer type describes an object that can represent the
length of any controlled sequence. It is described here as a
synonym for the implementation-defined type <CODE>T2</CODE>.</P>

<H3><CODE><A NAME="set::swap">set::swap</A></CODE></H3>

<PRE>void <B>swap</B>(set&amp; right);</PRE>

<P>The member function swaps the controlled sequences between
<CODE>*this</CODE> and <CODE>right</CODE>. If
<CODE><A HREF="#set::get_allocator">get_allocator</A>()
== right.get_allocator()</CODE>, it does so in constant time,
it throws an exception only as a result of copying the stored
function object of type <CODE>Pr</CODE>, and it invalidates no references, pointers,
or iterators that designate elements in the two controlled sequences.
Otherwise, it performs a number of element assignments and constructor calls
proportional to the number of elements in the two controlled sequences.</P>

<H3><CODE><A NAME="set::upper_bound">set::upper_bound</A></CODE></H3>

<PRE>iterator <B>upper_bound</B>(const Key&amp; keyval)
const_iterator <B>upper_bound</B>(const Key&amp; keyval) const;</PRE>

<P>The member function returns an iterator that designates the
earliest element <CODE>X</CODE> in the controlled sequence for which
<CODE><A HREF="#set::key_comp">key_comp</A>()(keyval, X)</CODE> is
true.</P> If no such element exists, the function returns
<CODE><A HREF="#set::end">end</A>()</CODE>.

<H3><CODE><A NAME="set::value_comp">set::value_comp</A></CODE></H3>

<PRE>value_compare <B>value_comp</B>() const;</PRE>

<P>The member function returns a function object that
determines the order of elements in the controlled sequence.</P>

<H3><CODE><A NAME="set::value_compare">set::value_compare</A></CODE></H3>

<PRE>typedef Pr <B>value_compare</B>;</PRE>

<P>The type describes a function object that can compare two
elements as sort keys to determine their relative order
in the controlled sequence.</P>

<H3><CODE><A NAME="set::value_type">set::value_type</A></CODE></H3>

<PRE>typedef Key <B>value_type</B>;</PRE>

<P>The type describes an element of the controlled sequence.</P>

<H2><A NAME="swap"><CODE>swap</CODE></A></H2>

<PRE>template&lt;class Key, class Pr, class Alloc&gt;
    void <B>swap</B>(
        multiset &lt;Key, Pr, Alloc&gt;&amp; left,
        multiset &lt;Key, Pr, Alloc&gt;&amp; right);
template&lt;class Key, class Pr, class Alloc&gt;
    void <B>swap</B>(
        set &lt;Key, Pr, Alloc&gt;&amp; left,
        set &lt;Key, Pr, Alloc&gt;&amp; right);</PRE>

<P>The template function executes
<CODE>left.<A HREF="#set::swap">swap</A>(right)</CODE>.</P>

<HR>
<P>See also the
<B><A HREF="index.html#Table of Contents">Table of Contents</A></B> and the
<B><A HREF="_index.html">Index</A></B>.</P>

<P><I>
<A HREF="crit_pjp.html">Copyright</A> &#169; 1994-2002
by P.J. Plauger. Portions derived from work
<A HREF="crit_hp.html">copyright</A> &#169; 1994
by Hewlett-Packard Company. All rights reserved.</I></P>

<!--V4.01:1125--></BODY></HTML>