STL（2）find函数

最新推荐文章于 2024-02-24 17:01:50 发布

指尖热度

最新推荐文章于 2024-02-24 17:01:50 发布

阅读量1k

点赞数

CC 4.0 BY-SA版权

分类专栏： STL C++编程

本文链接：https://blog.youkuaiyun.com/sunboyiris/article/details/16879481

C++编程同时被 2 个专栏收录

123 篇文章

订阅专栏

STL

21 篇文章

订阅专栏

本文展示了一个使用C++标准库中的查找算法(find)来搜索列表中特定元素的例子，并演示了如何利用迭代器进行计数及查找指定数值的过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include "stdafx.h"

/*
// TEMPLATE FUNCTION find
template<class _InIt, class _Ty>
inline
	_InIt _Find(_InIt _First, _InIt _Last, const _Ty& _Val)
	{	// find first matching _Val
	_DEBUG_RANGE(_First, _Last);
	for (; _First != _Last; ++_First)
		if (*_First == _Val)
			break;
	return (_First);
	}

inline const char *_Find(const char *_First, const char *_Last, int _Val)
	{	// find first char that matches _Val
	_DEBUG_RANGE(_First, _Last);
	_First = (const char *)::memchr(_First, _Val, _Last - _First);
	return (_First == 0 ? _Last : _First);
	}

inline const signed char *_Find(const signed char *_First,
	const signed char *_Last, int _Val)
	{	// find first signed char that matches _Val
	_DEBUG_RANGE(_First, _Last);
	_First = (const signed char *)::memchr(_First, _Val,
		_Last - _First);
	return (_First == 0 ? _Last : _First);
	}

inline const unsigned char *_Find(const unsigned char *_First,
	const unsigned char *_Last, int _Val)
	{	// find first unsigned char that matches _Val
	_DEBUG_RANGE(_First, _Last);
	_First = (const unsigned char *)::memchr(_First, _Val,
		_Last - _First);
	return (_First == 0 ? _Last : _First);
	}

template<class _InIt, class _Ty>
inline
	_InIt find(_InIt _First, _InIt _Last, const _Ty& _Val)
	{	// find first matching _Val
	_ASSIGN_FROM_BASE(_First,
		_Find(_CHECKED_BASE(_First), _CHECKED_BASE(_Last), _Val));
	return (_First);
	}
	*/


//*********************by vincent http://my.youkuaiyun.com/sunboyiris  ************************//
#include "stdafx.h"
#include "algorithm"
#include "list"
#include "iostream"
using namespace std;


int _tmain(int argc, _TCHAR* argv[])
{
	list<int> l;
	for(int i=0;i<10;i++)
	{
	l.push_back(i);
	}
	//引用指针
	int count1=0;
	list<int>::iterator iter;
	for(iter=l.begin();iter!=l.end();iter++)
	{ 
	count1++;
	}
	cout<<count1<<endl;

	
	list<int>::iterator iter1=find(l.begin(),l.end(),9);
	if(iter1!=l.end())
	{
	cout<<"找到元素9"<<endl;
	cout<<"前一个元素为："<<*(--iter1)<<endl;
	}
	return 0;
}