青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品

C++ Programmer's Cookbook

{C++ 基礎} {C++ 高級} {C#界面,C++核心算法} {設計模式} {C#基礎}

stl中的algorithms真是強!我能想到的算法都有啊!

對容器中的元素:排序,查找,替換,分段,求和 。。。。。。。swap  ratate  sort  search   merge  range copy 。。。。。。。。。太多拉,說不完啊,希望那位有所有函數(shù)的列表啊,給一個吧,找的時候好找啊!看看下面的有沒有見過啊!

#include <iostream>

#include <algorithm>

#include <string>

using namespace std;

 

int main()

{

    copy (istream_iterator<string>(cin),         // beginning of source

          istream_iterator<string>(),            // end of source

          ostream_iterator<string>(cout,"\n"));  // destination

}

 

#include <cstdlib>

#include "algostuff.hpp"

using namespace std;

 

class MyRandom {

  public:

    ptrdiff_t operator() (ptrdiff_t max) {

        double tmp;

        tmp = static_cast<double>(rand())

                / static_cast<double>(RAND_MAX);

        return static_cast<ptrdiff_t>(tmp * max);

    }

};

 

int main()

{

    vector<int> coll;

 

    INSERT_ELEMENTS(coll,1,20);

    PRINT_ELEMENTS(coll,"coll:     ");

 

    // shuffle all elements randomly

    random_shuffle (coll.begin(), coll.end());

 

    PRINT_ELEMENTS(coll,"shuffled: ");

 

    // sort them again

    sort (coll.begin(), coll.end());

    PRINT_ELEMENTS(coll,"sorted:   ");

 

    /* shuffle elements with self-written random number generator

     * - to pass an lvalue we have to use a temporary object

     */

    MyRandom rd;

    random_shuffle (coll.begin(), coll.end(),    // range

                    rd);                 // random number generator

 

    PRINT_ELEMENTS(coll,"shuffled: ");

}

 

#include "algostuff.hpp"

using namespace std;

 

// checks whether an element is even or odd

bool checkEven (int elem, bool even)

{

    if (even) {

        return elem % 2 == 0;

    }

    else {

        return elem % 2 == 1;

    }

}

 

int main()

{

    vector<int> coll;

 

    INSERT_ELEMENTS(coll,1,9);

    PRINT_ELEMENTS(coll,"coll: ");

 

    /* arguments for checkEven()

     * - check for: ``even odd even''

     */

    bool checkEvenArgs[3] = { true, false, true };

 

    // search first subrange in coll

    vector<int>::iterator pos;

    pos = search (coll.begin(), coll.end(),       // range

                  checkEvenArgs, checkEvenArgs+3, // subrange values

                  checkEven);                     // subrange criterion

 

    // loop while subrange found

    while (pos != coll.end()) {

        // print position of first element

        cout << "subrange found starting with element "

             << distance(coll.begin(),pos) + 1

             << endl;

 

        // search next subrange in coll

        pos = search (++pos, coll.end(),              // range

                      checkEvenArgs, checkEvenArgs+3, // subr. values

                      checkEven);                     // subr. criterion

    }

}

 

#include "algostuff.hpp"

using namespace std;

 

int main()

{

    int c1[] = { 1, 2, 2, 4, 6, 7, 7, 9 };

    int num1 = sizeof(c1) / sizeof(int);

 

    int c2[] = { 2, 2, 2, 3, 6, 6, 8, 9 };

    int num2 = sizeof(c2) / sizeof(int);

 

    // print source ranges

    cout << "c1:                         " ;

    copy (c1, c1+num1,

          ostream_iterator<int>(cout," "));

    cout << endl;

    cout << "c2:                         " ;

    copy (c2, c2+num2,

          ostream_iterator<int>(cout," "));

    cout << '\n' << endl;

 

    // sum the ranges by using merge()

    cout << "merge():                    ";

    merge (c1, c1+num1,

           c2, c2+num2,

           ostream_iterator<int>(cout," "));

    cout << endl;

 

    // unite the ranges by using set_union()

    cout << "set_union():                ";

    set_union (c1, c1+num1,

               c2, c2+num2,

               ostream_iterator<int>(cout," "));

    cout << endl;

 

    // intersect the ranges by using set_intersection()

    cout << "set_intersection():         ";

    set_intersection (c1, c1+num1,

                      c2, c2+num2,

                      ostream_iterator<int>(cout," "));

    cout << endl;

 

    // determine elements of first range without elements of second range

    // by using set_difference()

    cout << "set_difference():           ";

    set_difference (c1, c1+num1,

                    c2, c2+num2,

                    ostream_iterator<int>(cout," "));

    cout << endl;

 

    // determine difference the ranges with set_symmetric_difference()

    cout << "set_symmetric_difference(): ";

    set_symmetric_difference (c1, c1+num1,

                              c2, c2+num2,

                              ostream_iterator<int>(cout," "));

    cout << endl;

}
--------------------------------------------------------
一個簡單的函數(shù)列表:希望給大家查找?guī)矸奖悖碜裕?A >http://www.csci.csusb.edu/dick/samples/stl.algorithms.html

