锘??xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>&#20037;&#20037;&#20813;&#36153;&#32654;&#22899;&#35270;&#39057;&#44;&#20122;&#27954;&#33394;&#27442;&#20037;&#20037;&#20037;&#32508;&#21512;&#32593;&#44;&#20037;&#20037;&#22269;&#20135;&#31934;&#21697;&#57;&#57;&#31934;&#21697;&#22269;&#20135;&#57;&#56;&#55;</title><link>http://www.shnenglu.com/FongLuo/category/21220.html</link><description>鍛借繍璐熻矗媧楃墝,浣嗘槸鐜╃墝鐨勬槸鎴戜滑鑷繁</description><language>zh-cn</language><lastBuildDate>Tue, 07 Jun 2016 12:31:36 GMT</lastBuildDate><pubDate>Tue, 07 Jun 2016 12:31:36 GMT</pubDate><ttl>60</ttl><item><title>C++ 綆楁硶(STL)</title><link>http://www.shnenglu.com/FongLuo/archive/2008/09/09/61373.html</link><dc:creator>FongLuo</dc:creator><author>FongLuo</author><pubDate>Tue, 09 Sep 2008 05:31:00 GMT</pubDate><guid>http://www.shnenglu.com/FongLuo/archive/2008/09/09/61373.html</guid><wfw:comment>http://www.shnenglu.com/FongLuo/comments/61373.html</wfw:comment><comments>http://www.shnenglu.com/FongLuo/archive/2008/09/09/61373.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/FongLuo/comments/commentRss/61373.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/FongLuo/services/trackbacks/61373.html</trackback:ping><description><![CDATA[<p><a >C/C++ 鍙傝�?/a> &gt;  </p><h5>C++ 綆楁硶(STL)</h5> <p><a >Display all entries</a> for C++ Algorithms on one page, or view entries individually: </p><p><a >accumulate</a><br /><strong>sum up a range of elements</strong><br />姹傚拰錛氱敤鍒濆�間笌鎸囧畾鑼冨洿鍐呯殑鍏冪礌鐩稿姞銆傞噸杞界殑鐗堟湰涓嶅啀鍋氬姞娉曪紝鑰屾槸浼犺繘鏉ョ殑浜屽厓鎿嶄綔絎﹁搴旂敤鍒板厓绱犱笂銆?</p><p><a >adjacent_difference</a><br /><strong>compute the differences between adjacent elements in a range</strong><br />鍒涘緩涓�涓柊搴忓垪錛岃搴忓垪鐨勬瘡涓柊鍊奸兘浠ｈ〃浜嗗綋鍓嶅厓绱犱笌涓婁竴涓厓绱犵殑宸�傞噸杞界増鏈敤鎸囧畾鐨勪簩鍏冩搷浣滆綆楃浉閭誨厓绱犵殑宸�?</p><p><a >adjacent_find</a><br /><strong>finds two items that are adjacent to eachother</strong><br />鍦?鎸囧畾鐨勮寖鍥村唴錛屾煡鎵句竴瀵圭浉閭葷殑閲嶅鍏冪礌錛屽鏋滄壘鍒拌繑鍥炰竴涓?ForwardIterator 錛屾寚鍚戣繖瀵瑰厓绱犵殑絎竴涓厓绱犮�傚惁鍒欒繑鍥?last 銆傞噸杞界増鏈嬌鐢ㄨ緭鍏ョ殑浜屽厓鎿嶄綔絎︿唬鏇跨浉絳夌殑鍒ゆ柇銆?</p><p><a >binary_search</a><br /><strong>determine if an element exists in a certain range</strong><br />鎶樺崐/浜屽垎娉曟煡鎵撅細鍦ㄦ湁搴忓簭鍒椾腑鏌ユ壘 value 錛屽鏋滄壘鍒拌繑鍥?true 銆傞噸杞界殑鐗堟湰浣跨敤鎸囧畾鐨勬瘮杈冨嚱鏁板璞℃垨鑰呭嚱鏁版寚閽堟潵鍒ゆ柇鐩哥瓑銆?</p><p><a >copy</a><br /><strong>copy some range of elements to a new location</strong><br />澶嶅埗搴忓垪銆?</p><p><a >copy_backward</a><br /><strong>copy a range of elements in backwards order</strong><br />闄や簡鍏冪礌浠ョ浉鍙嶇殑欏哄簭琚嫹璐濆錛屽埆鐨勫拰 copy 鐩稿悓銆?</p><p><a >copy_n</a><br /><strong>copy N elements</strong><br />鍙鍒禢涓厓绱犮�?</p><p><a >count</a><br /><strong>return the number of elements matching a given value</strong><br />鍒╃敤絳変簬鎿嶄綔絎︼紝鎶婃爣蹇楄寖鍥寸被鐨勫厓绱犱笌杈撳叆鐨勫�艱繘琛屾瘮杈冿紝騫惰繑鍥炵浉絳夊厓绱犵殑涓暟銆?</p><p><a >count_if</a><br /><strong>return the number of elements for which a predicate is true</strong><br />瀵逛簬鏍囧織鑼冨洿綾葷殑鍏冪礌錛屽簲鐢ㄨ緭鍏ョ殑鎿嶄綔絎︼紝騫惰繑鍥炵粨鏋滀負 true 鐨勬鏁般�?</p><p><a >equal</a><br /><strong>determine if two sets of elements are the same</strong><br />濡傛灉涓や釜搴忓垪鍦ㄨ寖鍥村唴鐨勫厓绱犻兘鐩哥瓑錛屽垯 equal 榪斿洖 true 銆傞噸杞界増鏈嬌鐢ㄨ緭鍏ョ殑鎿嶄綔絎︿唬鏇夸簡榛樿鐨勭瓑浜庢搷浣滅銆?</p><p><a >equal_range</a><br /><strong>search for a range of elements that are all equal to a certain element</strong><br />榪斿洖涓�瀵?iterator 錛岀涓�涓?iterator 琛ㄧず鐢?lower_bound 榪斿洖鐨?iterator 錛岀浜屼釜琛ㄧず鐢?upper_bound 榪斿洖鐨?iterator 鍊箋�?</p><p><a >fill</a><br /><strong>assign a range of elements a certain value</strong><br />濉厖錛氬皢杈撳叆鐨勫�肩殑鎷瘋礉璧嬬粰鑼冨洿鍐呯殑姣忎釜鍏冪礌銆?</p><p><a >fill_n</a><br /><strong>assign a value to some number of elements</strong><br />濉厖錛氬皢杈撳叆鐨勫�艱祴鍊肩粰 first 鍒?frist+n 鑼冨洿鍐呯殑鍏冪礌銆?</p><p><a >find</a><br /><strong>find a value in a given range</strong><br />鏌ユ壘錛氬埄鐢ㄥ簳灞傚厓绱犵殑絳変簬鎿嶄綔絎︼紝瀵硅寖鍥村唴鐨勫厓绱犱笌杈撳叆鐨勫�艱繘琛屾瘮杈冦�傚綋鍖歸厤鏃訛紝緇撴潫鎼滅儲錛岃繑鍥炶鍏冪礌鐨勪竴涓?InputIterator 銆?</p><p><a >find_end</a><br /><strong>find the last sequence of elements in a certain range</strong><br />鏌ユ壘錛氫嬌鐢ㄨ緭鍏ョ殑鍑芥暟鏇夸唬浜嗙瓑浜庢搷浣滅鎵ц浜?find 銆?</p><p><a >find_first_of</a><br /><strong>search for any one of a set of elements</strong><br />鏌ユ壘錛氬湪鑼冨洿鍐呮煡鎵?#8220;鐢辮緭鍏ョ殑鍙﹀涓�涓?iterator 瀵規爣蹇楃殑絎簩涓簭鍒?#8221;鐨勬渶鍚庝竴嬈″嚭鐜般�傞噸杞界増鏈腑浣跨敤浜嗙敤鎴瘋緭鍏ョ殑鎿嶄綔絎︽浛浠ｇ瓑浜庢搷浣溿�?</p><p><a >find_if</a><br /><strong>find the first element for which a certain predicate is true</strong><br />鏌ユ壘錛氬湪鑼冨洿鍐呮煡鎵?#8220;鐢辮緭鍏ョ殑鍙﹀涓�涓?iterator 瀵規爣蹇楃殑絎簩涓簭鍒?#8221;涓殑浠繪剰涓�涓厓绱犵殑絎竴嬈″嚭鐜般�傞噸杞界増鏈腑浣跨敤浜嗙敤鎴瘋嚜瀹氫箟鐨勬搷浣滅銆?</p><p><a >for_each</a><br /><strong>apply a function to a range of elements</strong><br />渚濇瀵硅寖鍥村唴鐨勬墍鏈夊厓绱犳墽琛岃緭鍏ョ殑鍑芥暟銆?</p><p><a >generate</a><br /><strong>saves the result of a function in a range</strong><br />閫氳繃瀵硅緭鍏ョ殑鍑芥暟 gen 鐨勮繛緇皟鐢ㄦ潵濉厖鎸囧畾鐨勮寖鍥淬�?</p><p><a >generate_n</a><br /><strong>saves the result of N applications of a function</strong><br />濉厖 n 涓厓绱犮�?</p><p><a >includes</a><br /><strong>returns true if one set is a subset of another</strong><br />鍒ゆ柇 [first1, last1) 鐨勪竴涓厓绱犳槸鍚﹁鍖呭惈鍦ㄥ彟澶栦竴涓簭鍒椾腑銆備嬌鐢ㄥ簳灞傚厓绱犵殑 &lt;= 鎿嶄綔絎︼紝閲嶈澆鐗堟湰浣跨敤鐢ㄦ埛杈撳叆鐨勫嚱鏁般�?</p><p><a >inner_product</a><br /><strong>compute the inner product of two ranges of elements</strong><br />瀵逛袱涓簭鍒楀仛鍐呯Н ( 瀵瑰簲鐨勫厓绱犵浉涔橈紝鍐嶆眰鍜?) 錛屽茍灝嗗唴縐姞鍒頒竴涓緭鍏ョ殑鐨勫垵濮嬪�間笂銆傞噸杞界増鏈嬌鐢ㄤ簡鐢ㄦ埛瀹氫箟鐨勬搷浣溿�?</p><p><a >inplace_merge</a><br /><strong>merge two ordered ranges in-place</strong><br />鍚堝茍涓や釜鎺掕繃搴忕殑榪炵畫搴忓垪錛岀粨鏋滃簭鍒楄鐩栦簡涓ょ鑼冨洿錛岄噸杞界増鏈嬌鐢ㄨ緭鍏ョ殑鎿嶄綔榪涜鎺掑簭銆?</p><p><a >is_heap</a><br /><strong>returns true if a given range is a heap</strong><br />鍒ゆ柇鎸囧畾鐨勮寖鍥存槸鍚︽槸鏋勬垚涓�涓爢銆?</p><p><a >is_sorted</a><br /><strong>returns true if a range is sorted in ascending order</strong><br />鍒ゆ柇鎸囧畾鐨勮寖鍥存椂鍊欎負鍗囧簭鎺掑垪銆?</p><p><a >iter_swap</a><br /><strong>swaps the elements pointed to by two iterators</strong><br />浜ゆ崲涓や釜 ForwardIterator 鐨勫�箋�?</p><p><a >lexicographical_compare</a><br /><strong>returns true if one range is lexicographically less than another</strong><br />姣旇緝涓や釜搴忓垪(浣跨敤less)銆傞噸杞界増鏈嬌鐢ㄤ簡鐢ㄦ埛鑷畾涔夌殑姣旇緝鎿嶄綔銆?</p><p><a >lexicographical_compare_3way</a><br /><strong>determines if one range is lexicographically less than or greater than another</strong><br />紜畾絎竴涓寖鍥寸殑鍏冪礌錛屽皬浜庢垨鑰呭ぇ浜庡彟涓�涓寖鍥寸殑鍏冪礌銆?br />綾諱技浜巑emcmp鐨勮繑鍥炶鍒欍�?</p><p><a >lower_bound</a><br /><strong>search for the first place that a value can be inserted while preserving order</strong><br />榪斿洖涓�涓?iterator 錛屽畠鎸囧悜鍦ㄨ寖鍥村唴鐨勬湁搴忓簭鍒椾腑鍙互鎻掑叆鎸囧畾鍊艱�屼笉鐮村潖瀹瑰櫒欏哄簭鐨勭涓�涓綅緗�傞噸杞藉嚱鏁頒嬌鐢ㄤ簡鑷畾涔夌殑姣旇緝鎿嶄綔銆?</p><p><a >make_heap</a><br /><strong>creates a heap out of a range of elements</strong><br />鎶婅寖鍥村唴鐨勫厓绱犵敓鎴愪竴涓爢銆傞噸杞界増鏈嬌鐢ㄨ嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >max</a><br /><strong>returns the larger of two elements</strong><br />榪斿洖涓や釜鍏冪礌涓殑杈冨ぇ鐨勪竴涓紝閲嶈澆鐗堟湰浣跨敤浜嗚嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >max_element</a><br /><strong>returns the largest element in a range</strong><br />榪斿洖涓�涓?iterator 錛屾寚鍑哄簭鍒椾腑鏈�澶х殑鍏冪礌銆傞噸杞界増鏈嬌鐢ㄨ嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >merge</a><br /><strong>merge two sorted ranges</strong><br />鍚堝茍涓や釜鏈夊簭搴忓垪錛屽茍瀛樻斁鍒板彟澶栦竴涓簭鍒椾腑銆傞噸杞界増鏈嬌鐢ㄨ嚜瀹氫箟鐨勬瘮杈冦�?</p><p><a >min</a><br /><strong>returns the smaller of two elements</strong><br />綾諱技浜?max 錛屼笉榪囪繑鍥炴渶灝忕殑鍏冪礌銆?</p><p><a >min_element</a><br /><strong>returns the smallest element in a range</strong><br />綾諱技浜?max_element 錛屼笉榪囪繑鍥炴渶灝忕殑鍏冪礌銆?</p><p><a >mismatch</a><br /><strong>finds the first position where two ranges differ</strong><br />騫惰鐨勬瘮杈冧袱涓簭鍒楋紝鎸囧嚭絎竴涓笉鍖歸厤鐨勪綅緗紝瀹冭繑鍥炰竴瀵?iterator 錛屾爣蹇楃涓�涓笉鍖歸厤鐨勫厓绱犱綅緗�傚鏋滈兘鍖歸厤錛岃繑鍥炴瘡涓鍣ㄧ殑 last 銆傞噸杞界増鏈嬌鐢ㄨ嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >next_permutation</a><br /><strong>generates the next greater lexicographic permutation of a range of elements</strong><br />鍙栧嚭褰撳墠鑼冨洿鍐呯殑鎺掑垪錛屽茍灝嗗叾閲嶆柊鎺掑簭涓轟笅涓�涓帓鍒椼�傞噸杞界増鏈嬌鐢ㄨ嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >nth_element</a><br /><strong>put one element in its sorted location and make sure that no elements to its left are greater than any elements to its right</strong><br />灝嗚寖鍥村唴鐨勫簭鍒楅噸鏂版帓搴忥紝浣挎墍鏈夊皬浜庣 n 涓厓绱犵殑鍏冪礌閮藉嚭鐜板湪瀹冨墠闈紝鑰屽ぇ浜庡畠鐨勯兘鍑虹幇鍦ㄥ悗闈紝閲嶈澆鐗堟湰浣跨敤浜嗚嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >partial_sort</a><br /><strong>sort the first N elements of a range</strong><br />瀵規暣涓簭鍒楀仛閮ㄥ垎鎺掑簭錛岃鎺掑簭鍏冪礌鐨勪釜鏁版濂藉彲浠ヨ鏀懼埌鑼冨洿鍐呫�傞噸杞界増鏈嬌鐢ㄨ嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >partial_sort_copy</a><br /><strong>copy and partially sort a range of elements</strong><br />涓?partial_sort 鐩稿悓錛岄櫎浜嗗皢緇忚繃鎺掑簭鐨勫簭鍒楀鍒跺埌鍙﹀涓�涓鍣ㄣ�?</p><p><a >partial_sum</a><br /><strong>compute the partial sum of a range of elements</strong><br />鍒涘緩涓�涓柊鐨勫厓绱犲簭鍒楋紝鍏朵腑姣忎釜鍏冪礌鐨勫�間唬琛ㄤ簡鑼冨洿鍐呰浣嶇疆涔嬪墠鎵�鏈夊厓绱犱箣鍜屻�傞噸杞界増鏈嬌鐢ㄤ簡鑷畾涔夋搷浣滄浛浠ｅ姞娉曘�?</p><p><a >partition</a><br /><strong>divide a range of elements into two groups</strong><br />瀵硅寖鍥村唴鍏冪礌閲嶆柊鎺掑簭錛屼嬌鐢ㄨ緭鍏ョ殑鍑芥暟錛屾妸璁＄畻緇撴灉涓?true 鐨勫厓绱犻兘鏀懼湪緇撴灉涓?false 鐨勫厓绱犱箣鍓嶃�?</p><p><a >pop_heap</a><br /><strong>remove the largest element from a heap</strong><br />騫朵笉鏄湡姝ｇ殑鎶婃渶澶у厓绱犱粠鍫嗕腑寮瑰嚭錛岃�屾槸閲嶆柊鎺掑簭鍫嗐�傚畠鎶?first 鍜?last-1 浜ゆ崲錛岀劧鍚庨噸鏂板仛鎴愪竴涓爢銆傚彲浠ヤ嬌鐢ㄥ鍣ㄧ殑 back 鏉ヨ闂&#8220;寮瑰嚭&#8220;鐨勫厓绱犳垨鑰呬嬌鐢?pop_back 鏉ョ湡姝ｇ殑鍒犻櫎銆傞噸杞界増鏈嬌鐢ㄨ嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >prev_permutation</a><br /><strong>generates the next smaller lexicographic permutation of a range of elements</strong><br />鍙栧嚭鑼冨洿鍐呯殑搴忓垪騫跺皢瀹冮噸鏂版帓搴忎負涓婁竴涓簭鍒椼�傚鏋滀笉瀛樺湪涓婁竴涓簭鍒楀垯榪斿洖 false 銆傞噸杞界増鏈嬌鐢ㄨ嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >push_heap</a><br /><strong>add an element to a heap</strong><br />鍋囪 first 鍒?last-1 鏄竴涓湁鏁堢殑鍫嗭紝瑕佽鍔犲叆鍫嗙殑鍏冪礌鍦ㄤ綅緗?last-1 錛岄噸鏂扮敓鎴愬爢銆傚湪鎸囧悜璇ュ嚱鏁板墠錛屽繀欏誨厛鎶婂厓绱犳彃鍏ュ鍣ㄥ悗銆傞噸杞界増鏈嬌鐢ㄦ寚瀹氱殑姣旇緝銆?</p><p><a >random_sample</a><br /><strong>randomly copy elements from one range to another</strong> </p><p><a >random_sample_n</a><br /><strong>sample N random elements from a range</strong> </p><p><a >random_shuffle</a><br /><strong>randomly re-order elements in some range</strong><br />瀵硅寖鍥村唴鐨勫厓绱犻殢鏈鴻皟鏁存搴忋�傞噸杞界増鏈緭鍏ヤ竴涓殢鏈烘暟浜х敓鎿嶄綔銆?</p><p><a >remove</a><br /><strong>remove elements equal to certain value</strong><br />鍒犻櫎鍦ㄨ寖鍥村唴鐨勬墍鏈夌瓑浜庢寚瀹氱殑鍏冪礌錛屾敞鎰忥紝璇ュ嚱鏁板茍涓嶇湡姝ｅ垹闄ゅ厓绱犮�傚唴緗暟緇勪笉閫傚悎浣跨敤 remove 鍜?remove_if 鍑芥暟銆?</p><p><a >remove_copy</a><br /><strong>copy a range of elements omitting those that match a certian value</strong><br />灝嗘墍鏈変笉鍖歸厤鐨勫厓绱犻兘澶嶅埗鍒頒竴涓寚瀹氬鍣紝榪斿洖鐨?OutputIterator 鎸囧悜琚嫹璐濈殑鏈厓绱犵殑涓嬩竴涓綅緗�?</p><p><a >remove_copy_if</a><br /><strong>create a copy of a range of elements, omitting any for which a predicate is true</strong><br />灝嗘墍鏈変笉鍖歸厤鐨勫厓绱犳嫹璐濆埌涓�涓寚瀹氬鍣ㄣ�?</p><p><a >remove_if</a><br /><strong>remove all elements for which a predicate is true</strong><br />鍒犻櫎鎵�鏈夎寖鍥村唴杈撳叆鎿嶄綔緇撴灉涓?true 鐨勫厓绱犮�?</p><p><a >replace</a><br /><strong>replace every occurrence of some value in a range with another value</strong><br />灝嗚寖鍥村唴鐨勬墍鏈夌瓑浜?old_value 鐨勫厓绱犻兘鐢?new_value 鏇夸唬銆?</p><p><a >replace_copy</a><br /><strong>copy a range, replacing certain elements with new ones</strong><br />涓?replace 綾諱技錛屼笉榪囧皢緇撴灉鍐欏叆鍙﹀涓�涓鍣ㄣ�?</p><p><a >replace_copy_if</a><br /><strong>copy a range of elements, replacing those for which a predicate is true</strong><br />綾諱技涓?replace_if 錛屼笉榪囧皢緇撴灉鍐欏叆鍙﹀涓�涓鍣?</p><p><a >replace_if</a><br /><strong>change the values of elements for which a predicate is true</strong><br />灝嗚寖鍥村唴鐨勬墍鏈夋搷浣滅粨鏋滀負 true 鐨勫厓绱犵敤鏂板�兼浛浠ｃ�?</p><p><a >reverse</a><br /><strong>reverse elements in some range</strong><br />灝嗚寖鍥村唴鍏冪礌閲嶆柊鎸夊弽搴忔帓鍒椼�?</p><p><a >reverse_copy</a><br /><strong>create a copy of a range that is reversed</strong><br />綾諱技涓?reverse 錛屼笉榪囧皢緇撴灉鍐欏叆鍙﹀涓�涓鍣ㄣ�?</p><p><a >rotate</a><br /><strong>move the elements in some range to the left by some amount</strong><br />灝嗚寖鍥村唴鐨勫厓绱犵Щ鍒板鍣ㄦ湯灝撅紝鐢?middle 鎸囧悜鐨勫厓绱犳垚涓哄鍣ㄧ涓�涓厓绱犮�?</p><p><a >rotate_copy</a><br /><strong>copy and rotate a range of elements</strong><br />綾諱技涓?rotate 錛屼笉榪囧皢緇撴灉鍐欏叆鍙﹀涓�涓鍣?</p><p><a >search</a><br /><strong>search for a range of elements</strong><br />緇欏嚭浜嗕袱涓寖鍥達紝榪斿洖涓�涓?iterator 錛屾寚鍚戝湪鑼冨洿鍐呯涓�嬈″嚭鐜板瓙搴忓垪鐨勪綅緗�傞噸杞界増鏈嬌鐢ㄨ嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >search_n</a><br /><strong>search for N consecutive copies of an element in some range</strong><br />鍦ㄨ寖鍥村唴鏌ユ壘 value 鍑虹幇 n 嬈＄殑瀛愬簭鍒椼�傞噸杞界増鏈嬌鐢ㄨ嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >set_difference</a><br /><strong>computes the difference between two sets</strong><br />鏋勯�犱竴涓帓榪囧簭鐨勫簭鍒楋紝鍏朵腑鐨勫厓绱犲嚭鐜板湪絎竴涓簭鍒椾腑錛屼絾鏄笉鍖呭惈鍦ㄧ浜屼釜搴忓垪涓�傞噸杞界増鏈嬌鐢ㄨ嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >set_intersection</a><br /><strong>computes the intersection of two sets</strong><br />鏋勯�犱竴涓帓榪囧簭鐨勫簭鍒楋紝鍏朵腑鐨勫厓绱犲湪涓や釜搴忓垪涓兘瀛樺湪銆傞噸杞界増鏈嬌鐢ㄨ嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >set_symmetric_difference</a><br /><strong>computes the symmetric difference between two sets</strong><br />鏋勯�犱竴涓帓榪囧簭鐨勫簭鍒楋紝鍏朵腑鐨勫厓绱犲湪絎竴涓簭鍒椾腑鍑虹幇錛屼絾鏄笉鍑虹幇鍦ㄧ浜屼釜搴忓垪涓�傞噸杞界増鏈嬌鐢ㄨ嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >set_union</a><br /><strong>computes the union of two sets</strong><br />鏋勯�犱竴涓帓榪囧簭鐨勫簭鍒楋紝瀹冨寘鍚袱涓簭鍒椾腑鐨勬墍鏈夌殑涓嶉噸澶嶅厓绱犮�傞噸杞界増鏈嬌鐢ㄨ嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >sort</a><br /><strong>sort a range into ascending order</strong><br />浠ュ崌搴忛噸鏂版帓鍒楄寖鍥村唴鐨勫厓绱狅紝閲嶈澆鐗堟湰浣跨敤浜嗚嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >sort_heap</a><br /><strong>turns a heap into a sorted range of elements</strong><br />瀵硅寖鍥村唴鐨勫簭鍒楅噸鏂版帓搴忥紝瀹冨亣璁捐搴忓垪鏄釜鏈夊簭鐨勫爢銆傞噸杞界増鏈嬌鐢ㄨ嚜瀹氫箟鐨勬瘮杈冩搷浣溿�?</p><p><a >stable_partition</a><br /><strong>divide elements into two groups while preserving their relative order</strong><br />涓?partition 綾諱技錛屼笉榪囧畠淇濊瘉淇濈暀瀹瑰櫒涓殑鐩稿欏哄簭銆?</p><p><a >stable_sort</a><br /><strong>sort a range of elements while preserving order between equal elements</strong><br />綾諱技涓?sort 錛屼笉榪囦繚鐣欑浉絳夊厓绱犱箣闂寸殑欏哄簭鍏崇郴銆?</p><p><a >swap</a><br /><strong>swap the values of two objects</strong><br />浜ゆ崲瀛樺偍鍦ㄤ袱涓璞′腑鐨勫�箋�?</p><p><a >swap_ranges</a><br /><strong>swaps two ranges of elements</strong><br />灝嗗湪鑼冨洿鍐呯殑鍏冪礌涓庡彟澶栦竴涓簭鍒楃殑鍏冪礌鍊艱繘琛屼氦鎹€�?</p><p><a >transform</a><br /><strong>applies a function to a range of elements</strong><br />灝嗚緭鍏ョ殑鎿嶄綔浣滅敤鍦ㄨ寖鍥村唴鐨勬瘡涓厓绱犱笂錛屽茍浜х敓涓�涓柊鐨勫簭鍒椼�傞噸杞界増鏈皢鎿嶄綔浣滅敤鍦ㄤ竴瀵瑰厓绱犱笂錛屽彟澶栦竴涓厓绱犳潵鑷緭鍏ョ殑鍙﹀涓�涓簭鍒椼�傜粨鏋滆緭鍑哄埌鎸囧畾鐨勫鍣ㄣ�?</p><p><a >unique</a><br /><strong>remove consecutive duplicate elements in a range</strong><br />娓呴櫎搴忓垪涓噸澶嶇殑鍏冪礌錛屽拰 remove 綾諱技錛屽畠涔熶笉鑳界湡姝ｇ殑鍒犻櫎鍏冪礌銆傞噸杞界増鏈嬌鐢ㄤ簡鑷畾涔夌殑鎿嶄綔銆?</p><p><a >unique_copy</a><br /><strong>create a copy of some range of elements that contains no consecutive duplicates</strong><br />綾諱技涓?unique 錛屼笉榪囧畠鎶婄粨鏋滆緭鍑哄埌鍙﹀涓�涓鍣ㄣ�?</p><p><a >upper_bound</a><br /><strong>searches for the last possible location to insert an element into an ordered range</strong><br />榪斿洖涓�涓?iterator 錛屽畠鎸囧悜鍦ㄨ寖鍥村唴鐨勬湁搴忓簭鍒椾腑鎻掑叆 value 鑰屼笉鐮村潖瀹瑰櫒欏哄簭鐨勬渶鍚庝竴涓綅緗紝璇ヤ綅緗爣蹇椾簡涓�涓ぇ浜?value 鐨勫�箋�傞噸杞界増鏈嬌鐢ㄤ簡杈撳叆鐨勬瘮杈冩搷浣溿�?/p><img src ="http://www.shnenglu.com/FongLuo/aggbug/61373.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/FongLuo/" target="_blank">FongLuo</a> 2008-09-09 13:31 <a href="http://www.shnenglu.com/FongLuo/archive/2008/09/09/61373.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item></channel></rss>                                                                                                                              <footer>
<div class="friendship-link">
<p>感谢您访问我们的网站，您可能还对以下资源感兴趣：</p>
<a href="http://www.shnenglu.com/" title="&#31934;&#21697;&#35270;&#39057;&#20037;&#20037;&#20037;&#20037;">&#31934;&#21697;&#35270;&#39057;&#20037;&#20037;&#20037;&#20037;</a>

<div class="friend-links">


</div>
</div>

</footer>

<a href="http://www.176zfblp.cn" target="_blank">国产精品久久久久…</a>|
<a href="http://www.safenote.cn" target="_blank">综合网日日天干夜夜久久</a>|
<a href="http://www.xorfbrt.cn" target="_blank">91精品国产综合久久香蕉
</a>|
<a href="http://www.lc351.cn" target="_blank">午夜精品久久久久久久无码</a>|
<a href="http://www.ggjkb.cn" target="_blank">久久精品国产亚洲精品</a>|
<a href="http://www.jumbo8.cn" target="_blank">人妻丰满?V无码久久不卡</a>|
<a href="http://www.rojie.cn" target="_blank">99久久国产综合精品女同图片</a>|
<a href="http://www.hbguangtao.cn" target="_blank">久久精品中文騷妇女内射</a>|
<a href="http://www.glhv.cn" target="_blank">久久国产免费直播</a>|
<a href="http://www.e8ux.cn" target="_blank">久久w5ww成w人免费</a>|
<a href="http://www.zhe9tao.cn" target="_blank">精品久久人人妻人人做精品</a>|
<a href="http://www.wzwsbz.cn" target="_blank">97精品依人久久久大香线蕉97</a>|
<a href="http://www.exye.cn" target="_blank">欧美激情精品久久久久</a>|
<a href="http://www.cdhjym.cn" target="_blank">亚洲成色www久久网站夜月</a>|
<a href="http://www.n-hao.cn" target="_blank">51久久夜色精品国产</a>|
<a href="http://www.domino111.com.cn" target="_blank">亚洲中文字幕久久精品无码喷水
</a>|
<a href="http://www.jinshengsuliao.cn" target="_blank">久久精品国产精品亜洲毛片</a>|
<a href="http://www.songshuidaojia.cn" target="_blank">欧美精品乱码99久久蜜桃</a>|
<a href="http://www.sdyuyangjixie.cn" target="_blank">丁香五月网久久综合</a>|
<a href="http://www.dgtspcb.com.cn" target="_blank">亚洲国产精品无码久久久秋霞2</a>|
<a href="http://www.linuxls.cn" target="_blank">88久久精品无码一区二区毛片</a>|
<a href="http://www.xiewanliang.cn" target="_blank">国内精品久久久久影院薰衣草
</a>|
<a href="http://www.qdjzx.cn" target="_blank">一本一本久久a久久综合精品蜜桃</a>|
<a href="http://www.anacli.cn" target="_blank">国产V亚洲V天堂无码久久久</a>|
<a href="http://www.6qg.com.cn" target="_blank">亚洲精品tv久久久久</a>|
<a href="http://www.nt52.cn" target="_blank">久久久人妻精品无码一区</a>|
<a href="http://www.the-music-cable.cn" target="_blank">国产精品久久国产精麻豆99网站
</a>|
<a href="http://www.p3gp.cn" target="_blank">久久91亚洲人成电影网站</a>|
<a href="http://www.banburi.cn" target="_blank">一本色道久久88—综合亚洲精品
</a>|
<a href="http://www.kahb.cn" target="_blank">无码人妻精品一区二区三区久久
</a>|
<a href="http://www.ddmir.cn" target="_blank">久久综合九色欧美综合狠狠
</a>|
<a href="http://www.vmtkcxf.cn" target="_blank">综合网日日天干夜夜久久</a>|
<a href="http://www.r3665.cn" target="_blank">国产精品一区二区久久精品涩爱</a>|
<a href="http://www.12530downs.com.cn" target="_blank">亚洲国产成人久久精品动漫</a>|
<a href="http://www.jimoge.cn" target="_blank">国产精品久久久久久福利漫画
</a>|
<a href="http://www.s9990.cn" target="_blank">女人香蕉久久**毛片精品</a>|
<a href="http://www.jvqo.cn" target="_blank">久久青青草原国产精品免费</a>|
<a href="http://www.rezhei.cn" target="_blank">99re久久精品国产首页2020</a>|
<a href="http://www.werro.cn" target="_blank">国内精品久久久久影院优</a>|
<a href="http://www.sme88.cn" target="_blank">狠狠色丁香久久婷婷综</a>|
<a href="http://www.caipusheji2016.cn" target="_blank">免费观看成人久久网免费观看</a>|
<script>
(function(){
    var bp = document.createElement('script');
    var curProtocol = window.location.protocol.split(':')[0];
    if (curProtocol === 'https') {
        bp.src = 'https://zz.bdstatic.com/linksubmit/push.js';
    }
    else {
        bp.src = 'http://push.zhanzhang.baidu.com/push.js';
    }
    var s = document.getElementsByTagName("script")[0];
    s.parentNode.insertBefore(bp, s);
})();
</script>
</body>