久久久久国产一区二区三区,亚洲欧美一区二区原创,亚洲一区尤物

酷造

vector

#include <vector>
#include <string>
#include <algorithm>
#include <iterator>
#include <iostream.h>
// #include <iostream>

class GreaterThan {
public:
    GreaterThan( int size = 6 ) : _size( size ){}
    int size() { return _size; }

    bool operator()(const string & s1) {
        return s1.size() > 6;
        }

private:
    int _size;
};

template <class Type>
class PrintElem {
public:
    void operator()( const Type &elem )
    {
        ++_cnt;
        if ( _cnt % 8 == 0 ) { cout << endl; }
        cout << elem << " ";
    }

private:
    static int _cnt;
};

template < class Type >
       int PrintElem<Type>::_cnt = 0;

class LessThan {
public:
    bool operator()(const string & s1, const string & s2 ) {
         return s1.size() < s2.size();
        }
};

typedef vector<string, allocator> textwords;

void process_vocab( vector<textwords, allocator> *pvec )
{
    if ( ! pvec )
         // issue warning message
         return;

    vector< string, allocator > texts;

    vector<textwords, allocator>::iterator iter = pvec->begin();
    for ( ; iter != pvec->end(); ++iter )
              copy( (*iter).begin(), (*iter).end(), back_inserter( texts ));

    // sort the elements of texts
    sort( texts.begin(), texts.end() );
    for_each( texts.begin(), texts.end(), PrintElem<string>() );

    cout << endl << endl;

    // delete all duplicate elements
    vector<string, allocator>::iterator it;
    it = unique( texts.begin(), texts.end() );
    texts.erase( it, texts.end() );
    for_each( texts.begin(), texts.end(), PrintElem<string>() );

    cout << endl << endl;

    stable_sort( texts.begin(), texts.end(), LessThan() );
    for_each( texts.begin(), texts.end(), PrintElem<string>() );

    cout << endl << endl;

    // count number of strings greater than length 6
    int cnt = 0;

    // obsolete form of count -- standard changes this
    count_if( texts.begin(), texts.end(), GreaterThan(), cnt );

    cout << "Number of words greater than length six are "
             << cnt << endl;

    //

    static string rw[] = { "and", "if", "or", "but", "the" };
    vector<string,allocator> remove_words( rw, rw+5 );

    vector<string, allocator>::iterator it2 = remove_words.begin();
    for ( ; it2 != remove_words.end(); ++it2 ) {
        int cnt = 0;
        // obsolete form of count -- standard changes this
            count( texts.begin(), texts.end(), *it2, cnt );

        cout << cnt << " instances removed:  "
                 << (*it2) << endl;

            texts.erase(
                remove(texts.begin(),texts.end(),*it2),
                texts.end()
           );
       }

    cout << endl << endl;
    for_each( texts.begin(), texts.end(), PrintElem<string>() );
}

typedef vector<string,allocator>::difference_type diff_type;
#include <fstream.h>

main()
{
     vector<textwords, allocator> sample;
     vector<string,allocator>       t1, t2;
     string               t1fn, t2fn;

     cout << "text file #1: "; cin >> t1fn;
     cout << "text file #2: "; cin >> t2fn;

     ifstream infile1( t1fn.c_str());
     ifstream infile2( t2fn.c_str());

     istream_iterator< string, diff_type > input_set1( infile1 ), eos;
     istream_iterator< string, diff_type > input_set2( infile2 );

     copy( input_set1, eos, back_inserter( t1 ));
     copy( input_set2, eos, back_inserter( t2 ));

     sample.push_back( t1 ); sample.push_back( t2 );
     process_vocab( &sample );
}

posted on 2009-12-21 00:14 蜜蜂閱讀(221) 評(píng)論(0) 編輯收藏引用所屬分類: VECTOR

只有注冊(cè)用戶登錄后才能發(fā)表評(píng)論。
【推薦】100%開源！大型工業(yè)跨平臺(tái)軟件C++源碼提供，建模，組態(tài)！



網(wǎng)站導(dǎo)航: 博客園 IT新聞 BlogJava 博問 Chat2DB 管理

<

2009年12月

>

日

一

二

三

四

五

六

29

30

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

1

2

3

4

5

6

7

8

9

導(dǎo)航

統(tǒng)計(jì)

隨筆 - 2
文章 - 0
評(píng)論 - 1
引用 - 0

常用鏈接

留言簿

隨筆分類

隨筆檔案

2009年12月 (2)

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

vector

導(dǎo)航

統(tǒng)計(jì)

常用鏈接

留言簿

隨筆分類

隨筆檔案

搜索

最新評(píng)論

閱讀排行榜

評(píng)論排行榜