103 lines
3.7 KiB
C++
103 lines
3.7 KiB
C++
#include "stlexam.h"
|
|
#pragma hdrstop
|
|
/**************************************************************************
|
|
*
|
|
* find_end.cpp - Example program for finding a subsequence.
|
|
* See Class Reference Section
|
|
*
|
|
***************************************************************************
|
|
*
|
|
* (c) Copyright 1994, 1998 Rogue Wave Software, Inc.
|
|
* ALL RIGHTS RESERVED
|
|
*
|
|
* The software and information contained herein are proprietary to, and
|
|
* comprise valuable trade secrets of, Rogue Wave Software, Inc., which
|
|
* intends to preserve as trade secrets such software and information.
|
|
* This software is furnished pursuant to a written license agreement and
|
|
* may be used, copied, transmitted, and stored only in accordance with
|
|
* the terms of such license and with the inclusion of the above copyright
|
|
* notice. This software and information or any other copies thereof may
|
|
* not be provided or otherwise made available to any other person.
|
|
*
|
|
* Notwithstanding any other lease or license that may pertain to, or
|
|
* accompany the delivery of, this computer software and information, the
|
|
* rights of the Government regarding its use, reproduction and disclosure
|
|
* are as set forth in Section 52.227-19 of the FARS Computer
|
|
* Software-Restricted Rights clause.
|
|
*
|
|
* Use, duplication, or disclosure by the Government is subject to
|
|
* restrictions as set forth in subparagraph (c)(1)(ii) of the Rights in
|
|
* Technical Data and Computer Software clause at DFARS 252.227-7013.
|
|
* Contractor/Manufacturer is Rogue Wave Software, Inc.,
|
|
* P.O. Box 2328, Corvallis, Oregon 97339.
|
|
*
|
|
* This computer software and information is distributed with "restricted
|
|
* rights." Use, duplication or disclosure is subject to restrictions as
|
|
* set forth in NASA FAR SUP 18-52.227-79 (April 1985) "Commercial
|
|
* Computer Software-Restricted Rights (April 1985)." If the Clause at
|
|
* 18-52.227-74 "Rights in Data General" is specified in the contract,
|
|
* then the "Alternate III" clause applies.
|
|
*
|
|
**************************************************************************/
|
|
#include <vector>
|
|
#include <algorithm>
|
|
#include <functional>
|
|
|
|
#ifdef _RW_STD_IOSTREAM
|
|
#include <iostream>
|
|
#else
|
|
#include <iostream.h>
|
|
#endif
|
|
|
|
int main()
|
|
{
|
|
#ifndef _RWSTD_NO_NAMESPACE
|
|
using namespace std;
|
|
#endif
|
|
|
|
|
|
typedef vector<int,allocator<int> >::iterator iterator;
|
|
int d1[10] = {0,1,6,5,3,2,2,6,5,7};
|
|
int d2[4] = {6,5,0,0};
|
|
//
|
|
// Set up two vectors.
|
|
//
|
|
vector<int,allocator<int> > v1(d1+0, d1+10), v2(d2+0, d2+2);
|
|
//
|
|
// Try both find_first_of variants.
|
|
//
|
|
iterator it1 = find_first_of(v1.begin(), v1.end(), v2.begin(), v2.end());
|
|
|
|
iterator it2 = find_first_of(v1.begin(), v1.end(), v2.begin(), v2.end(), equal_to<int>());
|
|
|
|
//
|
|
// Try both find_end variants.
|
|
//
|
|
iterator it3 = find_end(v1.begin(), v1.end(), v2.begin(), v2.end());
|
|
|
|
iterator it4 = find_end(v1.begin(), v1.end(), v2.begin(), v2.end(), equal_to<int>());
|
|
//
|
|
// Output results of find_first_of.
|
|
// Iterator now points to the first element that matches one of a set of values
|
|
//
|
|
if (it3 == it4 && it1 == it2)
|
|
{
|
|
cout << "For the vectors: ";
|
|
copy(v1.begin(),v1.end(),
|
|
ostream_iterator<int,char,char_traits<char> >(cout," " ));
|
|
cout << " and ";
|
|
copy(v2.begin(),v2.end(),
|
|
ostream_iterator<int,char,char_traits<char> >(cout," " ));
|
|
cout << endl << endl
|
|
<< "both versions of find_first_of point to: " << *it1 << endl;
|
|
//
|
|
// Output results of find_end.
|
|
// Iterator now points to the first element of the last find subsequence.
|
|
//
|
|
cout << endl << endl
|
|
<< "both versions of find_end point to: " << *it3 << endl;
|
|
}
|
|
|
|
return 0;
|
|
}
|