⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 generate.html

📁 ISO_C++:C++_STL开发文档
💻 HTML
字号:
<HTML><!--  -- Copyright (c) 1996-1999  -- Silicon Graphics Computer Systems, Inc.  --  -- Permission to use, copy, modify, distribute and sell this software  -- and its documentation for any purpose is hereby granted without fee,  -- provided that the above copyright notice appears in all copies and  -- that both that copyright notice and this permission notice appear  -- in supporting documentation.  Silicon Graphics makes no  -- representations about the suitability of this software for any  -- purpose.  It is provided "as is" without express or implied warranty.  --  -- Copyright (c) 1994  -- Hewlett-Packard Company  --  -- Permission to use, copy, modify, distribute and sell this software  -- and its documentation for any purpose is hereby granted without fee,  -- provided that the above copyright notice appears in all copies and  -- that both that copyright notice and this permission notice appear  -- in supporting documentation.  Hewlett-Packard Company makes no  -- representations about the suitability of this software for any  -- purpose.  It is provided "as is" without express or implied warranty.  --  --><Head><Title>generate</Title><!-- Generated by htmldoc --></HEAD><BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 	ALINK="#ff0000"> <IMG SRC="CorpID.gif"      ALT="SGI" HEIGHT="43" WIDTH="151"> <!--end header--><BR Clear><H1>generate</H1><Table CellPadding=0 CellSpacing=0 width=100%><TR><TD Align=left><Img src = "algorithms.gif" Alt=""   WIDTH = "194"  HEIGHT = "38" ></TD><TD Align=right><Img src = "function.gif" Alt=""   WIDTH = "194"  HEIGHT = "38" ></TD></TR><TR><TD Align=left VAlign=top><b>Category</b>: algorithms</TD><TD Align=right VAlign=top><b>Component type</b>: function</TD></TR></Table><h3>Prototype</h3><pre>template &lt;class <A href="ForwardIterator.html">ForwardIterator</A>, class <A href="Generator.html">Generator</A>&gt;void generate(ForwardIterator first, ForwardIterator last, Generator gen);</pre>                   <h3>Description</h3><tt>Generate</tt> assigns the result of invoking <tt>gen</tt>, a <A href="functors.html">function object</A>that takes no arguments, to each element in the range <tt>[first,last)</tt>. <A href="#1">[1]</A><h3>Definition</h3>Defined in the standard header <A href="algorithm">algorithm</A>, and in the nonstandardbackward-compatibility header <A href="algo.h">algo.h</A>.<h3>Requirements on types</h3><UL><LI><tt>ForwardIterator</tt> is a model of <A href="ForwardIterator.html">Forward Iterator</A>. <A href="#2">[2]</A><LI><tt>ForwardIterator</tt> is mutable.<LI><tt>Generator</tt> is a model of <A href="Generator.html">Generator</A>.<LI><tt>Generator</tt>'s result type is convertible to <tt>ForwardIterator</tt>'s   value type.</UL><h3>Preconditions</h3><UL><LI><tt>[first, last)</tt> is a valid range.</UL><h3>Complexity</h3>Linear.  Exactly <tt>last - first</tt> invocations of <tt>gen</tt>.  <A href="#1">[1]</A><h3>Example</h3>Fill a vector with random numbers, using the standard C library function<tt>rand</tt>.<pre>vector&lt;int&gt; V;...generate(V.begin(), V.end(), rand);</pre><h3>Notes</h3><P><A name="1">[1]</A>The <A href="functors.html">function object</A> <tt>gen</tt> is invoked for each iterator inthe range <tt>[first, last)</tt>, as opposed to just being invoked asingle time outside the loop.  This distinction is importantbecause a <A href="Generator.html">Generator</A> need not return the same result each timeit is invoked; it is permitted to read from a file, refer to andmodify local state, and so on.<P><A name="2">[2]</A>The reason that <tt>generate</tt> requires its argument to be a mutable<A href="ForwardIterator.html">Forward Iterator</A>, rather than just an <A href="OutputIterator.html">Output Iterator</A>, is that it uses a range <tt>[first, last)</tt> of iterators.  There is no sensibleway to describe a range of <A href="OutputIterator.html">Output Iterators</A>, because it isimpossible to compare two <A href="OutputIterator.html">Output Iterators</A> for equality.The <tt><A href="generate_n.html">generate_n</A></tt> algorithm does have an interface that permits use ofan <A href="OutputIterator.html">Output Iterator</A>.<h3>See also</h3><tt><A href="copy.html">copy</A></tt>, <tt><A href="fill.html">fill</A></tt>, <tt><A href="fill_n.html">fill_n</A></tt>, <tt><A href="generate_n.html">generate_n</A></tt>, <tt><A href="iota.html">iota</A></tt><!--start footer--> <HR SIZE="6"><A href="http://www.sgi.com/"><IMG SRC="surf.gif" HEIGHT="54" WIDTH="54"         ALT="[Silicon Surf]"></A><A HREF="index.html"><IMG SRC="stl_home.gif"         HEIGHT="54" WIDTH="54" ALT="[STL Home]"></A><BR><FONT SIZE="-2"><A href="http://www.sgi.com/Misc/sgi_info.html" TARGET="_top">Copyright &copy; 1999 Silicon Graphics, Inc.</A> All Rights Reserved.</FONT><FONT SIZE="-3"><a href="http://www.sgi.com/Misc/external.list.html" TARGET="_top">TrademarkInformation</A></FONT><P></BODY></HTML> 

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -