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

📄 functors.html

📁 指导程序员合理、高效的进行标准模板库编程。
💻 HTML
📖 第 1 页 / 共 2 页
字号:
<LI>
 <A href="BinaryPredicate.html">Binary Predicate</A>
</UL>
<UL>
<LI>
 <A href="AdaptableGenerator.html">Adaptable Generator</A>
<LI>
 <A href="AdaptableUnaryFunction.html">Adaptable Unary Function</A>
<LI>
 <A href="AdaptableBinaryFunction.html">Adaptable Binary Function</A>
<LI>
 <A href="AdaptablePredicate.html">Adaptable Predicate</A>
<LI>
 <A href="AdaptableBinaryPredicate.html">Adaptable Binary Predicate</A>
</UL>
<h3>Types</h3>
<UL>
<LI>
<tt><A href="plus.html">plus</A></tt>
<LI>
<tt><A href="minus.html">minus</A></tt>
<LI>
<tt><A href="times.html">multiplies</A></tt> (formerly called <tt>times</tt>)
<LI>
<tt><A href="divides.html">divides</A></tt>
<LI>
<tt><A href="modulus.html">modulus</A></tt>,
<LI>
<tt><A href="negate.html">negate</A></tt>
<LI>
<tt><A href="equal_to.html">equal_to</A></tt>
<LI>
<tt><A href="not_equal_to.html">not_equal_to</A></tt>
<LI>
<tt><A href="greater.html">greater</A></tt>
<LI>
<tt><A href="less.html">less</A></tt>
<LI>
<tt><A href="greater_equal.html">greater_equal</A></tt>
<LI>
<tt><A href="less_equal.html">less_equal</A></tt>,
<LI>
<tt><A href="logical_and.html">logical_and</A></tt>
<LI>
<tt><A href="logical_or.html">logical_or</A></tt>
<LI>
<tt><A href="logical_not.html">logical_not</A></tt>
<LI>
<tt><A href="subtractive_rng.html">subtractive_rng</A></tt>
</UL>
<UL>
<LI>
<tt><A href="identity.html">identity</A></tt>
<LI>
<tt><A href="project1st.html">project1st</A></tt>
<LI>
<tt><A href="project2nd.html">project2nd</A></tt>
<LI>
<tt><A href="select1st.html">select1st</A></tt>
<LI>
<tt><A href="select2nd.html">select2nd</A></tt>
</UL>
<UL>
<LI>
<tt><A href="unary_function.html">unary_function</A></tt>
<LI>
<tt><A href="binary_function.html">binary_function</A></tt>
</UL>
<UL>
<LI>
<tt><A href="unary_compose.html">unary_compose</A></tt>
<LI>
<tt><A href="binary_compose.html">binary_compose</A></tt>
<LI>
<tt><A href="unary_negate.html">unary_negate</A></tt>
<LI>
<tt><A href="binary_negate.html">binary_negate</A></tt>
<LI>
<tt><A href="binder1st.html">binder1st</A></tt>
<LI>
<tt><A href="binder2nd.html">binder2nd</A></tt>
<LI>
<tt><A href="pointer_to_unary_function.html">pointer_to_unary_function</A></tt>
<LI>
<tt><A href="pointer_to_binary_function.html">pointer_to_binary_function</A></tt>
</UL>
<h3>Functions</h3>
<UL>
<LI>
<tt><A href="unary_compose.html">compose1</A></tt>
<LI>
<tt><A href="binary_compose.html">compose2</A></tt>
<LI>
<tt><A href="unary_negate.html">not1</A></tt>
<LI>
<tt><A href="binary_negate.html">not2</A></tt>
<LI>
<tt><A href="binder1st.html">bind1st</A></tt>
<LI>
<tt><A href="binder2nd.html">bind2nd</A></tt>
<LI>
<tt><A href="ptr_fun.html">ptr_fun</A></tt>
</UL>
<h3>Notes</h3>
<P><A name="1">[1]</A>
The reason for the name &quot;adaptable function object&quot; is that
adaptable function objects may be used by function object adaptors.
<P><A name="2">[2]</A>
The <tt><A href="unary_function.html">unary_function</A></tt> and <tt><A href="binary_function.html" tppabs="http://www.sgi.com/Technology/STL/binary_function.shtml">binary_function</A></tt> bases are
similar to the <tt><A href="input_iterator.html">input_iterator</A></tt>, <tt><A href="output_iterator.html" tppabs="http://www.sgi.com/Technology/STL/output_iterator.shtml">output_iterator</A></tt>,
<tt><A href="forward_iterator.html">forward_iterator</A></tt>, <tt><A href="bidirectional_iterator.html" tppabs="http://www.sgi.com/Technology/STL/bidirectional_iterator.shtml">bidirectional_iterator</A></tt>, and
<tt><A href="random_access_iterator.html">random_access_iterator</A></tt> bases: they are completely empty,
and serve only to provide type information.
<P><A name="3">[3]</A>
This is an example of how to use function objects; it is not
the recommended way of calculating the sum of elements in a vector.
The <tt><A href="accumulate.html">accumulate</A></tt> algorithm is a better way of calculating a sum.
<h3>See also</h3>