Glossary for the C++ Standard Library

  1. binary_function::=A function that has two arguments f(x,y).
  2. binary_predicate::=a function or function_object that returns a bool value when given two items, used for testing to see if items match, or that they are in order.
  3. function::=Something f that can be called like this f(x) for an argument x.
  4. function_object::=any instance of a class that has defined and operator() and so can be called as if it was a function.
  5. interval::=a range.
  6. iterator::=an object that indicates an item in a container,
  7. iterators::=plutral of iterator.
  8. predicate::=a function or function_object that returns a bool value when given an item.
  9. range::= a sequence of items in a container given by a pair of iterators indicating the beginning and the point after the last one.

    Search


    (find): looks for a value in a range.
    (find_if): looks for items in a range that satisfy a predicate.
    (find_first_of): looks for items in first range that is also in the second range or uses a binary_predicate to find first matching item.
    (find_end): looks backward for items in first range that are not also in the second range or uses a binary_predicate to find first non_matching item.
    (adjacent_find): looks for first pair in range that are equal, or match under a binary_predicate.


    (max): returns larger of two items, possible using a binary_predicate.
    (max_element): finds largest item in a range, may use a binary_predicate. [ timeSelectionSort.cpp ]
    (min): returns larger of two items, possible using a binary_predicate.
    (min_element): finds largest item in a range, may use a binary_predicate.


    (mismatch): search two parallel ranges and returns position of the first one that is unequal or doesn't satisfy a binary_predicate.


    (search): look in first range for an occurrence of the second range, possibly using a binary_predicate.
    (search_n): look in range for an occurrence of n items equal to a value, possibly using a binary_predicate.

    Scan, compare, and count


    (count): scan range and count occurrence of a value.
    (count_if): scan range and count times a predicate is true.
    (equal): test if a range equals, element another parallel range, possibly using a binary_predicate.
    (for_each): Apply a function to every item in a range.

    Copy, Move and swap


    (copy): Copy items in range to another place indicate by its start. There is a surprising way to read and write data to/from an input/output stream by using copy and adapters that give iterators accessing a stream. For example, suppose we have a range [begin, end) ints and want to output them separated by tabs we can write:

     		copy(begin, end, ostream_iterator<int> (cout, "\t") );
    To read ints into a vector v we would write
     		copy(istream_iterator<int>(cin), istream_iterator<int>(), back_inserter(v));


    (copy_backward): Copy items in range to another place indicated by its end.


    (swap): swaps values of two given variables.
    (iter_swap): swaps two items in a container indicated by iterators. Used in [ timeSelectionSort.cpp ] [ timeQuickSort.cpp ]


    (swap_ranges): interchanges value between two ranges.
    (reverse): places the elements in the reverse order.
    (reverse_copy): creates a backwards copy of a range.
    (rotate): given a middle point in a range, reorganizes range so that middle comes first...
    (rotate_copy): creates a rotated copy.


    (partition): takes a range and reorganizes the items so that a predicate is true at first and then false... A key part of QuickSort! [ timeQuickSort.cpp ]
    (stable_partition): takes a range and reorganizes the items so that a predicate is true at first and then false... but in each part the items are still in the same sequence (with some gaps).


    (random_shuffle): shuffles a range, you can supply your own random number generator.

    Change and Delete


    (replace): scan a range and replace given old values by given new value.
    (replace_if): scan a range and replace given old values by given new value IF a predicate is true.
    (replace_copy): make a copy of a range but replace given old values by given new value.
    (replace_copy_if): make a copy of a range but replace given old values by given new value IF a predicate is true.
    (remove): deletes items in a range that equal a given value.
    (remove_if): deletes items in a range if a predicate is true.
    (remove_copy): makes a copy of items in a range but not those with a given value.
    (remove_if): makes a copy of items in a range but not those where a predicate is true.


    (unique): deletes duplicated items, leaves the first. Can use a binary_predicate.
    (unique_copy): copies range but not duplicated items, leaves the first. Can use a binary_predicate.

    Generate and Fill


    (fill): change a range to all have the same given value.
    (fill_n): change n items to all have the same given value.
    (generate): change items in a range to be values produced by a function_object.
    (generate_n): change n items to be values produced by function_object.
    (transform): scans a range and for each use a function to generate a new object put in a second container, OR takes two intervals and applies a binary operation to items to generate a new container.

    Sort


    (sort): reorganize a range to be in order, can use a binary_predicate. For example: [ timeVectorSort.cpp ]

    Also some containers have a sort member function: [ timeListSort.cpp ]


    (stable_sort): like sort but equivalent items are kept in the same sequence.
    (partial_sort): Sorts part of a range.
    (partial_sort_copy): makes a copy of a range but with part sorted.


    (nth_element): Sorts out just the nth element!

    Search, Merge and Permute Sorted Containers


    (binary_search): search a sorted range for a value.
    (lower_bound): finds first place in a sorted range which is not less than a given value.
    (upper_bound): finds first place in a sorted range which is not greater than a given value.
    (equal_range): finds a range that brackets a given value.


    (merge): Combines two sorted ranges to give a new sorted range both all their items.
    (inplace_merge): Combines two sorted halves of a range to give a sorted range both all their items. [ timeMergeSort.cpp ]


    (next_permutation): permutes items in a range... will generate each possible order once until it returns false.
    (prev_permutation): undoes next_permutation

    Set Operations: union, intersection, complement,...

    [ timeMultisetSort.cpp ]


    (includes): set theoretic test.
    (set_union ): set theoretic operation.
    (set_intersection): set theoretic operation.
    (set_difference): set theoretic operation.
    (set_symmetric_difference): set theoretic operation.

    Numeric algorithms


    (accumulate): adds up items in range starting with given initial value, can also do any binary operation if it is given as an function of two arguments(binary_function).Used to code the math \Sigma and \Pi symbols.
    (inner_product): the heart of linear algebra, but can be generalized to do other things by supplying two binary_function s.
    (partial_sum): scans range and replaces items by sum so far, can use general binary_function.
    (adjacent_difference): Scans range and replace items by differences

    Heaps

    The big lumps rise to the top. Seriously! A heap is an array of vector where the first item is always the biggest tiem. Further, the next two smallest items are in the second and third places. After the second you have the fourth and fithf, and after the third the sixth and seventh. As a rule the n'th item is larger than the 2*n'th and (2*n+1)'th items. For more take CSCI330 Data Structures.


    (make_heap): rearranges a range so that it becomes a heap.
    (sort_heap): takes a heap and creates a sorted container from it (by popping items).

    Combining make_heap and sort_heap gives a pretty good [O(n log n)] sort: [ timeHeapSort.cpp ]


    (push_heap): puts a new element into a heap and rearranges it to still be a heap.
    (pop_heap): removes the top/largest element and rearranges to leave a heap behind.

    Examples of use

    [ http://www.csci.csusb.edu/dick/examples/ ]

posted on 2005-12-16 17:01 夢在天涯 閱讀(3591) 評論(5)  編輯 收藏 引用 所屬分類: STL/Boost

評論

# re: stl中的algorithms真是強!我能想到的算法都有啊! 2005-12-17 01:21 redbox

速度有點慢  回復  更多評論   

# re: stl中的algorithms真是強!我能想到的算法都有啊! 2005-12-19 08:53 夢在天涯

妳是說stl中的算法的速度慢嗎?

但是對于一般的問題我覺的都可以滿足的吧!

^_^!~~·  回復  更多評論   

# re: stl中的algorithms真是強!我能想到的算法都有啊! 2008-03-27 18:36 匿名

提示錯誤 can't find "algostuff.hpp",請問是怎么回事啊?  回復  更多評論   

# re: stl中的algorithms真是強!我能想到的算法都有啊! 2008-07-28 11:38 21

不知道就別難說,誰說慢了
  回復  更多評論   

# re: stl中的algorithms真是強!我能想到的算法都有啊! 2008-12-13 12:12 zmm

通過在MSDN中查找其中一個函數(shù)(比如find),然后點擊與目錄同步也可以看到algorithm庫中的所以算法。  回復  更多評論   

公告

EMail:itech001#126.com

導航

統(tǒng)計

  • 隨筆 - 461
  • 文章 - 4
  • 評論 - 746
  • 引用 - 0

常用鏈接

隨筆分類

隨筆檔案

收藏夾

Blogs

c#(csharp)

C++(cpp)

Enlish

Forums(bbs)

My self

Often go

Useful Webs

Xml/Uml/html

搜索

  •  

積分與排名

  • 積分 - 1811754
  • 排名 - 5

最新評論

閱讀排行榜

青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品
  • <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
      <noscript id="pjuwb"></noscript>
            <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
              <dd id="pjuwb"></dd>
              <abbr id="pjuwb"></abbr>
              欧美日韩p片| 欧美不卡在线视频| 午夜精品久久久久久久久久久| av成人毛片| 欧美小视频在线观看| 亚洲欧美日韩精品综合在线观看| 午夜在线一区二区| 欧美一级欧美一级在线播放| 欧美成人午夜免费视在线看片 | 久久人人97超碰国产公开结果 | 亚洲视频综合| 亚洲视频综合| 欧美成人中文字幕| 国产日韩欧美成人| 免费成人你懂的| 欧美激情影音先锋| 亚洲欧美国产视频| 久久人人97超碰精品888| 亚洲激情在线播放| 亚洲午夜久久久| 伊人成人在线视频| 99re成人精品视频| 激情久久久久久久久久久久久久久久| 亚洲视频免费看| 欧美一级专区| 日韩小视频在线观看| 欧美1区视频| 欧美日韩精品在线观看| 久久久久久网址| 欧美日韩一区二区三区在线看 | 欧美日韩三级| 亚洲精品日韩在线观看| 一本色道久久综合狠狠躁篇的优点 | 亚洲黄色有码视频| 国产精品久久久久久亚洲调教| 亚洲激情网站免费观看| 99精品视频免费观看| 欧美人牲a欧美精品| 久久精品水蜜桃av综合天堂| 欧美另类一区二区三区| 美日韩精品免费观看视频| 欧美视频在线观看一区二区| 欧美激情久久久久久| 国产在线成人| 亚洲主播在线播放| 国产午夜精品久久久| 91久久亚洲| 亚洲欧洲日本国产| 久久性色av| 久久综合色天天久久综合图片| 久久精品在线播放| 欧美专区在线播放| 国产精品美女久久福利网站| 亚洲美女在线看| 亚洲美女在线国产| 欧美黄色一级视频| 亚洲福利国产| 亚洲国产一区二区三区青草影视| 亚洲电影激情视频网站| 狠狠色综合网| 久久久国产一区二区三区| 久久久精品国产99久久精品芒果| 久久成人精品无人区| 午夜视频在线观看一区二区| 欧美午夜片欧美片在线观看| 欧美第一黄网免费网站| 久久女同精品一区二区| 黄色成人精品网站| 久久久夜夜夜| 9久草视频在线视频精品| 在线一区二区三区四区五区| 国产伦精品一区二区三区在线观看 | 久久国产色av| 国产精品久久午夜| 亚洲女优在线| 久久久亚洲高清| 欧美日本在线一区| 日韩网站在线| 欧美一级在线播放| 国产中文一区| 一区二区三区成人精品| 亚洲一区二区欧美日韩| 国产精品一区在线观看你懂的| 亚洲第一区在线观看| 亚洲精品一区久久久久久| 欧美日韩国产综合视频在线观看中文| 久久成人精品无人区| 伊人久久大香线蕉综合热线| 欧美电影在线观看完整版| 在线一区二区日韩| 99re66热这里只有精品4| 欧美日韩亚洲网| 欧美淫片网站| 亚洲国产天堂久久综合网| 欧美日韩一区在线视频| 亚洲激情不卡| 国产精品日日摸夜夜添夜夜av | 亚洲免费电影在线| 久久久噜噜噜久久狠狠50岁| 亚洲欧美一区二区激情| 国产在线拍偷自揄拍精品| 欧美二区不卡| 欧美亚洲一区二区在线观看| 亚洲大胆av| 欧美一区二区三区久久精品| 欧美视频免费在线| 欧美中在线观看| 99精品99| 亚洲一区二区三区在线观看视频| 久久久www成人免费无遮挡大片| 亚洲天堂男人| 今天的高清视频免费播放成人 | 久久久国产一区二区| 亚洲美女淫视频| 在线精品亚洲| 国产亚洲欧洲| 欧美午夜在线视频| 蜜臀久久99精品久久久画质超高清| 免费看亚洲片| 欧美日韩国产探花| 欧美一级免费视频| 亚洲深夜影院| 亚洲肉体裸体xxxx137| 久久视频精品在线| 欧美呦呦网站| 亚洲午夜高清视频| 欧美日韩中文字幕综合视频| 欧美在线三级| 午夜欧美精品| 午夜视频在线观看一区二区三区| 久久www免费人成看片高清| 一区二区欧美在线| 亚洲精品久久久久久久久久久久久| 欧美成人免费一级人片100| 久久精品论坛| 久久久久成人精品| 久久久噜噜噜| 久久人人看视频| 久久九九全国免费精品观看| 久久国产精品第一页| 欧美在线观看一区二区三区| 午夜精品亚洲一区二区三区嫩草| 久久亚洲色图| 久久久久久久综合| 久久久久久999| 久久在线免费观看视频| 久久久人成影片一区二区三区| 亚洲理论在线观看| 亚洲破处大片| 99综合视频| 亚洲女人天堂av| 在线观看福利一区| 亚洲激情校园春色| 一区二区三区欧美在线| 亚洲天堂久久| 亚洲国产精品一区二区三区| 欧美日韩综合视频| 欧美性感一类影片在线播放| 国产精品免费小视频| 久久综合九色99| 欧美激情性爽国产精品17p| 欧美日韩国产a| 国产精品一区二区三区成人| 久久青草欧美一区二区三区| 久久精品国产精品亚洲| 美女黄色成人网| 欧美日韩一二区| 久久久亚洲午夜电影| 欧美精品在线视频观看| 国产精品ⅴa在线观看h| 免费黄网站欧美| 欧美日韩亚洲天堂| 狠狠综合久久av一区二区小说| 欧美日韩视频一区二区三区| 国产精品狼人久久影院观看方式| 欧美成人高清| 国产精品久久久久国产a级| 久久综合九色综合久99| 性欧美大战久久久久久久久| 久久这里只精品最新地址| 欧美日韩视频在线第一区| 国产亚洲人成网站在线观看 | 欧美在线3区| 欧美va天堂在线| 久久这里有精品视频| 欧美视频观看一区| 极品少妇一区二区三区| 亚洲无线一线二线三线区别av| 一区二区三区中文在线观看| 国产精品美女www爽爽爽| 激情欧美丁香| 性一交一乱一区二区洋洋av| 欧美护士18xxxxhd| 欧美在线视频不卡| 国产精品成人观看视频免费 | 亚洲制服少妇| 欧美激情2020午夜免费观看| 国产字幕视频一区二区| 国模套图日韩精品一区二区| 亚洲少妇自拍|