<HR SIZE="6"> <FONT SIZE="-2"> Copyright &copy; 1996 Silicon Graphics, Inc.
<HR>
<TABLE BORDER=0 WIDTH="100%" >
<TR>
<TD WIDTH="33%"><FONT SIZE=-1><A HREF="index.html" >
STL</A></FONT></TD>

<TD WIDTH="33%">
<CENTER><FONT SIZE=-2>&copy; Copyright 1997-1998 CodeGuru</FONT>&nbsp;</CENTER>
</TD>

<TD WIDTH="34%">
<DIV ALIGN=right><FONT SIZE=-1>Contact : <A HREF="mailto:webmaster@codeguru.com">webmaster@codeguru.com</A>&nbsp;</FONT></DIV>
</TD>
</TR>
</TABLE>
<SCRIPT LANGUAGE="JavaScript" ><!--
var adurl = "/cgi-bin/doubleclick.cgi?";

if( self.adcategory )
	adurl += adcategory;
else
	adurl += "mfc";

if( self.parent.norefreshad )
	parent.norefreshad = false;
else if( validframes )
	parent.frames['ad'].location = adurl;



if( !validframes && nfrm == -1)
{
	var dclkPage = "www.codeguru.com/";
	if( self.adcategory )
		dclkPage += adcategory;
	else 
		dclkPage += "mfc";
//	var random = Math.random();
	document.write('<nolayer><center>');
	document.write('<iframe src="http://ad.doubleclick.net/adi/' + dclkPage + ';ord='
	 + random + '" width=470 height=62 marginwidth=0 marginheight=0 hspace=0 vspace=0 '
	 + 'frameborder=0 scrolling=no bordercolor="#000000">');
	document.write('<a href="http://ad.doubleclick.net/jump/' + dclkPage + ';ord='
	 + random + '">');
	document.write('<img src="http://ad.doubleclick.net/ad/' + dclkPage + ';ord='
	 + random + '" height=60 width=468>' + '</a>');
	document.write('</iframe>');
	document.write('</center></nolayer>');
	document.write('<layer  src="http://ad.doubleclick.net/adl/' + dclkPage + 
	 ';ord=' + random + '"></layer>');
	document.write('<ilayer visibility=hide width=468 height=83></ilayer>');
}

// -->
</SCRIPT> 
<!-- SCRIPT LANGUAGE="JavaScript" SRC="/global/fscript.js">
//
</SCRIPT --> 

<noscript>
<p align="center">
<a href="http://ad.doubleclick.net/jump/www.codeguru.com/cpp;ord=Nupbf9FCY34AAHkKVkA">
<img src="http://ad.doubleclick.net/ad/www.codeguru.com/cpp;ord=Nupbf9FCY34AAHkKVkA"></a>
</p>
</noscript>





</BODY>
</HTML>


⌨️ 快捷键说明

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